\", connection.LocalAddr())\n\t\t} else {\n\t\t\tlog.Infof(\"new connection to acraserver: <%v>\", connection.RemoteAddr())\n\t\t}\n\t\tgo server.handleConnection(connection)\n\t}\n}","func (w *WSConnector) OnStart() {\n\tif len(w.onConnectListener) < 1 {\n\t\tpanic(\"onConnectListener() not set.\")\n\t}\n\n\tvar err error\n\tw.listener, err = GetNetListener(w.address, w.certFile, w.keyFile)\n\tif err != nil {\n\t\tcherryLogger.Fatalf(\"Failed to listen: %s\", err.Error())\n\t}\n\n\tif w.certFile == \"\" || w.keyFile == \"\" {\n\t\tcherryLogger.Infof(\"websocket connector listening at address ws://%s\", w.address)\n\t} else {\n\t\tcherryLogger.Infof(\"websocket connector listening at address wss://%s\", w.address)\n\t\tcherryLogger.Infof(\"certFile = %s\", w.certFile)\n\t\tcherryLogger.Infof(\"keyFile = %s\", w.keyFile)\n\t}\n\n\tw.up = &websocket.Upgrader{\n\t\tReadBufferSize: 1024,\n\t\tWriteBufferSize: 1024,\n\t\tCheckOrigin: CheckOrigin,\n\t}\n\n\tdefer w.OnStop()\n\n\t_ = http.Serve(w.listener, w)\n}","func (ms *MarvinServer) Start() {\n\tgo startWebsockets()\n\n\tlog.Printf(\"Started Marvin HTTP Server on %v:%v\\n\", ms.host, ms.port)\n\trouter := createRouter(ms)\n\thttpError := netHTTP.ListenAndServe(ms.host+\":\"+strconv.Itoa(ms.port), router)\n\n\tif httpError != nil {\n\t\tlog.Fatal(httpError)\n\t\treturn\n\t}\n}","func (m ManagedServer) Start(port int, rawPrivateKeys [][]byte, ciphers, macs []string) {\n\tm.lg.InfoD(\"starting-server\", meta{\n\t\t\"port\": port,\n\t\t\"ciphers\": ciphers,\n\t\t\"macs\": macs,\n\t})\n\n\tprivateKeys := []ssh.Signer{}\n\tfor i, rawKey := range rawPrivateKeys {\n\t\tprivateKey, err := ssh.ParsePrivateKey(rawKey)\n\t\tif err != nil {\n\t\t\tm.errorAndAlert(\"private-key-parse\", meta{\"index\": i, \"error\": err.Error()})\n\t\t\tos.Exit(1)\n\t\t}\n\t\tprivateKeys = append(privateKeys, privateKey)\n\t}\n\n\tlistener, err := net.Listen(\"tcp\", fmt.Sprintf(\"0.0.0.0:%v\", port))\n\tproxyList := proxyproto.Listener{Listener: listener}\n\n\tif err != nil {\n\t\tm.errorAndAlert(\"listen-fail\", meta{\n\t\t\t\"msg\": \"failed to open socket\",\n\t\t\t\"error\": err.Error(),\n\t\t\t\"port\": port})\n\t}\n\tm.lg.InfoD(\"listening\", meta{\"address\": proxyList.Addr().String()})\n\n\tfor {\n\t\tnewConn, err := proxyList.Accept()\n\t\tif err != nil {\n\t\t\tm.errorAndAlert(\"listener-accept-fail\", meta{\"error\": err.Error()})\n\t\t\tos.Exit(1)\n\t\t}\n\n\t\tgo func(conn net.Conn) {\n\t\t\tvar driver ServerDriver\n\t\t\tconfig := &ssh.ServerConfig{\n\t\t\t\tConfig: ssh.Config{\n\t\t\t\t\tCiphers: ciphers,\n\t\t\t\t\tMACs: macs,\n\t\t\t\t},\n\t\t\t\tPasswordCallback: func(c ssh.ConnMetadata, pass []byte) (*ssh.Permissions, error) {\n\t\t\t\t\tdriver = m.driverGenerator(LoginRequest{\n\t\t\t\t\t\tUsername: c.User(),\n\t\t\t\t\t\tPassword: string(pass),\n\t\t\t\t\t\tPublicKey: \"\",\n\t\t\t\t\t\tRemoteAddr: c.RemoteAddr(),\n\t\t\t\t\t})\n\t\t\t\t\tif driver == nil {\n\t\t\t\t\t\treturn nil, fmt.Errorf(\"password rejected for %q\", c.User())\n\t\t\t\t\t}\n\t\t\t\t\treturn nil, nil\n\t\t\t\t},\n\t\t\t\tPublicKeyCallback: func(c ssh.ConnMetadata, key ssh.PublicKey) (*ssh.Permissions, error) {\n\t\t\t\t\tdriver = m.driverGenerator(LoginRequest{\n\t\t\t\t\t\tUsername: c.User(),\n\t\t\t\t\t\tPassword: \"\",\n\t\t\t\t\t\tPublicKey: strings.TrimSpace(string(ssh.MarshalAuthorizedKey(key))),\n\t\t\t\t\t\tRemoteAddr: c.RemoteAddr(),\n\t\t\t\t\t})\n\t\t\t\t\tif driver == nil {\n\t\t\t\t\t\treturn nil, fmt.Errorf(\"password rejected for %q\", c.User())\n\t\t\t\t\t}\n\t\t\t\t\treturn nil, nil\n\t\t\t\t},\n\t\t\t}\n\t\t\tfor _, privateKey := range privateKeys {\n\t\t\t\tconfig.AddHostKey(privateKey)\n\t\t\t}\n\n\t\t\t_, newChan, requestChan, err := ssh.NewServerConn(conn, config)\n\t\t\tif err != nil {\n\t\t\t\tif err != io.EOF {\n\t\t\t\t\tm.errorAndAlert(\"handshake-failure\", meta{\"error\": err.Error()})\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tgo ssh.DiscardRequests(requestChan)\n\n\t\t\tfor newChannelRequest := range newChan {\n\t\t\t\tif newChannelRequest.ChannelType() != \"session\" {\n\t\t\t\t\tnewChannelRequest.Reject(ssh.UnknownChannelType, \"unknown channel type\")\n\t\t\t\t\tm.errorAndAlert(\"unknown-channel-type\", meta{\"type\": newChannelRequest.ChannelType()})\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tchannel, requests, err := newChannelRequest.Accept()\n\t\t\t\tif err != nil {\n\t\t\t\t\tif err != io.EOF {\n\t\t\t\t\t\tm.errorAndAlert(\"channel-accept-failure\", meta{\n\t\t\t\t\t\t\t\"err\": err.Error(),\n\t\t\t\t\t\t\t\"type\": newChannelRequest.ChannelType()})\n\t\t\t\t\t}\n\t\t\t\t\treturn\n\t\t\t\t}\n\n\t\t\t\tgo func(in <-chan *ssh.Request) {\n\t\t\t\t\tfor req := range in {\n\t\t\t\t\t\tok := false\n\t\t\t\t\t\tswitch req.Type {\n\t\t\t\t\t\tcase \"subsystem\":\n\t\t\t\t\t\t\tif len(req.Payload) >= 4 {\n\t\t\t\t\t\t\t\t// we reject all SSH requests that are not SFTP\n\t\t\t\t\t\t\t\tif string(req.Payload[4:]) == \"sftp\" {\n\t\t\t\t\t\t\t\t\tok = true\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\treq.Reply(ok, nil)\n\t\t\t\t\t}\n\t\t\t\t}(requests)\n\n\t\t\t\tserver, err := NewServer(channel, driver)\n\t\t\t\tif err != nil {\n\t\t\t\t\tm.errorAndAlert(\"server-creation-err\", meta{\"err\": err.Error()})\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tif err := server.Serve(); err != nil {\n\t\t\t\t\tchannel.Close()\n\t\t\t\t}\n\t\t\t}\n\t\t}(newConn)\n\t}\n}","func (c *wsClient) Start() {\n\trpcsLog.Tracef(\"Starting websocket client %s\", c.addr)\n\n\t// Start processing input and output.\n\tc.wg.Add(3)\n\tgo c.inHandler()\n\tgo c.notificationQueueHandler()\n\tgo c.outHandler()\n}","func (s *Server) Start() error {\n\tlog.Printf(\"Starting server with parent: %s\\n\", s.Parent)\n\tln, err := net.Listen(\"tcp\", s.Address + \":666\")\n\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tfor {\n\t\tconn, _ := ln.Accept()\n\n\t\tlog.Println(\"Got something!\")\n\n\t\tgo s.handleConnection(conn)\n\t}\n\n\treturn nil\n}","func (s *callbackServer) Start(addr string) {\n\ts.server = &http.Server{\n\t\tAddr: addr,\n\t}\n\n\tgo func() {\n\t\tif err := s.server.ListenAndServe(); err != http.ErrServerClosed {\n\t\t\tpanic(err)\n\t\t}\n\t}()\n}","func (c *Client) Start() {\n\tif c.LogError == nil {\n\t\tc.LogError = errorLogger\n\t}\n\tif c.clientStopChan != nil {\n\t\tpanic(\"gorpc.Client: the given client is already started. Call Client.Stop() before calling Client.Start() again!\")\n\t}\n\n\tif c.PendingRequests <= 0 {\n\t\tc.PendingRequests = DefaultPendingMessages\n\t}\n\tif c.FlushDelay == 0 {\n\t\tc.FlushDelay = DefaultFlushDelay\n\t}\n\tif c.RequestTimeout <= 0 {\n\t\tc.RequestTimeout = DefaultRequestTimeout\n\t}\n\tif c.SendBufferSize <= 0 {\n\t\tc.SendBufferSize = DefaultBufferSize\n\t}\n\tif c.RecvBufferSize <= 0 {\n\t\tc.RecvBufferSize = DefaultBufferSize\n\t}\n\n\tc.requestsChan = make(chan *AsyncResult, c.PendingRequests)\n\tc.clientStopChan = make(chan struct{})\n\n\tif c.Conns <= 0 {\n\t\tc.Conns = 1\n\t}\n\tif c.Dial == nil {\n\t\tc.Dial = defaultDial\n\t}\n\n\tfor i := 0; i < c.Conns; i++ {\n\t\tc.stopWg.Add(1)\n\t\tgo clientHandler(c)\n\t}\n}","func startProxies(proxyAppAddr, proxyDeviceAddr, deviceAddr *net.UDPAddr) {\n\ttoDevice := make(chan []byte, 100)\n\tfromDevice := make(chan []byte, 100)\n\n\t//appAddr is autodetected from the first data packet\n\terr := appProxy(proxyAppAddr, \">>\", fromDevice, toDevice)\n\tif err != nil {\n\t\tlog.Fatalln(\"Fail on UPD Server start\", err)\n\t}\n\n\terr = deviceProxy(proxyDeviceAddr, deviceAddr, \"<<\", toDevice, fromDevice)\n\tif err != nil {\n\t\tlog.Fatalln(\"Fail on UPD Client start\", err)\n\t}\n}","func (c *Client) StartListening() {\n\n\t// Set buffer byte array at 512 bytes\n\tbuf := make([]byte, 512)\n\n\t// Loop listening for messages from the client and direct to handler\n\tfor {\n\t\tn, err := c.ws.Read(buf[0:])\n\n\t\t// Error only exists if the connection is broken\n\t\tif err != nil {\n\t\t\tReleaseConnection(c)\n\t\t\terrorMessage := Message{\n\t\t\t\tSenderID: \"System\",\n\t\t\t\tUsername: \"System\",\n\t\t\t\tMessage: fmt.Sprintf(\"%s disconnected\", c.username),\n\t\t\t}\n\t\t\terrorMessage.Post()\n\t\t\tbreak\n\t\t} else {\n\t\t\tHandleInputMessage(c, buf[0:n])\n\t\t}\n\t}\n}","func (server *TaggedServer) Start(forwardAddress string, forwardPort int) {\n\tfor {\n\t\tserver.mutex.Lock()\n\t\tdone := server.done\n\t\tserver.mutex.Unlock()\n\t\tif done {\n\t\t\tbreak\n\t\t}\n\t\tconn, err := server.listener.Accept()\n\t\tif err != nil {\n\t\t\t// handle error\n\t\t\tcontinue\n\t\t}\n\t\taddress := fmt.Sprintf(\"%s:%d\", forwardAddress, forwardPort)\n\t\tgo func() {\n\t\t\tforwardServer, err := net.DialTimeout(\"tcp\", address, 1*time.Second)\n\t\t\tif err != nil {\n\t\t\t\tconn.Close()\n\t\t\t\treturn\n\t\t\t}\n\t\t\tResponse(conn, forwardServer)\n\t\t}()\n\t}\n}","func (tunnel *Tunnel) Start() error {\n\treturn <-tunnel.startAsync()\n}","func (f *TCPForwarder) Start() error {\n\tif f.DB == nil {\n\t\treturn errors.New(\"database is nil\")\n\t}\n\t// If we did not have a listener set directly, spin one up.\n\t// This is the normal path, because we do not set a listener\n\t// in main.go, currently.\n\tif f.L == nil {\n\t\tvar tlsConf tls.Config\n\t\ttlsConf.GetCertificate = f.GetCertificate\n\t\ttlsConf.NextProtos = []string{\"h2\"}\n\t\tlis, err := tls.Listen(\"tcp\", f.Addr, &tlsConf)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tf.L = lis\n\t}\n\tgo func() {\n\t\tfor {\n\t\t\tconn, err := f.L.Accept()\n\t\t\tif err != nil {\n\t\t\t\tif err, ok := err.(net.Error); ok && err.Temporary() {\n\t\t\t\t\tf.logger.Errorf(\"accept err (temporary): %v\", err)\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tf.logger.Errorf(\"accept err: %v\", err)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tctx := context.Background()\n\t\t\tctx, cancel := context.WithTimeout(ctx, 10*time.Second)\n\t\t\tdefer cancel()\n\t\t\tgo f.handleConn(ctx, conn)\n\t\t}\n\t}()\n\n\treturn nil\n}","func (wsServer *WsServer) Start() error {\n\tif atomic.AddInt32(&wsServer.started, 1) != 1 {\n\t\treturn NewRPCError(ErrAlreadyStarted, nil)\n\t}\n\twsServeMux := http.NewServeMux()\n\twsServer.server = &http.Server{\n\t\tHandler: wsServeMux,\n\t\t// Timeout connections which don't complete the initial\n\t\t// handshake within the allowed timeframe.\n\t\tReadTimeout: time.Second * rpcAuthTimeoutSeconds,\n\t}\n\twsServeMux.HandleFunc(\"/\", func(w http.ResponseWriter, r *http.Request) {\n\t\twsServer.handleWsRequest(w, r)\n\t})\n\tfor _, listen := range wsServer.config.WsListenters {\n\t\tgo func(listen net.Listener) {\n\t\t\tLogger.log.Infof(\"RPC Websocket server listening on %s\", listen.Addr())\n\t\t\tgo wsServer.server.Serve(listen)\n\t\t\tLogger.log.Infof(\"RPC Websocket listener done for %s\", listen.Addr())\n\t\t}(listen)\n\t}\n\twsServer.started = 1\n\treturn nil\n}","func (m *Manager) Start(srv *server.TCP) {\n\tm.serverMutex.Lock()\n\tdefer m.serverMutex.Unlock()\n\n\tm.server = srv\n\n\tm.messageWorkerPool.Start()\n\tm.messageRequestWorkerPool.Start()\n}","func (c *ProxyMarketClient) StartWatcher(updatedTime time.Duration) {\n\tgo func() {\n\t\tfor {\n\t\t\tres, err := c.GetProxyListAllByNewest()\n\t\t\tif err != nil {\n\t\t\t\ttime.Sleep(updatedTime * time.Millisecond)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tc.Proxies = res.List.Data\n\t\t\ttime.Sleep(updatedTime * time.Millisecond)\n\t\t}\n\t}()\n}","func (p *ProxyGRPCMock) Start(URL string) error {\n\tif p.GRPCImplementer == nil {\n\t\treturn fmt.Errorf(\"Missing gRPC handler\")\n\t}\n\n\tif p.GRPCRegister == nil {\n\t\treturn fmt.Errorf(\"Missing gRPC registration routine\")\n\t}\n\n\turl, err := url.Parse(URL)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tl, err := net.Listen(url.Scheme, url.Path)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tp.listener = l\n\n\tgrpcServer := grpc.NewServer()\n\tp.GRPCRegister(grpcServer, p.GRPCImplementer)\n\n\tgo func() {\n\t\tgrpcServer.Serve(l)\n\t}()\n\n\treturn nil\n}","func (s *server) Start(stop <-chan struct{}) error {\n\tlistener, err := newListener(s.bindAddress)\n\tif err != nil {\n\t\treturn err\n\t}\n\tserver := http.Server{\n\t\tHandler: s.mux,\n\t}\n\t// Run the server\n\tgo func() {\n\t\tlog.Info(\"starting http server\")\n\t\tif err := server.Serve(listener); err != nil && err != http.ErrServerClosed {\n\t\t\tlog.Error(err, \"http server error\")\n\t\t}\n\t}()\n\n\t// Shutdown the server when stop is close\n\t<-stop\n\treturn server.Shutdown(context.Background())\n}","func (b *Backend) Start() error {\n\tb.dialEventSockLoop()\n\tb.dialCommandSockLoop()\n\n\tvar err error\n\tb.gatewayID, err = b.getGatewayID()\n\tif err != nil {\n\t\treturn errors.Wrap(err, \"get gateway id error\")\n\t}\n\n\tif b.subscribeEventFunc != nil {\n\t\tb.subscribeEventFunc(events.Subscribe{\n\t\t\tSubscribe: true,\n\t\t\tGatewayID: b.gatewayID,\n\t\t})\n\t}\n\n\tgo b.eventLoop()\n\n\treturn nil\n}","func (srv *RPCService) Listen(req *rpc.ListenRequest, stream rpc.StripeCLI_ListenServer) error {\n\tdeviceName, err := srv.cfg.UserCfg.Profile.GetDeviceName()\n\tif err != nil {\n\t\treturn status.Error(codes.Unauthenticated, err.Error())\n\t}\n\n\tkey, err := srv.cfg.UserCfg.Profile.GetAPIKey(req.Live)\n\tif err != nil {\n\t\treturn status.Error(codes.Unauthenticated, err.Error())\n\t}\n\tapiBase, _ := url.Parse(stripe.DefaultAPIBaseURL)\n\n\tlogger := log.StandardLogger()\n\tproxyVisitor := createProxyVisitor(&stream)\n\tproxyOutCh := make(chan websocket.IElement)\n\n\tctx, cancel := context.WithCancel(stream.Context())\n\tdefer cancel()\n\n\tp, err := createProxy(ctx, &proxy.Config{\n\t\tClient: &stripe.Client{\n\t\t\tAPIKey: key,\n\t\t\tBaseURL: apiBase,\n\t\t},\n\t\tDeviceName: deviceName,\n\t\tForwardURL: req.ForwardTo,\n\t\tForwardHeaders: req.Headers,\n\t\tForwardConnectURL: req.ForwardConnectTo,\n\t\tForwardConnectHeaders: req.ConnectHeaders,\n\t\tUseConfiguredWebhooks: req.UseConfiguredWebhooks,\n\t\tWebSocketFeature: webhooksWebSocketFeature,\n\t\tUseLatestAPIVersion: req.Latest,\n\t\tSkipVerify: req.SkipVerify,\n\t\tLog: logger,\n\t\tEvents: req.Events,\n\t\tOutCh: proxyOutCh,\n\n\t\t// Hidden for debugging\n\t\tNoWSS: false,\n\t})\n\n\tif err != nil {\n\t\treturn err\n\t}\n\tgo p.Run(ctx)\n\n\tfor {\n\t\tselect {\n\t\tcase e := <-proxyOutCh:\n\t\t\terr := e.Accept(proxyVisitor)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\tcase <-stream.Context().Done():\n\t\t\treturn stream.Context().Err()\n\t\t}\n\t}\n}","func StartListening() {\n\tlistenAddress := config.Config.HTTP.Address + \":\" + config.Config.HTTP.Port\n\tgo func() {\n\t\tE.Start(listenAddress)\n\t}()\n\n\tlog.Info().Msgf(\"Starting to listening for HTTP requests on %s\", listenAddress)\n}","func (p *Pipe) Start() {\n\tlistener, err := net.Listen(\"tcp\", p.local.String())\n\tif err != nil {\n\t\tlog.Printf(\"listening on %s error.\\n\", err)\n\t\treturn\n\t}\n\tp.listenerMU.Lock()\n\tp.listener = listener\n\tp.listenerMU.Unlock()\n\n\tp.registryID = PipeRegistry().Add(p)\n\n\tlog.Printf(\"listening on %s\\n\", p.local)\n\tfor {\n\t\tselect {\n\t\tcase <-p.terminate:\n\t\t\treturn\n\t\tdefault:\n\t\t\tclient, err := listener.Accept()\n\t\t\tif err != nil {\n\t\t\t\tlog.Println(\"disconnected\")\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tp.clientsMapMU.Lock()\n\t\t\tp.clientsMap[client.RemoteAddr().String()] = client\n\t\t\tp.clientsMapMU.Unlock()\n\t\t\tgo func() {\n\t\t\t\tconn, err := net.Dial(\"tcp\", p.remote.String())\n\t\t\t\tif err != nil {\n\t\t\t\t\tlog.Println(\"remote connection refused\")\n\t\t\t\t\tclient.Close()\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tutils.CopyConnWithOnClose(client, conn, func() {\n\t\t\t\t\tp.clientsMapMU.Lock()\n\t\t\t\t\tdelete(p.clientsMap, client.RemoteAddr().String())\n\t\t\t\t\tp.clientsMapMU.Unlock()\n\t\t\t\t})\n\t\t\t}()\n\t\t}\n\n\t}\n}","func (self *Proxy) StartTLS(cert string, key string) error {\n\n\tself.srv = http.Server{\n\t\tAddr: self.Bind,\n\t\tHandler: self,\n\t}\n\n\tlog.Printf(\"Listening for HTTPs client request at %s.\\n\", self.Bind)\n\n\treturn self.srv.ListenAndServeTLS(cert, key)\n}","func (s *serv) Start() {\n\ts.running = true\n\n\tsem := make(chan byte)\n\n\tgo func() {\n\t\t// Start listening\n\t\ts.listen()\n\t\tsem <- 0\n\t}()\n\n\tgo func() {\n\t\tfor {\n\t\t\tp := <-s.pks\n\t\t\t// Dispatch work\n\t\t\tswitch p.(type) {\n\t\t\tcase *network.MessagePacket:\n\t\t\t\t_ = p.(*network.MessagePacket)\n\t\t\tcase *network.ConnectionPacket:\n\t\t\t\t_ = p.(*network.ConnectionPacket)\n\t\t\tdefault:\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t}()\n\n\t<-sem\n}","func (s *Server) Start() {\n\tdefer (Track(\"Start\", s.log))()\n\tgo s.listen()\n}","func Start() {\n\tfor {\n\t\tselect {\n\t\tcase <-quit:\n\t\t\treturn\n\t\tdefault:\n\t\t\tsockets, _ := poller.Poll(-1)\n\t\t\tfor _, socket := range sockets {\n\t\t\t\tif bytes, err := socket.Socket.RecvMessageBytes(0); err != nil {\n\t\t\t\t\tfmt.Printf(\"Error receiving message from %s: %s\\n\", socket, err)\n\t\t\t\t} else {\n\t\t\t\t\tgo handle(connection.NewMessage(bytes))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func main() {\n\tflag.Parse()\n\n\tproxy := launcher.NewProxy()\n\tif !*quiet {\n\t\tproxy.Logger = os.Stdout\n\t}\n\n\tl, err := net.Listen(\"tcp\", *addr)\n\tif err != nil {\n\t\tutils.E(err)\n\t}\n\n\tfmt.Println(\"Remote control url is\", \"ws://\"+l.Addr().String())\n\n\tsrv := &http.Server{Handler: proxy}\n\tutils.E(srv.Serve(l))\n}","func (er *EventRelay) Start() {\n\t// Start in the background since we don't want to hold up the caller\n\tgo er.connectEventHub()\n}","func (s *Server) Start(ctx context.Context) error {\n\tif err := s.listenAndEndpoint(); err != nil {\n\t\treturn err\n\t}\n\ts.BaseContext = func(net.Listener) context.Context {\n\t\treturn ctx\n\t}\n\tlog.Infof(\"[HTTP] server listening on: %s\", s.lis.Addr().String())\n\tvar err error\n\tif s.tlsConf != nil {\n\t\terr = s.ServeTLS(s.lis, \"\", \"\")\n\t} else {\n\t\terr = s.Serve(s.lis)\n\t}\n\tif !errors.Is(err, http.ErrServerClosed) {\n\t\treturn err\n\t}\n\treturn nil\n}","func RunProxy() {\n\tbuffer := make([]byte, 1500)\n\tfor {\n\t\tn, cliaddr, err := ProxyConn.ReadFromUDP(buffer[0:])\n\t\tif checkreport(1, err) {\n\t\t\tcontinue\n\t\t}\n\n\t\tr := bytes.NewReader(buffer)\n\t\tpublicHeader, err := quic.ParsePublicHeader(r)\n\n\t\t// drop every x-th packet\n\t\tdrop := 11\n\t\tif int(publicHeader.PacketNumber)%drop == 0 {\n\t\t\tVlogf(3, \"Dropping PacketNumber %d\\n\", publicHeader.PacketNumber)\n\t\t\tcontinue\n\t\t}\n\n\t\tVlogf(3, \"<- Connection 0x%x, PacketNumber %d\\n\", publicHeader.ConnectionID, publicHeader.PacketNumber)\n\n\t\tsaddr := cliaddr.String()\n\t\tdlock()\n\t\tconn, found := ClientDict[saddr]\n\t\tif !found {\n\t\t\tconn = NewConnection(ServerAddr, cliaddr)\n\t\t\tif conn == nil {\n\t\t\t\tdunlock()\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tClientDict[saddr] = conn\n\t\t\tdunlock()\n\t\t\tVlogf(2, \"Created new connection for client %s\\n\", saddr)\n\t\t\t// Fire up routine to manage new connection\n\t\t\tgo RunConnection(conn)\n\t\t} else {\n\t\t\tVlogf(5, \"Found connection for client %s\\n\", saddr)\n\t\t\tdunlock()\n\t\t}\n\t\t// Relay to server\n\t\t_, err = conn.ServerConn.Write(buffer[0:n])\n\t\tif checkreport(1, err) {\n\t\t\tcontinue\n\t\t}\n\t}\n}","func (hs *HttpServer) Start() (err error) {\n\t//panic(\"todo - StartServer\")\n\n\t// Start listening to the server port\n\n\t// Accept connection from client\n\n\t// Spawn a go routine to handle request\n\tport := hs.ServerPort\n\thost := \"0.0.0.0\"\n\t//delim := \"/r/n\"\n\tln, err := net.Listen(\"tcp\", host+port)\n\tdefer ln.Close()\n\tif err != nil {\n\t\tlog.Panicln(err)\n\t}\n\tlog.Println(\"Listening to connections at '\"+host+\"' on port\", port)\n\n\tfor {\n\t\tconn, err := ln.Accept()\n\t\tif err != nil{\n\t\t\tlog.Panicln(err)\n\t\t}\n\t\t\n\t\tgo hs.handleConnection(conn)\n\t}\n\n\treturn err\n\n\n}","func (server *TcpServer) Start() error {\n\tfor {\n\t\tconn, err := server.listener.Accept()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tgo server.performCommand(conn)\n\t}\n}","func (wss *WssClientContext) Start() {\n\tfor {\n\n\t\tu := url.URL{\n\t\t\tScheme: \"ws\",\n\t\t\tOpaque: \"\",\n\t\t\tUser: &url.Userinfo{},\n\t\t\tHost: wssConfig.Server + \":\" + strconv.Itoa(wssConfig.Port),\n\t\t\tPath: \"\",\n\t\t\tRawPath: \"\",\n\t\t\tForceQuery: false,\n\t\t\tRawQuery: \"\",\n\t\t\tFragment: \"\",\n\t\t\tRawFragment: \"\",\n\t\t}\n\t\tc, _, err := websocket.DefaultDialer.Dial(u.String(), nil)\n\t\tif err != nil {\n\t\t\tlogger.Errorf(\"Can't access server \")\n\t\t\tcontinue\n\t\t}\n\t\tdefer c.Close()\n\t\t_, msg, err := c.ReadMessage()\n\t\tif err != nil {\n\t\t\tlogger.Errorf(\"Can't read message\")\n\t\t\tcontinue\n\t\t}\n\t\tmsgString := string(msg)\n\t\tlogger.Infof(\"Recieve message: \" + msgString)\n\n\t\ttime.Sleep(time.Duration(3) * time.Second)\n\t}\n}","func (s *Server) Start() {\n\tlog.Infof(\"listening at %s\", s.Server.Addr)\n\tif err := s.ListenAndServeTLS(\"\", \"\"); err != nil {\n\t\tif errors.Is(err, http.ErrServerClosed) {\n\t\t\treturn\n\t\t}\n\t\tlog.Fatal(err)\n\t}\n}","func Start(ctx context.Context, addr string, svc domain.CustomerService) error {\n\ts := newServer(svc)\n\n\tsrv := http.Server{\n\t\tAddr: addr,\n\t\tHandler: handlers.LoggingHandler(os.Stdout, handlers.ProxyHeaders(s.router)),\n\t}\n\n\terrs := make(chan error)\n\tgo func() {\n\t\terrs <- srv.ListenAndServe()\n\t}()\n\n\tselect {\n\tcase err := <-errs:\n\t\treturn err\n\tcase <-ctx.Done():\n\t\tctxShutDown, cancel := context.WithTimeout(context.Background(), 15*time.Second)\n\t\tdefer func() {\n\t\t\tcancel()\n\t\t}()\n\n\t\terr := srv.Shutdown(ctxShutDown)\n\t\tif err != nil && err != http.ErrServerClosed {\n\t\t\treturn err\n\t\t}\n\n\t\treturn nil\n\t}\n}","func (client *Client) ListenAndServe(record *ConnRecord, wsc []*WebSocketClient, address string, onConnected func()) error {\n\tnetListener, err := net.Listen(\"tcp\", address)\n\tif err != nil {\n\t\treturn err\n\t}\n\ttcpl, ok := (netListener).(*net.TCPListener)\n\tif !ok {\n\t\treturn errors.New(\"not a tcp listener\")\n\t}\n\tclient.tcpl = tcpl\n\n\t// 在client刚启动，连上ws server以后要做的事\n\tonConnected()\n\tfor {\n\t\t// 先检查stop 如果已经被close 不再接收新请求\n\t\tselect {\n\t\tcase <-client.stop:\n\t\t\treturn StoppedError\n\t\tdefault:\n\t\t\t// if the channel is still open, continue as normal\n\t\t}\n\n\t\tc, err := tcpl.Accept()\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"tcp accept error: %w\", err)\n\t\t}\n\n\t\tgo func() {\n\t\t\tconn := c.(*net.TCPConn)\n\t\t\t// defer c.Close()\n\t\t\tdefer conn.Close()\n\t\t\t// In reply, we can get proxy type, target address and first send data.\n\t\t\tfirstSendData, proxyType, addr, err := client.Reply(conn)\n\t\t\tif err != nil {\n\t\t\t\tlog.Error(\"reply error: \", err)\n\t\t\t\treturn\n\t\t\t}\n\t\t\t// 在client.Close中使用wait等待\n\t\t\tclient.wgClose.Add(1)\n\t\t\tdefer client.wgClose.Done()\n\n\t\t\tswitch proxyType {\n\t\t\tcase ProxyTypeSocks5:\n\t\t\t\tconn.Write([]byte{0x05, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00})\n\t\t\tcase ProxyTypeHttps:\n\t\t\t\tconn.Write([]byte(\"HTTP/1.0 200 Connection Established\\r\\nProxy-agent: wssocks\\r\\n\\r\\n\"))\n\t\t\t}\n\n\t\t\t// 更新输出区域的连接数据\n\t\t\trecord.Update(ConnStatus{IsNew: true, Address: addr, Type: proxyType})\n\t\t\tdefer record.Update(ConnStatus{IsNew: false, Address: addr, Type: proxyType})\n\n\t\t\t// 检查addr或addr的解析地址是不是私有地址等\n\t\t\tif checkAddrPrivite(addr) {\n\t\t\t\tif err := client.localVisit(conn, firstSendData, addr); err != nil {\n\t\t\t\t\tlog.Error(\"visit error: \", err)\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\t\t\t// 传输数据\n\t\t\t// on connection established, copy data now.\n\t\t\tif err := client.transData(wsc, conn, firstSendData, addr); err != nil {\n\t\t\t\tlog.Error(\"trans error: \", err)\n\t\t\t}\n\t\t}()\n\t}\n}","func (g *GRPC) Start() <-chan bool {\n\tlog.Printf(\"GRPC: %s listening on %d/%d\", g.Backend, g.Port, g.SecurePort)\n\n\texited := make(chan bool)\n\tproto := \"tcp\"\n\n\tgo func() {\n\t\tport := fmt.Sprintf(\":%d\", g.Port)\n\n\t\tln, err := net.Listen(proto, port)\n\t\tif err != nil {\n\t\t\tlog.Fatal()\n\t\t}\n\n\t\ts := grpc.NewServer(DefaultOpts()...)\n\t\tpb.RegisterEchoServiceServer(s, g)\n\t\ts.Serve(ln)\n\n\t\tdefer ln.Close()\n\t\tclose(exited)\n\t}()\n\n\tgo func() {\n\t\tcer, err := tls.LoadX509KeyPair(g.Cert, g.Key)\n\t\tif err != nil {\n\t\t\tlog.Fatal(err)\n\t\t\treturn\n\t\t}\n\n\t\tconfig := &tls.Config{Certificates: []tls.Certificate{cer}}\n\t\tport := fmt.Sprintf(\":%d\", g.SecurePort)\n\t\tln, err := tls.Listen(proto, port, config)\n\t\tif err != nil {\n\t\t\tlog.Fatal(err)\n\t\t\treturn\n\t\t}\n\n\t\ts := grpc.NewServer(DefaultOpts()...)\n\t\tpb.RegisterEchoServiceServer(s, g)\n\t\ts.Serve(ln)\n\n\t\tdefer ln.Close()\n\t\tclose(exited)\n\t}()\n\n\tlog.Print(\"starting gRPC echo service\")\n\treturn exited\n}","func (c *Carnegie) Start() error {\n\tif c.Started {\n\t\treturn nil\n\t}\n\tc.Started = true\n\tgo c.updateCacheLoop()\n\tif certFile, keyFile := c.Config.GetString(\"cert\"), c.Config.GetString(\"key\"); certFile != \"\" && keyFile != \"\" {\n\t\tgo c.Server.ListenAndServeTLS(certFile, keyFile)\n\t}\n\treturn c.Server.ListenAndServe()\n}","func (s *Server) Start() {\n\ts.wrap()\n\n\tgo func() {\n\t\ts.Config.Serve(s.Listener)\n\t}()\n}","func (hs *HttpServer) Start() (err error) {\n\tpanic(\"todo - StartServer\")\n\n\t// Start listening to the server port\n\n\t// Accept connection from client\n\n\t// Spawn a go routine to handle request\n\n}","func (c *WSClient) Start(ctx context.Context) error {\n\tif err := c.dial(); err != nil {\n\t\treturn err\n\t}\n\n\tc.ResponsesCh = make(chan rpctypes.RPCResponse)\n\n\tc.send = make(chan rpctypes.RPCRequest)\n\t// 1 additional error may come from the read/write\n\t// goroutine depending on which failed first.\n\tc.reconnectAfter = make(chan error, 1)\n\t// capacity for 1 request. a user won't be able to send more because the send\n\t// channel is unbuffered.\n\tc.backlog = make(chan rpctypes.RPCRequest, 1)\n\n\tc.startReadWriteRoutines(ctx)\n\tgo c.reconnectRoutine(ctx)\n\n\treturn nil\n}","func (m *Server) Start() error {\n\tgo func() {\n\t\tif err := http.Serve(m.Listener, m); err != http.ErrServerClosed {\n\t\t\tlog.Printf(\"Unable to listen and serve: %v\", err)\n\t\t}\n\t}()\n\treturn nil\n}","func (irc *IrcCon) Start() {\n\tgo irc.handleIncomingMessages()\n\tgo irc.handleOutgoingMessages()\n\n\tgo func() {\n\t\tunaddr,err := net.ResolveUnixAddr(\"unix\", irc.unixastr)\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tlist,err := net.ListenUnix(\"unix\", unaddr)\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tcon,err := list.AcceptUnix()\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tlist.Close()\n\n\t\tfi,err := irc.con.(*net.TCPConn).File()\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\n\t\terr = sendfd.SendFD(con,fi)\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\n\t\tclose(irc.Incoming)\n\t\tclose(irc.outgoing)\n\t}()\n\n\t// Only register on an initial connection\n\tif !irc.reconnect {\n\t\t//Server registration\n\t\tirc.Send(fmt.Sprintf(\"USER %s 8 * :%s\", irc.nick, irc.nick))\n\t\tirc.Send(fmt.Sprintf(\"NICK %s\", irc.nick))\n\t}\n}","func startListen() {\n\tconfig, err := config.Config()\n\tif err != nil {\n\t\tlog.Log().Error.Println(err)\n\t\tpanic(err)\n\t}\n\tstorage, err := storage.Instance()\n\tif err != nil {\n\t\tlog.Log().Error.Println(err)\n\t}\n\tprefix := config.Prefix\n\tconverter := convert.NewConverter(config.CodeLength, storage)\n\tinternalPort := strconv.Itoa(config.Port)\n\tinternalAddress := \":\" + internalPort\n\tln, err := net.Listen(\"tcp\", internalAddress)\n\tif err != nil {\n\t\tlog.Log().Error.Println(err)\n\t\tpanic(err)\n\t}\n\tdefer ln.Close()\n\tfor {\n\t\tconn, err := ln.Accept()\n\t\tif err != nil {\n\t\t\tlog.Log().Error.Println(err)\n\t\t\treturn\n\t\t}\n\t\tgo handleConnection(conn, converter, prefix)\n\t}\n}","func (s *echoServer) Start() {\n\te := s.Instance\n\n\t// Currently this server is only used for the core API so the logic below\n\t// is fine here. If we need to expand this to be used in multiple locations\n\t// the below can be done via first-class functions\n\te.Pre(middleware.HTTPSRedirect())\n\n\te.Use(middleware.RequestID())\n\te.Use(middleware.Recover())\n\te.Use(middleware.LoggerWithConfig(middleware.LoggerConfig{\n\t\tOutput: logger.Instance().Logger().Writer(),\n\t}))\n\n\trouter.Setup(e)\n\n\tport := utils.GetVariable(consts.API_PORT)\n\tport = fmt.Sprintf(\":%s\", port)\n\n\tcertDir := utils.GetVariable(consts.CERT_DIR)\n\te.Logger.Fatal(e.StartTLS(port,\n\t\tfmt.Sprintf(\"%s/%s\", certDir, utils.GetVariable(consts.API_CERT)),\n\t\tfmt.Sprintf(\"%s/%s\", certDir, utils.GetVariable(consts.API_KEY))))\n}","func (g GrpcServer) Start() {\n\tgo func() {\n\t\tg.errCh <- g.server.Serve(g.listener)\n\t}()\n}","func (c *Connector) Start(addr string) error {\n\n\tconn, err := net.Dial(\"tcp\", addr)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tc.conn = conn\n\n\tgo c.write()\n\n\t// send handshake packet\n\tc.send(hsd)\n\n\tfmt.Println(\"connect ok:\", addr )\n\n\t// read and process network message\n\tgo c.read()\n\n\treturn nil\n}","func (di Dispatcher) Start() {\n\taddr := fmt.Sprintf(\"%s:%d\", di.IP, di.Port)\n\n\terr := http.ListenAndServe(addr, &di)\n\tif err != nil {\n\t\tlogging.Fatalf(\"ListenAndServe: \" + err.Error())\n\t}\n}","func (p *MyProxy) Run(addr string) {\r\n\thttp.ListenAndServe(addr, p)\r\n}","func (serv *webService) Start(ctx context.Context) error {\n\tvar err error\n\tserv.RPC, err = rpchttp.New(fmt.Sprintf(\"http://127.0.0.1:%d\", serv.RPCPort), \"/websocket\")\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tserv.Server = &http.Server{Addr: \":21478\", Handler: serv.Mux}\n\treturn serv.Server.ListenAndServe()\n}","func (s *Server) Start() {\n\tif s.State() != Init {\n\t\ts.log.Errorf(\"server is not in a valid state, want: %q have: %q\", \"NEW\", s.State().String())\n\t\treturn\n\t}\n\n\tlog.WithFields(log.Fields{\n\t\t\"grpc-address\": s.Address(),\n\t\t\"http-address\": s.HTTPAddress(),\n\t}).Infof(\"server starting\")\n\n\tgo s.handleSignals()\n\n\ts.changeState(Starting)\n\n\tgo func() {\n\t\tif err := s.transport.Serve(s.listener); err != nil {\n\t\t\ts.appendErr(err)\n\t\t\ts.changeState(Error)\n\t\t}\n\t}()\n\tif s.httpTransport != nil {\n\t\tgo func() {\n\t\t\tif err := s.httpTransport.Serve(s.httpListener); err != nil {\n\t\t\t\ts.appendErr(err)\n\t\t\t\ts.changeState(Error)\n\t\t\t}\n\t\t}()\n\t}\n}"],"string":"[\n \"func (s *Server) Start() {\\n\\tvar err error\\n\\ts.listener, err = net.Listen(\\\"tcp\\\", s.addr)\\n\\tif err != nil {\\n\\t\\tservLogger.Fatal(err)\\n\\t}\\n\\n if s.credential != \\\"\\\" {\\n servLogger.Infof(\\\"use %s for auth\\\\n\\\", s.credential)\\n }\\n\\tservLogger.Infof(\\\"proxy listen in %s, waiting for connection...\\\\n\\\", s.addr)\\n\\n\\tfor {\\n\\t\\tconn, err := s.listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tservLogger.Error(err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tgo s.newConn(conn).serve()\\n\\t}\\n}\",\n \"func (self *Proxy) Start() error {\\n\\n\\tself.srv = http.Server{\\n\\t\\tAddr: self.Bind,\\n\\t\\tHandler: self,\\n\\t}\\n\\n\\tlog.Printf(\\\"Listening for HTTP client requests at %s.\\\\n\\\", self.Bind)\\n\\n\\treturn self.srv.ListenAndServe()\\n}\",\n \"func (p *Proxy) Start() error {\\n\\tp.Proxy = &tcpproxy.Proxy{}\\n\\n\\tp.Proxy.AddRoute(p.listenAddr, p)\\n\\n\\treturn p.Proxy.Start()\\n}\",\n \"func (client *Client) Start() error {\\n\\tlistenConfig := net.ListenConfig{Control: getControlFunc(client.tcpConfig)}\\n\\tlistener, err := listenConfig.Listen(context.Background(), \\\"tcp\\\", client.conf.BindAddr)\\n\\tif err != nil {\\n\\t\\treturn fmt.Errorf(\\\"net.Listen: %v\\\", err)\\n\\t}\\n\\tdefer listener.Close()\\n\\tclient.listenerLocker.Lock()\\n\\tclient.listener = listener\\n\\tclient.listenerLocker.Unlock()\\n\\tclient.log.Printf(\\\"plugin listen at %s\\\", listener.Addr())\\n\\n\\tfor {\\n\\t\\tleftConn, err := listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn fmt.Errorf(\\\"listener.Accept: %v\\\", err)\\n\\t\\t}\\n\\n\\t\\tgo func() {\\n\\t\\t\\tclient.log.Debugf(\\\"client connection from %s accepted\\\", leftConn.RemoteAddr())\\n\\t\\t\\terr := client.ForwardConn(leftConn)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tclient.log.Errorf(\\\"forward client connection from %s: %v\\\", leftConn.RemoteAddr(), err)\\n\\t\\t\\t}\\n\\t\\t}()\\n\\t}\\n}\",\n \"func (p *Proxy) Start() {\\n\\tlog.WithField(\\\"version\\\", VERSION).Info(\\\"Starting server\\\")\\n\\n\\tconfig := api.DefaultConfig()\\n\\t// Use the same HTTP Client we're using for other things, so we can leverage\\n\\t// it for testing.\\n\\tconfig.HttpClient = p.HTTPClient\\n\\n\\tif p.usingKubernetes {\\n\\t\\tdisc, err := NewKubernetesDiscoverer()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.WithError(err).Error(\\\"Error creating KubernetesDiscoverer\\\")\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tp.Discoverer = disc\\n\\t\\tlog.Info(\\\"Set Kubernetes discoverer\\\")\\n\\t} else if p.usingConsul {\\n\\t\\tdisc, consulErr := NewConsul(config)\\n\\t\\tif consulErr != nil {\\n\\t\\t\\tlog.WithError(consulErr).Error(\\\"Error creating Consul discoverer\\\")\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tp.Discoverer = disc\\n\\t\\tlog.Info(\\\"Set Consul discoverer\\\")\\n\\t}\\n\\n\\tif p.AcceptingForwards && p.ConsulForwardService != \\\"\\\" {\\n\\t\\tp.RefreshDestinations(p.ConsulForwardService, p.ForwardDestinations, &p.ForwardDestinationsMtx)\\n\\t\\tif len(p.ForwardDestinations.Members()) == 0 {\\n\\t\\t\\tlog.WithField(\\\"serviceName\\\", p.ConsulForwardService).Fatal(\\\"Refusing to start with zero destinations for forwarding.\\\")\\n\\t\\t}\\n\\t}\\n\\n\\tif p.AcceptingTraces && p.ConsulTraceService != \\\"\\\" {\\n\\t\\tp.RefreshDestinations(p.ConsulTraceService, p.TraceDestinations, &p.TraceDestinationsMtx)\\n\\t\\tif len(p.ForwardDestinations.Members()) == 0 {\\n\\t\\t\\tlog.WithField(\\\"serviceName\\\", p.ConsulTraceService).Fatal(\\\"Refusing to start with zero destinations for tracing.\\\")\\n\\t\\t}\\n\\t}\\n\\n\\tif p.AcceptingGRPCForwards && p.ConsulForwardGRPCService != \\\"\\\" {\\n\\t\\tp.RefreshDestinations(p.ConsulForwardGRPCService, p.ForwardGRPCDestinations, &p.ForwardGRPCDestinationsMtx)\\n\\t\\tif len(p.ForwardGRPCDestinations.Members()) == 0 {\\n\\t\\t\\tlog.WithField(\\\"serviceName\\\", p.ConsulForwardGRPCService).Fatal(\\\"Refusing to start with zero destinations for forwarding over gRPC.\\\")\\n\\t\\t}\\n\\t\\tp.grpcServer.SetDestinations(p.ForwardGRPCDestinations)\\n\\t}\\n\\n\\tif p.usingConsul || p.usingKubernetes {\\n\\t\\tlog.Info(\\\"Creating service discovery goroutine\\\")\\n\\t\\tgo func() {\\n\\t\\t\\tdefer func() {\\n\\t\\t\\t\\tConsumePanic(p.Sentry, p.TraceClient, p.Hostname, recover())\\n\\t\\t\\t}()\\n\\t\\t\\tticker := time.NewTicker(p.ConsulInterval)\\n\\t\\t\\tfor range ticker.C {\\n\\t\\t\\t\\tlog.WithFields(logrus.Fields{\\n\\t\\t\\t\\t\\t\\\"acceptingForwards\\\": p.AcceptingForwards,\\n\\t\\t\\t\\t\\t\\\"consulForwardService\\\": p.ConsulForwardService,\\n\\t\\t\\t\\t\\t\\\"consulTraceService\\\": p.ConsulTraceService,\\n\\t\\t\\t\\t\\t\\\"consulForwardGRPCService\\\": p.ConsulForwardGRPCService,\\n\\t\\t\\t\\t}).Debug(\\\"About to refresh destinations\\\")\\n\\t\\t\\t\\tif p.AcceptingForwards && p.ConsulForwardService != \\\"\\\" {\\n\\t\\t\\t\\t\\tp.RefreshDestinations(p.ConsulForwardService, p.ForwardDestinations, &p.ForwardDestinationsMtx)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif p.AcceptingTraces && p.ConsulTraceService != \\\"\\\" {\\n\\t\\t\\t\\t\\tp.RefreshDestinations(p.ConsulTraceService, p.TraceDestinations, &p.TraceDestinationsMtx)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif p.AcceptingGRPCForwards && p.ConsulForwardGRPCService != \\\"\\\" {\\n\\t\\t\\t\\t\\tp.RefreshDestinations(p.ConsulForwardGRPCService, p.ForwardGRPCDestinations, &p.ForwardGRPCDestinationsMtx)\\n\\t\\t\\t\\t\\tp.grpcServer.SetDestinations(p.ForwardGRPCDestinations)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}()\\n\\t}\\n\\n\\tgo func() {\\n\\t\\thostname, _ := os.Hostname()\\n\\t\\tdefer func() {\\n\\t\\t\\tConsumePanic(p.Sentry, p.TraceClient, hostname, recover())\\n\\t\\t}()\\n\\t\\tticker := time.NewTicker(p.MetricsInterval)\\n\\t\\tfor {\\n\\t\\t\\tselect {\\n\\t\\t\\tcase <-p.shutdown:\\n\\t\\t\\t\\t// stop flushing on graceful shutdown\\n\\t\\t\\t\\tticker.Stop()\\n\\t\\t\\t\\treturn\\n\\t\\t\\tcase <-ticker.C:\\n\\t\\t\\t\\tp.ReportRuntimeMetrics()\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n}\",\n \"func (p *Proxy) Start() error {\\n\\thttp.Handle(\\\"/\\\", p.handler())\\n\\thttp.Handle(\\\"/client\\\", basicAuthHandler(wakeupHandler))\\n\\n\\treturn http.Serve(p.listener, nil)\\n}\",\n \"func (c *stcprClient) Start() error {\\n\\tif c.connListener != nil {\\n\\t\\treturn ErrAlreadyListening\\n\\t}\\n\\tgo c.serve()\\n\\treturn nil\\n}\",\n \"func (svr *Server) Start() (err error) {\\n\\n\\tfor {\\n\\t\\tcliConn, err := svr.listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\t// save connection\\n\\t\\tsvr.mtx.Lock()\\n\\t\\tsvr.connList.PushBack(cliConn)\\n\\t\\tsvr.mtx.Unlock()\\n\\n\\t\\tsvr.logger.Debug(\\\"Accept new connection\\\", \\\"RemoteAddr\\\", cliConn.RemoteAddr())\\n\\t\\tgo svr.readRequest(cliConn)\\n\\t}\\n}\",\n \"func (p *Proxy) Start() error {\\n\\tp.router.start()\\n\\treturn p.svr.Start(p.doConnection)\\n}\",\n \"func (p *Proxy) Start(ctx context.Context) error {\\n\\twg := &sync.WaitGroup{}\\n\\tdefer func() {\\n\\t\\tc := make(chan struct{})\\n\\t\\tgo func() {\\n\\t\\t\\tdefer close(c)\\n\\t\\t\\twg.Wait()\\n\\t\\t}()\\n\\t\\tselect {\\n\\t\\tcase <-c:\\n\\t\\t\\treturn\\n\\t\\tcase <-time.After(p.shutdownTimeout):\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}()\\n\\tgo func() {\\n\\t\\tselect {\\n\\t\\tcase <-ctx.Done():\\n\\t\\t\\tp.server.Close()\\n\\t\\t}\\n\\t}()\\n\\tfor {\\n\\t\\tconn, err := p.server.AcceptTCP()\\n\\t\\tif err != nil {\\n\\t\\t\\tif ne, ok := err.(net.Error); ok {\\n\\t\\t\\t\\tif ne.Temporary() {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif strings.Contains(err.Error(), \\\"use of closed network connection\\\") {\\n\\t\\t\\t\\tselect {\\n\\t\\t\\t\\tcase <-ctx.Done():\\n\\t\\t\\t\\t\\treturn nil\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t// fallthrough\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tconn.SetNoDelay(true)\\n\\t\\twg.Add(1)\\n\\t\\tgo func(c net.Conn) {\\n\\t\\t\\tdefer wg.Done()\\n\\t\\t\\tp.handleConn(ctx, c)\\n\\t\\t}(conn)\\n\\t}\\n}\",\n \"func (s *Context) Start() error {\\n\\tfor _, cert := range s.cfg.AuthorizedKeys {\\n\\t\\tlog.Printf(\\\"Adding domain %s with addresses %v\\\\n\\\", s.cfg.ServerDomain, cert.Addressess)\\n\\t\\tzmq.AuthAllow(s.cfg.ServerDomain, cert.Addressess...)\\n\\t\\tzmq.AuthCurveAdd(s.cfg.ServerDomain, cert.PublicKey)\\n\\t}\\n\\n\\tif err := s.pulls.Connect(s.cfg.ClientAddress); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tif err := s.pushs.Bind(s.cfg.ListenAddress); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\t// start the relay loop!\\n\\ts.wg.Add(1)\\n\\tgo s.mainloop()\\n\\n\\treturn nil\\n}\",\n \"func (p *proxyImpl) Start() error {\\n\\tif p.sourceListener != nil {\\n\\t\\treturn errors.New(\\\"proxy is already started\\\")\\n\\t}\\n\\tvar err error\\n\\tp.sourceListener, err = net.ListenUnix(p.network, p.source)\\n\\tif err != nil {\\n\\t\\tlogrus.Errorf(\\\"can't listen unix %v\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\tlogrus.Info(\\\"Listening source socket...\\\")\\n\\n\\tp.stopCh = make(chan struct{}, 1)\\n\\tp.errCh = make(chan error, 1)\\n\\n\\tgo func() {\\n\\t\\tp.errCh <- p.proxy()\\n\\t\\tif p.listener != nil {\\n\\t\\t\\tp.listener.OnStopped()\\n\\t\\t}\\n\\t}()\\n\\treturn nil\\n}\",\n \"func (p *ProxyUnixMock) Start(URL string) error {\\n\\tif p.ClientHandler == nil {\\n\\t\\treturn fmt.Errorf(\\\"Missing client handler\\\")\\n\\t}\\n\\n\\turl, err := url.Parse(URL)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tl, err := net.Listen(url.Scheme, url.Path)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tp.listener = l\\n\\n\\tgo func() {\\n\\t\\tdefer func() {\\n\\t\\t\\tl.Close()\\n\\t\\t}()\\n\\n\\t\\tfor {\\n\\t\\t\\tconn, err := l.Accept()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tgo p.ClientHandler(conn)\\n\\t\\t}\\n\\t}()\\n\\n\\treturn nil\\n}\",\n \"func (c *Client) Run() error {\\n\\tc.generateClientID()\\n\\n\\tlistener, err := net.Listen(\\\"tcp\\\", c.ListenAddr)\\n\\tif err != nil {\\n\\t\\treturn fmt.Errorf(\\\"Failed to listen on %s: %s\\\", c.ListenAddr, err)\\n\\t}\\n\\n\\tfmt.Println(\\\"Listening for incoming SOCKS connection...\\\")\\n\\t// accept local connections and tunnel them\\n\\tfor {\\n\\t\\tconn, err := listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Println(\\\"Accept Err:\\\", err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tfmt.Println(\\\"new SOCKS conn\\\", conn.RemoteAddr().String())\\n\\n\\t\\tif !c.connected.IsSet() {\\n\\t\\t\\terr = c.connect()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tfmt.Println(\\\"Failed to connect to tunnel host:\\\", err)\\n\\t\\t\\t\\tconn.Close()\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\t// start watcher which closes when canceled\\n\\t\\t\\tgo c.watchCancel()\\n\\n\\t\\t\\tc.connected.Set(true)\\n\\t\\t}\\n\\n\\t\\tgo c.tunnelConn(conn)\\n\\t}\\n}\",\n \"func (cs *CollectorServer) Start() {\\n\\tfor {\\n\\t\\tconn, err := cs.l.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tcs.log().Printf(\\\"Accept: %s\\\", err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif cs.Debug {\\n\\t\\t\\tcs.log().Printf(\\\"Client %s connected\\\", conn.RemoteAddr())\\n\\t\\t}\\n\\n\\t\\tgo cs.handleConn(conn)\\n\\t}\\n}\",\n \"func (s *server) Start(startWG *sync.WaitGroup) error {\\n\\tvar clientID uint64\\n\\tclientID = 0\\n\\n\\tlistener, err := net.Listen(\\\"tcp\\\", s.listenInterface)\\n\\n\\t// Use proxy protocol listener if it is enabled\\n\\tsc := s.configStore.Load().(ServerConfig)\\n\\tif sc.ProxyProtocolOn {\\n\\t\\tlistener = &proxyproto.Listener{\\n\\t\\t\\tListener: listener,\\n\\t\\t}\\n\\t}\\n\\n\\ts.listener = listener\\n\\tif err != nil {\\n\\t\\tstartWG.Done() // don't wait for me\\n\\t\\ts.state = ServerStateStartError\\n\\t\\treturn fmt.Errorf(\\\"[%s] Cannot listen on port: %s \\\", s.listenInterface, err.Error())\\n\\t}\\n\\n\\ts.log().Infof(\\\"Listening on TCP %s\\\", s.listenInterface)\\n\\ts.state = ServerStateRunning\\n\\tstartWG.Done() // start successful, don't wait for me\\n\\n\\tfor {\\n\\t\\ts.log().Debugf(\\\"[%s] Waiting for a new client. Next Client ID: %d\\\", s.listenInterface, clientID+1)\\n\\t\\tconn, err := listener.Accept()\\n\\t\\tclientID++\\n\\t\\tif err != nil {\\n\\t\\t\\tif e, ok := err.(net.Error); ok && !e.Temporary() {\\n\\t\\t\\t\\ts.log().Infof(\\\"Server [%s] has stopped accepting new clients\\\", s.listenInterface)\\n\\t\\t\\t\\t// the listener has been closed, wait for clients to exit\\n\\t\\t\\t\\ts.log().Infof(\\\"shutting down pool [%s]\\\", s.listenInterface)\\n\\t\\t\\t\\ts.clientPool.ShutdownState()\\n\\t\\t\\t\\ts.clientPool.ShutdownWait()\\n\\t\\t\\t\\ts.state = ServerStateStopped\\n\\t\\t\\t\\ts.closedListener <- true\\n\\t\\t\\t\\treturn nil\\n\\t\\t\\t}\\n\\t\\t\\ts.mainlog().WithError(err).Info(\\\"Temporary error accepting client\\\")\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tgo func(p Poolable, borrowErr error) {\\n\\t\\t\\tc := p.(*client)\\n\\t\\t\\tif borrowErr == nil {\\n\\t\\t\\t\\ts.handleClient(c)\\n\\t\\t\\t\\ts.envelopePool.Return(c.Envelope)\\n\\t\\t\\t\\ts.clientPool.Return(c)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ts.log().WithError(borrowErr).Info(\\\"couldn't borrow a new client\\\")\\n\\t\\t\\t\\t// we could not get a client, so close the connection.\\n\\t\\t\\t\\t_ = conn.Close()\\n\\n\\t\\t\\t}\\n\\t\\t\\t// intentionally placed Borrow in args so that it's called in the\\n\\t\\t\\t// same main goroutine.\\n\\t\\t}(s.clientPool.Borrow(conn, clientID, s.log(), s.envelopePool))\\n\\n\\t}\\n}\",\n \"func (c *Client) Start() {\\n\\tgo c.connection.read()\\n\\tgo c.connection.write()\\n\\n\\tgo c.clientWeb.Run()\\n\\tgo c.Run()\\n}\",\n \"func proxyStart(fromport, toport int, proxyFlag *bool) {\\n\\n\\tproxyaddr := fmt.Sprintf(\\\":%d\\\", fromport)\\n\\n\\tmutex.Lock()\\n\\tdefer mutex.Unlock()\\n\\n\\tproxylistener, err := net.Listen(\\\"tcp\\\", proxyaddr)\\n\\tif err != nil {\\n\\t\\tfmt.Printf(\\\"Unable to listen on: %s, error: %s\\\\n\\\", proxyaddr, err.Error())\\n\\t}\\n\\n\\tdefer println(\\\"port 8000 closed\\\")\\n\\tdefer proxylistener.Close()\\n\\n\\n\\tfor {\\n\\t\\tif *proxyFlag == true {\\n\\t\\t\\tproxyconn, err := proxylistener.Accept()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tfmt.Printf(\\\"Unable to accept a request, error: %s\\\\n\\\", err.Error())\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Read a header firstly in case you could have opportunity to check request\\n\\t\\t\\t// whether to decline or proceed the request\\n\\t\\t\\tbuffer := make([]byte, 1024)\\n\\t\\t\\tn, err := proxyconn.Read(buffer)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tfmt.Printf(\\\"Unable to read from input, error: %s\\\\n\\\", err.Error())\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\ttargetaddr := fmt.Sprintf(\\\"localhost:%d\\\", toport)\\n\\t\\t\\ttargetconn, err := net.Dial(\\\"tcp\\\", targetaddr)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tfmt.Printf(\\\"Unable to connect to: %s, error: %s\\\\n\\\", targetaddr, err.Error())\\n\\t\\t\\t\\tproxyconn.Close()\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tn, err = targetconn.Write(buffer[:n])\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tfmt.Printf(\\\"Unable to write to output, error: %s\\\\n\\\", err.Error())\\n\\t\\t\\t\\tproxyconn.Close()\\n\\t\\t\\t\\ttargetconn.Close()\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tgo proxyRequest(proxyconn, targetconn)\\n\\t\\t\\tgo proxyRequest(targetconn, proxyconn)\\n\\t\\t}else{\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *TestCase) StartProxy() {\\n\\tc.AppServer.GoServe()\\n\\tappAddr := c.AppServer.Addr()\\n\\tclientMeshAddr := util.CurrentMeshAddr()\\n\\tc.ClientMeshAddr = clientMeshAddr\\n\\tcfg := util.CreateProxyMesh(clientMeshAddr, []string{appAddr}, c.AppProtocol)\\n\\tmesh := mosn.NewMosn(cfg)\\n\\tgo mesh.Start()\\n\\tgo func() {\\n\\t\\t<-c.Finish\\n\\t\\tc.AppServer.Close()\\n\\t\\tmesh.Close()\\n\\t\\tc.Finish <- true\\n\\t}()\\n\\ttime.Sleep(5 * time.Second) //wait server and mesh start\\n}\",\n \"func (proxy *proxyService) Start() error {\\n\\tlogger := proxy.logger\\n\\n\\tlogger.Infof(\\\"Starting service\\\")\\n\\n\\tif proxy.done {\\n\\t\\treturn fmt.Errorf(\\\"cannot call Start on stopped ProxyService\\\")\\n\\t}\\n\\n\\t// We need a Go routine here because http.Serve() is blocking, but this\\n\\t// Start() method shouldn't be.\\n\\tgo func() {\\n\\t\\terr := gohttp.Serve(proxy.listener, proxy)\\n\\t\\tif err != nil && !proxy.done {\\n\\t\\t\\tlogger.Errorf(\\\"proxy service failed on server: %s\\\", err)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}()\\n\\n\\treturn nil\\n}\",\n \"func (c Client) Start(ctx context.Context) error {\\n\\tif err := c.connectRemote(c.remoteAddr); err != nil {\\n\\t\\treturn fmt.Errorf(\\\"failed to connect to TCP router server: %w\\\", err)\\n\\t}\\n\\n\\tlog.Info().Msg(\\\"start handshake\\\")\\n\\tif err := c.handshake(); err != nil {\\n\\t\\treturn fmt.Errorf(\\\"failed to handshake with TCP router server: %w\\\", err)\\n\\t}\\n\\tlog.Info().Msg(\\\"handshake done\\\")\\n\\n\\treturn c.listen(ctx)\\n}\",\n \"func (tunnel *SSHtunnel) Start() error {\\n\\tlistener, err := net.Listen(\\\"tcp\\\", tunnel.Local.String())\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tdefer listener.Close()\\n\\n\\tfor {\\n\\t\\tconn, err := listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tgo tunnel.forward(conn)\\n\\t}\\n}\",\n \"func (c *XTestCase) StartProxy() {\\n\\tc.AppServer.GoServe()\\n\\tappAddr := c.AppServer.Addr()\\n\\tclientMeshAddr := util.CurrentMeshAddr()\\n\\tc.ClientMeshAddr = clientMeshAddr\\n\\tcfg := util.CreateXProtocolProxyMesh(clientMeshAddr, []string{appAddr}, c.SubProtocol)\\n\\tmesh := mosn.NewMosn(cfg)\\n\\tgo mesh.Start()\\n\\tgo func() {\\n\\t\\t<-c.Finish\\n\\t\\tc.AppServer.Close()\\n\\t\\tmesh.Close()\\n\\t\\tc.Finish <- true\\n\\t}()\\n\\ttime.Sleep(5 * time.Second) //wait server and mesh start\\n}\",\n \"func (manager *ClientManager) Start() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase conn := <-manager.register:\\n\\n\\t\\t\\tlog.Printf(\\\"Registering connection\\\")\\n\\t\\t\\tmanager.clients[conn] = true\\n\\n\\t\\tcase conn := <-manager.unregister:\\n\\t\\t\\tlog.Printf(\\\"Unregistering connection.\\\")\\n\\t\\t\\tif _, ok := manager.clients[conn]; ok {\\n\\t\\t\\t\\tclose(conn.send)\\n\\t\\t\\t\\tdelete(manager.clients, conn)\\n\\t\\t\\t}\\n\\t\\tcase event := <-manager.Broadcast:\\n\\t\\t\\tlog.Printf(\\\"Sending event %s\\\", event)\\n\\t\\t\\t//Marshal once\\n\\t\\t\\ttoSend, err := json.Marshal(&event)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tfor conn := range manager.clients {\\n\\t\\t\\t\\tselect {\\n\\t\\t\\t\\tcase conn.send <- toSend: //this might need to be more robust - to handle a connection that is just taking a minute\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tclose(conn.send)\\n\\t\\t\\t\\t\\tdelete(manager.clients, conn)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Server) Start() error {\\n\\ts.RegisterHTTPHandlers()\\n\\tlog.Print(fmt.Sprintf(\\\"Listening HTTP on: %s\\\", s.url))\\n\\n\\thandler := CORSWrap(s.router)\\n\\treturn http.ListenAndServe(s.url, handler)\\n}\",\n \"func (h *HttpReceiver) startHttpProxy() {\\n\\thttp.HandleFunc(beaconEndpoint, h.handleBeaconEndpoint)\\n\\thttp.HandleFunc(payloadEndpoint, h.handlePayloadEndpoint)\\n\\thttp.HandleFunc(uploadEndpoint, h.handleUploadEndpoint)\\n\\tif err := http.ListenAndServe(h.bindPortStr, nil); err != nil {\\n\\t\\toutput.VerbosePrint(fmt.Sprintf(\\\"[-] HTTP proxy error: %s\\\", err.Error()))\\n\\t}\\n}\",\n \"func (p *Proxy) Start() {\\n\\tp.stream.EventKv(\\\"proxy.starting\\\", kvs{\\\"public_key\\\": p.publicKey, \\\"speed\\\": strconv.Itoa(p.speed)})\\n\\n\\tp.Fetch()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-p.stopCh:\\n\\t\\t\\tclose(p.doneCh)\\n\\t\\t\\treturn\\n\\t\\tcase <-p.ticker.C:\\n\\t\\t\\tp.Fetch()\\n\\t\\t}\\n\\t}\\n}\",\n \"func Start(server, password string) {\\n\\tln, err := net.Listen(\\\"tcp\\\", consts.SOCKS5Addr)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tconn, err := ln.Accept()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tpanic(err)\\n\\t\\t\\t}\\n\\t\\t\\tgo handleConn(conn, server, password)\\n\\t\\t}\\n\\t}()\\n}\",\n \"func (s Server) Start(port int, cb func(Message) error) {\\n\\tlistenTo := fmt.Sprintf(\\\":%d\\\", port)\\n\\tlog.Printf(\\\"Launching server on port %d\\\", port)\\n\\tlistener, err := net.Listen(\\\"tcp\\\", listenTo)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tfor {\\n\\t\\tconn, err := listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Println(err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tc := Client{conn: conn, Id: NewClientId(), raw: s.Raw, Index: s.nextIndex}\\n\\t\\ts.nextIndex++\\n\\t\\tgo handleClient(c, s.Raw, cb)\\n\\t}\\n}\",\n \"func (server *Server) Start(laddr *net.TCPAddr) error {\\n\\n\\tlistener, err := server.dataStreamer.CreateListener(laddr)\\n\\tif err != nil {\\n\\t\\tlog.Print(err)\\n\\t\\treturn err\\n\\t}\\n\\tserver.dataStreamer = listener\\n\\n\\tgo server.listen()\\n\\treturn nil\\n\\n}\",\n \"func Run() {\\n\\tproxy := &proxy{\\n\\t\\tsessions: make(map[string]*Session),\\n\\t\\tupgrader: &websocket.Upgrader{\\n\\t\\t\\tReadBufferSize: protocol.MaxInstructionLength,\\n\\t\\t\\tWriteBufferSize: protocol.MaxInstructionLength,\\n\\t\\t\\tSubprotocols: []string{\\\"guacamole\\\"}, // fixed by guacamole-client\\n\\t\\t\\tCheckOrigin: func(r *http.Request) bool {\\n\\t\\t\\t\\t// FIXME: add origin check\\n\\t\\t\\t\\treturn true\\n\\t\\t\\t},\\n\\t\\t},\\n\\t}\\n\\tproxy.serve()\\n}\",\n \"func (s *Server) Start() {\\n\\tfor {\\n\\t\\tc, err := s.rtspListener.AcceptTCP()\\n\\n\\t\\tif err != nil {\\n\\t\\t\\tif _, ok := err.(net.Error); ok && strings.HasSuffix(err.Error(), \\\": use of closed network connection\\\") {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\n\\t\\t\\tfmt.Println(err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tc.SetReadBuffer(osReceiveBufferSize)\\n\\n\\t\\t// Handle the new connection\\n\\t\\tgo s.handleConnection(c)\\n\\t}\\n}\",\n \"func (cl *Client) StartListening() {\\n\\tfor {\\n\\t\\tmsg, open := <-cl.receiver\\n\\t\\tif !open {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\tif cl.OnMessage == nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tcl.OnMessage(msg)\\n\\t}\\n}\",\n \"func (cs *ClientSocket) Start() {\\n\\tgo cs.RunEvents()\\n\\tgo cs.RunSocketSender()\\n\\tgo cs.RunSocketListener()\\n}\",\n \"func (t *WSTunnelClient) Start() {\\n\\tlog := t.log\\n\\tlog.Functionf(\\\"Creating %s at %s\\\", \\\"func\\\", agentlog.GetMyStack())\\n\\tgo func() {\\n\\t\\tt.startSession()\\n\\t\\t<-make(chan struct{}, 0)\\n\\t}()\\n}\",\n \"func (s *server) Start() {\\n\\ts.httpServer = &http.Server{Addr: s.listenAddr}\\n\\n\\tgo func() {\\n\\t\\ts.logger.Printf(\\\"listening on \\\\\\\"%s\\\\\\\"\\\\n\\\", s.httpServer.Addr)\\n\\n\\t\\terr := s.httpServer.ListenAndServe()\\n\\t\\tif err != nil && err != http.ErrServerClosed {\\n\\t\\t\\ts.logger.Fatalf(\\\"could not listen on \\\\\\\"%s\\\\\\\": %v\\\\n\\\", s.httpServer.Addr, err)\\n\\t\\t}\\n\\n\\t\\ts.done <- true\\n\\t}()\\n}\",\n \"func (c *Client) Start(serverURL string) error {\\n\\t// Set internal message handler\\n\\tc.client.SetMessageHandler(c.ocppMessageHandler)\\n\\tc.client.SetDisconnectedHandler(c.onDisconnected)\\n\\tc.client.SetReconnectedHandler(c.onReconnected)\\n\\t// Connect & run\\n\\tfullUrl := fmt.Sprintf(\\\"%v/%v\\\", serverURL, c.Id)\\n\\terr := c.client.Start(fullUrl)\\n\\tif err == nil {\\n\\t\\tc.dispatcher.Start()\\n\\t}\\n\\treturn err\\n}\",\n \"func (s *Server) Run() {\\n\\ts.connect()\\n\\tnewClientListener := make(chan *Client)\\n\\tbufListener := make(chan *Message)\\n\\tgo s.newClientListener(newClientListener)\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase client := <-newClientListener:\\n\\t\\t\\tclient.server = s\\n\\t\\t\\ts.clients = append(s.clients, client)\\n\\t\\t\\tgo client.Listen(bufListener)\\n\\t\\t\\tlog.Println(\\\"Client connected, \\\" + strconv.Itoa(len(s.clients)) + \\\" active clients\\\")\\n\\t\\tcase message := <-bufListener:\\n\\t\\t\\ts.messages = append(s.messages, message)\\n\\t\\tdefault:\\n\\t\\t\\ts.timing()\\n\\t\\t\\ts.processMessages()\\n\\t\\t}\\n\\t}\\n}\",\n \"func StartProxy(address string, proxy *xproxy.ReverseProxy) {\\n\\n\\txproxy.RegisterMetrics()\\n\\terr := proxy.StartConsulSync()\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err.Error())\\n\\t}\\n\\n\\thttp.HandleFunc(\\\"/\\\", proxy.ReverseHandlerFunc())\\n\\thttp.HandleFunc(\\\"/registry\\\", func(w http.ResponseWriter, req *http.Request) {\\n\\t\\tappCtx.Render.JSON(w, http.StatusOK, proxy.ServiceRegistry)\\n\\t})\\n\\thttp.HandleFunc(\\\"/ping\\\", func(w http.ResponseWriter, req *http.Request) {\\n\\t\\tappCtx.Render.Text(w, http.StatusOK, \\\"pong\\\")\\n\\t})\\n\\thttp.HandleFunc(\\\"/health\\\", func(w http.ResponseWriter, req *http.Request) {\\n\\t\\tappCtx.Render.JSON(w, http.StatusOK, appCtx)\\n\\t})\\n\\thttp.HandleFunc(\\\"/error\\\", func(w http.ResponseWriter, req *http.Request) {\\n\\t\\tappCtx.Render.Text(w, http.StatusNotAcceptable, \\\"Not Acceptable\\\")\\n\\t})\\n\\n\\thttp.Handle(\\\"/metrics\\\", promhttp.Handler())\\n\\n\\tlog.Printf(\\\"Proxy started on %s\\\", address)\\n\\tlog.Fatal(http.ListenAndServe(address, nil))\\n}\",\n \"func (gw *GrpcWrapper) Start() error {\\n\\tif gw.ln != nil {\\n\\t\\treturn nil\\n\\t}\\n\\tln, err := net.Listen(\\\"tcp\\\", fmt.Sprintf(\\\":%d\\\", gw.port))\\n\\tif err != nil {\\n\\t\\tgw.logger.WithFields(log.Fields{\\n\\t\\t\\t\\\"error\\\": err.Error(),\\n\\t\\t\\t\\\"port\\\": gw.port,\\n\\t\\t}).Error(\\\"net.Listen() error\\\")\\n\\t\\treturn err\\n\\t}\\n\\tgw.ln = ln\\n\\n\\tgw.logger.WithFields(log.Fields{\\\"port\\\": gw.port}).Info(\\\"TCP net listener initialized\\\")\\n\\n\\tserver := grpc.NewServer(grpc.StatsHandler(&ocgrpc.ServerHandler{}))\\n\\tfor _, handlerFunc := range gw.handlerFuncs {\\n\\t\\thandlerFunc(server)\\n\\t}\\n\\tgw.server = server\\n\\tgw.grpcAwaiter = make(chan error)\\n\\n\\tgo func() {\\n\\t\\tgw.logger.Infof(\\\"Serving gRPC on :%d\\\", gw.port)\\n\\t\\terr := gw.server.Serve(ln)\\n\\t\\tgw.grpcAwaiter <- err\\n\\t\\tif err != nil {\\n\\t\\t\\tgw.logger.WithFields(log.Fields{\\\"error\\\": err.Error()}).Error(\\\"gRPC serve() error\\\")\\n\\t\\t}\\n\\t}()\\n\\n\\treturn nil\\n}\",\n \"func Start() {\\n\\t//\\tdefer profile.Start().Stop() // uncomment to enable profiler\\n\\t// Listen for incoming connections.\\n\\tl, err := net.Listen(ConnType, ConnHost+\\\":\\\"+ConnPort)\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"Error listening:\\\", err.Error())\\n\\t\\tos.Exit(1)\\n\\t}\\n\\t// Close the listener when the application closes.\\n\\tdefer l.Close()\\n\\tfmt.Println(\\\"Listening on \\\" + ConnHost + \\\":\\\" + ConnPort)\\n\\tfor {\\n\\t\\t// Listen for an incoming connection.\\n\\t\\tconn, err := l.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tfmt.Println(\\\"Error accepting: \\\", err.Error())\\n\\t\\t\\tos.Exit(1)\\n\\t\\t}\\n\\t\\t// Handle connections in a new goroutine.\\n\\t\\tgo handleRequest(conn)\\n\\t}\\n}\",\n \"func (c *conn) Start() {\\n\\tLog.Infof(\\\"[client %s] connected\\\", c.RemoteAddr())\\n\\tc.started = true\\n\\tgo c.writeLoop()\\n\\tgo c.readLoop()\\n\\tc.dispatchLoop()\\n}\",\n \"func (r *oauthProxy) Run() error {\\n\\tlistener, err := r.createHTTPListener(listenerConfig{\\n\\t\\tca: r.config.TLSCaCertificate,\\n\\t\\tcertificate: r.config.TLSCertificate,\\n\\t\\tclientCert: r.config.TLSClientCertificate,\\n\\t\\thostnames: r.config.Hostnames,\\n\\t\\tletsEncryptCacheDir: r.config.LetsEncryptCacheDir,\\n\\t\\tlisten: r.config.Listen,\\n\\t\\tprivateKey: r.config.TLSPrivateKey,\\n\\t\\tproxyProtocol: r.config.EnableProxyProtocol,\\n\\t\\tredirectionURL: r.config.RedirectionURL,\\n\\t\\tuseFileTLS: r.config.TLSPrivateKey != \\\"\\\" && r.config.TLSCertificate != \\\"\\\",\\n\\t\\tuseLetsEncryptTLS: r.config.UseLetsEncrypt,\\n\\t\\tuseSelfSignedTLS: r.config.EnabledSelfSignedTLS,\\n\\t})\\n\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\t// step: create the http server\\n\\tserver := &http.Server{\\n\\t\\tAddr: r.config.Listen,\\n\\t\\tHandler: r.router,\\n\\t\\tReadTimeout: r.config.ServerReadTimeout,\\n\\t\\tWriteTimeout: r.config.ServerWriteTimeout,\\n\\t\\tIdleTimeout: r.config.ServerIdleTimeout,\\n\\t}\\n\\tr.server = server\\n\\tr.listener = listener\\n\\n\\tgo func() {\\n\\t\\tr.log.Info(\\\"keycloak proxy service starting\\\", zap.String(\\\"interface\\\", r.config.Listen))\\n\\t\\tif err = server.Serve(listener); err != nil {\\n\\t\\t\\tif err != http.ErrServerClosed {\\n\\t\\t\\t\\tr.log.Fatal(\\\"failed to start the http service\\\", zap.Error(err))\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\n\\t// step: are we running http service as well?\\n\\tif r.config.ListenHTTP != \\\"\\\" {\\n\\t\\tr.log.Info(\\\"keycloak proxy http service starting\\\", zap.String(\\\"interface\\\", r.config.ListenHTTP))\\n\\t\\thttpListener, err := r.createHTTPListener(listenerConfig{\\n\\t\\t\\tlisten: r.config.ListenHTTP,\\n\\t\\t\\tproxyProtocol: r.config.EnableProxyProtocol,\\n\\t\\t})\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\thttpsvc := &http.Server{\\n\\t\\t\\tAddr: r.config.ListenHTTP,\\n\\t\\t\\tHandler: r.router,\\n\\t\\t\\tReadTimeout: r.config.ServerReadTimeout,\\n\\t\\t\\tWriteTimeout: r.config.ServerWriteTimeout,\\n\\t\\t\\tIdleTimeout: r.config.ServerIdleTimeout,\\n\\t\\t}\\n\\t\\tgo func() {\\n\\t\\t\\tif err := httpsvc.Serve(httpListener); err != nil {\\n\\t\\t\\t\\tr.log.Fatal(\\\"failed to start the http redirect service\\\", zap.Error(err))\\n\\t\\t\\t}\\n\\t\\t}()\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func Start(bindTo string, target string) *http.Server {\\n\\tlog.Print(\\\"Starting Qaclana Proxy\\\")\\n\\ts := handler.NewProxyHandler(target)\\n\\n\\tmu := http.NewServeMux()\\n\\tmu.Handle(\\\"/\\\", s)\\n\\n\\th := &http.Server{Handler: mu}\\n\\n\\tlog.Printf(\\\"Started Proxy at %s, protecting %s\\\", bindTo, target)\\n\\tgo func() {\\n\\t\\tlog.Printf(\\\"unable to serve: %v\\\", http.ListenAndServe(bindTo, mu))\\n\\t}()\\n\\n\\treturn h\\n}\",\n \"func StartHTTPProxy(config_obj *api_proto.Config, mux *http.ServeMux) error {\\n\\tlogger := logging.Manager.GetLogger(config_obj, &logging.GUIComponent)\\n\\tif config_obj.GUI.BindAddress != \\\"127.0.0.1\\\" {\\n\\t\\tlogger.Info(\\\"GUI is not encrypted and listening on public interfact. \\\" +\\n\\t\\t\\t\\\"This is not secure. Please enable TLS.\\\")\\n\\t}\\n\\n\\tlistenAddr := fmt.Sprintf(\\\"%s:%d\\\",\\n\\t\\tconfig_obj.GUI.BindAddress,\\n\\t\\tconfig_obj.GUI.BindPort)\\n\\n\\tlogger.WithFields(\\n\\t\\tlogrus.Fields{\\n\\t\\t\\t\\\"listenAddr\\\": listenAddr,\\n\\t\\t}).Info(\\\"GUI is ready to handle requests\\\")\\n\\n\\treturn http.ListenAndServe(listenAddr, mux)\\n}\",\n \"func (s *Server) Start(addr string) error {\\n\\terrc := make(chan error, 1)\\n\\n\\tif s.redirServer != nil {\\n\\t\\tgo func() {\\n\\t\\t\\terrc <- s.redirServer.ListenAndServe()\\n\\t\\t}()\\n\\t}\\n\\n\\tgo func() {\\n\\t\\terrc <- s.Server.Start(addr, true)\\n\\t}()\\n\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase err := <-errc:\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n}\",\n \"func (network Network) Start() {\\n\\tsock, err := net.Listen(\\\"tcp\\\", fmt.Sprintf(\\\":%d\\\", network.Port))\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tglobal.Log(network.Name, fmt.Sprintf(\\\"Listening on %s.\\\", sock.Addr().String()))\\n\\n\\tconnections := make(chan net.Conn)\\n\\tnetwork.Clients = make(map[*Connection]int)\\n\\tclientCount := 0\\n\\n\\t// Networking loop for accepting connections, handled in a separate thread\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tconn, err := sock.Accept()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tpanic(err)\\n\\t\\t\\t}\\n\\t\\t\\tconnections <- conn\\n\\t\\t}\\n\\t}()\\n\\n\\t// Main networking loop for handling connections and setting up their listen loop\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase conn := <-connections:\\n\\t\\t\\tglobal.Log(network.Name, fmt.Sprintf(\\\"Client connected from %s.\\\", conn.RemoteAddr()))\\n\\t\\t\\t_ = conn.SetDeadline(time.Time{})\\n\\n\\t\\t\\tclient := &Connection{\\n\\t\\t\\t\\tconn: conn,\\n\\t\\t\\t\\twriteQueue: make(chan PacketResponse),\\n\\t\\t\\t}\\n\\t\\t\\tnetwork.Clients[client] = clientCount\\n\\t\\t\\tclientCount++\\n\\t\\t\\tclient.listen(network)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *server) Start() {\\n\\t// A duplicator for notifications intended for all clients runs\\n\\t// in another goroutines. Any such notifications are sent to\\n\\t// the allClients channel and then sent to each connected client.\\n\\t//\\n\\t// Use a sync.Once to insure no extra duplicators run.\\n\\tgo duplicateOnce.Do(clientResponseDuplicator)\\n\\n\\tlog.Trace(\\\"Starting RPC server\\\")\\n\\n\\tserveMux := http.NewServeMux()\\n\\tconst rpcAuthTimeoutSeconds = 10\\n\\thttpServer := &http.Server{\\n\\t\\tHandler: serveMux,\\n\\n\\t\\t// Timeout connections which don't complete the initial\\n\\t\\t// handshake within the allowed timeframe.\\n\\t\\tReadTimeout: time.Second * rpcAuthTimeoutSeconds,\\n\\t}\\n\\tserveMux.HandleFunc(\\\"/\\\", func(w http.ResponseWriter, r *http.Request) {\\n\\t\\tif err := s.checkAuth(r); err != nil {\\n\\t\\t\\tlog.Warnf(\\\"Unauthorized client connection attempt\\\")\\n\\t\\t\\thttp.Error(w, \\\"401 Unauthorized.\\\", http.StatusUnauthorized)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\ts.ServeRPCRequest(w, r)\\n\\t})\\n\\tserveMux.HandleFunc(\\\"/frontend\\\", func(w http.ResponseWriter, r *http.Request) {\\n\\t\\tauthenticated := false\\n\\t\\tif err := s.checkAuth(r); err != nil {\\n\\t\\t\\t// If auth was supplied but incorrect, rather than simply being\\n\\t\\t\\t// missing, immediately terminate the connection.\\n\\t\\t\\tif err != ErrNoAuth {\\n\\t\\t\\t\\tlog.Warnf(\\\"Disconnecting improperly authorized websocket client\\\")\\n\\t\\t\\t\\thttp.Error(w, \\\"401 Unauthorized.\\\", http.StatusUnauthorized)\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tauthenticated = true\\n\\t\\t}\\n\\n\\t\\t// A new Server instance is created rather than just creating the\\n\\t\\t// handler closure since the default server will disconnect the\\n\\t\\t// client if the origin is unset.\\n\\t\\twsServer := websocket.Server{\\n\\t\\t\\tHandler: websocket.Handler(func(ws *websocket.Conn) {\\n\\t\\t\\t\\ts.WSSendRecv(ws, r.RemoteAddr, authenticated)\\n\\t\\t\\t}),\\n\\t\\t}\\n\\t\\twsServer.ServeHTTP(w, r)\\n\\t})\\n\\tfor _, listener := range s.listeners {\\n\\t\\ts.wg.Add(1)\\n\\t\\tgo func(listener net.Listener) {\\n\\t\\t\\tlog.Infof(\\\"RPCS: RPC server listening on %s\\\", listener.Addr())\\n\\t\\t\\thttpServer.Serve(listener)\\n\\t\\t\\tlog.Tracef(\\\"RPCS: RPC listener done for %s\\\", listener.Addr())\\n\\t\\t\\ts.wg.Done()\\n\\t\\t}(listener)\\n\\t}\\n}\",\n \"func (client *ClientConnection) Run() {\\n\\tfirstPacket := true\\n\\tincoming := make(chan mysqlproto.Packet)\\n\\tgo client.getPackets(incoming)\\n\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase packet := <-client.proxy.ClientChannel:\\n\\t\\t\\tif firstPacket {\\n\\t\\t\\t\\t// This is the first packet the server sent, so it must be\\n\\t\\t\\t\\t// the start of the handshake.\\n\\t\\t\\t\\tclient.authPluginData = client.getAuthPluginData(packet)\\n\\t\\t\\t\\tfirstPacket = false\\n\\t\\t\\t}\\n\\t\\t\\tWritePacket(client.stream, packet)\\n\\t\\tcase packet, more := <-incoming:\\n\\t\\t\\tif more {\\n\\t\\t\\t\\tclient.proxy.ServerChannel <- packet\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tclient.proxy.Close()\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (server *SServer) Start() {\\n\\tlistener, err := network.Listen(server.config.GetAcraConnectionString())\\n\\tif err != nil {\\n\\t\\tlog.WithError(err).Errorln(\\\"can't start listen connections\\\")\\n\\t\\treturn\\n\\t}\\n\\tdefer listener.Close()\\n\\tserver.addListener(listener)\\n\\tlog.Infof(\\\"start listening %s\\\", server.config.GetAcraConnectionString())\\n\\tfor {\\n\\t\\tconnection, err := listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.WithError(err).Errorln(\\\"can't accept new connection\\\")\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\t// unix socket and value == '@'\\n\\t\\tif len(connection.RemoteAddr().String()) == 1 {\\n\\t\\t\\tlog.Infof(\\\"new connection to acraserver: <%v>\\\", connection.LocalAddr())\\n\\t\\t} else {\\n\\t\\t\\tlog.Infof(\\\"new connection to acraserver: <%v>\\\", connection.RemoteAddr())\\n\\t\\t}\\n\\t\\tgo server.handleConnection(connection)\\n\\t}\\n}\",\n \"func (w *WSConnector) OnStart() {\\n\\tif len(w.onConnectListener) < 1 {\\n\\t\\tpanic(\\\"onConnectListener() not set.\\\")\\n\\t}\\n\\n\\tvar err error\\n\\tw.listener, err = GetNetListener(w.address, w.certFile, w.keyFile)\\n\\tif err != nil {\\n\\t\\tcherryLogger.Fatalf(\\\"Failed to listen: %s\\\", err.Error())\\n\\t}\\n\\n\\tif w.certFile == \\\"\\\" || w.keyFile == \\\"\\\" {\\n\\t\\tcherryLogger.Infof(\\\"websocket connector listening at address ws://%s\\\", w.address)\\n\\t} else {\\n\\t\\tcherryLogger.Infof(\\\"websocket connector listening at address wss://%s\\\", w.address)\\n\\t\\tcherryLogger.Infof(\\\"certFile = %s\\\", w.certFile)\\n\\t\\tcherryLogger.Infof(\\\"keyFile = %s\\\", w.keyFile)\\n\\t}\\n\\n\\tw.up = &websocket.Upgrader{\\n\\t\\tReadBufferSize: 1024,\\n\\t\\tWriteBufferSize: 1024,\\n\\t\\tCheckOrigin: CheckOrigin,\\n\\t}\\n\\n\\tdefer w.OnStop()\\n\\n\\t_ = http.Serve(w.listener, w)\\n}\",\n \"func (ms *MarvinServer) Start() {\\n\\tgo startWebsockets()\\n\\n\\tlog.Printf(\\\"Started Marvin HTTP Server on %v:%v\\\\n\\\", ms.host, ms.port)\\n\\trouter := createRouter(ms)\\n\\thttpError := netHTTP.ListenAndServe(ms.host+\\\":\\\"+strconv.Itoa(ms.port), router)\\n\\n\\tif httpError != nil {\\n\\t\\tlog.Fatal(httpError)\\n\\t\\treturn\\n\\t}\\n}\",\n \"func (m ManagedServer) Start(port int, rawPrivateKeys [][]byte, ciphers, macs []string) {\\n\\tm.lg.InfoD(\\\"starting-server\\\", meta{\\n\\t\\t\\\"port\\\": port,\\n\\t\\t\\\"ciphers\\\": ciphers,\\n\\t\\t\\\"macs\\\": macs,\\n\\t})\\n\\n\\tprivateKeys := []ssh.Signer{}\\n\\tfor i, rawKey := range rawPrivateKeys {\\n\\t\\tprivateKey, err := ssh.ParsePrivateKey(rawKey)\\n\\t\\tif err != nil {\\n\\t\\t\\tm.errorAndAlert(\\\"private-key-parse\\\", meta{\\\"index\\\": i, \\\"error\\\": err.Error()})\\n\\t\\t\\tos.Exit(1)\\n\\t\\t}\\n\\t\\tprivateKeys = append(privateKeys, privateKey)\\n\\t}\\n\\n\\tlistener, err := net.Listen(\\\"tcp\\\", fmt.Sprintf(\\\"0.0.0.0:%v\\\", port))\\n\\tproxyList := proxyproto.Listener{Listener: listener}\\n\\n\\tif err != nil {\\n\\t\\tm.errorAndAlert(\\\"listen-fail\\\", meta{\\n\\t\\t\\t\\\"msg\\\": \\\"failed to open socket\\\",\\n\\t\\t\\t\\\"error\\\": err.Error(),\\n\\t\\t\\t\\\"port\\\": port})\\n\\t}\\n\\tm.lg.InfoD(\\\"listening\\\", meta{\\\"address\\\": proxyList.Addr().String()})\\n\\n\\tfor {\\n\\t\\tnewConn, err := proxyList.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tm.errorAndAlert(\\\"listener-accept-fail\\\", meta{\\\"error\\\": err.Error()})\\n\\t\\t\\tos.Exit(1)\\n\\t\\t}\\n\\n\\t\\tgo func(conn net.Conn) {\\n\\t\\t\\tvar driver ServerDriver\\n\\t\\t\\tconfig := &ssh.ServerConfig{\\n\\t\\t\\t\\tConfig: ssh.Config{\\n\\t\\t\\t\\t\\tCiphers: ciphers,\\n\\t\\t\\t\\t\\tMACs: macs,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\tPasswordCallback: func(c ssh.ConnMetadata, pass []byte) (*ssh.Permissions, error) {\\n\\t\\t\\t\\t\\tdriver = m.driverGenerator(LoginRequest{\\n\\t\\t\\t\\t\\t\\tUsername: c.User(),\\n\\t\\t\\t\\t\\t\\tPassword: string(pass),\\n\\t\\t\\t\\t\\t\\tPublicKey: \\\"\\\",\\n\\t\\t\\t\\t\\t\\tRemoteAddr: c.RemoteAddr(),\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t\\tif driver == nil {\\n\\t\\t\\t\\t\\t\\treturn nil, fmt.Errorf(\\\"password rejected for %q\\\", c.User())\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn nil, nil\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\tPublicKeyCallback: func(c ssh.ConnMetadata, key ssh.PublicKey) (*ssh.Permissions, error) {\\n\\t\\t\\t\\t\\tdriver = m.driverGenerator(LoginRequest{\\n\\t\\t\\t\\t\\t\\tUsername: c.User(),\\n\\t\\t\\t\\t\\t\\tPassword: \\\"\\\",\\n\\t\\t\\t\\t\\t\\tPublicKey: strings.TrimSpace(string(ssh.MarshalAuthorizedKey(key))),\\n\\t\\t\\t\\t\\t\\tRemoteAddr: c.RemoteAddr(),\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t\\tif driver == nil {\\n\\t\\t\\t\\t\\t\\treturn nil, fmt.Errorf(\\\"password rejected for %q\\\", c.User())\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn nil, nil\\n\\t\\t\\t\\t},\\n\\t\\t\\t}\\n\\t\\t\\tfor _, privateKey := range privateKeys {\\n\\t\\t\\t\\tconfig.AddHostKey(privateKey)\\n\\t\\t\\t}\\n\\n\\t\\t\\t_, newChan, requestChan, err := ssh.NewServerConn(conn, config)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tif err != io.EOF {\\n\\t\\t\\t\\t\\tm.errorAndAlert(\\\"handshake-failure\\\", meta{\\\"error\\\": err.Error()})\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tgo ssh.DiscardRequests(requestChan)\\n\\n\\t\\t\\tfor newChannelRequest := range newChan {\\n\\t\\t\\t\\tif newChannelRequest.ChannelType() != \\\"session\\\" {\\n\\t\\t\\t\\t\\tnewChannelRequest.Reject(ssh.UnknownChannelType, \\\"unknown channel type\\\")\\n\\t\\t\\t\\t\\tm.errorAndAlert(\\\"unknown-channel-type\\\", meta{\\\"type\\\": newChannelRequest.ChannelType()})\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tchannel, requests, err := newChannelRequest.Accept()\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tif err != io.EOF {\\n\\t\\t\\t\\t\\t\\tm.errorAndAlert(\\\"channel-accept-failure\\\", meta{\\n\\t\\t\\t\\t\\t\\t\\t\\\"err\\\": err.Error(),\\n\\t\\t\\t\\t\\t\\t\\t\\\"type\\\": newChannelRequest.ChannelType()})\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tgo func(in <-chan *ssh.Request) {\\n\\t\\t\\t\\t\\tfor req := range in {\\n\\t\\t\\t\\t\\t\\tok := false\\n\\t\\t\\t\\t\\t\\tswitch req.Type {\\n\\t\\t\\t\\t\\t\\tcase \\\"subsystem\\\":\\n\\t\\t\\t\\t\\t\\t\\tif len(req.Payload) >= 4 {\\n\\t\\t\\t\\t\\t\\t\\t\\t// we reject all SSH requests that are not SFTP\\n\\t\\t\\t\\t\\t\\t\\t\\tif string(req.Payload[4:]) == \\\"sftp\\\" {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tok = true\\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\\treq.Reply(ok, nil)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}(requests)\\n\\n\\t\\t\\t\\tserver, err := NewServer(channel, driver)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tm.errorAndAlert(\\\"server-creation-err\\\", meta{\\\"err\\\": err.Error()})\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif err := server.Serve(); err != nil {\\n\\t\\t\\t\\t\\tchannel.Close()\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}(newConn)\\n\\t}\\n}\",\n \"func (c *wsClient) Start() {\\n\\trpcsLog.Tracef(\\\"Starting websocket client %s\\\", c.addr)\\n\\n\\t// Start processing input and output.\\n\\tc.wg.Add(3)\\n\\tgo c.inHandler()\\n\\tgo c.notificationQueueHandler()\\n\\tgo c.outHandler()\\n}\",\n \"func (s *Server) Start() error {\\n\\tlog.Printf(\\\"Starting server with parent: %s\\\\n\\\", s.Parent)\\n\\tln, err := net.Listen(\\\"tcp\\\", s.Address + \\\":666\\\")\\n\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tfor {\\n\\t\\tconn, _ := ln.Accept()\\n\\n\\t\\tlog.Println(\\\"Got something!\\\")\\n\\n\\t\\tgo s.handleConnection(conn)\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (s *callbackServer) Start(addr string) {\\n\\ts.server = &http.Server{\\n\\t\\tAddr: addr,\\n\\t}\\n\\n\\tgo func() {\\n\\t\\tif err := s.server.ListenAndServe(); err != http.ErrServerClosed {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\t}()\\n}\",\n \"func (c *Client) Start() {\\n\\tif c.LogError == nil {\\n\\t\\tc.LogError = errorLogger\\n\\t}\\n\\tif c.clientStopChan != nil {\\n\\t\\tpanic(\\\"gorpc.Client: the given client is already started. Call Client.Stop() before calling Client.Start() again!\\\")\\n\\t}\\n\\n\\tif c.PendingRequests <= 0 {\\n\\t\\tc.PendingRequests = DefaultPendingMessages\\n\\t}\\n\\tif c.FlushDelay == 0 {\\n\\t\\tc.FlushDelay = DefaultFlushDelay\\n\\t}\\n\\tif c.RequestTimeout <= 0 {\\n\\t\\tc.RequestTimeout = DefaultRequestTimeout\\n\\t}\\n\\tif c.SendBufferSize <= 0 {\\n\\t\\tc.SendBufferSize = DefaultBufferSize\\n\\t}\\n\\tif c.RecvBufferSize <= 0 {\\n\\t\\tc.RecvBufferSize = DefaultBufferSize\\n\\t}\\n\\n\\tc.requestsChan = make(chan *AsyncResult, c.PendingRequests)\\n\\tc.clientStopChan = make(chan struct{})\\n\\n\\tif c.Conns <= 0 {\\n\\t\\tc.Conns = 1\\n\\t}\\n\\tif c.Dial == nil {\\n\\t\\tc.Dial = defaultDial\\n\\t}\\n\\n\\tfor i := 0; i < c.Conns; i++ {\\n\\t\\tc.stopWg.Add(1)\\n\\t\\tgo clientHandler(c)\\n\\t}\\n}\",\n \"func startProxies(proxyAppAddr, proxyDeviceAddr, deviceAddr *net.UDPAddr) {\\n\\ttoDevice := make(chan []byte, 100)\\n\\tfromDevice := make(chan []byte, 100)\\n\\n\\t//appAddr is autodetected from the first data packet\\n\\terr := appProxy(proxyAppAddr, \\\">>\\\", fromDevice, toDevice)\\n\\tif err != nil {\\n\\t\\tlog.Fatalln(\\\"Fail on UPD Server start\\\", err)\\n\\t}\\n\\n\\terr = deviceProxy(proxyDeviceAddr, deviceAddr, \\\"<<\\\", toDevice, fromDevice)\\n\\tif err != nil {\\n\\t\\tlog.Fatalln(\\\"Fail on UPD Client start\\\", err)\\n\\t}\\n}\",\n \"func (c *Client) StartListening() {\\n\\n\\t// Set buffer byte array at 512 bytes\\n\\tbuf := make([]byte, 512)\\n\\n\\t// Loop listening for messages from the client and direct to handler\\n\\tfor {\\n\\t\\tn, err := c.ws.Read(buf[0:])\\n\\n\\t\\t// Error only exists if the connection is broken\\n\\t\\tif err != nil {\\n\\t\\t\\tReleaseConnection(c)\\n\\t\\t\\terrorMessage := Message{\\n\\t\\t\\t\\tSenderID: \\\"System\\\",\\n\\t\\t\\t\\tUsername: \\\"System\\\",\\n\\t\\t\\t\\tMessage: fmt.Sprintf(\\\"%s disconnected\\\", c.username),\\n\\t\\t\\t}\\n\\t\\t\\terrorMessage.Post()\\n\\t\\t\\tbreak\\n\\t\\t} else {\\n\\t\\t\\tHandleInputMessage(c, buf[0:n])\\n\\t\\t}\\n\\t}\\n}\",\n \"func (server *TaggedServer) Start(forwardAddress string, forwardPort int) {\\n\\tfor {\\n\\t\\tserver.mutex.Lock()\\n\\t\\tdone := server.done\\n\\t\\tserver.mutex.Unlock()\\n\\t\\tif done {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tconn, err := server.listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\t// handle error\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\taddress := fmt.Sprintf(\\\"%s:%d\\\", forwardAddress, forwardPort)\\n\\t\\tgo func() {\\n\\t\\t\\tforwardServer, err := net.DialTimeout(\\\"tcp\\\", address, 1*time.Second)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tconn.Close()\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tResponse(conn, forwardServer)\\n\\t\\t}()\\n\\t}\\n}\",\n \"func (tunnel *Tunnel) Start() error {\\n\\treturn <-tunnel.startAsync()\\n}\",\n \"func (f *TCPForwarder) Start() error {\\n\\tif f.DB == nil {\\n\\t\\treturn errors.New(\\\"database is nil\\\")\\n\\t}\\n\\t// If we did not have a listener set directly, spin one up.\\n\\t// This is the normal path, because we do not set a listener\\n\\t// in main.go, currently.\\n\\tif f.L == nil {\\n\\t\\tvar tlsConf tls.Config\\n\\t\\ttlsConf.GetCertificate = f.GetCertificate\\n\\t\\ttlsConf.NextProtos = []string{\\\"h2\\\"}\\n\\t\\tlis, err := tls.Listen(\\\"tcp\\\", f.Addr, &tlsConf)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tf.L = lis\\n\\t}\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tconn, err := f.L.Accept()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tif err, ok := err.(net.Error); ok && err.Temporary() {\\n\\t\\t\\t\\t\\tf.logger.Errorf(\\\"accept err (temporary): %v\\\", err)\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tf.logger.Errorf(\\\"accept err: %v\\\", err)\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tctx := context.Background()\\n\\t\\t\\tctx, cancel := context.WithTimeout(ctx, 10*time.Second)\\n\\t\\t\\tdefer cancel()\\n\\t\\t\\tgo f.handleConn(ctx, conn)\\n\\t\\t}\\n\\t}()\\n\\n\\treturn nil\\n}\",\n \"func (wsServer *WsServer) Start() error {\\n\\tif atomic.AddInt32(&wsServer.started, 1) != 1 {\\n\\t\\treturn NewRPCError(ErrAlreadyStarted, nil)\\n\\t}\\n\\twsServeMux := http.NewServeMux()\\n\\twsServer.server = &http.Server{\\n\\t\\tHandler: wsServeMux,\\n\\t\\t// Timeout connections which don't complete the initial\\n\\t\\t// handshake within the allowed timeframe.\\n\\t\\tReadTimeout: time.Second * rpcAuthTimeoutSeconds,\\n\\t}\\n\\twsServeMux.HandleFunc(\\\"/\\\", func(w http.ResponseWriter, r *http.Request) {\\n\\t\\twsServer.handleWsRequest(w, r)\\n\\t})\\n\\tfor _, listen := range wsServer.config.WsListenters {\\n\\t\\tgo func(listen net.Listener) {\\n\\t\\t\\tLogger.log.Infof(\\\"RPC Websocket server listening on %s\\\", listen.Addr())\\n\\t\\t\\tgo wsServer.server.Serve(listen)\\n\\t\\t\\tLogger.log.Infof(\\\"RPC Websocket listener done for %s\\\", listen.Addr())\\n\\t\\t}(listen)\\n\\t}\\n\\twsServer.started = 1\\n\\treturn nil\\n}\",\n \"func (m *Manager) Start(srv *server.TCP) {\\n\\tm.serverMutex.Lock()\\n\\tdefer m.serverMutex.Unlock()\\n\\n\\tm.server = srv\\n\\n\\tm.messageWorkerPool.Start()\\n\\tm.messageRequestWorkerPool.Start()\\n}\",\n \"func (c *ProxyMarketClient) StartWatcher(updatedTime time.Duration) {\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tres, err := c.GetProxyListAllByNewest()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\ttime.Sleep(updatedTime * time.Millisecond)\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tc.Proxies = res.List.Data\\n\\t\\t\\ttime.Sleep(updatedTime * time.Millisecond)\\n\\t\\t}\\n\\t}()\\n}\",\n \"func (p *ProxyGRPCMock) Start(URL string) error {\\n\\tif p.GRPCImplementer == nil {\\n\\t\\treturn fmt.Errorf(\\\"Missing gRPC handler\\\")\\n\\t}\\n\\n\\tif p.GRPCRegister == nil {\\n\\t\\treturn fmt.Errorf(\\\"Missing gRPC registration routine\\\")\\n\\t}\\n\\n\\turl, err := url.Parse(URL)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tl, err := net.Listen(url.Scheme, url.Path)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tp.listener = l\\n\\n\\tgrpcServer := grpc.NewServer()\\n\\tp.GRPCRegister(grpcServer, p.GRPCImplementer)\\n\\n\\tgo func() {\\n\\t\\tgrpcServer.Serve(l)\\n\\t}()\\n\\n\\treturn nil\\n}\",\n \"func (s *server) Start(stop <-chan struct{}) error {\\n\\tlistener, err := newListener(s.bindAddress)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tserver := http.Server{\\n\\t\\tHandler: s.mux,\\n\\t}\\n\\t// Run the server\\n\\tgo func() {\\n\\t\\tlog.Info(\\\"starting http server\\\")\\n\\t\\tif err := server.Serve(listener); err != nil && err != http.ErrServerClosed {\\n\\t\\t\\tlog.Error(err, \\\"http server error\\\")\\n\\t\\t}\\n\\t}()\\n\\n\\t// Shutdown the server when stop is close\\n\\t<-stop\\n\\treturn server.Shutdown(context.Background())\\n}\",\n \"func (b *Backend) Start() error {\\n\\tb.dialEventSockLoop()\\n\\tb.dialCommandSockLoop()\\n\\n\\tvar err error\\n\\tb.gatewayID, err = b.getGatewayID()\\n\\tif err != nil {\\n\\t\\treturn errors.Wrap(err, \\\"get gateway id error\\\")\\n\\t}\\n\\n\\tif b.subscribeEventFunc != nil {\\n\\t\\tb.subscribeEventFunc(events.Subscribe{\\n\\t\\t\\tSubscribe: true,\\n\\t\\t\\tGatewayID: b.gatewayID,\\n\\t\\t})\\n\\t}\\n\\n\\tgo b.eventLoop()\\n\\n\\treturn nil\\n}\",\n \"func (srv *RPCService) Listen(req *rpc.ListenRequest, stream rpc.StripeCLI_ListenServer) error {\\n\\tdeviceName, err := srv.cfg.UserCfg.Profile.GetDeviceName()\\n\\tif err != nil {\\n\\t\\treturn status.Error(codes.Unauthenticated, err.Error())\\n\\t}\\n\\n\\tkey, err := srv.cfg.UserCfg.Profile.GetAPIKey(req.Live)\\n\\tif err != nil {\\n\\t\\treturn status.Error(codes.Unauthenticated, err.Error())\\n\\t}\\n\\tapiBase, _ := url.Parse(stripe.DefaultAPIBaseURL)\\n\\n\\tlogger := log.StandardLogger()\\n\\tproxyVisitor := createProxyVisitor(&stream)\\n\\tproxyOutCh := make(chan websocket.IElement)\\n\\n\\tctx, cancel := context.WithCancel(stream.Context())\\n\\tdefer cancel()\\n\\n\\tp, err := createProxy(ctx, &proxy.Config{\\n\\t\\tClient: &stripe.Client{\\n\\t\\t\\tAPIKey: key,\\n\\t\\t\\tBaseURL: apiBase,\\n\\t\\t},\\n\\t\\tDeviceName: deviceName,\\n\\t\\tForwardURL: req.ForwardTo,\\n\\t\\tForwardHeaders: req.Headers,\\n\\t\\tForwardConnectURL: req.ForwardConnectTo,\\n\\t\\tForwardConnectHeaders: req.ConnectHeaders,\\n\\t\\tUseConfiguredWebhooks: req.UseConfiguredWebhooks,\\n\\t\\tWebSocketFeature: webhooksWebSocketFeature,\\n\\t\\tUseLatestAPIVersion: req.Latest,\\n\\t\\tSkipVerify: req.SkipVerify,\\n\\t\\tLog: logger,\\n\\t\\tEvents: req.Events,\\n\\t\\tOutCh: proxyOutCh,\\n\\n\\t\\t// Hidden for debugging\\n\\t\\tNoWSS: false,\\n\\t})\\n\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tgo p.Run(ctx)\\n\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase e := <-proxyOutCh:\\n\\t\\t\\terr := e.Accept(proxyVisitor)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\tcase <-stream.Context().Done():\\n\\t\\t\\treturn stream.Context().Err()\\n\\t\\t}\\n\\t}\\n}\",\n \"func StartListening() {\\n\\tlistenAddress := config.Config.HTTP.Address + \\\":\\\" + config.Config.HTTP.Port\\n\\tgo func() {\\n\\t\\tE.Start(listenAddress)\\n\\t}()\\n\\n\\tlog.Info().Msgf(\\\"Starting to listening for HTTP requests on %s\\\", listenAddress)\\n}\",\n \"func (p *Pipe) Start() {\\n\\tlistener, err := net.Listen(\\\"tcp\\\", p.local.String())\\n\\tif err != nil {\\n\\t\\tlog.Printf(\\\"listening on %s error.\\\\n\\\", err)\\n\\t\\treturn\\n\\t}\\n\\tp.listenerMU.Lock()\\n\\tp.listener = listener\\n\\tp.listenerMU.Unlock()\\n\\n\\tp.registryID = PipeRegistry().Add(p)\\n\\n\\tlog.Printf(\\\"listening on %s\\\\n\\\", p.local)\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-p.terminate:\\n\\t\\t\\treturn\\n\\t\\tdefault:\\n\\t\\t\\tclient, err := listener.Accept()\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tlog.Println(\\\"disconnected\\\")\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\tp.clientsMapMU.Lock()\\n\\t\\t\\tp.clientsMap[client.RemoteAddr().String()] = client\\n\\t\\t\\tp.clientsMapMU.Unlock()\\n\\t\\t\\tgo func() {\\n\\t\\t\\t\\tconn, err := net.Dial(\\\"tcp\\\", p.remote.String())\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tlog.Println(\\\"remote connection refused\\\")\\n\\t\\t\\t\\t\\tclient.Close()\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tutils.CopyConnWithOnClose(client, conn, func() {\\n\\t\\t\\t\\t\\tp.clientsMapMU.Lock()\\n\\t\\t\\t\\t\\tdelete(p.clientsMap, client.RemoteAddr().String())\\n\\t\\t\\t\\t\\tp.clientsMapMU.Unlock()\\n\\t\\t\\t\\t})\\n\\t\\t\\t}()\\n\\t\\t}\\n\\n\\t}\\n}\",\n \"func (self *Proxy) StartTLS(cert string, key string) error {\\n\\n\\tself.srv = http.Server{\\n\\t\\tAddr: self.Bind,\\n\\t\\tHandler: self,\\n\\t}\\n\\n\\tlog.Printf(\\\"Listening for HTTPs client request at %s.\\\\n\\\", self.Bind)\\n\\n\\treturn self.srv.ListenAndServeTLS(cert, key)\\n}\",\n \"func (s *serv) Start() {\\n\\ts.running = true\\n\\n\\tsem := make(chan byte)\\n\\n\\tgo func() {\\n\\t\\t// Start listening\\n\\t\\ts.listen()\\n\\t\\tsem <- 0\\n\\t}()\\n\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tp := <-s.pks\\n\\t\\t\\t// Dispatch work\\n\\t\\t\\tswitch p.(type) {\\n\\t\\t\\tcase *network.MessagePacket:\\n\\t\\t\\t\\t_ = p.(*network.MessagePacket)\\n\\t\\t\\tcase *network.ConnectionPacket:\\n\\t\\t\\t\\t_ = p.(*network.ConnectionPacket)\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\n\\t<-sem\\n}\",\n \"func (s *Server) Start() {\\n\\tdefer (Track(\\\"Start\\\", s.log))()\\n\\tgo s.listen()\\n}\",\n \"func Start() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-quit:\\n\\t\\t\\treturn\\n\\t\\tdefault:\\n\\t\\t\\tsockets, _ := poller.Poll(-1)\\n\\t\\t\\tfor _, socket := range sockets {\\n\\t\\t\\t\\tif bytes, err := socket.Socket.RecvMessageBytes(0); err != nil {\\n\\t\\t\\t\\t\\tfmt.Printf(\\\"Error receiving message from %s: %s\\\\n\\\", socket, err)\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgo handle(connection.NewMessage(bytes))\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func main() {\\n\\tflag.Parse()\\n\\n\\tproxy := launcher.NewProxy()\\n\\tif !*quiet {\\n\\t\\tproxy.Logger = os.Stdout\\n\\t}\\n\\n\\tl, err := net.Listen(\\\"tcp\\\", *addr)\\n\\tif err != nil {\\n\\t\\tutils.E(err)\\n\\t}\\n\\n\\tfmt.Println(\\\"Remote control url is\\\", \\\"ws://\\\"+l.Addr().String())\\n\\n\\tsrv := &http.Server{Handler: proxy}\\n\\tutils.E(srv.Serve(l))\\n}\",\n \"func (er *EventRelay) Start() {\\n\\t// Start in the background since we don't want to hold up the caller\\n\\tgo er.connectEventHub()\\n}\",\n \"func (s *Server) Start(ctx context.Context) error {\\n\\tif err := s.listenAndEndpoint(); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\ts.BaseContext = func(net.Listener) context.Context {\\n\\t\\treturn ctx\\n\\t}\\n\\tlog.Infof(\\\"[HTTP] server listening on: %s\\\", s.lis.Addr().String())\\n\\tvar err error\\n\\tif s.tlsConf != nil {\\n\\t\\terr = s.ServeTLS(s.lis, \\\"\\\", \\\"\\\")\\n\\t} else {\\n\\t\\terr = s.Serve(s.lis)\\n\\t}\\n\\tif !errors.Is(err, http.ErrServerClosed) {\\n\\t\\treturn err\\n\\t}\\n\\treturn nil\\n}\",\n \"func RunProxy() {\\n\\tbuffer := make([]byte, 1500)\\n\\tfor {\\n\\t\\tn, cliaddr, err := ProxyConn.ReadFromUDP(buffer[0:])\\n\\t\\tif checkreport(1, err) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tr := bytes.NewReader(buffer)\\n\\t\\tpublicHeader, err := quic.ParsePublicHeader(r)\\n\\n\\t\\t// drop every x-th packet\\n\\t\\tdrop := 11\\n\\t\\tif int(publicHeader.PacketNumber)%drop == 0 {\\n\\t\\t\\tVlogf(3, \\\"Dropping PacketNumber %d\\\\n\\\", publicHeader.PacketNumber)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tVlogf(3, \\\"<- Connection 0x%x, PacketNumber %d\\\\n\\\", publicHeader.ConnectionID, publicHeader.PacketNumber)\\n\\n\\t\\tsaddr := cliaddr.String()\\n\\t\\tdlock()\\n\\t\\tconn, found := ClientDict[saddr]\\n\\t\\tif !found {\\n\\t\\t\\tconn = NewConnection(ServerAddr, cliaddr)\\n\\t\\t\\tif conn == nil {\\n\\t\\t\\t\\tdunlock()\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tClientDict[saddr] = conn\\n\\t\\t\\tdunlock()\\n\\t\\t\\tVlogf(2, \\\"Created new connection for client %s\\\\n\\\", saddr)\\n\\t\\t\\t// Fire up routine to manage new connection\\n\\t\\t\\tgo RunConnection(conn)\\n\\t\\t} else {\\n\\t\\t\\tVlogf(5, \\\"Found connection for client %s\\\\n\\\", saddr)\\n\\t\\t\\tdunlock()\\n\\t\\t}\\n\\t\\t// Relay to server\\n\\t\\t_, err = conn.ServerConn.Write(buffer[0:n])\\n\\t\\tif checkreport(1, err) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t}\\n}\",\n \"func (hs *HttpServer) Start() (err error) {\\n\\t//panic(\\\"todo - StartServer\\\")\\n\\n\\t// Start listening to the server port\\n\\n\\t// Accept connection from client\\n\\n\\t// Spawn a go routine to handle request\\n\\tport := hs.ServerPort\\n\\thost := \\\"0.0.0.0\\\"\\n\\t//delim := \\\"/r/n\\\"\\n\\tln, err := net.Listen(\\\"tcp\\\", host+port)\\n\\tdefer ln.Close()\\n\\tif err != nil {\\n\\t\\tlog.Panicln(err)\\n\\t}\\n\\tlog.Println(\\\"Listening to connections at '\\\"+host+\\\"' on port\\\", port)\\n\\n\\tfor {\\n\\t\\tconn, err := ln.Accept()\\n\\t\\tif err != nil{\\n\\t\\t\\tlog.Panicln(err)\\n\\t\\t}\\n\\t\\t\\n\\t\\tgo hs.handleConnection(conn)\\n\\t}\\n\\n\\treturn err\\n\\n\\n}\",\n \"func (server *TcpServer) Start() error {\\n\\tfor {\\n\\t\\tconn, err := server.listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tgo server.performCommand(conn)\\n\\t}\\n}\",\n \"func (wss *WssClientContext) Start() {\\n\\tfor {\\n\\n\\t\\tu := url.URL{\\n\\t\\t\\tScheme: \\\"ws\\\",\\n\\t\\t\\tOpaque: \\\"\\\",\\n\\t\\t\\tUser: &url.Userinfo{},\\n\\t\\t\\tHost: wssConfig.Server + \\\":\\\" + strconv.Itoa(wssConfig.Port),\\n\\t\\t\\tPath: \\\"\\\",\\n\\t\\t\\tRawPath: \\\"\\\",\\n\\t\\t\\tForceQuery: false,\\n\\t\\t\\tRawQuery: \\\"\\\",\\n\\t\\t\\tFragment: \\\"\\\",\\n\\t\\t\\tRawFragment: \\\"\\\",\\n\\t\\t}\\n\\t\\tc, _, err := websocket.DefaultDialer.Dial(u.String(), nil)\\n\\t\\tif err != nil {\\n\\t\\t\\tlogger.Errorf(\\\"Can't access server \\\")\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tdefer c.Close()\\n\\t\\t_, msg, err := c.ReadMessage()\\n\\t\\tif err != nil {\\n\\t\\t\\tlogger.Errorf(\\\"Can't read message\\\")\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tmsgString := string(msg)\\n\\t\\tlogger.Infof(\\\"Recieve message: \\\" + msgString)\\n\\n\\t\\ttime.Sleep(time.Duration(3) * time.Second)\\n\\t}\\n}\",\n \"func (s *Server) Start() {\\n\\tlog.Infof(\\\"listening at %s\\\", s.Server.Addr)\\n\\tif err := s.ListenAndServeTLS(\\\"\\\", \\\"\\\"); err != nil {\\n\\t\\tif errors.Is(err, http.ErrServerClosed) {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tlog.Fatal(err)\\n\\t}\\n}\",\n \"func Start(ctx context.Context, addr string, svc domain.CustomerService) error {\\n\\ts := newServer(svc)\\n\\n\\tsrv := http.Server{\\n\\t\\tAddr: addr,\\n\\t\\tHandler: handlers.LoggingHandler(os.Stdout, handlers.ProxyHeaders(s.router)),\\n\\t}\\n\\n\\terrs := make(chan error)\\n\\tgo func() {\\n\\t\\terrs <- srv.ListenAndServe()\\n\\t}()\\n\\n\\tselect {\\n\\tcase err := <-errs:\\n\\t\\treturn err\\n\\tcase <-ctx.Done():\\n\\t\\tctxShutDown, cancel := context.WithTimeout(context.Background(), 15*time.Second)\\n\\t\\tdefer func() {\\n\\t\\t\\tcancel()\\n\\t\\t}()\\n\\n\\t\\terr := srv.Shutdown(ctxShutDown)\\n\\t\\tif err != nil && err != http.ErrServerClosed {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func (client *Client) ListenAndServe(record *ConnRecord, wsc []*WebSocketClient, address string, onConnected func()) error {\\n\\tnetListener, err := net.Listen(\\\"tcp\\\", address)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\ttcpl, ok := (netListener).(*net.TCPListener)\\n\\tif !ok {\\n\\t\\treturn errors.New(\\\"not a tcp listener\\\")\\n\\t}\\n\\tclient.tcpl = tcpl\\n\\n\\t// 在client刚启动，连上ws server以后要做的事\\n\\tonConnected()\\n\\tfor {\\n\\t\\t// 先检查stop 如果已经被close 不再接收新请求\\n\\t\\tselect {\\n\\t\\tcase <-client.stop:\\n\\t\\t\\treturn StoppedError\\n\\t\\tdefault:\\n\\t\\t\\t// if the channel is still open, continue as normal\\n\\t\\t}\\n\\n\\t\\tc, err := tcpl.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn fmt.Errorf(\\\"tcp accept error: %w\\\", err)\\n\\t\\t}\\n\\n\\t\\tgo func() {\\n\\t\\t\\tconn := c.(*net.TCPConn)\\n\\t\\t\\t// defer c.Close()\\n\\t\\t\\tdefer conn.Close()\\n\\t\\t\\t// In reply, we can get proxy type, target address and first send data.\\n\\t\\t\\tfirstSendData, proxyType, addr, err := client.Reply(conn)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tlog.Error(\\\"reply error: \\\", err)\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\t// 在client.Close中使用wait等待\\n\\t\\t\\tclient.wgClose.Add(1)\\n\\t\\t\\tdefer client.wgClose.Done()\\n\\n\\t\\t\\tswitch proxyType {\\n\\t\\t\\tcase ProxyTypeSocks5:\\n\\t\\t\\t\\tconn.Write([]byte{0x05, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00})\\n\\t\\t\\tcase ProxyTypeHttps:\\n\\t\\t\\t\\tconn.Write([]byte(\\\"HTTP/1.0 200 Connection Established\\\\r\\\\nProxy-agent: wssocks\\\\r\\\\n\\\\r\\\\n\\\"))\\n\\t\\t\\t}\\n\\n\\t\\t\\t// 更新输出区域的连接数据\\n\\t\\t\\trecord.Update(ConnStatus{IsNew: true, Address: addr, Type: proxyType})\\n\\t\\t\\tdefer record.Update(ConnStatus{IsNew: false, Address: addr, Type: proxyType})\\n\\n\\t\\t\\t// 检查addr或addr的解析地址是不是私有地址等\\n\\t\\t\\tif checkAddrPrivite(addr) {\\n\\t\\t\\t\\tif err := client.localVisit(conn, firstSendData, addr); err != nil {\\n\\t\\t\\t\\t\\tlog.Error(\\\"visit error: \\\", err)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\t// 传输数据\\n\\t\\t\\t// on connection established, copy data now.\\n\\t\\t\\tif err := client.transData(wsc, conn, firstSendData, addr); err != nil {\\n\\t\\t\\t\\tlog.Error(\\\"trans error: \\\", err)\\n\\t\\t\\t}\\n\\t\\t}()\\n\\t}\\n}\",\n \"func (g *GRPC) Start() <-chan bool {\\n\\tlog.Printf(\\\"GRPC: %s listening on %d/%d\\\", g.Backend, g.Port, g.SecurePort)\\n\\n\\texited := make(chan bool)\\n\\tproto := \\\"tcp\\\"\\n\\n\\tgo func() {\\n\\t\\tport := fmt.Sprintf(\\\":%d\\\", g.Port)\\n\\n\\t\\tln, err := net.Listen(proto, port)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Fatal()\\n\\t\\t}\\n\\n\\t\\ts := grpc.NewServer(DefaultOpts()...)\\n\\t\\tpb.RegisterEchoServiceServer(s, g)\\n\\t\\ts.Serve(ln)\\n\\n\\t\\tdefer ln.Close()\\n\\t\\tclose(exited)\\n\\t}()\\n\\n\\tgo func() {\\n\\t\\tcer, err := tls.LoadX509KeyPair(g.Cert, g.Key)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Fatal(err)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\tconfig := &tls.Config{Certificates: []tls.Certificate{cer}}\\n\\t\\tport := fmt.Sprintf(\\\":%d\\\", g.SecurePort)\\n\\t\\tln, err := tls.Listen(proto, port, config)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Fatal(err)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\ts := grpc.NewServer(DefaultOpts()...)\\n\\t\\tpb.RegisterEchoServiceServer(s, g)\\n\\t\\ts.Serve(ln)\\n\\n\\t\\tdefer ln.Close()\\n\\t\\tclose(exited)\\n\\t}()\\n\\n\\tlog.Print(\\\"starting gRPC echo service\\\")\\n\\treturn exited\\n}\",\n \"func (c *Carnegie) Start() error {\\n\\tif c.Started {\\n\\t\\treturn nil\\n\\t}\\n\\tc.Started = true\\n\\tgo c.updateCacheLoop()\\n\\tif certFile, keyFile := c.Config.GetString(\\\"cert\\\"), c.Config.GetString(\\\"key\\\"); certFile != \\\"\\\" && keyFile != \\\"\\\" {\\n\\t\\tgo c.Server.ListenAndServeTLS(certFile, keyFile)\\n\\t}\\n\\treturn c.Server.ListenAndServe()\\n}\",\n \"func (s *Server) Start() {\\n\\ts.wrap()\\n\\n\\tgo func() {\\n\\t\\ts.Config.Serve(s.Listener)\\n\\t}()\\n}\",\n \"func (hs *HttpServer) Start() (err error) {\\n\\tpanic(\\\"todo - StartServer\\\")\\n\\n\\t// Start listening to the server port\\n\\n\\t// Accept connection from client\\n\\n\\t// Spawn a go routine to handle request\\n\\n}\",\n \"func (c *WSClient) Start(ctx context.Context) error {\\n\\tif err := c.dial(); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tc.ResponsesCh = make(chan rpctypes.RPCResponse)\\n\\n\\tc.send = make(chan rpctypes.RPCRequest)\\n\\t// 1 additional error may come from the read/write\\n\\t// goroutine depending on which failed first.\\n\\tc.reconnectAfter = make(chan error, 1)\\n\\t// capacity for 1 request. a user won't be able to send more because the send\\n\\t// channel is unbuffered.\\n\\tc.backlog = make(chan rpctypes.RPCRequest, 1)\\n\\n\\tc.startReadWriteRoutines(ctx)\\n\\tgo c.reconnectRoutine(ctx)\\n\\n\\treturn nil\\n}\",\n \"func (m *Server) Start() error {\\n\\tgo func() {\\n\\t\\tif err := http.Serve(m.Listener, m); err != http.ErrServerClosed {\\n\\t\\t\\tlog.Printf(\\\"Unable to listen and serve: %v\\\", err)\\n\\t\\t}\\n\\t}()\\n\\treturn nil\\n}\",\n \"func (irc *IrcCon) Start() {\\n\\tgo irc.handleIncomingMessages()\\n\\tgo irc.handleOutgoingMessages()\\n\\n\\tgo func() {\\n\\t\\tunaddr,err := net.ResolveUnixAddr(\\\"unix\\\", irc.unixastr)\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\t\\tlist,err := net.ListenUnix(\\\"unix\\\", unaddr)\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\t\\tcon,err := list.AcceptUnix()\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\t\\tlist.Close()\\n\\n\\t\\tfi,err := irc.con.(*net.TCPConn).File()\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\n\\t\\terr = sendfd.SendFD(con,fi)\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\n\\t\\tclose(irc.Incoming)\\n\\t\\tclose(irc.outgoing)\\n\\t}()\\n\\n\\t// Only register on an initial connection\\n\\tif !irc.reconnect {\\n\\t\\t//Server registration\\n\\t\\tirc.Send(fmt.Sprintf(\\\"USER %s 8 * :%s\\\", irc.nick, irc.nick))\\n\\t\\tirc.Send(fmt.Sprintf(\\\"NICK %s\\\", irc.nick))\\n\\t}\\n}\",\n \"func startListen() {\\n\\tconfig, err := config.Config()\\n\\tif err != nil {\\n\\t\\tlog.Log().Error.Println(err)\\n\\t\\tpanic(err)\\n\\t}\\n\\tstorage, err := storage.Instance()\\n\\tif err != nil {\\n\\t\\tlog.Log().Error.Println(err)\\n\\t}\\n\\tprefix := config.Prefix\\n\\tconverter := convert.NewConverter(config.CodeLength, storage)\\n\\tinternalPort := strconv.Itoa(config.Port)\\n\\tinternalAddress := \\\":\\\" + internalPort\\n\\tln, err := net.Listen(\\\"tcp\\\", internalAddress)\\n\\tif err != nil {\\n\\t\\tlog.Log().Error.Println(err)\\n\\t\\tpanic(err)\\n\\t}\\n\\tdefer ln.Close()\\n\\tfor {\\n\\t\\tconn, err := ln.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Log().Error.Println(err)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tgo handleConnection(conn, converter, prefix)\\n\\t}\\n}\",\n \"func (s *echoServer) Start() {\\n\\te := s.Instance\\n\\n\\t// Currently this server is only used for the core API so the logic below\\n\\t// is fine here. If we need to expand this to be used in multiple locations\\n\\t// the below can be done via first-class functions\\n\\te.Pre(middleware.HTTPSRedirect())\\n\\n\\te.Use(middleware.RequestID())\\n\\te.Use(middleware.Recover())\\n\\te.Use(middleware.LoggerWithConfig(middleware.LoggerConfig{\\n\\t\\tOutput: logger.Instance().Logger().Writer(),\\n\\t}))\\n\\n\\trouter.Setup(e)\\n\\n\\tport := utils.GetVariable(consts.API_PORT)\\n\\tport = fmt.Sprintf(\\\":%s\\\", port)\\n\\n\\tcertDir := utils.GetVariable(consts.CERT_DIR)\\n\\te.Logger.Fatal(e.StartTLS(port,\\n\\t\\tfmt.Sprintf(\\\"%s/%s\\\", certDir, utils.GetVariable(consts.API_CERT)),\\n\\t\\tfmt.Sprintf(\\\"%s/%s\\\", certDir, utils.GetVariable(consts.API_KEY))))\\n}\",\n \"func (g GrpcServer) Start() {\\n\\tgo func() {\\n\\t\\tg.errCh <- g.server.Serve(g.listener)\\n\\t}()\\n}\",\n \"func (c *Connector) Start(addr string) error {\\n\\n\\tconn, err := net.Dial(\\\"tcp\\\", addr)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tc.conn = conn\\n\\n\\tgo c.write()\\n\\n\\t// send handshake packet\\n\\tc.send(hsd)\\n\\n\\tfmt.Println(\\\"connect ok:\\\", addr )\\n\\n\\t// read and process network message\\n\\tgo c.read()\\n\\n\\treturn nil\\n}\",\n \"func (di Dispatcher) Start() {\\n\\taddr := fmt.Sprintf(\\\"%s:%d\\\", di.IP, di.Port)\\n\\n\\terr := http.ListenAndServe(addr, &di)\\n\\tif err != nil {\\n\\t\\tlogging.Fatalf(\\\"ListenAndServe: \\\" + err.Error())\\n\\t}\\n}\",\n \"func (p *MyProxy) Run(addr string) {\\r\\n\\thttp.ListenAndServe(addr, p)\\r\\n}\",\n \"func (serv *webService) Start(ctx context.Context) error {\\n\\tvar err error\\n\\tserv.RPC, err = rpchttp.New(fmt.Sprintf(\\\"http://127.0.0.1:%d\\\", serv.RPCPort), \\\"/websocket\\\")\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tserv.Server = &http.Server{Addr: \\\":21478\\\", Handler: serv.Mux}\\n\\treturn serv.Server.ListenAndServe()\\n}\",\n \"func (s *Server) Start() {\\n\\tif s.State() != Init {\\n\\t\\ts.log.Errorf(\\\"server is not in a valid state, want: %q have: %q\\\", \\\"NEW\\\", s.State().String())\\n\\t\\treturn\\n\\t}\\n\\n\\tlog.WithFields(log.Fields{\\n\\t\\t\\\"grpc-address\\\": s.Address(),\\n\\t\\t\\\"http-address\\\": s.HTTPAddress(),\\n\\t}).Infof(\\\"server starting\\\")\\n\\n\\tgo s.handleSignals()\\n\\n\\ts.changeState(Starting)\\n\\n\\tgo func() {\\n\\t\\tif err := s.transport.Serve(s.listener); err != nil {\\n\\t\\t\\ts.appendErr(err)\\n\\t\\t\\ts.changeState(Error)\\n\\t\\t}\\n\\t}()\\n\\tif s.httpTransport != nil {\\n\\t\\tgo func() {\\n\\t\\t\\tif err := s.httpTransport.Serve(s.httpListener); err != nil {\\n\\t\\t\\t\\ts.appendErr(err)\\n\\t\\t\\t\\ts.changeState(Error)\\n\\t\\t\\t}\\n\\t\\t}()\\n\\t}\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75999963","0.75512546","0.7463912","0.7431335","0.7222038","0.720096","0.6901696","0.68746305","0.6860362","0.683905","0.68183726","0.6795194","0.67091537","0.6708329","0.67044413","0.67020655","0.6701726","0.670116","0.6652177","0.660221","0.6591193","0.65840685","0.65819705","0.65728337","0.6564923","0.6549498","0.65103865","0.6488972","0.6486206","0.64798284","0.6445588","0.64438176","0.64365923","0.6429979","0.6429743","0.64101714","0.6386404","0.63689107","0.6360359","0.6359151","0.63059634","0.6298335","0.6290991","0.6288548","0.62883645","0.6259276","0.62580955","0.6248014","0.6222372","0.62212384","0.61993134","0.6197007","0.6173929","0.61707634","0.61703974","0.6168494","0.61613345","0.61521226","0.6141919","0.61418486","0.6131022","0.61227983","0.6122755","0.6121271","0.61024845","0.60942227","0.6093992","0.60773104","0.6076821","0.6072398","0.60630786","0.6058562","0.6048003","0.60418767","0.60417444","0.6039018","0.60366964","0.6031884","0.6024434","0.60220426","0.60208076","0.6015918","0.6009886","0.6002638","0.5999713","0.5997867","0.5997435","0.59913814","0.598622","0.59853137","0.5982435","0.5981057","0.59687895","0.59654987","0.59619176","0.59526825","0.59504586","0.59438694","0.5928039","0.59272194"],"string":"[\n \"0.75999963\",\n \"0.75512546\",\n \"0.7463912\",\n \"0.7431335\",\n \"0.7222038\",\n \"0.720096\",\n \"0.6901696\",\n \"0.68746305\",\n \"0.6860362\",\n \"0.683905\",\n \"0.68183726\",\n \"0.6795194\",\n \"0.67091537\",\n \"0.6708329\",\n \"0.67044413\",\n \"0.67020655\",\n \"0.6701726\",\n \"0.670116\",\n \"0.6652177\",\n \"0.660221\",\n \"0.6591193\",\n \"0.65840685\",\n \"0.65819705\",\n \"0.65728337\",\n \"0.6564923\",\n \"0.6549498\",\n \"0.65103865\",\n \"0.6488972\",\n \"0.6486206\",\n \"0.64798284\",\n \"0.6445588\",\n \"0.64438176\",\n \"0.64365923\",\n \"0.6429979\",\n \"0.6429743\",\n \"0.64101714\",\n \"0.6386404\",\n \"0.63689107\",\n \"0.6360359\",\n \"0.6359151\",\n \"0.63059634\",\n \"0.6298335\",\n \"0.6290991\",\n \"0.6288548\",\n \"0.62883645\",\n \"0.6259276\",\n \"0.62580955\",\n \"0.6248014\",\n \"0.6222372\",\n \"0.62212384\",\n \"0.61993134\",\n \"0.6197007\",\n \"0.6173929\",\n \"0.61707634\",\n \"0.61703974\",\n \"0.6168494\",\n \"0.61613345\",\n \"0.61521226\",\n \"0.6141919\",\n \"0.61418486\",\n \"0.6131022\",\n \"0.61227983\",\n \"0.6122755\",\n \"0.6121271\",\n \"0.61024845\",\n \"0.60942227\",\n \"0.6093992\",\n \"0.60773104\",\n \"0.6076821\",\n \"0.6072398\",\n \"0.60630786\",\n \"0.6058562\",\n \"0.6048003\",\n \"0.60418767\",\n \"0.60417444\",\n \"0.6039018\",\n \"0.60366964\",\n \"0.6031884\",\n \"0.6024434\",\n \"0.60220426\",\n \"0.60208076\",\n \"0.6015918\",\n \"0.6009886\",\n \"0.6002638\",\n \"0.5999713\",\n \"0.5997867\",\n \"0.5997435\",\n \"0.59913814\",\n \"0.598622\",\n \"0.59853137\",\n \"0.5982435\",\n \"0.5981057\",\n \"0.59687895\",\n \"0.59654987\",\n \"0.59619176\",\n \"0.59526825\",\n \"0.59504586\",\n \"0.59438694\",\n \"0.5928039\",\n \"0.59272194\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.59322196"},"document_rank":{"kind":"string","value":"98"}}},{"rowIdx":2792,"cells":{"query":{"kind":"string","value":"NewPlanner returns a new instance of Planner."},"document":{"kind":"string","value":"func NewPlanner(db DB) *Planner {\n\treturn &Planner{\n\t\tDB: db,\n\t\tNow: time.Now,\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func NewPlanner() Planner {\n\treturn &simplePlanner{}\n}","func NewPlanner(ctx *Context) *PlannerDefault {\n\tp := &PlannerDefault{\n\t\tCtx: ctx,\n\t\tchildren: make([]Task, 0),\n\t}\n\tp.Planner = p\n\treturn p\n}","func NewPlanner()(*Planner) {\n m := &Planner{\n Entity: *NewEntity(),\n }\n return m\n}","func New(context *context.AutoscalingContext, processors *processors.AutoscalingProcessors, deleteOptions simulator.NodeDeleteOptions) *Planner {\n\tresourceLimitsFinder := resource.NewLimitsFinder(processors.CustomResourcesProcessor)\n\tminUpdateInterval := context.AutoscalingOptions.NodeGroupDefaults.ScaleDownUnneededTime\n\tif minUpdateInterval == 0*time.Nanosecond {\n\t\tminUpdateInterval = 1 * time.Nanosecond\n\t}\n\treturn &Planner{\n\t\tcontext: context,\n\t\tunremovableNodes: unremovable.NewNodes(),\n\t\tunneededNodes: unneeded.NewNodes(processors.NodeGroupConfigProcessor, resourceLimitsFinder),\n\t\trs: simulator.NewRemovalSimulator(context.ListerRegistry, context.ClusterSnapshot, context.PredicateChecker, simulator.NewUsageTracker(), deleteOptions, true),\n\t\tactuationInjector: scheduling.NewHintingSimulator(context.PredicateChecker),\n\t\teligibilityChecker: eligibility.NewChecker(processors.NodeGroupConfigProcessor),\n\t\tnodeUtilizationMap: make(map[string]utilization.Info),\n\t\tresourceLimitsFinder: resourceLimitsFinder,\n\t\tcc: newControllerReplicasCalculator(context.ListerRegistry),\n\t\tscaleDownSetProcessor: processors.ScaleDownSetProcessor,\n\t\tminUpdateInterval: minUpdateInterval,\n\t}\n}","func New(db PlanData) Planner {\n\treturn Planner{\n\t\tdata: db,\n\t}\n}","func NewPlan() *Plan {\n\treturn &Plan{\n\t\tNodeMap: make(map[string]*GraphNode),\n\t}\n}","func NewJourneyPlanner(database db.Database) (*journeyPlanner,error) {\n\n\t// Create planner\n\tjp := new(journeyPlanner)\n\n\t// Create or open table\n\ttable,err := database.OpenTable(journeyPlannerTableName)\n\tif err == db.ETABLENOTFOUND { \n\t\ttable,err = database.CreateTable(journeyPlannerTableName)\n\t}\n\tif err != nil {\n\t\treturn jp,err\n\t}\n\tjp.table = table\n\treturn jp,nil\n}","func NewPlanner(logger log.Logger, ranges []int64, noCompBlocks *GatherNoCompactionMarkFilter) *tsdbBasedPlanner {\n\treturn &tsdbBasedPlanner{logger: logger, ranges: ranges, noCompBlocksFunc: noCompBlocks.NoCompactMarkedBlocks}\n}","func New(udfInfo *udfspb.UDFInfo) (GoPlanner, error) {\n\tvar ret GoPlanner\n\tudfInfoBytes, err := proto.Marshal(udfInfo)\n\tif err != nil {\n\t\treturn ret, err\n\t}\n\tudfInfoData := C.CBytes(udfInfoBytes)\n\tdefer C.free(udfInfoData)\n\n\tret.planner = C.PlannerNew((*C.char)(udfInfoData), C.int(len(udfInfoBytes)))\n\n\treturn ret, nil\n}","func (m *GraphBaseServiceClient) Planner()(*ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.PlannerRequestBuilder) {\n return ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.NewPlannerRequestBuilderInternal(m.pathParameters, m.requestAdapter);\n}","func (m *GraphBaseServiceClient) Planner()(*ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.PlannerRequestBuilder) {\n return ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.NewPlannerRequestBuilderInternal(m.pathParameters, m.requestAdapter);\n}","func NewBusinessScenarioPlanner()(*BusinessScenarioPlanner) {\n m := &BusinessScenarioPlanner{\n Entity: *NewEntity(),\n }\n return m\n}","func NewPlan(obj objects.ObjectConfig) (objects.Object, error) {\n\treturn (&Plan{}).Parse(obj)\n}","func NewPlans(\n\tquery PlansQuery,\n\tservice services.Plans,\n) Plans {\n\treturn &plans{\n\t\tquery,\n\t\tservice,\n\t}\n}","func newInternalPlanner(\n\topName string,\n\ttxn *kv.Txn,\n\tuser security.SQLUsername,\n\tmemMetrics *MemoryMetrics,\n\texecCfg *ExecutorConfig,\n\tsessionData sessiondatapb.SessionData,\n\topts ...InternalPlannerParamsOption,\n) (*planner, func()) {\n\t// Default parameters which may be override by the supplied options.\n\tparams := &internalPlannerParams{\n\t\t// The table collection used by the internal planner does not rely on the\n\t\t// deprecatedDatabaseCache and there are no subscribers to the\n\t\t// deprecatedDatabaseCache, so we can leave it uninitialized.\n\t\t// Furthermore, we're not concerned about the efficiency of querying tables\n\t\t// with user-defined types, hence the nil hydratedTables.\n\t\tcollection: descs.NewCollection(execCfg.Settings, execCfg.LeaseManager, nil /* hydratedTables */),\n\t}\n\tfor _, opt := range opts {\n\t\topt(params)\n\t}\n\n\t// We need a context that outlives all the uses of the planner (since the\n\t// planner captures it in the EvalCtx, and so does the cleanup function that\n\t// we're going to return. We just create one here instead of asking the caller\n\t// for a ctx with this property. This is really ugly, but the alternative of\n\t// asking the caller for one is hard to explain. What we need is better and\n\t// separate interfaces for planning and running plans, which could take\n\t// suitable contexts.\n\tctx := logtags.AddTag(context.Background(), opName, \"\")\n\n\tsd := &sessiondata.SessionData{\n\t\tSessionData: sessionData,\n\t\tSearchPath: sessiondata.DefaultSearchPathForUser(user),\n\t\tSequenceState: sessiondata.NewSequenceState(),\n\t\tLocation: time.UTC,\n\t}\n\tsd.SessionData.Database = \"system\"\n\tsd.SessionData.UserProto = user.EncodeProto()\n\tdataMutator := &sessionDataMutator{\n\t\tdata: sd,\n\t\tdefaults: SessionDefaults(map[string]string{\n\t\t\t\"application_name\": \"crdb-internal\",\n\t\t\t\"database\": \"system\",\n\t\t}),\n\t\tsettings: execCfg.Settings,\n\t\tparamStatusUpdater: &noopParamStatusUpdater{},\n\t\tsetCurTxnReadOnly: func(bool) {},\n\t}\n\n\tvar ts time.Time\n\tif txn != nil {\n\t\treadTimestamp := txn.ReadTimestamp()\n\t\tif readTimestamp.IsEmpty() {\n\t\t\tpanic(\"makeInternalPlanner called with a transaction without timestamps\")\n\t\t}\n\t\tts = readTimestamp.GoTime()\n\t}\n\n\tp := &planner{execCfg: execCfg, alloc: &rowenc.DatumAlloc{}}\n\n\tp.txn = txn\n\tp.stmt = Statement{}\n\tp.cancelChecker = cancelchecker.NewCancelChecker(ctx)\n\tp.isInternalPlanner = true\n\n\tp.semaCtx = tree.MakeSemaContext()\n\tp.semaCtx.SearchPath = sd.SearchPath\n\tp.semaCtx.TypeResolver = p\n\n\tplannerMon := mon.NewUnlimitedMonitor(ctx,\n\t\tfmt.Sprintf(\"internal-planner.%s.%s\", user, opName),\n\t\tmon.MemoryResource,\n\t\tmemMetrics.CurBytesCount, memMetrics.MaxBytesHist,\n\t\tnoteworthyInternalMemoryUsageBytes, execCfg.Settings)\n\n\tp.extendedEvalCtx = internalExtendedEvalCtx(\n\t\tctx, sd, dataMutator, params.collection, txn, ts, ts, execCfg, plannerMon,\n\t)\n\tp.extendedEvalCtx.Planner = p\n\tp.extendedEvalCtx.PrivilegedAccessor = p\n\tp.extendedEvalCtx.SessionAccessor = p\n\tp.extendedEvalCtx.ClientNoticeSender = p\n\tp.extendedEvalCtx.Sequence = p\n\tp.extendedEvalCtx.Tenant = p\n\tp.extendedEvalCtx.JoinTokenCreator = p\n\tp.extendedEvalCtx.ClusterID = execCfg.ClusterID()\n\tp.extendedEvalCtx.ClusterName = execCfg.RPCContext.ClusterName()\n\tp.extendedEvalCtx.NodeID = execCfg.NodeID\n\tp.extendedEvalCtx.Locality = execCfg.Locality\n\n\tp.sessionDataMutator = dataMutator\n\tp.autoCommit = false\n\n\tp.extendedEvalCtx.MemMetrics = memMetrics\n\tp.extendedEvalCtx.ExecCfg = execCfg\n\tp.extendedEvalCtx.Placeholders = &p.semaCtx.Placeholders\n\tp.extendedEvalCtx.Annotations = &p.semaCtx.Annotations\n\tp.extendedEvalCtx.Descs = params.collection\n\n\tp.queryCacheSession.Init()\n\tp.optPlanningCtx.init(p)\n\n\treturn p, func() {\n\t\t// Note that we capture ctx here. This is only valid as long as we create\n\t\t// the context as explained at the top of the method.\n\n\t\t// The collection will accumulate descriptors read during planning as well\n\t\t// as type descriptors read during execution on the local node. Many users\n\t\t// of the internal planner do set the `skipCache` flag on the resolver but\n\t\t// this is not respected by type resolution underneath execution. That\n\t\t// subtle details means that the type descriptor used by execution may be\n\t\t// stale, but that must be okay. Correctness concerns aside, we must release\n\t\t// the leases to ensure that we don't leak a descriptor lease.\n\t\tp.Descriptors().ReleaseAll(ctx)\n\n\t\t// Stop the memory monitor.\n\t\tplannerMon.Stop(ctx)\n\t}\n}","func NewPlan(config *Config, name string) (plan *Plan, err error) {\n\tpath, err := FindPlanPath(config, name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tplan, err = ReadPath(path.String())\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn plan, nil\n}","func New(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize, bulkSize int, w io.Writer) (Executor, error) {\n\tswitch stm.Type() {\n\tcase semantic.Query:\n\t\treturn newQueryPlan(ctx, store, stm, chanSize, w)\n\tcase semantic.Insert:\n\t\treturn &insertPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Delete:\n\t\treturn &deletePlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Create:\n\t\treturn &createPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Drop:\n\t\treturn &dropPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Construct:\n\t\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\n\t\treturn &constructPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t\tbulkSize: bulkSize,\n\t\t\tqueryPlan: qp,\n\t\t\tconstruct: true,\n\t\t}, nil\n\tcase semantic.Deconstruct:\n\t\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\n\t\treturn &constructPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t\tbulkSize: bulkSize,\n\t\t\tqueryPlan: qp,\n\t\t\tconstruct: false,\n\t\t}, nil\n\tcase semantic.Show:\n\t\treturn &showPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"planner.New: unknown statement type in statement %v\", stm)\n\t}\n}","func (pb PlannerBuilder) Build() Planner {\n\treturn &planner{\n\t\tlp: NewLogicalPlanner(pb.lopts...),\n\t\tpp: NewPhysicalPlanner(pb.popts...),\n\t}\n}","func NewPlanParser(input antlr.TokenStream) *PlanParser {\n\tthis := new(PlanParser)\n\tdeserializer := antlr.NewATNDeserializer(nil)\n\tdeserializedATN := deserializer.DeserializeFromUInt16(parserATN)\n\tdecisionToDFA := make([]*antlr.DFA, len(deserializedATN.DecisionToState))\n\tfor index, ds := range deserializedATN.DecisionToState {\n\t\tdecisionToDFA[index] = antlr.NewDFA(ds, index)\n\t}\n\tthis.BaseParser = antlr.NewBaseParser(input)\n\n\tthis.Interpreter = antlr.NewParserATNSimulator(this, deserializedATN, decisionToDFA, antlr.NewPredictionContextCache())\n\tthis.RuleNames = ruleNames\n\tthis.LiteralNames = literalNames\n\tthis.SymbolicNames = symbolicNames\n\tthis.GrammarFileName = \"Plan.g4\"\n\n\treturn this\n}","func New() (ugrade.JobSolver, error) {\n\treturn &defaultSolver{\n\t\tcompiler: compiler.New(),\n\t\ttcgenerator: tcgenerator.NewGenerator(),\n\t\tsubmissionExecutor: executor.New(),\n\t\tchecker: checker.New(),\n\t}, nil\n}","func (m *Group) SetPlanner(value PlannerGroupable)() {\n m.planner = value\n}","func NewPlans(useCase usecases.Plans) Plans {\n\treturn &plans{useCase}\n}","func NewPlan(t, s string, b []interface{}) Plan {\n\treturn Plan{\n\t\tTitle: t,\n\t\tButtons: b,\n\t\tSubTitle: s,\n\t}\n}","func New(cost int) abstract.Scheme {\n\treturn &scheme{\n\t\tCost: cost,\n\t}\n}","func NewDTODPlanner(dtodPlannerMileage DTODPlannerMileage) Planner {\n\treturn &dtodPlanner{\n\t\tdtodPlannerMileage: dtodPlannerMileage,\n\t}\n}","func newQueryPlan(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize int, w io.Writer) (*queryPlan, error) {\n\tt, err := table.New([]string{})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &queryPlan{\n\t\tstm: stm,\n\t\tstore: store,\n\t\tbndgs: stm.Bindings(),\n\t\tgrfsNames: stm.InputGraphNames(),\n\t\tclauses: stm.GraphPatternClauses(),\n\t\tfilters: stm.FilterClauses(),\n\t\ttbl: t,\n\t\tchanSize: chanSize,\n\t\ttracer: w,\n\t}, nil\n}","func New(it *msvc.ProjectIterator) *Graph {\n\tgr := &Graph{\n\t\tg: simple.NewDirectedGraph(),\n\t\tallNodes: rbtree.New(),\n\t\tnextID: 1,\n\t}\n\n\tit.Foreach(gr.newNode)\n\tait := rbtree.NewWalkInorder(gr.allNodes)\n\tait.Foreach(gr.newEdges)\n\n\treturn gr\n}","func newPager() *pager {\n\treturn &pager{\n\t\tpageMap: make(map[int]page),\n\t\tpagesize: 500,\n\t}\n}","func NewHHGPlanner(dtodPlannerMileage DTODPlannerMileage) Planner {\n\treturn &hhgPlanner{\n\t\tdtodPlannerMileage: dtodPlannerMileage,\n\t}\n}","func New(input io.Reader) Solution {\n\treturn Solution{Passports: parse(input)}\n}","func New(port *Port, timeout time.Duration, options ...Option) (*PLM, error) {\n\tplm := &PLM{\n\t\ttimeout: timeout,\n\t\twriteDelay: 500 * time.Millisecond,\n\t\tport: port,\n\t\tconnections: make(map[insteon.Address]insteon.Connection),\n\n\t\tinsteonTxCh: make(chan *insteon.Message),\n\t\tinsteonRxCh: make(chan *insteon.Message),\n\t\tplmCh: make(chan *Packet),\n\t}\n\tplm.linkdb.plm = plm\n\tplm.linkdb.timeout = timeout\n\n\tfor _, o := range options {\n\t\terr := o(plm)\n\t\tif err != nil {\n\t\t\tinsteon.Log.Infof(\"error setting plm option: %v\", err)\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tgo plm.readLoop()\n\tgo plm.writeLoop()\n\treturn plm, nil\n}","func NewPar(P, Q Process) *Par { return &Par{Procs: []Process{P, Q}} }","func NewPlan(userSctx sessionctx.Context, plan *plannercore.LoadData, tbl table.Table) (*Plan, error) {\n\tfullTableName := common.UniqueTable(plan.Table.Schema.L, plan.Table.Name.L)\n\tlogger := log.L().With(zap.String(\"table\", fullTableName))\n\tvar format string\n\tif plan.Format != nil {\n\t\tformat = strings.ToLower(*plan.Format)\n\t} else {\n\t\t// without FORMAT 'xxx' clause, default to DELIMITED DATA\n\t\tformat = LoadDataFormatDelimitedData\n\t}\n\tcharset := plan.Charset\n\tif charset == nil {\n\t\t// https://dev.mysql.com/doc/refman/8.0/en/load-data.html#load-data-character-set\n\t\td, err2 := userSctx.GetSessionVars().GetSessionOrGlobalSystemVar(\n\t\t\tcontext.Background(), variable.CharsetDatabase)\n\t\tif err2 != nil {\n\t\t\tlogger.Error(\"LOAD DATA get charset failed\", zap.Error(err2))\n\t\t} else {\n\t\t\tcharset = &d\n\t\t}\n\t}\n\trestrictive := userSctx.GetSessionVars().SQLMode.HasStrictMode() &&\n\t\tplan.OnDuplicate != ast.OnDuplicateKeyHandlingIgnore\n\n\tp := &Plan{\n\t\tTableInfo: tbl.Meta(),\n\t\tDBName: plan.Table.Schema.O,\n\t\tDBID: plan.Table.DBInfo.ID,\n\n\t\tPath: plan.Path,\n\t\tFormat: format,\n\t\tRestrictive: restrictive,\n\t\tIgnoreLines: plan.IgnoreLines,\n\n\t\tSQLMode: userSctx.GetSessionVars().SQLMode,\n\t\tCharset: charset,\n\t\tImportantSysVars: getImportantSysVars(userSctx),\n\n\t\tDistSQLScanConcurrency: userSctx.GetSessionVars().DistSQLScanConcurrency(),\n\t}\n\tif err := p.initOptions(userSctx, plan.Options); err != nil {\n\t\treturn nil, err\n\t}\n\treturn p, nil\n}","func New(source lease.Provider, logger *log.Logger, schedule ...Schedule) *Provider {\n\tp := &Provider{\n\t\tsource: source,\n\t\tlog: logger,\n\t\tschedule: schedule,\n\t\tclosed: make(chan struct{}),\n\t}\n\tif d, ok := p.durationSchedule(); ok {\n\t\t// Start a goroutine to handle duration scheduling\n\t\tgo p.durationCheckpoint(d, p.closed)\n\t}\n\treturn p\n}","func (context *handlerContext) Planner() route.Planner {\n\treturn context.planner\n}","func New(opts ...Opt) *Onpar {\n\to := Onpar{\n\t\tcurrent: &level{},\n\t\tcallCount: 1,\n\t}\n\tfor _, opt := range opts {\n\t\to = opt(o)\n\t}\n\treturn &o\n}","func new() *DAG {\n\treturn &DAG{Nodes: map[string]*Node{}}\n}","func New(id, route, target string) *Rule {\n\treturn &Rule{id, route, target}\n}","func NewLogicalPlanner(options ...LogicalOption) LogicalPlanner {\n\tthePlanner := &logicalPlanner{\n\t\theuristicPlanner: newHeuristicPlanner(),\n\t}\n\n\trules := make([]Rule, len(ruleNameToLogicalRule))\n\ti := 0\n\tfor _, v := range ruleNameToLogicalRule {\n\t\trules[i] = v\n\t\ti++\n\t}\n\n\tthePlanner.addRules(rules...)\n\n\t// Options may add or remove rules, so process them after we've\n\t// added registered rules.\n\tfor _, opt := range options {\n\t\topt.apply(thePlanner)\n\t}\n\n\treturn thePlanner\n}","func (t *MCTS) New(move int32, score float32) (retVal Naughty) {\n\tn := t.alloc()\n\tN := t.nodeFromNaughty(n)\n\tN.lock.Lock()\n\tdefer N.lock.Unlock()\n\tN.move = move\n\tN.visits = 1\n\tN.status = uint32(Active)\n\tN.qsa = 0\n\tN.psa = score\n\n\treturn n\n}","func New(s string) (*PegQuery, error) {\n\tp := &QueryParser{\n\t\tBuffer: s,\n\t}\n\tp.Expression.explainer = func(format string, args ...interface{}) {\n\t\tfmt.Printf(format, args...)\n\t}\n\tp.Init()\n\terr := p.Parse()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tp.Execute()\n\treturn &PegQuery{str: s, parser: p}, nil\n}","func NewMontrealTrip(weight float32, deadline int) *Trip {\n trip := Trip{weight: weight, destination: \"Montreal\", deadline: deadline}\n return &trip\n}","func New(o *Options) (Matcher, error) {\n\t// creates data clients\n\tdataClients, err := createDataClients(o.RoutesFile)\n\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\trouting := createRouting(dataClients, o)\n\n\treturn &matcher{\n\t\trouting,\n\t}, nil\n}","func NewDML() *DML {\n\treturn &DML{RoutingParameters: &RoutingParameters{}}\n}","func New(indexer cache.Store) *Manager {\n\tlogger := &bgplog.Logger{Entry: log}\n\tc := &metallbctl.Controller{\n\t\tClient: bgpk8s.New(logger.Logger),\n\t\tIPs: metallballoc.New(),\n\t}\n\n\tf, err := os.Open(option.Config.BGPConfigPath)\n\tif err != nil {\n\t\tlog.WithError(err).Fatal(\"Failed to open BGP config file\")\n\t}\n\tdefer f.Close()\n\n\tconfig, err := bgpconfig.Parse(f)\n\tif err != nil {\n\t\tlog.WithError(err).Fatal(\"Failed to parse BGP configuration\")\n\t}\n\tc.SetConfig(logger, config)\n\n\tmgr := &Manager{\n\t\tController: c,\n\t\tlogger: logger,\n\n\t\tqueue: workqueue.New(),\n\t\tindexer: indexer,\n\t}\n\tgo mgr.run()\n\n\treturn mgr\n}","func New(operators O) *Ruler {\n\treturn &Ruler{\n\t\toperators: operators,\n\t}\n}","func New(sess *session.Session, config *client.Config) *TaskRouter {\n\treturn &TaskRouter{\n\t\tV1: v1.New(sess, config),\n\t}\n}","func NewSolver(pPath string) *Solver {\n\treturn &Solver{\n\t\tp: NewProblem(pPath),\n\t}\n}","func New(grammarString string) (*grammar.Grammar, tree.Reducer, error) {\n\tparseTree, err := runner.Run(grammarString)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\tg, r := evalGrammar(parseTree.(*tree.PN))\n\treturn g, r, nil\n}","func New(l *lexer.Lexer) *Parser {\n\tp := &Parser{l: l}\n\n\tp.nextToken()\n\tp.nextToken()\n\n\treturn p\n}","func New(callback func(types.NamespacedName), lease time.Duration) Interface {\n\treturn &impl{\n\t\tleaseDuration: lease,\n\t\tcb: callback,\n\t}\n}","func NewPlannerAssignedToTaskBoardTaskFormat()(*PlannerAssignedToTaskBoardTaskFormat) {\n m := &PlannerAssignedToTaskBoardTaskFormat{\n Entity: *NewEntity(),\n }\n return m\n}","func (r *BreakdownResolver) New() int32 {\n\treturn int32(r.breakdown.New)\n}","func New() (*TimeLord, error) {\n\tglobalMut.Lock()\n\tdefer globalMut.Unlock()\n\tif timeLordExists {\n\t\treturn nil, fmt.Errorf(\"timelord.New has already been called (only one TimeLord can be created at a time)\")\n\t}\n\ttl := &TimeLord{}\n\ttl.warp()\n\ttimeLordExists = true\n\treturn tl, nil\n}","func New(env *Options) destination.Destination {\n\tif err := env.validate(); err != nil {\n\t\tlogger.Default.Fatal(err)\n\t\treturn nil\n\t}\n\n\treturn &SQLike{\n\t\toptions: &destination.Options{\n\t\t\tDefaultSchedule: &destination.Schedule{\n\t\t\t\tRealtime: env.Realtime,\n\t\t\t\tInterval: env.Interval,\n\t\t\t\tMaxRetries: env.MaxRetries,\n\t\t\t},\n\t\t},\n\t\tenv: env,\n\t}\n}","func New() (*Payway, error) {\n\n\t// get default gateway from configuration file\n\tprovider := conf.GetString(\"gateways.payments.default\")\n\n\tif provider == \"\" {\n\t\treturn nil, fmt.Errorf(\"No default payment gateway provided\")\n\t}\n\n\t// acquare read mutex\n\tmu.RLock()\n\n\tdefer mu.RUnlock()\n\n\t// fetch gateway from cache\n\tgateway, ok := gateways[provider]\n\n\tif !ok {\n\n\t\treturn nil, fmt.Errorf(\"Gateway not registered\")\n\t}\n\n\t// Init gateway\n\tif err := gateway.New(); err != nil {\n\n\t\treturn nil, err\n\t}\n\n\treturn &Payway{PayGateway: gateway}, nil\n}","func NewPlSqlParser(input antlr.TokenStream) *PlSqlParser {\n\tPlSqlParserInit()\n\tthis := new(PlSqlParser)\n\tthis.BaseParser = antlr.NewBaseParser(input)\n\tstaticData := &plsqlparserParserStaticData\n\tthis.Interpreter = antlr.NewParserATNSimulator(this, staticData.atn, staticData.decisionToDFA, staticData.predictionContextCache)\n\tthis.RuleNames = staticData.ruleNames\n\tthis.LiteralNames = staticData.literalNames\n\tthis.SymbolicNames = staticData.symbolicNames\n\tthis.GrammarFileName = \"java-escape\"\n\n\treturn this\n}","func New(cfg Config, logger log.Logger) (*Agent, error) {\n\treturn newAgent(cfg, logger, defaultInstanceFactory)\n}","func New() {\n\ttypeOfProject()\n}","func newRouter() *Router {\n\treturn &Router{routes: make([]*Route, 0)}\n}","func New() *Resolver {\n\treturn &Resolver{}\n}","func New() *Resolver {\n\treturn &Resolver{}\n}","func NewBundlePlan() BundlePlan {\n\treturn BundlePlan{}\n}","func New() *Repl {\n\treturn &Repl{\n\t\tansi: NewANSI(true),\n\t\tconfig: defaultConfig(),\n\t\tevaluator: interpreter.New(),\n\t}\n}","func New(cmdCandidates []pakelib.CommandCandidate, cv pakelib.CommentValidator) *Parser {\n\treturn &Parser{\n\t\tcommandCandidates: cmdCandidates,\n\t\tcommentValidator: cv,\n\t}\n}","func NewParser(description string, p Parser) Parser {\n\treturn p\n}","func NewPayment(a payment.Repository, timeout time.Duration) payment.Usecase {\n\treturn &paymentUsecase{\n\t\trepo: a,\n\t\tcontextTimeout: timeout,\n\t}\n}","func (m *User) SetPlanner(value PlannerUserable)() {\n m.planner = value\n}","func (o *User) SetPlanner(v AnyOfmicrosoftGraphPlannerUser) {\n\to.Planner = &v\n}","func (opt *SGD) New() Optimizer {\n\treturn NewSGD(opt.Lr, opt.Momentum, opt.WeightDecay)\n}","func New(ctx context.Context, cfg Config) (types.Leases, error) {\n\tif err := cfg.sanitize(); err != nil {\n\t\treturn nil, err\n\t}\n\t_, err := cfg.Pool.Exec(ctx, fmt.Sprintf(schema, cfg.Target))\n\tif err != nil {\n\t\treturn nil, errors.WithStack(err)\n\t}\n\n\tl := &leases{cfg: cfg}\n\tl.sql.acquire = fmt.Sprintf(acquireTemplate, cfg.Target)\n\tl.sql.release = fmt.Sprintf(releaseTemplate, cfg.Target)\n\tl.sql.renew = fmt.Sprintf(renewTemplate, cfg.Target)\n\n\treturn l, nil\n}","func (m *Group) GetPlanner()(PlannerGroupable) {\n return m.planner\n}","func New(runner, tracker, hosted string) *Runner {\n\tn := &Runner{\n\t\ttcl: client.New(tracker, http.DefaultClient, client.JsonCodec),\n\t\tbase: hosted,\n\t\trunner: runner,\n\t\trpc: gorpc.NewServer(),\n\t\trq: rpc.NewRunnerQueue(),\n\t\tresp: make(chan rpc.Output),\n\t}\n\n\t//register the run service in the rpc\n\tif err := n.rpc.RegisterService(n.rq, \"\"); err != nil {\n\t\tpanic(err)\n\t}\n\n\t//register the pinger\n\tif err := n.rpc.RegisterService(pinger.Pinger{}, \"\"); err != nil {\n\t\tpanic(err)\n\t}\n\n\t//register ourselves in the rpc\n\tif err := n.rpc.RegisterService(n, \"\"); err != nil {\n\t\tpanic(err)\n\t}\n\n\t//register the codec\n\tn.rpc.RegisterCodec(json.NewCodec(), \"application/json\")\n\n\t//start processing\n\tgo n.run()\n\n\treturn n\n}","func newPlanCmd() *cobra.Command {\n\tpc := &planCmd{}\n\n\tplanCmd := &cobra.Command{\n\t\tUse: \"plan [-f SORUCE]\",\n\t\tShort: \"Generate and show an execution plan\",\n\t\tLong: planLong,\n\t\tExample: planExample,\n\t\tDisableFlagsInUseLine: true,\n\t\tSilenceUsage: true,\n\t\tSilenceErrors: true,\n\t\tArgs: cobra.MaximumNArgs(0),\n\t\tRunE: func(cmd *cobra.Command, args []string) error {\n\t\t\tif err := pc.meta.init(args); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\treturn pc.run(args)\n\t\t},\n\t}\n\n\tf := planCmd.Flags()\n\tf.BoolVar(&pc.destroy, \"destroy\", false, \"create plan to destroy resources\")\n\n\tpc.addMetaFlags(planCmd)\n\n\treturn planCmd\n}","func (a *allocator) New(jobSessionName string, jobTrackerInitParams interface{}) (jobtracker.JobTracker, error) {\n\t// a job session name has no meaning in DRMAA v1.\n\treturn NewDRMAATracker()\n}","func New() *Agent {\n\treturn &Agent{\n\t\tReporter: newReporter(),\n\t\tWarmUp: config.WarmupEnabled,\n\t\tTimeoutMargin: config.TimeoutMargin,\n\t\tPlugins: []plugin.Plugin{},\n\t}\n}","func New(store database.DAL) *Resolver {\n\treturn &Resolver{store}\n}","func New(pg plugingetter.PluginGetter, netConfig *NetworkConfig) (networkallocator.NetworkAllocator, error) {\n\tna := &cnmNetworkAllocator{\n\t\tnetworks: make(map[string]*network),\n\t\tservices: make(map[string]struct{}),\n\t\ttasks: make(map[string]struct{}),\n\t\tnodes: make(map[string]map[string]struct{}),\n\t\tpg: pg,\n\t}\n\n\tfor ntype, i := range initializers {\n\t\tif err := i(&na.networkRegistry); err != nil {\n\t\t\treturn nil, fmt.Errorf(\"failed to register %q network driver: %w\", ntype, err)\n\t\t}\n\t}\n\tif err := remote.Register(&na.networkRegistry, pg); err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to initialize network driver plugins: %w\", err)\n\t}\n\n\tif err := initIPAMDrivers(&na.ipamRegistry, netConfig); err != nil {\n\t\treturn nil, err\n\t}\n\tif err := remoteipam.Register(&na.ipamRegistry, pg); err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to initialize IPAM driver plugins: %w\", err)\n\t}\n\n\tpa, err := newPortAllocator()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tna.portAllocator = pa\n\treturn na, nil\n}","func New() *Router {\n\treturn &Router{\n\t\tdestinations: destinationList{},\n\t\tcommands: map[string]commandList{},\n\t\tregexpCommands: []regexpCommand{},\n\t\tdone: make(chan struct{}),\n\t}\n}","func New(width core.Px, frequencyRange core.FrequencyRange, vfoFrequency core.Frequency) *Panorama {\n\tresult := Panorama{\n\t\twidth: width,\n\t\tfrequencyRange: frequencyRange,\n\t\tdbRange: core.DBRange{From: -105, To: 10},\n\t\tresolution: map[core.ViewMode]core.HzPerPx{\n\t\t\tcore.ViewFixed: calcResolution(frequencyRange, width),\n\t\t\tcore.ViewCentered: defaultCenteredResolution,\n\t\t},\n\t\tviewMode: core.ViewFixed,\n\t\tsignalDetectionActive: true,\n\t\tmargin: 0.02,\n\t\tpeakBuffer: make(map[peakKey]peak),\n\t\tpeakTimeout: 10 * time.Second, // TODO make this configurable\n\t\tdbRangeAdjusted: true,\n\t}\n\n\tresult.vfo.Frequency = vfoFrequency\n\n\treturn &result\n}","func NewConstraint(left, operand, right string) *Constraint {\n\treturn &Constraint{\n\t\tLTarget: left,\n\t\tRTarget: right,\n\t\tOperand: operand,\n\t}\n}","func New(routeName, namespace, serviceName string, labels map[string]string) *Builder {\n\treturn &Builder{r: newRoute(routeName, namespace, serviceName, labels)}\n}","func New(usage string) *Parser {\n\tp := &Parser{}\n\tp.long2options = make(map[string]*option)\n\tp.short2options = make(map[string]*option)\n\tp.OptPadding = 20\n\tp.ParseHelp = true\n\tp.Usage = usage\n\treturn p\n}","func New(opts ...ProtocolOption) *Protocol {\n\tp := &Protocol{\n\t\tpingTimeout: 3 * time.Second,\n\t}\n\n\tfor _, opt := range opts {\n\t\topt(p)\n\t}\n\n\treturn p\n}","func New(conf config.DBConfig) *Manager {\n\tdb := pg.Connect(&pg.Options{\n\t\tAddr: fmt.Sprintf(\"%s:%s\", conf.Host, conf.Port),\n\t\tUser: conf.User,\n\t\tPassword: conf.Password,\n\t\tDatabase: conf.Database,\n\t})\n\treturn &Manager{db: db}\n}","func newRoute() *Route {\n\treturn &Route{\n\t\thandlers: make(map[string]http.Handler),\n\t\tmiddleware: make([]*middlewareForVerb, 0),\n\t\tchildren: make([]*Route, 0),\n\t}\n}","func New(dispatcher service.Dispatcher, context context.Client, channelID string, opts ...options.Opt) *PeerResolver {\n\tparams := defaultParams(context, channelID)\n\toptions.Apply(params, opts)\n\n\tlogger.Debugf(\"Creating new balanced peer resolver\")\n\n\treturn &PeerResolver{\n\t\tparams: params,\n\t}\n}","func NewRepl() (*Repl, error) {\n\trl, err := readline.New(\"box> \")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tb, err := builder.NewBuilder(true, []string{})\n\tif err != nil {\n\t\trl.Close()\n\t\treturn nil, err\n\t}\n\n\treturn &Repl{readline: rl, builder: b}, nil\n}","func New() *pool {\n\treturn &pool{\n\t\tmetrics: newMetrics(),\n\t}\n}","func (rg *RouteGroup) newRoute(method, path string) *Route {\n\treturn &Route{\n\t\tgroup: rg,\n\t\tmethod: method,\n\t\tpath: path,\n\t\ttemplate: buildURLTemplate(rg.prefix + path),\n\t}\n}","func (rg *RouteGroup) newRoute(method, path string) *Route {\n\treturn &Route{\n\t\tgroup: rg,\n\t\tmethod: method,\n\t\tpath: path,\n\t\ttemplate: buildURLTemplate(rg.prefix + path),\n\t}\n}","func New(path string) (Parser, error) {\n\n\td := dep{}\n\tif d.test(path) {\n\t\treturn d, nil\n\t}\n\n\tg := glide{}\n\n\tif g.test(path) {\n\t\treturn g, nil\n\t}\n\n\treturn nil, errors.New(\"parser not found\")\n}","func NewSolver(c CubieCube, max int) *Solver {\n\tp1Moves := NewPhase1Moves()\n\tp1Heuristic := NewPhase1Heuristic(p1Moves)\n\n\tres := new(Solver)\n\tres.stopper = make(chan struct{})\n\tres.solutions = make(chan []Move)\n\tres.phase1 = NewPhase1Solver(c.Phase1Cube(), p1Heuristic, p1Moves)\n\n\tgo res.backgroundLoop(c, nil, max)\n\treturn res\n}","func New(query string, ph string) *Builder {\n\treturn &Builder{\n\t\tbaseQuery: query,\n\t\tplaceHolder: ph,\n\t}\n}","func New() *Builder {\n\treturn &Builder{\n\t\tpatterns: make(map[string]*parser.Node),\n\t}\n}","func New(conf config.Config) Parser {\n\tmethods := map[string]bool{\n\t\thttp.MethodGet: true,\n\t\thttp.MethodHead: true,\n\t\thttp.MethodPost: true,\n\t\thttp.MethodPut: true,\n\t\thttp.MethodPatch: true,\n\t\thttp.MethodDelete: true,\n\t\thttp.MethodConnect: true,\n\t\thttp.MethodOptions: true,\n\t\thttp.MethodTrace: true,\n\t}\n\n\treturn Parser{\n\t\tconf: conf,\n\t\tmethods: methods,\n\t}\n}","func New() (*Relay, error) {\n\treturn &Relay{\n\t\tvm: newRuntime(),\n\t}, nil\n}","func New(target, filename string) *Parser {\n\treturn &Parser{\n\t\ttarget: target,\n\t\tfilename: filename,\n\t\tfields: make(map[string]*types.Field),\n\t\ttypeConv: make(map[string]string),\n\t}\n}","func New(p string, t time.Time) *PT {\n\treturn &PT{p, t}\n}","func NewPacer(delay time.Duration) *Pacer {\n\tp := &Pacer{\n\t\tdelay: delay,\n\t\tgate: make(chan struct{}),\n\t\tpause: make(chan struct{}, 1),\n\t\tpaused: make(chan struct{}, 1),\n\t}\n\n\tgo p.run()\n\treturn p\n}"],"string":"[\n \"func NewPlanner() Planner {\\n\\treturn &simplePlanner{}\\n}\",\n \"func NewPlanner(ctx *Context) *PlannerDefault {\\n\\tp := &PlannerDefault{\\n\\t\\tCtx: ctx,\\n\\t\\tchildren: make([]Task, 0),\\n\\t}\\n\\tp.Planner = p\\n\\treturn p\\n}\",\n \"func NewPlanner()(*Planner) {\\n m := &Planner{\\n Entity: *NewEntity(),\\n }\\n return m\\n}\",\n \"func New(context *context.AutoscalingContext, processors *processors.AutoscalingProcessors, deleteOptions simulator.NodeDeleteOptions) *Planner {\\n\\tresourceLimitsFinder := resource.NewLimitsFinder(processors.CustomResourcesProcessor)\\n\\tminUpdateInterval := context.AutoscalingOptions.NodeGroupDefaults.ScaleDownUnneededTime\\n\\tif minUpdateInterval == 0*time.Nanosecond {\\n\\t\\tminUpdateInterval = 1 * time.Nanosecond\\n\\t}\\n\\treturn &Planner{\\n\\t\\tcontext: context,\\n\\t\\tunremovableNodes: unremovable.NewNodes(),\\n\\t\\tunneededNodes: unneeded.NewNodes(processors.NodeGroupConfigProcessor, resourceLimitsFinder),\\n\\t\\trs: simulator.NewRemovalSimulator(context.ListerRegistry, context.ClusterSnapshot, context.PredicateChecker, simulator.NewUsageTracker(), deleteOptions, true),\\n\\t\\tactuationInjector: scheduling.NewHintingSimulator(context.PredicateChecker),\\n\\t\\teligibilityChecker: eligibility.NewChecker(processors.NodeGroupConfigProcessor),\\n\\t\\tnodeUtilizationMap: make(map[string]utilization.Info),\\n\\t\\tresourceLimitsFinder: resourceLimitsFinder,\\n\\t\\tcc: newControllerReplicasCalculator(context.ListerRegistry),\\n\\t\\tscaleDownSetProcessor: processors.ScaleDownSetProcessor,\\n\\t\\tminUpdateInterval: minUpdateInterval,\\n\\t}\\n}\",\n \"func New(db PlanData) Planner {\\n\\treturn Planner{\\n\\t\\tdata: db,\\n\\t}\\n}\",\n \"func NewPlan() *Plan {\\n\\treturn &Plan{\\n\\t\\tNodeMap: make(map[string]*GraphNode),\\n\\t}\\n}\",\n \"func NewJourneyPlanner(database db.Database) (*journeyPlanner,error) {\\n\\n\\t// Create planner\\n\\tjp := new(journeyPlanner)\\n\\n\\t// Create or open table\\n\\ttable,err := database.OpenTable(journeyPlannerTableName)\\n\\tif err == db.ETABLENOTFOUND { \\n\\t\\ttable,err = database.CreateTable(journeyPlannerTableName)\\n\\t}\\n\\tif err != nil {\\n\\t\\treturn jp,err\\n\\t}\\n\\tjp.table = table\\n\\treturn jp,nil\\n}\",\n \"func NewPlanner(logger log.Logger, ranges []int64, noCompBlocks *GatherNoCompactionMarkFilter) *tsdbBasedPlanner {\\n\\treturn &tsdbBasedPlanner{logger: logger, ranges: ranges, noCompBlocksFunc: noCompBlocks.NoCompactMarkedBlocks}\\n}\",\n \"func New(udfInfo *udfspb.UDFInfo) (GoPlanner, error) {\\n\\tvar ret GoPlanner\\n\\tudfInfoBytes, err := proto.Marshal(udfInfo)\\n\\tif err != nil {\\n\\t\\treturn ret, err\\n\\t}\\n\\tudfInfoData := C.CBytes(udfInfoBytes)\\n\\tdefer C.free(udfInfoData)\\n\\n\\tret.planner = C.PlannerNew((*C.char)(udfInfoData), C.int(len(udfInfoBytes)))\\n\\n\\treturn ret, nil\\n}\",\n \"func (m *GraphBaseServiceClient) Planner()(*ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.PlannerRequestBuilder) {\\n return ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.NewPlannerRequestBuilderInternal(m.pathParameters, m.requestAdapter);\\n}\",\n \"func (m *GraphBaseServiceClient) Planner()(*ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.PlannerRequestBuilder) {\\n return ie66b913c1bc1c536bc8db5d185910e9318f621374e016f95e36e9d59b7127f63.NewPlannerRequestBuilderInternal(m.pathParameters, m.requestAdapter);\\n}\",\n \"func NewBusinessScenarioPlanner()(*BusinessScenarioPlanner) {\\n m := &BusinessScenarioPlanner{\\n Entity: *NewEntity(),\\n }\\n return m\\n}\",\n \"func NewPlan(obj objects.ObjectConfig) (objects.Object, error) {\\n\\treturn (&Plan{}).Parse(obj)\\n}\",\n \"func NewPlans(\\n\\tquery PlansQuery,\\n\\tservice services.Plans,\\n) Plans {\\n\\treturn &plans{\\n\\t\\tquery,\\n\\t\\tservice,\\n\\t}\\n}\",\n \"func newInternalPlanner(\\n\\topName string,\\n\\ttxn *kv.Txn,\\n\\tuser security.SQLUsername,\\n\\tmemMetrics *MemoryMetrics,\\n\\texecCfg *ExecutorConfig,\\n\\tsessionData sessiondatapb.SessionData,\\n\\topts ...InternalPlannerParamsOption,\\n) (*planner, func()) {\\n\\t// Default parameters which may be override by the supplied options.\\n\\tparams := &internalPlannerParams{\\n\\t\\t// The table collection used by the internal planner does not rely on the\\n\\t\\t// deprecatedDatabaseCache and there are no subscribers to the\\n\\t\\t// deprecatedDatabaseCache, so we can leave it uninitialized.\\n\\t\\t// Furthermore, we're not concerned about the efficiency of querying tables\\n\\t\\t// with user-defined types, hence the nil hydratedTables.\\n\\t\\tcollection: descs.NewCollection(execCfg.Settings, execCfg.LeaseManager, nil /* hydratedTables */),\\n\\t}\\n\\tfor _, opt := range opts {\\n\\t\\topt(params)\\n\\t}\\n\\n\\t// We need a context that outlives all the uses of the planner (since the\\n\\t// planner captures it in the EvalCtx, and so does the cleanup function that\\n\\t// we're going to return. We just create one here instead of asking the caller\\n\\t// for a ctx with this property. This is really ugly, but the alternative of\\n\\t// asking the caller for one is hard to explain. What we need is better and\\n\\t// separate interfaces for planning and running plans, which could take\\n\\t// suitable contexts.\\n\\tctx := logtags.AddTag(context.Background(), opName, \\\"\\\")\\n\\n\\tsd := &sessiondata.SessionData{\\n\\t\\tSessionData: sessionData,\\n\\t\\tSearchPath: sessiondata.DefaultSearchPathForUser(user),\\n\\t\\tSequenceState: sessiondata.NewSequenceState(),\\n\\t\\tLocation: time.UTC,\\n\\t}\\n\\tsd.SessionData.Database = \\\"system\\\"\\n\\tsd.SessionData.UserProto = user.EncodeProto()\\n\\tdataMutator := &sessionDataMutator{\\n\\t\\tdata: sd,\\n\\t\\tdefaults: SessionDefaults(map[string]string{\\n\\t\\t\\t\\\"application_name\\\": \\\"crdb-internal\\\",\\n\\t\\t\\t\\\"database\\\": \\\"system\\\",\\n\\t\\t}),\\n\\t\\tsettings: execCfg.Settings,\\n\\t\\tparamStatusUpdater: &noopParamStatusUpdater{},\\n\\t\\tsetCurTxnReadOnly: func(bool) {},\\n\\t}\\n\\n\\tvar ts time.Time\\n\\tif txn != nil {\\n\\t\\treadTimestamp := txn.ReadTimestamp()\\n\\t\\tif readTimestamp.IsEmpty() {\\n\\t\\t\\tpanic(\\\"makeInternalPlanner called with a transaction without timestamps\\\")\\n\\t\\t}\\n\\t\\tts = readTimestamp.GoTime()\\n\\t}\\n\\n\\tp := &planner{execCfg: execCfg, alloc: &rowenc.DatumAlloc{}}\\n\\n\\tp.txn = txn\\n\\tp.stmt = Statement{}\\n\\tp.cancelChecker = cancelchecker.NewCancelChecker(ctx)\\n\\tp.isInternalPlanner = true\\n\\n\\tp.semaCtx = tree.MakeSemaContext()\\n\\tp.semaCtx.SearchPath = sd.SearchPath\\n\\tp.semaCtx.TypeResolver = p\\n\\n\\tplannerMon := mon.NewUnlimitedMonitor(ctx,\\n\\t\\tfmt.Sprintf(\\\"internal-planner.%s.%s\\\", user, opName),\\n\\t\\tmon.MemoryResource,\\n\\t\\tmemMetrics.CurBytesCount, memMetrics.MaxBytesHist,\\n\\t\\tnoteworthyInternalMemoryUsageBytes, execCfg.Settings)\\n\\n\\tp.extendedEvalCtx = internalExtendedEvalCtx(\\n\\t\\tctx, sd, dataMutator, params.collection, txn, ts, ts, execCfg, plannerMon,\\n\\t)\\n\\tp.extendedEvalCtx.Planner = p\\n\\tp.extendedEvalCtx.PrivilegedAccessor = p\\n\\tp.extendedEvalCtx.SessionAccessor = p\\n\\tp.extendedEvalCtx.ClientNoticeSender = p\\n\\tp.extendedEvalCtx.Sequence = p\\n\\tp.extendedEvalCtx.Tenant = p\\n\\tp.extendedEvalCtx.JoinTokenCreator = p\\n\\tp.extendedEvalCtx.ClusterID = execCfg.ClusterID()\\n\\tp.extendedEvalCtx.ClusterName = execCfg.RPCContext.ClusterName()\\n\\tp.extendedEvalCtx.NodeID = execCfg.NodeID\\n\\tp.extendedEvalCtx.Locality = execCfg.Locality\\n\\n\\tp.sessionDataMutator = dataMutator\\n\\tp.autoCommit = false\\n\\n\\tp.extendedEvalCtx.MemMetrics = memMetrics\\n\\tp.extendedEvalCtx.ExecCfg = execCfg\\n\\tp.extendedEvalCtx.Placeholders = &p.semaCtx.Placeholders\\n\\tp.extendedEvalCtx.Annotations = &p.semaCtx.Annotations\\n\\tp.extendedEvalCtx.Descs = params.collection\\n\\n\\tp.queryCacheSession.Init()\\n\\tp.optPlanningCtx.init(p)\\n\\n\\treturn p, func() {\\n\\t\\t// Note that we capture ctx here. This is only valid as long as we create\\n\\t\\t// the context as explained at the top of the method.\\n\\n\\t\\t// The collection will accumulate descriptors read during planning as well\\n\\t\\t// as type descriptors read during execution on the local node. Many users\\n\\t\\t// of the internal planner do set the `skipCache` flag on the resolver but\\n\\t\\t// this is not respected by type resolution underneath execution. That\\n\\t\\t// subtle details means that the type descriptor used by execution may be\\n\\t\\t// stale, but that must be okay. Correctness concerns aside, we must release\\n\\t\\t// the leases to ensure that we don't leak a descriptor lease.\\n\\t\\tp.Descriptors().ReleaseAll(ctx)\\n\\n\\t\\t// Stop the memory monitor.\\n\\t\\tplannerMon.Stop(ctx)\\n\\t}\\n}\",\n \"func NewPlan(config *Config, name string) (plan *Plan, err error) {\\n\\tpath, err := FindPlanPath(config, name)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tplan, err = ReadPath(path.String())\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn plan, nil\\n}\",\n \"func New(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize, bulkSize int, w io.Writer) (Executor, error) {\\n\\tswitch stm.Type() {\\n\\tcase semantic.Query:\\n\\t\\treturn newQueryPlan(ctx, store, stm, chanSize, w)\\n\\tcase semantic.Insert:\\n\\t\\treturn &insertPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Delete:\\n\\t\\treturn &deletePlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Create:\\n\\t\\treturn &createPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Drop:\\n\\t\\treturn &dropPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Construct:\\n\\t\\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\\n\\t\\treturn &constructPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t\\tbulkSize: bulkSize,\\n\\t\\t\\tqueryPlan: qp,\\n\\t\\t\\tconstruct: true,\\n\\t\\t}, nil\\n\\tcase semantic.Deconstruct:\\n\\t\\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\\n\\t\\treturn &constructPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t\\tbulkSize: bulkSize,\\n\\t\\t\\tqueryPlan: qp,\\n\\t\\t\\tconstruct: false,\\n\\t\\t}, nil\\n\\tcase semantic.Show:\\n\\t\\treturn &showPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tdefault:\\n\\t\\treturn nil, fmt.Errorf(\\\"planner.New: unknown statement type in statement %v\\\", stm)\\n\\t}\\n}\",\n \"func (pb PlannerBuilder) Build() Planner {\\n\\treturn &planner{\\n\\t\\tlp: NewLogicalPlanner(pb.lopts...),\\n\\t\\tpp: NewPhysicalPlanner(pb.popts...),\\n\\t}\\n}\",\n \"func NewPlanParser(input antlr.TokenStream) *PlanParser {\\n\\tthis := new(PlanParser)\\n\\tdeserializer := antlr.NewATNDeserializer(nil)\\n\\tdeserializedATN := deserializer.DeserializeFromUInt16(parserATN)\\n\\tdecisionToDFA := make([]*antlr.DFA, len(deserializedATN.DecisionToState))\\n\\tfor index, ds := range deserializedATN.DecisionToState {\\n\\t\\tdecisionToDFA[index] = antlr.NewDFA(ds, index)\\n\\t}\\n\\tthis.BaseParser = antlr.NewBaseParser(input)\\n\\n\\tthis.Interpreter = antlr.NewParserATNSimulator(this, deserializedATN, decisionToDFA, antlr.NewPredictionContextCache())\\n\\tthis.RuleNames = ruleNames\\n\\tthis.LiteralNames = literalNames\\n\\tthis.SymbolicNames = symbolicNames\\n\\tthis.GrammarFileName = \\\"Plan.g4\\\"\\n\\n\\treturn this\\n}\",\n \"func New() (ugrade.JobSolver, error) {\\n\\treturn &defaultSolver{\\n\\t\\tcompiler: compiler.New(),\\n\\t\\ttcgenerator: tcgenerator.NewGenerator(),\\n\\t\\tsubmissionExecutor: executor.New(),\\n\\t\\tchecker: checker.New(),\\n\\t}, nil\\n}\",\n \"func (m *Group) SetPlanner(value PlannerGroupable)() {\\n m.planner = value\\n}\",\n \"func NewPlans(useCase usecases.Plans) Plans {\\n\\treturn &plans{useCase}\\n}\",\n \"func NewPlan(t, s string, b []interface{}) Plan {\\n\\treturn Plan{\\n\\t\\tTitle: t,\\n\\t\\tButtons: b,\\n\\t\\tSubTitle: s,\\n\\t}\\n}\",\n \"func New(cost int) abstract.Scheme {\\n\\treturn &scheme{\\n\\t\\tCost: cost,\\n\\t}\\n}\",\n \"func NewDTODPlanner(dtodPlannerMileage DTODPlannerMileage) Planner {\\n\\treturn &dtodPlanner{\\n\\t\\tdtodPlannerMileage: dtodPlannerMileage,\\n\\t}\\n}\",\n \"func newQueryPlan(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize int, w io.Writer) (*queryPlan, error) {\\n\\tt, err := table.New([]string{})\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn &queryPlan{\\n\\t\\tstm: stm,\\n\\t\\tstore: store,\\n\\t\\tbndgs: stm.Bindings(),\\n\\t\\tgrfsNames: stm.InputGraphNames(),\\n\\t\\tclauses: stm.GraphPatternClauses(),\\n\\t\\tfilters: stm.FilterClauses(),\\n\\t\\ttbl: t,\\n\\t\\tchanSize: chanSize,\\n\\t\\ttracer: w,\\n\\t}, nil\\n}\",\n \"func New(it *msvc.ProjectIterator) *Graph {\\n\\tgr := &Graph{\\n\\t\\tg: simple.NewDirectedGraph(),\\n\\t\\tallNodes: rbtree.New(),\\n\\t\\tnextID: 1,\\n\\t}\\n\\n\\tit.Foreach(gr.newNode)\\n\\tait := rbtree.NewWalkInorder(gr.allNodes)\\n\\tait.Foreach(gr.newEdges)\\n\\n\\treturn gr\\n}\",\n \"func newPager() *pager {\\n\\treturn &pager{\\n\\t\\tpageMap: make(map[int]page),\\n\\t\\tpagesize: 500,\\n\\t}\\n}\",\n \"func NewHHGPlanner(dtodPlannerMileage DTODPlannerMileage) Planner {\\n\\treturn &hhgPlanner{\\n\\t\\tdtodPlannerMileage: dtodPlannerMileage,\\n\\t}\\n}\",\n \"func New(input io.Reader) Solution {\\n\\treturn Solution{Passports: parse(input)}\\n}\",\n \"func New(port *Port, timeout time.Duration, options ...Option) (*PLM, error) {\\n\\tplm := &PLM{\\n\\t\\ttimeout: timeout,\\n\\t\\twriteDelay: 500 * time.Millisecond,\\n\\t\\tport: port,\\n\\t\\tconnections: make(map[insteon.Address]insteon.Connection),\\n\\n\\t\\tinsteonTxCh: make(chan *insteon.Message),\\n\\t\\tinsteonRxCh: make(chan *insteon.Message),\\n\\t\\tplmCh: make(chan *Packet),\\n\\t}\\n\\tplm.linkdb.plm = plm\\n\\tplm.linkdb.timeout = timeout\\n\\n\\tfor _, o := range options {\\n\\t\\terr := o(plm)\\n\\t\\tif err != nil {\\n\\t\\t\\tinsteon.Log.Infof(\\\"error setting plm option: %v\\\", err)\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\n\\tgo plm.readLoop()\\n\\tgo plm.writeLoop()\\n\\treturn plm, nil\\n}\",\n \"func NewPar(P, Q Process) *Par { return &Par{Procs: []Process{P, Q}} }\",\n \"func NewPlan(userSctx sessionctx.Context, plan *plannercore.LoadData, tbl table.Table) (*Plan, error) {\\n\\tfullTableName := common.UniqueTable(plan.Table.Schema.L, plan.Table.Name.L)\\n\\tlogger := log.L().With(zap.String(\\\"table\\\", fullTableName))\\n\\tvar format string\\n\\tif plan.Format != nil {\\n\\t\\tformat = strings.ToLower(*plan.Format)\\n\\t} else {\\n\\t\\t// without FORMAT 'xxx' clause, default to DELIMITED DATA\\n\\t\\tformat = LoadDataFormatDelimitedData\\n\\t}\\n\\tcharset := plan.Charset\\n\\tif charset == nil {\\n\\t\\t// https://dev.mysql.com/doc/refman/8.0/en/load-data.html#load-data-character-set\\n\\t\\td, err2 := userSctx.GetSessionVars().GetSessionOrGlobalSystemVar(\\n\\t\\t\\tcontext.Background(), variable.CharsetDatabase)\\n\\t\\tif err2 != nil {\\n\\t\\t\\tlogger.Error(\\\"LOAD DATA get charset failed\\\", zap.Error(err2))\\n\\t\\t} else {\\n\\t\\t\\tcharset = &d\\n\\t\\t}\\n\\t}\\n\\trestrictive := userSctx.GetSessionVars().SQLMode.HasStrictMode() &&\\n\\t\\tplan.OnDuplicate != ast.OnDuplicateKeyHandlingIgnore\\n\\n\\tp := &Plan{\\n\\t\\tTableInfo: tbl.Meta(),\\n\\t\\tDBName: plan.Table.Schema.O,\\n\\t\\tDBID: plan.Table.DBInfo.ID,\\n\\n\\t\\tPath: plan.Path,\\n\\t\\tFormat: format,\\n\\t\\tRestrictive: restrictive,\\n\\t\\tIgnoreLines: plan.IgnoreLines,\\n\\n\\t\\tSQLMode: userSctx.GetSessionVars().SQLMode,\\n\\t\\tCharset: charset,\\n\\t\\tImportantSysVars: getImportantSysVars(userSctx),\\n\\n\\t\\tDistSQLScanConcurrency: userSctx.GetSessionVars().DistSQLScanConcurrency(),\\n\\t}\\n\\tif err := p.initOptions(userSctx, plan.Options); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn p, nil\\n}\",\n \"func New(source lease.Provider, logger *log.Logger, schedule ...Schedule) *Provider {\\n\\tp := &Provider{\\n\\t\\tsource: source,\\n\\t\\tlog: logger,\\n\\t\\tschedule: schedule,\\n\\t\\tclosed: make(chan struct{}),\\n\\t}\\n\\tif d, ok := p.durationSchedule(); ok {\\n\\t\\t// Start a goroutine to handle duration scheduling\\n\\t\\tgo p.durationCheckpoint(d, p.closed)\\n\\t}\\n\\treturn p\\n}\",\n \"func (context *handlerContext) Planner() route.Planner {\\n\\treturn context.planner\\n}\",\n \"func New(opts ...Opt) *Onpar {\\n\\to := Onpar{\\n\\t\\tcurrent: &level{},\\n\\t\\tcallCount: 1,\\n\\t}\\n\\tfor _, opt := range opts {\\n\\t\\to = opt(o)\\n\\t}\\n\\treturn &o\\n}\",\n \"func new() *DAG {\\n\\treturn &DAG{Nodes: map[string]*Node{}}\\n}\",\n \"func New(id, route, target string) *Rule {\\n\\treturn &Rule{id, route, target}\\n}\",\n \"func NewLogicalPlanner(options ...LogicalOption) LogicalPlanner {\\n\\tthePlanner := &logicalPlanner{\\n\\t\\theuristicPlanner: newHeuristicPlanner(),\\n\\t}\\n\\n\\trules := make([]Rule, len(ruleNameToLogicalRule))\\n\\ti := 0\\n\\tfor _, v := range ruleNameToLogicalRule {\\n\\t\\trules[i] = v\\n\\t\\ti++\\n\\t}\\n\\n\\tthePlanner.addRules(rules...)\\n\\n\\t// Options may add or remove rules, so process them after we've\\n\\t// added registered rules.\\n\\tfor _, opt := range options {\\n\\t\\topt.apply(thePlanner)\\n\\t}\\n\\n\\treturn thePlanner\\n}\",\n \"func (t *MCTS) New(move int32, score float32) (retVal Naughty) {\\n\\tn := t.alloc()\\n\\tN := t.nodeFromNaughty(n)\\n\\tN.lock.Lock()\\n\\tdefer N.lock.Unlock()\\n\\tN.move = move\\n\\tN.visits = 1\\n\\tN.status = uint32(Active)\\n\\tN.qsa = 0\\n\\tN.psa = score\\n\\n\\treturn n\\n}\",\n \"func New(s string) (*PegQuery, error) {\\n\\tp := &QueryParser{\\n\\t\\tBuffer: s,\\n\\t}\\n\\tp.Expression.explainer = func(format string, args ...interface{}) {\\n\\t\\tfmt.Printf(format, args...)\\n\\t}\\n\\tp.Init()\\n\\terr := p.Parse()\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tp.Execute()\\n\\treturn &PegQuery{str: s, parser: p}, nil\\n}\",\n \"func NewMontrealTrip(weight float32, deadline int) *Trip {\\n trip := Trip{weight: weight, destination: \\\"Montreal\\\", deadline: deadline}\\n return &trip\\n}\",\n \"func New(o *Options) (Matcher, error) {\\n\\t// creates data clients\\n\\tdataClients, err := createDataClients(o.RoutesFile)\\n\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\trouting := createRouting(dataClients, o)\\n\\n\\treturn &matcher{\\n\\t\\trouting,\\n\\t}, nil\\n}\",\n \"func NewDML() *DML {\\n\\treturn &DML{RoutingParameters: &RoutingParameters{}}\\n}\",\n \"func New(indexer cache.Store) *Manager {\\n\\tlogger := &bgplog.Logger{Entry: log}\\n\\tc := &metallbctl.Controller{\\n\\t\\tClient: bgpk8s.New(logger.Logger),\\n\\t\\tIPs: metallballoc.New(),\\n\\t}\\n\\n\\tf, err := os.Open(option.Config.BGPConfigPath)\\n\\tif err != nil {\\n\\t\\tlog.WithError(err).Fatal(\\\"Failed to open BGP config file\\\")\\n\\t}\\n\\tdefer f.Close()\\n\\n\\tconfig, err := bgpconfig.Parse(f)\\n\\tif err != nil {\\n\\t\\tlog.WithError(err).Fatal(\\\"Failed to parse BGP configuration\\\")\\n\\t}\\n\\tc.SetConfig(logger, config)\\n\\n\\tmgr := &Manager{\\n\\t\\tController: c,\\n\\t\\tlogger: logger,\\n\\n\\t\\tqueue: workqueue.New(),\\n\\t\\tindexer: indexer,\\n\\t}\\n\\tgo mgr.run()\\n\\n\\treturn mgr\\n}\",\n \"func New(operators O) *Ruler {\\n\\treturn &Ruler{\\n\\t\\toperators: operators,\\n\\t}\\n}\",\n \"func New(sess *session.Session, config *client.Config) *TaskRouter {\\n\\treturn &TaskRouter{\\n\\t\\tV1: v1.New(sess, config),\\n\\t}\\n}\",\n \"func NewSolver(pPath string) *Solver {\\n\\treturn &Solver{\\n\\t\\tp: NewProblem(pPath),\\n\\t}\\n}\",\n \"func New(grammarString string) (*grammar.Grammar, tree.Reducer, error) {\\n\\tparseTree, err := runner.Run(grammarString)\\n\\tif err != nil {\\n\\t\\treturn nil, nil, err\\n\\t}\\n\\tg, r := evalGrammar(parseTree.(*tree.PN))\\n\\treturn g, r, nil\\n}\",\n \"func New(l *lexer.Lexer) *Parser {\\n\\tp := &Parser{l: l}\\n\\n\\tp.nextToken()\\n\\tp.nextToken()\\n\\n\\treturn p\\n}\",\n \"func New(callback func(types.NamespacedName), lease time.Duration) Interface {\\n\\treturn &impl{\\n\\t\\tleaseDuration: lease,\\n\\t\\tcb: callback,\\n\\t}\\n}\",\n \"func NewPlannerAssignedToTaskBoardTaskFormat()(*PlannerAssignedToTaskBoardTaskFormat) {\\n m := &PlannerAssignedToTaskBoardTaskFormat{\\n Entity: *NewEntity(),\\n }\\n return m\\n}\",\n \"func (r *BreakdownResolver) New() int32 {\\n\\treturn int32(r.breakdown.New)\\n}\",\n \"func New() (*TimeLord, error) {\\n\\tglobalMut.Lock()\\n\\tdefer globalMut.Unlock()\\n\\tif timeLordExists {\\n\\t\\treturn nil, fmt.Errorf(\\\"timelord.New has already been called (only one TimeLord can be created at a time)\\\")\\n\\t}\\n\\ttl := &TimeLord{}\\n\\ttl.warp()\\n\\ttimeLordExists = true\\n\\treturn tl, nil\\n}\",\n \"func New(env *Options) destination.Destination {\\n\\tif err := env.validate(); err != nil {\\n\\t\\tlogger.Default.Fatal(err)\\n\\t\\treturn nil\\n\\t}\\n\\n\\treturn &SQLike{\\n\\t\\toptions: &destination.Options{\\n\\t\\t\\tDefaultSchedule: &destination.Schedule{\\n\\t\\t\\t\\tRealtime: env.Realtime,\\n\\t\\t\\t\\tInterval: env.Interval,\\n\\t\\t\\t\\tMaxRetries: env.MaxRetries,\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\tenv: env,\\n\\t}\\n}\",\n \"func New() (*Payway, error) {\\n\\n\\t// get default gateway from configuration file\\n\\tprovider := conf.GetString(\\\"gateways.payments.default\\\")\\n\\n\\tif provider == \\\"\\\" {\\n\\t\\treturn nil, fmt.Errorf(\\\"No default payment gateway provided\\\")\\n\\t}\\n\\n\\t// acquare read mutex\\n\\tmu.RLock()\\n\\n\\tdefer mu.RUnlock()\\n\\n\\t// fetch gateway from cache\\n\\tgateway, ok := gateways[provider]\\n\\n\\tif !ok {\\n\\n\\t\\treturn nil, fmt.Errorf(\\\"Gateway not registered\\\")\\n\\t}\\n\\n\\t// Init gateway\\n\\tif err := gateway.New(); err != nil {\\n\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn &Payway{PayGateway: gateway}, nil\\n}\",\n \"func NewPlSqlParser(input antlr.TokenStream) *PlSqlParser {\\n\\tPlSqlParserInit()\\n\\tthis := new(PlSqlParser)\\n\\tthis.BaseParser = antlr.NewBaseParser(input)\\n\\tstaticData := &plsqlparserParserStaticData\\n\\tthis.Interpreter = antlr.NewParserATNSimulator(this, staticData.atn, staticData.decisionToDFA, staticData.predictionContextCache)\\n\\tthis.RuleNames = staticData.ruleNames\\n\\tthis.LiteralNames = staticData.literalNames\\n\\tthis.SymbolicNames = staticData.symbolicNames\\n\\tthis.GrammarFileName = \\\"java-escape\\\"\\n\\n\\treturn this\\n}\",\n \"func New(cfg Config, logger log.Logger) (*Agent, error) {\\n\\treturn newAgent(cfg, logger, defaultInstanceFactory)\\n}\",\n \"func New() {\\n\\ttypeOfProject()\\n}\",\n \"func newRouter() *Router {\\n\\treturn &Router{routes: make([]*Route, 0)}\\n}\",\n \"func New() *Resolver {\\n\\treturn &Resolver{}\\n}\",\n \"func New() *Resolver {\\n\\treturn &Resolver{}\\n}\",\n \"func NewBundlePlan() BundlePlan {\\n\\treturn BundlePlan{}\\n}\",\n \"func New() *Repl {\\n\\treturn &Repl{\\n\\t\\tansi: NewANSI(true),\\n\\t\\tconfig: defaultConfig(),\\n\\t\\tevaluator: interpreter.New(),\\n\\t}\\n}\",\n \"func New(cmdCandidates []pakelib.CommandCandidate, cv pakelib.CommentValidator) *Parser {\\n\\treturn &Parser{\\n\\t\\tcommandCandidates: cmdCandidates,\\n\\t\\tcommentValidator: cv,\\n\\t}\\n}\",\n \"func NewParser(description string, p Parser) Parser {\\n\\treturn p\\n}\",\n \"func NewPayment(a payment.Repository, timeout time.Duration) payment.Usecase {\\n\\treturn &paymentUsecase{\\n\\t\\trepo: a,\\n\\t\\tcontextTimeout: timeout,\\n\\t}\\n}\",\n \"func (m *User) SetPlanner(value PlannerUserable)() {\\n m.planner = value\\n}\",\n \"func (o *User) SetPlanner(v AnyOfmicrosoftGraphPlannerUser) {\\n\\to.Planner = &v\\n}\",\n \"func (opt *SGD) New() Optimizer {\\n\\treturn NewSGD(opt.Lr, opt.Momentum, opt.WeightDecay)\\n}\",\n \"func New(ctx context.Context, cfg Config) (types.Leases, error) {\\n\\tif err := cfg.sanitize(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\t_, err := cfg.Pool.Exec(ctx, fmt.Sprintf(schema, cfg.Target))\\n\\tif err != nil {\\n\\t\\treturn nil, errors.WithStack(err)\\n\\t}\\n\\n\\tl := &leases{cfg: cfg}\\n\\tl.sql.acquire = fmt.Sprintf(acquireTemplate, cfg.Target)\\n\\tl.sql.release = fmt.Sprintf(releaseTemplate, cfg.Target)\\n\\tl.sql.renew = fmt.Sprintf(renewTemplate, cfg.Target)\\n\\n\\treturn l, nil\\n}\",\n \"func (m *Group) GetPlanner()(PlannerGroupable) {\\n return m.planner\\n}\",\n \"func New(runner, tracker, hosted string) *Runner {\\n\\tn := &Runner{\\n\\t\\ttcl: client.New(tracker, http.DefaultClient, client.JsonCodec),\\n\\t\\tbase: hosted,\\n\\t\\trunner: runner,\\n\\t\\trpc: gorpc.NewServer(),\\n\\t\\trq: rpc.NewRunnerQueue(),\\n\\t\\tresp: make(chan rpc.Output),\\n\\t}\\n\\n\\t//register the run service in the rpc\\n\\tif err := n.rpc.RegisterService(n.rq, \\\"\\\"); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\n\\t//register the pinger\\n\\tif err := n.rpc.RegisterService(pinger.Pinger{}, \\\"\\\"); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\n\\t//register ourselves in the rpc\\n\\tif err := n.rpc.RegisterService(n, \\\"\\\"); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\n\\t//register the codec\\n\\tn.rpc.RegisterCodec(json.NewCodec(), \\\"application/json\\\")\\n\\n\\t//start processing\\n\\tgo n.run()\\n\\n\\treturn n\\n}\",\n \"func newPlanCmd() *cobra.Command {\\n\\tpc := &planCmd{}\\n\\n\\tplanCmd := &cobra.Command{\\n\\t\\tUse: \\\"plan [-f SORUCE]\\\",\\n\\t\\tShort: \\\"Generate and show an execution plan\\\",\\n\\t\\tLong: planLong,\\n\\t\\tExample: planExample,\\n\\t\\tDisableFlagsInUseLine: true,\\n\\t\\tSilenceUsage: true,\\n\\t\\tSilenceErrors: true,\\n\\t\\tArgs: cobra.MaximumNArgs(0),\\n\\t\\tRunE: func(cmd *cobra.Command, args []string) error {\\n\\t\\t\\tif err := pc.meta.init(args); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn pc.run(args)\\n\\t\\t},\\n\\t}\\n\\n\\tf := planCmd.Flags()\\n\\tf.BoolVar(&pc.destroy, \\\"destroy\\\", false, \\\"create plan to destroy resources\\\")\\n\\n\\tpc.addMetaFlags(planCmd)\\n\\n\\treturn planCmd\\n}\",\n \"func (a *allocator) New(jobSessionName string, jobTrackerInitParams interface{}) (jobtracker.JobTracker, error) {\\n\\t// a job session name has no meaning in DRMAA v1.\\n\\treturn NewDRMAATracker()\\n}\",\n \"func New() *Agent {\\n\\treturn &Agent{\\n\\t\\tReporter: newReporter(),\\n\\t\\tWarmUp: config.WarmupEnabled,\\n\\t\\tTimeoutMargin: config.TimeoutMargin,\\n\\t\\tPlugins: []plugin.Plugin{},\\n\\t}\\n}\",\n \"func New(store database.DAL) *Resolver {\\n\\treturn &Resolver{store}\\n}\",\n \"func New(pg plugingetter.PluginGetter, netConfig *NetworkConfig) (networkallocator.NetworkAllocator, error) {\\n\\tna := &cnmNetworkAllocator{\\n\\t\\tnetworks: make(map[string]*network),\\n\\t\\tservices: make(map[string]struct{}),\\n\\t\\ttasks: make(map[string]struct{}),\\n\\t\\tnodes: make(map[string]map[string]struct{}),\\n\\t\\tpg: pg,\\n\\t}\\n\\n\\tfor ntype, i := range initializers {\\n\\t\\tif err := i(&na.networkRegistry); err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"failed to register %q network driver: %w\\\", ntype, err)\\n\\t\\t}\\n\\t}\\n\\tif err := remote.Register(&na.networkRegistry, pg); err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"failed to initialize network driver plugins: %w\\\", err)\\n\\t}\\n\\n\\tif err := initIPAMDrivers(&na.ipamRegistry, netConfig); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif err := remoteipam.Register(&na.ipamRegistry, pg); err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"failed to initialize IPAM driver plugins: %w\\\", err)\\n\\t}\\n\\n\\tpa, err := newPortAllocator()\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tna.portAllocator = pa\\n\\treturn na, nil\\n}\",\n \"func New() *Router {\\n\\treturn &Router{\\n\\t\\tdestinations: destinationList{},\\n\\t\\tcommands: map[string]commandList{},\\n\\t\\tregexpCommands: []regexpCommand{},\\n\\t\\tdone: make(chan struct{}),\\n\\t}\\n}\",\n \"func New(width core.Px, frequencyRange core.FrequencyRange, vfoFrequency core.Frequency) *Panorama {\\n\\tresult := Panorama{\\n\\t\\twidth: width,\\n\\t\\tfrequencyRange: frequencyRange,\\n\\t\\tdbRange: core.DBRange{From: -105, To: 10},\\n\\t\\tresolution: map[core.ViewMode]core.HzPerPx{\\n\\t\\t\\tcore.ViewFixed: calcResolution(frequencyRange, width),\\n\\t\\t\\tcore.ViewCentered: defaultCenteredResolution,\\n\\t\\t},\\n\\t\\tviewMode: core.ViewFixed,\\n\\t\\tsignalDetectionActive: true,\\n\\t\\tmargin: 0.02,\\n\\t\\tpeakBuffer: make(map[peakKey]peak),\\n\\t\\tpeakTimeout: 10 * time.Second, // TODO make this configurable\\n\\t\\tdbRangeAdjusted: true,\\n\\t}\\n\\n\\tresult.vfo.Frequency = vfoFrequency\\n\\n\\treturn &result\\n}\",\n \"func NewConstraint(left, operand, right string) *Constraint {\\n\\treturn &Constraint{\\n\\t\\tLTarget: left,\\n\\t\\tRTarget: right,\\n\\t\\tOperand: operand,\\n\\t}\\n}\",\n \"func New(routeName, namespace, serviceName string, labels map[string]string) *Builder {\\n\\treturn &Builder{r: newRoute(routeName, namespace, serviceName, labels)}\\n}\",\n \"func New(usage string) *Parser {\\n\\tp := &Parser{}\\n\\tp.long2options = make(map[string]*option)\\n\\tp.short2options = make(map[string]*option)\\n\\tp.OptPadding = 20\\n\\tp.ParseHelp = true\\n\\tp.Usage = usage\\n\\treturn p\\n}\",\n \"func New(opts ...ProtocolOption) *Protocol {\\n\\tp := &Protocol{\\n\\t\\tpingTimeout: 3 * time.Second,\\n\\t}\\n\\n\\tfor _, opt := range opts {\\n\\t\\topt(p)\\n\\t}\\n\\n\\treturn p\\n}\",\n \"func New(conf config.DBConfig) *Manager {\\n\\tdb := pg.Connect(&pg.Options{\\n\\t\\tAddr: fmt.Sprintf(\\\"%s:%s\\\", conf.Host, conf.Port),\\n\\t\\tUser: conf.User,\\n\\t\\tPassword: conf.Password,\\n\\t\\tDatabase: conf.Database,\\n\\t})\\n\\treturn &Manager{db: db}\\n}\",\n \"func newRoute() *Route {\\n\\treturn &Route{\\n\\t\\thandlers: make(map[string]http.Handler),\\n\\t\\tmiddleware: make([]*middlewareForVerb, 0),\\n\\t\\tchildren: make([]*Route, 0),\\n\\t}\\n}\",\n \"func New(dispatcher service.Dispatcher, context context.Client, channelID string, opts ...options.Opt) *PeerResolver {\\n\\tparams := defaultParams(context, channelID)\\n\\toptions.Apply(params, opts)\\n\\n\\tlogger.Debugf(\\\"Creating new balanced peer resolver\\\")\\n\\n\\treturn &PeerResolver{\\n\\t\\tparams: params,\\n\\t}\\n}\",\n \"func NewRepl() (*Repl, error) {\\n\\trl, err := readline.New(\\\"box> \\\")\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tb, err := builder.NewBuilder(true, []string{})\\n\\tif err != nil {\\n\\t\\trl.Close()\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn &Repl{readline: rl, builder: b}, nil\\n}\",\n \"func New() *pool {\\n\\treturn &pool{\\n\\t\\tmetrics: newMetrics(),\\n\\t}\\n}\",\n \"func (rg *RouteGroup) newRoute(method, path string) *Route {\\n\\treturn &Route{\\n\\t\\tgroup: rg,\\n\\t\\tmethod: method,\\n\\t\\tpath: path,\\n\\t\\ttemplate: buildURLTemplate(rg.prefix + path),\\n\\t}\\n}\",\n \"func (rg *RouteGroup) newRoute(method, path string) *Route {\\n\\treturn &Route{\\n\\t\\tgroup: rg,\\n\\t\\tmethod: method,\\n\\t\\tpath: path,\\n\\t\\ttemplate: buildURLTemplate(rg.prefix + path),\\n\\t}\\n}\",\n \"func New(path string) (Parser, error) {\\n\\n\\td := dep{}\\n\\tif d.test(path) {\\n\\t\\treturn d, nil\\n\\t}\\n\\n\\tg := glide{}\\n\\n\\tif g.test(path) {\\n\\t\\treturn g, nil\\n\\t}\\n\\n\\treturn nil, errors.New(\\\"parser not found\\\")\\n}\",\n \"func NewSolver(c CubieCube, max int) *Solver {\\n\\tp1Moves := NewPhase1Moves()\\n\\tp1Heuristic := NewPhase1Heuristic(p1Moves)\\n\\n\\tres := new(Solver)\\n\\tres.stopper = make(chan struct{})\\n\\tres.solutions = make(chan []Move)\\n\\tres.phase1 = NewPhase1Solver(c.Phase1Cube(), p1Heuristic, p1Moves)\\n\\n\\tgo res.backgroundLoop(c, nil, max)\\n\\treturn res\\n}\",\n \"func New(query string, ph string) *Builder {\\n\\treturn &Builder{\\n\\t\\tbaseQuery: query,\\n\\t\\tplaceHolder: ph,\\n\\t}\\n}\",\n \"func New() *Builder {\\n\\treturn &Builder{\\n\\t\\tpatterns: make(map[string]*parser.Node),\\n\\t}\\n}\",\n \"func New(conf config.Config) Parser {\\n\\tmethods := map[string]bool{\\n\\t\\thttp.MethodGet: true,\\n\\t\\thttp.MethodHead: true,\\n\\t\\thttp.MethodPost: true,\\n\\t\\thttp.MethodPut: true,\\n\\t\\thttp.MethodPatch: true,\\n\\t\\thttp.MethodDelete: true,\\n\\t\\thttp.MethodConnect: true,\\n\\t\\thttp.MethodOptions: true,\\n\\t\\thttp.MethodTrace: true,\\n\\t}\\n\\n\\treturn Parser{\\n\\t\\tconf: conf,\\n\\t\\tmethods: methods,\\n\\t}\\n}\",\n \"func New() (*Relay, error) {\\n\\treturn &Relay{\\n\\t\\tvm: newRuntime(),\\n\\t}, nil\\n}\",\n \"func New(target, filename string) *Parser {\\n\\treturn &Parser{\\n\\t\\ttarget: target,\\n\\t\\tfilename: filename,\\n\\t\\tfields: make(map[string]*types.Field),\\n\\t\\ttypeConv: make(map[string]string),\\n\\t}\\n}\",\n \"func New(p string, t time.Time) *PT {\\n\\treturn &PT{p, t}\\n}\",\n \"func NewPacer(delay time.Duration) *Pacer {\\n\\tp := &Pacer{\\n\\t\\tdelay: delay,\\n\\t\\tgate: make(chan struct{}),\\n\\t\\tpause: make(chan struct{}, 1),\\n\\t\\tpaused: make(chan struct{}, 1),\\n\\t}\\n\\n\\tgo p.run()\\n\\treturn p\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8373297","0.78956974","0.7884329","0.76004404","0.74583673","0.6844997","0.68093985","0.66071105","0.6360136","0.63401043","0.63401043","0.61766195","0.6119623","0.6067652","0.59924793","0.593622","0.5857521","0.5767704","0.57149994","0.5667879","0.55966306","0.5585535","0.5577317","0.55352235","0.54647493","0.54382247","0.5433272","0.54104733","0.5409572","0.53913575","0.5372452","0.5343583","0.5329462","0.5326424","0.5294033","0.528331","0.5278878","0.52718335","0.52466625","0.5224781","0.52246034","0.5189328","0.51602113","0.5156552","0.5152991","0.51422685","0.5142219","0.51255506","0.51075315","0.5103439","0.50881875","0.50514936","0.50348157","0.5021409","0.5013174","0.4999149","0.49967402","0.49724048","0.4969523","0.4967831","0.49654505","0.49654505","0.49627745","0.4960494","0.49495006","0.49477637","0.49388358","0.4938218","0.49382025","0.4937326","0.49358937","0.49271485","0.49178088","0.49134597","0.49133706","0.4911763","0.49017757","0.4899978","0.48738328","0.4871553","0.48701254","0.4858423","0.48572657","0.48535705","0.48472637","0.48471075","0.48445997","0.48438418","0.48411322","0.4840604","0.4840604","0.48364934","0.48357826","0.48334408","0.4831018","0.483011","0.48196334","0.4814489","0.48119864","0.48051202"],"string":"[\n \"0.8373297\",\n \"0.78956974\",\n \"0.7884329\",\n \"0.76004404\",\n \"0.74583673\",\n \"0.6844997\",\n \"0.68093985\",\n \"0.66071105\",\n \"0.6360136\",\n \"0.63401043\",\n \"0.63401043\",\n \"0.61766195\",\n \"0.6119623\",\n \"0.6067652\",\n \"0.59924793\",\n \"0.593622\",\n \"0.5857521\",\n \"0.5767704\",\n \"0.57149994\",\n \"0.5667879\",\n \"0.55966306\",\n \"0.5585535\",\n \"0.5577317\",\n \"0.55352235\",\n \"0.54647493\",\n \"0.54382247\",\n \"0.5433272\",\n \"0.54104733\",\n \"0.5409572\",\n \"0.53913575\",\n \"0.5372452\",\n \"0.5343583\",\n \"0.5329462\",\n \"0.5326424\",\n \"0.5294033\",\n \"0.528331\",\n \"0.5278878\",\n \"0.52718335\",\n \"0.52466625\",\n \"0.5224781\",\n \"0.52246034\",\n \"0.5189328\",\n \"0.51602113\",\n \"0.5156552\",\n \"0.5152991\",\n \"0.51422685\",\n \"0.5142219\",\n \"0.51255506\",\n \"0.51075315\",\n \"0.5103439\",\n \"0.50881875\",\n \"0.50514936\",\n \"0.50348157\",\n \"0.5021409\",\n \"0.5013174\",\n \"0.4999149\",\n \"0.49967402\",\n \"0.49724048\",\n \"0.4969523\",\n \"0.4967831\",\n \"0.49654505\",\n \"0.49654505\",\n \"0.49627745\",\n \"0.4960494\",\n \"0.49495006\",\n \"0.49477637\",\n \"0.49388358\",\n \"0.4938218\",\n \"0.49382025\",\n \"0.4937326\",\n \"0.49358937\",\n \"0.49271485\",\n \"0.49178088\",\n \"0.49134597\",\n \"0.49133706\",\n \"0.4911763\",\n \"0.49017757\",\n \"0.4899978\",\n \"0.48738328\",\n \"0.4871553\",\n \"0.48701254\",\n \"0.4858423\",\n \"0.48572657\",\n \"0.48535705\",\n \"0.48472637\",\n \"0.48471075\",\n \"0.48445997\",\n \"0.48438418\",\n \"0.48411322\",\n \"0.4840604\",\n \"0.4840604\",\n \"0.48364934\",\n \"0.48357826\",\n \"0.48334408\",\n \"0.4831018\",\n \"0.483011\",\n \"0.48196334\",\n \"0.4814489\",\n \"0.48119864\",\n \"0.48051202\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8417653"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":2793,"cells":{"query":{"kind":"string","value":"normalizeDimensions extacts the time interval, if specified. Returns all remaining dimensions."},"document":{"kind":"string","value":"func (p *Planner) normalizeDimensions(dimensions Dimensions) (time.Duration, []string, error) {\n\t// Ignore if there are no dimensions.\n\tif len(dimensions) == 0 {\n\t\treturn 0, nil, nil\n\t}\n\n\t// If the first dimension is a \"time(duration)\" then extract the duration.\n\tif call, ok := dimensions[0].Expr.(*Call); ok && strings.ToLower(call.Name) == \"time\" {\n\t\t// Make sure there is exactly one argument.\n\t\tif len(call.Args) != 1 {\n\t\t\treturn 0, nil, errors.New(\"time dimension expected one argument\")\n\t\t}\n\n\t\t// Ensure the argument is a duration.\n\t\tlit, ok := call.Args[0].(*DurationLiteral)\n\t\tif !ok {\n\t\t\treturn 0, nil, errors.New(\"time dimension must have one duration argument\")\n\t\t}\n\t\treturn lit.Val, dimensionKeys(dimensions[1:]), nil\n\t}\n\n\treturn 0, dimensionKeys(dimensions), nil\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func normalizeCloudWatchAlarmDimensions(alarmDimensions *cloudformation.CloudWatchAlarmDimensionList) *cloudformation.CloudWatchAlarmDimensionList {\n\tif alarmDimensions == nil || len(*alarmDimensions) == 0 {\n\t\treturn &cloudformation.CloudWatchAlarmDimensionList{\n\t\t\t{\n\t\t\t\tName: cloudformation.String(\"LoadBalancer\"),\n\t\t\t\tValue: cloudformation.GetAtt(\"LB\", \"LoadBalancerFullName\").String(),\n\t\t\t},\n\t\t}\n\t}\n\n\tdimensions := make(cloudformation.CloudWatchAlarmDimensionList, len(*alarmDimensions))\n\n\tfor i, dimension := range *alarmDimensions {\n\t\tvalue := dimension.Value\n\n\t\tswitch dimension.Name.Literal {\n\t\tcase \"LoadBalancer\":\n\t\t\tvalue = cloudformation.GetAtt(\"LB\", \"LoadBalancerFullName\").String()\n\t\tcase \"TargetGroup\":\n\t\t\tvalue = cloudformation.GetAtt(\"TG\", \"TargetGroupFullName\").String()\n\t\t}\n\n\t\tdimensions[i] = cloudformation.CloudWatchAlarmDimension{\n\t\t\tName: dimension.Name,\n\t\t\tValue: value,\n\t\t}\n\t}\n\n\treturn &dimensions\n}","func sanitizeDimensions(in machine.SwarmingDimensions) machine.SwarmingDimensions {\n\tret := machine.SwarmingDimensions{}\n\tfor key, slice := range in {\n\t\tif len(slice) == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tret[key] = in[key]\n\t}\n\treturn ret\n}","func (mf *MetricFilter) Normalize() (map[string][]string, error) {\n\tif mf.MetricName != \"\" {\n\t\tmf.MetricNames = append(mf.MetricNames, mf.MetricName)\n\t}\n\n\tdimSet := map[string][]string{}\n\tfor k, v := range mf.Dimensions {\n\t\tswitch s := v.(type) {\n\t\tcase []interface{}:\n\t\t\tnewSet := []string{}\n\t\t\tfor _, iv := range s {\n\t\t\t\tnewSet = append(newSet, fmt.Sprintf(\"%v\", iv))\n\t\t\t}\n\t\t\tdimSet[k] = newSet\n\t\tcase string:\n\t\t\tdimSet[k] = []string{s}\n\t\tdefault:\n\t\t\treturn nil, fmt.Errorf(\"%v should be either a string or string list\", v)\n\t\t}\n\t}\n\treturn dimSet, nil\n}","func (o MrScalarTaskScalingDownPolicyOutput) Dimensions() pulumi.MapOutput {\n\treturn o.ApplyT(func(v MrScalarTaskScalingDownPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\n}","func (b *taskBuilder) dimension(dims ...string) {\n\tfor _, dim := range dims {\n\t\tif !In(dim, b.Spec.Dimensions) {\n\t\t\tb.Spec.Dimensions = append(b.Spec.Dimensions, dim)\n\t\t}\n\t}\n}","func (o TopicRuleTimestreamOutput) Dimensions() TopicRuleTimestreamDimensionArrayOutput {\n\treturn o.ApplyT(func(v TopicRuleTimestream) []TopicRuleTimestreamDimension { return v.Dimensions }).(TopicRuleTimestreamDimensionArrayOutput)\n}","func (o ElastigroupScalingDownPolicyOutput) Dimensions() ElastigroupScalingDownPolicyDimensionArrayOutput {\n\treturn o.ApplyT(func(v ElastigroupScalingDownPolicy) []ElastigroupScalingDownPolicyDimension { return v.Dimensions }).(ElastigroupScalingDownPolicyDimensionArrayOutput)\n}","func (o ElastigroupScalingUpPolicyOutput) Dimensions() ElastigroupScalingUpPolicyDimensionArrayOutput {\n\treturn o.ApplyT(func(v ElastigroupScalingUpPolicy) []ElastigroupScalingUpPolicyDimension { return v.Dimensions }).(ElastigroupScalingUpPolicyDimensionArrayOutput)\n}","func (o MrScalarTaskScalingUpPolicyOutput) Dimensions() pulumi.MapOutput {\n\treturn o.ApplyT(func(v MrScalarTaskScalingUpPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\n}","func (s *MetricResultV2) SetDimensions(v map[string]*string) *MetricResultV2 {\n\ts.Dimensions = v\n\treturn s\n}","func normalizeDataIS(dateTime []time.Time, data []float64, minutes int) (temporaryDateTime []time.Time, temporaryData []float64, err error) {\n\n\t// Check the parameters\n\tif len(dateTime) == 0 || len(data) == 0 {\n\t\terr = errors.New(\"Empty\")\n\t\treturn\n\t}\n\tif len(dateTime) != len(data) {\n\t\terr = errors.New(\"DifferentSize\")\n\t\treturn\n\t}\n\tif minutes <= 0 {\n\t\terr = errors.New(\"MinutesInvalid\")\n\t\treturn\n\t}\n\n\t// If the minute is equal to 1, just return the original slices\n\tif minutes == 1 {\n\t\ttemporaryDateTime = dateTime\n\t\ttemporaryData = data\n\t\treturn\n\t}\n\n\t// Get the last valid position according to the minutes passed by parameter\n\tlastValidIndex := -1\n\tfor index := len(dateTime); index > 0; index-- {\n\t\tif index%minutes == 0 {\n\t\t\tlastValidIndex = index\n\t\t\tbreak\n\t\t}\n\t}\n\n\t// Store the first DateTime\n\tcurrentDateTime := dateTime[0]\n\n\t// \"Normalize\" the data based on the minutes passed as parameter\n\tfor index := 0; index < lastValidIndex; index += minutes {\n\n\t\ttempData := 0.0\n\t\tcount := 0\n\n\t\tfor tempIndex := index; tempIndex < index+minutes; tempIndex++ {\n\t\t\ttempData += data[tempIndex]\n\t\t\tcount++\n\t\t}\n\n\t\tcurrentDateTime = currentDateTime.Add(time.Duration(minutes) * time.Minute)\n\t\ttemporaryDateTime = append(temporaryDateTime, currentDateTime)\n\t\ttemporaryData = append(temporaryData, (tempData / float64(count)))\n\t}\n\n\treturn\n}","func modifyDimensions(name string, metricTypeString string, dims map[string]string, props map[string]interface{}) error {\n\tvar err error\n\t// Add common dimensions\n\tdims[\"agent\"] = \"telegraf\"\n\tdims[\"telegraf_type\"] = metricTypeString\n\n\t// If the plugin doesn't define a plugin name use metric.Name()\n\tif _, in := dims[\"plugin\"]; !in {\n\t\tdims[\"plugin\"] = name\n\t}\n\n\t// remove sf_prefix if it exists in the dimension map\n\tif _, in := dims[\"sf_prefix\"]; in {\n\t\tdelete(dims, \"sf_prefix\")\n\t}\n\n\t// if sfMetric exists\n\tif sfMetric, in := dims[\"sf_metric\"]; in {\n\t\t// if the metric is a metadata object\n\t\tif sfMetric == \"objects.host-meta-data\" {\n\t\t\t// If property exists remap it\n\t\t\tif _, in := dims[\"property\"]; in {\n\t\t\t\tprops[\"property\"] = dims[\"property\"]\n\t\t\t\tdelete(dims, \"property\")\n\t\t\t} else {\n\t\t\t\t// This is a malformed metadata event\n\t\t\t\terr = fmt.Errorf(\"E! Output [signalfx] objects.host-metadata object doesn't have a property\")\n\t\t\t}\n\t\t\t// remove the sf_metric dimension\n\t\t\tdelete(dims, \"sf_metric\")\n\t\t}\n\t}\n\treturn err\n}","func (o TopicRuleErrorActionTimestreamOutput) Dimensions() TopicRuleErrorActionTimestreamDimensionArrayOutput {\n\treturn o.ApplyT(func(v TopicRuleErrorActionTimestream) []TopicRuleErrorActionTimestreamDimension { return v.Dimensions }).(TopicRuleErrorActionTimestreamDimensionArrayOutput)\n}","func (s *GetMetricStatisticsInput) SetDimensions(v []*RequestDimensionsStruct) *GetMetricStatisticsInput {\n\ts.Dimensions = v\n\treturn s\n}","func (o MrScalarCoreScalingDownPolicyOutput) Dimensions() pulumi.MapOutput {\n\treturn o.ApplyT(func(v MrScalarCoreScalingDownPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\n}","func (a *AxisPosition) normalize(gtx layout.Context, axis layout.Axis, elements int, dimensioner Dimensioner) {\n\tif a.First < 0 {\n\t\ta.First = 0\n\t}\n\tif a.First > elements {\n\t\ta.First = elements - 1\n\t}\n\n\tconstraint := axis.Convert(gtx.Constraints.Max).X\n\tfor a.Offset < 0 && a.First > 0 {\n\t\ta.First--\n\t\tdim := dimensioner(axis, a.First, constraint)\n\t\ta.Offset += dim\n\t\ta.OffsetAbs += dim\n\t}\n\tif a.Offset < 0 {\n\t\ta.Offset = 0\n\t}\n\tfor a.Offset > dimensioner(axis, a.First, constraint) && a.First < elements-1 {\n\t\tdim := dimensioner(axis, a.First, constraint)\n\t\ta.First++\n\t\ta.Offset -= dim\n\t\ta.OffsetAbs += dim\n\t}\n}","func (s *HistoricalMetricResult) SetDimensions(v *Dimensions) *HistoricalMetricResult {\n\ts.Dimensions = v\n\treturn s\n}","func ConvertOtelDimensions(attributes pcommon.Map) []*cloudwatch.Dimension {\n\t// Loop through map, similar to EMF exporter createLabels().\n\tmTags := make(map[string]string, attributes.Len())\n\tattributes.Range(func(k string, v pcommon.Value) bool {\n\t\tmTags[k] = v.AsString()\n\t\treturn true\n\t})\n\treturn BuildDimensions(mTags)\n}","func (o MrScalarCoreScalingUpPolicyOutput) Dimensions() pulumi.MapOutput {\n\treturn o.ApplyT(func(v MrScalarCoreScalingUpPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\n}","func (s *CurrentMetricResult) SetDimensions(v *Dimensions) *CurrentMetricResult {\n\ts.Dimensions = v\n\treturn s\n}","func (s *Record) SetDimensions(v []*Dimension) *Record {\n\ts.Dimensions = v\n\treturn s\n}","func (o ElastigroupMultipleMetricsMetricOutput) Dimensions() ElastigroupMultipleMetricsMetricDimensionArrayOutput {\n\treturn o.ApplyT(func(v ElastigroupMultipleMetricsMetric) []ElastigroupMultipleMetricsMetricDimension {\n\t\treturn v.Dimensions\n\t}).(ElastigroupMultipleMetricsMetricDimensionArrayOutput)\n}","func normalize(input []float64) []float64 {\n\t// gracefully handle empty inputs.\n\tif len(input) == 0 {\n\t\treturn input\n\t}\n\tmin, max := input[0], input[0]\n\tfor _, v := range input {\n\t\tif v > max {\n\t\t\tmax = v\n\t\t}\n\t\tif v < min {\n\t\t\tmin = v\n\t\t}\n\t}\n\tfor i, v := range input {\n\t\tinput[i] = (v - min) / (max - min)\n\t}\n\treturn input\n}","func (o TopicRuleErrorActionTimestreamPtrOutput) Dimensions() TopicRuleErrorActionTimestreamDimensionArrayOutput {\n\treturn o.ApplyT(func(v *TopicRuleErrorActionTimestream) []TopicRuleErrorActionTimestreamDimension {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Dimensions\n\t}).(TopicRuleErrorActionTimestreamDimensionArrayOutput)\n}","func ParseWindows(tds []string, metaUpdatePeriod time.Duration) ([]time.Duration, error) {\n\tvar durs []time.Duration\n\tfor _, td := range tds {\n\t\tdur, err := time.ParseDuration(td)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"parsing %s: %v\", td, err)\n\t\t}\n\t\tif dur.Nanoseconds()%metaUpdatePeriod.Nanoseconds() != 0 {\n\t\t\treturn nil, fmt.Errorf(\"latency stats window %s is not a multiple of metadata update period %v\", td, metaUpdatePeriod)\n\t\t}\n\t\tdurs = append(durs, dur)\n\t}\n\treturn durs, nil\n}","func UnmarshalMetricEventDimensionsSlice(reader io.Reader, consumer runtime.Consumer) ([]MetricEventDimensions, error) {\n\tvar elements []json.RawMessage\n\tif err := consumer.Consume(reader, &elements); err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar result []MetricEventDimensions\n\tfor _, element := range elements {\n\t\tobj, err := unmarshalMetricEventDimensions(element, consumer)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tresult = append(result, obj)\n\t}\n\treturn result, nil\n}","func truncateRunning(cols []InflatedColumn) []InflatedColumn {\n\tif len(cols) == 0 {\n\t\treturn cols\n\t}\n\n\tfloor := float64(time.Now().Add(-72*time.Hour).UTC().Unix() * 1000)\n\n\tfor i := len(cols) - 1; i >= 0; i-- {\n\t\tif cols[i].Column.Started < floor {\n\t\t\tcontinue\n\t\t}\n\t\tfor _, cell := range cols[i].Cells {\n\t\t\tif cell.Result == statuspb.TestStatus_RUNNING {\n\t\t\t\treturn cols[i+1:]\n\t\t\t}\n\t\t}\n\t}\n\t// No cells are found to be running; do not truncate\n\treturn cols\n}","func (c *Config) Normalize() error {\n\tif c.TTL == \"\" {\n\t\tc.TTL = \"3s\"\n\t}\n\tif c.UpdateTTLInterval == \"\" {\n\t\tc.UpdateTTLInterval = \"1s\"\n\t}\n\tif c.DeregisterCriticalServiceAfter == \"\" {\n\t\tc.DeregisterCriticalServiceAfter = \"1m\"\n\t}\n\n\tvar err error\n\tif c.dTTL, err = time.ParseDuration(c.TTL); err != nil {\n\t\treturn err\n\t}\n\tif c.dUpdateTTLInterval, err = time.ParseDuration(c.UpdateTTLInterval); err != nil {\n\t\treturn err\n\t}\n\tif c.dDeregisterCriticalServiceAfter, err = time.ParseDuration(c.DeregisterCriticalServiceAfter); err != nil {\n\t\treturn err\n\t}\n\n\treturn nil\n}","func (o ElastigroupScalingTargetPolicyOutput) Dimensions() ElastigroupScalingTargetPolicyDimensionArrayOutput {\n\treturn o.ApplyT(func(v ElastigroupScalingTargetPolicy) []ElastigroupScalingTargetPolicyDimension { return v.Dimensions }).(ElastigroupScalingTargetPolicyDimensionArrayOutput)\n}","func filterDimensions(dimensions []*sfxpb.Dimension, dimensionsKeys []string) []*sfxpb.Dimension {\n\tif len(dimensions) == 0 || len(dimensionsKeys) == 0 {\n\t\treturn nil\n\t}\n\tresult := make([]*sfxpb.Dimension, 0, len(dimensionsKeys))\n\tfor _, dk := range dimensionsKeys {\n\t\tfor _, d := range dimensions {\n\t\t\tif d.Key == dk {\n\t\t\t\tresult = append(result, d)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t}\n\treturn result\n}","func ValidateDimensions(dimensions string) ([]Filter, error) {\n\tif dimensions == \"\" {\n\t\treturn nil, nil\n\t}\n\n\tdimensionList := strings.Split(dimensions, \",\")\n\n\tif len(dimensionList) > maximumDimensionFilters {\n\t\treturn nil, errs.ErrTooManyDimensionFilters\n\t}\n\n\tvar filters []Filter\n\tfor _, dimension := range dimensionList {\n\t\tfilters = append(filters, Filter{\n\t\t\tNested: &Nested{\n\t\t\t\tPath: \"dimensions\",\n\t\t\t\tQuery: []NestedQuery{\n\t\t\t\t\t{\n\t\t\t\t\t\tTerm: map[string]string{\n\t\t\t\t\t\t\tdimensionName: dimension},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t},\n\t\t})\n\t}\n\n\treturn filters, nil\n}","func ValidateFilterDimensions(filterDimensions []Dimension, dimensions *dataset.VersionDimensions) error {\n\tdimensionNames := make(map[string]int)\n\tfor _, dimension := range dimensions.Items {\n\t\tdimensionNames[dimension.Name] = 1\n\t}\n\n\tvar incorrectDimensions []string\n\tfor _, filterDimension := range filterDimensions {\n\t\tif _, ok := dimensionNames[filterDimension.Name]; !ok {\n\t\t\tincorrectDimensions = append(incorrectDimensions, filterDimension.Name)\n\t\t}\n\t}\n\n\tif incorrectDimensions != nil {\n\t\treturn fmt.Errorf(\"incorrect dimensions chosen: %v\", incorrectDimensions)\n\t}\n\n\treturn nil\n}","func (e *EndpointCore) Dimensions() map[string]string {\n\treturn utils.CloneStringMap(e.extraDimensions)\n}","func TimeDimension_Values() []string {\n\treturn []string{\n\t\tTimeDimensionHours,\n\t\tTimeDimensionDays,\n\t\tTimeDimensionWeeks,\n\t}\n}","func (t NormalizedDuration) Duration(m time.Duration) time.Duration {\n\treturn time.Duration(float64(m.Nanoseconds()) * float64(t))\n}","func (img *Image64) Normalize() {\n\t// find min and max\n\ttype minMax struct {\n\t\tmin, max Color64\n\t}\n\tminMaxCh := make(chan minMax, goRoutines)\n\n\t// divide rows between go routines\n\tfor t := 0; t < goRoutines; t++ {\n\t\ti0, i1 := goRountineRanges(img.Rect.Min.Y, img.Rect.Max.Y, t)\n\t\tgo func(y0, y1 int) {\n\t\t\tmm := minMax{Color64(math.MaxFloat64), Color64(-math.MaxFloat64)}\n\n\t\t\t// for each pixel\n\t\t\tfor y := y0; y < y1; y++ {\n\t\t\t\tindex := (y - img.Rect.Min.Y) * img.Stride\n\t\t\t\tfor x := img.Rect.Min.X; x < img.Rect.Max.X; x++ {\n\n\t\t\t\t\t// check if pixel is new min or max\n\t\t\t\t\tv := img.Pix[index]\n\t\t\t\t\tif v < mm.min {\n\t\t\t\t\t\tmm.min = v\n\t\t\t\t\t} else if v > mm.max {\n\t\t\t\t\t\tmm.max = v\n\t\t\t\t\t}\n\n\t\t\t\t\tindex++\n\t\t\t\t}\n\t\t\t}\n\t\t\tminMaxCh <- mm\n\t\t}(i0, i1)\n\t}\n\n\t// collect results of go routines\n\tmm := <-minMaxCh\n\tfor t := 1; t < goRoutines; t++ {\n\t\tv := <-minMaxCh\n\t\tif v.min < mm.min {\n\t\t\tmm.min = v.min\n\t\t}\n\t\tif v.max > mm.max {\n\t\t\tmm.max = v.max\n\t\t}\n\t}\n\n\t// normalize\n\tscale := 1.0 / (mm.max - mm.min)\n\n\t// divide rows between go routines\n\tvar wg sync.WaitGroup\n\twg.Add(goRoutines)\n\tfor t := 0; t < goRoutines; t++ {\n\t\ti0, i1 := goRountineRanges(img.Rect.Min.Y, img.Rect.Max.Y, t)\n\t\tgo func(y0, y1 int) {\n\n\t\t\t// for each pixel\n\t\t\tfor y := y0; y < y1; y++ {\n\t\t\t\ti := (y - img.Rect.Min.Y) * img.Stride\n\t\t\t\tfor x := img.Rect.Min.X; x < img.Rect.Max.X; x++ {\n\n\t\t\t\t\t// normalize\n\t\t\t\t\timg.Pix[i] = (img.Pix[i] - mm.min) * scale\n\n\t\t\t\t\ti++\n\t\t\t\t}\n\t\t\t}\n\t\t\twg.Done()\n\t\t}(i0, i1)\n\t}\n\twg.Wait()\n}","func (c *Config) ValidateAndNormalize() error {\n\tif c.Limit < 0 {\n\t\treturn errors.New(\"negative Limit is not allowed\")\n\t}\n\tif c.Expiration < 0 {\n\t\treturn errors.New(\"negative Expiration is not allowed\")\n\t}\n\n\tif c.Store == nil {\n\t\t// default store is memStore\n\t\t// c.Store = memstore.NewMemStore()\n\t\treturn errors.New(\"empty store is not allowed\")\n\t}\n\tif c.Limit == 0 {\n\t\t// default threshold of requests is 1000\n\t\tc.Limit = 1000\n\t}\n\tif c.Expiration == 0 {\n\t\t// default windowSize is an hour\n\t\tc.Expiration = 60 * 60\n\t}\n\n\treturn nil\n}","func BuildDimensions(mTags map[string]string) []*cloudwatch.Dimension {\n\n\tconst MaxDimensions = 10\n\tdimensions := make([]*cloudwatch.Dimension, 0, MaxDimensions)\n\n\t// This is pretty ugly but we always want to include the \"host\" tag if it exists.\n\tif host, ok := mTags[\"host\"]; ok && host != \"\" {\n\t\tdimensions = append(dimensions, &cloudwatch.Dimension{\n\t\t\tName: aws.String(\"host\"),\n\t\t\tValue: aws.String(host),\n\t\t})\n\t}\n\n\tvar keys []string\n\tfor k := range mTags {\n\t\tif k != \"host\" {\n\t\t\tkeys = append(keys, k)\n\t\t}\n\t}\n\tsort.Strings(keys)\n\n\tfor _, k := range keys {\n\t\tif len(dimensions) >= MaxDimensions {\n\t\t\tbreak\n\t\t}\n\n\t\tvalue := mTags[k]\n\t\tif value == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tdimensions = append(dimensions, &cloudwatch.Dimension{\n\t\t\tName: aws.String(k),\n\t\t\tValue: aws.String(mTags[k]),\n\t\t})\n\t}\n\n\treturn dimensions\n}","func (m *MetricDeclaration) ExtractDimensions(labels map[string]string) (dimensions [][]string) {\n\tfor _, dimensionSet := range m.Dimensions {\n\t\tif len(dimensionSet) == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tincludeSet := true\n\t\tfor _, dim := range dimensionSet {\n\t\t\tif _, ok := labels[dim]; !ok {\n\t\t\t\tincludeSet = false\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif includeSet {\n\t\t\tdimensions = append(dimensions, dimensionSet)\n\t\t}\n\t}\n\treturn\n}","func (r *Registrations) normalize() {\n\tfor _, entry := range r.Entries {\n\t\tif entry.RegistrationContent != nil {\n\t\t\tentry.RegistrationContent.normalize()\n\t\t}\n\t}\n}","func (d durationFixer) FixupDurations(raw interface{}) error {\n\trawMap, ok := raw.(map[string]interface{})\n\tif !ok {\n\t\treturn nil\n\t}\n\tfor key, val := range rawMap {\n\t\tswitch val.(type) {\n\t\tcase map[string]interface{}:\n\t\t\tif err := d.FixupDurations(val); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\tcase []interface{}:\n\t\t\tfor _, v := range val.([]interface{}) {\n\t\t\t\tif err := d.FixupDurations(v); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase []map[string]interface{}:\n\t\t\tfor _, v := range val.([]map[string]interface{}) {\n\t\t\t\tif err := d.FixupDurations(v); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t}\n\n\t\tdefault:\n\t\t\tif d[strings.ToLower(key)] {\n\t\t\t\t// Convert a string value into an integer\n\t\t\t\tif vStr, ok := val.(string); ok {\n\t\t\t\t\tdur, err := time.ParseDuration(vStr)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\trawMap[key] = dur\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}","func reduceGranularity(startTime int64,\n endTime int64, values [][]float64,\n numIntervals int,\n isAverage bool,\n) [][]float64 {\n start := float64(startTime)\n end := float64(endTime)\n intervalLength := (end - start) / float64(numIntervals)\n currentTime := start\n newValuesIndex := 0\n counter := 0\n newValues := [][]float64{{start, 0}}\n for i := 0; i < len(values); i++ {\n // keep incrementing window until timestamp fits in interval\n for values[i][0] >= currentTime+intervalLength && newValuesIndex < numIntervals {\n if counter > 1 && isAverage {\n // average out values for this interval\n newValues[newValuesIndex][1] =\n newValues[newValuesIndex][1] / float64(counter)\n } else if counter == 0 {\n // if no data for this interval, set this timestamp to have no value\n newValues[newValuesIndex] = []float64{newValues[newValuesIndex][0]}\n }\n // increment values for next interval\n currentTime += intervalLength\n newValuesIndex++\n // set count and add to next interval\n counter = 0\n newValues = append(newValues, []float64{currentTime, 0})\n }\n newValues[newValuesIndex][1] += values[i][1]\n counter++\n }\n // ensure the last interval is averaged or removed\n if counter > 1 && isAverage {\n newValues[newValuesIndex][1] = newValues[newValuesIndex][1] / float64(counter)\n } else if counter == 0 {\n newValues[newValuesIndex] = []float64{newValues[newValuesIndex][0]}\n }\n // Finally, add intervals with empty values until we reach endTime\n for end > currentTime+intervalLength && len(newValues) < numIntervals {\n currentTime += intervalLength\n newValues = append(newValues, []float64{currentTime})\n }\n return newValues\n}","func prepare(data [][]float64, smoothingWindow int) (normalisedData [][]float64){\n\t//smooth the data to make local minimum/maximum easier to find (this is Step 1 in the paper)\n\tsmoothedData, _ := gaussianSmooth2d(data, smoothingWindow)\n\n\t//prepare the data into the unit range (step 2 of paper)\n\tnormalisedData, _ = minmaxNormalise(smoothedData)\n\n\t//subtract normalised x from normalised y (this is step 3 in the paper)\n\tfor i := 0; i < len(normalisedData); i++{\n\t\tnormalisedData[i][1] = normalisedData[i][1] - normalisedData[i][0]\n\t}\n\treturn\n}","func parseExclusionIntervals() []timeWindow {\n windows := []timeWindow{}\n for _, w := range config.Sensor.ExclusionIntervals {\n providedStart, err := time.Parse(\"3:04pm\", w.Start)\n if err != nil {\n log.Warn(\"policy.exclusions\", \"exclusion interval time failed to parse \", w.Start)\n continue\n }\n duration, err := time.ParseDuration(w.Duration)\n if err != nil {\n log.Warn(\"policy.exclusions\", \"exclusion interval duration failed to parse \", w.Duration)\n continue\n }\n windows = append(windows, timeWindow{\n Hour: providedStart.Hour(),\n Minute: providedStart.Minute(),\n Duration: duration,\n Weekdays: w.DaysOfWeek})\n }\n return windows\n}","func (m mathUtil) Normalize(values ...float64) []float64 {\n\tvar total float64\n\tfor _, v := range values {\n\t\ttotal += v\n\t}\n\toutput := make([]float64, len(values))\n\tfor x, v := range values {\n\t\toutput[x] = m.RoundDown(v/total, 0.0001)\n\t}\n\treturn output\n}","func (s *Solution) Normalize() *Solution {\n\tclone := s.Clone()\n\n\tfor i, _ := range clone.Weighings {\n\t\tclone.Weighings[i] = NewWeighing(clone.Weighings[i].Pan(0).Sort(), clone.Weighings[i].Pan(1).Sort())\n\t}\n\tclone.flags |= NORMALISED &^ (CANONICALISED)\n\treturn clone\n}","func (mesh *Mesh) UpdateBounds() {\n\n\tfor _, v := range mesh.Vertices {\n\n\t\tif v.Position[0] < mesh.Dimensions[0][0] {\n\t\t\tmesh.Dimensions[0][0] = v.Position[0]\n\t\t}\n\t\tif v.Position[0] > mesh.Dimensions[1][0] {\n\t\t\tmesh.Dimensions[1][0] = v.Position[0]\n\t\t}\n\n\t\tif v.Position[1] < mesh.Dimensions[0][1] {\n\t\t\tmesh.Dimensions[0][1] = v.Position[1]\n\t\t}\n\t\tif v.Position[1] > mesh.Dimensions[1][1] {\n\t\t\tmesh.Dimensions[1][1] = v.Position[1]\n\t\t}\n\n\t\tif v.Position[2] < mesh.Dimensions[0][2] {\n\t\t\tmesh.Dimensions[0][2] = v.Position[2]\n\t\t}\n\t\tif v.Position[2] > mesh.Dimensions[1][2] {\n\t\t\tmesh.Dimensions[1][2] = v.Position[2]\n\t\t}\n\n\t}\n\n}","func (d *Definitions) Normalize() {\n\tmaxLength, max := 0, 0\n\tfor _, definition := range *d {\n\t\tif length := len(definition.Sense); length > maxLength {\n\t\t\tmaxLength = length\n\t\t}\n\t\tfor _, sense := range definition.Sense {\n\t\t\tif length := len([]rune(sense)); length > max {\n\t\t\t\tmax = length\n\t\t\t}\n\t\t}\n\t}\n\tfiller := \"\"\n\tfor i := 0; i < max; i++ {\n\t\tfiller += \" \"\n\t}\n\tfor i, definition := range *d {\n\t\tfor _, sense := range definition.Sense {\n\t\t\tfill := max - len(sense)\n\t\t\tfor j := 0; j < fill; j++ {\n\t\t\t\t(*d)[i].Ordinal += \" \"\n\t\t\t}\n\t\t\t(*d)[i].Ordinal += sense\n\t\t}\n\t}\n}","func WindowAggregativeMeasurement(queryAPI api.QueryAPI, queryData RangeMeasurementData) []map[string]interface{} {\n\tvar queryBuidler strings.Builder\n\n\trangeMeasureTemp.Execute(&queryBuidler, queryData)\n\tquery := queryBuidler.String()\n\tlog.Println(query)\n\treturn ExecuteQuery(queryAPI, query)\n}","func (p *Period) Normalize() *Period {\n\tseconds := p.Seconds % 60\n\tminutes := p.Seconds/60 + p.Minutes\n\tminutes, hours := minutes%60, minutes/60+p.Hours\n\thours = hours % 24\n\td := hours/24 + p.Days + p.Weeks*7\n\tdays := d % 30\n\tmonths, years := p.Months%12+d/30, p.Months/12+p.Years\n\n\treturn &Period{years, months, 0, days, hours, minutes, seconds}\n}","func (m *Machine) SetDimensionsForSwarming(dims machine.SwarmingDimensions) {\n\tm.mutex.Lock()\n\tdefer m.mutex.Unlock()\n\tm.dimensions = dims\n}","func UnmarshalMetricEventDimensions(reader io.Reader, consumer runtime.Consumer) (MetricEventDimensions, error) {\n\t// we need to read this twice, so first into a buffer\n\tdata, err := ioutil.ReadAll(reader)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn unmarshalMetricEventDimensions(data, consumer)\n}","func (ss SeriesSlice) Normalize() (int64, int64, int) {\n\tif len(ss) < 1 {\n\t\treturn 0, 0, 0\n\t}\n\tvar (\n\t\tstep = ss[0].Step()\n\t\tstart = ss[0].Start()\n\t\tend = ss[0].End()\n\t)\n\tfor _, s := range ss {\n\t\tstep = mathutil.Lcm(step, s.Step())\n\t\tstart = mathutil.MinInt64(start, s.Start())\n\t\tend = mathutil.MaxInt64(end, s.End())\n\t}\n\tend -= (end - start) % int64(step)\n\treturn start, end, step\n}","func (sx ScaleX) Normalize(min, max, x float64) float64 {\n\ttXMin := sx(min)\n\treturn (sx(x) - tXMin) / (sx(max) - tXMin)\n}","func cleanupUnusedDimensions(check *Check) {\n\n\tlog.Tracef(\"Check %s cleaning up -> size of resultLast : %d, size of resultCurrent: %d\", check.Name, len(check.resultLast), len(check.resultCurrent))\n\n\t// Loop through labels from last run and check if they are still valid for\n\t// the current run, otherwise remove them.\n\tvar remove bool\n\tfor _, labelsLast := range check.resultLast {\n\t\tremove = true\n\n\t\tif len(check.resultCurrent) > 0 {\n\t\t\tfor _, labelCurrent := range check.resultCurrent {\n\t\t\t\tif reflect.DeepEqual(labelsLast, labelCurrent) {\n\t\t\t\t\tremove = false\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove the stale metric\n\t\tif remove {\n\t\t\tlog.Debugf(\"Check %s remove stale metric vector with labels %s\", check.Name, MapToString(labelsLast))\n\n\t\t\tswitch check.MetricType {\n\t\t\tcase \"Gauge\":\n\t\t\t\tif !(check.metric.(*prometheus.GaugeVec).Delete(labelsLast)) {\n\t\t\t\t\tlog.Warnf(\"Failed to delete stale metric vector with label %s from check %s\", MapToString(labelsLast), check.Name)\n\t\t\t\t}\n\t\t\tcase \"Counter\":\n\t\t\t\tif !(check.metric.(*prometheus.CounterVec).Delete(labelsLast)) {\n\t\t\t\t\tlog.Warnf(\"Failed to delete stale metric vector with label %s from check %s\", MapToString(labelsLast), check.Name)\n\t\t\t\t}\n\t\t\tdefault:\n\t\t\t\tlog.Warnf(\"Not able to remove unknown metric type %s\", check.MetricType)\n\t\t\t}\n\t\t}\n\t}\n}","func (t *timeDataType) Truncate(d time.Duration) *timeDataType {\n\treturn t.Formatter(func(t time.Time) time.Time {\n\t\treturn t.Truncate(d)\n\t})\n}","func QueryRangeChunked(ctx context.Context, promConn prom.API, query string, startTime, endTime time.Time, chunkSize, stepSize time.Duration, maxTimeRanges int64, allowIncompleteChunks bool, handlers ResultHandler) (timeRanges []prom.Range, err error) {\n\ttimeRangesToProcess := getTimeRanges(startTime, endTime, chunkSize, stepSize, maxTimeRanges, allowIncompleteChunks)\n\n\tif handlers.PreProcessingHandler != nil {\n\t\terr = handlers.PreProcessingHandler(ctx, timeRangesToProcess)\n\t\tif err != nil {\n\t\t\treturn timeRanges, err\n\t\t}\n\t}\n\n\tif len(timeRangesToProcess) == 0 {\n\t\treturn nil, nil\n\t}\n\n\tfor _, timeRange := range timeRangesToProcess {\n\t\t// check for cancellation\n\t\tselect {\n\t\tcase <-ctx.Done():\n\t\t\treturn timeRanges, ctx.Err()\n\t\tdefault:\n\t\t\t// continue processing if context isn't cancelled.\n\t\t}\n\n\t\tif handlers.PreQueryHandler != nil {\n\t\t\terr = handlers.PreQueryHandler(ctx, timeRange)\n\t\t\tif err != nil {\n\t\t\t\treturn timeRanges, err\n\t\t\t}\n\t\t}\n\n\t\tpVal, err := promConn.QueryRange(ctx, query, timeRange)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"failed to perform Prometheus query: %v\", err)\n\t\t}\n\n\t\tmatrix, ok := pVal.(model.Matrix)\n\t\tif !ok {\n\t\t\treturn nil, fmt.Errorf(\"expected a matrix in response to query, got a %v\", pVal.Type())\n\t\t}\n\n\t\t// check for cancellation\n\t\tselect {\n\t\tcase <-ctx.Done():\n\t\t\treturn timeRanges, ctx.Err()\n\t\tdefault:\n\t\t\t// continue processing if context isn't cancelled.\n\t\t}\n\n\t\tif handlers.PostQueryHandler != nil {\n\t\t\terr = handlers.PostQueryHandler(ctx, timeRange, matrix)\n\t\t\tif err != nil {\n\t\t\t\treturn timeRanges, err\n\t\t\t}\n\t\t}\n\t\ttimeRanges = append(timeRanges, timeRange)\n\t}\n\n\tif handlers.PostProcessingHandler != nil {\n\t\terr = handlers.PostProcessingHandler(ctx, timeRanges)\n\t\tif err != nil {\n\t\t\treturn timeRanges, err\n\t\t}\n\t}\n\treturn timeRanges, nil\n}","func (self *Sax) normalize(measureList []float64) []float64 {\n var err error\n if len(measureList) < 1 {\n return measureList\n }\n\n s2 := float64(1)\n m2 := float64(0)\n m1 := mean(measureList)\n if err != nil {\n panic(err)\n }\n s1 := stdDev(measureList, m1)\n if err != nil {\n panic(err)\n }\n\n stdMultiplier := (s2 / s1)\n\n for i, m := range measureList {\n measureList[i] = float64(m2 + (m - m1)) * stdMultiplier\n }\n return measureList\n}","func createSecondsNormalized(seconds int) (vector []float64) {\n\tfor index := 0; index < seconds; index++ {\n\t\ttemp := float64(index) / float64(seconds-1)\n\t\tvector = append(vector, temp)\n\t}\n\treturn\n}","func (q Quat) Normalize() Quat {\n\tlength := q.Length()\n\tif length == 1 { // shortcut\n\t\treturn q\n\t}\n\treturn Quat{q.W / length, q.X / length, q.Y / length, q.Z / length}\n}","func sanitizeMetrics(m bson.M) bson.M {\n\tops := float64(0)\n\n\tif val := walkTo(m, []string{\"accesses\", \"ops\"}); val != nil {\n\t\tif f, err := asFloat64(val); err == nil {\n\t\t\tops = *f\n\t\t}\n\t}\n\n\tfilteredMetrics := bson.M{\n\t\t\"accesses\": bson.M{\n\t\t\t\"ops\": ops,\n\t\t},\n\t}\n\n\tif val := walkTo(m, []string{\"building\"}); val != nil {\n\t\tif f, err := asFloat64(val); err == nil {\n\t\t\tfilteredMetrics[\"building\"] = *f\n\t\t}\n\t}\n\n\treturn filteredMetrics\n}","func Normalize(series []Series, startTime, endTime time.Time, sample int, consolidation int) ([]Series, error) {\n\tif sample <= 0 {\n\t\treturn nil, ErrInvalidSample\n\t}\n\n\tlength := len(series)\n\tif length == 0 {\n\t\treturn nil, ErrEmptySeries\n\t}\n\n\tresult := make([]Series, length)\n\tbuckets := make([][]bucket, length)\n\n\t// Calculate the common step for all series based on time range and requested sampling\n\tstep := endTime.Sub(startTime) / time.Duration(sample)\n\n\t// Dispatch points into proper time step buckets and then apply consolidation function\n\tfor i, s := range series {\n\t\tif s.Points == nil {\n\t\t\t// Generate NaN points for whole series if none found (needed for gap detection)\n\t\t\tresult[i] = Series{\n\t\t\t\tPoints: make([]Point, sample),\n\t\t\t\tSummary: make(map[string]Value),\n\t\t\t}\n\n\t\t\tfor j := 0; j < sample; j++ {\n\t\t\t\tresult[i].Points[j] = Point{\n\t\t\t\t\tTime: startTime.Add(time.Duration(j) * step).Round(time.Second),\n\t\t\t\t\tValue: Value(math.NaN()),\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcontinue\n\t\t}\n\n\t\tbuckets[i] = make([]bucket, sample)\n\n\t\t// Initialize time steps\n\t\tfor j := 0; j < sample; j++ {\n\t\t\tbuckets[i][j] = bucket{\n\t\t\t\tpoints: make([]Point, 0),\n\t\t\t\ttime: startTime.Add(time.Duration(j) * (step + 1)).Round(time.Second),\n\t\t\t}\n\t\t}\n\n\t\tfor _, p := range s.Points {\n\t\t\t// Discard series points out of time specs range\n\t\t\tif p.Time.Before(startTime) || p.Time.After(endTime) {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\t// Stop if index goes beyond the requested sample\n\t\t\tidx := int64(float64(p.Time.UnixNano()-startTime.UnixNano())/float64(step.Nanoseconds())+1) - 1\n\t\t\tif idx >= int64(sample) {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tbuckets[i][idx].points = append(buckets[i][idx].points, p)\n\t\t}\n\n\t\tresult[i] = Series{\n\t\t\tPoints: make([]Point, sample),\n\t\t\tSummary: make(map[string]Value),\n\t\t}\n\n\t\t// Consolidate point buckets\n\t\tfor j := range buckets[i] {\n\t\t\tresult[i].Points[j] = buckets[i][j].Consolidate(consolidation)\n\t\t}\n\t}\n\n\treturn result, nil\n}","func (in *TimeWindowDays) DeepCopyInto(out *TimeWindowDays) {\n\t*out = *in\n\tif in.All != nil {\n\t\tin, out := &in.All, &out.All\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Sunday != nil {\n\t\tin, out := &in.Sunday, &out.Sunday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Monday != nil {\n\t\tin, out := &in.Monday, &out.Monday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Tuesday != nil {\n\t\tin, out := &in.Tuesday, &out.Tuesday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Wednesday != nil {\n\t\tin, out := &in.Wednesday, &out.Wednesday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Thursday != nil {\n\t\tin, out := &in.Thursday, &out.Thursday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Friday != nil {\n\t\tin, out := &in.Friday, &out.Friday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\tif in.Saturday != nil {\n\t\tin, out := &in.Saturday, &out.Saturday\n\t\t*out = make([]*TimeWindowTimeRange, len(*in))\n\t\tfor i := range *in {\n\t\t\tif (*in)[i] != nil {\n\t\t\t\tin, out := &(*in)[i], &(*out)[i]\n\t\t\t\t*out = new(TimeWindowTimeRange)\n\t\t\t\t**out = **in\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}","func (v Quat) Normalize() Quat {\n\tl := v.Length()\n\tif l != 0 {\n\t\tv.W /= l\n\t\tv.X /= l\n\t\tv.Y /= l\n\t\tv.Z /= l\n\t}\n\treturn v\n}","func (o ElastigroupRevertToSpotOutput) TimeWindows() pulumi.StringArrayOutput {\n\treturn o.ApplyT(func(v ElastigroupRevertToSpot) []string { return v.TimeWindows }).(pulumi.StringArrayOutput)\n}","func (sy ScaleY) Normalize(min, max, x float64) float64 {\n\ttYMin := sy(min)\n\treturn (sy(x) - tYMin) / (sy(max) - tYMin)\n}","func (n Notes) Normalized() Notes {\n\tnotes := make(Notes, 0)\n\tfor _, v := range n {\n\t\tnotes = append(notes, v.Normalize())\n\t}\n\n\treturn notes\n}","func CombineDimMeasurements(measurements []*DimMeasurement) *DimMeasurement {\n\tvar combinedValue float64 = 0.0\n\tfor _, measurement := range measurements {\n\t\tif measurement != nil {\n\t\t\tcombinedValue += measurement.ToInches()\n\t\t}\n\t}\n\treturn NewDimMeasurement(strconv.FormatFloat(combinedValue, 'f', -1, 64), constants.DimInch, constants.DimReal)\n}","func (b *BoundingBox) ResetDim(dim int) {\n\tb.Bounds[0][dim] = Inf(1)\n\tb.Bounds[1][dim] = Inf(-1)\n\n}","func (obj *GenericDimension) GetDimensionRaw(ctx context.Context) (json.RawMessage, error) {\n\tresult := &struct {\n\t\tDim json.RawMessage `json:\"qDim\"`\n\t}{}\n\terr := obj.RPC(ctx, \"GetDimension\", result)\n\treturn result.Dim, err\n}","func (t *Selector) Normalize() {}","func sanitizeData(data map[string]map[string]int) *Results {\n\tvar (\n\t\t// We need to generate our series\n\t\tdataSeries []ChartSeries\n\n\t\t// Needed for filling in missing data points.\n\t\trawData []labelTimeSeriesCollector\n\n\t\t// Needed for identifying the time range our time series needs\n\t\t// to span.\n\t\tmaxTime time.Time\n\t\tminTime time.Time\n\t)\n\n\tconst timeFormat = \"2006:1:2\"\n\n\t// \"Process them!\"\n\tfor label, series := range data {\n\t\tltsc := labelTimeSeriesCollector{label, nil}\n\n\t\tvar (\n\t\t\tpairValues = make([]timeValuePair, len(series))\n\t\t\tii = 0\n\t\t)\n\n\t\t// Process the series data tracking the min and max known times.\n\t\tfor tPoint, count := range series {\n\t\t\ttim, err := time.Parse(timeFormat, tPoint)\n\t\t\tif err != nil {\n\t\t\t\tpanic(err)\n\t\t\t}\n\n\t\t\tpairValues[ii] = timeValuePair{tim, int(count)}\n\t\t\tii++\n\n\t\t\tif maxTime.IsZero() || maxTime.Before(tim) {\n\t\t\t\tmaxTime = tim\n\t\t\t}\n\n\t\t\tif minTime.IsZero() || minTime.After(tim) {\n\t\t\t\tminTime = tim\n\t\t\t}\n\t\t}\n\n\t\tltsc.data = pairValues\n\n\t\t// Store that data for later...\n\t\trawData = append(rawData, ltsc)\n\t}\n\n\t// Synthesize the known time range as a mapping for easy querying.\n\tvar fullTimes = map[string]time.Time{}\n\tfor !minTime.After(maxTime) {\n\t\tfullTimes[minTime.Format(\"2006:1:2\")] = minTime\n\n\t\tminTime = minTime.Add(time.Hour * 24)\n\t}\n\n\tvar times []time.Time\n\n\t// Time to fill in some missing data.\n\tfor _, dataSet := range rawData {\n\t\t// Try to short circuit if there's no missing data.\n\t\tif len(dataSet.data) == len(fullTimes) {\n\t\t\tcontinue\n\t\t}\n\n\t\t// Otherwise, we're missing values :(\n\n\t\t// Generate a set of all known times from the new time series\n\t\tvar (\n\t\t\tknownTimes = map[string]struct{}{}\n\t\t\tformatter = func(t time.Time) string {\n\t\t\t\treturn t.Format(\"2006:1:2\")\n\t\t\t}\n\t\t)\n\n\t\t// Generate our known set.\n\t\tfor _, tim := range dataSet.data {\n\t\t\tknownTimes[formatter(tim.time)] = struct{}{}\n\t\t}\n\n\t\t// Find our set difference.\n\t\tfor timeLabel, timeReal := range fullTimes {\n\t\t\tif _, ok := knownTimes[timeLabel]; ok {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tdataSet.data = append(dataSet.data, timeValuePair{\n\t\t\t\ttime: timeReal,\n\t\t\t\tval: 0,\n\t\t\t})\n\t\t}\n\n\t\t// Now we need to sort them\n\t\tsort.Sort(ByTime(dataSet.data))\n\n\t\tvar (\n\t\t\ttimePoints []time.Time = make([]time.Time, len(dataSet.data))\n\t\t\tvalues []int = make([]int, len(dataSet.data))\n\t\t)\n\n\t\tfor i, val := range dataSet.data {\n\t\t\ttimePoints[i], values[i] = val.time, val.val\n\t\t}\n\n\t\tif times == nil {\n\t\t\ttimes = timePoints\n\t\t}\n\n\t\tdataSeries = append(dataSeries, ChartSeries{\n\t\t\tName: dataSet.label,\n\t\t\tValues: values,\n\t\t})\n\t}\n\n\treturn &Results{\n\t\tTimePoints: times,\n\t\tData: dataSeries,\n\t}\n}","func NewDimensionHandlers() *map[string]interface{} {\n\n\tm := make(map[string]interface{})\n\tm[\"dim\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\n\t\tresults := make(map[string]float64)\n\t\t//fmt.Printf(\"chars: %v\", characteristicMap)\n\t\tswitch len(dimensions) {\n\t\tcase 0:\n\t\t\t{\n\t\t\t\tresults[\"Area\"] = 0\n\t\t\t\t_, lengthIsPresent := characteristicMap[\"l\"]\n\t\t\t\tif lengthIsPresent {\n\t\t\t\t\tresults[\"Length\"] = float64(0)\n\t\t\t\t}\n\t\t\t\t_, widthIsPresent := characteristicMap[\"w\"]\n\t\t\t\tif widthIsPresent {\n\t\t\t\t\tresults[\"Width\"] = float64(0)\n\t\t\t\t}\n\t\t\t}\n\t\tcase 1:\n\t\t\t{\n\t\t\t\tresults[\"Length\"] = dimensions[0]\n\t\t\t}\n\t\tdefault:\n\t\t\t{\n\t\t\t\tresults[\"Area\"] = dimensions[0] * dimensions[1]\n\n\t\t\t\t_, lengthIsPresent := characteristicMap[\"l\"]\n\t\t\t\tif lengthIsPresent {\n\t\t\t\t\tresults[\"Length\"] = dimensions[0]\n\t\t\t\t}\n\t\t\t\t_, widthIsPresent := characteristicMap[\"w\"]\n\t\t\t\tif widthIsPresent {\n\t\t\t\t\tresults[\"Width\"] = dimensions[1]\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn results\n\t}\n\tm[\"sum\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\n\n\t\tresults := make(map[string]float64)\n\t\tsum := float64(0)\n\t\tfor _, x := range dimensions {\n\t\t\tsum += x\n\t\t}\n\t\tresults[\"Sum\"] = sum\n\t\tdimLength := float64(len(dimensions))\n\n\t\t_, lenIsPresent := characteristicMap[\"len\"]\n\t\tif lenIsPresent {\n\t\t\tresults[\"Len\"] = float64(dimLength)\n\t\t}\n\n\t\t_, avgIsPresent := characteristicMap[\"avg\"]\n\t\tif avgIsPresent {\n\t\t\tif dimLength > 0 {\n\t\t\t\tresults[\"Avg\"] = float64(sum / dimLength)\n\t\t\t} else {\n\t\t\t\tresults[\"Avg\"] = float64(0)\n\t\t\t}\n\t\t}\n\n\t\treturn results\n\t}\n\tm[\"profile\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\n\t\tresults := make(map[string]float64)\n\t\t//length := 0\n\t\tvar startIndex int\n\t\tsectionMeasurement := float64(0)\n\t\tif characteristicMap[\"xsection\"] != nil {\n\t\t\tstartIndex = 0\n\t\t\tsectionMeasurement = float64(0) //characteristicMap[\"xsection\"]\n\t\t\tswitch v := characteristicMap[\"xsection\"].(type) {\n\t\t\tcase []float64:\n\t\t\t\t{\n\t\t\t\t\tif len(v) > 0 {\n\t\t\t\t\t\tsectionMeasurement = v[0]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tstartIndex = 1\n\t\t\tsectionMeasurement = 0\n\t\t\tif len(dimensions) > 0 {\n\t\t\t\tsectionMeasurement = dimensions[0]\n\t\t\t}\n\n\t\t}\n\t\tsum := float64(0)\n\t\tfor i := startIndex; i < len(dimensions); i++ {\n\t\t\tsum += dimensions[i]\n\t\t}\n\n\t\tresults[\"Area\"] = sum * sectionMeasurement\n\t\tresults[\"Length\"] = sum\n\t\treturn results\n\t}\n\tm[\"frame\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\n\t\tresults := make(map[string]float64)\n\t\tvar height = float64(0)\n\t\tvar width = float64(0)\n\t\tvar depth = float64(0)\n\n\t\tswitch len(dimensions) {\n\t\tcase 0: //this should never happen, but include anyway\n\t\t\t{\n\t\t\t\theight = float64(12)\n\t\t\t\twidth = float64(12)\n\t\t\t\tdepth = float64(.75)\n\t\t\t}\n\t\tcase 1:\n\t\t\t{\n\t\t\t\theight = dimensions[0]\n\t\t\t\twidth = float64(12)\n\t\t\t\tdepth = float64(.75)\n\t\t\t}\n\t\tcase 2:\n\t\t\t{\n\t\t\t\theight = dimensions[0]\n\t\t\t\twidth = dimensions[1]\n\t\t\t\tdepth = float64(.75)\n\t\t\t}\n\t\tdefault:\n\t\t\t{\n\t\t\t\theight = dimensions[0]\n\t\t\t\twidth = dimensions[1]\n\t\t\t\tdepth = dimensions[2]\n\t\t\t}\n\t\t}\n\n\t\toffsets := [4]float64{0, 0, 0, 0}\n\t\toffsetsValue, offsetsIsPresent := characteristicMap[\"offsets\"]\n\t\tif offsetsIsPresent {\n\t\t\tswitch offsets_args := offsetsValue.(type) {\n\t\t\tcase []float64:\n\t\t\t\t{\n\t\t\t\t\tswitch len(offsets_args) {\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toffsets[0] = offsets_args[0]\n\t\t\t\t\t\t\toffsets[1] = offsets_args[0]\n\t\t\t\t\t\t\toffsets[2] = offsets_args[0]\n\t\t\t\t\t\t\toffsets[3] = offsets_args[0]\n\t\t\t\t\t\t}\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toffsets[0] = offsets_args[0]\n\t\t\t\t\t\t\toffsets[1] = offsets_args[1]\n\t\t\t\t\t\t\toffsets[2] = offsets_args[0]\n\t\t\t\t\t\t\toffsets[3] = offsets_args[1]\n\t\t\t\t\t\t}\n\t\t\t\t\tcase 4:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toffsets[0] = offsets_args[0]\n\t\t\t\t\t\t\toffsets[1] = offsets_args[1]\n\t\t\t\t\t\t\toffsets[2] = offsets_args[2]\n\t\t\t\t\t\t\toffsets[3] = offsets_args[3]\n\t\t\t\t\t\t}\n\t\t\t\t\tdefault:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toffsets[0] = float64(1)\n\t\t\t\t\t\t\toffsets[1] = offsets[0]\n\t\t\t\t\t\t\toffsets[2] = offsets[0]\n\t\t\t\t\t\t\toffsets[3] = offsets[0]\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} else {\n\t\t\toffsets[0] = float64(1)\n\t\t\toffsets[1] = offsets[0]\n\t\t\toffsets[2] = offsets[0]\n\t\t\toffsets[3] = offsets[0]\n\t\t}\n\n\t\tfaceNumber := float64(1)\n\t\tfaceValue, faceIsPresent := characteristicMap[\"face\"]\n\t\tif faceIsPresent {\n\t\t\tswitch face_args := faceValue.(type) {\n\t\t\tcase []float64:\n\t\t\t\t{\n\t\t\t\t\tif len(face_args) > 0 {\n\t\t\t\t\t\tfaceNumber = face_args[0]\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//offset[0] top\n\t\t//offset[1] right\n\t\t//offset[2] bottom\n\t\t//offset[3] left\n\n\t\theightPlusOffsets := height + offsets[0] + offsets[2]\n\t\twidthPlusOffsets := width + offsets[1] + offsets[3]\n\t\tface := heightPlusOffsets*widthPlusOffsets - width*height\n\n\t\tfmt.Printf(\"face:%v\", face)\n\t\tcir := 2 * depth * (heightPlusOffsets + widthPlusOffsets + height + width)\n\t\tresults[\"Area\"] = (faceNumber * face) + cir\n\t\treturn results\n\t}\n\treturn &m\n}","func (k *ConvKernel) Normalize() {\n\tdiameter := k.Radius*2 + 1\n\tarea := diameter * diameter\n\tsum := float32(0)\n\tfor i := 0; i < area; i++ {\n\t\tsum += k.Kernel[i]\n\t}\n\n\t// only attempt to normalize if the sum is significantly\n\t// different from both zero and one.\n\tfSum := float64(sum)\n\tif (math.Abs(fSum) >= TOLERANCE) && (math.Abs(fSum-1.0) >= TOLERANCE) {\n\t\tfor i := 0; i < area; i++ {\n\t\t\tk.Kernel[i] /= sum // normalize by dividing each entry\n\t\t}\n\t}\n}","func SubNormalise(attr *StatusAttribute, v int64) float64 {\n\treturn statusNormalise(attr, v)\n}","func (z *Zone) Normalize() {\n\tz.Domain = Normalize(z.Domain)\n\tz.InfoURL = NormalizeURL(z.InfoURL)\n\tvar tags []string\n\ttags = append(tags, z.Tags...)\n\tz.Tags = NewSet(tags...).Values()\n\tz.NameServers = NormalizeDomains(z.NameServers)\n\tz.Wildcards = NormalizeDomains(z.Wildcards)\n\tz.subdomains = NormalizeDomains(z.subdomains)\n\tz.WhoisServer = Normalize(z.WhoisServer)\n\tz.WhoisURL = NormalizeURL(z.WhoisURL)\n\tz.normalizePolicies()\n\tz.normalizeLanguages()\n}","func (p *PresentationTimeRange) UnmarshalJSON(data []byte) error {\n\tvar rawMsg map[string]json.RawMessage\n\tif err := json.Unmarshal(data, &rawMsg); err != nil {\n\t\treturn fmt.Errorf(\"unmarshalling type %T: %v\", p, err)\n\t}\n\tfor key, val := range rawMsg {\n\t\tvar err error\n\t\tswitch key {\n\t\tcase \"endTimestamp\":\n\t\t\terr = unpopulate(val, \"EndTimestamp\", &p.EndTimestamp)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"forceEndTimestamp\":\n\t\t\terr = unpopulate(val, \"ForceEndTimestamp\", &p.ForceEndTimestamp)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"liveBackoffDuration\":\n\t\t\terr = unpopulate(val, \"LiveBackoffDuration\", &p.LiveBackoffDuration)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"presentationWindowDuration\":\n\t\t\terr = unpopulate(val, \"PresentationWindowDuration\", &p.PresentationWindowDuration)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"startTimestamp\":\n\t\t\terr = unpopulate(val, \"StartTimestamp\", &p.StartTimestamp)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"timescale\":\n\t\t\terr = unpopulate(val, \"Timescale\", &p.Timescale)\n\t\t\tdelete(rawMsg, key)\n\t\t}\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"unmarshalling type %T: %v\", p, err)\n\t\t}\n\t}\n\treturn nil\n}","func (u *Unit) normalize() *Unit {\n\tif nu := units[*u]; nu != nil {\n\t\treturn nu\n\t}\n\treturn u\n}","func (seq Sequence) Truncate(width int, resolution time.Duration, asOf time.Time, until time.Time) (result Sequence) {\n\tif len(seq) == 0 {\n\t\treturn nil\n\t}\n\tresult = seq\n\toldUntil := result.Until()\n\tasOf = RoundTimeUntilDown(asOf, resolution, oldUntil)\n\tuntil = RoundTimeUntilDown(until, resolution, oldUntil)\n\n\tif !until.IsZero() {\n\t\tperiodsToRemove := int(oldUntil.Sub(until) / resolution)\n\t\tif periodsToRemove > 0 {\n\t\t\tbytesToRemove := periodsToRemove * width\n\t\t\tif bytesToRemove+Width64bits >= len(seq) {\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tresult = result[bytesToRemove:]\n\t\t\tresult.SetUntil(until)\n\t\t}\n\t}\n\n\tif !asOf.IsZero() {\n\t\tmaxPeriods := int(result.Until().Sub(asOf) / resolution)\n\t\tif maxPeriods <= 0 {\n\t\t\t// Entire sequence falls outside of truncation range\n\t\t\treturn nil\n\t\t}\n\t\tmaxLength := Width64bits + maxPeriods*width\n\t\tif maxLength >= len(result) {\n\t\t\treturn result\n\t\t}\n\t\treturn result[:maxLength]\n\t}\n\n\treturn result\n}","func MapToDimensions(input map[string]string) ([]Dimension, error) {\n\tdimensions := make([]Dimension, 0, len(input))\n\tfor k, v := range input {\n\t\td, err := NewDimension(k, v)\n\t\tif err != nil {\n\t\t\treturn []Dimension{}, err\n\t\t}\n\t\tdimensions = append(dimensions, d)\n\t}\n\n\treturn dimensions, nil\n}","func (o ElastigroupRevertToSpotPtrOutput) TimeWindows() pulumi.StringArrayOutput {\n\treturn o.ApplyT(func(v *ElastigroupRevertToSpot) []string {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.TimeWindows\n\t}).(pulumi.StringArrayOutput)\n}","func (m *Monitor) getCommonDimensions(partition *gopsutil.PartitionStat) map[string]string {\n\tdims := map[string]string{\n\t\t\"mountpoint\": strings.Replace(partition.Mountpoint, \" \", \"_\", -1),\n\t\t\"device\": strings.Replace(partition.Device, \" \", \"_\", -1),\n\t\t\"fs_type\": strings.Replace(partition.Fstype, \" \", \"_\", -1),\n\t}\n\tif m.sendModeDimension {\n\t\tvar mode string\n\t\topts := strings.Split(partition.Opts, \",\")\n\t\tfor _, opt := range opts {\n\t\t\tif opt == \"ro\" || opt == \"rw\" {\n\t\t\t\tmode = opt\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif mode == \"ro\" || mode == \"rw\" {\n\t\t\tdims[\"mode\"] = mode\n\t\t} else {\n\t\t\tm.logger.Infof(\"Failed to parse filesystem 'mode' for device `%s` - mountpoint `%s`\", partition.Device, partition.Mountpoint)\n\t\t}\n\t}\n\t// sanitize hostfs path in mountpoint\n\tif m.hostFSPath != \"\" {\n\t\tdims[\"mountpoint\"] = strings.Replace(dims[\"mountpoint\"], m.hostFSPath, \"\", 1)\n\t\tif dims[\"mountpoint\"] == \"\" {\n\t\t\tdims[\"mountpoint\"] = \"/\"\n\t\t}\n\t}\n\n\treturn dims\n}","func ctod(cDimensions []types.Dimension) *map[string]string {\n\tdimensions := map[string]string{}\n\tfor i := range cDimensions {\n\t\tdimensions[snakeCase(*cDimensions[i].Name)] = *cDimensions[i].Value\n\t}\n\treturn &dimensions\n}","func NormaliseDomain(start, end []byte, reverse bool) ([]byte, []byte) {\n\tif reverse {\n\t\tif len(end) == 0 {\n\t\t\tend = []byte{}\n\t\t}\n\t} else {\n\t\tif len(start) == 0 {\n\t\t\tstart = []byte{}\n\t\t}\n\t}\n\treturn start, end\n}","func adjustQueryTimes(from time.Time, to time.Time, interval Interval) (time.Time, time.Time, error) {\n\tfromRounded := roundupTimeForInterval(from, interval)\n\ttoRounded := roundupTimeForInterval(to, interval)\n\n\t// Data is available from the OPEN API for 90 days\n\tninetyDaysAgo := roundupTimeForInterval(time.Now().Add(-NINETY_DAYS), interval)\n\n\t// Is the 'to' (end) time before data is available? If so, that's an error.\n\tif timeBeforeOldestData(toRounded, ninetyDaysAgo) {\n\t\terr := errors.New(\"Time range is before available data\")\n\t\tlog.DefaultLogger.Info(\"adjustQueryTimes\", \"err\", err)\n\t\treturn fromRounded, toRounded, err\n\t}\n\n\t// Limit the 'from' (start) time to when the oldest data is available.\n\tfromLimited := limitTimeToOldestData(fromRounded, ninetyDaysAgo)\n\n\t// Returned the fixed 'to' and 'from' times.\n\treturn fromLimited, toRounded, nil\n}","func Normalize(t Tuplelike) Tuplelike {\n\treturn Divide(t, Magnitude(t))\n}","func UniformQuantizedConvolutionDimensionNumbers(value string) UniformQuantizedConvolutionAttr {\n\treturn func(m optionalAttr) {\n\t\tm[\"dimension_numbers\"] = value\n\t}\n}","func DeserializeArrayNonEmptyDomainAllDimensions(a *Array, buffer *Buffer, serializationType SerializationType) error {\n\n\tvar cClientSide = C.int32_t(0) // Currently this parameter is unused in libtiledb\n\tret := C.tiledb_deserialize_array_non_empty_domain_all_dimensions(a.context.tiledbContext, a.tiledbArray, buffer.tiledbBuffer, C.tiledb_serialization_type_t(serializationType), cClientSide)\n\tif ret != C.TILEDB_OK {\n\t\treturn fmt.Errorf(\"Error deserializing array nonempty domain: %s\", a.context.LastError())\n\t}\n\n\treturn nil\n}","func (d *DimensionProperties) UnmarshalJSON(data []byte) error {\n\tvar rawMsg map[string]json.RawMessage\n\tif err := json.Unmarshal(data, &rawMsg); err != nil {\n\t\treturn err\n\t}\n\tfor key, val := range rawMsg {\n\t\tvar err error\n\t\tswitch key {\n\t\tcase \"category\":\n\t\t\terr = unpopulate(val, &d.Category)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"data\":\n\t\t\terr = unpopulate(val, &d.Data)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"description\":\n\t\t\terr = unpopulate(val, &d.Description)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"filterEnabled\":\n\t\t\terr = unpopulate(val, &d.FilterEnabled)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"groupingEnabled\":\n\t\t\terr = unpopulate(val, &d.GroupingEnabled)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"nextLink\":\n\t\t\terr = unpopulate(val, &d.NextLink)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"total\":\n\t\t\terr = unpopulate(val, &d.Total)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"usageEnd\":\n\t\t\terr = unpopulateTimeRFC3339(val, &d.UsageEnd)\n\t\t\tdelete(rawMsg, key)\n\t\tcase \"usageStart\":\n\t\t\terr = unpopulateTimeRFC3339(val, &d.UsageStart)\n\t\t\tdelete(rawMsg, key)\n\t\t}\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}","func dealDurationBounds(size abi.PaddedPieceSize) (min abi.ChainEpoch, max abi.ChainEpoch) {\n\treturn abi.ChainEpoch(180 * builtin.EpochsInDay), abi.ChainEpoch(540 * builtin.EpochsInDay) // PARAM_FINISH\n}","func getFilteredMetrics(c *CloudWatch) ([]filteredMetric, error) {\n\tif c.metricCache != nil && c.metricCache.isValid() {\n\t\treturn c.metricCache.metrics, nil\n\t}\n\n\tfMetrics := []filteredMetric{}\n\n\t// check for provided metric filter\n\tif c.Metrics != nil {\n\t\tfor _, m := range c.Metrics {\n\t\t\tmetrics := []types.Metric{}\n\t\t\tvar accounts []string\n\t\t\tif !hasWildcard(m.Dimensions) {\n\t\t\t\tdimensions := make([]types.Dimension, 0, len(m.Dimensions))\n\t\t\t\tfor _, d := range m.Dimensions {\n\t\t\t\t\tdimensions = append(dimensions, types.Dimension{\n\t\t\t\t\t\tName: aws.String(d.Name),\n\t\t\t\t\t\tValue: aws.String(d.Value),\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t\tfor _, name := range m.MetricNames {\n\t\t\t\t\tfor _, namespace := range c.Namespaces {\n\t\t\t\t\t\tmetrics = append(metrics, types.Metric{\n\t\t\t\t\t\t\tNamespace: aws.String(namespace),\n\t\t\t\t\t\t\tMetricName: aws.String(name),\n\t\t\t\t\t\t\tDimensions: dimensions,\n\t\t\t\t\t\t})\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tallMetrics, allAccounts := c.fetchNamespaceMetrics()\n\n\t\t\t\tfor _, name := range m.MetricNames {\n\t\t\t\t\tfor i, metric := range allMetrics {\n\t\t\t\t\t\tif isSelected(name, metric, m.Dimensions) {\n\t\t\t\t\t\t\tfor _, namespace := range c.Namespaces {\n\t\t\t\t\t\t\t\tmetrics = append(metrics, types.Metric{\n\t\t\t\t\t\t\t\t\tNamespace: aws.String(namespace),\n\t\t\t\t\t\t\t\t\tMetricName: aws.String(name),\n\t\t\t\t\t\t\t\t\tDimensions: metric.Dimensions,\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif c.IncludeLinkedAccounts {\n\t\t\t\t\t\t\t\taccounts = append(accounts, allAccounts[i])\n\t\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\n\t\t\tif m.StatisticExclude == nil {\n\t\t\t\tm.StatisticExclude = &c.StatisticExclude\n\t\t\t}\n\t\t\tif m.StatisticInclude == nil {\n\t\t\t\tm.StatisticInclude = &c.StatisticInclude\n\t\t\t}\n\t\t\tstatFilter, err := filter.NewIncludeExcludeFilter(*m.StatisticInclude, *m.StatisticExclude)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tfMetrics = append(fMetrics, filteredMetric{\n\t\t\t\tmetrics: metrics,\n\t\t\t\tstatFilter: statFilter,\n\t\t\t\taccounts: accounts,\n\t\t\t})\n\t\t}\n\t} else {\n\t\tmetrics, accounts := c.fetchNamespaceMetrics()\n\t\tfMetrics = []filteredMetric{\n\t\t\t{\n\t\t\t\tmetrics: metrics,\n\t\t\t\tstatFilter: c.statFilter,\n\t\t\t\taccounts: accounts,\n\t\t\t},\n\t\t}\n\t}\n\tc.metricCache = &metricCache{\n\t\tmetrics: fMetrics,\n\t\tbuilt: time.Now(),\n\t\tttl: time.Duration(c.CacheTTL),\n\t}\n\treturn fMetrics, nil\n}","func (o AiIndexMetadataConfigOutput) Dimensions() pulumi.IntOutput {\n\treturn o.ApplyT(func(v AiIndexMetadataConfig) int { return v.Dimensions }).(pulumi.IntOutput)\n}","func (data *Data) AddDimensions(dimensions ...Dimension) {\n\tfor _, p := range *data {\n\t\tp.AddDimensions(dimensions...)\n\t}\n}","func TestConvertToGraphiteDims(t *testing.T) {\n\tconfig := map[string]interface{}{\n\t\t\"interval\": \"10\",\n\t\t\"timeout\": \"10\",\n\t\t\"max_buffer_size\": \"100\",\n\t\t\"server\": \"test_server\",\n\t\t\"port\": 10101,\n\t}\n\n\tg := getTestGraphiteHandler(12, 13, 14)\n\tg.Configure(config)\n\n\twaitForSplitSecond()\n\tnow := time.Now().Unix()\n\tm := metric.New(\"TestMetric\")\n\n\tdims := map[string]string{\n\t\t\"container_id\": \"test-id\",\n\t\t\"container_name\": \"test-container\",\n\t}\n\tm.Dimensions = dims\n\n\tdpString := g.convertToGraphite(m)\n\n\tassert.Equal(t, fmt.Sprintf(\"TestMetric.container_id.test-id.container_name.test-container 0.000000 %d\\n\", now), dpString)\n}","func (gd *Definition) Extents() []float64 {\n\treturn []float64{gd.Eorig, gd.Norig, gd.Eorig + gd.Cwidth*float64(gd.Ncol), gd.Norig - gd.Cwidth*float64(gd.Nrow)} // Left Up Right Down\n}","func convertMeasurementSlice(data []Measurement) measurements {\n\tresult := measurements{}\n\n\tfor _, m := range data {\n\t\tswitch m.(type) {\n\t\tcase Gauge:\n\t\t\tif result.Gauges == nil {\n\t\t\t\tresult.Gauges = make([]Gauge, 0)\n\t\t\t}\n\n\t\t\tresult.Gauges = append(result.Gauges, m.(Gauge))\n\n\t\tcase Counter:\n\t\t\tif result.Counters == nil {\n\t\t\t\tresult.Counters = make([]Counter, 0)\n\t\t\t}\n\n\t\t\tresult.Counters = append(result.Counters, m.(Counter))\n\t\t}\n\t}\n\n\treturn result\n}","func (m *Machine) DimensionsForSwarming() machine.SwarmingDimensions {\n\tm.mutex.Lock()\n\tdefer m.mutex.Unlock()\n\treturn m.dimensions\n}","func (d *Dimension) UnmarshalJSON(body []byte) error {\n\tvar m map[string]*json.RawMessage\n\terr := json.Unmarshal(body, &m)\n\tif err != nil {\n\t\treturn err\n\t}\n\tfor k, v := range m {\n\t\tswitch k {\n\t\tcase \"properties\":\n\t\t\tif v != nil {\n\t\t\t\tvar dimensionProperties DimensionProperties\n\t\t\t\terr = json.Unmarshal(*v, &dimensionProperties)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\td.DimensionProperties = &dimensionProperties\n\t\t\t}\n\t\tcase \"id\":\n\t\t\tif v != nil {\n\t\t\t\tvar ID string\n\t\t\t\terr = json.Unmarshal(*v, &ID)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\td.ID = &ID\n\t\t\t}\n\t\tcase \"name\":\n\t\t\tif v != nil {\n\t\t\t\tvar name string\n\t\t\t\terr = json.Unmarshal(*v, &name)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\td.Name = &name\n\t\t\t}\n\t\tcase \"type\":\n\t\t\tif v != nil {\n\t\t\t\tvar typeVar string\n\t\t\t\terr = json.Unmarshal(*v, &typeVar)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\td.Type = &typeVar\n\t\t\t}\n\t\tcase \"tags\":\n\t\t\tif v != nil {\n\t\t\t\tvar tags map[string]*string\n\t\t\t\terr = json.Unmarshal(*v, &tags)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\td.Tags = tags\n\t\t\t}\n\t\t}\n\t}\n\n\treturn nil\n}","func (k *Kernel) Normalized() ConvolutionMatrix {\n\tsum := absum(k)\n\tw := k.Width\n\th := k.Height\n\tnk := NewKernel(w, h)\n\n\t// avoid division by 0\n\tif sum == 0 {\n\t\tsum = 1\n\t}\n\n\tfor i := 0; i < w*h; i++ {\n\t\tnk.Matrix[i] = k.Matrix[i] / sum\n\t}\n\n\treturn nk\n}","func (b *BoundingBox) GrowDim(dim int, x float32) {\n\tb.Bounds[0][dim] = Min(b.Bounds[0][dim], x)\n\tb.Bounds[1][dim] = Max(b.Bounds[1][dim], x)\n}"],"string":"[\n \"func normalizeCloudWatchAlarmDimensions(alarmDimensions *cloudformation.CloudWatchAlarmDimensionList) *cloudformation.CloudWatchAlarmDimensionList {\\n\\tif alarmDimensions == nil || len(*alarmDimensions) == 0 {\\n\\t\\treturn &cloudformation.CloudWatchAlarmDimensionList{\\n\\t\\t\\t{\\n\\t\\t\\t\\tName: cloudformation.String(\\\"LoadBalancer\\\"),\\n\\t\\t\\t\\tValue: cloudformation.GetAtt(\\\"LB\\\", \\\"LoadBalancerFullName\\\").String(),\\n\\t\\t\\t},\\n\\t\\t}\\n\\t}\\n\\n\\tdimensions := make(cloudformation.CloudWatchAlarmDimensionList, len(*alarmDimensions))\\n\\n\\tfor i, dimension := range *alarmDimensions {\\n\\t\\tvalue := dimension.Value\\n\\n\\t\\tswitch dimension.Name.Literal {\\n\\t\\tcase \\\"LoadBalancer\\\":\\n\\t\\t\\tvalue = cloudformation.GetAtt(\\\"LB\\\", \\\"LoadBalancerFullName\\\").String()\\n\\t\\tcase \\\"TargetGroup\\\":\\n\\t\\t\\tvalue = cloudformation.GetAtt(\\\"TG\\\", \\\"TargetGroupFullName\\\").String()\\n\\t\\t}\\n\\n\\t\\tdimensions[i] = cloudformation.CloudWatchAlarmDimension{\\n\\t\\t\\tName: dimension.Name,\\n\\t\\t\\tValue: value,\\n\\t\\t}\\n\\t}\\n\\n\\treturn &dimensions\\n}\",\n \"func sanitizeDimensions(in machine.SwarmingDimensions) machine.SwarmingDimensions {\\n\\tret := machine.SwarmingDimensions{}\\n\\tfor key, slice := range in {\\n\\t\\tif len(slice) == 0 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tret[key] = in[key]\\n\\t}\\n\\treturn ret\\n}\",\n \"func (mf *MetricFilter) Normalize() (map[string][]string, error) {\\n\\tif mf.MetricName != \\\"\\\" {\\n\\t\\tmf.MetricNames = append(mf.MetricNames, mf.MetricName)\\n\\t}\\n\\n\\tdimSet := map[string][]string{}\\n\\tfor k, v := range mf.Dimensions {\\n\\t\\tswitch s := v.(type) {\\n\\t\\tcase []interface{}:\\n\\t\\t\\tnewSet := []string{}\\n\\t\\t\\tfor _, iv := range s {\\n\\t\\t\\t\\tnewSet = append(newSet, fmt.Sprintf(\\\"%v\\\", iv))\\n\\t\\t\\t}\\n\\t\\t\\tdimSet[k] = newSet\\n\\t\\tcase string:\\n\\t\\t\\tdimSet[k] = []string{s}\\n\\t\\tdefault:\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"%v should be either a string or string list\\\", v)\\n\\t\\t}\\n\\t}\\n\\treturn dimSet, nil\\n}\",\n \"func (o MrScalarTaskScalingDownPolicyOutput) Dimensions() pulumi.MapOutput {\\n\\treturn o.ApplyT(func(v MrScalarTaskScalingDownPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\\n}\",\n \"func (b *taskBuilder) dimension(dims ...string) {\\n\\tfor _, dim := range dims {\\n\\t\\tif !In(dim, b.Spec.Dimensions) {\\n\\t\\t\\tb.Spec.Dimensions = append(b.Spec.Dimensions, dim)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (o TopicRuleTimestreamOutput) Dimensions() TopicRuleTimestreamDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v TopicRuleTimestream) []TopicRuleTimestreamDimension { return v.Dimensions }).(TopicRuleTimestreamDimensionArrayOutput)\\n}\",\n \"func (o ElastigroupScalingDownPolicyOutput) Dimensions() ElastigroupScalingDownPolicyDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v ElastigroupScalingDownPolicy) []ElastigroupScalingDownPolicyDimension { return v.Dimensions }).(ElastigroupScalingDownPolicyDimensionArrayOutput)\\n}\",\n \"func (o ElastigroupScalingUpPolicyOutput) Dimensions() ElastigroupScalingUpPolicyDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v ElastigroupScalingUpPolicy) []ElastigroupScalingUpPolicyDimension { return v.Dimensions }).(ElastigroupScalingUpPolicyDimensionArrayOutput)\\n}\",\n \"func (o MrScalarTaskScalingUpPolicyOutput) Dimensions() pulumi.MapOutput {\\n\\treturn o.ApplyT(func(v MrScalarTaskScalingUpPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\\n}\",\n \"func (s *MetricResultV2) SetDimensions(v map[string]*string) *MetricResultV2 {\\n\\ts.Dimensions = v\\n\\treturn s\\n}\",\n \"func normalizeDataIS(dateTime []time.Time, data []float64, minutes int) (temporaryDateTime []time.Time, temporaryData []float64, err error) {\\n\\n\\t// Check the parameters\\n\\tif len(dateTime) == 0 || len(data) == 0 {\\n\\t\\terr = errors.New(\\\"Empty\\\")\\n\\t\\treturn\\n\\t}\\n\\tif len(dateTime) != len(data) {\\n\\t\\terr = errors.New(\\\"DifferentSize\\\")\\n\\t\\treturn\\n\\t}\\n\\tif minutes <= 0 {\\n\\t\\terr = errors.New(\\\"MinutesInvalid\\\")\\n\\t\\treturn\\n\\t}\\n\\n\\t// If the minute is equal to 1, just return the original slices\\n\\tif minutes == 1 {\\n\\t\\ttemporaryDateTime = dateTime\\n\\t\\ttemporaryData = data\\n\\t\\treturn\\n\\t}\\n\\n\\t// Get the last valid position according to the minutes passed by parameter\\n\\tlastValidIndex := -1\\n\\tfor index := len(dateTime); index > 0; index-- {\\n\\t\\tif index%minutes == 0 {\\n\\t\\t\\tlastValidIndex = index\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\n\\t// Store the first DateTime\\n\\tcurrentDateTime := dateTime[0]\\n\\n\\t// \\\"Normalize\\\" the data based on the minutes passed as parameter\\n\\tfor index := 0; index < lastValidIndex; index += minutes {\\n\\n\\t\\ttempData := 0.0\\n\\t\\tcount := 0\\n\\n\\t\\tfor tempIndex := index; tempIndex < index+minutes; tempIndex++ {\\n\\t\\t\\ttempData += data[tempIndex]\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\n\\t\\tcurrentDateTime = currentDateTime.Add(time.Duration(minutes) * time.Minute)\\n\\t\\ttemporaryDateTime = append(temporaryDateTime, currentDateTime)\\n\\t\\ttemporaryData = append(temporaryData, (tempData / float64(count)))\\n\\t}\\n\\n\\treturn\\n}\",\n \"func modifyDimensions(name string, metricTypeString string, dims map[string]string, props map[string]interface{}) error {\\n\\tvar err error\\n\\t// Add common dimensions\\n\\tdims[\\\"agent\\\"] = \\\"telegraf\\\"\\n\\tdims[\\\"telegraf_type\\\"] = metricTypeString\\n\\n\\t// If the plugin doesn't define a plugin name use metric.Name()\\n\\tif _, in := dims[\\\"plugin\\\"]; !in {\\n\\t\\tdims[\\\"plugin\\\"] = name\\n\\t}\\n\\n\\t// remove sf_prefix if it exists in the dimension map\\n\\tif _, in := dims[\\\"sf_prefix\\\"]; in {\\n\\t\\tdelete(dims, \\\"sf_prefix\\\")\\n\\t}\\n\\n\\t// if sfMetric exists\\n\\tif sfMetric, in := dims[\\\"sf_metric\\\"]; in {\\n\\t\\t// if the metric is a metadata object\\n\\t\\tif sfMetric == \\\"objects.host-meta-data\\\" {\\n\\t\\t\\t// If property exists remap it\\n\\t\\t\\tif _, in := dims[\\\"property\\\"]; in {\\n\\t\\t\\t\\tprops[\\\"property\\\"] = dims[\\\"property\\\"]\\n\\t\\t\\t\\tdelete(dims, \\\"property\\\")\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// This is a malformed metadata event\\n\\t\\t\\t\\terr = fmt.Errorf(\\\"E! Output [signalfx] objects.host-metadata object doesn't have a property\\\")\\n\\t\\t\\t}\\n\\t\\t\\t// remove the sf_metric dimension\\n\\t\\t\\tdelete(dims, \\\"sf_metric\\\")\\n\\t\\t}\\n\\t}\\n\\treturn err\\n}\",\n \"func (o TopicRuleErrorActionTimestreamOutput) Dimensions() TopicRuleErrorActionTimestreamDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v TopicRuleErrorActionTimestream) []TopicRuleErrorActionTimestreamDimension { return v.Dimensions }).(TopicRuleErrorActionTimestreamDimensionArrayOutput)\\n}\",\n \"func (s *GetMetricStatisticsInput) SetDimensions(v []*RequestDimensionsStruct) *GetMetricStatisticsInput {\\n\\ts.Dimensions = v\\n\\treturn s\\n}\",\n \"func (o MrScalarCoreScalingDownPolicyOutput) Dimensions() pulumi.MapOutput {\\n\\treturn o.ApplyT(func(v MrScalarCoreScalingDownPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\\n}\",\n \"func (a *AxisPosition) normalize(gtx layout.Context, axis layout.Axis, elements int, dimensioner Dimensioner) {\\n\\tif a.First < 0 {\\n\\t\\ta.First = 0\\n\\t}\\n\\tif a.First > elements {\\n\\t\\ta.First = elements - 1\\n\\t}\\n\\n\\tconstraint := axis.Convert(gtx.Constraints.Max).X\\n\\tfor a.Offset < 0 && a.First > 0 {\\n\\t\\ta.First--\\n\\t\\tdim := dimensioner(axis, a.First, constraint)\\n\\t\\ta.Offset += dim\\n\\t\\ta.OffsetAbs += dim\\n\\t}\\n\\tif a.Offset < 0 {\\n\\t\\ta.Offset = 0\\n\\t}\\n\\tfor a.Offset > dimensioner(axis, a.First, constraint) && a.First < elements-1 {\\n\\t\\tdim := dimensioner(axis, a.First, constraint)\\n\\t\\ta.First++\\n\\t\\ta.Offset -= dim\\n\\t\\ta.OffsetAbs += dim\\n\\t}\\n}\",\n \"func (s *HistoricalMetricResult) SetDimensions(v *Dimensions) *HistoricalMetricResult {\\n\\ts.Dimensions = v\\n\\treturn s\\n}\",\n \"func ConvertOtelDimensions(attributes pcommon.Map) []*cloudwatch.Dimension {\\n\\t// Loop through map, similar to EMF exporter createLabels().\\n\\tmTags := make(map[string]string, attributes.Len())\\n\\tattributes.Range(func(k string, v pcommon.Value) bool {\\n\\t\\tmTags[k] = v.AsString()\\n\\t\\treturn true\\n\\t})\\n\\treturn BuildDimensions(mTags)\\n}\",\n \"func (o MrScalarCoreScalingUpPolicyOutput) Dimensions() pulumi.MapOutput {\\n\\treturn o.ApplyT(func(v MrScalarCoreScalingUpPolicy) map[string]interface{} { return v.Dimensions }).(pulumi.MapOutput)\\n}\",\n \"func (s *CurrentMetricResult) SetDimensions(v *Dimensions) *CurrentMetricResult {\\n\\ts.Dimensions = v\\n\\treturn s\\n}\",\n \"func (s *Record) SetDimensions(v []*Dimension) *Record {\\n\\ts.Dimensions = v\\n\\treturn s\\n}\",\n \"func (o ElastigroupMultipleMetricsMetricOutput) Dimensions() ElastigroupMultipleMetricsMetricDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v ElastigroupMultipleMetricsMetric) []ElastigroupMultipleMetricsMetricDimension {\\n\\t\\treturn v.Dimensions\\n\\t}).(ElastigroupMultipleMetricsMetricDimensionArrayOutput)\\n}\",\n \"func normalize(input []float64) []float64 {\\n\\t// gracefully handle empty inputs.\\n\\tif len(input) == 0 {\\n\\t\\treturn input\\n\\t}\\n\\tmin, max := input[0], input[0]\\n\\tfor _, v := range input {\\n\\t\\tif v > max {\\n\\t\\t\\tmax = v\\n\\t\\t}\\n\\t\\tif v < min {\\n\\t\\t\\tmin = v\\n\\t\\t}\\n\\t}\\n\\tfor i, v := range input {\\n\\t\\tinput[i] = (v - min) / (max - min)\\n\\t}\\n\\treturn input\\n}\",\n \"func (o TopicRuleErrorActionTimestreamPtrOutput) Dimensions() TopicRuleErrorActionTimestreamDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v *TopicRuleErrorActionTimestream) []TopicRuleErrorActionTimestreamDimension {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Dimensions\\n\\t}).(TopicRuleErrorActionTimestreamDimensionArrayOutput)\\n}\",\n \"func ParseWindows(tds []string, metaUpdatePeriod time.Duration) ([]time.Duration, error) {\\n\\tvar durs []time.Duration\\n\\tfor _, td := range tds {\\n\\t\\tdur, err := time.ParseDuration(td)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"parsing %s: %v\\\", td, err)\\n\\t\\t}\\n\\t\\tif dur.Nanoseconds()%metaUpdatePeriod.Nanoseconds() != 0 {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"latency stats window %s is not a multiple of metadata update period %v\\\", td, metaUpdatePeriod)\\n\\t\\t}\\n\\t\\tdurs = append(durs, dur)\\n\\t}\\n\\treturn durs, nil\\n}\",\n \"func UnmarshalMetricEventDimensionsSlice(reader io.Reader, consumer runtime.Consumer) ([]MetricEventDimensions, error) {\\n\\tvar elements []json.RawMessage\\n\\tif err := consumer.Consume(reader, &elements); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tvar result []MetricEventDimensions\\n\\tfor _, element := range elements {\\n\\t\\tobj, err := unmarshalMetricEventDimensions(element, consumer)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tresult = append(result, obj)\\n\\t}\\n\\treturn result, nil\\n}\",\n \"func truncateRunning(cols []InflatedColumn) []InflatedColumn {\\n\\tif len(cols) == 0 {\\n\\t\\treturn cols\\n\\t}\\n\\n\\tfloor := float64(time.Now().Add(-72*time.Hour).UTC().Unix() * 1000)\\n\\n\\tfor i := len(cols) - 1; i >= 0; i-- {\\n\\t\\tif cols[i].Column.Started < floor {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tfor _, cell := range cols[i].Cells {\\n\\t\\t\\tif cell.Result == statuspb.TestStatus_RUNNING {\\n\\t\\t\\t\\treturn cols[i+1:]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t// No cells are found to be running; do not truncate\\n\\treturn cols\\n}\",\n \"func (c *Config) Normalize() error {\\n\\tif c.TTL == \\\"\\\" {\\n\\t\\tc.TTL = \\\"3s\\\"\\n\\t}\\n\\tif c.UpdateTTLInterval == \\\"\\\" {\\n\\t\\tc.UpdateTTLInterval = \\\"1s\\\"\\n\\t}\\n\\tif c.DeregisterCriticalServiceAfter == \\\"\\\" {\\n\\t\\tc.DeregisterCriticalServiceAfter = \\\"1m\\\"\\n\\t}\\n\\n\\tvar err error\\n\\tif c.dTTL, err = time.ParseDuration(c.TTL); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tif c.dUpdateTTLInterval, err = time.ParseDuration(c.UpdateTTLInterval); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tif c.dDeregisterCriticalServiceAfter, err = time.ParseDuration(c.DeregisterCriticalServiceAfter); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (o ElastigroupScalingTargetPolicyOutput) Dimensions() ElastigroupScalingTargetPolicyDimensionArrayOutput {\\n\\treturn o.ApplyT(func(v ElastigroupScalingTargetPolicy) []ElastigroupScalingTargetPolicyDimension { return v.Dimensions }).(ElastigroupScalingTargetPolicyDimensionArrayOutput)\\n}\",\n \"func filterDimensions(dimensions []*sfxpb.Dimension, dimensionsKeys []string) []*sfxpb.Dimension {\\n\\tif len(dimensions) == 0 || len(dimensionsKeys) == 0 {\\n\\t\\treturn nil\\n\\t}\\n\\tresult := make([]*sfxpb.Dimension, 0, len(dimensionsKeys))\\n\\tfor _, dk := range dimensionsKeys {\\n\\t\\tfor _, d := range dimensions {\\n\\t\\t\\tif d.Key == dk {\\n\\t\\t\\t\\tresult = append(result, d)\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn result\\n}\",\n \"func ValidateDimensions(dimensions string) ([]Filter, error) {\\n\\tif dimensions == \\\"\\\" {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\tdimensionList := strings.Split(dimensions, \\\",\\\")\\n\\n\\tif len(dimensionList) > maximumDimensionFilters {\\n\\t\\treturn nil, errs.ErrTooManyDimensionFilters\\n\\t}\\n\\n\\tvar filters []Filter\\n\\tfor _, dimension := range dimensionList {\\n\\t\\tfilters = append(filters, Filter{\\n\\t\\t\\tNested: &Nested{\\n\\t\\t\\t\\tPath: \\\"dimensions\\\",\\n\\t\\t\\t\\tQuery: []NestedQuery{\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tTerm: map[string]string{\\n\\t\\t\\t\\t\\t\\t\\tdimensionName: dimension},\\n\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t},\\n\\t\\t\\t},\\n\\t\\t})\\n\\t}\\n\\n\\treturn filters, nil\\n}\",\n \"func ValidateFilterDimensions(filterDimensions []Dimension, dimensions *dataset.VersionDimensions) error {\\n\\tdimensionNames := make(map[string]int)\\n\\tfor _, dimension := range dimensions.Items {\\n\\t\\tdimensionNames[dimension.Name] = 1\\n\\t}\\n\\n\\tvar incorrectDimensions []string\\n\\tfor _, filterDimension := range filterDimensions {\\n\\t\\tif _, ok := dimensionNames[filterDimension.Name]; !ok {\\n\\t\\t\\tincorrectDimensions = append(incorrectDimensions, filterDimension.Name)\\n\\t\\t}\\n\\t}\\n\\n\\tif incorrectDimensions != nil {\\n\\t\\treturn fmt.Errorf(\\\"incorrect dimensions chosen: %v\\\", incorrectDimensions)\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (e *EndpointCore) Dimensions() map[string]string {\\n\\treturn utils.CloneStringMap(e.extraDimensions)\\n}\",\n \"func TimeDimension_Values() []string {\\n\\treturn []string{\\n\\t\\tTimeDimensionHours,\\n\\t\\tTimeDimensionDays,\\n\\t\\tTimeDimensionWeeks,\\n\\t}\\n}\",\n \"func (t NormalizedDuration) Duration(m time.Duration) time.Duration {\\n\\treturn time.Duration(float64(m.Nanoseconds()) * float64(t))\\n}\",\n \"func (img *Image64) Normalize() {\\n\\t// find min and max\\n\\ttype minMax struct {\\n\\t\\tmin, max Color64\\n\\t}\\n\\tminMaxCh := make(chan minMax, goRoutines)\\n\\n\\t// divide rows between go routines\\n\\tfor t := 0; t < goRoutines; t++ {\\n\\t\\ti0, i1 := goRountineRanges(img.Rect.Min.Y, img.Rect.Max.Y, t)\\n\\t\\tgo func(y0, y1 int) {\\n\\t\\t\\tmm := minMax{Color64(math.MaxFloat64), Color64(-math.MaxFloat64)}\\n\\n\\t\\t\\t// for each pixel\\n\\t\\t\\tfor y := y0; y < y1; y++ {\\n\\t\\t\\t\\tindex := (y - img.Rect.Min.Y) * img.Stride\\n\\t\\t\\t\\tfor x := img.Rect.Min.X; x < img.Rect.Max.X; x++ {\\n\\n\\t\\t\\t\\t\\t// check if pixel is new min or max\\n\\t\\t\\t\\t\\tv := img.Pix[index]\\n\\t\\t\\t\\t\\tif v < mm.min {\\n\\t\\t\\t\\t\\t\\tmm.min = v\\n\\t\\t\\t\\t\\t} else if v > mm.max {\\n\\t\\t\\t\\t\\t\\tmm.max = v\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tindex++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tminMaxCh <- mm\\n\\t\\t}(i0, i1)\\n\\t}\\n\\n\\t// collect results of go routines\\n\\tmm := <-minMaxCh\\n\\tfor t := 1; t < goRoutines; t++ {\\n\\t\\tv := <-minMaxCh\\n\\t\\tif v.min < mm.min {\\n\\t\\t\\tmm.min = v.min\\n\\t\\t}\\n\\t\\tif v.max > mm.max {\\n\\t\\t\\tmm.max = v.max\\n\\t\\t}\\n\\t}\\n\\n\\t// normalize\\n\\tscale := 1.0 / (mm.max - mm.min)\\n\\n\\t// divide rows between go routines\\n\\tvar wg sync.WaitGroup\\n\\twg.Add(goRoutines)\\n\\tfor t := 0; t < goRoutines; t++ {\\n\\t\\ti0, i1 := goRountineRanges(img.Rect.Min.Y, img.Rect.Max.Y, t)\\n\\t\\tgo func(y0, y1 int) {\\n\\n\\t\\t\\t// for each pixel\\n\\t\\t\\tfor y := y0; y < y1; y++ {\\n\\t\\t\\t\\ti := (y - img.Rect.Min.Y) * img.Stride\\n\\t\\t\\t\\tfor x := img.Rect.Min.X; x < img.Rect.Max.X; x++ {\\n\\n\\t\\t\\t\\t\\t// normalize\\n\\t\\t\\t\\t\\timg.Pix[i] = (img.Pix[i] - mm.min) * scale\\n\\n\\t\\t\\t\\t\\ti++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\twg.Done()\\n\\t\\t}(i0, i1)\\n\\t}\\n\\twg.Wait()\\n}\",\n \"func (c *Config) ValidateAndNormalize() error {\\n\\tif c.Limit < 0 {\\n\\t\\treturn errors.New(\\\"negative Limit is not allowed\\\")\\n\\t}\\n\\tif c.Expiration < 0 {\\n\\t\\treturn errors.New(\\\"negative Expiration is not allowed\\\")\\n\\t}\\n\\n\\tif c.Store == nil {\\n\\t\\t// default store is memStore\\n\\t\\t// c.Store = memstore.NewMemStore()\\n\\t\\treturn errors.New(\\\"empty store is not allowed\\\")\\n\\t}\\n\\tif c.Limit == 0 {\\n\\t\\t// default threshold of requests is 1000\\n\\t\\tc.Limit = 1000\\n\\t}\\n\\tif c.Expiration == 0 {\\n\\t\\t// default windowSize is an hour\\n\\t\\tc.Expiration = 60 * 60\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func BuildDimensions(mTags map[string]string) []*cloudwatch.Dimension {\\n\\n\\tconst MaxDimensions = 10\\n\\tdimensions := make([]*cloudwatch.Dimension, 0, MaxDimensions)\\n\\n\\t// This is pretty ugly but we always want to include the \\\"host\\\" tag if it exists.\\n\\tif host, ok := mTags[\\\"host\\\"]; ok && host != \\\"\\\" {\\n\\t\\tdimensions = append(dimensions, &cloudwatch.Dimension{\\n\\t\\t\\tName: aws.String(\\\"host\\\"),\\n\\t\\t\\tValue: aws.String(host),\\n\\t\\t})\\n\\t}\\n\\n\\tvar keys []string\\n\\tfor k := range mTags {\\n\\t\\tif k != \\\"host\\\" {\\n\\t\\t\\tkeys = append(keys, k)\\n\\t\\t}\\n\\t}\\n\\tsort.Strings(keys)\\n\\n\\tfor _, k := range keys {\\n\\t\\tif len(dimensions) >= MaxDimensions {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\tvalue := mTags[k]\\n\\t\\tif value == \\\"\\\" {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tdimensions = append(dimensions, &cloudwatch.Dimension{\\n\\t\\t\\tName: aws.String(k),\\n\\t\\t\\tValue: aws.String(mTags[k]),\\n\\t\\t})\\n\\t}\\n\\n\\treturn dimensions\\n}\",\n \"func (m *MetricDeclaration) ExtractDimensions(labels map[string]string) (dimensions [][]string) {\\n\\tfor _, dimensionSet := range m.Dimensions {\\n\\t\\tif len(dimensionSet) == 0 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tincludeSet := true\\n\\t\\tfor _, dim := range dimensionSet {\\n\\t\\t\\tif _, ok := labels[dim]; !ok {\\n\\t\\t\\t\\tincludeSet = false\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif includeSet {\\n\\t\\t\\tdimensions = append(dimensions, dimensionSet)\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func (r *Registrations) normalize() {\\n\\tfor _, entry := range r.Entries {\\n\\t\\tif entry.RegistrationContent != nil {\\n\\t\\t\\tentry.RegistrationContent.normalize()\\n\\t\\t}\\n\\t}\\n}\",\n \"func (d durationFixer) FixupDurations(raw interface{}) error {\\n\\trawMap, ok := raw.(map[string]interface{})\\n\\tif !ok {\\n\\t\\treturn nil\\n\\t}\\n\\tfor key, val := range rawMap {\\n\\t\\tswitch val.(type) {\\n\\t\\tcase map[string]interface{}:\\n\\t\\t\\tif err := d.FixupDurations(val); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\n\\t\\tcase []interface{}:\\n\\t\\t\\tfor _, v := range val.([]interface{}) {\\n\\t\\t\\t\\tif err := d.FixupDurations(v); err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tcase []map[string]interface{}:\\n\\t\\t\\tfor _, v := range val.([]map[string]interface{}) {\\n\\t\\t\\t\\tif err := d.FixupDurations(v); err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tdefault:\\n\\t\\t\\tif d[strings.ToLower(key)] {\\n\\t\\t\\t\\t// Convert a string value into an integer\\n\\t\\t\\t\\tif vStr, ok := val.(string); ok {\\n\\t\\t\\t\\t\\tdur, err := time.ParseDuration(vStr)\\n\\t\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trawMap[key] = dur\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func reduceGranularity(startTime int64,\\n endTime int64, values [][]float64,\\n numIntervals int,\\n isAverage bool,\\n) [][]float64 {\\n start := float64(startTime)\\n end := float64(endTime)\\n intervalLength := (end - start) / float64(numIntervals)\\n currentTime := start\\n newValuesIndex := 0\\n counter := 0\\n newValues := [][]float64{{start, 0}}\\n for i := 0; i < len(values); i++ {\\n // keep incrementing window until timestamp fits in interval\\n for values[i][0] >= currentTime+intervalLength && newValuesIndex < numIntervals {\\n if counter > 1 && isAverage {\\n // average out values for this interval\\n newValues[newValuesIndex][1] =\\n newValues[newValuesIndex][1] / float64(counter)\\n } else if counter == 0 {\\n // if no data for this interval, set this timestamp to have no value\\n newValues[newValuesIndex] = []float64{newValues[newValuesIndex][0]}\\n }\\n // increment values for next interval\\n currentTime += intervalLength\\n newValuesIndex++\\n // set count and add to next interval\\n counter = 0\\n newValues = append(newValues, []float64{currentTime, 0})\\n }\\n newValues[newValuesIndex][1] += values[i][1]\\n counter++\\n }\\n // ensure the last interval is averaged or removed\\n if counter > 1 && isAverage {\\n newValues[newValuesIndex][1] = newValues[newValuesIndex][1] / float64(counter)\\n } else if counter == 0 {\\n newValues[newValuesIndex] = []float64{newValues[newValuesIndex][0]}\\n }\\n // Finally, add intervals with empty values until we reach endTime\\n for end > currentTime+intervalLength && len(newValues) < numIntervals {\\n currentTime += intervalLength\\n newValues = append(newValues, []float64{currentTime})\\n }\\n return newValues\\n}\",\n \"func prepare(data [][]float64, smoothingWindow int) (normalisedData [][]float64){\\n\\t//smooth the data to make local minimum/maximum easier to find (this is Step 1 in the paper)\\n\\tsmoothedData, _ := gaussianSmooth2d(data, smoothingWindow)\\n\\n\\t//prepare the data into the unit range (step 2 of paper)\\n\\tnormalisedData, _ = minmaxNormalise(smoothedData)\\n\\n\\t//subtract normalised x from normalised y (this is step 3 in the paper)\\n\\tfor i := 0; i < len(normalisedData); i++{\\n\\t\\tnormalisedData[i][1] = normalisedData[i][1] - normalisedData[i][0]\\n\\t}\\n\\treturn\\n}\",\n \"func parseExclusionIntervals() []timeWindow {\\n windows := []timeWindow{}\\n for _, w := range config.Sensor.ExclusionIntervals {\\n providedStart, err := time.Parse(\\\"3:04pm\\\", w.Start)\\n if err != nil {\\n log.Warn(\\\"policy.exclusions\\\", \\\"exclusion interval time failed to parse \\\", w.Start)\\n continue\\n }\\n duration, err := time.ParseDuration(w.Duration)\\n if err != nil {\\n log.Warn(\\\"policy.exclusions\\\", \\\"exclusion interval duration failed to parse \\\", w.Duration)\\n continue\\n }\\n windows = append(windows, timeWindow{\\n Hour: providedStart.Hour(),\\n Minute: providedStart.Minute(),\\n Duration: duration,\\n Weekdays: w.DaysOfWeek})\\n }\\n return windows\\n}\",\n \"func (m mathUtil) Normalize(values ...float64) []float64 {\\n\\tvar total float64\\n\\tfor _, v := range values {\\n\\t\\ttotal += v\\n\\t}\\n\\toutput := make([]float64, len(values))\\n\\tfor x, v := range values {\\n\\t\\toutput[x] = m.RoundDown(v/total, 0.0001)\\n\\t}\\n\\treturn output\\n}\",\n \"func (s *Solution) Normalize() *Solution {\\n\\tclone := s.Clone()\\n\\n\\tfor i, _ := range clone.Weighings {\\n\\t\\tclone.Weighings[i] = NewWeighing(clone.Weighings[i].Pan(0).Sort(), clone.Weighings[i].Pan(1).Sort())\\n\\t}\\n\\tclone.flags |= NORMALISED &^ (CANONICALISED)\\n\\treturn clone\\n}\",\n \"func (mesh *Mesh) UpdateBounds() {\\n\\n\\tfor _, v := range mesh.Vertices {\\n\\n\\t\\tif v.Position[0] < mesh.Dimensions[0][0] {\\n\\t\\t\\tmesh.Dimensions[0][0] = v.Position[0]\\n\\t\\t}\\n\\t\\tif v.Position[0] > mesh.Dimensions[1][0] {\\n\\t\\t\\tmesh.Dimensions[1][0] = v.Position[0]\\n\\t\\t}\\n\\n\\t\\tif v.Position[1] < mesh.Dimensions[0][1] {\\n\\t\\t\\tmesh.Dimensions[0][1] = v.Position[1]\\n\\t\\t}\\n\\t\\tif v.Position[1] > mesh.Dimensions[1][1] {\\n\\t\\t\\tmesh.Dimensions[1][1] = v.Position[1]\\n\\t\\t}\\n\\n\\t\\tif v.Position[2] < mesh.Dimensions[0][2] {\\n\\t\\t\\tmesh.Dimensions[0][2] = v.Position[2]\\n\\t\\t}\\n\\t\\tif v.Position[2] > mesh.Dimensions[1][2] {\\n\\t\\t\\tmesh.Dimensions[1][2] = v.Position[2]\\n\\t\\t}\\n\\n\\t}\\n\\n}\",\n \"func (d *Definitions) Normalize() {\\n\\tmaxLength, max := 0, 0\\n\\tfor _, definition := range *d {\\n\\t\\tif length := len(definition.Sense); length > maxLength {\\n\\t\\t\\tmaxLength = length\\n\\t\\t}\\n\\t\\tfor _, sense := range definition.Sense {\\n\\t\\t\\tif length := len([]rune(sense)); length > max {\\n\\t\\t\\t\\tmax = length\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfiller := \\\"\\\"\\n\\tfor i := 0; i < max; i++ {\\n\\t\\tfiller += \\\" \\\"\\n\\t}\\n\\tfor i, definition := range *d {\\n\\t\\tfor _, sense := range definition.Sense {\\n\\t\\t\\tfill := max - len(sense)\\n\\t\\t\\tfor j := 0; j < fill; j++ {\\n\\t\\t\\t\\t(*d)[i].Ordinal += \\\" \\\"\\n\\t\\t\\t}\\n\\t\\t\\t(*d)[i].Ordinal += sense\\n\\t\\t}\\n\\t}\\n}\",\n \"func WindowAggregativeMeasurement(queryAPI api.QueryAPI, queryData RangeMeasurementData) []map[string]interface{} {\\n\\tvar queryBuidler strings.Builder\\n\\n\\trangeMeasureTemp.Execute(&queryBuidler, queryData)\\n\\tquery := queryBuidler.String()\\n\\tlog.Println(query)\\n\\treturn ExecuteQuery(queryAPI, query)\\n}\",\n \"func (p *Period) Normalize() *Period {\\n\\tseconds := p.Seconds % 60\\n\\tminutes := p.Seconds/60 + p.Minutes\\n\\tminutes, hours := minutes%60, minutes/60+p.Hours\\n\\thours = hours % 24\\n\\td := hours/24 + p.Days + p.Weeks*7\\n\\tdays := d % 30\\n\\tmonths, years := p.Months%12+d/30, p.Months/12+p.Years\\n\\n\\treturn &Period{years, months, 0, days, hours, minutes, seconds}\\n}\",\n \"func (m *Machine) SetDimensionsForSwarming(dims machine.SwarmingDimensions) {\\n\\tm.mutex.Lock()\\n\\tdefer m.mutex.Unlock()\\n\\tm.dimensions = dims\\n}\",\n \"func UnmarshalMetricEventDimensions(reader io.Reader, consumer runtime.Consumer) (MetricEventDimensions, error) {\\n\\t// we need to read this twice, so first into a buffer\\n\\tdata, err := ioutil.ReadAll(reader)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn unmarshalMetricEventDimensions(data, consumer)\\n}\",\n \"func (ss SeriesSlice) Normalize() (int64, int64, int) {\\n\\tif len(ss) < 1 {\\n\\t\\treturn 0, 0, 0\\n\\t}\\n\\tvar (\\n\\t\\tstep = ss[0].Step()\\n\\t\\tstart = ss[0].Start()\\n\\t\\tend = ss[0].End()\\n\\t)\\n\\tfor _, s := range ss {\\n\\t\\tstep = mathutil.Lcm(step, s.Step())\\n\\t\\tstart = mathutil.MinInt64(start, s.Start())\\n\\t\\tend = mathutil.MaxInt64(end, s.End())\\n\\t}\\n\\tend -= (end - start) % int64(step)\\n\\treturn start, end, step\\n}\",\n \"func (sx ScaleX) Normalize(min, max, x float64) float64 {\\n\\ttXMin := sx(min)\\n\\treturn (sx(x) - tXMin) / (sx(max) - tXMin)\\n}\",\n \"func cleanupUnusedDimensions(check *Check) {\\n\\n\\tlog.Tracef(\\\"Check %s cleaning up -> size of resultLast : %d, size of resultCurrent: %d\\\", check.Name, len(check.resultLast), len(check.resultCurrent))\\n\\n\\t// Loop through labels from last run and check if they are still valid for\\n\\t// the current run, otherwise remove them.\\n\\tvar remove bool\\n\\tfor _, labelsLast := range check.resultLast {\\n\\t\\tremove = true\\n\\n\\t\\tif len(check.resultCurrent) > 0 {\\n\\t\\t\\tfor _, labelCurrent := range check.resultCurrent {\\n\\t\\t\\t\\tif reflect.DeepEqual(labelsLast, labelCurrent) {\\n\\t\\t\\t\\t\\tremove = false\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Remove the stale metric\\n\\t\\tif remove {\\n\\t\\t\\tlog.Debugf(\\\"Check %s remove stale metric vector with labels %s\\\", check.Name, MapToString(labelsLast))\\n\\n\\t\\t\\tswitch check.MetricType {\\n\\t\\t\\tcase \\\"Gauge\\\":\\n\\t\\t\\t\\tif !(check.metric.(*prometheus.GaugeVec).Delete(labelsLast)) {\\n\\t\\t\\t\\t\\tlog.Warnf(\\\"Failed to delete stale metric vector with label %s from check %s\\\", MapToString(labelsLast), check.Name)\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase \\\"Counter\\\":\\n\\t\\t\\t\\tif !(check.metric.(*prometheus.CounterVec).Delete(labelsLast)) {\\n\\t\\t\\t\\t\\tlog.Warnf(\\\"Failed to delete stale metric vector with label %s from check %s\\\", MapToString(labelsLast), check.Name)\\n\\t\\t\\t\\t}\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tlog.Warnf(\\\"Not able to remove unknown metric type %s\\\", check.MetricType)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (t *timeDataType) Truncate(d time.Duration) *timeDataType {\\n\\treturn t.Formatter(func(t time.Time) time.Time {\\n\\t\\treturn t.Truncate(d)\\n\\t})\\n}\",\n \"func QueryRangeChunked(ctx context.Context, promConn prom.API, query string, startTime, endTime time.Time, chunkSize, stepSize time.Duration, maxTimeRanges int64, allowIncompleteChunks bool, handlers ResultHandler) (timeRanges []prom.Range, err error) {\\n\\ttimeRangesToProcess := getTimeRanges(startTime, endTime, chunkSize, stepSize, maxTimeRanges, allowIncompleteChunks)\\n\\n\\tif handlers.PreProcessingHandler != nil {\\n\\t\\terr = handlers.PreProcessingHandler(ctx, timeRangesToProcess)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn timeRanges, err\\n\\t\\t}\\n\\t}\\n\\n\\tif len(timeRangesToProcess) == 0 {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\tfor _, timeRange := range timeRangesToProcess {\\n\\t\\t// check for cancellation\\n\\t\\tselect {\\n\\t\\tcase <-ctx.Done():\\n\\t\\t\\treturn timeRanges, ctx.Err()\\n\\t\\tdefault:\\n\\t\\t\\t// continue processing if context isn't cancelled.\\n\\t\\t}\\n\\n\\t\\tif handlers.PreQueryHandler != nil {\\n\\t\\t\\terr = handlers.PreQueryHandler(ctx, timeRange)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn timeRanges, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tpVal, err := promConn.QueryRange(ctx, query, timeRange)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"failed to perform Prometheus query: %v\\\", err)\\n\\t\\t}\\n\\n\\t\\tmatrix, ok := pVal.(model.Matrix)\\n\\t\\tif !ok {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"expected a matrix in response to query, got a %v\\\", pVal.Type())\\n\\t\\t}\\n\\n\\t\\t// check for cancellation\\n\\t\\tselect {\\n\\t\\tcase <-ctx.Done():\\n\\t\\t\\treturn timeRanges, ctx.Err()\\n\\t\\tdefault:\\n\\t\\t\\t// continue processing if context isn't cancelled.\\n\\t\\t}\\n\\n\\t\\tif handlers.PostQueryHandler != nil {\\n\\t\\t\\terr = handlers.PostQueryHandler(ctx, timeRange, matrix)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn timeRanges, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttimeRanges = append(timeRanges, timeRange)\\n\\t}\\n\\n\\tif handlers.PostProcessingHandler != nil {\\n\\t\\terr = handlers.PostProcessingHandler(ctx, timeRanges)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn timeRanges, err\\n\\t\\t}\\n\\t}\\n\\treturn timeRanges, nil\\n}\",\n \"func (self *Sax) normalize(measureList []float64) []float64 {\\n var err error\\n if len(measureList) < 1 {\\n return measureList\\n }\\n\\n s2 := float64(1)\\n m2 := float64(0)\\n m1 := mean(measureList)\\n if err != nil {\\n panic(err)\\n }\\n s1 := stdDev(measureList, m1)\\n if err != nil {\\n panic(err)\\n }\\n\\n stdMultiplier := (s2 / s1)\\n\\n for i, m := range measureList {\\n measureList[i] = float64(m2 + (m - m1)) * stdMultiplier\\n }\\n return measureList\\n}\",\n \"func createSecondsNormalized(seconds int) (vector []float64) {\\n\\tfor index := 0; index < seconds; index++ {\\n\\t\\ttemp := float64(index) / float64(seconds-1)\\n\\t\\tvector = append(vector, temp)\\n\\t}\\n\\treturn\\n}\",\n \"func (q Quat) Normalize() Quat {\\n\\tlength := q.Length()\\n\\tif length == 1 { // shortcut\\n\\t\\treturn q\\n\\t}\\n\\treturn Quat{q.W / length, q.X / length, q.Y / length, q.Z / length}\\n}\",\n \"func sanitizeMetrics(m bson.M) bson.M {\\n\\tops := float64(0)\\n\\n\\tif val := walkTo(m, []string{\\\"accesses\\\", \\\"ops\\\"}); val != nil {\\n\\t\\tif f, err := asFloat64(val); err == nil {\\n\\t\\t\\tops = *f\\n\\t\\t}\\n\\t}\\n\\n\\tfilteredMetrics := bson.M{\\n\\t\\t\\\"accesses\\\": bson.M{\\n\\t\\t\\t\\\"ops\\\": ops,\\n\\t\\t},\\n\\t}\\n\\n\\tif val := walkTo(m, []string{\\\"building\\\"}); val != nil {\\n\\t\\tif f, err := asFloat64(val); err == nil {\\n\\t\\t\\tfilteredMetrics[\\\"building\\\"] = *f\\n\\t\\t}\\n\\t}\\n\\n\\treturn filteredMetrics\\n}\",\n \"func Normalize(series []Series, startTime, endTime time.Time, sample int, consolidation int) ([]Series, error) {\\n\\tif sample <= 0 {\\n\\t\\treturn nil, ErrInvalidSample\\n\\t}\\n\\n\\tlength := len(series)\\n\\tif length == 0 {\\n\\t\\treturn nil, ErrEmptySeries\\n\\t}\\n\\n\\tresult := make([]Series, length)\\n\\tbuckets := make([][]bucket, length)\\n\\n\\t// Calculate the common step for all series based on time range and requested sampling\\n\\tstep := endTime.Sub(startTime) / time.Duration(sample)\\n\\n\\t// Dispatch points into proper time step buckets and then apply consolidation function\\n\\tfor i, s := range series {\\n\\t\\tif s.Points == nil {\\n\\t\\t\\t// Generate NaN points for whole series if none found (needed for gap detection)\\n\\t\\t\\tresult[i] = Series{\\n\\t\\t\\t\\tPoints: make([]Point, sample),\\n\\t\\t\\t\\tSummary: make(map[string]Value),\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor j := 0; j < sample; j++ {\\n\\t\\t\\t\\tresult[i].Points[j] = Point{\\n\\t\\t\\t\\t\\tTime: startTime.Add(time.Duration(j) * step).Round(time.Second),\\n\\t\\t\\t\\t\\tValue: Value(math.NaN()),\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tbuckets[i] = make([]bucket, sample)\\n\\n\\t\\t// Initialize time steps\\n\\t\\tfor j := 0; j < sample; j++ {\\n\\t\\t\\tbuckets[i][j] = bucket{\\n\\t\\t\\t\\tpoints: make([]Point, 0),\\n\\t\\t\\t\\ttime: startTime.Add(time.Duration(j) * (step + 1)).Round(time.Second),\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor _, p := range s.Points {\\n\\t\\t\\t// Discard series points out of time specs range\\n\\t\\t\\tif p.Time.Before(startTime) || p.Time.After(endTime) {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Stop if index goes beyond the requested sample\\n\\t\\t\\tidx := int64(float64(p.Time.UnixNano()-startTime.UnixNano())/float64(step.Nanoseconds())+1) - 1\\n\\t\\t\\tif idx >= int64(sample) {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tbuckets[i][idx].points = append(buckets[i][idx].points, p)\\n\\t\\t}\\n\\n\\t\\tresult[i] = Series{\\n\\t\\t\\tPoints: make([]Point, sample),\\n\\t\\t\\tSummary: make(map[string]Value),\\n\\t\\t}\\n\\n\\t\\t// Consolidate point buckets\\n\\t\\tfor j := range buckets[i] {\\n\\t\\t\\tresult[i].Points[j] = buckets[i][j].Consolidate(consolidation)\\n\\t\\t}\\n\\t}\\n\\n\\treturn result, nil\\n}\",\n \"func (in *TimeWindowDays) DeepCopyInto(out *TimeWindowDays) {\\n\\t*out = *in\\n\\tif in.All != nil {\\n\\t\\tin, out := &in.All, &out.All\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Sunday != nil {\\n\\t\\tin, out := &in.Sunday, &out.Sunday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Monday != nil {\\n\\t\\tin, out := &in.Monday, &out.Monday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Tuesday != nil {\\n\\t\\tin, out := &in.Tuesday, &out.Tuesday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Wednesday != nil {\\n\\t\\tin, out := &in.Wednesday, &out.Wednesday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Thursday != nil {\\n\\t\\tin, out := &in.Thursday, &out.Thursday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Friday != nil {\\n\\t\\tin, out := &in.Friday, &out.Friday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif in.Saturday != nil {\\n\\t\\tin, out := &in.Saturday, &out.Saturday\\n\\t\\t*out = make([]*TimeWindowTimeRange, len(*in))\\n\\t\\tfor i := range *in {\\n\\t\\t\\tif (*in)[i] != nil {\\n\\t\\t\\t\\tin, out := &(*in)[i], &(*out)[i]\\n\\t\\t\\t\\t*out = new(TimeWindowTimeRange)\\n\\t\\t\\t\\t**out = **in\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func (v Quat) Normalize() Quat {\\n\\tl := v.Length()\\n\\tif l != 0 {\\n\\t\\tv.W /= l\\n\\t\\tv.X /= l\\n\\t\\tv.Y /= l\\n\\t\\tv.Z /= l\\n\\t}\\n\\treturn v\\n}\",\n \"func (o ElastigroupRevertToSpotOutput) TimeWindows() pulumi.StringArrayOutput {\\n\\treturn o.ApplyT(func(v ElastigroupRevertToSpot) []string { return v.TimeWindows }).(pulumi.StringArrayOutput)\\n}\",\n \"func (sy ScaleY) Normalize(min, max, x float64) float64 {\\n\\ttYMin := sy(min)\\n\\treturn (sy(x) - tYMin) / (sy(max) - tYMin)\\n}\",\n \"func (n Notes) Normalized() Notes {\\n\\tnotes := make(Notes, 0)\\n\\tfor _, v := range n {\\n\\t\\tnotes = append(notes, v.Normalize())\\n\\t}\\n\\n\\treturn notes\\n}\",\n \"func CombineDimMeasurements(measurements []*DimMeasurement) *DimMeasurement {\\n\\tvar combinedValue float64 = 0.0\\n\\tfor _, measurement := range measurements {\\n\\t\\tif measurement != nil {\\n\\t\\t\\tcombinedValue += measurement.ToInches()\\n\\t\\t}\\n\\t}\\n\\treturn NewDimMeasurement(strconv.FormatFloat(combinedValue, 'f', -1, 64), constants.DimInch, constants.DimReal)\\n}\",\n \"func (b *BoundingBox) ResetDim(dim int) {\\n\\tb.Bounds[0][dim] = Inf(1)\\n\\tb.Bounds[1][dim] = Inf(-1)\\n\\n}\",\n \"func (obj *GenericDimension) GetDimensionRaw(ctx context.Context) (json.RawMessage, error) {\\n\\tresult := &struct {\\n\\t\\tDim json.RawMessage `json:\\\"qDim\\\"`\\n\\t}{}\\n\\terr := obj.RPC(ctx, \\\"GetDimension\\\", result)\\n\\treturn result.Dim, err\\n}\",\n \"func (t *Selector) Normalize() {}\",\n \"func sanitizeData(data map[string]map[string]int) *Results {\\n\\tvar (\\n\\t\\t// We need to generate our series\\n\\t\\tdataSeries []ChartSeries\\n\\n\\t\\t// Needed for filling in missing data points.\\n\\t\\trawData []labelTimeSeriesCollector\\n\\n\\t\\t// Needed for identifying the time range our time series needs\\n\\t\\t// to span.\\n\\t\\tmaxTime time.Time\\n\\t\\tminTime time.Time\\n\\t)\\n\\n\\tconst timeFormat = \\\"2006:1:2\\\"\\n\\n\\t// \\\"Process them!\\\"\\n\\tfor label, series := range data {\\n\\t\\tltsc := labelTimeSeriesCollector{label, nil}\\n\\n\\t\\tvar (\\n\\t\\t\\tpairValues = make([]timeValuePair, len(series))\\n\\t\\t\\tii = 0\\n\\t\\t)\\n\\n\\t\\t// Process the series data tracking the min and max known times.\\n\\t\\tfor tPoint, count := range series {\\n\\t\\t\\ttim, err := time.Parse(timeFormat, tPoint)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tpanic(err)\\n\\t\\t\\t}\\n\\n\\t\\t\\tpairValues[ii] = timeValuePair{tim, int(count)}\\n\\t\\t\\tii++\\n\\n\\t\\t\\tif maxTime.IsZero() || maxTime.Before(tim) {\\n\\t\\t\\t\\tmaxTime = tim\\n\\t\\t\\t}\\n\\n\\t\\t\\tif minTime.IsZero() || minTime.After(tim) {\\n\\t\\t\\t\\tminTime = tim\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tltsc.data = pairValues\\n\\n\\t\\t// Store that data for later...\\n\\t\\trawData = append(rawData, ltsc)\\n\\t}\\n\\n\\t// Synthesize the known time range as a mapping for easy querying.\\n\\tvar fullTimes = map[string]time.Time{}\\n\\tfor !minTime.After(maxTime) {\\n\\t\\tfullTimes[minTime.Format(\\\"2006:1:2\\\")] = minTime\\n\\n\\t\\tminTime = minTime.Add(time.Hour * 24)\\n\\t}\\n\\n\\tvar times []time.Time\\n\\n\\t// Time to fill in some missing data.\\n\\tfor _, dataSet := range rawData {\\n\\t\\t// Try to short circuit if there's no missing data.\\n\\t\\tif len(dataSet.data) == len(fullTimes) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\t// Otherwise, we're missing values :(\\n\\n\\t\\t// Generate a set of all known times from the new time series\\n\\t\\tvar (\\n\\t\\t\\tknownTimes = map[string]struct{}{}\\n\\t\\t\\tformatter = func(t time.Time) string {\\n\\t\\t\\t\\treturn t.Format(\\\"2006:1:2\\\")\\n\\t\\t\\t}\\n\\t\\t)\\n\\n\\t\\t// Generate our known set.\\n\\t\\tfor _, tim := range dataSet.data {\\n\\t\\t\\tknownTimes[formatter(tim.time)] = struct{}{}\\n\\t\\t}\\n\\n\\t\\t// Find our set difference.\\n\\t\\tfor timeLabel, timeReal := range fullTimes {\\n\\t\\t\\tif _, ok := knownTimes[timeLabel]; ok {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tdataSet.data = append(dataSet.data, timeValuePair{\\n\\t\\t\\t\\ttime: timeReal,\\n\\t\\t\\t\\tval: 0,\\n\\t\\t\\t})\\n\\t\\t}\\n\\n\\t\\t// Now we need to sort them\\n\\t\\tsort.Sort(ByTime(dataSet.data))\\n\\n\\t\\tvar (\\n\\t\\t\\ttimePoints []time.Time = make([]time.Time, len(dataSet.data))\\n\\t\\t\\tvalues []int = make([]int, len(dataSet.data))\\n\\t\\t)\\n\\n\\t\\tfor i, val := range dataSet.data {\\n\\t\\t\\ttimePoints[i], values[i] = val.time, val.val\\n\\t\\t}\\n\\n\\t\\tif times == nil {\\n\\t\\t\\ttimes = timePoints\\n\\t\\t}\\n\\n\\t\\tdataSeries = append(dataSeries, ChartSeries{\\n\\t\\t\\tName: dataSet.label,\\n\\t\\t\\tValues: values,\\n\\t\\t})\\n\\t}\\n\\n\\treturn &Results{\\n\\t\\tTimePoints: times,\\n\\t\\tData: dataSeries,\\n\\t}\\n}\",\n \"func NewDimensionHandlers() *map[string]interface{} {\\n\\n\\tm := make(map[string]interface{})\\n\\tm[\\\"dim\\\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\\n\\t\\tresults := make(map[string]float64)\\n\\t\\t//fmt.Printf(\\\"chars: %v\\\", characteristicMap)\\n\\t\\tswitch len(dimensions) {\\n\\t\\tcase 0:\\n\\t\\t\\t{\\n\\t\\t\\t\\tresults[\\\"Area\\\"] = 0\\n\\t\\t\\t\\t_, lengthIsPresent := characteristicMap[\\\"l\\\"]\\n\\t\\t\\t\\tif lengthIsPresent {\\n\\t\\t\\t\\t\\tresults[\\\"Length\\\"] = float64(0)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t_, widthIsPresent := characteristicMap[\\\"w\\\"]\\n\\t\\t\\t\\tif widthIsPresent {\\n\\t\\t\\t\\t\\tresults[\\\"Width\\\"] = float64(0)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\tcase 1:\\n\\t\\t\\t{\\n\\t\\t\\t\\tresults[\\\"Length\\\"] = dimensions[0]\\n\\t\\t\\t}\\n\\t\\tdefault:\\n\\t\\t\\t{\\n\\t\\t\\t\\tresults[\\\"Area\\\"] = dimensions[0] * dimensions[1]\\n\\n\\t\\t\\t\\t_, lengthIsPresent := characteristicMap[\\\"l\\\"]\\n\\t\\t\\t\\tif lengthIsPresent {\\n\\t\\t\\t\\t\\tresults[\\\"Length\\\"] = dimensions[0]\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t_, widthIsPresent := characteristicMap[\\\"w\\\"]\\n\\t\\t\\t\\tif widthIsPresent {\\n\\t\\t\\t\\t\\tresults[\\\"Width\\\"] = dimensions[1]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn results\\n\\t}\\n\\tm[\\\"sum\\\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\\n\\n\\t\\tresults := make(map[string]float64)\\n\\t\\tsum := float64(0)\\n\\t\\tfor _, x := range dimensions {\\n\\t\\t\\tsum += x\\n\\t\\t}\\n\\t\\tresults[\\\"Sum\\\"] = sum\\n\\t\\tdimLength := float64(len(dimensions))\\n\\n\\t\\t_, lenIsPresent := characteristicMap[\\\"len\\\"]\\n\\t\\tif lenIsPresent {\\n\\t\\t\\tresults[\\\"Len\\\"] = float64(dimLength)\\n\\t\\t}\\n\\n\\t\\t_, avgIsPresent := characteristicMap[\\\"avg\\\"]\\n\\t\\tif avgIsPresent {\\n\\t\\t\\tif dimLength > 0 {\\n\\t\\t\\t\\tresults[\\\"Avg\\\"] = float64(sum / dimLength)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tresults[\\\"Avg\\\"] = float64(0)\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn results\\n\\t}\\n\\tm[\\\"profile\\\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\\n\\t\\tresults := make(map[string]float64)\\n\\t\\t//length := 0\\n\\t\\tvar startIndex int\\n\\t\\tsectionMeasurement := float64(0)\\n\\t\\tif characteristicMap[\\\"xsection\\\"] != nil {\\n\\t\\t\\tstartIndex = 0\\n\\t\\t\\tsectionMeasurement = float64(0) //characteristicMap[\\\"xsection\\\"]\\n\\t\\t\\tswitch v := characteristicMap[\\\"xsection\\\"].(type) {\\n\\t\\t\\tcase []float64:\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif len(v) > 0 {\\n\\t\\t\\t\\t\\t\\tsectionMeasurement = v[0]\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tstartIndex = 1\\n\\t\\t\\tsectionMeasurement = 0\\n\\t\\t\\tif len(dimensions) > 0 {\\n\\t\\t\\t\\tsectionMeasurement = dimensions[0]\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tsum := float64(0)\\n\\t\\tfor i := startIndex; i < len(dimensions); i++ {\\n\\t\\t\\tsum += dimensions[i]\\n\\t\\t}\\n\\n\\t\\tresults[\\\"Area\\\"] = sum * sectionMeasurement\\n\\t\\tresults[\\\"Length\\\"] = sum\\n\\t\\treturn results\\n\\t}\\n\\tm[\\\"frame\\\"] = func(dimensions []float64, characteristicMap map[string]interface{}) map[string]float64 {\\n\\t\\tresults := make(map[string]float64)\\n\\t\\tvar height = float64(0)\\n\\t\\tvar width = float64(0)\\n\\t\\tvar depth = float64(0)\\n\\n\\t\\tswitch len(dimensions) {\\n\\t\\tcase 0: //this should never happen, but include anyway\\n\\t\\t\\t{\\n\\t\\t\\t\\theight = float64(12)\\n\\t\\t\\t\\twidth = float64(12)\\n\\t\\t\\t\\tdepth = float64(.75)\\n\\t\\t\\t}\\n\\t\\tcase 1:\\n\\t\\t\\t{\\n\\t\\t\\t\\theight = dimensions[0]\\n\\t\\t\\t\\twidth = float64(12)\\n\\t\\t\\t\\tdepth = float64(.75)\\n\\t\\t\\t}\\n\\t\\tcase 2:\\n\\t\\t\\t{\\n\\t\\t\\t\\theight = dimensions[0]\\n\\t\\t\\t\\twidth = dimensions[1]\\n\\t\\t\\t\\tdepth = float64(.75)\\n\\t\\t\\t}\\n\\t\\tdefault:\\n\\t\\t\\t{\\n\\t\\t\\t\\theight = dimensions[0]\\n\\t\\t\\t\\twidth = dimensions[1]\\n\\t\\t\\t\\tdepth = dimensions[2]\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\toffsets := [4]float64{0, 0, 0, 0}\\n\\t\\toffsetsValue, offsetsIsPresent := characteristicMap[\\\"offsets\\\"]\\n\\t\\tif offsetsIsPresent {\\n\\t\\t\\tswitch offsets_args := offsetsValue.(type) {\\n\\t\\t\\tcase []float64:\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tswitch len(offsets_args) {\\n\\t\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\toffsets[0] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[1] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[2] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[3] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\toffsets[0] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[1] = offsets_args[1]\\n\\t\\t\\t\\t\\t\\t\\toffsets[2] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[3] = offsets_args[1]\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcase 4:\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\toffsets[0] = offsets_args[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[1] = offsets_args[1]\\n\\t\\t\\t\\t\\t\\t\\toffsets[2] = offsets_args[2]\\n\\t\\t\\t\\t\\t\\t\\toffsets[3] = offsets_args[3]\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\toffsets[0] = float64(1)\\n\\t\\t\\t\\t\\t\\t\\toffsets[1] = offsets[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[2] = offsets[0]\\n\\t\\t\\t\\t\\t\\t\\toffsets[3] = offsets[0]\\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} else {\\n\\t\\t\\toffsets[0] = float64(1)\\n\\t\\t\\toffsets[1] = offsets[0]\\n\\t\\t\\toffsets[2] = offsets[0]\\n\\t\\t\\toffsets[3] = offsets[0]\\n\\t\\t}\\n\\n\\t\\tfaceNumber := float64(1)\\n\\t\\tfaceValue, faceIsPresent := characteristicMap[\\\"face\\\"]\\n\\t\\tif faceIsPresent {\\n\\t\\t\\tswitch face_args := faceValue.(type) {\\n\\t\\t\\tcase []float64:\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif len(face_args) > 0 {\\n\\t\\t\\t\\t\\t\\tfaceNumber = face_args[0]\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//offset[0] top\\n\\t\\t//offset[1] right\\n\\t\\t//offset[2] bottom\\n\\t\\t//offset[3] left\\n\\n\\t\\theightPlusOffsets := height + offsets[0] + offsets[2]\\n\\t\\twidthPlusOffsets := width + offsets[1] + offsets[3]\\n\\t\\tface := heightPlusOffsets*widthPlusOffsets - width*height\\n\\n\\t\\tfmt.Printf(\\\"face:%v\\\", face)\\n\\t\\tcir := 2 * depth * (heightPlusOffsets + widthPlusOffsets + height + width)\\n\\t\\tresults[\\\"Area\\\"] = (faceNumber * face) + cir\\n\\t\\treturn results\\n\\t}\\n\\treturn &m\\n}\",\n \"func (k *ConvKernel) Normalize() {\\n\\tdiameter := k.Radius*2 + 1\\n\\tarea := diameter * diameter\\n\\tsum := float32(0)\\n\\tfor i := 0; i < area; i++ {\\n\\t\\tsum += k.Kernel[i]\\n\\t}\\n\\n\\t// only attempt to normalize if the sum is significantly\\n\\t// different from both zero and one.\\n\\tfSum := float64(sum)\\n\\tif (math.Abs(fSum) >= TOLERANCE) && (math.Abs(fSum-1.0) >= TOLERANCE) {\\n\\t\\tfor i := 0; i < area; i++ {\\n\\t\\t\\tk.Kernel[i] /= sum // normalize by dividing each entry\\n\\t\\t}\\n\\t}\\n}\",\n \"func SubNormalise(attr *StatusAttribute, v int64) float64 {\\n\\treturn statusNormalise(attr, v)\\n}\",\n \"func (z *Zone) Normalize() {\\n\\tz.Domain = Normalize(z.Domain)\\n\\tz.InfoURL = NormalizeURL(z.InfoURL)\\n\\tvar tags []string\\n\\ttags = append(tags, z.Tags...)\\n\\tz.Tags = NewSet(tags...).Values()\\n\\tz.NameServers = NormalizeDomains(z.NameServers)\\n\\tz.Wildcards = NormalizeDomains(z.Wildcards)\\n\\tz.subdomains = NormalizeDomains(z.subdomains)\\n\\tz.WhoisServer = Normalize(z.WhoisServer)\\n\\tz.WhoisURL = NormalizeURL(z.WhoisURL)\\n\\tz.normalizePolicies()\\n\\tz.normalizeLanguages()\\n}\",\n \"func (p *PresentationTimeRange) UnmarshalJSON(data []byte) error {\\n\\tvar rawMsg map[string]json.RawMessage\\n\\tif err := json.Unmarshal(data, &rawMsg); err != nil {\\n\\t\\treturn fmt.Errorf(\\\"unmarshalling type %T: %v\\\", p, err)\\n\\t}\\n\\tfor key, val := range rawMsg {\\n\\t\\tvar err error\\n\\t\\tswitch key {\\n\\t\\tcase \\\"endTimestamp\\\":\\n\\t\\t\\terr = unpopulate(val, \\\"EndTimestamp\\\", &p.EndTimestamp)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"forceEndTimestamp\\\":\\n\\t\\t\\terr = unpopulate(val, \\\"ForceEndTimestamp\\\", &p.ForceEndTimestamp)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"liveBackoffDuration\\\":\\n\\t\\t\\terr = unpopulate(val, \\\"LiveBackoffDuration\\\", &p.LiveBackoffDuration)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"presentationWindowDuration\\\":\\n\\t\\t\\terr = unpopulate(val, \\\"PresentationWindowDuration\\\", &p.PresentationWindowDuration)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"startTimestamp\\\":\\n\\t\\t\\terr = unpopulate(val, \\\"StartTimestamp\\\", &p.StartTimestamp)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"timescale\\\":\\n\\t\\t\\terr = unpopulate(val, \\\"Timescale\\\", &p.Timescale)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\t}\\n\\t\\tif err != nil {\\n\\t\\t\\treturn fmt.Errorf(\\\"unmarshalling type %T: %v\\\", p, err)\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (u *Unit) normalize() *Unit {\\n\\tif nu := units[*u]; nu != nil {\\n\\t\\treturn nu\\n\\t}\\n\\treturn u\\n}\",\n \"func (seq Sequence) Truncate(width int, resolution time.Duration, asOf time.Time, until time.Time) (result Sequence) {\\n\\tif len(seq) == 0 {\\n\\t\\treturn nil\\n\\t}\\n\\tresult = seq\\n\\toldUntil := result.Until()\\n\\tasOf = RoundTimeUntilDown(asOf, resolution, oldUntil)\\n\\tuntil = RoundTimeUntilDown(until, resolution, oldUntil)\\n\\n\\tif !until.IsZero() {\\n\\t\\tperiodsToRemove := int(oldUntil.Sub(until) / resolution)\\n\\t\\tif periodsToRemove > 0 {\\n\\t\\t\\tbytesToRemove := periodsToRemove * width\\n\\t\\t\\tif bytesToRemove+Width64bits >= len(seq) {\\n\\t\\t\\t\\treturn nil\\n\\t\\t\\t}\\n\\t\\t\\tresult = result[bytesToRemove:]\\n\\t\\t\\tresult.SetUntil(until)\\n\\t\\t}\\n\\t}\\n\\n\\tif !asOf.IsZero() {\\n\\t\\tmaxPeriods := int(result.Until().Sub(asOf) / resolution)\\n\\t\\tif maxPeriods <= 0 {\\n\\t\\t\\t// Entire sequence falls outside of truncation range\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\tmaxLength := Width64bits + maxPeriods*width\\n\\t\\tif maxLength >= len(result) {\\n\\t\\t\\treturn result\\n\\t\\t}\\n\\t\\treturn result[:maxLength]\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func MapToDimensions(input map[string]string) ([]Dimension, error) {\\n\\tdimensions := make([]Dimension, 0, len(input))\\n\\tfor k, v := range input {\\n\\t\\td, err := NewDimension(k, v)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn []Dimension{}, err\\n\\t\\t}\\n\\t\\tdimensions = append(dimensions, d)\\n\\t}\\n\\n\\treturn dimensions, nil\\n}\",\n \"func (o ElastigroupRevertToSpotPtrOutput) TimeWindows() pulumi.StringArrayOutput {\\n\\treturn o.ApplyT(func(v *ElastigroupRevertToSpot) []string {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.TimeWindows\\n\\t}).(pulumi.StringArrayOutput)\\n}\",\n \"func (m *Monitor) getCommonDimensions(partition *gopsutil.PartitionStat) map[string]string {\\n\\tdims := map[string]string{\\n\\t\\t\\\"mountpoint\\\": strings.Replace(partition.Mountpoint, \\\" \\\", \\\"_\\\", -1),\\n\\t\\t\\\"device\\\": strings.Replace(partition.Device, \\\" \\\", \\\"_\\\", -1),\\n\\t\\t\\\"fs_type\\\": strings.Replace(partition.Fstype, \\\" \\\", \\\"_\\\", -1),\\n\\t}\\n\\tif m.sendModeDimension {\\n\\t\\tvar mode string\\n\\t\\topts := strings.Split(partition.Opts, \\\",\\\")\\n\\t\\tfor _, opt := range opts {\\n\\t\\t\\tif opt == \\\"ro\\\" || opt == \\\"rw\\\" {\\n\\t\\t\\t\\tmode = opt\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif mode == \\\"ro\\\" || mode == \\\"rw\\\" {\\n\\t\\t\\tdims[\\\"mode\\\"] = mode\\n\\t\\t} else {\\n\\t\\t\\tm.logger.Infof(\\\"Failed to parse filesystem 'mode' for device `%s` - mountpoint `%s`\\\", partition.Device, partition.Mountpoint)\\n\\t\\t}\\n\\t}\\n\\t// sanitize hostfs path in mountpoint\\n\\tif m.hostFSPath != \\\"\\\" {\\n\\t\\tdims[\\\"mountpoint\\\"] = strings.Replace(dims[\\\"mountpoint\\\"], m.hostFSPath, \\\"\\\", 1)\\n\\t\\tif dims[\\\"mountpoint\\\"] == \\\"\\\" {\\n\\t\\t\\tdims[\\\"mountpoint\\\"] = \\\"/\\\"\\n\\t\\t}\\n\\t}\\n\\n\\treturn dims\\n}\",\n \"func ctod(cDimensions []types.Dimension) *map[string]string {\\n\\tdimensions := map[string]string{}\\n\\tfor i := range cDimensions {\\n\\t\\tdimensions[snakeCase(*cDimensions[i].Name)] = *cDimensions[i].Value\\n\\t}\\n\\treturn &dimensions\\n}\",\n \"func NormaliseDomain(start, end []byte, reverse bool) ([]byte, []byte) {\\n\\tif reverse {\\n\\t\\tif len(end) == 0 {\\n\\t\\t\\tend = []byte{}\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(start) == 0 {\\n\\t\\t\\tstart = []byte{}\\n\\t\\t}\\n\\t}\\n\\treturn start, end\\n}\",\n \"func adjustQueryTimes(from time.Time, to time.Time, interval Interval) (time.Time, time.Time, error) {\\n\\tfromRounded := roundupTimeForInterval(from, interval)\\n\\ttoRounded := roundupTimeForInterval(to, interval)\\n\\n\\t// Data is available from the OPEN API for 90 days\\n\\tninetyDaysAgo := roundupTimeForInterval(time.Now().Add(-NINETY_DAYS), interval)\\n\\n\\t// Is the 'to' (end) time before data is available? If so, that's an error.\\n\\tif timeBeforeOldestData(toRounded, ninetyDaysAgo) {\\n\\t\\terr := errors.New(\\\"Time range is before available data\\\")\\n\\t\\tlog.DefaultLogger.Info(\\\"adjustQueryTimes\\\", \\\"err\\\", err)\\n\\t\\treturn fromRounded, toRounded, err\\n\\t}\\n\\n\\t// Limit the 'from' (start) time to when the oldest data is available.\\n\\tfromLimited := limitTimeToOldestData(fromRounded, ninetyDaysAgo)\\n\\n\\t// Returned the fixed 'to' and 'from' times.\\n\\treturn fromLimited, toRounded, nil\\n}\",\n \"func Normalize(t Tuplelike) Tuplelike {\\n\\treturn Divide(t, Magnitude(t))\\n}\",\n \"func UniformQuantizedConvolutionDimensionNumbers(value string) UniformQuantizedConvolutionAttr {\\n\\treturn func(m optionalAttr) {\\n\\t\\tm[\\\"dimension_numbers\\\"] = value\\n\\t}\\n}\",\n \"func DeserializeArrayNonEmptyDomainAllDimensions(a *Array, buffer *Buffer, serializationType SerializationType) error {\\n\\n\\tvar cClientSide = C.int32_t(0) // Currently this parameter is unused in libtiledb\\n\\tret := C.tiledb_deserialize_array_non_empty_domain_all_dimensions(a.context.tiledbContext, a.tiledbArray, buffer.tiledbBuffer, C.tiledb_serialization_type_t(serializationType), cClientSide)\\n\\tif ret != C.TILEDB_OK {\\n\\t\\treturn fmt.Errorf(\\\"Error deserializing array nonempty domain: %s\\\", a.context.LastError())\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (d *DimensionProperties) UnmarshalJSON(data []byte) error {\\n\\tvar rawMsg map[string]json.RawMessage\\n\\tif err := json.Unmarshal(data, &rawMsg); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tfor key, val := range rawMsg {\\n\\t\\tvar err error\\n\\t\\tswitch key {\\n\\t\\tcase \\\"category\\\":\\n\\t\\t\\terr = unpopulate(val, &d.Category)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"data\\\":\\n\\t\\t\\terr = unpopulate(val, &d.Data)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\terr = unpopulate(val, &d.Description)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"filterEnabled\\\":\\n\\t\\t\\terr = unpopulate(val, &d.FilterEnabled)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"groupingEnabled\\\":\\n\\t\\t\\terr = unpopulate(val, &d.GroupingEnabled)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"nextLink\\\":\\n\\t\\t\\terr = unpopulate(val, &d.NextLink)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"total\\\":\\n\\t\\t\\terr = unpopulate(val, &d.Total)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"usageEnd\\\":\\n\\t\\t\\terr = unpopulateTimeRFC3339(val, &d.UsageEnd)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\tcase \\\"usageStart\\\":\\n\\t\\t\\terr = unpopulateTimeRFC3339(val, &d.UsageStart)\\n\\t\\t\\tdelete(rawMsg, key)\\n\\t\\t}\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func dealDurationBounds(size abi.PaddedPieceSize) (min abi.ChainEpoch, max abi.ChainEpoch) {\\n\\treturn abi.ChainEpoch(180 * builtin.EpochsInDay), abi.ChainEpoch(540 * builtin.EpochsInDay) // PARAM_FINISH\\n}\",\n \"func getFilteredMetrics(c *CloudWatch) ([]filteredMetric, error) {\\n\\tif c.metricCache != nil && c.metricCache.isValid() {\\n\\t\\treturn c.metricCache.metrics, nil\\n\\t}\\n\\n\\tfMetrics := []filteredMetric{}\\n\\n\\t// check for provided metric filter\\n\\tif c.Metrics != nil {\\n\\t\\tfor _, m := range c.Metrics {\\n\\t\\t\\tmetrics := []types.Metric{}\\n\\t\\t\\tvar accounts []string\\n\\t\\t\\tif !hasWildcard(m.Dimensions) {\\n\\t\\t\\t\\tdimensions := make([]types.Dimension, 0, len(m.Dimensions))\\n\\t\\t\\t\\tfor _, d := range m.Dimensions {\\n\\t\\t\\t\\t\\tdimensions = append(dimensions, types.Dimension{\\n\\t\\t\\t\\t\\t\\tName: aws.String(d.Name),\\n\\t\\t\\t\\t\\t\\tValue: aws.String(d.Value),\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor _, name := range m.MetricNames {\\n\\t\\t\\t\\t\\tfor _, namespace := range c.Namespaces {\\n\\t\\t\\t\\t\\t\\tmetrics = append(metrics, types.Metric{\\n\\t\\t\\t\\t\\t\\t\\tNamespace: aws.String(namespace),\\n\\t\\t\\t\\t\\t\\t\\tMetricName: aws.String(name),\\n\\t\\t\\t\\t\\t\\t\\tDimensions: dimensions,\\n\\t\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tallMetrics, allAccounts := c.fetchNamespaceMetrics()\\n\\n\\t\\t\\t\\tfor _, name := range m.MetricNames {\\n\\t\\t\\t\\t\\tfor i, metric := range allMetrics {\\n\\t\\t\\t\\t\\t\\tif isSelected(name, metric, m.Dimensions) {\\n\\t\\t\\t\\t\\t\\t\\tfor _, namespace := range c.Namespaces {\\n\\t\\t\\t\\t\\t\\t\\t\\tmetrics = append(metrics, types.Metric{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tNamespace: aws.String(namespace),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tMetricName: aws.String(name),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tDimensions: metric.Dimensions,\\n\\t\\t\\t\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tif c.IncludeLinkedAccounts {\\n\\t\\t\\t\\t\\t\\t\\t\\taccounts = append(accounts, allAccounts[i])\\n\\t\\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\\n\\t\\t\\tif m.StatisticExclude == nil {\\n\\t\\t\\t\\tm.StatisticExclude = &c.StatisticExclude\\n\\t\\t\\t}\\n\\t\\t\\tif m.StatisticInclude == nil {\\n\\t\\t\\t\\tm.StatisticInclude = &c.StatisticInclude\\n\\t\\t\\t}\\n\\t\\t\\tstatFilter, err := filter.NewIncludeExcludeFilter(*m.StatisticInclude, *m.StatisticExclude)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tfMetrics = append(fMetrics, filteredMetric{\\n\\t\\t\\t\\tmetrics: metrics,\\n\\t\\t\\t\\tstatFilter: statFilter,\\n\\t\\t\\t\\taccounts: accounts,\\n\\t\\t\\t})\\n\\t\\t}\\n\\t} else {\\n\\t\\tmetrics, accounts := c.fetchNamespaceMetrics()\\n\\t\\tfMetrics = []filteredMetric{\\n\\t\\t\\t{\\n\\t\\t\\t\\tmetrics: metrics,\\n\\t\\t\\t\\tstatFilter: c.statFilter,\\n\\t\\t\\t\\taccounts: accounts,\\n\\t\\t\\t},\\n\\t\\t}\\n\\t}\\n\\tc.metricCache = &metricCache{\\n\\t\\tmetrics: fMetrics,\\n\\t\\tbuilt: time.Now(),\\n\\t\\tttl: time.Duration(c.CacheTTL),\\n\\t}\\n\\treturn fMetrics, nil\\n}\",\n \"func (o AiIndexMetadataConfigOutput) Dimensions() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v AiIndexMetadataConfig) int { return v.Dimensions }).(pulumi.IntOutput)\\n}\",\n \"func (data *Data) AddDimensions(dimensions ...Dimension) {\\n\\tfor _, p := range *data {\\n\\t\\tp.AddDimensions(dimensions...)\\n\\t}\\n}\",\n \"func TestConvertToGraphiteDims(t *testing.T) {\\n\\tconfig := map[string]interface{}{\\n\\t\\t\\\"interval\\\": \\\"10\\\",\\n\\t\\t\\\"timeout\\\": \\\"10\\\",\\n\\t\\t\\\"max_buffer_size\\\": \\\"100\\\",\\n\\t\\t\\\"server\\\": \\\"test_server\\\",\\n\\t\\t\\\"port\\\": 10101,\\n\\t}\\n\\n\\tg := getTestGraphiteHandler(12, 13, 14)\\n\\tg.Configure(config)\\n\\n\\twaitForSplitSecond()\\n\\tnow := time.Now().Unix()\\n\\tm := metric.New(\\\"TestMetric\\\")\\n\\n\\tdims := map[string]string{\\n\\t\\t\\\"container_id\\\": \\\"test-id\\\",\\n\\t\\t\\\"container_name\\\": \\\"test-container\\\",\\n\\t}\\n\\tm.Dimensions = dims\\n\\n\\tdpString := g.convertToGraphite(m)\\n\\n\\tassert.Equal(t, fmt.Sprintf(\\\"TestMetric.container_id.test-id.container_name.test-container 0.000000 %d\\\\n\\\", now), dpString)\\n}\",\n \"func (gd *Definition) Extents() []float64 {\\n\\treturn []float64{gd.Eorig, gd.Norig, gd.Eorig + gd.Cwidth*float64(gd.Ncol), gd.Norig - gd.Cwidth*float64(gd.Nrow)} // Left Up Right Down\\n}\",\n \"func convertMeasurementSlice(data []Measurement) measurements {\\n\\tresult := measurements{}\\n\\n\\tfor _, m := range data {\\n\\t\\tswitch m.(type) {\\n\\t\\tcase Gauge:\\n\\t\\t\\tif result.Gauges == nil {\\n\\t\\t\\t\\tresult.Gauges = make([]Gauge, 0)\\n\\t\\t\\t}\\n\\n\\t\\t\\tresult.Gauges = append(result.Gauges, m.(Gauge))\\n\\n\\t\\tcase Counter:\\n\\t\\t\\tif result.Counters == nil {\\n\\t\\t\\t\\tresult.Counters = make([]Counter, 0)\\n\\t\\t\\t}\\n\\n\\t\\t\\tresult.Counters = append(result.Counters, m.(Counter))\\n\\t\\t}\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func (m *Machine) DimensionsForSwarming() machine.SwarmingDimensions {\\n\\tm.mutex.Lock()\\n\\tdefer m.mutex.Unlock()\\n\\treturn m.dimensions\\n}\",\n \"func (d *Dimension) UnmarshalJSON(body []byte) error {\\n\\tvar m map[string]*json.RawMessage\\n\\terr := json.Unmarshal(body, &m)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tfor k, v := range m {\\n\\t\\tswitch k {\\n\\t\\tcase \\\"properties\\\":\\n\\t\\t\\tif v != nil {\\n\\t\\t\\t\\tvar dimensionProperties DimensionProperties\\n\\t\\t\\t\\terr = json.Unmarshal(*v, &dimensionProperties)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td.DimensionProperties = &dimensionProperties\\n\\t\\t\\t}\\n\\t\\tcase \\\"id\\\":\\n\\t\\t\\tif v != nil {\\n\\t\\t\\t\\tvar ID string\\n\\t\\t\\t\\terr = json.Unmarshal(*v, &ID)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td.ID = &ID\\n\\t\\t\\t}\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tif v != nil {\\n\\t\\t\\t\\tvar name string\\n\\t\\t\\t\\terr = json.Unmarshal(*v, &name)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td.Name = &name\\n\\t\\t\\t}\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tif v != nil {\\n\\t\\t\\t\\tvar typeVar string\\n\\t\\t\\t\\terr = json.Unmarshal(*v, &typeVar)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td.Type = &typeVar\\n\\t\\t\\t}\\n\\t\\tcase \\\"tags\\\":\\n\\t\\t\\tif v != nil {\\n\\t\\t\\t\\tvar tags map[string]*string\\n\\t\\t\\t\\terr = json.Unmarshal(*v, &tags)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td.Tags = tags\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (k *Kernel) Normalized() ConvolutionMatrix {\\n\\tsum := absum(k)\\n\\tw := k.Width\\n\\th := k.Height\\n\\tnk := NewKernel(w, h)\\n\\n\\t// avoid division by 0\\n\\tif sum == 0 {\\n\\t\\tsum = 1\\n\\t}\\n\\n\\tfor i := 0; i < w*h; i++ {\\n\\t\\tnk.Matrix[i] = k.Matrix[i] / sum\\n\\t}\\n\\n\\treturn nk\\n}\",\n \"func (b *BoundingBox) GrowDim(dim int, x float32) {\\n\\tb.Bounds[0][dim] = Min(b.Bounds[0][dim], x)\\n\\tb.Bounds[1][dim] = Max(b.Bounds[1][dim], x)\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5863255","0.5593285","0.5458185","0.4924116","0.48919064","0.48581466","0.48396584","0.478796","0.4781289","0.47482437","0.47061297","0.4702259","0.46973515","0.4674829","0.4665495","0.46614796","0.46198478","0.45599985","0.4545783","0.4512009","0.44849315","0.4388054","0.43343037","0.43311206","0.433083","0.43000114","0.42846724","0.4273572","0.42613766","0.42608553","0.42494568","0.42144358","0.41654003","0.41423163","0.41409984","0.413625","0.41351333","0.41301757","0.4104946","0.4101408","0.4096832","0.40924746","0.40916717","0.40904605","0.40771377","0.40656406","0.40582526","0.40492967","0.40487653","0.4041304","0.40095246","0.39923227","0.3966029","0.39624217","0.3961186","0.39583623","0.39562047","0.39474353","0.39398718","0.39377728","0.39321816","0.3923139","0.3911694","0.39100954","0.38896498","0.388662","0.3883015","0.3869409","0.38635582","0.3863232","0.3861024","0.38562518","0.38486552","0.384647","0.3846273","0.3837091","0.38191134","0.381824","0.38089454","0.37940907","0.37934062","0.37857231","0.37829953","0.37818113","0.37801433","0.37747216","0.37706444","0.37644622","0.37593338","0.37556788","0.37537837","0.37519756","0.37496352","0.3743954","0.37412024","0.37404567","0.3736209","0.37237796","0.37022537","0.36900443"],"string":"[\n \"0.5863255\",\n \"0.5593285\",\n \"0.5458185\",\n \"0.4924116\",\n \"0.48919064\",\n \"0.48581466\",\n \"0.48396584\",\n \"0.478796\",\n \"0.4781289\",\n \"0.47482437\",\n \"0.47061297\",\n \"0.4702259\",\n \"0.46973515\",\n \"0.4674829\",\n \"0.4665495\",\n \"0.46614796\",\n \"0.46198478\",\n \"0.45599985\",\n \"0.4545783\",\n \"0.4512009\",\n \"0.44849315\",\n \"0.4388054\",\n \"0.43343037\",\n \"0.43311206\",\n \"0.433083\",\n \"0.43000114\",\n \"0.42846724\",\n \"0.4273572\",\n \"0.42613766\",\n \"0.42608553\",\n \"0.42494568\",\n \"0.42144358\",\n \"0.41654003\",\n \"0.41423163\",\n \"0.41409984\",\n \"0.413625\",\n \"0.41351333\",\n \"0.41301757\",\n \"0.4104946\",\n \"0.4101408\",\n \"0.4096832\",\n \"0.40924746\",\n \"0.40916717\",\n \"0.40904605\",\n \"0.40771377\",\n \"0.40656406\",\n \"0.40582526\",\n \"0.40492967\",\n \"0.40487653\",\n \"0.4041304\",\n \"0.40095246\",\n \"0.39923227\",\n \"0.3966029\",\n \"0.39624217\",\n \"0.3961186\",\n \"0.39583623\",\n \"0.39562047\",\n \"0.39474353\",\n \"0.39398718\",\n \"0.39377728\",\n \"0.39321816\",\n \"0.3923139\",\n \"0.3911694\",\n \"0.39100954\",\n \"0.38896498\",\n \"0.388662\",\n \"0.3883015\",\n \"0.3869409\",\n \"0.38635582\",\n \"0.3863232\",\n \"0.3861024\",\n \"0.38562518\",\n \"0.38486552\",\n \"0.384647\",\n \"0.3846273\",\n \"0.3837091\",\n \"0.38191134\",\n \"0.381824\",\n \"0.38089454\",\n \"0.37940907\",\n \"0.37934062\",\n \"0.37857231\",\n \"0.37829953\",\n \"0.37818113\",\n \"0.37801433\",\n \"0.37747216\",\n \"0.37706444\",\n \"0.37644622\",\n \"0.37593338\",\n \"0.37556788\",\n \"0.37537837\",\n \"0.37519756\",\n \"0.37496352\",\n \"0.3743954\",\n \"0.37412024\",\n \"0.37404567\",\n \"0.3736209\",\n \"0.37237796\",\n \"0.37022537\",\n \"0.36900443\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7111008"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":2794,"cells":{"query":{"kind":"string","value":"planField returns a processor for field."},"document":{"kind":"string","value":"func (p *Planner) planField(e *Executor, f *Field) (processor, error) {\n\treturn p.planExpr(e, f.Expr)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {\n\t// Ensure there is a single argument.\n\tif len(c.Args) != 1 {\n\t\treturn nil, fmt.Errorf(\"expected one argument for %s()\", c.Name)\n\t}\n\n\t// Ensure the argument is a variable reference.\n\tref, ok := c.Args[0].(*VarRef)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"expected field argument in %s()\", c.Name)\n\t}\n\n\t// Extract the substatement for the call.\n\tsub, err := e.stmt.Substatement(ref)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tname := sub.Source.(*Measurement).Name\n\n\t// Extract tags from conditional.\n\ttags := make(map[string]string)\n\tcondition, err := p.extractTags(name, sub.Condition, tags)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tsub.Condition = condition\n\n\t// Find field.\n\tfname := strings.TrimPrefix(ref.Val, name+\".\")\n\tfieldID, typ := e.db.Field(name, fname)\n\tif fieldID == 0 {\n\t\treturn nil, fmt.Errorf(\"field not found: %s.%s\", name, fname)\n\t}\n\n\t// Generate a reducer for the given function.\n\tr := newReducer(e)\n\tr.stmt = sub\n\n\t// Retrieve a list of series data ids.\n\tseriesIDs := p.DB.MatchSeries(name, tags)\n\n\t// Generate mappers for each id.\n\tr.mappers = make([]*mapper, len(seriesIDs))\n\tfor i, seriesID := range seriesIDs {\n\t\tm := newMapper(e, seriesID, fieldID, typ)\n\t\tm.min, m.max = e.min.UnixNano(), e.max.UnixNano()\n\t\tm.interval = int64(e.interval)\n\t\tm.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)\n\t\tr.mappers[i] = m\n\t}\n\n\t// Set the appropriate reducer function.\n\tswitch strings.ToLower(c.Name) {\n\tcase \"count\":\n\t\tr.fn = reduceSum\n\t\tfor _, m := range r.mappers {\n\t\t\tm.fn = mapCount\n\t\t}\n\tcase \"sum\":\n\t\tr.fn = reduceSum\n\t\tfor _, m := range r.mappers {\n\t\t\tm.fn = mapSum\n\t\t}\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"function not found: %q\", c.Name)\n\t}\n\n\treturn r, nil\n}","func (b *Builder) Field(keypath string) *Builder {\n\tb.p.RegisterTransformation(impl.Field(keypath))\n\treturn b\n}","func (ec *executionContext) _fieldMiddleware(ctx context.Context, obj interface{}, next graphql.Resolver) interface{} {\n\tfc := graphql.GetFieldContext(ctx)\n\tfor _, d := range fc.Field.Directives {\n\t\tswitch d.Name {\n\t\tcase \"restricted\":\n\t\t\trawArgs := d.ArgumentMap(ec.Variables)\n\t\t\targs, err := ec.dir_restricted_args(ctx, rawArgs)\n\t\t\tif err != nil {\n\t\t\t\tec.Error(ctx, err)\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tn := next\n\t\t\tnext = func(ctx context.Context) (interface{}, error) {\n\t\t\t\tif ec.directives.Restricted == nil {\n\t\t\t\t\treturn nil, errors.New(\"directive restricted is not implemented\")\n\t\t\t\t}\n\t\t\t\treturn ec.directives.Restricted(ctx, obj, n, args[\"permission\"].([]string))\n\t\t\t}\n\t\t}\n\t}\n\tres, err := ec.ResolverMiddleware(ctx, next)\n\tif err != nil {\n\t\tec.Error(ctx, err)\n\t\treturn nil\n\t}\n\treturn res\n}","func processField(field string) string {\n\tif isValidOperator(field) {\n\t\treturn field\n\t} else {\n\t\treturn fmt.Sprintf(\"%v.%v\", dataWrapper, field)\n\t}\n}","func (v *ApiVisitor) VisitField(ctx *api.FieldContext) interface{} {\n\tiAnonymousFiled := ctx.AnonymousFiled()\n\tiNormalFieldContext := ctx.NormalField()\n\tif iAnonymousFiled != nil {\n\t\treturn iAnonymousFiled.Accept(v).(*TypeField)\n\t}\n\tif iNormalFieldContext != nil {\n\t\treturn iNormalFieldContext.Accept(v).(*TypeField)\n\t}\n\treturn nil\n}","func (ec *executionContext) _fieldMiddleware(ctx context.Context, obj interface{}, next graphql.Resolver) interface{} {\n\t\trctx := graphql.GetResolverContext(ctx)\n\t\tfor _, d := range rctx.Field.Directives {\n\t\t\tswitch d.Name {\n\t\t\tcase \"include\":\n\t\t\t\t\trawArgs := d.ArgumentMap(ec.Variables)\n\t\t\t\t\targs, err := ec.dir_include_args(ctx,rawArgs)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\tec.Error(ctx, err)\n\t\t\t\t\t\treturn nil\n\t\t\t\t\t}\n\t\t\t\tn := next\n\t\t\t\tnext = func(ctx context.Context) (interface{}, error) {\n\t\t\t\t\treturn ec.directives.Include(ctx, obj, n, args[\"if\"].(bool))\n\t\t\t\t}\n\t\t\tcase \"skip\":\n\t\t\t\t\trawArgs := d.ArgumentMap(ec.Variables)\n\t\t\t\t\targs, err := ec.dir_skip_args(ctx,rawArgs)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\tec.Error(ctx, err)\n\t\t\t\t\t\treturn nil\n\t\t\t\t\t}\n\t\t\t\tn := next\n\t\t\t\tnext = func(ctx context.Context) (interface{}, error) {\n\t\t\t\t\treturn ec.directives.Skip(ctx, obj, n, args[\"if\"].(bool))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tres, err := ec.ResolverMiddleware(ctx, next)\n\t\tif err != nil {\n\t\t\tec.Error(ctx, err)\n\t\t\treturn nil\n\t\t}\n\t\treturn res\n\t}","func NewProcessField(\n\tconf Config, mgr types.Manager, log log.Modular, stats metrics.Type,\n) (Type, error) {\n\tvar children []types.Processor\n\tfor i, pconf := range conf.ProcessField.Processors {\n\t\tprefix := fmt.Sprintf(\"%v\", i)\n\t\tproc, err := New(pconf, mgr, log.NewModule(\".\"+prefix), metrics.Namespaced(stats, prefix))\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tchildren = append(children, proc)\n\t}\n\treturn &ProcessField{\n\t\tparts: conf.ProcessField.Parts,\n\t\tpath: strings.Split(conf.ProcessField.Path, \".\"),\n\t\tchildren: children,\n\n\t\tlog: log,\n\n\t\tmCount: stats.GetCounter(\"count\"),\n\t\tmErr: stats.GetCounter(\"error\"),\n\t\tmErrJSONParse: stats.GetCounter(\"error.json_parse\"),\n\t\tmErrMisaligned: stats.GetCounter(\"error.misaligned\"),\n\t\tmErrMisalignedBatch: stats.GetCounter(\"error.misaligned_messages\"),\n\t\tmSent: stats.GetCounter(\"sent\"),\n\t\tmBatchSent: stats.GetCounter(\"batch.sent\"),\n\t}, nil\n}","func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\n\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\n\n\tout := graphql.NewOrderedMap(len(fields))\n\tinvalid := false\n\tfor i, field := range fields {\n\t\tout.Keys[i] = field.Alias\n\n\t\tswitch field.Name {\n\t\tcase \"__typename\":\n\t\t\tout.Values[i] = graphql.MarshalString(\"__Field\")\n\t\tcase \"name\":\n\t\t\tout.Values[i] = ec.___Field_name(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"description\":\n\t\t\tout.Values[i] = ec.___Field_description(ctx, field, obj)\n\t\tcase \"args\":\n\t\t\tout.Values[i] = ec.___Field_args(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"type\":\n\t\t\tout.Values[i] = ec.___Field_type(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"isDeprecated\":\n\t\t\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"deprecationReason\":\n\t\t\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\n\t\tdefault:\n\t\t\tpanic(\"unknown field \" + strconv.Quote(field.Name))\n\t\t}\n\t}\n\n\tif invalid {\n\t\treturn graphql.Null\n\t}\n\treturn out\n}","func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\n\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\n\n\tout := graphql.NewOrderedMap(len(fields))\n\tinvalid := false\n\tfor i, field := range fields {\n\t\tout.Keys[i] = field.Alias\n\n\t\tswitch field.Name {\n\t\tcase \"__typename\":\n\t\t\tout.Values[i] = graphql.MarshalString(\"__Field\")\n\t\tcase \"name\":\n\t\t\tout.Values[i] = ec.___Field_name(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"description\":\n\t\t\tout.Values[i] = ec.___Field_description(ctx, field, obj)\n\t\tcase \"args\":\n\t\t\tout.Values[i] = ec.___Field_args(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"type\":\n\t\t\tout.Values[i] = ec.___Field_type(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"isDeprecated\":\n\t\t\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"deprecationReason\":\n\t\t\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\n\t\tdefault:\n\t\t\tpanic(\"unknown field \" + strconv.Quote(field.Name))\n\t\t}\n\t}\n\n\tif invalid {\n\t\treturn graphql.Null\n\t}\n\treturn out\n}","func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\n\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\n\n\tout := graphql.NewOrderedMap(len(fields))\n\tinvalid := false\n\tfor i, field := range fields {\n\t\tout.Keys[i] = field.Alias\n\n\t\tswitch field.Name {\n\t\tcase \"__typename\":\n\t\t\tout.Values[i] = graphql.MarshalString(\"__Field\")\n\t\tcase \"name\":\n\t\t\tout.Values[i] = ec.___Field_name(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"description\":\n\t\t\tout.Values[i] = ec.___Field_description(ctx, field, obj)\n\t\tcase \"args\":\n\t\t\tout.Values[i] = ec.___Field_args(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"type\":\n\t\t\tout.Values[i] = ec.___Field_type(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"isDeprecated\":\n\t\t\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\n\t\t\tif out.Values[i] == graphql.Null {\n\t\t\t\tinvalid = true\n\t\t\t}\n\t\tcase \"deprecationReason\":\n\t\t\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\n\t\tdefault:\n\t\t\tpanic(\"unknown field \" + strconv.Quote(field.Name))\n\t\t}\n\t}\n\n\tif invalid {\n\t\treturn graphql.Null\n\t}\n\treturn out\n}","func (fn AdapterFunc) Field(fieldpath []string) (string, bool) {\n\treturn fn(fieldpath)\n}","func VisitField(nodes []Node, field string, callback func(value string, negated bool, annotation Annotation)) {\n\tvisitor := &FieldVisitor{callback: callback, field: field}\n\tvisitor.VisitNodes(visitor, nodes)\n}","func (s *state) evalField(dot reflect.Value, fieldName string, node parse.Node, args []parse.Node, final, receiver reflect.Value) reflect.Value {\n\tif !receiver.IsValid() {\n\t\treturn zero\n\t}\n\ttyp := receiver.Type()\n\treceiver, _ = indirect(receiver)\n\t// Unless it's an interface, need to get to a value of type *T to guarantee\n\t// we see all methods of T and *T.\n\tptr := receiver\n\tif ptr.Kind() != reflect.Interface && ptr.CanAddr() {\n\t\tptr = ptr.Addr()\n\t}\n\tif method := ptr.MethodByName(fieldName); method.IsValid() {\n\t\treturn s.evalCall(dot, method, node, fieldName, args, final)\n\t}\n\thasArgs := len(args) > 1 || final.IsValid()\n\t// It's not a method; must be a field of a struct or an element of a map. The receiver must not be nil.\n\treceiver, isNil := indirect(receiver)\n\tif isNil {\n\t\ts.errorf(\"nil pointer evaluating %s.%s\", typ, fieldName)\n\t}\n\tswitch receiver.Kind() {\n\tcase reflect.Struct:\n\t\ttField, ok := receiver.Type().FieldByName(fieldName)\n\t\tif ok {\n\t\t\tfield := receiver.FieldByIndex(tField.Index)\n\t\t\tif tField.PkgPath != \"\" { // field is unexported\n\t\t\t\ts.errorf(\"%s is an unexported field of struct type %s\", fieldName, typ)\n\t\t\t}\n\t\t\t// If it's a function, we must call it.\n\t\t\tif hasArgs {\n\t\t\t\ts.errorf(\"%s has arguments but cannot be invoked as function\", fieldName)\n\t\t\t}\n\t\t\treturn field\n\t\t}\n\t\ts.errorf(\"%s is not a field of struct type %s\", fieldName, typ)\n\tcase reflect.Map:\n\t\t// If it's a map, attempt to use the field name as a key.\n\t\tnameVal := reflect.ValueOf(fieldName)\n\t\tif nameVal.Type().AssignableTo(receiver.Type().Key()) {\n\t\t\tif hasArgs {\n\t\t\t\ts.errorf(\"%s is not a method but has arguments\", fieldName)\n\t\t\t}\n\t\t\treturn receiver.MapIndex(nameVal)\n\t\t}\n\t}\n\ts.errorf(\"can't evaluate field %s in type %s\", fieldName, typ)\n\tpanic(\"not reached\")\n}","func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\n\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\n\n\tout := graphql.NewOrderedMap(len(fields))\n\tfor i, field := range fields {\n\t\tout.Keys[i] = field.Alias\n\n\t\tswitch field.Name {\n\t\tcase \"__typename\":\n\t\t\tout.Values[i] = graphql.MarshalString(\"__Field\")\n\t\tcase \"name\":\n\t\t\tout.Values[i] = ec.___Field_name(ctx, field, obj)\n\t\tcase \"description\":\n\t\t\tout.Values[i] = ec.___Field_description(ctx, field, obj)\n\t\tcase \"args\":\n\t\t\tout.Values[i] = ec.___Field_args(ctx, field, obj)\n\t\tcase \"type\":\n\t\t\tout.Values[i] = ec.___Field_type(ctx, field, obj)\n\t\tcase \"isDeprecated\":\n\t\t\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\n\t\tcase \"deprecationReason\":\n\t\t\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\n\t\tdefault:\n\t\t\tpanic(\"unknown field \" + strconv.Quote(field.Name))\n\t\t}\n\t}\n\n\treturn out\n}","func (o JobLoadTimePartitioningOutput) Field() pulumi.StringPtrOutput {\n\treturn o.ApplyT(func(v JobLoadTimePartitioning) *string { return v.Field }).(pulumi.StringPtrOutput)\n}","func (e ShippingMethodValidationError) Field() string { return e.field }","func (op *metadataLookup) field(parentFunc *stmt.CallExpr, expr stmt.Expr) {\n\tif op.err != nil {\n\t\treturn\n\t}\n\tswitch e := expr.(type) {\n\tcase *stmt.SelectItem:\n\t\top.field(nil, e.Expr)\n\tcase *stmt.CallExpr:\n\t\tif e.FuncType == function.Quantile {\n\t\t\top.planHistogramFields(e)\n\t\t\treturn\n\t\t}\n\t\tfor _, param := range e.Params {\n\t\t\top.field(e, param)\n\t\t}\n\tcase *stmt.ParenExpr:\n\t\top.field(nil, e.Expr)\n\tcase *stmt.BinaryExpr:\n\t\top.field(nil, e.Left)\n\t\top.field(nil, e.Right)\n\tcase *stmt.FieldExpr:\n\t\tqueryStmt := op.executeCtx.Query\n\t\tfieldMeta, err := op.metadata.GetField(queryStmt.Namespace, queryStmt.MetricName, field.Name(e.Name))\n\t\tif err != nil {\n\t\t\top.err = err\n\t\t\treturn\n\t\t}\n\n\t\top.planField(parentFunc, fieldMeta)\n\t}\n}","func (b *PlanBuilder) buildProjectionField(ctx context.Context, p LogicalPlan, field *ast.SelectField, expr expression.Expression) (*expression.Column, *types.FieldName, error) {\n\tvar origTblName, tblName, colName, dbName parser_model.CIStr\n\tinnerNode := getInnerFromParenthesesAndUnaryPlus(field.Expr)\n\tcol, isCol := expr.(*expression.Column)\n\t// Correlated column won't affect the final output names. So we can put it in any of the three logic block.\n\t// Don't put it into the first block just for simplifying the codes.\n\tif colNameField, ok := innerNode.(*ast.ColumnNameExpr); ok && isCol {\n\t\t// Field is a column reference.\n\t\tidx := p.Schema().ColumnIndex(col)\n\t\tvar name *types.FieldName\n\t\t// The column maybe the one from join's redundant part.\n\t\t// TODO: Fully support USING/NATURAL JOIN, refactor here.\n\t\tif idx != -1 {\n\t\t\tname = p.OutputNames()[idx]\n\t\t}\n\t\tcolName, _, tblName, origTblName, dbName = b.buildProjectionFieldNameFromColumns(field, colNameField, name)\n\t} else if field.AsName.L != \"\" {\n\t\t// Field has alias.\n\t\tcolName = field.AsName\n\t} else {\n\t\t// Other: field is an expression.\n\t\tvar err error\n\t\tif colName, err = b.buildProjectionFieldNameFromExpressions(ctx, field); err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\t}\n\tname := &types.FieldName{\n\t\tTblName: tblName,\n\t\tOrigTblName: origTblName,\n\t\tColName: colName,\n\t\tOrigColName: colName,\n\t\tDBName: dbName,\n\t}\n\tif isCol {\n\t\treturn col, name, nil\n\t}\n\tnewCol := &expression.Column{\n\t\tUniqueID: b.ctx.GetSessionVars().AllocPlanColumnID(),\n\t\tRetType: expr.GetType(),\n\t\tOrigName: colName.L,\n\t}\n\treturn newCol, name, nil\n}","func (ec *executionContext) ___Field(ctx context.Context, sel []query.Selection, obj *introspection.Field) graphql.Marshaler {\n\tfields := graphql.CollectFields(ec.Doc, sel, __FieldImplementors, ec.Variables)\n\n\tout := graphql.NewOrderedMap(len(fields))\n\tfor i, field := range fields {\n\t\tout.Keys[i] = field.Alias\n\n\t\tswitch field.Name {\n\t\tcase \"__typename\":\n\t\t\tout.Values[i] = graphql.MarshalString(\"__Field\")\n\t\tcase \"name\":\n\t\t\tout.Values[i] = ec.___Field_name(ctx, field, obj)\n\t\tcase \"description\":\n\t\t\tout.Values[i] = ec.___Field_description(ctx, field, obj)\n\t\tcase \"args\":\n\t\t\tout.Values[i] = ec.___Field_args(ctx, field, obj)\n\t\tcase \"type\":\n\t\t\tout.Values[i] = ec.___Field_type(ctx, field, obj)\n\t\tcase \"isDeprecated\":\n\t\t\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\n\t\tcase \"deprecationReason\":\n\t\t\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\n\t\tdefault:\n\t\t\tpanic(\"unknown field \" + strconv.Quote(field.Name))\n\t\t}\n\t}\n\n\treturn out\n}","func (e MoveObjectNextRequestValidationError) Field() string { return e.field }","func (w *State) GenerateFlowField(destination DestinationID) error {\n\tlog.Println(\"find shorted path\")\n\tFindShortestPath(w, destination)\n\tlog.Println(\"compute directions\")\n\tw.computeDirections(destination)\n\n\treturn nil\n\n}","func (_DelegateProfile *DelegateProfileTransactor) NewField(opts *bind.TransactOpts, _name string, _verifierAddr common.Address) (*types.Transaction, error) {\n\treturn _DelegateProfile.contract.Transact(opts, \"newField\", _name, _verifierAddr)\n}","func (o TableTimePartitioningOutput) Field() pulumi.StringPtrOutput {\n\treturn o.ApplyT(func(v TableTimePartitioning) *string { return v.Field }).(pulumi.StringPtrOutput)\n}","func (e ProcessingRequestValidationError) Field() string { return e.field }","func (m *SnapshotPrepare) Field(fieldpath []string) (string, bool) {\n\tif len(fieldpath) == 0 {\n\t\treturn \"\", false\n\t}\n\tswitch fieldpath[0] {\n\tcase \"key\":\n\t\treturn string(m.Key), len(m.Key) > 0\n\tcase \"parent\":\n\t\treturn string(m.Parent), len(m.Parent) > 0\n\tcase \"snapshotter\":\n\t\treturn string(m.Snapshotter), len(m.Snapshotter) > 0\n\t}\n\treturn \"\", false\n}","func (ec *executionContext) ___Field(sel []query.Selection, obj *introspection.Field) graphql.Marshaler {\n\tfields := graphql.CollectFields(ec.doc, sel, __FieldImplementors, ec.variables)\n\tout := graphql.NewOrderedMap(len(fields))\n\tfor i, field := range fields {\n\t\tout.Keys[i] = field.Alias\n\n\t\tswitch field.Name {\n\t\tcase \"__typename\":\n\t\t\tout.Values[i] = graphql.MarshalString(\"__Field\")\n\t\tcase \"name\":\n\t\t\tout.Values[i] = ec.___Field_name(field, obj)\n\t\tcase \"description\":\n\t\t\tout.Values[i] = ec.___Field_description(field, obj)\n\t\tcase \"args\":\n\t\t\tout.Values[i] = ec.___Field_args(field, obj)\n\t\tcase \"type\":\n\t\t\tout.Values[i] = ec.___Field_type(field, obj)\n\t\tcase \"isDeprecated\":\n\t\t\tout.Values[i] = ec.___Field_isDeprecated(field, obj)\n\t\tcase \"deprecationReason\":\n\t\t\tout.Values[i] = ec.___Field_deprecationReason(field, obj)\n\t\tdefault:\n\t\t\tpanic(\"unknown field \" + strconv.Quote(field.Name))\n\t\t}\n\t}\n\n\treturn out\n}","func (q *DistanceFeatureQuery) Field(name string) *DistanceFeatureQuery {\n\tq.field = name\n\treturn q\n}","func (sb *schemaBuilder) buildField(field reflect.StructField) (*graphql.Field, error) {\n\tretType, err := sb.getType(field.Type)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn &graphql.Field{\n\t\tResolve: func(ctx context.Context, source, args interface{}, selectionSet *graphql.SelectionSet) (interface{}, error) {\n\t\t\tvalue := reflect.ValueOf(source)\n\t\t\tif value.Kind() == reflect.Ptr {\n\t\t\t\tvalue = value.Elem()\n\t\t\t}\n\t\t\treturn value.FieldByIndex(field.Index).Interface(), nil\n\t\t},\n\t\tType: retType,\n\t\tParseArguments: nilParseArguments,\n\t}, nil\n}","func (e CreatePaymentRequestValidationError) Field() string { return e.field }","func NewFieldStep(f *reflect.StructField) *FieldStep {\n\treturn &FieldStep{\n\t\tf,\n\t}\n}","func execNewField(_ int, p *gop.Context) {\n\targs := p.GetArgs(5)\n\tret := types.NewField(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(types.Type), args[4].(bool))\n\tp.Ret(5, ret)\n}","func (m *ContainerCreate_Runtime) Field(fieldpath []string) (string, bool) {\n\tif len(fieldpath) == 0 {\n\t\treturn \"\", false\n\t}\n\n\tswitch fieldpath[0] {\n\tcase \"name\":\n\t\treturn string(m.Name), len(m.Name) > 0\n\tcase \"options\":\n\t\tdecoded, err := github_com_containerd_typeurl.UnmarshalAny(m.Options)\n\t\tif err != nil {\n\t\t\treturn \"\", false\n\t\t}\n\n\t\tadaptor, ok := decoded.(interface{ Field([]string) (string, bool) })\n\t\tif !ok {\n\t\t\treturn \"\", false\n\t\t}\n\t\treturn adaptor.Field(fieldpath[1:])\n\t}\n\treturn \"\", false\n}","func (m *PetruleMutation) Field(name string) (ent.Value, bool) {\n\tswitch name {\n\tcase petrule.FieldPetrule:\n\t\treturn m.Petrule()\n\t}\n\treturn nil, false\n}","func (e CreateMovableObjectRequestValidationError) Field() string { return e.field }","func (t tracer) StartFieldExecution(ctx context.Context, field graphql.CollectedField) context.Context {\n\tif strings.HasPrefix(field.Name, \"__\") {\n\t\tctx, _ = trace.StartSpan(ctx,\n\t\t\tfield.ObjectDefinition.Name+\"/\"+field.Name,\n\t\t\ttrace.WithSampler(trace.NeverSample()),\n\t\t)\n\t\treturn ctx\n\t}\n\treturn t.Tracer.StartFieldExecution(ctx, field)\n}","func (e AgreeShippingDispatchRequestValidationError) Field() string { return e.field }","func (m *ZoneproductMutation) Field(name string) (ent.Value, bool) {\n\tswitch name {\n\tcase zoneproduct.FieldZone:\n\t\treturn m.Zone()\n\t}\n\treturn nil, false\n}","func (dr *defaultRender) OnParseField(out *jen.File, methodDefinition *jen.Group, field *atool.Arg, file *atool.File) {\n}","func (t *Type) Field(i int) *Field","func (e SavePortRequestValidationError) Field() string { return e.field }","func genField(field *ast.FieldDefinition) *jen.Statement {\n\t//\n\t// Generate config for field\n\t//\n\t// == Example input SDL\n\t//\n\t// interface Pet {\n\t// \"name of the pet\"\n\t// name(style: NameComponentsStyle = SHORT): String!\n\t// \"\"\"\n\t// givenName of the pet ★\n\t// \"\"\"\n\t// givenName: String @deprecated(reason: \"No longer supported; please use name field.\")\n\t// }\n\t//\n\t// == Example output\n\t//\n\t// &graphql.Field{\n\t// Name: \"name\",\n\t// Type: graphql.NonNull(graphql.String),\n\t// Description: \"name of the pet\",\n\t// DeprecationReason: \"\",\n\t// Args: FieldConfigArgument{ ... },\n\t// }\n\t//\n\t// &graphql.Field{\n\t// Name: \"givenName\",\n\t// Type: graphql.String,\n\t// Description: \"givenName of the pet\",\n\t// DeprecationReason: \"No longer supported; please use name field.\",\n\t// Args: FieldConfigArgument{ ... },\n\t// }\n\t//\n\treturn jen.Op(\"&\").Qual(defsPkg, \"Field\").Values(jen.Dict{\n\t\tjen.Id(\"Args\"): genArguments(field.Arguments),\n\t\tjen.Id(\"DeprecationReason\"): genDeprecationReason(field.Directives),\n\t\tjen.Id(\"Description\"): genDescription(field),\n\t\tjen.Id(\"Name\"): jen.Lit(field.Name.Value),\n\t\tjen.Id(\"Type\"): genOutputTypeReference(field.Type),\n\t})\n}","func (e MaxPciValidationError) Field() string { return e.field }","func (m *ServicePlanInfo) GetFieldDeserializers()(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error)) {\n res := make(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error))\n res[\"appliesTo\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetAppliesTo)\n res[\"@odata.type\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetOdataType)\n res[\"provisioningStatus\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetProvisioningStatus)\n res[\"servicePlanId\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetServicePlanId)\n res[\"servicePlanName\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetServicePlanName)\n return res\n}","func (e RanfunctionNameValidationError) Field() string { return e.field }","func (*Base) ObjectField(p ASTPass, field *ast.ObjectField, ctx Context) {\n\tswitch field.Kind {\n\tcase ast.ObjectLocal:\n\t\tp.Fodder(p, &field.Fodder1, ctx)\n\t\tp.Fodder(p, &field.Fodder2, ctx)\n\t\tp.FieldParams(p, field, ctx)\n\t\tp.Fodder(p, &field.OpFodder, ctx)\n\t\tp.Visit(p, &field.Expr2, ctx)\n\n\tcase ast.ObjectFieldID:\n\t\tp.Fodder(p, &field.Fodder1, ctx)\n\t\tp.FieldParams(p, field, ctx)\n\t\tp.Fodder(p, &field.OpFodder, ctx)\n\t\tp.Visit(p, &field.Expr2, ctx)\n\n\tcase ast.ObjectFieldStr:\n\t\tp.Visit(p, &field.Expr1, ctx)\n\t\tp.FieldParams(p, field, ctx)\n\t\tp.Fodder(p, &field.OpFodder, ctx)\n\t\tp.Visit(p, &field.Expr2, ctx)\n\n\tcase ast.ObjectFieldExpr:\n\t\tp.Fodder(p, &field.Fodder1, ctx)\n\t\tp.Visit(p, &field.Expr1, ctx)\n\t\tp.Fodder(p, &field.Fodder2, ctx)\n\t\tp.FieldParams(p, field, ctx)\n\t\tp.Fodder(p, &field.OpFodder, ctx)\n\t\tp.Visit(p, &field.Expr2, ctx)\n\n\tcase ast.ObjectAssert:\n\t\tp.Fodder(p, &field.Fodder1, ctx)\n\t\tp.Visit(p, &field.Expr2, ctx)\n\t\tif field.Expr3 != nil {\n\t\t\tp.Fodder(p, &field.OpFodder, ctx)\n\t\t\tp.Visit(p, &field.Expr3, ctx)\n\t\t}\n\t}\n\n\tp.Fodder(p, &field.CommaFodder, ctx)\n}","func (e RanparameterValueValidationError) Field() string { return e.field }","func (m *PledgeMutation) Field(name string) (ent.Value, bool) {\n\tswitch name {\n\tcase pledge.FieldProvision:\n\t\treturn m.Provision()\n\t}\n\treturn nil, false\n}","func (o JobLoadTimePartitioningPtrOutput) Field() pulumi.StringPtrOutput {\n\treturn o.ApplyT(func(v *JobLoadTimePartitioning) *string {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Field\n\t}).(pulumi.StringPtrOutput)\n}","func (x *fastReflection_SendEnabled) NewField(fd protoreflect.FieldDescriptor) protoreflect.Value {\n\tswitch fd.FullName() {\n\tcase \"cosmos.bank.v1beta1.SendEnabled.denom\":\n\t\treturn protoreflect.ValueOfString(\"\")\n\tcase \"cosmos.bank.v1beta1.SendEnabled.enabled\":\n\t\treturn protoreflect.ValueOfBool(false)\n\tdefault:\n\t\tif fd.IsExtension() {\n\t\t\tpanic(fmt.Errorf(\"proto3 declared messages do not support extensions: cosmos.bank.v1beta1.SendEnabled\"))\n\t\t}\n\t\tpanic(fmt.Errorf(\"message cosmos.bank.v1beta1.SendEnabled does not contain field %s\", fd.FullName()))\n\t}\n}","func (e PaymentValidationError) Field() string { return e.field }","func (e GetMovableObjectRequestValidationError) Field() string { return e.field }","func (e PaymentInputValidationError) Field() string { return e.field }","func (e RetrievePaymentRequestValidationError) Field() string { return e.field }","func (ds *DynamicStruct) Field(i int) reflect.StructField {\n\treturn ds.rt.Field(i)\n}","func (e RanparameterNameValidationError) Field() string { return e.field }","func (tracer) StartFieldExecution(ctx context.Context, _ graphql.CollectedField) context.Context {\n\treturn ctx\n}","func (e RetrieveShippingMethodsRequestValidationError) Field() string { return e.field }","func (e SavePortsRequestValidationError) Field() string { return e.field }","func (e PciValidationError) Field() string { return e.field }","func (e PortNetworkPolicyRuleValidationError) Field() string { return e.field }","func (e CreateShippingRequestValidationError) Field() string { return e.field }","func (msg *Message) Field(fieldName string) *Field {\n\treturn msg.fieldByName[fieldName]\n}","func (p *Planner) addField(ref int) {\n\tfieldName := p.visitor.Operation.FieldNameString(ref)\n\n\talias := ast.Alias{\n\t\tIsDefined: p.visitor.Operation.FieldAliasIsDefined(ref),\n\t}\n\n\tif alias.IsDefined {\n\t\taliasBytes := p.visitor.Operation.FieldAliasBytes(ref)\n\t\talias.Name = p.upstreamOperation.Input.AppendInputBytes(aliasBytes)\n\t}\n\n\ttypeName := p.visitor.Walker.EnclosingTypeDefinition.NameString(p.visitor.Definition)\n\tfor i := range p.visitor.Config.Fields {\n\t\tisDesiredField := p.visitor.Config.Fields[i].TypeName == typeName &&\n\t\t\tp.visitor.Config.Fields[i].FieldName == fieldName\n\n\t\t// chech that we are on a desired field and field path contains a single element - mapping is plain\n\t\tif isDesiredField && len(p.visitor.Config.Fields[i].Path) == 1 {\n\t\t\t// define alias when mapping path differs from fieldName and no alias has been defined\n\t\t\tif p.visitor.Config.Fields[i].Path[0] != fieldName && !alias.IsDefined {\n\t\t\t\talias.IsDefined = true\n\t\t\t\taliasBytes := p.visitor.Operation.FieldNameBytes(ref)\n\t\t\t\talias.Name = p.upstreamOperation.Input.AppendInputBytes(aliasBytes)\n\t\t\t}\n\n\t\t\t// override fieldName with mapping path value\n\t\t\tfieldName = p.visitor.Config.Fields[i].Path[0]\n\n\t\t\t// when provided field is a root type field save new field name\n\t\t\tif ref == p.rootFieldRef {\n\t\t\t\tp.rootFieldName = fieldName\n\t\t\t}\n\n\t\t\tbreak\n\t\t}\n\t}\n\n\tfield := p.upstreamOperation.AddField(ast.Field{\n\t\tName: p.upstreamOperation.Input.AppendInputString(fieldName),\n\t\tAlias: alias,\n\t})\n\n\tselection := ast.Selection{\n\t\tKind: ast.SelectionKindField,\n\t\tRef: field.Ref,\n\t}\n\n\tp.upstreamOperation.AddSelection(p.nodes[len(p.nodes)-1].Ref, selection)\n\tp.nodes = append(p.nodes, field)\n}","func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\n\tswitch expr := expr.(type) {\n\tcase *VarRef:\n\t\tpanic(\"TODO\")\n\tcase *Call:\n\t\treturn p.planCall(e, expr)\n\tcase *BinaryExpr:\n\t\treturn p.planBinaryExpr(e, expr)\n\tcase *ParenExpr:\n\t\treturn p.planExpr(e, expr.Expr)\n\tcase *NumberLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *StringLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *BooleanLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *TimeLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *DurationLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\t}\n\tpanic(\"unreachable\")\n}","func (e RanparameterItemValidationError) Field() string { return e.field }","func (e PortNetworkPolicyValidationError) Field() string { return e.field }","func fieldsImpl(path reflectutil.Path, msg protoreflect.Message, processors []*procBundle) Results {\n\tret := make(Results, len(processors))\n\tplan := makePlan(msg.Descriptor(), processors)\n\n\ttype accumulation struct {\n\t\trecurseAttr\n\t\tprocs []*procBundle\n\t\tprocIdxs []int\n\t}\n\n\tplan.each(func(field protoreflect.FieldDescriptor, items []planItem) {\n\t\tacc := accumulation{\n\t\t\tprocs: make([]*procBundle, 0, len(processors)),\n\t\t\tprocIdxs: make([]int, 0, len(processors)),\n\t\t}\n\n\t\tvar copiedFieldPath reflectutil.Path\n\n\t\tfor _, item := range items {\n\t\t\tproc := processors[item.processorIdx]\n\n\t\t\tif acc.recurseAttr.set(item.recurseAttr) {\n\t\t\t\tacc.procs = append(acc.procs, processors[item.processorIdx])\n\t\t\t\tacc.procIdxs = append(acc.procIdxs, item.processorIdx)\n\t\t\t}\n\n\t\t\tif item.applies(msg.Has(field)) {\n\t\t\t\tif data, applied := proc.fp.Process(field, msg); applied {\n\t\t\t\t\tif copiedFieldPath == nil {\n\t\t\t\t\t\tcopiedFieldPath = make(reflectutil.Path, len(path)+1)\n\t\t\t\t\t\tcopy(copiedFieldPath, path)\n\t\t\t\t\t\tcopiedFieldPath[len(path)] = reflectutil.MustMakePathItem(field)\n\t\t\t\t\t}\n\t\t\t\t\tret[item.processorIdx] = append(ret[item.processorIdx], Result{copiedFieldPath, data})\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif acc.recurseAttr != recurseNone {\n\t\t\trecursePath := append(path, reflectutil.MustMakePathItem(field))\n\n\t\t\tswitch acc.recurseAttr {\n\t\t\tcase recurseRepeated:\n\t\t\t\tlst := msg.Get(field).List()\n\t\t\t\tfor i := 0; i < lst.Len(); i++ {\n\t\t\t\t\tfor procInnerIdx, rslts := range fieldsImpl(append(recursePath, reflectutil.MustMakePathItem(i)), lst.Get(i).Message(), acc.procs) {\n\t\t\t\t\t\tprocIdx := acc.procIdxs[procInnerIdx]\n\t\t\t\t\t\tret[procIdx] = append(ret[procIdx], rslts...)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase recurseOne:\n\t\t\t\tif msg.Has(field) {\n\t\t\t\t\tfor procInnerIdx, rslts := range fieldsImpl(recursePath, msg.Get(field).Message(), acc.procs) {\n\t\t\t\t\t\tprocIdx := acc.procIdxs[procInnerIdx]\n\t\t\t\t\t\tret[procIdx] = append(ret[procIdx], rslts...)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tdefault:\n\t\t\t\tif !acc.recurseAttr.isMap() {\n\t\t\t\t\tpanic(\"impossible\")\n\t\t\t\t}\n\n\t\t\t\treflectutil.MapRangeSorted(msg.Get(field).Map(), acc.recurseAttr.mapKeyKind(), func(mk protoreflect.MapKey, v protoreflect.Value) bool {\n\t\t\t\t\tfor procInnerIdx, rslts := range fieldsImpl(append(recursePath, reflectutil.MustMakePathItem(mk)), v.Message(), acc.procs) {\n\t\t\t\t\t\tprocIdx := acc.procIdxs[procInnerIdx]\n\t\t\t\t\t\tret[procIdx] = append(ret[procIdx], rslts...)\n\t\t\t\t\t}\n\t\t\t\t\treturn true\n\t\t\t\t})\n\t\t\t}\n\t\t}\n\t})\n\n\treturn ret\n}","func (e GetAllPortsRequestValidationError) Field() string { return e.field }","func (e MoveObjectNextResponseValidationError) Field() string { return e.field }","func (e RanparameterIdValidationError) Field() string { return e.field }","func ProcessFunc(p Processor) {\n\tprocessor = p\n}","func ProcessFunc(p Processor) {\n\tprocessor = p\n}","func ToField(gatewayID, nodeID, sourceID, fieldID, payload string) error {\n\tif payload == model.ActionToggle {\n\t\t// get field current data\n\t\tfield, err := fieldAPI.GetByIDs(gatewayID, nodeID, sourceID, fieldID)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tif converterUtils.ToBool(field.Current.Value) {\n\t\t\tpayload = \"false\"\n\t\t} else {\n\t\t\tpayload = \"true\"\n\t\t}\n\t}\n\n\tmsg := msgML.NewMessage(false)\n\tmsg.GatewayID = gatewayID\n\tmsg.NodeID = nodeID\n\tmsg.SourceID = sourceID\n\tpl := msgML.NewPayload()\n\tpl.Key = fieldID\n\tpl.Value = payload\n\tmsg.Payloads = append(msg.Payloads, pl)\n\tmsg.Type = msgML.TypeSet\n\treturn Post(&msg)\n}","func (x *fastReflection_EventRetire) NewField(fd protoreflect.FieldDescriptor) protoreflect.Value {\n\tswitch fd.FullName() {\n\tcase \"regen.ecocredit.v1alpha1.EventRetire.retirer\":\n\t\treturn protoreflect.ValueOfString(\"\")\n\tcase \"regen.ecocredit.v1alpha1.EventRetire.batch_denom\":\n\t\treturn protoreflect.ValueOfString(\"\")\n\tcase \"regen.ecocredit.v1alpha1.EventRetire.amount\":\n\t\treturn protoreflect.ValueOfString(\"\")\n\tcase \"regen.ecocredit.v1alpha1.EventRetire.location\":\n\t\treturn protoreflect.ValueOfString(\"\")\n\tdefault:\n\t\tif fd.IsExtension() {\n\t\t\tpanic(fmt.Errorf(\"proto3 declared messages do not support extensions: regen.ecocredit.v1alpha1.EventRetire\"))\n\t\t}\n\t\tpanic(fmt.Errorf(\"message regen.ecocredit.v1alpha1.EventRetire does not contain field %s\", fd.FullName()))\n\t}\n}","func (e ResolveRequestValidationError) Field() string { return e.field }","func (e ChargeCreditsRequestValidationError) Field() string { return e.field }","func (e ProcessingResponseValidationError) Field() string { return e.field }","func (db *Ffdb) QueryField(fieldname string, f FieldQueryFunc, d Direction) i.Forward {\n\tfieldname = strings.ToUpper(fieldname)\n\tif _, ok := db.fieldnames[fieldname]; !ok {\n\t\tpanic(fmt.Errorf(\"Unknown field: %q\\n\", fieldname))\n\t}\n\treturn db.Query(func(itr i.Iterator) bool {\n\t\tr, _ := itr.Value().(*Record)\n\t\treturn f(r.Value(fieldname))\n\t}, d)\n}","func execmStructField(_ int, p *gop.Context) {\n\targs := p.GetArgs(2)\n\tret := args[0].(*types.Struct).Field(args[1].(int))\n\tp.Ret(2, ret)\n}","func (o TableTimePartitioningPtrOutput) Field() pulumi.StringPtrOutput {\n\treturn o.ApplyT(func(v *TableTimePartitioning) *string {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Field\n\t}).(pulumi.StringPtrOutput)\n}","func (m *BusinessScenarioPlanner) GetFieldDeserializers()(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error)) {\n res := m.Entity.GetFieldDeserializers()\n res[\"planConfiguration\"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {\n val, err := n.GetObjectValue(CreatePlannerPlanConfigurationFromDiscriminatorValue)\n if err != nil {\n return err\n }\n if val != nil {\n m.SetPlanConfiguration(val.(PlannerPlanConfigurationable))\n }\n return nil\n }\n res[\"taskConfiguration\"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {\n val, err := n.GetObjectValue(CreatePlannerTaskConfigurationFromDiscriminatorValue)\n if err != nil {\n return err\n }\n if val != nil {\n m.SetTaskConfiguration(val.(PlannerTaskConfigurationable))\n }\n return nil\n }\n res[\"tasks\"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {\n val, err := n.GetCollectionOfObjectValues(CreateBusinessScenarioTaskFromDiscriminatorValue)\n if err != nil {\n return err\n }\n if val != nil {\n res := make([]BusinessScenarioTaskable, len(val))\n for i, v := range val {\n if v != nil {\n res[i] = v.(BusinessScenarioTaskable)\n }\n }\n m.SetTasks(res)\n }\n return nil\n }\n return res\n}","func (k Querier) Plan(c context.Context, req *types.QueryPlanRequest) (*types.QueryPlanResponse, error) {\n\tif req == nil {\n\t\treturn nil, status.Error(codes.InvalidArgument, \"invalid request\")\n\t}\n\n\tctx := sdk.UnwrapSDKContext(c)\n\tplan, found := k.GetPlan(ctx, req.PlanId)\n\tif !found {\n\t\treturn nil, status.Errorf(codes.NotFound, \"plan %d not found\", req.PlanId)\n\t}\n\n\tany, err := codectypes.NewAnyWithValue(plan)\n\tif err != nil {\n\t\treturn nil, status.Error(codes.Internal, err.Error())\n\t}\n\n\treturn &types.QueryPlanResponse{Plan: any}, nil\n}","func (e CreatePurchaseRequestValidationError) Field() string { return e.field }","func (f Unstructured) Field(field string) Fragment {\n\tif f.fields != nil {\n\t\treturn f.fields[field]\n\t}\n\treturn nil\n}","func NewProcessor(provider metrics.Provider, lister ContainerAccessor, adapter MetricsAdapter, filter ContainerFilter) Processor {\n\treturn Processor{\n\t\tmetricsProvider: provider,\n\t\tctrLister: lister,\n\t\tmetricsAdapter: adapter,\n\t\tctrFilter: filter,\n\t\textensions: map[string]ProcessorExtension{\n\t\t\tNetworkExtensionID: NewProcessorNetwork(),\n\t\t},\n\t}\n}","func (e ShippingValidationError) Field() string { return e.field }","func (e ChannelPayRequestValidationError) Field() string { return e.field }","func (e MoveObjectRequestValidationError) Field() string { return e.field }","func (e RanparameterDefItemValidationError) Field() string { return e.field }","func (pr *prepareResult) parameterField(idx int) *p.ParameterField {\n\treturn pr.parameterFields[idx]\n}","func (e ProviderInfoValidationError) Field() string { return e.field }","func (m *EventRSVPMutation) Field(name string) (ent.Value, bool) {\n\treturn nil, false\n}","func Field(v interface{}, name string) (*Fieldx, bool) {\n\treturn New(v).Field(name)\n}","func (m *PromotionMutation) Field(name string) (ent.Value, bool) {\n\tswitch name {\n\tcase promotion.FieldPromotionName:\n\t\treturn m.PromotionName()\n\tcase promotion.FieldStartPromotion:\n\t\treturn m.StartPromotion()\n\tcase promotion.FieldEndPromotion:\n\t\treturn m.EndPromotion()\n\tcase promotion.FieldPrice:\n\t\treturn m.Price()\n\t}\n\treturn nil, false\n}","func (m *DevelopperMutation) Field(name string) (ent.Value, bool) {\n\tswitch name {\n\tcase developper.FieldName:\n\t\treturn m.Name()\n\tcase developper.FieldAge:\n\t\treturn m.Age()\n\tcase developper.FieldSchool:\n\t\treturn m.School()\n\tcase developper.FieldExperience:\n\t\treturn m.Experience()\n\t}\n\treturn nil, false\n}","func (e CreateCardRequestValidationError) Field() string { return e.field }","func (e E2SmRcPreRanfunctionDescriptionValidationError) Field() string { return e.field }","func (r *resolution) ipField(res Result, field string) (bool, Result, error) {\n\tfip := field[4:]\n\tif strings.Contains(fip, \"/\") {\n\t\t_, ipnet, err := net.ParseCIDR(fip)\n\t\tif err != nil {\n\t\t\treturn true, PermError, err\n\t\t}\n\t\tif ipnet.Contains(r.ip) {\n\t\t\treturn true, res, fmt.Errorf(\"matched %v\", ipnet)\n\t\t}\n\t} else {\n\t\tip := net.ParseIP(fip)\n\t\tif ip == nil {\n\t\t\treturn true, PermError, fmt.Errorf(\"invalid ipX value\")\n\t\t}\n\t\tif ip.Equal(r.ip) {\n\t\t\treturn true, res, fmt.Errorf(\"matched %v\", ip)\n\t\t}\n\t}\n\n\treturn false, \"\", nil\n}","func (options *Options) Eval(ctx interface{}, field string) interface{} {\n\tif ctx == nil {\n\t\treturn nil\n\t}\n\n\tif field == \"\" {\n\t\treturn nil\n\t}\n\n\tval := options.eval.evalField(reflect.ValueOf(ctx), field, false)\n\tif !val.IsValid() {\n\t\treturn nil\n\t}\n\n\treturn val.Interface()\n}","func (e CreatePaymentResponseValidationError) Field() string { return e.field }"],"string":"[\n \"func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {\\n\\t// Ensure there is a single argument.\\n\\tif len(c.Args) != 1 {\\n\\t\\treturn nil, fmt.Errorf(\\\"expected one argument for %s()\\\", c.Name)\\n\\t}\\n\\n\\t// Ensure the argument is a variable reference.\\n\\tref, ok := c.Args[0].(*VarRef)\\n\\tif !ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"expected field argument in %s()\\\", c.Name)\\n\\t}\\n\\n\\t// Extract the substatement for the call.\\n\\tsub, err := e.stmt.Substatement(ref)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tname := sub.Source.(*Measurement).Name\\n\\n\\t// Extract tags from conditional.\\n\\ttags := make(map[string]string)\\n\\tcondition, err := p.extractTags(name, sub.Condition, tags)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tsub.Condition = condition\\n\\n\\t// Find field.\\n\\tfname := strings.TrimPrefix(ref.Val, name+\\\".\\\")\\n\\tfieldID, typ := e.db.Field(name, fname)\\n\\tif fieldID == 0 {\\n\\t\\treturn nil, fmt.Errorf(\\\"field not found: %s.%s\\\", name, fname)\\n\\t}\\n\\n\\t// Generate a reducer for the given function.\\n\\tr := newReducer(e)\\n\\tr.stmt = sub\\n\\n\\t// Retrieve a list of series data ids.\\n\\tseriesIDs := p.DB.MatchSeries(name, tags)\\n\\n\\t// Generate mappers for each id.\\n\\tr.mappers = make([]*mapper, len(seriesIDs))\\n\\tfor i, seriesID := range seriesIDs {\\n\\t\\tm := newMapper(e, seriesID, fieldID, typ)\\n\\t\\tm.min, m.max = e.min.UnixNano(), e.max.UnixNano()\\n\\t\\tm.interval = int64(e.interval)\\n\\t\\tm.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)\\n\\t\\tr.mappers[i] = m\\n\\t}\\n\\n\\t// Set the appropriate reducer function.\\n\\tswitch strings.ToLower(c.Name) {\\n\\tcase \\\"count\\\":\\n\\t\\tr.fn = reduceSum\\n\\t\\tfor _, m := range r.mappers {\\n\\t\\t\\tm.fn = mapCount\\n\\t\\t}\\n\\tcase \\\"sum\\\":\\n\\t\\tr.fn = reduceSum\\n\\t\\tfor _, m := range r.mappers {\\n\\t\\t\\tm.fn = mapSum\\n\\t\\t}\\n\\tdefault:\\n\\t\\treturn nil, fmt.Errorf(\\\"function not found: %q\\\", c.Name)\\n\\t}\\n\\n\\treturn r, nil\\n}\",\n \"func (b *Builder) Field(keypath string) *Builder {\\n\\tb.p.RegisterTransformation(impl.Field(keypath))\\n\\treturn b\\n}\",\n \"func (ec *executionContext) _fieldMiddleware(ctx context.Context, obj interface{}, next graphql.Resolver) interface{} {\\n\\tfc := graphql.GetFieldContext(ctx)\\n\\tfor _, d := range fc.Field.Directives {\\n\\t\\tswitch d.Name {\\n\\t\\tcase \\\"restricted\\\":\\n\\t\\t\\trawArgs := d.ArgumentMap(ec.Variables)\\n\\t\\t\\targs, err := ec.dir_restricted_args(ctx, rawArgs)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tec.Error(ctx, err)\\n\\t\\t\\t\\treturn nil\\n\\t\\t\\t}\\n\\t\\t\\tn := next\\n\\t\\t\\tnext = func(ctx context.Context) (interface{}, error) {\\n\\t\\t\\t\\tif ec.directives.Restricted == nil {\\n\\t\\t\\t\\t\\treturn nil, errors.New(\\\"directive restricted is not implemented\\\")\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn ec.directives.Restricted(ctx, obj, n, args[\\\"permission\\\"].([]string))\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tres, err := ec.ResolverMiddleware(ctx, next)\\n\\tif err != nil {\\n\\t\\tec.Error(ctx, err)\\n\\t\\treturn nil\\n\\t}\\n\\treturn res\\n}\",\n \"func processField(field string) string {\\n\\tif isValidOperator(field) {\\n\\t\\treturn field\\n\\t} else {\\n\\t\\treturn fmt.Sprintf(\\\"%v.%v\\\", dataWrapper, field)\\n\\t}\\n}\",\n \"func (v *ApiVisitor) VisitField(ctx *api.FieldContext) interface{} {\\n\\tiAnonymousFiled := ctx.AnonymousFiled()\\n\\tiNormalFieldContext := ctx.NormalField()\\n\\tif iAnonymousFiled != nil {\\n\\t\\treturn iAnonymousFiled.Accept(v).(*TypeField)\\n\\t}\\n\\tif iNormalFieldContext != nil {\\n\\t\\treturn iNormalFieldContext.Accept(v).(*TypeField)\\n\\t}\\n\\treturn nil\\n}\",\n \"func (ec *executionContext) _fieldMiddleware(ctx context.Context, obj interface{}, next graphql.Resolver) interface{} {\\n\\t\\trctx := graphql.GetResolverContext(ctx)\\n\\t\\tfor _, d := range rctx.Field.Directives {\\n\\t\\t\\tswitch d.Name {\\n\\t\\t\\tcase \\\"include\\\":\\n\\t\\t\\t\\t\\trawArgs := d.ArgumentMap(ec.Variables)\\n\\t\\t\\t\\t\\targs, err := ec.dir_include_args(ctx,rawArgs)\\n\\t\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\t\\tec.Error(ctx, err)\\n\\t\\t\\t\\t\\t\\treturn nil\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\tn := next\\n\\t\\t\\t\\tnext = func(ctx context.Context) (interface{}, error) {\\n\\t\\t\\t\\t\\treturn ec.directives.Include(ctx, obj, n, args[\\\"if\\\"].(bool))\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase \\\"skip\\\":\\n\\t\\t\\t\\t\\trawArgs := d.ArgumentMap(ec.Variables)\\n\\t\\t\\t\\t\\targs, err := ec.dir_skip_args(ctx,rawArgs)\\n\\t\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\t\\tec.Error(ctx, err)\\n\\t\\t\\t\\t\\t\\treturn nil\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\tn := next\\n\\t\\t\\t\\tnext = func(ctx context.Context) (interface{}, error) {\\n\\t\\t\\t\\t\\treturn ec.directives.Skip(ctx, obj, n, args[\\\"if\\\"].(bool))\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tres, err := ec.ResolverMiddleware(ctx, next)\\n\\t\\tif err != nil {\\n\\t\\t\\tec.Error(ctx, err)\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn res\\n\\t}\",\n \"func NewProcessField(\\n\\tconf Config, mgr types.Manager, log log.Modular, stats metrics.Type,\\n) (Type, error) {\\n\\tvar children []types.Processor\\n\\tfor i, pconf := range conf.ProcessField.Processors {\\n\\t\\tprefix := fmt.Sprintf(\\\"%v\\\", i)\\n\\t\\tproc, err := New(pconf, mgr, log.NewModule(\\\".\\\"+prefix), metrics.Namespaced(stats, prefix))\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tchildren = append(children, proc)\\n\\t}\\n\\treturn &ProcessField{\\n\\t\\tparts: conf.ProcessField.Parts,\\n\\t\\tpath: strings.Split(conf.ProcessField.Path, \\\".\\\"),\\n\\t\\tchildren: children,\\n\\n\\t\\tlog: log,\\n\\n\\t\\tmCount: stats.GetCounter(\\\"count\\\"),\\n\\t\\tmErr: stats.GetCounter(\\\"error\\\"),\\n\\t\\tmErrJSONParse: stats.GetCounter(\\\"error.json_parse\\\"),\\n\\t\\tmErrMisaligned: stats.GetCounter(\\\"error.misaligned\\\"),\\n\\t\\tmErrMisalignedBatch: stats.GetCounter(\\\"error.misaligned_messages\\\"),\\n\\t\\tmSent: stats.GetCounter(\\\"sent\\\"),\\n\\t\\tmBatchSent: stats.GetCounter(\\\"batch.sent\\\"),\\n\\t}, nil\\n}\",\n \"func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\\n\\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\\n\\n\\tout := graphql.NewOrderedMap(len(fields))\\n\\tinvalid := false\\n\\tfor i, field := range fields {\\n\\t\\tout.Keys[i] = field.Alias\\n\\n\\t\\tswitch field.Name {\\n\\t\\tcase \\\"__typename\\\":\\n\\t\\t\\tout.Values[i] = graphql.MarshalString(\\\"__Field\\\")\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_name(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_description(ctx, field, obj)\\n\\t\\tcase \\\"args\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_args(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_type(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"isDeprecated\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"deprecationReason\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\\n\\t\\tdefault:\\n\\t\\t\\tpanic(\\\"unknown field \\\" + strconv.Quote(field.Name))\\n\\t\\t}\\n\\t}\\n\\n\\tif invalid {\\n\\t\\treturn graphql.Null\\n\\t}\\n\\treturn out\\n}\",\n \"func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\\n\\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\\n\\n\\tout := graphql.NewOrderedMap(len(fields))\\n\\tinvalid := false\\n\\tfor i, field := range fields {\\n\\t\\tout.Keys[i] = field.Alias\\n\\n\\t\\tswitch field.Name {\\n\\t\\tcase \\\"__typename\\\":\\n\\t\\t\\tout.Values[i] = graphql.MarshalString(\\\"__Field\\\")\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_name(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_description(ctx, field, obj)\\n\\t\\tcase \\\"args\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_args(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_type(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"isDeprecated\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"deprecationReason\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\\n\\t\\tdefault:\\n\\t\\t\\tpanic(\\\"unknown field \\\" + strconv.Quote(field.Name))\\n\\t\\t}\\n\\t}\\n\\n\\tif invalid {\\n\\t\\treturn graphql.Null\\n\\t}\\n\\treturn out\\n}\",\n \"func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\\n\\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\\n\\n\\tout := graphql.NewOrderedMap(len(fields))\\n\\tinvalid := false\\n\\tfor i, field := range fields {\\n\\t\\tout.Keys[i] = field.Alias\\n\\n\\t\\tswitch field.Name {\\n\\t\\tcase \\\"__typename\\\":\\n\\t\\t\\tout.Values[i] = graphql.MarshalString(\\\"__Field\\\")\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_name(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_description(ctx, field, obj)\\n\\t\\tcase \\\"args\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_args(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_type(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"isDeprecated\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\\n\\t\\t\\tif out.Values[i] == graphql.Null {\\n\\t\\t\\t\\tinvalid = true\\n\\t\\t\\t}\\n\\t\\tcase \\\"deprecationReason\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\\n\\t\\tdefault:\\n\\t\\t\\tpanic(\\\"unknown field \\\" + strconv.Quote(field.Name))\\n\\t\\t}\\n\\t}\\n\\n\\tif invalid {\\n\\t\\treturn graphql.Null\\n\\t}\\n\\treturn out\\n}\",\n \"func (fn AdapterFunc) Field(fieldpath []string) (string, bool) {\\n\\treturn fn(fieldpath)\\n}\",\n \"func VisitField(nodes []Node, field string, callback func(value string, negated bool, annotation Annotation)) {\\n\\tvisitor := &FieldVisitor{callback: callback, field: field}\\n\\tvisitor.VisitNodes(visitor, nodes)\\n}\",\n \"func (s *state) evalField(dot reflect.Value, fieldName string, node parse.Node, args []parse.Node, final, receiver reflect.Value) reflect.Value {\\n\\tif !receiver.IsValid() {\\n\\t\\treturn zero\\n\\t}\\n\\ttyp := receiver.Type()\\n\\treceiver, _ = indirect(receiver)\\n\\t// Unless it's an interface, need to get to a value of type *T to guarantee\\n\\t// we see all methods of T and *T.\\n\\tptr := receiver\\n\\tif ptr.Kind() != reflect.Interface && ptr.CanAddr() {\\n\\t\\tptr = ptr.Addr()\\n\\t}\\n\\tif method := ptr.MethodByName(fieldName); method.IsValid() {\\n\\t\\treturn s.evalCall(dot, method, node, fieldName, args, final)\\n\\t}\\n\\thasArgs := len(args) > 1 || final.IsValid()\\n\\t// It's not a method; must be a field of a struct or an element of a map. The receiver must not be nil.\\n\\treceiver, isNil := indirect(receiver)\\n\\tif isNil {\\n\\t\\ts.errorf(\\\"nil pointer evaluating %s.%s\\\", typ, fieldName)\\n\\t}\\n\\tswitch receiver.Kind() {\\n\\tcase reflect.Struct:\\n\\t\\ttField, ok := receiver.Type().FieldByName(fieldName)\\n\\t\\tif ok {\\n\\t\\t\\tfield := receiver.FieldByIndex(tField.Index)\\n\\t\\t\\tif tField.PkgPath != \\\"\\\" { // field is unexported\\n\\t\\t\\t\\ts.errorf(\\\"%s is an unexported field of struct type %s\\\", fieldName, typ)\\n\\t\\t\\t}\\n\\t\\t\\t// If it's a function, we must call it.\\n\\t\\t\\tif hasArgs {\\n\\t\\t\\t\\ts.errorf(\\\"%s has arguments but cannot be invoked as function\\\", fieldName)\\n\\t\\t\\t}\\n\\t\\t\\treturn field\\n\\t\\t}\\n\\t\\ts.errorf(\\\"%s is not a field of struct type %s\\\", fieldName, typ)\\n\\tcase reflect.Map:\\n\\t\\t// If it's a map, attempt to use the field name as a key.\\n\\t\\tnameVal := reflect.ValueOf(fieldName)\\n\\t\\tif nameVal.Type().AssignableTo(receiver.Type().Key()) {\\n\\t\\t\\tif hasArgs {\\n\\t\\t\\t\\ts.errorf(\\\"%s is not a method but has arguments\\\", fieldName)\\n\\t\\t\\t}\\n\\t\\t\\treturn receiver.MapIndex(nameVal)\\n\\t\\t}\\n\\t}\\n\\ts.errorf(\\\"can't evaluate field %s in type %s\\\", fieldName, typ)\\n\\tpanic(\\\"not reached\\\")\\n}\",\n \"func (ec *executionContext) ___Field(ctx context.Context, sel ast.SelectionSet, obj *introspection.Field) graphql.Marshaler {\\n\\tfields := graphql.CollectFields(ctx, sel, __FieldImplementors)\\n\\n\\tout := graphql.NewOrderedMap(len(fields))\\n\\tfor i, field := range fields {\\n\\t\\tout.Keys[i] = field.Alias\\n\\n\\t\\tswitch field.Name {\\n\\t\\tcase \\\"__typename\\\":\\n\\t\\t\\tout.Values[i] = graphql.MarshalString(\\\"__Field\\\")\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_name(ctx, field, obj)\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_description(ctx, field, obj)\\n\\t\\tcase \\\"args\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_args(ctx, field, obj)\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_type(ctx, field, obj)\\n\\t\\tcase \\\"isDeprecated\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\\n\\t\\tcase \\\"deprecationReason\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\\n\\t\\tdefault:\\n\\t\\t\\tpanic(\\\"unknown field \\\" + strconv.Quote(field.Name))\\n\\t\\t}\\n\\t}\\n\\n\\treturn out\\n}\",\n \"func (o JobLoadTimePartitioningOutput) Field() pulumi.StringPtrOutput {\\n\\treturn o.ApplyT(func(v JobLoadTimePartitioning) *string { return v.Field }).(pulumi.StringPtrOutput)\\n}\",\n \"func (e ShippingMethodValidationError) Field() string { return e.field }\",\n \"func (op *metadataLookup) field(parentFunc *stmt.CallExpr, expr stmt.Expr) {\\n\\tif op.err != nil {\\n\\t\\treturn\\n\\t}\\n\\tswitch e := expr.(type) {\\n\\tcase *stmt.SelectItem:\\n\\t\\top.field(nil, e.Expr)\\n\\tcase *stmt.CallExpr:\\n\\t\\tif e.FuncType == function.Quantile {\\n\\t\\t\\top.planHistogramFields(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tfor _, param := range e.Params {\\n\\t\\t\\top.field(e, param)\\n\\t\\t}\\n\\tcase *stmt.ParenExpr:\\n\\t\\top.field(nil, e.Expr)\\n\\tcase *stmt.BinaryExpr:\\n\\t\\top.field(nil, e.Left)\\n\\t\\top.field(nil, e.Right)\\n\\tcase *stmt.FieldExpr:\\n\\t\\tqueryStmt := op.executeCtx.Query\\n\\t\\tfieldMeta, err := op.metadata.GetField(queryStmt.Namespace, queryStmt.MetricName, field.Name(e.Name))\\n\\t\\tif err != nil {\\n\\t\\t\\top.err = err\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\top.planField(parentFunc, fieldMeta)\\n\\t}\\n}\",\n \"func (b *PlanBuilder) buildProjectionField(ctx context.Context, p LogicalPlan, field *ast.SelectField, expr expression.Expression) (*expression.Column, *types.FieldName, error) {\\n\\tvar origTblName, tblName, colName, dbName parser_model.CIStr\\n\\tinnerNode := getInnerFromParenthesesAndUnaryPlus(field.Expr)\\n\\tcol, isCol := expr.(*expression.Column)\\n\\t// Correlated column won't affect the final output names. So we can put it in any of the three logic block.\\n\\t// Don't put it into the first block just for simplifying the codes.\\n\\tif colNameField, ok := innerNode.(*ast.ColumnNameExpr); ok && isCol {\\n\\t\\t// Field is a column reference.\\n\\t\\tidx := p.Schema().ColumnIndex(col)\\n\\t\\tvar name *types.FieldName\\n\\t\\t// The column maybe the one from join's redundant part.\\n\\t\\t// TODO: Fully support USING/NATURAL JOIN, refactor here.\\n\\t\\tif idx != -1 {\\n\\t\\t\\tname = p.OutputNames()[idx]\\n\\t\\t}\\n\\t\\tcolName, _, tblName, origTblName, dbName = b.buildProjectionFieldNameFromColumns(field, colNameField, name)\\n\\t} else if field.AsName.L != \\\"\\\" {\\n\\t\\t// Field has alias.\\n\\t\\tcolName = field.AsName\\n\\t} else {\\n\\t\\t// Other: field is an expression.\\n\\t\\tvar err error\\n\\t\\tif colName, err = b.buildProjectionFieldNameFromExpressions(ctx, field); err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\t}\\n\\tname := &types.FieldName{\\n\\t\\tTblName: tblName,\\n\\t\\tOrigTblName: origTblName,\\n\\t\\tColName: colName,\\n\\t\\tOrigColName: colName,\\n\\t\\tDBName: dbName,\\n\\t}\\n\\tif isCol {\\n\\t\\treturn col, name, nil\\n\\t}\\n\\tnewCol := &expression.Column{\\n\\t\\tUniqueID: b.ctx.GetSessionVars().AllocPlanColumnID(),\\n\\t\\tRetType: expr.GetType(),\\n\\t\\tOrigName: colName.L,\\n\\t}\\n\\treturn newCol, name, nil\\n}\",\n \"func (ec *executionContext) ___Field(ctx context.Context, sel []query.Selection, obj *introspection.Field) graphql.Marshaler {\\n\\tfields := graphql.CollectFields(ec.Doc, sel, __FieldImplementors, ec.Variables)\\n\\n\\tout := graphql.NewOrderedMap(len(fields))\\n\\tfor i, field := range fields {\\n\\t\\tout.Keys[i] = field.Alias\\n\\n\\t\\tswitch field.Name {\\n\\t\\tcase \\\"__typename\\\":\\n\\t\\t\\tout.Values[i] = graphql.MarshalString(\\\"__Field\\\")\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_name(ctx, field, obj)\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_description(ctx, field, obj)\\n\\t\\tcase \\\"args\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_args(ctx, field, obj)\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_type(ctx, field, obj)\\n\\t\\tcase \\\"isDeprecated\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_isDeprecated(ctx, field, obj)\\n\\t\\tcase \\\"deprecationReason\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_deprecationReason(ctx, field, obj)\\n\\t\\tdefault:\\n\\t\\t\\tpanic(\\\"unknown field \\\" + strconv.Quote(field.Name))\\n\\t\\t}\\n\\t}\\n\\n\\treturn out\\n}\",\n \"func (e MoveObjectNextRequestValidationError) Field() string { return e.field }\",\n \"func (w *State) GenerateFlowField(destination DestinationID) error {\\n\\tlog.Println(\\\"find shorted path\\\")\\n\\tFindShortestPath(w, destination)\\n\\tlog.Println(\\\"compute directions\\\")\\n\\tw.computeDirections(destination)\\n\\n\\treturn nil\\n\\n}\",\n \"func (_DelegateProfile *DelegateProfileTransactor) NewField(opts *bind.TransactOpts, _name string, _verifierAddr common.Address) (*types.Transaction, error) {\\n\\treturn _DelegateProfile.contract.Transact(opts, \\\"newField\\\", _name, _verifierAddr)\\n}\",\n \"func (o TableTimePartitioningOutput) Field() pulumi.StringPtrOutput {\\n\\treturn o.ApplyT(func(v TableTimePartitioning) *string { return v.Field }).(pulumi.StringPtrOutput)\\n}\",\n \"func (e ProcessingRequestValidationError) Field() string { return e.field }\",\n \"func (m *SnapshotPrepare) Field(fieldpath []string) (string, bool) {\\n\\tif len(fieldpath) == 0 {\\n\\t\\treturn \\\"\\\", false\\n\\t}\\n\\tswitch fieldpath[0] {\\n\\tcase \\\"key\\\":\\n\\t\\treturn string(m.Key), len(m.Key) > 0\\n\\tcase \\\"parent\\\":\\n\\t\\treturn string(m.Parent), len(m.Parent) > 0\\n\\tcase \\\"snapshotter\\\":\\n\\t\\treturn string(m.Snapshotter), len(m.Snapshotter) > 0\\n\\t}\\n\\treturn \\\"\\\", false\\n}\",\n \"func (ec *executionContext) ___Field(sel []query.Selection, obj *introspection.Field) graphql.Marshaler {\\n\\tfields := graphql.CollectFields(ec.doc, sel, __FieldImplementors, ec.variables)\\n\\tout := graphql.NewOrderedMap(len(fields))\\n\\tfor i, field := range fields {\\n\\t\\tout.Keys[i] = field.Alias\\n\\n\\t\\tswitch field.Name {\\n\\t\\tcase \\\"__typename\\\":\\n\\t\\t\\tout.Values[i] = graphql.MarshalString(\\\"__Field\\\")\\n\\t\\tcase \\\"name\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_name(field, obj)\\n\\t\\tcase \\\"description\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_description(field, obj)\\n\\t\\tcase \\\"args\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_args(field, obj)\\n\\t\\tcase \\\"type\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_type(field, obj)\\n\\t\\tcase \\\"isDeprecated\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_isDeprecated(field, obj)\\n\\t\\tcase \\\"deprecationReason\\\":\\n\\t\\t\\tout.Values[i] = ec.___Field_deprecationReason(field, obj)\\n\\t\\tdefault:\\n\\t\\t\\tpanic(\\\"unknown field \\\" + strconv.Quote(field.Name))\\n\\t\\t}\\n\\t}\\n\\n\\treturn out\\n}\",\n \"func (q *DistanceFeatureQuery) Field(name string) *DistanceFeatureQuery {\\n\\tq.field = name\\n\\treturn q\\n}\",\n \"func (sb *schemaBuilder) buildField(field reflect.StructField) (*graphql.Field, error) {\\n\\tretType, err := sb.getType(field.Type)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn &graphql.Field{\\n\\t\\tResolve: func(ctx context.Context, source, args interface{}, selectionSet *graphql.SelectionSet) (interface{}, error) {\\n\\t\\t\\tvalue := reflect.ValueOf(source)\\n\\t\\t\\tif value.Kind() == reflect.Ptr {\\n\\t\\t\\t\\tvalue = value.Elem()\\n\\t\\t\\t}\\n\\t\\t\\treturn value.FieldByIndex(field.Index).Interface(), nil\\n\\t\\t},\\n\\t\\tType: retType,\\n\\t\\tParseArguments: nilParseArguments,\\n\\t}, nil\\n}\",\n \"func (e CreatePaymentRequestValidationError) Field() string { return e.field }\",\n \"func NewFieldStep(f *reflect.StructField) *FieldStep {\\n\\treturn &FieldStep{\\n\\t\\tf,\\n\\t}\\n}\",\n \"func execNewField(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(5)\\n\\tret := types.NewField(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(types.Type), args[4].(bool))\\n\\tp.Ret(5, ret)\\n}\",\n \"func (m *ContainerCreate_Runtime) Field(fieldpath []string) (string, bool) {\\n\\tif len(fieldpath) == 0 {\\n\\t\\treturn \\\"\\\", false\\n\\t}\\n\\n\\tswitch fieldpath[0] {\\n\\tcase \\\"name\\\":\\n\\t\\treturn string(m.Name), len(m.Name) > 0\\n\\tcase \\\"options\\\":\\n\\t\\tdecoded, err := github_com_containerd_typeurl.UnmarshalAny(m.Options)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn \\\"\\\", false\\n\\t\\t}\\n\\n\\t\\tadaptor, ok := decoded.(interface{ Field([]string) (string, bool) })\\n\\t\\tif !ok {\\n\\t\\t\\treturn \\\"\\\", false\\n\\t\\t}\\n\\t\\treturn adaptor.Field(fieldpath[1:])\\n\\t}\\n\\treturn \\\"\\\", false\\n}\",\n \"func (m *PetruleMutation) Field(name string) (ent.Value, bool) {\\n\\tswitch name {\\n\\tcase petrule.FieldPetrule:\\n\\t\\treturn m.Petrule()\\n\\t}\\n\\treturn nil, false\\n}\",\n \"func (e CreateMovableObjectRequestValidationError) Field() string { return e.field }\",\n \"func (t tracer) StartFieldExecution(ctx context.Context, field graphql.CollectedField) context.Context {\\n\\tif strings.HasPrefix(field.Name, \\\"__\\\") {\\n\\t\\tctx, _ = trace.StartSpan(ctx,\\n\\t\\t\\tfield.ObjectDefinition.Name+\\\"/\\\"+field.Name,\\n\\t\\t\\ttrace.WithSampler(trace.NeverSample()),\\n\\t\\t)\\n\\t\\treturn ctx\\n\\t}\\n\\treturn t.Tracer.StartFieldExecution(ctx, field)\\n}\",\n \"func (e AgreeShippingDispatchRequestValidationError) Field() string { return e.field }\",\n \"func (m *ZoneproductMutation) Field(name string) (ent.Value, bool) {\\n\\tswitch name {\\n\\tcase zoneproduct.FieldZone:\\n\\t\\treturn m.Zone()\\n\\t}\\n\\treturn nil, false\\n}\",\n \"func (dr *defaultRender) OnParseField(out *jen.File, methodDefinition *jen.Group, field *atool.Arg, file *atool.File) {\\n}\",\n \"func (t *Type) Field(i int) *Field\",\n \"func (e SavePortRequestValidationError) Field() string { return e.field }\",\n \"func genField(field *ast.FieldDefinition) *jen.Statement {\\n\\t//\\n\\t// Generate config for field\\n\\t//\\n\\t// == Example input SDL\\n\\t//\\n\\t// interface Pet {\\n\\t// \\\"name of the pet\\\"\\n\\t// name(style: NameComponentsStyle = SHORT): String!\\n\\t// \\\"\\\"\\\"\\n\\t// givenName of the pet ★\\n\\t// \\\"\\\"\\\"\\n\\t// givenName: String @deprecated(reason: \\\"No longer supported; please use name field.\\\")\\n\\t// }\\n\\t//\\n\\t// == Example output\\n\\t//\\n\\t// &graphql.Field{\\n\\t// Name: \\\"name\\\",\\n\\t// Type: graphql.NonNull(graphql.String),\\n\\t// Description: \\\"name of the pet\\\",\\n\\t// DeprecationReason: \\\"\\\",\\n\\t// Args: FieldConfigArgument{ ... },\\n\\t// }\\n\\t//\\n\\t// &graphql.Field{\\n\\t// Name: \\\"givenName\\\",\\n\\t// Type: graphql.String,\\n\\t// Description: \\\"givenName of the pet\\\",\\n\\t// DeprecationReason: \\\"No longer supported; please use name field.\\\",\\n\\t// Args: FieldConfigArgument{ ... },\\n\\t// }\\n\\t//\\n\\treturn jen.Op(\\\"&\\\").Qual(defsPkg, \\\"Field\\\").Values(jen.Dict{\\n\\t\\tjen.Id(\\\"Args\\\"): genArguments(field.Arguments),\\n\\t\\tjen.Id(\\\"DeprecationReason\\\"): genDeprecationReason(field.Directives),\\n\\t\\tjen.Id(\\\"Description\\\"): genDescription(field),\\n\\t\\tjen.Id(\\\"Name\\\"): jen.Lit(field.Name.Value),\\n\\t\\tjen.Id(\\\"Type\\\"): genOutputTypeReference(field.Type),\\n\\t})\\n}\",\n \"func (e MaxPciValidationError) Field() string { return e.field }\",\n \"func (m *ServicePlanInfo) GetFieldDeserializers()(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error)) {\\n res := make(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error))\\n res[\\\"appliesTo\\\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetAppliesTo)\\n res[\\\"@odata.type\\\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetOdataType)\\n res[\\\"provisioningStatus\\\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetProvisioningStatus)\\n res[\\\"servicePlanId\\\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetServicePlanId)\\n res[\\\"servicePlanName\\\"] = i2ae4187f7daee263371cb1c977df639813ab50ffa529013b7437480d1ec0158f.SetStringValue(m.SetServicePlanName)\\n return res\\n}\",\n \"func (e RanfunctionNameValidationError) Field() string { return e.field }\",\n \"func (*Base) ObjectField(p ASTPass, field *ast.ObjectField, ctx Context) {\\n\\tswitch field.Kind {\\n\\tcase ast.ObjectLocal:\\n\\t\\tp.Fodder(p, &field.Fodder1, ctx)\\n\\t\\tp.Fodder(p, &field.Fodder2, ctx)\\n\\t\\tp.FieldParams(p, field, ctx)\\n\\t\\tp.Fodder(p, &field.OpFodder, ctx)\\n\\t\\tp.Visit(p, &field.Expr2, ctx)\\n\\n\\tcase ast.ObjectFieldID:\\n\\t\\tp.Fodder(p, &field.Fodder1, ctx)\\n\\t\\tp.FieldParams(p, field, ctx)\\n\\t\\tp.Fodder(p, &field.OpFodder, ctx)\\n\\t\\tp.Visit(p, &field.Expr2, ctx)\\n\\n\\tcase ast.ObjectFieldStr:\\n\\t\\tp.Visit(p, &field.Expr1, ctx)\\n\\t\\tp.FieldParams(p, field, ctx)\\n\\t\\tp.Fodder(p, &field.OpFodder, ctx)\\n\\t\\tp.Visit(p, &field.Expr2, ctx)\\n\\n\\tcase ast.ObjectFieldExpr:\\n\\t\\tp.Fodder(p, &field.Fodder1, ctx)\\n\\t\\tp.Visit(p, &field.Expr1, ctx)\\n\\t\\tp.Fodder(p, &field.Fodder2, ctx)\\n\\t\\tp.FieldParams(p, field, ctx)\\n\\t\\tp.Fodder(p, &field.OpFodder, ctx)\\n\\t\\tp.Visit(p, &field.Expr2, ctx)\\n\\n\\tcase ast.ObjectAssert:\\n\\t\\tp.Fodder(p, &field.Fodder1, ctx)\\n\\t\\tp.Visit(p, &field.Expr2, ctx)\\n\\t\\tif field.Expr3 != nil {\\n\\t\\t\\tp.Fodder(p, &field.OpFodder, ctx)\\n\\t\\t\\tp.Visit(p, &field.Expr3, ctx)\\n\\t\\t}\\n\\t}\\n\\n\\tp.Fodder(p, &field.CommaFodder, ctx)\\n}\",\n \"func (e RanparameterValueValidationError) Field() string { return e.field }\",\n \"func (m *PledgeMutation) Field(name string) (ent.Value, bool) {\\n\\tswitch name {\\n\\tcase pledge.FieldProvision:\\n\\t\\treturn m.Provision()\\n\\t}\\n\\treturn nil, false\\n}\",\n \"func (o JobLoadTimePartitioningPtrOutput) Field() pulumi.StringPtrOutput {\\n\\treturn o.ApplyT(func(v *JobLoadTimePartitioning) *string {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Field\\n\\t}).(pulumi.StringPtrOutput)\\n}\",\n \"func (x *fastReflection_SendEnabled) NewField(fd protoreflect.FieldDescriptor) protoreflect.Value {\\n\\tswitch fd.FullName() {\\n\\tcase \\\"cosmos.bank.v1beta1.SendEnabled.denom\\\":\\n\\t\\treturn protoreflect.ValueOfString(\\\"\\\")\\n\\tcase \\\"cosmos.bank.v1beta1.SendEnabled.enabled\\\":\\n\\t\\treturn protoreflect.ValueOfBool(false)\\n\\tdefault:\\n\\t\\tif fd.IsExtension() {\\n\\t\\t\\tpanic(fmt.Errorf(\\\"proto3 declared messages do not support extensions: cosmos.bank.v1beta1.SendEnabled\\\"))\\n\\t\\t}\\n\\t\\tpanic(fmt.Errorf(\\\"message cosmos.bank.v1beta1.SendEnabled does not contain field %s\\\", fd.FullName()))\\n\\t}\\n}\",\n \"func (e PaymentValidationError) Field() string { return e.field }\",\n \"func (e GetMovableObjectRequestValidationError) Field() string { return e.field }\",\n \"func (e PaymentInputValidationError) Field() string { return e.field }\",\n \"func (e RetrievePaymentRequestValidationError) Field() string { return e.field }\",\n \"func (ds *DynamicStruct) Field(i int) reflect.StructField {\\n\\treturn ds.rt.Field(i)\\n}\",\n \"func (e RanparameterNameValidationError) Field() string { return e.field }\",\n \"func (tracer) StartFieldExecution(ctx context.Context, _ graphql.CollectedField) context.Context {\\n\\treturn ctx\\n}\",\n \"func (e RetrieveShippingMethodsRequestValidationError) Field() string { return e.field }\",\n \"func (e SavePortsRequestValidationError) Field() string { return e.field }\",\n \"func (e PciValidationError) Field() string { return e.field }\",\n \"func (e PortNetworkPolicyRuleValidationError) Field() string { return e.field }\",\n \"func (e CreateShippingRequestValidationError) Field() string { return e.field }\",\n \"func (msg *Message) Field(fieldName string) *Field {\\n\\treturn msg.fieldByName[fieldName]\\n}\",\n \"func (p *Planner) addField(ref int) {\\n\\tfieldName := p.visitor.Operation.FieldNameString(ref)\\n\\n\\talias := ast.Alias{\\n\\t\\tIsDefined: p.visitor.Operation.FieldAliasIsDefined(ref),\\n\\t}\\n\\n\\tif alias.IsDefined {\\n\\t\\taliasBytes := p.visitor.Operation.FieldAliasBytes(ref)\\n\\t\\talias.Name = p.upstreamOperation.Input.AppendInputBytes(aliasBytes)\\n\\t}\\n\\n\\ttypeName := p.visitor.Walker.EnclosingTypeDefinition.NameString(p.visitor.Definition)\\n\\tfor i := range p.visitor.Config.Fields {\\n\\t\\tisDesiredField := p.visitor.Config.Fields[i].TypeName == typeName &&\\n\\t\\t\\tp.visitor.Config.Fields[i].FieldName == fieldName\\n\\n\\t\\t// chech that we are on a desired field and field path contains a single element - mapping is plain\\n\\t\\tif isDesiredField && len(p.visitor.Config.Fields[i].Path) == 1 {\\n\\t\\t\\t// define alias when mapping path differs from fieldName and no alias has been defined\\n\\t\\t\\tif p.visitor.Config.Fields[i].Path[0] != fieldName && !alias.IsDefined {\\n\\t\\t\\t\\talias.IsDefined = true\\n\\t\\t\\t\\taliasBytes := p.visitor.Operation.FieldNameBytes(ref)\\n\\t\\t\\t\\talias.Name = p.upstreamOperation.Input.AppendInputBytes(aliasBytes)\\n\\t\\t\\t}\\n\\n\\t\\t\\t// override fieldName with mapping path value\\n\\t\\t\\tfieldName = p.visitor.Config.Fields[i].Path[0]\\n\\n\\t\\t\\t// when provided field is a root type field save new field name\\n\\t\\t\\tif ref == p.rootFieldRef {\\n\\t\\t\\t\\tp.rootFieldName = fieldName\\n\\t\\t\\t}\\n\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\n\\tfield := p.upstreamOperation.AddField(ast.Field{\\n\\t\\tName: p.upstreamOperation.Input.AppendInputString(fieldName),\\n\\t\\tAlias: alias,\\n\\t})\\n\\n\\tselection := ast.Selection{\\n\\t\\tKind: ast.SelectionKindField,\\n\\t\\tRef: field.Ref,\\n\\t}\\n\\n\\tp.upstreamOperation.AddSelection(p.nodes[len(p.nodes)-1].Ref, selection)\\n\\tp.nodes = append(p.nodes, field)\\n}\",\n \"func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\\n\\tswitch expr := expr.(type) {\\n\\tcase *VarRef:\\n\\t\\tpanic(\\\"TODO\\\")\\n\\tcase *Call:\\n\\t\\treturn p.planCall(e, expr)\\n\\tcase *BinaryExpr:\\n\\t\\treturn p.planBinaryExpr(e, expr)\\n\\tcase *ParenExpr:\\n\\t\\treturn p.planExpr(e, expr.Expr)\\n\\tcase *NumberLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *StringLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *BooleanLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *TimeLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *DurationLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\t}\\n\\tpanic(\\\"unreachable\\\")\\n}\",\n \"func (e RanparameterItemValidationError) Field() string { return e.field }\",\n \"func (e PortNetworkPolicyValidationError) Field() string { return e.field }\",\n \"func fieldsImpl(path reflectutil.Path, msg protoreflect.Message, processors []*procBundle) Results {\\n\\tret := make(Results, len(processors))\\n\\tplan := makePlan(msg.Descriptor(), processors)\\n\\n\\ttype accumulation struct {\\n\\t\\trecurseAttr\\n\\t\\tprocs []*procBundle\\n\\t\\tprocIdxs []int\\n\\t}\\n\\n\\tplan.each(func(field protoreflect.FieldDescriptor, items []planItem) {\\n\\t\\tacc := accumulation{\\n\\t\\t\\tprocs: make([]*procBundle, 0, len(processors)),\\n\\t\\t\\tprocIdxs: make([]int, 0, len(processors)),\\n\\t\\t}\\n\\n\\t\\tvar copiedFieldPath reflectutil.Path\\n\\n\\t\\tfor _, item := range items {\\n\\t\\t\\tproc := processors[item.processorIdx]\\n\\n\\t\\t\\tif acc.recurseAttr.set(item.recurseAttr) {\\n\\t\\t\\t\\tacc.procs = append(acc.procs, processors[item.processorIdx])\\n\\t\\t\\t\\tacc.procIdxs = append(acc.procIdxs, item.processorIdx)\\n\\t\\t\\t}\\n\\n\\t\\t\\tif item.applies(msg.Has(field)) {\\n\\t\\t\\t\\tif data, applied := proc.fp.Process(field, msg); applied {\\n\\t\\t\\t\\t\\tif copiedFieldPath == nil {\\n\\t\\t\\t\\t\\t\\tcopiedFieldPath = make(reflectutil.Path, len(path)+1)\\n\\t\\t\\t\\t\\t\\tcopy(copiedFieldPath, path)\\n\\t\\t\\t\\t\\t\\tcopiedFieldPath[len(path)] = reflectutil.MustMakePathItem(field)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tret[item.processorIdx] = append(ret[item.processorIdx], Result{copiedFieldPath, data})\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif acc.recurseAttr != recurseNone {\\n\\t\\t\\trecursePath := append(path, reflectutil.MustMakePathItem(field))\\n\\n\\t\\t\\tswitch acc.recurseAttr {\\n\\t\\t\\tcase recurseRepeated:\\n\\t\\t\\t\\tlst := msg.Get(field).List()\\n\\t\\t\\t\\tfor i := 0; i < lst.Len(); i++ {\\n\\t\\t\\t\\t\\tfor procInnerIdx, rslts := range fieldsImpl(append(recursePath, reflectutil.MustMakePathItem(i)), lst.Get(i).Message(), acc.procs) {\\n\\t\\t\\t\\t\\t\\tprocIdx := acc.procIdxs[procInnerIdx]\\n\\t\\t\\t\\t\\t\\tret[procIdx] = append(ret[procIdx], rslts...)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase recurseOne:\\n\\t\\t\\t\\tif msg.Has(field) {\\n\\t\\t\\t\\t\\tfor procInnerIdx, rslts := range fieldsImpl(recursePath, msg.Get(field).Message(), acc.procs) {\\n\\t\\t\\t\\t\\t\\tprocIdx := acc.procIdxs[procInnerIdx]\\n\\t\\t\\t\\t\\t\\tret[procIdx] = append(ret[procIdx], rslts...)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tif !acc.recurseAttr.isMap() {\\n\\t\\t\\t\\t\\tpanic(\\\"impossible\\\")\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\treflectutil.MapRangeSorted(msg.Get(field).Map(), acc.recurseAttr.mapKeyKind(), func(mk protoreflect.MapKey, v protoreflect.Value) bool {\\n\\t\\t\\t\\t\\tfor procInnerIdx, rslts := range fieldsImpl(append(recursePath, reflectutil.MustMakePathItem(mk)), v.Message(), acc.procs) {\\n\\t\\t\\t\\t\\t\\tprocIdx := acc.procIdxs[procInnerIdx]\\n\\t\\t\\t\\t\\t\\tret[procIdx] = append(ret[procIdx], rslts...)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn true\\n\\t\\t\\t\\t})\\n\\t\\t\\t}\\n\\t\\t}\\n\\t})\\n\\n\\treturn ret\\n}\",\n \"func (e GetAllPortsRequestValidationError) Field() string { return e.field }\",\n \"func (e MoveObjectNextResponseValidationError) Field() string { return e.field }\",\n \"func (e RanparameterIdValidationError) Field() string { return e.field }\",\n \"func ProcessFunc(p Processor) {\\n\\tprocessor = p\\n}\",\n \"func ProcessFunc(p Processor) {\\n\\tprocessor = p\\n}\",\n \"func ToField(gatewayID, nodeID, sourceID, fieldID, payload string) error {\\n\\tif payload == model.ActionToggle {\\n\\t\\t// get field current data\\n\\t\\tfield, err := fieldAPI.GetByIDs(gatewayID, nodeID, sourceID, fieldID)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tif converterUtils.ToBool(field.Current.Value) {\\n\\t\\t\\tpayload = \\\"false\\\"\\n\\t\\t} else {\\n\\t\\t\\tpayload = \\\"true\\\"\\n\\t\\t}\\n\\t}\\n\\n\\tmsg := msgML.NewMessage(false)\\n\\tmsg.GatewayID = gatewayID\\n\\tmsg.NodeID = nodeID\\n\\tmsg.SourceID = sourceID\\n\\tpl := msgML.NewPayload()\\n\\tpl.Key = fieldID\\n\\tpl.Value = payload\\n\\tmsg.Payloads = append(msg.Payloads, pl)\\n\\tmsg.Type = msgML.TypeSet\\n\\treturn Post(&msg)\\n}\",\n \"func (x *fastReflection_EventRetire) NewField(fd protoreflect.FieldDescriptor) protoreflect.Value {\\n\\tswitch fd.FullName() {\\n\\tcase \\\"regen.ecocredit.v1alpha1.EventRetire.retirer\\\":\\n\\t\\treturn protoreflect.ValueOfString(\\\"\\\")\\n\\tcase \\\"regen.ecocredit.v1alpha1.EventRetire.batch_denom\\\":\\n\\t\\treturn protoreflect.ValueOfString(\\\"\\\")\\n\\tcase \\\"regen.ecocredit.v1alpha1.EventRetire.amount\\\":\\n\\t\\treturn protoreflect.ValueOfString(\\\"\\\")\\n\\tcase \\\"regen.ecocredit.v1alpha1.EventRetire.location\\\":\\n\\t\\treturn protoreflect.ValueOfString(\\\"\\\")\\n\\tdefault:\\n\\t\\tif fd.IsExtension() {\\n\\t\\t\\tpanic(fmt.Errorf(\\\"proto3 declared messages do not support extensions: regen.ecocredit.v1alpha1.EventRetire\\\"))\\n\\t\\t}\\n\\t\\tpanic(fmt.Errorf(\\\"message regen.ecocredit.v1alpha1.EventRetire does not contain field %s\\\", fd.FullName()))\\n\\t}\\n}\",\n \"func (e ResolveRequestValidationError) Field() string { return e.field }\",\n \"func (e ChargeCreditsRequestValidationError) Field() string { return e.field }\",\n \"func (e ProcessingResponseValidationError) Field() string { return e.field }\",\n \"func (db *Ffdb) QueryField(fieldname string, f FieldQueryFunc, d Direction) i.Forward {\\n\\tfieldname = strings.ToUpper(fieldname)\\n\\tif _, ok := db.fieldnames[fieldname]; !ok {\\n\\t\\tpanic(fmt.Errorf(\\\"Unknown field: %q\\\\n\\\", fieldname))\\n\\t}\\n\\treturn db.Query(func(itr i.Iterator) bool {\\n\\t\\tr, _ := itr.Value().(*Record)\\n\\t\\treturn f(r.Value(fieldname))\\n\\t}, d)\\n}\",\n \"func execmStructField(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(2)\\n\\tret := args[0].(*types.Struct).Field(args[1].(int))\\n\\tp.Ret(2, ret)\\n}\",\n \"func (o TableTimePartitioningPtrOutput) Field() pulumi.StringPtrOutput {\\n\\treturn o.ApplyT(func(v *TableTimePartitioning) *string {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Field\\n\\t}).(pulumi.StringPtrOutput)\\n}\",\n \"func (m *BusinessScenarioPlanner) GetFieldDeserializers()(map[string]func(i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode)(error)) {\\n res := m.Entity.GetFieldDeserializers()\\n res[\\\"planConfiguration\\\"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {\\n val, err := n.GetObjectValue(CreatePlannerPlanConfigurationFromDiscriminatorValue)\\n if err != nil {\\n return err\\n }\\n if val != nil {\\n m.SetPlanConfiguration(val.(PlannerPlanConfigurationable))\\n }\\n return nil\\n }\\n res[\\\"taskConfiguration\\\"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {\\n val, err := n.GetObjectValue(CreatePlannerTaskConfigurationFromDiscriminatorValue)\\n if err != nil {\\n return err\\n }\\n if val != nil {\\n m.SetTaskConfiguration(val.(PlannerTaskConfigurationable))\\n }\\n return nil\\n }\\n res[\\\"tasks\\\"] = func (n i878a80d2330e89d26896388a3f487eef27b0a0e6c010c493bf80be1452208f91.ParseNode) error {\\n val, err := n.GetCollectionOfObjectValues(CreateBusinessScenarioTaskFromDiscriminatorValue)\\n if err != nil {\\n return err\\n }\\n if val != nil {\\n res := make([]BusinessScenarioTaskable, len(val))\\n for i, v := range val {\\n if v != nil {\\n res[i] = v.(BusinessScenarioTaskable)\\n }\\n }\\n m.SetTasks(res)\\n }\\n return nil\\n }\\n return res\\n}\",\n \"func (k Querier) Plan(c context.Context, req *types.QueryPlanRequest) (*types.QueryPlanResponse, error) {\\n\\tif req == nil {\\n\\t\\treturn nil, status.Error(codes.InvalidArgument, \\\"invalid request\\\")\\n\\t}\\n\\n\\tctx := sdk.UnwrapSDKContext(c)\\n\\tplan, found := k.GetPlan(ctx, req.PlanId)\\n\\tif !found {\\n\\t\\treturn nil, status.Errorf(codes.NotFound, \\\"plan %d not found\\\", req.PlanId)\\n\\t}\\n\\n\\tany, err := codectypes.NewAnyWithValue(plan)\\n\\tif err != nil {\\n\\t\\treturn nil, status.Error(codes.Internal, err.Error())\\n\\t}\\n\\n\\treturn &types.QueryPlanResponse{Plan: any}, nil\\n}\",\n \"func (e CreatePurchaseRequestValidationError) Field() string { return e.field }\",\n \"func (f Unstructured) Field(field string) Fragment {\\n\\tif f.fields != nil {\\n\\t\\treturn f.fields[field]\\n\\t}\\n\\treturn nil\\n}\",\n \"func NewProcessor(provider metrics.Provider, lister ContainerAccessor, adapter MetricsAdapter, filter ContainerFilter) Processor {\\n\\treturn Processor{\\n\\t\\tmetricsProvider: provider,\\n\\t\\tctrLister: lister,\\n\\t\\tmetricsAdapter: adapter,\\n\\t\\tctrFilter: filter,\\n\\t\\textensions: map[string]ProcessorExtension{\\n\\t\\t\\tNetworkExtensionID: NewProcessorNetwork(),\\n\\t\\t},\\n\\t}\\n}\",\n \"func (e ShippingValidationError) Field() string { return e.field }\",\n \"func (e ChannelPayRequestValidationError) Field() string { return e.field }\",\n \"func (e MoveObjectRequestValidationError) Field() string { return e.field }\",\n \"func (e RanparameterDefItemValidationError) Field() string { return e.field }\",\n \"func (pr *prepareResult) parameterField(idx int) *p.ParameterField {\\n\\treturn pr.parameterFields[idx]\\n}\",\n \"func (e ProviderInfoValidationError) Field() string { return e.field }\",\n \"func (m *EventRSVPMutation) Field(name string) (ent.Value, bool) {\\n\\treturn nil, false\\n}\",\n \"func Field(v interface{}, name string) (*Fieldx, bool) {\\n\\treturn New(v).Field(name)\\n}\",\n \"func (m *PromotionMutation) Field(name string) (ent.Value, bool) {\\n\\tswitch name {\\n\\tcase promotion.FieldPromotionName:\\n\\t\\treturn m.PromotionName()\\n\\tcase promotion.FieldStartPromotion:\\n\\t\\treturn m.StartPromotion()\\n\\tcase promotion.FieldEndPromotion:\\n\\t\\treturn m.EndPromotion()\\n\\tcase promotion.FieldPrice:\\n\\t\\treturn m.Price()\\n\\t}\\n\\treturn nil, false\\n}\",\n \"func (m *DevelopperMutation) Field(name string) (ent.Value, bool) {\\n\\tswitch name {\\n\\tcase developper.FieldName:\\n\\t\\treturn m.Name()\\n\\tcase developper.FieldAge:\\n\\t\\treturn m.Age()\\n\\tcase developper.FieldSchool:\\n\\t\\treturn m.School()\\n\\tcase developper.FieldExperience:\\n\\t\\treturn m.Experience()\\n\\t}\\n\\treturn nil, false\\n}\",\n \"func (e CreateCardRequestValidationError) Field() string { return e.field }\",\n \"func (e E2SmRcPreRanfunctionDescriptionValidationError) Field() string { return e.field }\",\n \"func (r *resolution) ipField(res Result, field string) (bool, Result, error) {\\n\\tfip := field[4:]\\n\\tif strings.Contains(fip, \\\"/\\\") {\\n\\t\\t_, ipnet, err := net.ParseCIDR(fip)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn true, PermError, err\\n\\t\\t}\\n\\t\\tif ipnet.Contains(r.ip) {\\n\\t\\t\\treturn true, res, fmt.Errorf(\\\"matched %v\\\", ipnet)\\n\\t\\t}\\n\\t} else {\\n\\t\\tip := net.ParseIP(fip)\\n\\t\\tif ip == nil {\\n\\t\\t\\treturn true, PermError, fmt.Errorf(\\\"invalid ipX value\\\")\\n\\t\\t}\\n\\t\\tif ip.Equal(r.ip) {\\n\\t\\t\\treturn true, res, fmt.Errorf(\\\"matched %v\\\", ip)\\n\\t\\t}\\n\\t}\\n\\n\\treturn false, \\\"\\\", nil\\n}\",\n \"func (options *Options) Eval(ctx interface{}, field string) interface{} {\\n\\tif ctx == nil {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tif field == \\\"\\\" {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tval := options.eval.evalField(reflect.ValueOf(ctx), field, false)\\n\\tif !val.IsValid() {\\n\\t\\treturn nil\\n\\t}\\n\\n\\treturn val.Interface()\\n}\",\n \"func (e CreatePaymentResponseValidationError) Field() string { return e.field }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5850106","0.5793708","0.56735563","0.55634314","0.5539706","0.55268276","0.5526053","0.54968065","0.54968065","0.54968065","0.5472559","0.5347481","0.5298575","0.5290777","0.5278102","0.52667516","0.5232726","0.52285284","0.52179766","0.5164068","0.5136627","0.5129303","0.51287764","0.5127369","0.50976515","0.50891143","0.5039721","0.5032713","0.5026687","0.5025624","0.5025429","0.50182265","0.5012343","0.50004125","0.49938288","0.49828142","0.49782732","0.49700376","0.4969944","0.49622664","0.4961438","0.49554744","0.49394658","0.49319527","0.4930919","0.4928348","0.49237987","0.49226028","0.4921518","0.491412","0.4911531","0.49109855","0.49106577","0.49106345","0.4905736","0.49030212","0.49023905","0.4898267","0.48905778","0.48898417","0.48849264","0.4869321","0.486853","0.48672825","0.48661876","0.48655128","0.4857302","0.48477903","0.4838891","0.48243338","0.48243296","0.48243296","0.48237473","0.48136747","0.48117957","0.48117602","0.4808476","0.47995192","0.4798346","0.47971377","0.47897252","0.4789478","0.47892383","0.4787346","0.47801265","0.47779495","0.47775757","0.47700658","0.47696888","0.47653282","0.47642896","0.47626138","0.47625872","0.47605932","0.47565305","0.47555324","0.47528657","0.47527125","0.47450042","0.47422114"],"string":"[\n \"0.5850106\",\n \"0.5793708\",\n \"0.56735563\",\n \"0.55634314\",\n \"0.5539706\",\n \"0.55268276\",\n \"0.5526053\",\n \"0.54968065\",\n \"0.54968065\",\n \"0.54968065\",\n \"0.5472559\",\n \"0.5347481\",\n \"0.5298575\",\n \"0.5290777\",\n \"0.5278102\",\n \"0.52667516\",\n \"0.5232726\",\n \"0.52285284\",\n \"0.52179766\",\n \"0.5164068\",\n \"0.5136627\",\n \"0.5129303\",\n \"0.51287764\",\n \"0.5127369\",\n \"0.50976515\",\n \"0.50891143\",\n \"0.5039721\",\n \"0.5032713\",\n \"0.5026687\",\n \"0.5025624\",\n \"0.5025429\",\n \"0.50182265\",\n \"0.5012343\",\n \"0.50004125\",\n \"0.49938288\",\n \"0.49828142\",\n \"0.49782732\",\n \"0.49700376\",\n \"0.4969944\",\n \"0.49622664\",\n \"0.4961438\",\n \"0.49554744\",\n \"0.49394658\",\n \"0.49319527\",\n \"0.4930919\",\n \"0.4928348\",\n \"0.49237987\",\n \"0.49226028\",\n \"0.4921518\",\n \"0.491412\",\n \"0.4911531\",\n \"0.49109855\",\n \"0.49106577\",\n \"0.49106345\",\n \"0.4905736\",\n \"0.49030212\",\n \"0.49023905\",\n \"0.4898267\",\n \"0.48905778\",\n \"0.48898417\",\n \"0.48849264\",\n \"0.4869321\",\n \"0.486853\",\n \"0.48672825\",\n \"0.48661876\",\n \"0.48655128\",\n \"0.4857302\",\n \"0.48477903\",\n \"0.4838891\",\n \"0.48243338\",\n \"0.48243296\",\n \"0.48243296\",\n \"0.48237473\",\n \"0.48136747\",\n \"0.48117957\",\n \"0.48117602\",\n \"0.4808476\",\n \"0.47995192\",\n \"0.4798346\",\n \"0.47971377\",\n \"0.47897252\",\n \"0.4789478\",\n \"0.47892383\",\n \"0.4787346\",\n \"0.47801265\",\n \"0.47779495\",\n \"0.47775757\",\n \"0.47700658\",\n \"0.47696888\",\n \"0.47653282\",\n \"0.47642896\",\n \"0.47626138\",\n \"0.47625872\",\n \"0.47605932\",\n \"0.47565305\",\n \"0.47555324\",\n \"0.47528657\",\n \"0.47527125\",\n \"0.47450042\",\n \"0.47422114\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7988916"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":2795,"cells":{"query":{"kind":"string","value":"planExpr returns a processor for an expression."},"document":{"kind":"string","value":"func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\n\tswitch expr := expr.(type) {\n\tcase *VarRef:\n\t\tpanic(\"TODO\")\n\tcase *Call:\n\t\treturn p.planCall(e, expr)\n\tcase *BinaryExpr:\n\t\treturn p.planBinaryExpr(e, expr)\n\tcase *ParenExpr:\n\t\treturn p.planExpr(e, expr.Expr)\n\tcase *NumberLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *StringLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *BooleanLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *TimeLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *DurationLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\t}\n\tpanic(\"unreachable\")\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (p *ExecutionPlanner) compileExpr(expr parser.Expr) (_ types.PlanExpression, err error) {\n\tif expr == nil {\n\t\treturn nil, nil\n\t}\n\n\tswitch expr := expr.(type) {\n\tcase *parser.BinaryExpr:\n\t\treturn p.compileBinaryExpr(expr)\n\n\tcase *parser.BoolLit:\n\t\treturn newBoolLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.Call:\n\t\treturn p.compileCallExpr(expr)\n\n\tcase *parser.CastExpr:\n\t\tcastExpr, err := p.compileExpr(expr.X)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tdataType, err := dataTypeFromParserType(expr.Type)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newCastPlanExpression(castExpr, dataType), nil\n\n\tcase *parser.Exists:\n\t\treturn nil, sql3.NewErrInternal(\"exists expressions are not supported\")\n\n\tcase *parser.ExprList:\n\t\texprList := []types.PlanExpression{}\n\t\tfor _, e := range expr.Exprs {\n\t\t\tlistExpr, err := p.compileExpr(e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\texprList = append(exprList, listExpr)\n\t\t}\n\t\treturn newExprListExpression(exprList), nil\n\n\tcase *parser.SetLiteralExpr:\n\t\texprList := []types.PlanExpression{}\n\t\tfor _, e := range expr.Members {\n\t\t\tlistExpr, err := p.compileExpr(e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\texprList = append(exprList, listExpr)\n\t\t}\n\t\treturn newExprSetLiteralPlanExpression(exprList, expr.DataType()), nil\n\n\tcase *parser.TupleLiteralExpr:\n\t\texprList := []types.PlanExpression{}\n\t\tfor _, e := range expr.Members {\n\t\t\tlistExpr, err := p.compileExpr(e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\texprList = append(exprList, listExpr)\n\t\t}\n\t\treturn newExprTupleLiteralPlanExpression(exprList, expr.DataType()), nil\n\n\tcase *parser.Ident:\n\t\treturn nil, sql3.NewErrInternal(\"identifiers are not supported\")\n\n\tcase *parser.NullLit:\n\t\treturn newNullLiteralPlanExpression(), nil\n\n\tcase *parser.IntegerLit:\n\t\treturn newIntLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.FloatLit:\n\t\treturn newFloatLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.DateLit:\n\t\treturn newDateLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.ParenExpr:\n\t\treturn p.compileExpr(expr.X)\n\n\tcase *parser.QualifiedRef:\n\t\tref := newQualifiedRefPlanExpression(parser.IdentName(expr.Table), parser.IdentName(expr.Column), expr.ColumnIndex, expr.DataType())\n\t\tp.addReference(ref)\n\t\treturn ref, nil\n\n\tcase *parser.Range:\n\t\tlhs, err := p.compileExpr(expr.X)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\trhs, err := p.compileExpr(expr.Y)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newRangeOpPlanExpression(lhs, rhs, expr.ResultDataType), nil\n\n\tcase *parser.StringLit:\n\t\treturn newStringLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.UnaryExpr:\n\t\treturn p.compileUnaryExpr(expr)\n\n\tcase *parser.CaseExpr:\n\t\toperand, err := p.compileExpr(expr.Operand)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tblocks := []types.PlanExpression{}\n\t\tfor _, b := range expr.Blocks {\n\t\t\tblock, err := p.compileExpr(b)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tblocks = append(blocks, block)\n\t\t}\n\n\t\telseExpr, err := p.compileExpr(expr.ElseExpr)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newCasePlanExpression(operand, blocks, elseExpr, expr.DataType()), nil\n\n\tcase *parser.CaseBlock:\n\n\t\tcondition, err := p.compileExpr(expr.Condition)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tbody, err := p.compileExpr(expr.Body)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newCaseBlockPlanExpression(condition, body), nil\n\n\tcase *parser.SelectStatement:\n\t\tselOp, err := p.compileSelectStatement(expr, true)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newSubqueryPlanExpression(selOp), nil\n\n\tdefault:\n\t\treturn nil, sql3.NewErrInternalf(\"unexpected SQL expression type: %T\", expr)\n\t}\n}","func (p *Planner) planBinaryExpr(e *Executor, expr *BinaryExpr) (processor, error) {\n\t// Create processor for LHS.\n\tlhs, err := p.planExpr(e, expr.LHS)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"lhs: %s\", err)\n\t}\n\n\t// Create processor for RHS.\n\trhs, err := p.planExpr(e, expr.RHS)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"rhs: %s\", err)\n\t}\n\n\t// Combine processors.\n\treturn newBinaryExprEvaluator(e, expr.Op, lhs, rhs), nil\n}","func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {\n\t// Ensure there is a single argument.\n\tif len(c.Args) != 1 {\n\t\treturn nil, fmt.Errorf(\"expected one argument for %s()\", c.Name)\n\t}\n\n\t// Ensure the argument is a variable reference.\n\tref, ok := c.Args[0].(*VarRef)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"expected field argument in %s()\", c.Name)\n\t}\n\n\t// Extract the substatement for the call.\n\tsub, err := e.stmt.Substatement(ref)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tname := sub.Source.(*Measurement).Name\n\n\t// Extract tags from conditional.\n\ttags := make(map[string]string)\n\tcondition, err := p.extractTags(name, sub.Condition, tags)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tsub.Condition = condition\n\n\t// Find field.\n\tfname := strings.TrimPrefix(ref.Val, name+\".\")\n\tfieldID, typ := e.db.Field(name, fname)\n\tif fieldID == 0 {\n\t\treturn nil, fmt.Errorf(\"field not found: %s.%s\", name, fname)\n\t}\n\n\t// Generate a reducer for the given function.\n\tr := newReducer(e)\n\tr.stmt = sub\n\n\t// Retrieve a list of series data ids.\n\tseriesIDs := p.DB.MatchSeries(name, tags)\n\n\t// Generate mappers for each id.\n\tr.mappers = make([]*mapper, len(seriesIDs))\n\tfor i, seriesID := range seriesIDs {\n\t\tm := newMapper(e, seriesID, fieldID, typ)\n\t\tm.min, m.max = e.min.UnixNano(), e.max.UnixNano()\n\t\tm.interval = int64(e.interval)\n\t\tm.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)\n\t\tr.mappers[i] = m\n\t}\n\n\t// Set the appropriate reducer function.\n\tswitch strings.ToLower(c.Name) {\n\tcase \"count\":\n\t\tr.fn = reduceSum\n\t\tfor _, m := range r.mappers {\n\t\t\tm.fn = mapCount\n\t\t}\n\tcase \"sum\":\n\t\tr.fn = reduceSum\n\t\tfor _, m := range r.mappers {\n\t\t\tm.fn = mapSum\n\t\t}\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"function not found: %q\", c.Name)\n\t}\n\n\treturn r, nil\n}","func planFilterExpr(\n\tctx context.Context,\n\tflowCtx *execinfra.FlowCtx,\n\tevalCtx *tree.EvalContext,\n\tinput colexecop.Operator,\n\tcolumnTypes []*types.T,\n\tfilter execinfrapb.Expression,\n\tacc *mon.BoundAccount,\n\tfactory coldata.ColumnFactory,\n\thelper *colexecargs.ExprHelper,\n) (colexecop.Operator, error) {\n\tsemaCtx := flowCtx.TypeResolverFactory.NewSemaContext(evalCtx.Txn)\n\texpr, err := helper.ProcessExpr(filter, semaCtx, evalCtx, columnTypes)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif expr == tree.DNull {\n\t\t// The filter expression is tree.DNull meaning that it is always false, so\n\t\t// we put a zero operator.\n\t\treturn colexecutils.NewZeroOp(input), nil\n\t}\n\top, _, filterColumnTypes, err := planSelectionOperators(\n\t\tctx, evalCtx, expr, columnTypes, input, acc, factory,\n\t)\n\tif err != nil {\n\t\treturn nil, errors.Wrapf(err, \"unable to columnarize filter expression %q\", filter)\n\t}\n\tif len(filterColumnTypes) > len(columnTypes) {\n\t\t// Additional columns were appended to store projections while\n\t\t// evaluating the filter. Project them away.\n\t\tvar outputColumns []uint32\n\t\tfor i := range columnTypes {\n\t\t\toutputColumns = append(outputColumns, uint32(i))\n\t\t}\n\t\top = colexecbase.NewSimpleProjectOp(op, len(filterColumnTypes), outputColumns)\n\t}\n\treturn op, nil\n}","func (p *Planner) planField(e *Executor, f *Field) (processor, error) {\n\treturn p.planExpr(e, f.Expr)\n}","func (fr *Frame) EvalExpr(a T) (result T) {\n\treturn fr.ParseExpression(a.String())\n}","func (c *compiledField) compileExpr(expr influxql.Expr) error {\n\tswitch expr := expr.(type) {\n\tcase *influxql.VarRef:\n\t\t// A bare variable reference will require auxiliary fields.\n\t\tc.global.HasAuxiliaryFields = true\n\t\treturn nil\n\tcase *influxql.Wildcard:\n\t\t// Wildcards use auxiliary fields. We assume there will be at least one\n\t\t// expansion.\n\t\tc.global.HasAuxiliaryFields = true\n\t\tif !c.AllowWildcard {\n\t\t\treturn errors.New(\"unable to use wildcard in a binary expression\")\n\t\t}\n\t\treturn nil\n\tcase *influxql.RegexLiteral:\n\t\tif !c.AllowWildcard {\n\t\t\treturn errors.New(\"unable to use regex in a binary expression\")\n\t\t}\n\t\tc.global.HasAuxiliaryFields = true\n\t\treturn nil\n\tcase *influxql.Call:\n\t\tif isMathFunction(expr) {\n\t\t\treturn c.compileMathFunction(expr)\n\t\t}\n\n\t\t// Register the function call in the list of function calls.\n\t\tc.global.FunctionCalls = append(c.global.FunctionCalls, expr)\n\n\t\tswitch expr.Name {\n\t\tcase \"percentile\":\n\t\t\treturn c.compilePercentile(expr.Args)\n\t\tcase \"sample\":\n\t\t\treturn c.compileSample(expr.Args)\n\t\tcase \"distinct\":\n\t\t\treturn c.compileDistinct(expr.Args, false)\n\t\tcase \"top\", \"bottom\":\n\t\t\treturn c.compileTopBottom(expr)\n\t\tcase \"derivative\", \"non_negative_derivative\":\n\t\t\tisNonNegative := expr.Name == \"non_negative_derivative\"\n\t\t\treturn c.compileDerivative(expr.Args, isNonNegative)\n\t\tcase \"difference\", \"non_negative_difference\":\n\t\t\tisNonNegative := expr.Name == \"non_negative_difference\"\n\t\t\treturn c.compileDifference(expr.Args, isNonNegative)\n\t\tcase \"cumulative_sum\":\n\t\t\treturn c.compileCumulativeSum(expr.Args)\n\t\tcase \"moving_average\":\n\t\t\treturn c.compileMovingAverage(expr.Args)\n\t\tcase \"exponential_moving_average\", \"double_exponential_moving_average\", \"triple_exponential_moving_average\", \"relative_strength_index\", \"triple_exponential_derivative\":\n\t\t\treturn c.compileExponentialMovingAverage(expr.Name, expr.Args)\n\t\tcase \"kaufmans_efficiency_ratio\", \"kaufmans_adaptive_moving_average\":\n\t\t\treturn c.compileKaufmans(expr.Name, expr.Args)\n\t\tcase \"chande_momentum_oscillator\":\n\t\t\treturn c.compileChandeMomentumOscillator(expr.Args)\n\t\tcase \"elapsed\":\n\t\t\treturn c.compileElapsed(expr.Args)\n\t\tcase \"integral\":\n\t\t\treturn c.compileIntegral(expr.Args)\n\t\tcase \"holt_winters\", \"holt_winters_with_fit\":\n\t\t\twithFit := expr.Name == \"holt_winters_with_fit\"\n\t\t\treturn c.compileHoltWinters(expr.Args, withFit)\n\t\tdefault:\n\t\t\treturn c.compileFunction(expr)\n\t\t}\n\tcase *influxql.Distinct:\n\t\tcall := expr.NewCall()\n\t\tc.global.FunctionCalls = append(c.global.FunctionCalls, call)\n\t\treturn c.compileDistinct(call.Args, false)\n\tcase *influxql.BinaryExpr:\n\t\t// Disallow wildcards in binary expressions. RewriteFields, which expands\n\t\t// wildcards, is too complicated if we allow wildcards inside of expressions.\n\t\tc.AllowWildcard = false\n\n\t\t// Check if either side is a literal so we only compile one side if it is.\n\t\tif _, ok := expr.LHS.(influxql.Literal); ok {\n\t\t\tif _, ok := expr.RHS.(influxql.Literal); ok {\n\t\t\t\treturn errors.New(\"cannot perform a binary expression on two literals\")\n\t\t\t}\n\t\t\treturn c.compileExpr(expr.RHS)\n\t\t} else if _, ok := expr.RHS.(influxql.Literal); ok {\n\t\t\treturn c.compileExpr(expr.LHS)\n\t\t} else {\n\t\t\t// Validate both sides of the expression.\n\t\t\tif err := c.compileExpr(expr.LHS); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif err := c.compileExpr(expr.RHS); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\treturn nil\n\t\t}\n\tcase *influxql.ParenExpr:\n\t\treturn c.compileExpr(expr.Expr)\n\tcase influxql.Literal:\n\t\treturn errors.New(\"field must contain at least one variable\")\n\t}\n\treturn errors.New(\"unimplemented\")\n}","func execParseExpr(_ int, p *gop.Context) {\n\targs := p.GetArgs(1)\n\tret, ret1 := parser.ParseExpr(args[0].(string))\n\tp.Ret(1, ret, ret1)\n}","func makePlanValue(n sqlparser.Expr) (*sqltypes.PlanValue, error) {\n\tvalue, err := sqlparser.NewPlanValue(n)\n\tif err != nil {\n\t\t// if we are unable to create a PlanValue, we can't use a vindex, but we don't have to fail\n\t\tif strings.Contains(err.Error(), \"expression is too complex\") {\n\t\t\treturn nil, nil\n\t\t}\n\t\t// something else went wrong, return the error\n\t\treturn nil, err\n\t}\n\treturn &value, nil\n}","func (p *Project) Plan() *ExecPlan {\n\treturn NewExecPlan(p)\n}","func (fr *Frame) EvalExpr(a T) (result T) {\n\t// Optimization: It's already a number.\n\tif a.IsQuickNumber() {\n\t\treturn a\n\t}\n\n\ts := a.String()\n\t// Optimization: \"0\" and \"1\"\n\tif len(s) == 1 {\n\t\tif s == \"0\" {\n\t\t\treturn False\n\t\t}\n\t\tif s == \"1\" {\n\t\t\treturn True\n\t\t}\n\t}\n\n\treturn fr.ParseExpression(s)\n}","func (c *Compiler) Compile(expr string) (*runtime.Program, error) {\n\tprogAST, err := parser.Parse(expr)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, pass := range context.Passes {\n\t\terr = progAST.RunPass(c.ctx, pass)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tprog := c.ctx.Builder.Build()\n\tprog.ResultType = progAST.Type()\n\treturn prog, nil\n}","func planProjectionOperators(\n\tctx context.Context,\n\tevalCtx *tree.EvalContext,\n\texpr tree.TypedExpr,\n\tcolumnTypes []*types.T,\n\tinput colexecop.Operator,\n\tacc *mon.BoundAccount,\n\tfactory coldata.ColumnFactory,\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\n\t// projectDatum is a helper function that adds a new constant projection\n\t// operator for the given datum. typs are updated accordingly.\n\tprojectDatum := func(datum tree.Datum) (colexecop.Operator, error) {\n\t\tresultIdx = len(columnTypes)\n\t\tdatumType := datum.ResolvedType()\n\t\ttyps = appendOneType(columnTypes, datumType)\n\t\tif datumType.Family() == types.UnknownFamily {\n\t\t\t// We handle Unknown type by planning a special constant null\n\t\t\t// operator.\n\t\t\treturn colexecbase.NewConstNullOp(colmem.NewAllocator(ctx, acc, factory), input, resultIdx), nil\n\t\t}\n\t\tconstVal := colconv.GetDatumToPhysicalFn(datumType)(datum)\n\t\treturn colexecbase.NewConstOp(colmem.NewAllocator(ctx, acc, factory), input, datumType, constVal, resultIdx)\n\t}\n\tresultIdx = -1\n\tswitch t := expr.(type) {\n\tcase *tree.IndexedVar:\n\t\treturn input, t.Idx, columnTypes, nil\n\tcase *tree.ComparisonExpr:\n\t\treturn planProjectionExpr(\n\t\t\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\n\t\t\tcolumnTypes, input, acc, factory, nil /* binFn */, t,\n\t\t)\n\tcase *tree.BinaryExpr:\n\t\tif err = checkSupportedBinaryExpr(t.TypedLeft(), t.TypedRight(), t.ResolvedType()); err != nil {\n\t\t\treturn op, resultIdx, typs, err\n\t\t}\n\t\treturn planProjectionExpr(\n\t\t\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\n\t\t\tcolumnTypes, input, acc, factory, t.Fn.Fn, nil, /* cmpExpr */\n\t\t)\n\tcase *tree.IsNullExpr:\n\t\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, false /* negate */, factory)\n\tcase *tree.IsNotNullExpr:\n\t\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, true /* negate */, factory)\n\tcase *tree.CastExpr:\n\t\texpr := t.Expr.(tree.TypedExpr)\n\t\top, resultIdx, typs, err = planProjectionOperators(\n\t\t\tctx, evalCtx, expr, columnTypes, input, acc, factory,\n\t\t)\n\t\tif err != nil {\n\t\t\treturn nil, 0, nil, err\n\t\t}\n\t\top, resultIdx, typs, err = planCastOperator(ctx, acc, typs, op, resultIdx, expr.ResolvedType(), t.ResolvedType(), factory)\n\t\treturn op, resultIdx, typs, err\n\tcase *tree.FuncExpr:\n\t\tvar inputCols []int\n\t\ttyps = make([]*types.T, len(columnTypes))\n\t\tcopy(typs, columnTypes)\n\t\top = input\n\t\tfor _, e := range t.Exprs {\n\t\t\tvar err error\n\t\t\t// TODO(rohany): This could be done better, especially in the case\n\t\t\t// of constant arguments, because the vectorized engine right now\n\t\t\t// creates a new column full of the constant value.\n\t\t\top, resultIdx, typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, e.(tree.TypedExpr), typs, op, acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, nil, err\n\t\t\t}\n\t\t\tinputCols = append(inputCols, resultIdx)\n\t\t}\n\t\tresultIdx = len(typs)\n\t\top, err = colexec.NewBuiltinFunctionOperator(\n\t\t\tcolmem.NewAllocator(ctx, acc, factory), evalCtx, t, typs, inputCols, resultIdx, op,\n\t\t)\n\t\ttyps = appendOneType(typs, t.ResolvedType())\n\t\treturn op, resultIdx, typs, err\n\tcase tree.Datum:\n\t\top, err = projectDatum(t)\n\t\treturn op, resultIdx, typs, err\n\tcase *tree.Tuple:\n\t\tisConstTuple := true\n\t\tfor _, expr := range t.Exprs {\n\t\t\tif _, isDatum := expr.(tree.Datum); !isDatum {\n\t\t\t\tisConstTuple = false\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif isConstTuple {\n\t\t\t// Tuple expression is a constant, so we can evaluate it and\n\t\t\t// project the resulting datum.\n\t\t\ttuple, err := t.Eval(evalCtx)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t\top, err = projectDatum(tuple)\n\t\t\treturn op, resultIdx, typs, err\n\t\t}\n\t\toutputType := t.ResolvedType()\n\t\ttyps = make([]*types.T, len(columnTypes))\n\t\tcopy(typs, columnTypes)\n\t\ttupleContentsIdxs := make([]int, len(t.Exprs))\n\t\tfor i, expr := range t.Exprs {\n\t\t\tinput, tupleContentsIdxs[i], typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, expr.(tree.TypedExpr), typs, input, acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t}\n\t\tresultIdx = len(typs)\n\t\top = colexec.NewTupleProjOp(\n\t\t\tcolmem.NewAllocator(ctx, acc, factory), typs, tupleContentsIdxs, outputType, input, resultIdx,\n\t\t)\n\t\ttyps = appendOneType(typs, outputType)\n\t\treturn op, resultIdx, typs, err\n\tcase *tree.CaseExpr:\n\t\tif t.Expr != nil {\n\t\t\treturn nil, resultIdx, typs, errors.New(\"CASE <expr> WHEN expressions unsupported\")\n\t\t}\n\n\t\tallocator := colmem.NewAllocator(ctx, acc, factory)\n\t\tcaseOutputType := t.ResolvedType()\n\t\tif typeconv.TypeFamilyToCanonicalTypeFamily(caseOutputType.Family()) == types.BytesFamily {\n\t\t\t// Currently, there is a contradiction between the way CASE operator\n\t\t\t// works (which populates its output in arbitrary order) and the\n\t\t\t// flat bytes implementation of Bytes type (which prohibits sets in\n\t\t\t// arbitrary order), so we reject such scenario to fall back to\n\t\t\t// row-by-row engine.\n\t\t\treturn nil, resultIdx, typs, errors.Newf(\n\t\t\t\t\"unsupported type %s in CASE operator\", caseOutputType)\n\t\t}\n\t\tcaseOutputIdx := len(columnTypes)\n\t\t// We don't know the schema yet and will update it below, right before\n\t\t// instantiating caseOp. The same goes for subsetEndIdx.\n\t\tschemaEnforcer := colexecutils.NewBatchSchemaSubsetEnforcer(\n\t\t\tallocator, input, nil /* typs */, caseOutputIdx, -1, /* subsetEndIdx */\n\t\t)\n\t\tbuffer := colexec.NewBufferOp(schemaEnforcer)\n\t\tcaseOps := make([]colexecop.Operator, len(t.Whens))\n\t\ttyps = appendOneType(columnTypes, caseOutputType)\n\t\tthenIdxs := make([]int, len(t.Whens)+1)\n\t\tfor i, when := range t.Whens {\n\t\t\t// The case operator is assembled from n WHEN arms, n THEN arms, and\n\t\t\t// an ELSE arm. Each WHEN arm is a boolean projection. Each THEN arm\n\t\t\t// (and the ELSE arm) is a projection of the type of the CASE\n\t\t\t// expression. We set up each WHEN arm to write its output to a\n\t\t\t// fresh column, and likewise for the THEN arms and the ELSE arm.\n\t\t\t// Each WHEN arm individually acts on the single input batch from\n\t\t\t// the CaseExpr's input and is then transformed into a selection\n\t\t\t// vector, after which the THEN arm runs to create the output just\n\t\t\t// for the tuples that matched the WHEN arm. Each subsequent WHEN\n\t\t\t// arm will use the inverse of the selection vector to avoid running\n\t\t\t// the WHEN projection on tuples that have already been matched by a\n\t\t\t// previous WHEN arm. Finally, after each WHEN arm runs, we copy the\n\t\t\t// results of the WHEN into a single output vector, assembling the\n\t\t\t// final result of the case projection.\n\t\t\twhenTyped := when.Cond.(tree.TypedExpr)\n\t\t\tcaseOps[i], resultIdx, typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, whenTyped, typs, buffer, acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t\tcaseOps[i], err = colexecutils.BoolOrUnknownToSelOp(caseOps[i], typs, resultIdx)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\n\t\t\t// Run the \"then\" clause on those tuples that were selected.\n\t\t\tcaseOps[i], thenIdxs[i], typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, when.Val.(tree.TypedExpr), typs, caseOps[i], acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t\tif !typs[thenIdxs[i]].Identical(typs[caseOutputIdx]) {\n\t\t\t\t// It is possible that the projection of this THEN arm has\n\t\t\t\t// different column type (for example, we expect INT2, but INT8\n\t\t\t\t// is given). In such case, we need to plan a cast.\n\t\t\t\tfromType, toType := typs[thenIdxs[i]], typs[caseOutputIdx]\n\t\t\t\tcaseOps[i], thenIdxs[i], typs, err = planCastOperator(\n\t\t\t\t\tctx, acc, typs, caseOps[i], thenIdxs[i], fromType, toType, factory,\n\t\t\t\t)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvar elseOp colexecop.Operator\n\t\telseExpr := t.Else\n\t\tif elseExpr == nil {\n\t\t\t// If there's no ELSE arm, we write NULLs.\n\t\t\telseExpr = tree.DNull\n\t\t}\n\t\telseOp, thenIdxs[len(t.Whens)], typs, err = planProjectionOperators(\n\t\t\tctx, evalCtx, elseExpr.(tree.TypedExpr), typs, buffer, acc, factory,\n\t\t)\n\t\tif err != nil {\n\t\t\treturn nil, resultIdx, typs, err\n\t\t}\n\t\tif !typs[thenIdxs[len(t.Whens)]].Identical(typs[caseOutputIdx]) {\n\t\t\t// It is possible that the projection of the ELSE arm has different\n\t\t\t// column type (for example, we expect INT2, but INT8 is given). In\n\t\t\t// such case, we need to plan a cast.\n\t\t\telseIdx := thenIdxs[len(t.Whens)]\n\t\t\tfromType, toType := typs[elseIdx], typs[caseOutputIdx]\n\t\t\telseOp, thenIdxs[len(t.Whens)], typs, err = planCastOperator(\n\t\t\t\tctx, acc, typs, elseOp, elseIdx, fromType, toType, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t}\n\n\t\tschemaEnforcer.SetTypes(typs)\n\t\top := colexec.NewCaseOp(allocator, buffer, caseOps, elseOp, thenIdxs, caseOutputIdx, caseOutputType)\n\t\treturn op, caseOutputIdx, typs, err\n\tcase *tree.AndExpr, *tree.OrExpr:\n\t\treturn planLogicalProjectionOp(ctx, evalCtx, expr, columnTypes, input, acc, factory)\n\tdefault:\n\t\treturn nil, resultIdx, nil, errors.Errorf(\"unhandled projection expression type: %s\", reflect.TypeOf(t))\n\t}\n}","func (l *logicalPlanner) Plan(ctx context.Context, logicalPlan *Spec) (*Spec, error) {\n\tnewLogicalPlan, err := l.heuristicPlanner.Plan(ctx, logicalPlan)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// check integrity after planning is complete\n\tif !l.disableIntegrityChecks {\n\t\terr := newLogicalPlan.CheckIntegrity()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\treturn newLogicalPlan, nil\n}","func resolveExpression(ctx *sql.Context, expression string, sch schema.Schema, tableName string) (sql.Expression, error) {\n\tquery := fmt.Sprintf(\"SELECT %s from %s.%s\", expression, \"mydb\", tableName)\n\tsqlSch, err := sqlutil.FromDoltSchema(tableName, sch)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tmockTable := memory.NewTable(tableName, sqlSch, nil)\n\tmockDatabase := memory.NewDatabase(\"mydb\")\n\tmockDatabase.AddTable(tableName, mockTable)\n\tmockProvider := memory.NewDBProvider(mockDatabase)\n\tcatalog := analyzer.NewCatalog(mockProvider)\n\n\tpseudoAnalyzedQuery, err := planbuilder.Parse(ctx, catalog, query)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar expr sql.Expression\n\ttransform.Inspect(pseudoAnalyzedQuery, func(n sql.Node) bool {\n\t\tif projector, ok := n.(sql.Projector); ok {\n\t\t\texpr = projector.ProjectedExprs()[0]\n\t\t\treturn false\n\t\t}\n\t\treturn true\n\t})\n\tif expr == nil {\n\t\treturn nil, fmt.Errorf(\"unable to find expression in analyzed query\")\n\t}\n\n\treturn expr, nil\n}","func (i *Interpreter) interpretExpr(expr ast.Expr) interface{} {\n\tswitch t := expr.(type) {\n\n\tcase *ast.AssignmentExpr:\n\t\treturn i.interpretAssignmentExpr(t)\n\n\tcase *ast.BinaryExpr:\n\t\treturn i.interpretBinaryExpr(t)\n\n\tcase *ast.CallExpr:\n\t\treturn i.interpretCallExpr(t)\n\n\tcase *ast.GetExpr:\n\t\treturn i.interpretGetExpr(t)\n\n\tcase *ast.GroupingExpr:\n\t\treturn i.interpretGroupingExpr(t)\n\n\tcase *ast.LiteralExpr:\n\t\treturn i.interpretLiteralExpr(t)\n\n\tcase *ast.LogicalExpr:\n\t\treturn i.interpretLogicalExpr(t)\n\n\tcase *ast.SetExpr:\n\t\treturn i.interpretSetExpr(t)\n\n\tcase *ast.ThisExpr:\n\t\treturn i.interpretThisExpr(t)\n\n\tcase *ast.UnaryExpr:\n\t\treturn i.interpretUnaryExpr(t)\n\n\tcase *ast.VariableExpr:\n\t\treturn i.interpretVariableExpr(t)\n\n\tdefault:\n\t\treturn nil\n\t}\n}","func compileExpr(compiledFunc *CompiledFunc, expr ast.Node) (string, string, error) {\n\tswitch e := expr.(type) {\n\tcase *ast.Literal:\n\t\treturns := compiledFunc.nextRegister()\n\t\tcompiledFunc.append(&instruction.Assign{\n\t\t\tVariableName: returns,\n\t\t\tValue: e,\n\t\t})\n\n\t\treturn returns, e.Kind, nil\n\n\tcase *ast.Array:\n\t\treturns, err := compileArray(compiledFunc, e)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\n\t\t// TODO(elliot): Doesn't return type.\n\t\treturn returns, \"[]\", nil\n\n\tcase *ast.Map:\n\t\treturns, err := compileMap(compiledFunc, e)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\n\t\t// TODO(elliot): Doesn't return type.\n\t\treturn returns, \"{}\", nil\n\n\tcase *ast.Call:\n\t\tresult, err := compileCall(compiledFunc, e)\n\t\tif err != nil {\n\t\t\treturn \"\", \"\", err\n\t\t}\n\n\t\t// TODO(elliot): Doesn't return kind.\n\t\treturn result, \"\", nil\n\n\tcase *ast.Identifier:\n\t\tif v, ok := compiledFunc.variables[e.Name]; ok {\n\t\t\treturn e.Name, v, nil\n\t\t}\n\n\t\treturn \"\", \"\", fmt.Errorf(\"undefined variable: %s\", e.Name)\n\n\tcase *ast.Binary:\n\t\treturn compileBinary(compiledFunc, e)\n\n\tcase *ast.Group:\n\t\treturn compileExpr(compiledFunc, e.Expr)\n\n\tcase *ast.Unary:\n\t\treturn compileUnary(compiledFunc, e)\n\n\tcase *ast.Key:\n\t\treturn compileKey(compiledFunc, e)\n\t}\n\n\tpanic(expr)\n}","func (r *postProcessResult) planPostProcessSpec(\n\tctx context.Context,\n\tflowCtx *execinfra.FlowCtx,\n\tevalCtx *tree.EvalContext,\n\targs *colexecargs.NewColOperatorArgs,\n\tpost *execinfrapb.PostProcessSpec,\n\tfactory coldata.ColumnFactory,\n) error {\n\tif post.Projection {\n\t\tr.Op, r.ColumnTypes = addProjection(r.Op, r.ColumnTypes, post.OutputColumns)\n\t} else if post.RenderExprs != nil {\n\t\tif log.V(2) {\n\t\t\tlog.Infof(ctx, \"planning render expressions %+v\", post.RenderExprs)\n\t\t}\n\t\tsemaCtx := flowCtx.TypeResolverFactory.NewSemaContext(evalCtx.Txn)\n\t\tvar renderedCols []uint32\n\t\tfor _, renderExpr := range post.RenderExprs {\n\t\t\texpr, err := args.ExprHelper.ProcessExpr(renderExpr, semaCtx, evalCtx, r.ColumnTypes)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tvar outputIdx int\n\t\t\tr.Op, outputIdx, r.ColumnTypes, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, expr, r.ColumnTypes, r.Op, args.StreamingMemAccount, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn errors.Wrapf(err, \"unable to columnarize render expression %q\", expr)\n\t\t\t}\n\t\t\tif outputIdx < 0 {\n\t\t\t\treturn errors.AssertionFailedf(\"missing outputIdx\")\n\t\t\t}\n\t\t\trenderedCols = append(renderedCols, uint32(outputIdx))\n\t\t}\n\t\tr.Op = colexecbase.NewSimpleProjectOp(r.Op, len(r.ColumnTypes), renderedCols)\n\t\tnewTypes := make([]*types.T, len(renderedCols))\n\t\tfor i, j := range renderedCols {\n\t\t\tnewTypes[i] = r.ColumnTypes[j]\n\t\t}\n\t\tr.ColumnTypes = newTypes\n\t}\n\tif post.Offset != 0 {\n\t\tr.Op = colexec.NewOffsetOp(r.Op, post.Offset)\n\t}\n\tif post.Limit != 0 {\n\t\tr.Op = colexec.NewLimitOp(r.Op, post.Limit)\n\t}\n\treturn nil\n}","func (rp *routeTree) makePlanValue(ctx *planningContext, n sqlparser.Expr) (*sqltypes.PlanValue, error) {\n\tif ctx.isSubQueryToReplace(n) {\n\t\treturn nil, nil\n\t}\n\n\tfor _, expr := range ctx.semTable.GetExprAndEqualities(n) {\n\t\tif subq, isSubq := expr.(*sqlparser.Subquery); isSubq {\n\t\t\textractedSubquery := ctx.semTable.FindSubqueryReference(subq)\n\t\t\tif extractedSubquery == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tswitch engine.PulloutOpcode(extractedSubquery.OpCode) {\n\t\t\tcase engine.PulloutIn, engine.PulloutNotIn:\n\t\t\t\texpr = sqlparser.NewListArg(extractedSubquery.GetArgName())\n\t\t\tcase engine.PulloutValue, engine.PulloutExists:\n\t\t\t\texpr = sqlparser.NewArgument(extractedSubquery.GetArgName())\n\t\t\t}\n\t\t}\n\t\tpv, err := makePlanValue(expr)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif pv != nil {\n\t\t\treturn pv, nil\n\t\t}\n\t}\n\n\treturn nil, nil\n}","func Compile(expr string) (*Expr, error) {\n\tif expr == \"\" {\n\t\treturn nil, errors.New(\"expr expression is nil\")\n\t}\n\tqy, err := build(expr, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif qy == nil {\n\t\treturn nil, fmt.Errorf(fmt.Sprintf(\"undeclared variable in XPath expression: %s\", expr))\n\t}\n\treturn &Expr{s: expr, q: qy}, nil\n}","func (state *State) EvalExpr(expr string) (interface{}, error) {\n\texp, err := govaluate.NewEvaluableExpression(expr)\n\n\tif err != nil {\n\t\treturn nil, err\n\t} else {\n\t\tres, err := exp.Evaluate(state.expr)\n\n\t\treturn res, err\n\t}\n}","func (c *RPCClient) CreateBreakpointWithExpr(breakPoint *api.Breakpoint, locExpr string, substitutePathRules [][2]string, suspended bool) (*api.Breakpoint, error) {\n\tvar out CreateBreakpointOut\n\terr := c.call(\"CreateBreakpoint\", CreateBreakpointIn{*breakPoint, locExpr, substitutePathRules, suspended}, &out)\n\treturn &out.Breakpoint, err\n}","func (w *World) compileExpr(fset *token.FileSet, e ast.Expr) (Runnable, error) {\n\terrs := new(scanner.ErrorList)\n\tcc := &compiler.Compiler{\n\t\tFSet: fset,\n\t\tErrors: errs,\n\t\tNumErrors: 0,\n\t\tSilentErrors: 0,\n\t}\n\n\tx := cc.CompileExpr(w.scope.Block, false, e)\n\tif x == nil {\n\t\terrs.Sort()\n\t\treturn nil, errs.Err()\n\t}\n\n\tvar eval func(vm.Value, *vm.Thread)\n\tswitch t := x.ExprType.(type) {\n\t// case *types.IdealIntType:\n\t// \t// nothing\n\t// case *types.FloatType:\n\t// \t// nothing\n\tdefault:\n\t\tif tm, ok := t.(*types.MultiType); ok && len(tm.Elems) == 0 {\n\t\t\treturn &stmtCode{\n\t\t\t\tworld: w,\n\t\t\t\tcode: vm.Code{x.Exec},\n\t\t\t}, nil\n\t\t}\n\t\t// eval = compiler.GenAssign(x.Type, x)\n\t}\n\treturn &ExprCode{\n\t\tworld: w,\n\t\texpr: x,\n\t\teval: eval,\n\t}, nil\n}","func execExprString(_ int, p *gop.Context) {\n\targs := p.GetArgs(1)\n\tret := types.ExprString(args[0].(ast.Expr))\n\tp.Ret(1, ret)\n}","func (cm GoPlanner) Plan(queryRequest *plannerpb.QueryRequest) (*distributedpb.LogicalPlannerResult, error) {\n\tvar resultLen C.int\n\tqueryRequestBytes, err := proto.Marshal(queryRequest)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tqueryRequestData := C.CBytes(queryRequestBytes)\n\tdefer C.free(queryRequestData)\n\n\tres := C.PlannerPlan(cm.planner, (*C.char)(queryRequestData), C.int(len(queryRequestBytes)), &resultLen)\n\tdefer C.StrFree(res)\n\tlp := C.GoBytes(unsafe.Pointer(res), resultLen)\n\tif resultLen == 0 {\n\t\treturn nil, errors.New(\"no result returned\")\n\t}\n\n\tplan := &distributedpb.LogicalPlannerResult{}\n\tif err := proto.Unmarshal(lp, plan); err != nil {\n\t\treturn plan, fmt.Errorf(\"error: '%s'; string: '%s'\", err, string(lp))\n\t}\n\treturn plan, nil\n}","func cmdExpr(fr *Frame, argv []T) T {\n\t// Optimization: It's already a single arg.\n\tif len(argv) == 2 {\n\t\treturn fr.EvalExpr(argv[1])\n\t}\n\n\tstrs := make([]string, len(argv)-1)\n\n\tfor i, t := range argv[1:] {\n\t\tstrs[i] = t.String()\n\t}\n\n\tex := strings.Join(strs, \" \")\n\n\treturn fr.ParseExpression(ex)\n}","func (s *BasePCREListener) EnterExpr(ctx *ExprContext) {}","func parseExpr(node *node32) (Expression, error) {\n\tvar stack []Expression\n\tvar opstack []Expression\n\n\t// push an expression to the stack\n\tpush := func(e Expression) {\n\t\tstack = append(stack, e)\n\t}\n\n\t// peek at the top of the expression stack\n\tpeek := func() Expression {\n\t\tif len(stack) == 0 {\n\t\t\treturn nil\n\t\t}\n\t\treturn stack[len(stack)-1]\n\t}\n\n\t// pop and return the expression at the top the expression stack\n\tpop := func() (ret Expression) {\n\t\tret, stack = stack[len(stack)-1], stack[:len(stack)-1]\n\t\treturn\n\t}\n\n\t// push an operator to the operator stack\n\tpushop := func(e Expression) {\n\t\topstack = append(opstack, e)\n\t}\n\n\t// peek at the top the operator stack\n\tpeekop := func() Expression {\n\t\tif len(opstack) == 0 {\n\t\t\treturn nil\n\t\t}\n\t\treturn opstack[len(opstack)-1]\n\t}\n\n\t// pop and return the operator at the top of the operator stack\n\tpopop := func() {\n\t\tvar exp Expression\n\n\t\texp, opstack = opstack[len(opstack)-1], opstack[:len(opstack)-1]\n\n\t\tswitch t := exp.(type) {\n\t\tcase UnaryOperator:\n\t\t\tt.SetExpression(pop())\n\t\tcase BinaryOperator:\n\t\t\tt.SetRHS(pop())\n\t\t\tt.SetLHS(pop())\n\t\tcase *ExprParen:\n\t\t\texp = nil\n\t\t}\n\n\t\tif exp != nil {\n\t\t\tpush(exp)\n\t\t}\n\t}\n\n\t// prio returns the priority of a given operator\n\t// the lesser the value the more tightly the operator binds\n\t// values taken from the operator precedence of C\n\t// special case parenthesis, otherwise a high value\n\tprio := func(exp Expression) int {\n\t\ttyp := reflect.TypeOf(exp).Elem()\n\t\texpr := reflect.New(typ).Elem().Interface()\n\n\t\tvalue, exists := PriorityMap[expr]\n\t\tif !exists {\n\t\t\treturn 42\n\t\t}\n\n\t\treturn value\n\t}\n\n\t// returns whether the operator is right associative\n\trightAssoc := func(exp Expression) bool {\n\t\tswitch exp.(type) {\n\t\tcase *UnaryOperatorNot,\n\t\t\t*UnaryOperatorNegate,\n\t\t\t*UnaryOperatorLen,\n\t\t\t*UnaryOperatorOrd,\n\t\t\t*UnaryOperatorChr:\n\t\t\treturn true\n\t\tdefault:\n\t\t\treturn false\n\t\t}\n\t}\n\n\t// given a peg rule return the operator with the expressions set\n\truleToOp := func(outer, inner pegRule) Expression {\n\n\t\tvar PEGOperatorMap = map[pegRule]map[pegRule]Expression{\n\t\t\truleUNARYOPER: {\n\t\t\t\truleBANG: &UnaryOperatorNot{},\n\t\t\t\truleMINUS: &UnaryOperatorNegate{},\n\t\t\t\truleLEN: &UnaryOperatorLen{},\n\t\t\t\truleORD: &UnaryOperatorOrd{},\n\t\t\t\truleCHR: &UnaryOperatorChr{},\n\t\t\t},\n\t\t\truleBINARYOPER: {\n\t\t\t\truleSTAR: &BinaryOperatorMult{},\n\t\t\t\truleDIV: &BinaryOperatorDiv{},\n\t\t\t\truleMOD: &BinaryOperatorMod{},\n\t\t\t\trulePLUS: &BinaryOperatorAdd{},\n\t\t\t\truleMINUS: &BinaryOperatorSub{},\n\t\t\t\truleGT: &BinaryOperatorGreaterThan{},\n\t\t\t\truleGE: &BinaryOperatorGreaterEqual{},\n\t\t\t\truleLT: &BinaryOperatorLessThan{},\n\t\t\t\truleLE: &BinaryOperatorLessEqual{},\n\t\t\t\truleEQUEQU: &BinaryOperatorEqual{},\n\t\t\t\truleBANGEQU: &BinaryOperatorNotEqual{},\n\t\t\t\truleANDAND: &BinaryOperatorAnd{},\n\t\t\t\truleOROR: &BinaryOperatorOr{},\n\t\t\t\truleAND: &BinaryOperatorBitAnd{},\n\t\t\t\truleOR: &BinaryOperatorBitOr{},\n\t\t\t},\n\t\t}\n\n\t\tvalue, exists := PEGOperatorMap[outer][inner]\n\t\tif !exists {\n\t\t\treturn nil\n\t\t}\n\n\t\treturn value\n\t}\n\n\t// process the nodes in order\n\tfor enode := range exprStream(node) {\n\t\tswitch enode.pegRule {\n\t\tcase ruleINTLITER:\n\t\t\tnum, err := strconv.ParseInt(enode.match, 10, 32)\n\t\t\tif err != nil {\n\t\t\t\t// number does not fit into WACC integer size\n\t\t\t\tnumerr := err.(*strconv.NumError)\n\t\t\t\tswitch numerr.Err {\n\t\t\t\tcase strconv.ErrRange:\n\t\t\t\t\treturn nil, CreateBigIntError(\n\t\t\t\t\t\t&enode.token32,\n\t\t\t\t\t\tenode.match,\n\t\t\t\t\t)\n\t\t\t\t}\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tpush(&IntLiteral{value: int(num)})\n\t\tcase ruleFALSE:\n\t\t\tpush(&BoolLiteralFalse{})\n\t\tcase ruleTRUE:\n\t\t\tpush(&BoolLiteralTrue{})\n\t\tcase ruleCHARLITER:\n\t\t\tpush(&CharLiteral{char: enode.up.next.match})\n\t\tcase ruleSTRLITER:\n\t\t\tstrLiter := &StringLiteral{}\n\t\t\tstrNode := nextNode(enode.up, ruleSTR)\n\t\t\tif strNode != nil {\n\t\t\t\t// string may be empty, only set contents if not\n\t\t\t\tstrLiter.str = strNode.match\n\t\t\t}\n\t\t\tpush(strLiter)\n\t\tcase rulePAIRLITER:\n\t\t\tpush(&NullPair{})\n\t\tcase ruleIDENT:\n\t\t\tpush(&Ident{ident: enode.match})\n\t\tcase ruleENUMLITER:\n\t\t\tenumLiter := &EnumLiteral{}\n\t\t\tenumLiter.ident = nextNode(enode.up, ruleIDENT).match\n\t\t\tenumLiter.field = nextNode(enode.up.next, ruleIDENT).match\n\n\t\t\tpush(enumLiter)\n\t\tcase ruleARRAYELEM:\n\t\t\tarrElem, err := parseArrayElem(enode.up)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tpush(arrElem)\n\t\tcase ruleUNARYOPER, ruleBINARYOPER:\n\t\t\top1 := ruleToOp(enode.pegRule, enode.up.pegRule)\n\t\top2l:\n\t\t\tfor op2 := peekop(); op2 != nil; op2 = peekop() {\n\t\t\t\tif op2 == nil {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\n\t\t\t\t// pop all operators with more tight binding\n\t\t\t\tswitch {\n\t\t\t\tcase !rightAssoc(op1) && prio(op1) >= prio(op2),\n\t\t\t\t\trightAssoc(op1) && prio(op1) > prio(op2):\n\t\t\t\t\tpopop()\n\t\t\t\tdefault:\n\t\t\t\t\tbreak op2l\n\t\t\t\t}\n\t\t\t}\n\t\t\tpushop(op1)\n\t\tcase ruleLPAR:\n\t\t\tpushop(&ExprParen{})\n\t\tcase ruleRPAR:\n\t\t\t// when a parenthesis is closed pop all the operators\n\t\t\t// the were inside\n\t\tparloop:\n\t\t\tfor {\n\t\t\t\tswitch peekop().(type) {\n\t\t\t\tcase *ExprParen:\n\t\t\t\t\tpopop()\n\t\t\t\t\tbreak parloop\n\t\t\t\tdefault:\n\t\t\t\t\tpopop()\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// set tokens on newly pushed expressions\n\t\tif val := peek(); val != nil && val.Token() == nil {\n\t\t\tpeek().SetToken(&node.token32)\n\t\t}\n\n\t\tif op := peekop(); op != nil && op.Token() == nil {\n\t\t\tpeekop().SetToken(&node.token32)\n\t\t}\n\t}\n\n\t// if operators are still left pop them\n\tfor peekop() != nil {\n\t\tpopop()\n\t}\n\n\treturn pop(), nil\n}","func (eq *Eq) Compile(expr *Expr, model *Model) {\n\teq.Expr = expr\n\teq.Result = eq.compile(expr, model)\n\n\tfn := &Func{}\n\tfn.InitRAX()\n\tfor _, stmt := range eq.Code {\n\t\tfn.BinaryOp(stmt.Op, stmt.D, stmt.A, stmt.B)\n\t}\n\tfn.Ret()\n\tfn.MarkExecutable()\n\teq.Func = fn\n}","func compileExpr(compiledFunc *vm.CompiledFunc, expr ast.Node, file *Compiled) ([]vm.Register, []string, error) {\n\tswitch e := expr.(type) {\n\tcase *ast.Assign:\n\t\terr := compileAssign(compiledFunc, e, file)\n\n\t\treturn nil, nil, err\n\n\tcase *ast.Literal:\n\t\treturns := compiledFunc.NextRegister()\n\t\tcompiledFunc.Append(&vm.Assign{\n\t\t\tVariableName: returns,\n\t\t\tValue: e,\n\t\t})\n\n\t\treturn []vm.Register{returns}, []string{e.Kind}, nil\n\n\tcase *ast.Func:\n\t\tcf, err := CompileFunc(e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\tfile.FuncDefs[e.Name] = e\n\t\tfile.Funcs[e.Name] = cf\n\t\tfnType := e.Type()\n\n\t\treturns := compiledFunc.NextRegister()\n\t\tcompiledFunc.Append(&vm.Assign{\n\t\t\tVariableName: returns,\n\t\t\tValue: &ast.Literal{\n\t\t\t\tKind: fnType,\n\t\t\t\tValue: e.Name,\n\t\t\t},\n\t\t})\n\n\t\tcompiledFunc.Append(&vm.ParentScope{\n\t\t\tX: returns,\n\t\t})\n\n\t\treturn []vm.Register{returns}, []string{fnType}, nil\n\n\tcase *ast.Array:\n\t\treturns, kind, err := compileArray(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\treturn []vm.Register{returns}, []string{kind}, nil\n\n\tcase *ast.Map:\n\t\treturns, kind, err := compileMap(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\treturn []vm.Register{returns}, []string{kind}, nil\n\n\tcase *ast.Call:\n\t\tresults, resultKinds, err := compileCall(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\t// TODO(elliot): Doesn't return kind.\n\t\treturn results, resultKinds, nil\n\n\tcase *ast.Identifier:\n\t\t// TODO(elliot): Doesn't check that the upper scope variable exists or\n\t\t// fetches the correct type.\n\t\tif e.Name[0] == '^' {\n\t\t\treturn []vm.Register{vm.Register(e.Name)}, []string{\"number\"}, nil\n\t\t}\n\n\t\tif v, ok := compiledFunc.Variables[e.Name]; ok || e.Name[0] == '^' {\n\t\t\treturn []vm.Register{vm.Register(e.Name)}, []string{v}, nil\n\t\t}\n\n\t\t// It could be a package-level constant.\n\t\tif c, ok := file.Constants[e.Name]; ok {\n\t\t\t// We copy it locally to make sure it's value isn't changed. The\n\t\t\t// compiler will prevent a constant from being modified directly.\n\t\t\t//\n\t\t\t// TODO(elliot): The compiler needs to raise an error when trying to\n\t\t\t// modify a constant.\n\t\t\tliteralRegister := compiledFunc.NextRegister()\n\t\t\tcompiledFunc.Append(&vm.Assign{\n\t\t\t\tVariableName: literalRegister,\n\t\t\t\t// TODO(elliot): Does not support non-scalar values.\n\t\t\t\tValue: &ast.Literal{\n\t\t\t\t\tKind: c.Kind,\n\t\t\t\t\tValue: c.Value,\n\t\t\t\t},\n\t\t\t})\n\n\t\t\treturn []vm.Register{literalRegister}, []string{c.Kind}, nil\n\t\t}\n\n\t\t// It could also reference a package-level function.\n\t\tif fn, ok := file.FuncDefs[e.Name]; ok {\n\t\t\tliteralRegister := compiledFunc.NextRegister()\n\t\t\tcompiledFunc.Append(&vm.Assign{\n\t\t\t\tVariableName: literalRegister,\n\t\t\t\tValue: &ast.Literal{\n\t\t\t\t\tKind: fn.Type(),\n\t\t\t\t\tValue: fn.Name,\n\t\t\t\t},\n\t\t\t})\n\n\t\t\treturn []vm.Register{literalRegister}, []string{fn.Type()}, nil\n\t\t}\n\n\t\treturn nil, nil, fmt.Errorf(\"%s undefined variable: %s\",\n\t\t\te.Pos, e.Name)\n\n\tcase *ast.Binary:\n\t\tresult, ty, err := compileBinary(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\treturn []vm.Register{result}, []string{ty}, nil\n\n\tcase *ast.Group:\n\t\treturn compileExpr(compiledFunc, e.Expr, file)\n\n\tcase *ast.Unary:\n\t\tresult, ty, err := compileUnary(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\treturn []vm.Register{result}, []string{ty}, nil\n\n\tcase *ast.Key:\n\t\tresult, ty, err := compileKey(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\treturn []vm.Register{result}, []string{ty}, nil\n\n\tcase *ast.Interpolate:\n\t\tresult, err := compileInterpolate(compiledFunc, e, file)\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\n\t\treturn []vm.Register{result}, []string{\"string\"}, nil\n\t}\n\n\tpanic(expr)\n}","func (b *PlanBuilder) rewriteWithPreprocess(\n\tctx context.Context,\n\texprNode ast.ExprNode,\n\tp LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int,\n\tasScalar bool,\n\tpreprocess func(ast.Node) ast.Node,\n) (expression.Expression, LogicalPlan, error) {\n\tb.rewriterCounter++\n\tdefer func() { b.rewriterCounter-- }()\n\n\trewriter := b.getExpressionRewriter(ctx, p)\n\t// The rewriter maybe is obtained from \"b.rewriterPool\", \"rewriter.err\" is\n\t// not nil means certain previous procedure has not handled this error.\n\t// Here we give us one more chance to make a correct behavior by handling\n\t// this missed error.\n\tif rewriter.err != nil {\n\t\treturn nil, nil, rewriter.err\n\t}\n\n\trewriter.aggrMap = aggMapper\n\trewriter.asScalar = asScalar\n\trewriter.preprocess = preprocess\n\n\texpr, resultPlan, err := b.rewriteExprNode(rewriter, exprNode, asScalar)\n\treturn expr, resultPlan, err\n}","func (p *parser) VisitExpr(ctx *gen.ExprContext) any {\n\tresult := p.Visit(ctx.GetE()).(*exprpb.Expr)\n\tif ctx.GetOp() == nil {\n\t\treturn result\n\t}\n\topID := p.helper.id(ctx.GetOp())\n\tifTrue := p.Visit(ctx.GetE1()).(*exprpb.Expr)\n\tifFalse := p.Visit(ctx.GetE2()).(*exprpb.Expr)\n\treturn p.globalCallOrMacro(opID, operators.Conditional, result, ifTrue, ifFalse)\n}","func (tr *transform) getExpression(expr ast.Expr) *expression {\n\te := tr.newExpression(nil)\n\n\te.transform(expr)\n\treturn e\n}","func expr(out *Expr) Parser {\r\n\treturn func(code string) (string, error) {\r\n\t\tcode, expr, err := ParseExpression(code)\r\n\t\tif err == nil {\r\n\t\t\t*out = expr\r\n\t\t}\r\n\t\treturn code, err\r\n\t}\r\n}","func (b *PlanBuilder) rewrite(ctx context.Context, exprNode ast.ExprNode, p LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int, asScalar bool) (expression.Expression, LogicalPlan, error) {\n\texpr, resultPlan, err := b.rewriteWithPreprocess(ctx, exprNode, p, aggMapper, asScalar, nil)\n\treturn expr, resultPlan, err\n}","func evalAstExpr(ctx sessionctx.Context, expr ast.ExprNode) (types.Datum, error) {\n\ttrace_util_0.Count(_expression_rewriter_00000, 0)\n\tif val, ok := expr.(*driver.ValueExpr); ok {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 4)\n\t\treturn val.Datum, nil\n\t}\n\ttrace_util_0.Count(_expression_rewriter_00000, 1)\n\tb := &PlanBuilder{\n\t\tctx: ctx,\n\t\tcolMapper: make(map[*ast.ColumnNameExpr]int),\n\t}\n\tif ctx.GetSessionVars().TxnCtx.InfoSchema != nil {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 5)\n\t\tb.is = ctx.GetSessionVars().TxnCtx.InfoSchema.(infoschema.InfoSchema)\n\t}\n\ttrace_util_0.Count(_expression_rewriter_00000, 2)\n\tfakePlan := LogicalTableDual{}.Init(ctx)\n\tnewExpr, _, err := b.rewrite(expr, fakePlan, nil, true)\n\tif err != nil {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 6)\n\t\treturn types.Datum{}, err\n\t}\n\ttrace_util_0.Count(_expression_rewriter_00000, 3)\n\treturn newExpr.Eval(chunk.Row{})\n}","func (x *ExprImpl) expr() {}","func cheapExpr(n ir.Node, init *ir.Nodes) ir.Node {\n\tswitch n.Op() {\n\tcase ir.ONAME, ir.OLITERAL, ir.ONIL:\n\t\treturn n\n\t}\n\n\treturn copyExpr(n, n.Type(), init)\n}","func (p *Platform) Plan(destroy bool) (*plans.Plan, error) {\n\tp.startMiddleware()\n\n\tctx, err := p.newContext(destroy)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif _, diag := ctx.Refresh(); diag.HasErrors() {\n\t\treturn nil, diag.Err()\n\t}\n\n\tplan, diag := ctx.Plan()\n\tif diag.HasErrors() {\n\t\treturn nil, diag.Err()\n\t}\n\n\treturn plan, nil\n}","func expression(rbp int) int {\n\tcurrentToken := tokens[cursor]\n\tcursor++\n\tnextToken = tokens[cursor]\n\tleftPrefix := currentToken.(prefixHandler).nud()\n\n\taddPadding()\n\tlog(fmt.Sprintf(\"<prefix %d, rbp %d, nextOp lbp %d>\", leftPrefix, rbp, nextToken.(infixOperator).lbp()))\n\tfor rbp < nextToken.(infixOperator).lbp() {\n\t\tlog(fmt.Sprintf(\"<infix %s, lbp %d>\", nextToken.(infixHandler).op(), nextToken.(infixOperator).lbp()))\n\n\t\tcurrentToken = nextToken\n\t\tcursor++\n\t\tnextToken = tokens[cursor]\n\t\tcalcResult := currentToken.(infixHandler).led(leftPrefix)\n\t\tpopPadding()\n\t\tlog(fmt.Sprintf(\"<infix %s> = %+v\", currentToken.(infixHandler).op(), calcResult))\n\n\t\tleftPrefix = calcResult\n\t}\n\treturn leftPrefix\n}","func Expr(sql string, args ...interface{}) Cond {\n\treturn expr{sql, args}\n}","func (c *Compiler) Compile(node ast.Node) error {\n\tswitch node := node.(type) {\n\tcase *ast.Program:\n\t\tfor _, s := range node.Statements {\n\t\t\terr := c.Compile(s)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\tcase *ast.ExpressionStatement:\n\t\terr := c.Compile(node.Expression)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tc.emit(operation.Pop)\n\n\tcase *ast.InfixExpression:\n\t\t// Convert LessThan operations to GreaterThan ones\n\t\tif node.Operator == \"<\" {\n\n\t\t\t// First compile the right node, then the left node, unlike other infixes\n\t\t\terr := c.Compile(node.Right)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\terr = c.Compile(node.Left)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\tc.emit(operation.GreaterThan)\n\t\t\treturn nil\n\t\t}\n\n\t\terr := c.Compile(node.Left)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\terr = c.Compile(node.Right)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tswitch node.Operator {\n\t\tcase \"+\":\n\t\t\tc.emit(operation.Add)\n\t\tcase \"-\":\n\t\t\tc.emit(operation.Sub)\n\t\tcase \"*\":\n\t\t\tc.emit(operation.Mul)\n\t\tcase \"/\":\n\t\t\tc.emit(operation.Div)\n\t\tcase \">\":\n\t\t\tc.emit(operation.GreaterThan)\n\t\tcase \"==\":\n\t\t\tc.emit(operation.Equal)\n\t\tcase \"!=\":\n\t\t\tc.emit(operation.NotEqual)\n\t\tcase \"=\":\n\t\t\tswitch node.Left.(type) {\n\t\t\t// Index assignment\n\t\t\tcase *ast.IndexExpression:\n\t\t\t\tie := node.Left.(*ast.IndexExpression)\n\n\t\t\t\t// Compile identifier\n\t\t\t\terr := c.Compile(ie.Left)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\n\t\t\t\t// Compile the index\n\t\t\t\terr = c.Compile(ie.Index)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\n\t\t\t\t// Compile the value\n\t\t\t\terr = c.Compile(node.Right)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\n\t\t\t\tc.emit(operation.SetIndex)\n\n\t\t\t// Identifier assignment\n\t\t\tcase *ast.Identifier:\n\t\t\t\t// Get the variable\n\t\t\t\tident := node.Left.(*ast.Identifier)\n\t\t\t\tsymbol, ok := c.symbols.Resolve(ident.Value)\n\t\t\t\tif !ok {\n\t\t\t\t\treturn fmt.Errorf(\"Variable %s is undefined\", node.Left)\n\t\t\t\t}\n\n\t\t\t\t// Compile the value to be assigned\n\t\t\t\terr := c.Compile(node.Right)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\n\t\t\t\tswitch symbol.Scope {\n\t\t\t\tcase symbols.GlobalScope:\n\t\t\t\t\tc.emit(operation.SetGlobal, symbol.Index)\n\t\t\t\tcase symbols.LocalScope:\n\t\t\t\t\tc.emit(operation.SetLocal, symbol.Index)\n\t\t\t\tcase symbols.FreeScope:\n\t\t\t\t\tc.emit(operation.SetFree, symbol.Index)\n\t\t\t\t}\n\t\t\t}\n\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"unknown operator %s\", node.Operator)\n\t\t}\n\n\tcase *ast.PrefixExpression:\n\t\terr := c.Compile(node.Right)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tswitch node.Operator {\n\t\tcase \"!\":\n\t\t\tc.emit(operation.Bang)\n\t\tcase \"-\":\n\t\t\tc.emit(operation.Minus)\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"unknown operator %s\", node.Operator)\n\t\t}\n\n\tcase *ast.IntegerLiteral:\n\t\tinteger := &data.Integer{Value: node.Value}\n\t\tc.emit(operation.Constant, c.addConstant(integer))\n\n\tcase *ast.Boolean:\n\t\tif node.Value {\n\t\t\tc.emit(operation.True)\n\t\t} else {\n\t\t\tc.emit(operation.False)\n\t\t}\n\n\tcase *ast.StringLiteral:\n\t\tstr := &data.String{Value: node.Value}\n\t\tc.emit(operation.Constant, c.addConstant(str))\n\n\tcase *ast.ArrayLiteral:\n\t\tfor _, el := range node.Elements {\n\t\t\terr := c.Compile(el)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tc.emit(operation.Array, len(node.Elements))\n\n\tcase *ast.HashLiteral:\n\t\tkeys := []ast.Expression{}\n\t\tfor k := range node.Pairs {\n\t\t\tkeys = append(keys, k)\n\t\t}\n\t\t// Sort the keys as Go doesn't guarantee key/val order on iteration\n\t\tsort.Slice(keys, func(i, j int) bool {\n\t\t\treturn keys[i].String() < keys[j].String()\n\t\t})\n\t\tfor _, k := range keys {\n\t\t\terr := c.Compile(k)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\terr = c.Compile(node.Pairs[k])\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tc.emit(operation.Hash, len(node.Pairs)*2)\n\n\tcase *ast.IndexExpression:\n\t\terr := c.Compile(node.Left)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\terr = c.Compile(node.Index)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tc.emit(operation.Index)\n\n\tcase *ast.IfExpression:\n\t\terr := c.Compile(node.Condition)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// Emit a `JumpNotTruthy` with a temporary operand\n\t\tjumpNotTruthyPos := c.emit(operation.JumpNotTruthy, 9999)\n\t\terr = c.Compile(node.Consequent)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif c.isEmitted(operation.Pop) {\n\t\t\tc.preventPop()\n\t\t}\n\n\t\t// Emit a `Jump` with a temporary operand\n\t\tjumpPos := c.emit(operation.Jump, 9999)\n\t\tafterConsequentPos := len(c.currentInstructions())\n\t\tc.changeOperand(jumpNotTruthyPos, afterConsequentPos)\n\t\tif node.Alternate == nil {\n\t\t\tc.emit(operation.Null)\n\t\t} else {\n\t\t\terr := c.Compile(node.Alternate)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif c.isEmitted(operation.Pop) {\n\t\t\t\tc.preventPop()\n\t\t\t}\n\t\t}\n\n\t\tafterAlternatePos := len(c.currentInstructions())\n\t\tc.changeOperand(jumpPos, afterAlternatePos)\n\n\tcase *ast.LetStatement:\n\t\tsymbol := c.symbols.Define(node.Name.Value)\n\t\terr := c.Compile(node.Value)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tif symbol.Scope == symbols.GlobalScope {\n\t\t\tc.emit(operation.SetGlobal, symbol.Index)\n\t\t} else {\n\t\t\tc.emit(operation.SetLocal, symbol.Index)\n\t\t}\n\n\tcase *ast.Identifier:\n\t\tsymbol, ok := c.symbols.Resolve(node.Value)\n\t\tif !ok {\n\t\t\treturn fmt.Errorf(\"Variable %s is undefined\", node.Value)\n\t\t}\n\t\tc.loadSymbol(symbol)\n\n\tcase *ast.BlockStatement:\n\t\tfor _, s := range node.Statements {\n\t\t\terr := c.Compile(s)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\tcase *ast.FunctionLiteral:\n\t\tc.enterScope()\n\t\tfor _, p := range node.Parameters {\n\t\t\tc.symbols.Define(p.Value)\n\t\t}\n\t\terr := c.Compile(node.Body)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\t// If a pop was emitted, replace it with a return value (implicit return)\n\t\tif c.isEmitted(operation.Pop) {\n\t\t\tc.changeEmittedTo(operation.ReturnValue)\n\t\t}\n\n\t\t// If no return value was emitted, emit a return instead (no return - empty body)\n\t\tif !c.isEmitted(operation.ReturnValue) {\n\t\t\tc.emit(operation.Return)\n\t\t}\n\n\t\tfreeSymbols := c.symbols.Free\n\t\tlocalCount := c.symbols.DefinitionCount\n\t\tinstructions := c.leaveScope()\n\n\t\tfor _, s := range freeSymbols {\n\t\t\tc.loadSymbol(s)\n\t\t}\n\n\t\tcompiled := &data.CompiledFunction{\n\t\t\tInstructions: instructions,\n\t\t\tLocalCount: localCount,\n\t\t\tParamCount: len(node.Parameters),\n\t\t}\n\n\t\tfnIndex := c.addConstant(compiled)\n\t\tc.emit(operation.Closure, fnIndex, len(freeSymbols))\n\n\tcase *ast.ReturnStatement:\n\t\terr := c.Compile(node.ReturnValue)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tc.emit(operation.ReturnValue)\n\n\tcase *ast.CallExpression:\n\t\terr := c.Compile(node.Function)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tfor _, a := range node.Arguments {\n\t\t\terr := c.Compile(a)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tc.emit(operation.Call, len(node.Arguments))\n\n\t}\n\n\treturn nil\n}","func (ann *Annotator) resExpr(ctx *Ctx, e *ast.Expr) ast.Expr {\n\tctx = ctx.withExpr(e)\n\tnode := *e\n\n\t//ann.logf(\"resExpr %T\\n\", node)\n\t//ann.logf(\"resExpr %T (%v)\\n\", *e, ann.sprintNode2(node))\n\n\t// buildname: visit node if there is a function defined for it\n\tname, err := reflectutil.TypeNameBase(node)\n\tif err != nil {\n\t\treturn nilIdent()\n\t}\n\tres, err := reflectutil.InvokeByName(ann, \"Res\"+name, ctx, node)\n\tif err != nil {\n\t\tann.logf(\"todo: resExpr: %v\", err)\n\t\treturn nilIdent()\n\t}\n\tresult := res[0].Interface().(ast.Expr) // must succeed\n\tif result == nil {\n\t\treturn nilIdent()\n\t}\n\treturn result\n}","func NewProcessor(provider metrics.Provider, lister ContainerAccessor, adapter MetricsAdapter, filter ContainerFilter) Processor {\n\treturn Processor{\n\t\tmetricsProvider: provider,\n\t\tctrLister: lister,\n\t\tmetricsAdapter: adapter,\n\t\tctrFilter: filter,\n\t\textensions: map[string]ProcessorExtension{\n\t\t\tNetworkExtensionID: NewProcessorNetwork(),\n\t\t},\n\t}\n}","func (p PatternExprPair) Expr() Expr {\n\treturn p.expr\n}","func (m *JobExecutor) WalkPlan(p plan.Task) (Task, error) {\n\tswitch p := p.(type) {\n\tcase *plan.PreparedStatement:\n\t\treturn m.Executor.WalkPreparedStatement(p)\n\tcase *plan.Select:\n\t\tif p.Ctx != nil && p.IsSchemaQuery() {\n\t\t\tif p.Ctx.Schema != nil && p.Ctx.Schema.InfoSchema != nil {\n\t\t\t\tp.Ctx.Schema = p.Ctx.Schema.InfoSchema\n\t\t\t}\n\t\t\tp.Stmt.SetSystemQry()\n\t\t}\n\t\treturn m.Executor.WalkSelect(p)\n\tcase *plan.Upsert:\n\t\treturn m.Executor.WalkUpsert(p)\n\tcase *plan.Insert:\n\t\treturn m.Executor.WalkInsert(p)\n\tcase *plan.Update:\n\t\treturn m.Executor.WalkUpdate(p)\n\tcase *plan.Delete:\n\t\treturn m.Executor.WalkDelete(p)\n\tcase *plan.Command:\n\t\treturn m.Executor.WalkCommand(p)\n\n\t// DDL\n\tcase *plan.Create:\n\t\treturn m.Executor.WalkCreate(p)\n\tcase *plan.Drop:\n\t\treturn m.Executor.WalkDrop(p)\n\tcase *plan.Alter:\n\t\treturn m.Executor.WalkAlter(p)\n\t}\n\tpanic(fmt.Sprintf(\"Not implemented for %T\", p))\n}","func (c *Collection) Plan(op controller.Operation,\n\tspec types.Spec) (object *types.Object, plan *controller.Plan, err error) {\n\n\terr = c.readTxn(func() error {\n\n\t\tlog.Debug(\"Plan\", \"op\", op, \"spec\", spec, \"V\", debugV)\n\n\t\tobject, err = c.object()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tif c.PlanFunc == nil {\n\t\t\treturn nil\n\t\t}\n\n\t\tif p, e := c.PlanFunc(op, spec); e == nil {\n\t\t\tplan = &p\n\t\t} else {\n\t\t\terr = e\n\t\t}\n\n\t\treturn err\n\t})\n\treturn\n}","func (k Querier) Plan(c context.Context, req *types.QueryPlanRequest) (*types.QueryPlanResponse, error) {\n\tif req == nil {\n\t\treturn nil, status.Error(codes.InvalidArgument, \"invalid request\")\n\t}\n\n\tctx := sdk.UnwrapSDKContext(c)\n\tplan, found := k.GetPlan(ctx, req.PlanId)\n\tif !found {\n\t\treturn nil, status.Errorf(codes.NotFound, \"plan %d not found\", req.PlanId)\n\t}\n\n\tany, err := codectypes.NewAnyWithValue(plan)\n\tif err != nil {\n\t\treturn nil, status.Error(codes.Internal, err.Error())\n\t}\n\n\treturn &types.QueryPlanResponse{Plan: any}, nil\n}","func CallExpr(fun ast.Expr, args ...ast.Expr) *ast.CallExpr {\n\treturn &ast.CallExpr{\n\t\tFun: fun,\n\t\tArgs: args,\n\t}\n}","func (p *planner) Execute(ctx context.Context, n *tree.Execute) (planNode, error) {\n\tif p.isPreparing {\n\t\treturn nil, pgerror.NewErrorf(pgerror.CodeInvalidPreparedStatementDefinitionError,\n\t\t\t\"can't prepare an EXECUTE statement\")\n\t} else if p.curPlan.plannedExecute {\n\t\treturn nil, pgerror.NewErrorf(pgerror.CodeSyntaxError,\n\t\t\t\"can't have more than 1 EXECUTE per statement\")\n\t}\n\tp.curPlan.plannedExecute = true\n\tname := n.Name.String()\n\tps, ok := p.preparedStatements.Get(name)\n\tif !ok {\n\t\treturn nil, pgerror.NewErrorf(\n\t\t\tpgerror.CodeInvalidSQLStatementNameError,\n\t\t\t\"prepared statement %q does not exist\", name,\n\t\t)\n\t}\n\tpInfo, err := fillInPlaceholders(\n\t\tps, name, n.Params, p.EvalContext().SessionData.SearchPath,\n\t)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tp.semaCtx.Placeholders.Assign(pInfo)\n\n\treturn p.newPlan(ctx, ps.Statement, nil /* desiredTypes */)\n}","func (o SecurityPolicyRuleMatcherOutput) Expr() ExprPtrOutput {\n\treturn o.ApplyT(func(v SecurityPolicyRuleMatcher) *Expr { return v.Expr }).(ExprPtrOutput)\n}","func (b *PlanBuilder) rewriteWithPreprocess(exprNode ast.ExprNode, p LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int, windowMapper map[*ast.WindowFuncExpr]int, asScalar bool, preprocess func(ast.Node) ast.Node) (expression.Expression, LogicalPlan, error) {\n\ttrace_util_0.Count(_expression_rewriter_00000, 13)\n\tb.rewriterCounter++\n\tdefer func() { trace_util_0.Count(_expression_rewriter_00000, 16); b.rewriterCounter-- }()\n\n\ttrace_util_0.Count(_expression_rewriter_00000, 14)\n\trewriter := b.getExpressionRewriter(p)\n\t// The rewriter maybe is obtained from \"b.rewriterPool\", \"rewriter.err\" is\n\t// not nil means certain previous procedure has not handled this error.\n\t// Here we give us one more chance to make a correct behavior by handling\n\t// this missed error.\n\tif rewriter.err != nil {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 17)\n\t\treturn nil, nil, rewriter.err\n\t}\n\n\ttrace_util_0.Count(_expression_rewriter_00000, 15)\n\trewriter.aggrMap = aggMapper\n\trewriter.windowMap = windowMapper\n\trewriter.asScalar = asScalar\n\trewriter.preprocess = preprocess\n\n\texpr, resultPlan, err := b.rewriteExprNode(rewriter, exprNode, asScalar)\n\treturn expr, resultPlan, err\n}","func (_e *MockCompactionPlanContext_Expecter) execCompactionPlan(signal interface{}, plan interface{}) *MockCompactionPlanContext_execCompactionPlan_Call {\n\treturn &MockCompactionPlanContext_execCompactionPlan_Call{Call: _e.mock.On(\"execCompactionPlan\", signal, plan)}\n}","func (r *HistoryRunner) Plan(ctx context.Context) error {\n\tif len(r.filename) != 0 {\n\t\t// file mode\n\t\treturn r.planFile(ctx, r.filename)\n\t}\n\n\t// directory mode\n\treturn r.planDir(ctx)\n}","func CMOVQPL(mr, r operand.Op) { ctx.CMOVQPL(mr, r) }","func planCastOperator(\n\tctx context.Context,\n\tacc *mon.BoundAccount,\n\tcolumnTypes []*types.T,\n\tinput colexecop.Operator,\n\tinputIdx int,\n\tfromType *types.T,\n\ttoType *types.T,\n\tfactory coldata.ColumnFactory,\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\n\toutputIdx := len(columnTypes)\n\top, err = colexecbase.GetCastOperator(colmem.NewAllocator(ctx, acc, factory), input, inputIdx, outputIdx, fromType, toType)\n\ttyps = appendOneType(columnTypes, toType)\n\treturn op, outputIdx, typs, err\n}","func (g *irgen) callExpr(pos src.XPos, typ *types.Type, fun ir.Node, args []ir.Node, dots bool) ir.Node {\n\tn := ir.NewCallExpr(pos, ir.OCALL, fun, args)\n\tn.IsDDD = dots\n\ttyped(typ, n)\n\n\tif fun.Op() == ir.OTYPE {\n\t\t// Actually a type conversion, not a function call.\n\t\tif !g.delayTransform() {\n\t\t\treturn transformConvCall(n)\n\t\t}\n\t\treturn n\n\t}\n\n\tif fun, ok := fun.(*ir.Name); ok && fun.BuiltinOp != 0 {\n\t\tif !g.delayTransform() {\n\t\t\treturn transformBuiltin(n)\n\t\t}\n\t\treturn n\n\t}\n\n\t// Add information, now that we know that fun is actually being called.\n\tswitch fun := fun.(type) {\n\tcase *ir.SelectorExpr:\n\t\tif fun.Op() == ir.OMETHVALUE {\n\t\t\top := ir.ODOTMETH\n\t\t\tif fun.X.Type().IsInterface() {\n\t\t\t\top = ir.ODOTINTER\n\t\t\t}\n\t\t\tfun.SetOp(op)\n\t\t\t// Set the type to include the receiver, since that's what\n\t\t\t// later parts of the compiler expect\n\t\t\tfun.SetType(fun.Selection.Type)\n\t\t}\n\t}\n\n\t// A function instantiation (even if fully concrete) shouldn't be\n\t// transformed yet, because we need to add the dictionary during the\n\t// transformation.\n\tif fun.Op() != ir.OFUNCINST && !g.delayTransform() {\n\t\ttransformCall(n)\n\t}\n\treturn n\n}","func New(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize, bulkSize int, w io.Writer) (Executor, error) {\n\tswitch stm.Type() {\n\tcase semantic.Query:\n\t\treturn newQueryPlan(ctx, store, stm, chanSize, w)\n\tcase semantic.Insert:\n\t\treturn &insertPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Delete:\n\t\treturn &deletePlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Create:\n\t\treturn &createPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Drop:\n\t\treturn &dropPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tcase semantic.Construct:\n\t\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\n\t\treturn &constructPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t\tbulkSize: bulkSize,\n\t\t\tqueryPlan: qp,\n\t\t\tconstruct: true,\n\t\t}, nil\n\tcase semantic.Deconstruct:\n\t\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\n\t\treturn &constructPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t\tbulkSize: bulkSize,\n\t\t\tqueryPlan: qp,\n\t\t\tconstruct: false,\n\t\t}, nil\n\tcase semantic.Show:\n\t\treturn &showPlan{\n\t\t\tstm: stm,\n\t\t\tstore: store,\n\t\t\ttracer: w,\n\t\t}, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"planner.New: unknown statement type in statement %v\", stm)\n\t}\n}","func evalAstExpr(sctx sessionctx.Context, expr ast.ExprNode) (types.Datum, error) {\n\tif val, ok := expr.(*driver.ValueExpr); ok {\n\t\treturn val.Datum, nil\n\t}\n\tvar is infoschema.InfoSchema\n\tif sctx.GetSessionVars().TxnCtx.InfoSchema != nil {\n\t\tis = sctx.GetSessionVars().TxnCtx.InfoSchema.(infoschema.InfoSchema)\n\t}\n\tb := NewPlanBuilder(sctx, is)\n\tfakePlan := LogicalTableDual{}.Init(sctx)\n\tnewExpr, _, err := b.rewrite(context.TODO(), expr, fakePlan, nil, true)\n\tif err != nil {\n\t\treturn types.Datum{}, err\n\t}\n\treturn newExpr.Eval(chunk.Row{})\n}","func NewExpr(name, source string, expr expression.Expr) *Expr {\n\treturn &Expr{\n\t\tsource: source,\n\t\tExpr: expr,\n\t\tName: name,\n\t}\n}","func (p *parser) lambdaExpr() Node {\n\treturn p.precedence(p.primary(), 0)\n}","func NewMulExpr(scanner parser.Scanner, a, b Expr) Expr {\n\treturn newArithExpr(scanner, a, b, \"*\", func(a, b float64) float64 { return a * b })\n}","func pfunc(out *Expr, fn func(string) (string, Expr, error)) Parser {\r\n\treturn func(code string) (string, error) {\r\n\t\tcode, expr, err := fn(code)\r\n\t\tif err == nil {\r\n\t\t\t*out = expr\r\n\t\t}\r\n\t\treturn code, err\r\n\t}\r\n}","func (j *ScheduledJob) ScheduleExpr() string {\n\treturn j.rec.ScheduleExpr\n}","func NewAstExprMethodCallExpr4(a int, b int, c int, d int, e AstExprExpressionInterface, f []*AstTypeType, g string, h []*AstExprExpression) (*AstExprMethodCallExpr) {\n\tconv_e := javabind.NewGoToJavaCallable()\n\tconv_f := javabind.NewGoToJavaList(javabind.NewGoToJavaCallable())\n\tconv_g := javabind.NewGoToJavaString()\n\tconv_h := javabind.NewGoToJavaList(javabind.NewGoToJavaCallable())\n\tif err := conv_e.Convert(e); err != nil {\n\t\tpanic(err)\n\t}\n\tif err := conv_f.Convert(f); err != nil {\n\t\tpanic(err)\n\t}\n\tif err := conv_g.Convert(g); err != nil {\n\t\tpanic(err)\n\t}\n\tif err := conv_h.Convert(h); err != nil {\n\t\tpanic(err)\n\t}\n\n\tobj, err := javabind.GetEnv().NewObject(\"com/github/javaparser/ast/expr/MethodCallExpr\", a, b, c, d, conv_e.Value().Cast(\"com/github/javaparser/ast/expr/Expression\"), conv_f.Value().Cast(\"java/util/List\"), conv_g.Value().Cast(\"java/lang/String\"), conv_h.Value().Cast(\"java/util/List\"))\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tconv_e.CleanUp()\n\tconv_f.CleanUp()\n\tconv_g.CleanUp()\n\tconv_h.CleanUp()\n\tx := &AstExprMethodCallExpr{}\n\tx.Callable = &javabind.Callable{obj}\n\treturn x\n}","func NewCallExpr(scanner parser.Scanner, a, b Expr) Expr {\n\treturn newBinExpr(scanner, a, b, \"call\", \"«%s»(%s)\", Call)\n}","func Expr(op string, x, y interface{}) Node {\n\treturn Node{&ast.Expr{Op: op, X: ToNode(x).Node, Y: ToNode(y).Node}}\n}","func (o SecurityPolicyRuleMatcherPtrOutput) Expr() ExprPtrOutput {\n\treturn o.ApplyT(func(v *SecurityPolicyRuleMatcher) *Expr {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Expr\n\t}).(ExprPtrOutput)\n}","func parse(expression string) *schedule {\n\treturn &schedule{}\n}","func (c *Context) Plan() (*Plan, error) {\n\tdefer c.acquireRun(\"plan\")()\n\n\tp := &Plan{\n\t\tModule: c.module,\n\t\tVars: c.variables,\n\t\tState: c.state,\n\t\tTargets: c.targets,\n\n\t\tTerraformVersion: version.String(),\n\t\tProviderSHA256s: c.providerSHA256s,\n\t}\n\n\tvar operation walkOperation\n\tif c.destroy {\n\t\toperation = walkPlanDestroy\n\t\tp.Destroy = true\n\t} else {\n\t\t// Set our state to be something temporary. We do this so that\n\t\t// the plan can update a fake state so that variables work, then\n\t\t// we replace it back with our old state.\n\t\told := c.state\n\t\tif old == nil {\n\t\t\tc.state = &State{}\n\t\t\tc.state.init()\n\t\t} else {\n\t\t\tc.state = old.DeepCopy()\n\t\t}\n\t\tdefer func() {\n\t\t\tc.state = old\n\t\t}()\n\n\t\toperation = walkPlan\n\t}\n\n\t// Setup our diff\n\tc.diffLock.Lock()\n\tc.diff = new(Diff)\n\tc.diff.init()\n\tc.diffLock.Unlock()\n\n\t// Build the graph.\n\tgraphType := GraphTypePlan\n\tif c.destroy {\n\t\tgraphType = GraphTypePlanDestroy\n\t}\n\tgraph, err := c.Graph(graphType, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Do the walk\n\twalker, err := c.walk(graph, operation)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tp.Diff = c.diff\n\n\t// If this is true, it means we're running unit tests. In this case,\n\t// we perform a deep copy just to ensure that all context tests also\n\t// test that a diff is copy-able. This will panic if it fails. This\n\t// is enabled during unit tests.\n\t//\n\t// This should never be true during production usage, but even if it is,\n\t// it can't do any real harm.\n\tif contextTestDeepCopyOnPlan {\n\t\tp.Diff.DeepCopy()\n\t}\n\n\t/*\n\t\t// We don't do the reverification during the new destroy plan because\n\t\t// it will use a different apply process.\n\t\tif X_legacyGraph {\n\t\t\t// Now that we have a diff, we can build the exact graph that Apply will use\n\t\t\t// and catch any possible cycles during the Plan phase.\n\t\t\tif _, err := c.Graph(GraphTypeLegacy, nil); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t*/\n\n\tvar errs error\n\tif len(walker.ValidationErrors) > 0 {\n\t\terrs = multierror.Append(errs, walker.ValidationErrors...)\n\t}\n\treturn p, errs\n}","func (p *Parser) parseMethodCallExpression(obj asti.ExpressionI) asti.ExpressionI {\n\tmethodCall := &ast.ObjectCallExpression{Token: p.curToken, Object: obj}\n\tp.nextToken()\n\tname := p.parseIdentifier()\n\tp.nextToken()\n\tmethodCall.Call = p.parseCallExpression(name)\n\treturn methodCall\n}","func Expr(expression string, args ...interface{}) *Query {\n\treturn &Query{expression, args}\n}","func New(zctx *zson.Context, parent proc.Interface, args []expr.Evaluator, typ zng.Type, name string) (proc.Interface, error) {\n\tcols := []zng.Column{{Name: name, Type: typ}}\n\trectyp := zctx.MustLookupTypeRecord(cols)\n\tbuilder := zng.NewBuilder(rectyp)\n\treturn &Proc{\n\t\tparent: parent,\n\t\tbuilder: *builder,\n\t\ttyp: typ,\n\t\targs: args,\n\t}, nil\n}","func (ng *Engine) exec(ctx context.Context, q *query) (model.Value, error) {\n\tcurrentQueries.Inc()\n\tdefer currentQueries.Dec()\n\tctx, cancel := context.WithTimeout(ctx, ng.options.Timeout)\n\tq.cancel = cancel\n\n\tqueueTimer := q.stats.GetTimer(stats.ExecQueueTime).Start()\n\n\tif err := ng.gate.Start(ctx); err != nil {\n\t\treturn nil, err\n\t}\n\tdefer ng.gate.Done()\n\n\tqueueTimer.Stop()\n\n\t// Cancel when execution is done or an error was raised.\n\tdefer q.cancel()\n\n\tconst env = \"query execution\"\n\n\tevalTimer := q.stats.GetTimer(stats.TotalEvalTime).Start()\n\tdefer evalTimer.Stop()\n\n\t// The base context might already be canceled on the first iteration (e.g. during shutdown).\n\tif err := contextDone(ctx, env); err != nil {\n\t\treturn nil, err\n\t}\n\n\tswitch s := q.Statement().(type) {\n\tcase *EvalStmt:\n\t\treturn ng.execEvalStmt(ctx, q, s)\n\tcase testStmt:\n\t\treturn nil, s(ctx)\n\t}\n\n\tpanic(fmt.Errorf(\"promql.Engine.exec: unhandled statement of type %T\", q.Statement()))\n}","func (fr *Frame) ParseExpression(s string) (result T) {\n\tlog.Printf(\"ParseExpression <- %q\", s)\n\n\tt, _ := fr.ParseExprRel(s)\n\n\treturn t\n}","func (fr *Frame) ParseExpression(s string) (result T) {\n\tt, _ := fr.ParseExprCond(s)\n\n\treturn t\n}","func (s *BaseMuParserListener) EnterParExpr(ctx *ParExprContext) {}","func (dsp *distSQLPlanner) PlanAndRun(\n\tctx context.Context, txn *client.Txn, tree planNode, recv *distSQLReceiver,\n) error {\n\t// Trigger limit propagation.\n\ttree.SetLimitHint(math.MaxInt64, true)\n\n\tplanCtx := planningCtx{\n\t\tctx: ctx,\n\t\tspanIter: dsp.spanResolver.NewSpanResolverIterator(),\n\t\tnodeAddresses: make(map[roachpb.NodeID]string),\n\t}\n\tthisNodeID := dsp.nodeDesc.NodeID\n\tplanCtx.nodeAddresses[thisNodeID] = dsp.nodeDesc.Address.String()\n\n\tplan, err := dsp.createPlanForNode(&planCtx, tree)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// If we don't already have a single result router on this node, add a final\n\t// stage.\n\tif len(plan.resultRouters) != 1 ||\n\t\tplan.processors[plan.resultRouters[0]].node != thisNodeID {\n\t\tdsp.addSingleGroupStage(\n\t\t\t&plan, thisNodeID, distsql.ProcessorCoreUnion{Noop: &distsql.NoopCoreSpec{}},\n\t\t)\n\t\tif len(plan.resultRouters) != 1 {\n\t\t\tpanic(fmt.Sprintf(\"%d results after single group stage\", len(plan.resultRouters)))\n\t\t}\n\t}\n\n\t// Set up the endpoints for p.streams.\n\tdsp.populateEndpoints(&planCtx, &plan)\n\n\t// Set up the endpoint for the final result.\n\tfinalOut := &plan.processors[plan.resultRouters[0]].spec.Output[0]\n\tfinalOut.Streams = append(finalOut.Streams, distsql.StreamEndpointSpec{\n\t\tType: distsql.StreamEndpointSpec_SYNC_RESPONSE,\n\t})\n\n\trecv.resultToStreamColMap = plan.planToStreamColMap\n\n\t// Split the processors by nodeID to create the FlowSpecs.\n\tflowID := distsql.FlowID{UUID: uuid.MakeV4()}\n\tnodeIDMap := make(map[roachpb.NodeID]int)\n\t// nodeAddresses contains addresses for the nodes that were referenced during\n\t// planning, so we're likely going to have this many nodes (and we have one\n\t// flow per node).\n\tnodeIDs := make([]roachpb.NodeID, 0, len(planCtx.nodeAddresses))\n\tflows := make([]distsql.FlowSpec, 0, len(planCtx.nodeAddresses))\n\n\tfor _, p := range plan.processors {\n\t\tidx, ok := nodeIDMap[p.node]\n\t\tif !ok {\n\t\t\tflow := distsql.FlowSpec{FlowID: flowID}\n\t\t\tidx = len(flows)\n\t\t\tflows = append(flows, flow)\n\t\t\tnodeIDs = append(nodeIDs, p.node)\n\t\t\tnodeIDMap[p.node] = idx\n\t\t}\n\t\tflows[idx].Processors = append(flows[idx].Processors, p.spec)\n\t}\n\n\tif logPlanDiagram {\n\t\tnodeNames := make([]string, len(nodeIDs))\n\t\tfor i, n := range nodeIDs {\n\t\t\tnodeNames[i] = n.String()\n\t\t}\n\n\t\tvar buf bytes.Buffer\n\t\tif err := distsql.GeneratePlanDiagram(flows, nodeNames, &buf); err != nil {\n\t\t\tlog.Infof(ctx, \"Error generating diagram: %s\", err)\n\t\t} else {\n\t\t\tlog.Infof(ctx, \"Plan diagram JSON:\\n%s\", buf.String())\n\t\t}\n\t}\n\n\t// Start the flows on all other nodes.\n\tfor i, nodeID := range nodeIDs {\n\t\tif nodeID == thisNodeID {\n\t\t\t// Skip this node.\n\t\t\tcontinue\n\t\t}\n\t\treq := distsql.SetupFlowRequest{\n\t\t\tTxn: txn.Proto,\n\t\t\tFlow: flows[i],\n\t\t}\n\t\tif err := distsql.SetFlowRequestTrace(ctx, &req); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tconn, err := dsp.rpcContext.GRPCDial(planCtx.nodeAddresses[nodeID])\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tclient := distsql.NewDistSQLClient(conn)\n\t\t// TODO(radu): we are not waiting for the flows to complete, but we are\n\t\t// still waiting for a round trip; we should start the flows in parallel, at\n\t\t// least if there are enough of them.\n\t\tif resp, err := client.SetupFlow(context.Background(), &req); err != nil {\n\t\t\treturn err\n\t\t} else if resp.Error != nil {\n\t\t\treturn resp.Error.GoError()\n\t\t}\n\t}\n\tlocalReq := distsql.SetupFlowRequest{\n\t\tTxn: txn.Proto,\n\t\tFlow: flows[nodeIDMap[thisNodeID]],\n\t}\n\tif err := distsql.SetFlowRequestTrace(ctx, &localReq); err != nil {\n\t\treturn err\n\t}\n\tflow, err := dsp.distSQLSrv.SetupSyncFlow(ctx, &localReq, recv)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// TODO(radu): this should go through the flow scheduler.\n\tflow.Start(func() {})\n\tflow.Wait()\n\tflow.Cleanup()\n\n\treturn nil\n}","func (b *PlanBuilder) rewrite(exprNode ast.ExprNode, p LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int, asScalar bool) (expression.Expression, LogicalPlan, error) {\n\ttrace_util_0.Count(_expression_rewriter_00000, 12)\n\texpr, resultPlan, err := b.rewriteWithPreprocess(exprNode, p, aggMapper, nil, asScalar, nil)\n\treturn expr, resultPlan, err\n}","func (t *TimeLine) Plan(nbars, num, denom uint32, callback func(delta int32)) {\n\t/*\n\t 1. calc the abs position for the callback by using forward\n\t 2. rewind cursor\n\t 3. register callback\n\t 4. sort planned callbacks\n\t*/\n\n\tsavedCursor := t.cursor\n\tt.forwardIgnoringCallbacks(nbars, num, denom)\n\tpos := t.cursor\n\tt.cursor = savedCursor\n\t//\tfmt.Printf(\"cursor: %v, pos: %v\\n\", t.cursor, pos)\n\tt.plannedCallbacks = append(t.plannedCallbacks, plannedCallback{callback: callback, position: pos})\n\tsort.Sort(t.plannedCallbacks)\n}","func newQueryPlan(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize int, w io.Writer) (*queryPlan, error) {\n\tt, err := table.New([]string{})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &queryPlan{\n\t\tstm: stm,\n\t\tstore: store,\n\t\tbndgs: stm.Bindings(),\n\t\tgrfsNames: stm.InputGraphNames(),\n\t\tclauses: stm.GraphPatternClauses(),\n\t\tfilters: stm.FilterClauses(),\n\t\ttbl: t,\n\t\tchanSize: chanSize,\n\t\ttracer: w,\n\t}, nil\n}","func CloneExpr(in Expr) Expr {\n\tif in == nil {\n\t\treturn nil\n\t}\n\tswitch in := in.(type) {\n\tcase *AndExpr:\n\t\treturn CloneRefOfAndExpr(in)\n\tcase Argument:\n\t\treturn in\n\tcase *BinaryExpr:\n\t\treturn CloneRefOfBinaryExpr(in)\n\tcase BoolVal:\n\t\treturn in\n\tcase *CaseExpr:\n\t\treturn CloneRefOfCaseExpr(in)\n\tcase *ColName:\n\t\treturn CloneRefOfColName(in)\n\tcase *CollateExpr:\n\t\treturn CloneRefOfCollateExpr(in)\n\tcase *ComparisonExpr:\n\t\treturn CloneRefOfComparisonExpr(in)\n\tcase *ConvertExpr:\n\t\treturn CloneRefOfConvertExpr(in)\n\tcase *ConvertUsingExpr:\n\t\treturn CloneRefOfConvertUsingExpr(in)\n\tcase *CurTimeFuncExpr:\n\t\treturn CloneRefOfCurTimeFuncExpr(in)\n\tcase *Default:\n\t\treturn CloneRefOfDefault(in)\n\tcase *ExistsExpr:\n\t\treturn CloneRefOfExistsExpr(in)\n\tcase *FuncExpr:\n\t\treturn CloneRefOfFuncExpr(in)\n\tcase *GroupConcatExpr:\n\t\treturn CloneRefOfGroupConcatExpr(in)\n\tcase *IntervalExpr:\n\t\treturn CloneRefOfIntervalExpr(in)\n\tcase *IsExpr:\n\t\treturn CloneRefOfIsExpr(in)\n\tcase ListArg:\n\t\treturn CloneListArg(in)\n\tcase *Literal:\n\t\treturn CloneRefOfLiteral(in)\n\tcase *MatchExpr:\n\t\treturn CloneRefOfMatchExpr(in)\n\tcase *NotExpr:\n\t\treturn CloneRefOfNotExpr(in)\n\tcase *NullVal:\n\t\treturn CloneRefOfNullVal(in)\n\tcase *OrExpr:\n\t\treturn CloneRefOfOrExpr(in)\n\tcase *RangeCond:\n\t\treturn CloneRefOfRangeCond(in)\n\tcase *Subquery:\n\t\treturn CloneRefOfSubquery(in)\n\tcase *SubstrExpr:\n\t\treturn CloneRefOfSubstrExpr(in)\n\tcase *TimestampFuncExpr:\n\t\treturn CloneRefOfTimestampFuncExpr(in)\n\tcase *UnaryExpr:\n\t\treturn CloneRefOfUnaryExpr(in)\n\tcase ValTuple:\n\t\treturn CloneValTuple(in)\n\tcase *ValuesFuncExpr:\n\t\treturn CloneRefOfValuesFuncExpr(in)\n\tcase *XorExpr:\n\t\treturn CloneRefOfXorExpr(in)\n\tdefault:\n\t\t// this should never happen\n\t\treturn nil\n\t}\n}","func (g *memoGroup) addExpr(mexpr *memoExpr) exprID {\n\tg.exprs = append(g.exprs, *mexpr)\n\treturn exprID(len(g.exprs) - 1)\n}","func CreateNewExpr() Expr {\n\tc11 := Constant{value: 1.1}\n\tc22 := Constant{value: 2.2}\n\tc33 := Constant{value: 3.3}\n\tbp := BinaryPlus{left: &BinaryPlus{left: &c11, right: &c22}, right: &c33}\n\treturn &bp\n}","func SelectPlan(possiblePlans []string, ov *OperatorVersion) *string {\n\tfor _, plan := range possiblePlans {\n\t\tif _, ok := ov.Spec.Plans[plan]; ok {\n\t\t\treturn &plan\n\t\t}\n\t}\n\treturn nil\n}","func (s *BaseConcertoListener) EnterPrimaryExpr(ctx *PrimaryExprContext) {}","func newFuncExpr(funcName FuncName, funcs ...Expr) (*funcExpr, error) {\n\tswitch funcName {\n\tcase Avg, Max, Min, Sum:\n\t\tif len(funcs) != 1 {\n\t\t\terr := fmt.Errorf(\"%v(): exactly one argument expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errParseNonUnaryAgregateFunctionCall(err)\n\t\t}\n\n\t\tif !funcs[0].ReturnType().isNumberKind() {\n\t\t\terr := fmt.Errorf(\"%v(): argument %v evaluate to %v, not number\", funcName, funcs[0], funcs[0].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\n\tcase Count:\n\t\tif len(funcs) != 1 {\n\t\t\terr := fmt.Errorf(\"%v(): exactly one argument expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errParseNonUnaryAgregateFunctionCall(err)\n\t\t}\n\n\t\tswitch funcs[0].ReturnType() {\n\t\tcase Null, Bool, Int, Float, String, Timestamp, column, record:\n\t\tdefault:\n\t\t\terr := fmt.Errorf(\"%v(): argument %v evaluate to %v is incompatible\", funcName, funcs[0], funcs[0].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\n\tcase CharLength, CharacterLength, Trim, Lower, Upper, ToTimestamp:\n\t\tif len(funcs) != 1 {\n\t\t\terr := fmt.Errorf(\"%v(): exactly one argument expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errEvaluatorInvalidArguments(err)\n\t\t}\n\n\t\tif !funcs[0].ReturnType().isStringKind() {\n\t\t\terr := fmt.Errorf(\"%v(): argument %v evaluate to %v, not string\", funcName, funcs[0], funcs[0].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\n\tcase Coalesce:\n\t\tif len(funcs) < 1 {\n\t\t\terr := fmt.Errorf(\"%v(): one or more argument expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errEvaluatorInvalidArguments(err)\n\t\t}\n\n\t\tfor i := range funcs {\n\t\t\tif !funcs[i].ReturnType().isBaseKind() {\n\t\t\t\terr := fmt.Errorf(\"%v(): argument-%v %v evaluate to %v is incompatible\", funcName, i+1, funcs[i], funcs[i].ReturnType())\n\t\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t\t}\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\n\tcase NullIf:\n\t\tif len(funcs) != 2 {\n\t\t\terr := fmt.Errorf(\"%v(): exactly two arguments expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errEvaluatorInvalidArguments(err)\n\t\t}\n\n\t\tif !funcs[0].ReturnType().isBaseKind() {\n\t\t\terr := fmt.Errorf(\"%v(): argument-1 %v evaluate to %v is incompatible\", funcName, funcs[0], funcs[0].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\tif !funcs[1].ReturnType().isBaseKind() {\n\t\t\terr := fmt.Errorf(\"%v(): argument-2 %v evaluate to %v is incompatible\", funcName, funcs[1], funcs[1].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\n\tcase UTCNow:\n\t\tif len(funcs) != 0 {\n\t\t\terr := fmt.Errorf(\"%v(): no argument expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errEvaluatorInvalidArguments(err)\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\n\tcase Substring:\n\t\tif len(funcs) < 2 || len(funcs) > 3 {\n\t\t\terr := fmt.Errorf(\"%v(): exactly two or three arguments expected; got %v\", funcName, len(funcs))\n\t\t\treturn nil, errEvaluatorInvalidArguments(err)\n\t\t}\n\n\t\tif !funcs[0].ReturnType().isStringKind() {\n\t\t\terr := fmt.Errorf(\"%v(): argument-1 %v evaluate to %v, not string\", funcName, funcs[0], funcs[0].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\tif !funcs[1].ReturnType().isIntKind() {\n\t\t\terr := fmt.Errorf(\"%v(): argument-2 %v evaluate to %v, not int\", funcName, funcs[1], funcs[1].ReturnType())\n\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t}\n\n\t\tif len(funcs) > 2 {\n\t\t\tif !funcs[2].ReturnType().isIntKind() {\n\t\t\t\terr := fmt.Errorf(\"%v(): argument-3 %v evaluate to %v, not int\", funcName, funcs[2], funcs[2].ReturnType())\n\t\t\t\treturn nil, errIncorrectSQLFunctionArgumentType(err)\n\t\t\t}\n\t\t}\n\n\t\treturn &funcExpr{\n\t\t\targs: funcs,\n\t\t\tname: funcName,\n\t\t}, nil\n\t}\n\n\treturn nil, errUnsupportedFunction(fmt.Errorf(\"unknown function name %v\", funcName))\n}","func (m *Model) NewProc(ctx nn.Context) nn.Processor {\n\treturn &Processor{\n\t\tBaseProcessor: nn.BaseProcessor{\n\t\t\tModel: m,\n\t\t\tMode: ctx.Mode,\n\t\t\tGraph: ctx.Graph,\n\t\t\tFullSeqProcessing: true,\n\t\t},\n\t\tscaleFactor: m.ScaleFactor,\n\t\tquery: m.Query.NewProc(ctx).(*linear.Processor),\n\t\tvalue: m.Value.NewProc(ctx).(*linear.Processor),\n\t\tr: ctx.Graph.NewWrap(m.R),\n\t\tAttention: nil,\n\t}\n}","func NewPlan(config *Config, name string) (plan *Plan, err error) {\n\tpath, err := FindPlanPath(config, name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tplan, err = ReadPath(path.String())\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn plan, nil\n}","func (p *Qlang) Eval(expr string) (err error) {\n\n\treturn p.Exec([]byte(expr), \"\")\n}","func (c *Context) CMOVQPL(mr, r operand.Op) {\n\tc.addinstruction(x86.CMOVQPL(mr, r))\n}","func RegexpFromQuery(q string) (*regexp.Regexp, error) {\n\tplan, err := query.Pipeline(query.Init(q, query.SearchTypeRegex))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif len(plan) != 1 {\n\t\treturn nil, errors.New(\"compute endpoint only supports one search pattern currently ('and' or 'or' operators are not supported yet)\")\n\t}\n\tswitch node := plan[0].Pattern.(type) {\n\tcase query.Operator:\n\t\tif len(node.Operands) == 1 {\n\t\t\tif pattern, ok := node.Operands[0].(query.Pattern); ok && !pattern.Negated {\n\t\t\t\trp, err := regexp.Compile(pattern.Value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, errors.Wrap(err, \"regular expression is not valid for compute endpoint\")\n\t\t\t\t}\n\t\t\t\treturn rp, nil\n\t\t\t}\n\t\t}\n\t\treturn nil, errors.New(\"compute endpoint only supports one search pattern currently ('and' or 'or' operators are not supported yet)\")\n\tcase query.Pattern:\n\t\tif !node.Negated {\n\t\t\treturn regexp.Compile(node.Value)\n\t\t}\n\t}\n\t// unreachable\n\treturn nil, nil\n}","func (m *Projection) projectionEvaluator() MessageHandler {\n\tout := m.MessageOut()\n\tcolumns := m.sql.Columns\n\t// if len(m.sql.From) > 1 && m.sql.From[0].Source != nil && len(m.sql.From[0].Source.Columns) > 0 {\n\t// \t// we have re-written this query, lets build new list of columns\n\t// \tcolumns = make(expr.Columns, 0)\n\t// \tfor _, from := range m.sql.From {\n\t// \t\tfor _, col := range from.Source.Columns {\n\t// \t\t\tcolumns = append(columns, col)\n\t// \t\t}\n\t// \t}\n\t// }\n\treturn func(ctx *expr.Context, msg datasource.Message) bool {\n\t\t// defer func() {\n\t\t// \tif r := recover(); r != nil {\n\t\t// \t\tu.Errorf(\"crap, %v\", r)\n\t\t// \t}\n\t\t// }()\n\n\t\t//u.Infof(\"got projection message: %T %#v\", msg, msg.Body())\n\t\tvar outMsg datasource.Message\n\t\tswitch mt := msg.(type) {\n\t\tcase *datasource.SqlDriverMessageMap:\n\t\t\t// readContext := datasource.NewContextUrlValues(uv)\n\t\t\t// use our custom write context for example purposes\n\t\t\twriteContext := datasource.NewContextSimple()\n\t\t\toutMsg = writeContext\n\t\t\t//u.Debugf(\"about to project: %#v\", mt)\n\t\t\tfor _, col := range columns {\n\t\t\t\tif col.ParentIndex < 0 {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\t//u.Debugf(\"col: idx:%v pidx:%v key:%v %s\", col.Index, col.ParentIndex, col.Key(), col.Expr)\n\t\t\t\tif col.Guard != nil {\n\t\t\t\t\tifColValue, ok := vm.Eval(mt, col.Guard)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tu.Errorf(\"Could not evaluate if: %v\", col.Guard.String())\n\t\t\t\t\t\t//return fmt.Errorf(\"Could not evaluate if clause: %v\", col.Guard.String())\n\t\t\t\t\t}\n\t\t\t\t\t//u.Debugf(\"if eval val: %T:%v\", ifColValue, ifColValue)\n\t\t\t\t\tswitch ifColVal := ifColValue.(type) {\n\t\t\t\t\tcase value.BoolValue:\n\t\t\t\t\t\tif ifColVal.Val() == false {\n\t\t\t\t\t\t\t//u.Debugf(\"Filtering out col\")\n\t\t\t\t\t\t\tcontinue\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif col.Star {\n\t\t\t\t\tfor k, v := range mt.Row() {\n\t\t\t\t\t\twriteContext.Put(&expr.Column{As: k}, nil, value.NewValue(v))\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tv, ok := vm.Eval(mt, col.Expr)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tu.Warnf(\"failed eval key=%v val=%#v expr:%s mt:%#v\", col.Key(), v, col.Expr, mt)\n\t\t\t\t\t} else if v == nil {\n\t\t\t\t\t\tu.Debugf(\"evaled: key=%v val=%v\", col.Key(), v)\n\t\t\t\t\t\twriteContext.Put(col, mt, v)\n\t\t\t\t\t} else {\n\t\t\t\t\t\t//u.Debugf(\"evaled: key=%v val=%v\", col.Key(), v.Value())\n\t\t\t\t\t\twriteContext.Put(col, mt, v)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\tcase *datasource.ContextUrlValues:\n\t\t\t// readContext := datasource.NewContextUrlValues(uv)\n\t\t\t// use our custom write context for example purposes\n\t\t\twriteContext := datasource.NewContextSimple()\n\t\t\toutMsg = writeContext\n\t\t\t//u.Infof(\"about to project: colsct%v %#v\", len(sql.Columns), outMsg)\n\t\t\tfor _, col := range columns {\n\t\t\t\t//u.Debugf(\"col: %#v\", col)\n\t\t\t\tif col.Guard != nil {\n\t\t\t\t\tifColValue, ok := vm.Eval(mt, col.Guard)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tu.Errorf(\"Could not evaluate if: %v\", col.Guard.String())\n\t\t\t\t\t\t//return fmt.Errorf(\"Could not evaluate if clause: %v\", col.Guard.String())\n\t\t\t\t\t}\n\t\t\t\t\t//u.Debugf(\"if eval val: %T:%v\", ifColValue, ifColValue)\n\t\t\t\t\tswitch ifColVal := ifColValue.(type) {\n\t\t\t\t\tcase value.BoolValue:\n\t\t\t\t\t\tif ifColVal.Val() == false {\n\t\t\t\t\t\t\t//u.Debugf(\"Filtering out col\")\n\t\t\t\t\t\t\tcontinue\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif col.Star {\n\t\t\t\t\tfor k, v := range mt.Row() {\n\t\t\t\t\t\twriteContext.Put(&expr.Column{As: k}, nil, v)\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t//u.Debugf(\"tree.Root: as?%v %#v\", col.As, col.Expr)\n\t\t\t\t\tv, ok := vm.Eval(mt, col.Expr)\n\t\t\t\t\t//u.Debugf(\"evaled: ok?%v key=%v val=%v\", ok, col.Key(), v)\n\t\t\t\t\tif ok {\n\t\t\t\t\t\twriteContext.Put(col, mt, v)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\tdefault:\n\t\t\tu.Errorf(\"could not project msg: %T\", msg)\n\t\t}\n\n\t\t//u.Debugf(\"completed projection for: %p %#v\", out, outMsg)\n\t\tselect {\n\t\tcase out <- outMsg:\n\t\t\treturn true\n\t\tcase <-m.SigChan():\n\t\t\treturn false\n\t\t}\n\t}\n}","func (*dedicatedRenderer) evaluateWhenExpression(params *mapEvalParameters, exprString string) (interface{}, error) {\n\texpr, err := govaluate.NewEvaluableExpression(exprString)\n\tif err != nil {\n\t\treturn nil, errors.Wrap(err, \"while parsing expression\")\n\t}\n\n\tresult, err := expr.Eval(params)\n\tif err != nil {\n\t\treturn nil, errors.Wrap(err, \"while evaluating expression\")\n\t}\n\n\treturn result, nil\n}","func Expr(sql string, args ...interface{}) expr {\n\treturn expr{sql: sql, args: args}\n}","func NewRuleExpression(cache *LocalActionsCache) *RuleExpression {\n\treturn &RuleExpression{\n\t\tRuleBase: RuleBase{name: \"expression\"},\n\t\tmatrixTy: nil,\n\t\tstepsTy: nil,\n\t\tneedsTy: nil,\n\t\tworkflow: nil,\n\t\tlocalActions: cache,\n\t}\n}","func eval(rpn string) {\n\t//The buffer stack\n\tbuf := new(Stack)\n\t//List of virtual indexes created\n\t//virt := []string{}\n\n\t//Break the expression into fields\n\te := strings.Fields(rpn)\n\n\t//Iterate over the stack and evaluate using the buffer stack\n\tfor i := range e {\n\t\t//If the token is an operator, pop two items off the buffer and perform the binary operation\n\t\tif isOp(e[i]) {\n\t\t\tv := performBinOp(e[i], buf.Pop().(string), buf.Pop().(string))\n\t\t\tbuf.Push(v)\n\t\t} else {\n\t\t\t//If the token is not an operator, push onto the buffer\n\t\t\tbuf.Push(e[i])\n\t\t}\n\t}\n}","func Eval(ctx context.Context, e Expr, vs Values) (interface{}, error) {\r\n\tfn, err := FuncOf(ctx, e, vs)\r\n\tif err != nil {\r\n\t\treturn nil, err\r\n\t}\r\n\treturn fn.Call(ctx, vs)\r\n}","func (e *Evaluator) Eval(expr *tipb.Expr) (types.Datum, error) {\n\tswitch expr.GetTp() {\n\tcase tipb.ExprType_Null:\n\t\treturn types.Datum{}, nil\n\tcase tipb.ExprType_Int64:\n\t\treturn e.evalInt(expr.Val)\n\tcase tipb.ExprType_Uint64:\n\t\treturn e.evalUint(expr.Val)\n\tcase tipb.ExprType_String:\n\t\treturn e.evalString(expr.Val)\n\tcase tipb.ExprType_Bytes:\n\t\treturn types.NewBytesDatum(expr.Val), nil\n\tcase tipb.ExprType_Float32:\n\t\treturn e.evalFloat(expr.Val, true)\n\tcase tipb.ExprType_Float64:\n\t\treturn e.evalFloat(expr.Val, false)\n\tcase tipb.ExprType_MysqlDecimal:\n\t\treturn e.evalDecimal(expr.Val)\n\tcase tipb.ExprType_MysqlDuration:\n\t\treturn e.evalDuration(expr.Val)\n\tcase tipb.ExprType_ColumnRef:\n\t\treturn e.evalColumnRef(expr.Val)\n\tcase tipb.ExprType_LT:\n\t\treturn e.evalLT(expr)\n\tcase tipb.ExprType_LE:\n\t\treturn e.evalLE(expr)\n\tcase tipb.ExprType_EQ:\n\t\treturn e.evalEQ(expr)\n\tcase tipb.ExprType_NE:\n\t\treturn e.evalNE(expr)\n\tcase tipb.ExprType_GE:\n\t\treturn e.evalGE(expr)\n\tcase tipb.ExprType_GT:\n\t\treturn e.evalGT(expr)\n\tcase tipb.ExprType_NullEQ:\n\t\treturn e.evalNullEQ(expr)\n\tcase tipb.ExprType_And:\n\t\treturn e.evalAnd(expr)\n\tcase tipb.ExprType_Or:\n\t\treturn e.evalOr(expr)\n\tcase tipb.ExprType_Like:\n\t\treturn e.evalLike(expr)\n\tcase tipb.ExprType_Not:\n\t\treturn e.evalNot(expr)\n\tcase tipb.ExprType_In:\n\t\treturn e.evalIn(expr)\n\tcase tipb.ExprType_Plus, tipb.ExprType_Div:\n\t\treturn e.evalArithmetic(expr)\n\t}\n\treturn types.Datum{}, nil\n}","func (stmt *statement) Expr(expr string, args ...interface{}) Statement {\n\tstmt.addPart(stmt.position, \"\", expr, args, \", \")\n\treturn stmt\n}"],"string":"[\n \"func (p *ExecutionPlanner) compileExpr(expr parser.Expr) (_ types.PlanExpression, err error) {\\n\\tif expr == nil {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\tswitch expr := expr.(type) {\\n\\tcase *parser.BinaryExpr:\\n\\t\\treturn p.compileBinaryExpr(expr)\\n\\n\\tcase *parser.BoolLit:\\n\\t\\treturn newBoolLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.Call:\\n\\t\\treturn p.compileCallExpr(expr)\\n\\n\\tcase *parser.CastExpr:\\n\\t\\tcastExpr, err := p.compileExpr(expr.X)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tdataType, err := dataTypeFromParserType(expr.Type)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newCastPlanExpression(castExpr, dataType), nil\\n\\n\\tcase *parser.Exists:\\n\\t\\treturn nil, sql3.NewErrInternal(\\\"exists expressions are not supported\\\")\\n\\n\\tcase *parser.ExprList:\\n\\t\\texprList := []types.PlanExpression{}\\n\\t\\tfor _, e := range expr.Exprs {\\n\\t\\t\\tlistExpr, err := p.compileExpr(e)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\texprList = append(exprList, listExpr)\\n\\t\\t}\\n\\t\\treturn newExprListExpression(exprList), nil\\n\\n\\tcase *parser.SetLiteralExpr:\\n\\t\\texprList := []types.PlanExpression{}\\n\\t\\tfor _, e := range expr.Members {\\n\\t\\t\\tlistExpr, err := p.compileExpr(e)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\texprList = append(exprList, listExpr)\\n\\t\\t}\\n\\t\\treturn newExprSetLiteralPlanExpression(exprList, expr.DataType()), nil\\n\\n\\tcase *parser.TupleLiteralExpr:\\n\\t\\texprList := []types.PlanExpression{}\\n\\t\\tfor _, e := range expr.Members {\\n\\t\\t\\tlistExpr, err := p.compileExpr(e)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\texprList = append(exprList, listExpr)\\n\\t\\t}\\n\\t\\treturn newExprTupleLiteralPlanExpression(exprList, expr.DataType()), nil\\n\\n\\tcase *parser.Ident:\\n\\t\\treturn nil, sql3.NewErrInternal(\\\"identifiers are not supported\\\")\\n\\n\\tcase *parser.NullLit:\\n\\t\\treturn newNullLiteralPlanExpression(), nil\\n\\n\\tcase *parser.IntegerLit:\\n\\t\\treturn newIntLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.FloatLit:\\n\\t\\treturn newFloatLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.DateLit:\\n\\t\\treturn newDateLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.ParenExpr:\\n\\t\\treturn p.compileExpr(expr.X)\\n\\n\\tcase *parser.QualifiedRef:\\n\\t\\tref := newQualifiedRefPlanExpression(parser.IdentName(expr.Table), parser.IdentName(expr.Column), expr.ColumnIndex, expr.DataType())\\n\\t\\tp.addReference(ref)\\n\\t\\treturn ref, nil\\n\\n\\tcase *parser.Range:\\n\\t\\tlhs, err := p.compileExpr(expr.X)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\trhs, err := p.compileExpr(expr.Y)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newRangeOpPlanExpression(lhs, rhs, expr.ResultDataType), nil\\n\\n\\tcase *parser.StringLit:\\n\\t\\treturn newStringLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.UnaryExpr:\\n\\t\\treturn p.compileUnaryExpr(expr)\\n\\n\\tcase *parser.CaseExpr:\\n\\t\\toperand, err := p.compileExpr(expr.Operand)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tblocks := []types.PlanExpression{}\\n\\t\\tfor _, b := range expr.Blocks {\\n\\t\\t\\tblock, err := p.compileExpr(b)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tblocks = append(blocks, block)\\n\\t\\t}\\n\\n\\t\\telseExpr, err := p.compileExpr(expr.ElseExpr)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newCasePlanExpression(operand, blocks, elseExpr, expr.DataType()), nil\\n\\n\\tcase *parser.CaseBlock:\\n\\n\\t\\tcondition, err := p.compileExpr(expr.Condition)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tbody, err := p.compileExpr(expr.Body)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newCaseBlockPlanExpression(condition, body), nil\\n\\n\\tcase *parser.SelectStatement:\\n\\t\\tselOp, err := p.compileSelectStatement(expr, true)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newSubqueryPlanExpression(selOp), nil\\n\\n\\tdefault:\\n\\t\\treturn nil, sql3.NewErrInternalf(\\\"unexpected SQL expression type: %T\\\", expr)\\n\\t}\\n}\",\n \"func (p *Planner) planBinaryExpr(e *Executor, expr *BinaryExpr) (processor, error) {\\n\\t// Create processor for LHS.\\n\\tlhs, err := p.planExpr(e, expr.LHS)\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"lhs: %s\\\", err)\\n\\t}\\n\\n\\t// Create processor for RHS.\\n\\trhs, err := p.planExpr(e, expr.RHS)\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"rhs: %s\\\", err)\\n\\t}\\n\\n\\t// Combine processors.\\n\\treturn newBinaryExprEvaluator(e, expr.Op, lhs, rhs), nil\\n}\",\n \"func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {\\n\\t// Ensure there is a single argument.\\n\\tif len(c.Args) != 1 {\\n\\t\\treturn nil, fmt.Errorf(\\\"expected one argument for %s()\\\", c.Name)\\n\\t}\\n\\n\\t// Ensure the argument is a variable reference.\\n\\tref, ok := c.Args[0].(*VarRef)\\n\\tif !ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"expected field argument in %s()\\\", c.Name)\\n\\t}\\n\\n\\t// Extract the substatement for the call.\\n\\tsub, err := e.stmt.Substatement(ref)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tname := sub.Source.(*Measurement).Name\\n\\n\\t// Extract tags from conditional.\\n\\ttags := make(map[string]string)\\n\\tcondition, err := p.extractTags(name, sub.Condition, tags)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tsub.Condition = condition\\n\\n\\t// Find field.\\n\\tfname := strings.TrimPrefix(ref.Val, name+\\\".\\\")\\n\\tfieldID, typ := e.db.Field(name, fname)\\n\\tif fieldID == 0 {\\n\\t\\treturn nil, fmt.Errorf(\\\"field not found: %s.%s\\\", name, fname)\\n\\t}\\n\\n\\t// Generate a reducer for the given function.\\n\\tr := newReducer(e)\\n\\tr.stmt = sub\\n\\n\\t// Retrieve a list of series data ids.\\n\\tseriesIDs := p.DB.MatchSeries(name, tags)\\n\\n\\t// Generate mappers for each id.\\n\\tr.mappers = make([]*mapper, len(seriesIDs))\\n\\tfor i, seriesID := range seriesIDs {\\n\\t\\tm := newMapper(e, seriesID, fieldID, typ)\\n\\t\\tm.min, m.max = e.min.UnixNano(), e.max.UnixNano()\\n\\t\\tm.interval = int64(e.interval)\\n\\t\\tm.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)\\n\\t\\tr.mappers[i] = m\\n\\t}\\n\\n\\t// Set the appropriate reducer function.\\n\\tswitch strings.ToLower(c.Name) {\\n\\tcase \\\"count\\\":\\n\\t\\tr.fn = reduceSum\\n\\t\\tfor _, m := range r.mappers {\\n\\t\\t\\tm.fn = mapCount\\n\\t\\t}\\n\\tcase \\\"sum\\\":\\n\\t\\tr.fn = reduceSum\\n\\t\\tfor _, m := range r.mappers {\\n\\t\\t\\tm.fn = mapSum\\n\\t\\t}\\n\\tdefault:\\n\\t\\treturn nil, fmt.Errorf(\\\"function not found: %q\\\", c.Name)\\n\\t}\\n\\n\\treturn r, nil\\n}\",\n \"func planFilterExpr(\\n\\tctx context.Context,\\n\\tflowCtx *execinfra.FlowCtx,\\n\\tevalCtx *tree.EvalContext,\\n\\tinput colexecop.Operator,\\n\\tcolumnTypes []*types.T,\\n\\tfilter execinfrapb.Expression,\\n\\tacc *mon.BoundAccount,\\n\\tfactory coldata.ColumnFactory,\\n\\thelper *colexecargs.ExprHelper,\\n) (colexecop.Operator, error) {\\n\\tsemaCtx := flowCtx.TypeResolverFactory.NewSemaContext(evalCtx.Txn)\\n\\texpr, err := helper.ProcessExpr(filter, semaCtx, evalCtx, columnTypes)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif expr == tree.DNull {\\n\\t\\t// The filter expression is tree.DNull meaning that it is always false, so\\n\\t\\t// we put a zero operator.\\n\\t\\treturn colexecutils.NewZeroOp(input), nil\\n\\t}\\n\\top, _, filterColumnTypes, err := planSelectionOperators(\\n\\t\\tctx, evalCtx, expr, columnTypes, input, acc, factory,\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrapf(err, \\\"unable to columnarize filter expression %q\\\", filter)\\n\\t}\\n\\tif len(filterColumnTypes) > len(columnTypes) {\\n\\t\\t// Additional columns were appended to store projections while\\n\\t\\t// evaluating the filter. Project them away.\\n\\t\\tvar outputColumns []uint32\\n\\t\\tfor i := range columnTypes {\\n\\t\\t\\toutputColumns = append(outputColumns, uint32(i))\\n\\t\\t}\\n\\t\\top = colexecbase.NewSimpleProjectOp(op, len(filterColumnTypes), outputColumns)\\n\\t}\\n\\treturn op, nil\\n}\",\n \"func (p *Planner) planField(e *Executor, f *Field) (processor, error) {\\n\\treturn p.planExpr(e, f.Expr)\\n}\",\n \"func (fr *Frame) EvalExpr(a T) (result T) {\\n\\treturn fr.ParseExpression(a.String())\\n}\",\n \"func (c *compiledField) compileExpr(expr influxql.Expr) error {\\n\\tswitch expr := expr.(type) {\\n\\tcase *influxql.VarRef:\\n\\t\\t// A bare variable reference will require auxiliary fields.\\n\\t\\tc.global.HasAuxiliaryFields = true\\n\\t\\treturn nil\\n\\tcase *influxql.Wildcard:\\n\\t\\t// Wildcards use auxiliary fields. We assume there will be at least one\\n\\t\\t// expansion.\\n\\t\\tc.global.HasAuxiliaryFields = true\\n\\t\\tif !c.AllowWildcard {\\n\\t\\t\\treturn errors.New(\\\"unable to use wildcard in a binary expression\\\")\\n\\t\\t}\\n\\t\\treturn nil\\n\\tcase *influxql.RegexLiteral:\\n\\t\\tif !c.AllowWildcard {\\n\\t\\t\\treturn errors.New(\\\"unable to use regex in a binary expression\\\")\\n\\t\\t}\\n\\t\\tc.global.HasAuxiliaryFields = true\\n\\t\\treturn nil\\n\\tcase *influxql.Call:\\n\\t\\tif isMathFunction(expr) {\\n\\t\\t\\treturn c.compileMathFunction(expr)\\n\\t\\t}\\n\\n\\t\\t// Register the function call in the list of function calls.\\n\\t\\tc.global.FunctionCalls = append(c.global.FunctionCalls, expr)\\n\\n\\t\\tswitch expr.Name {\\n\\t\\tcase \\\"percentile\\\":\\n\\t\\t\\treturn c.compilePercentile(expr.Args)\\n\\t\\tcase \\\"sample\\\":\\n\\t\\t\\treturn c.compileSample(expr.Args)\\n\\t\\tcase \\\"distinct\\\":\\n\\t\\t\\treturn c.compileDistinct(expr.Args, false)\\n\\t\\tcase \\\"top\\\", \\\"bottom\\\":\\n\\t\\t\\treturn c.compileTopBottom(expr)\\n\\t\\tcase \\\"derivative\\\", \\\"non_negative_derivative\\\":\\n\\t\\t\\tisNonNegative := expr.Name == \\\"non_negative_derivative\\\"\\n\\t\\t\\treturn c.compileDerivative(expr.Args, isNonNegative)\\n\\t\\tcase \\\"difference\\\", \\\"non_negative_difference\\\":\\n\\t\\t\\tisNonNegative := expr.Name == \\\"non_negative_difference\\\"\\n\\t\\t\\treturn c.compileDifference(expr.Args, isNonNegative)\\n\\t\\tcase \\\"cumulative_sum\\\":\\n\\t\\t\\treturn c.compileCumulativeSum(expr.Args)\\n\\t\\tcase \\\"moving_average\\\":\\n\\t\\t\\treturn c.compileMovingAverage(expr.Args)\\n\\t\\tcase \\\"exponential_moving_average\\\", \\\"double_exponential_moving_average\\\", \\\"triple_exponential_moving_average\\\", \\\"relative_strength_index\\\", \\\"triple_exponential_derivative\\\":\\n\\t\\t\\treturn c.compileExponentialMovingAverage(expr.Name, expr.Args)\\n\\t\\tcase \\\"kaufmans_efficiency_ratio\\\", \\\"kaufmans_adaptive_moving_average\\\":\\n\\t\\t\\treturn c.compileKaufmans(expr.Name, expr.Args)\\n\\t\\tcase \\\"chande_momentum_oscillator\\\":\\n\\t\\t\\treturn c.compileChandeMomentumOscillator(expr.Args)\\n\\t\\tcase \\\"elapsed\\\":\\n\\t\\t\\treturn c.compileElapsed(expr.Args)\\n\\t\\tcase \\\"integral\\\":\\n\\t\\t\\treturn c.compileIntegral(expr.Args)\\n\\t\\tcase \\\"holt_winters\\\", \\\"holt_winters_with_fit\\\":\\n\\t\\t\\twithFit := expr.Name == \\\"holt_winters_with_fit\\\"\\n\\t\\t\\treturn c.compileHoltWinters(expr.Args, withFit)\\n\\t\\tdefault:\\n\\t\\t\\treturn c.compileFunction(expr)\\n\\t\\t}\\n\\tcase *influxql.Distinct:\\n\\t\\tcall := expr.NewCall()\\n\\t\\tc.global.FunctionCalls = append(c.global.FunctionCalls, call)\\n\\t\\treturn c.compileDistinct(call.Args, false)\\n\\tcase *influxql.BinaryExpr:\\n\\t\\t// Disallow wildcards in binary expressions. RewriteFields, which expands\\n\\t\\t// wildcards, is too complicated if we allow wildcards inside of expressions.\\n\\t\\tc.AllowWildcard = false\\n\\n\\t\\t// Check if either side is a literal so we only compile one side if it is.\\n\\t\\tif _, ok := expr.LHS.(influxql.Literal); ok {\\n\\t\\t\\tif _, ok := expr.RHS.(influxql.Literal); ok {\\n\\t\\t\\t\\treturn errors.New(\\\"cannot perform a binary expression on two literals\\\")\\n\\t\\t\\t}\\n\\t\\t\\treturn c.compileExpr(expr.RHS)\\n\\t\\t} else if _, ok := expr.RHS.(influxql.Literal); ok {\\n\\t\\t\\treturn c.compileExpr(expr.LHS)\\n\\t\\t} else {\\n\\t\\t\\t// Validate both sides of the expression.\\n\\t\\t\\tif err := c.compileExpr(expr.LHS); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\tif err := c.compileExpr(expr.RHS); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\tcase *influxql.ParenExpr:\\n\\t\\treturn c.compileExpr(expr.Expr)\\n\\tcase influxql.Literal:\\n\\t\\treturn errors.New(\\\"field must contain at least one variable\\\")\\n\\t}\\n\\treturn errors.New(\\\"unimplemented\\\")\\n}\",\n \"func execParseExpr(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(1)\\n\\tret, ret1 := parser.ParseExpr(args[0].(string))\\n\\tp.Ret(1, ret, ret1)\\n}\",\n \"func makePlanValue(n sqlparser.Expr) (*sqltypes.PlanValue, error) {\\n\\tvalue, err := sqlparser.NewPlanValue(n)\\n\\tif err != nil {\\n\\t\\t// if we are unable to create a PlanValue, we can't use a vindex, but we don't have to fail\\n\\t\\tif strings.Contains(err.Error(), \\\"expression is too complex\\\") {\\n\\t\\t\\treturn nil, nil\\n\\t\\t}\\n\\t\\t// something else went wrong, return the error\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn &value, nil\\n}\",\n \"func (p *Project) Plan() *ExecPlan {\\n\\treturn NewExecPlan(p)\\n}\",\n \"func (fr *Frame) EvalExpr(a T) (result T) {\\n\\t// Optimization: It's already a number.\\n\\tif a.IsQuickNumber() {\\n\\t\\treturn a\\n\\t}\\n\\n\\ts := a.String()\\n\\t// Optimization: \\\"0\\\" and \\\"1\\\"\\n\\tif len(s) == 1 {\\n\\t\\tif s == \\\"0\\\" {\\n\\t\\t\\treturn False\\n\\t\\t}\\n\\t\\tif s == \\\"1\\\" {\\n\\t\\t\\treturn True\\n\\t\\t}\\n\\t}\\n\\n\\treturn fr.ParseExpression(s)\\n}\",\n \"func (c *Compiler) Compile(expr string) (*runtime.Program, error) {\\n\\tprogAST, err := parser.Parse(expr)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tfor _, pass := range context.Passes {\\n\\t\\terr = progAST.RunPass(c.ctx, pass)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\n\\tprog := c.ctx.Builder.Build()\\n\\tprog.ResultType = progAST.Type()\\n\\treturn prog, nil\\n}\",\n \"func planProjectionOperators(\\n\\tctx context.Context,\\n\\tevalCtx *tree.EvalContext,\\n\\texpr tree.TypedExpr,\\n\\tcolumnTypes []*types.T,\\n\\tinput colexecop.Operator,\\n\\tacc *mon.BoundAccount,\\n\\tfactory coldata.ColumnFactory,\\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\\n\\t// projectDatum is a helper function that adds a new constant projection\\n\\t// operator for the given datum. typs are updated accordingly.\\n\\tprojectDatum := func(datum tree.Datum) (colexecop.Operator, error) {\\n\\t\\tresultIdx = len(columnTypes)\\n\\t\\tdatumType := datum.ResolvedType()\\n\\t\\ttyps = appendOneType(columnTypes, datumType)\\n\\t\\tif datumType.Family() == types.UnknownFamily {\\n\\t\\t\\t// We handle Unknown type by planning a special constant null\\n\\t\\t\\t// operator.\\n\\t\\t\\treturn colexecbase.NewConstNullOp(colmem.NewAllocator(ctx, acc, factory), input, resultIdx), nil\\n\\t\\t}\\n\\t\\tconstVal := colconv.GetDatumToPhysicalFn(datumType)(datum)\\n\\t\\treturn colexecbase.NewConstOp(colmem.NewAllocator(ctx, acc, factory), input, datumType, constVal, resultIdx)\\n\\t}\\n\\tresultIdx = -1\\n\\tswitch t := expr.(type) {\\n\\tcase *tree.IndexedVar:\\n\\t\\treturn input, t.Idx, columnTypes, nil\\n\\tcase *tree.ComparisonExpr:\\n\\t\\treturn planProjectionExpr(\\n\\t\\t\\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\\n\\t\\t\\tcolumnTypes, input, acc, factory, nil /* binFn */, t,\\n\\t\\t)\\n\\tcase *tree.BinaryExpr:\\n\\t\\tif err = checkSupportedBinaryExpr(t.TypedLeft(), t.TypedRight(), t.ResolvedType()); err != nil {\\n\\t\\t\\treturn op, resultIdx, typs, err\\n\\t\\t}\\n\\t\\treturn planProjectionExpr(\\n\\t\\t\\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\\n\\t\\t\\tcolumnTypes, input, acc, factory, t.Fn.Fn, nil, /* cmpExpr */\\n\\t\\t)\\n\\tcase *tree.IsNullExpr:\\n\\t\\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, false /* negate */, factory)\\n\\tcase *tree.IsNotNullExpr:\\n\\t\\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, true /* negate */, factory)\\n\\tcase *tree.CastExpr:\\n\\t\\texpr := t.Expr.(tree.TypedExpr)\\n\\t\\top, resultIdx, typs, err = planProjectionOperators(\\n\\t\\t\\tctx, evalCtx, expr, columnTypes, input, acc, factory,\\n\\t\\t)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, 0, nil, err\\n\\t\\t}\\n\\t\\top, resultIdx, typs, err = planCastOperator(ctx, acc, typs, op, resultIdx, expr.ResolvedType(), t.ResolvedType(), factory)\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase *tree.FuncExpr:\\n\\t\\tvar inputCols []int\\n\\t\\ttyps = make([]*types.T, len(columnTypes))\\n\\t\\tcopy(typs, columnTypes)\\n\\t\\top = input\\n\\t\\tfor _, e := range t.Exprs {\\n\\t\\t\\tvar err error\\n\\t\\t\\t// TODO(rohany): This could be done better, especially in the case\\n\\t\\t\\t// of constant arguments, because the vectorized engine right now\\n\\t\\t\\t// creates a new column full of the constant value.\\n\\t\\t\\top, resultIdx, typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, e.(tree.TypedExpr), typs, op, acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, nil, err\\n\\t\\t\\t}\\n\\t\\t\\tinputCols = append(inputCols, resultIdx)\\n\\t\\t}\\n\\t\\tresultIdx = len(typs)\\n\\t\\top, err = colexec.NewBuiltinFunctionOperator(\\n\\t\\t\\tcolmem.NewAllocator(ctx, acc, factory), evalCtx, t, typs, inputCols, resultIdx, op,\\n\\t\\t)\\n\\t\\ttyps = appendOneType(typs, t.ResolvedType())\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase tree.Datum:\\n\\t\\top, err = projectDatum(t)\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase *tree.Tuple:\\n\\t\\tisConstTuple := true\\n\\t\\tfor _, expr := range t.Exprs {\\n\\t\\t\\tif _, isDatum := expr.(tree.Datum); !isDatum {\\n\\t\\t\\t\\tisConstTuple = false\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif isConstTuple {\\n\\t\\t\\t// Tuple expression is a constant, so we can evaluate it and\\n\\t\\t\\t// project the resulting datum.\\n\\t\\t\\ttuple, err := t.Eval(evalCtx)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t\\top, err = projectDatum(tuple)\\n\\t\\t\\treturn op, resultIdx, typs, err\\n\\t\\t}\\n\\t\\toutputType := t.ResolvedType()\\n\\t\\ttyps = make([]*types.T, len(columnTypes))\\n\\t\\tcopy(typs, columnTypes)\\n\\t\\ttupleContentsIdxs := make([]int, len(t.Exprs))\\n\\t\\tfor i, expr := range t.Exprs {\\n\\t\\t\\tinput, tupleContentsIdxs[i], typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, expr.(tree.TypedExpr), typs, input, acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tresultIdx = len(typs)\\n\\t\\top = colexec.NewTupleProjOp(\\n\\t\\t\\tcolmem.NewAllocator(ctx, acc, factory), typs, tupleContentsIdxs, outputType, input, resultIdx,\\n\\t\\t)\\n\\t\\ttyps = appendOneType(typs, outputType)\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase *tree.CaseExpr:\\n\\t\\tif t.Expr != nil {\\n\\t\\t\\treturn nil, resultIdx, typs, errors.New(\\\"CASE <expr> WHEN expressions unsupported\\\")\\n\\t\\t}\\n\\n\\t\\tallocator := colmem.NewAllocator(ctx, acc, factory)\\n\\t\\tcaseOutputType := t.ResolvedType()\\n\\t\\tif typeconv.TypeFamilyToCanonicalTypeFamily(caseOutputType.Family()) == types.BytesFamily {\\n\\t\\t\\t// Currently, there is a contradiction between the way CASE operator\\n\\t\\t\\t// works (which populates its output in arbitrary order) and the\\n\\t\\t\\t// flat bytes implementation of Bytes type (which prohibits sets in\\n\\t\\t\\t// arbitrary order), so we reject such scenario to fall back to\\n\\t\\t\\t// row-by-row engine.\\n\\t\\t\\treturn nil, resultIdx, typs, errors.Newf(\\n\\t\\t\\t\\t\\\"unsupported type %s in CASE operator\\\", caseOutputType)\\n\\t\\t}\\n\\t\\tcaseOutputIdx := len(columnTypes)\\n\\t\\t// We don't know the schema yet and will update it below, right before\\n\\t\\t// instantiating caseOp. The same goes for subsetEndIdx.\\n\\t\\tschemaEnforcer := colexecutils.NewBatchSchemaSubsetEnforcer(\\n\\t\\t\\tallocator, input, nil /* typs */, caseOutputIdx, -1, /* subsetEndIdx */\\n\\t\\t)\\n\\t\\tbuffer := colexec.NewBufferOp(schemaEnforcer)\\n\\t\\tcaseOps := make([]colexecop.Operator, len(t.Whens))\\n\\t\\ttyps = appendOneType(columnTypes, caseOutputType)\\n\\t\\tthenIdxs := make([]int, len(t.Whens)+1)\\n\\t\\tfor i, when := range t.Whens {\\n\\t\\t\\t// The case operator is assembled from n WHEN arms, n THEN arms, and\\n\\t\\t\\t// an ELSE arm. Each WHEN arm is a boolean projection. Each THEN arm\\n\\t\\t\\t// (and the ELSE arm) is a projection of the type of the CASE\\n\\t\\t\\t// expression. We set up each WHEN arm to write its output to a\\n\\t\\t\\t// fresh column, and likewise for the THEN arms and the ELSE arm.\\n\\t\\t\\t// Each WHEN arm individually acts on the single input batch from\\n\\t\\t\\t// the CaseExpr's input and is then transformed into a selection\\n\\t\\t\\t// vector, after which the THEN arm runs to create the output just\\n\\t\\t\\t// for the tuples that matched the WHEN arm. Each subsequent WHEN\\n\\t\\t\\t// arm will use the inverse of the selection vector to avoid running\\n\\t\\t\\t// the WHEN projection on tuples that have already been matched by a\\n\\t\\t\\t// previous WHEN arm. Finally, after each WHEN arm runs, we copy the\\n\\t\\t\\t// results of the WHEN into a single output vector, assembling the\\n\\t\\t\\t// final result of the case projection.\\n\\t\\t\\twhenTyped := when.Cond.(tree.TypedExpr)\\n\\t\\t\\tcaseOps[i], resultIdx, typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, whenTyped, typs, buffer, acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t\\tcaseOps[i], err = colexecutils.BoolOrUnknownToSelOp(caseOps[i], typs, resultIdx)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Run the \\\"then\\\" clause on those tuples that were selected.\\n\\t\\t\\tcaseOps[i], thenIdxs[i], typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, when.Val.(tree.TypedExpr), typs, caseOps[i], acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t\\tif !typs[thenIdxs[i]].Identical(typs[caseOutputIdx]) {\\n\\t\\t\\t\\t// It is possible that the projection of this THEN arm has\\n\\t\\t\\t\\t// different column type (for example, we expect INT2, but INT8\\n\\t\\t\\t\\t// is given). In such case, we need to plan a cast.\\n\\t\\t\\t\\tfromType, toType := typs[thenIdxs[i]], typs[caseOutputIdx]\\n\\t\\t\\t\\tcaseOps[i], thenIdxs[i], typs, err = planCastOperator(\\n\\t\\t\\t\\t\\tctx, acc, typs, caseOps[i], thenIdxs[i], fromType, toType, factory,\\n\\t\\t\\t\\t)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvar elseOp colexecop.Operator\\n\\t\\telseExpr := t.Else\\n\\t\\tif elseExpr == nil {\\n\\t\\t\\t// If there's no ELSE arm, we write NULLs.\\n\\t\\t\\telseExpr = tree.DNull\\n\\t\\t}\\n\\t\\telseOp, thenIdxs[len(t.Whens)], typs, err = planProjectionOperators(\\n\\t\\t\\tctx, evalCtx, elseExpr.(tree.TypedExpr), typs, buffer, acc, factory,\\n\\t\\t)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t}\\n\\t\\tif !typs[thenIdxs[len(t.Whens)]].Identical(typs[caseOutputIdx]) {\\n\\t\\t\\t// It is possible that the projection of the ELSE arm has different\\n\\t\\t\\t// column type (for example, we expect INT2, but INT8 is given). In\\n\\t\\t\\t// such case, we need to plan a cast.\\n\\t\\t\\telseIdx := thenIdxs[len(t.Whens)]\\n\\t\\t\\tfromType, toType := typs[elseIdx], typs[caseOutputIdx]\\n\\t\\t\\telseOp, thenIdxs[len(t.Whens)], typs, err = planCastOperator(\\n\\t\\t\\t\\tctx, acc, typs, elseOp, elseIdx, fromType, toType, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tschemaEnforcer.SetTypes(typs)\\n\\t\\top := colexec.NewCaseOp(allocator, buffer, caseOps, elseOp, thenIdxs, caseOutputIdx, caseOutputType)\\n\\t\\treturn op, caseOutputIdx, typs, err\\n\\tcase *tree.AndExpr, *tree.OrExpr:\\n\\t\\treturn planLogicalProjectionOp(ctx, evalCtx, expr, columnTypes, input, acc, factory)\\n\\tdefault:\\n\\t\\treturn nil, resultIdx, nil, errors.Errorf(\\\"unhandled projection expression type: %s\\\", reflect.TypeOf(t))\\n\\t}\\n}\",\n \"func (l *logicalPlanner) Plan(ctx context.Context, logicalPlan *Spec) (*Spec, error) {\\n\\tnewLogicalPlan, err := l.heuristicPlanner.Plan(ctx, logicalPlan)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// check integrity after planning is complete\\n\\tif !l.disableIntegrityChecks {\\n\\t\\terr := newLogicalPlan.CheckIntegrity()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\n\\treturn newLogicalPlan, nil\\n}\",\n \"func resolveExpression(ctx *sql.Context, expression string, sch schema.Schema, tableName string) (sql.Expression, error) {\\n\\tquery := fmt.Sprintf(\\\"SELECT %s from %s.%s\\\", expression, \\\"mydb\\\", tableName)\\n\\tsqlSch, err := sqlutil.FromDoltSchema(tableName, sch)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tmockTable := memory.NewTable(tableName, sqlSch, nil)\\n\\tmockDatabase := memory.NewDatabase(\\\"mydb\\\")\\n\\tmockDatabase.AddTable(tableName, mockTable)\\n\\tmockProvider := memory.NewDBProvider(mockDatabase)\\n\\tcatalog := analyzer.NewCatalog(mockProvider)\\n\\n\\tpseudoAnalyzedQuery, err := planbuilder.Parse(ctx, catalog, query)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tvar expr sql.Expression\\n\\ttransform.Inspect(pseudoAnalyzedQuery, func(n sql.Node) bool {\\n\\t\\tif projector, ok := n.(sql.Projector); ok {\\n\\t\\t\\texpr = projector.ProjectedExprs()[0]\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t\\treturn true\\n\\t})\\n\\tif expr == nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"unable to find expression in analyzed query\\\")\\n\\t}\\n\\n\\treturn expr, nil\\n}\",\n \"func (i *Interpreter) interpretExpr(expr ast.Expr) interface{} {\\n\\tswitch t := expr.(type) {\\n\\n\\tcase *ast.AssignmentExpr:\\n\\t\\treturn i.interpretAssignmentExpr(t)\\n\\n\\tcase *ast.BinaryExpr:\\n\\t\\treturn i.interpretBinaryExpr(t)\\n\\n\\tcase *ast.CallExpr:\\n\\t\\treturn i.interpretCallExpr(t)\\n\\n\\tcase *ast.GetExpr:\\n\\t\\treturn i.interpretGetExpr(t)\\n\\n\\tcase *ast.GroupingExpr:\\n\\t\\treturn i.interpretGroupingExpr(t)\\n\\n\\tcase *ast.LiteralExpr:\\n\\t\\treturn i.interpretLiteralExpr(t)\\n\\n\\tcase *ast.LogicalExpr:\\n\\t\\treturn i.interpretLogicalExpr(t)\\n\\n\\tcase *ast.SetExpr:\\n\\t\\treturn i.interpretSetExpr(t)\\n\\n\\tcase *ast.ThisExpr:\\n\\t\\treturn i.interpretThisExpr(t)\\n\\n\\tcase *ast.UnaryExpr:\\n\\t\\treturn i.interpretUnaryExpr(t)\\n\\n\\tcase *ast.VariableExpr:\\n\\t\\treturn i.interpretVariableExpr(t)\\n\\n\\tdefault:\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func compileExpr(compiledFunc *CompiledFunc, expr ast.Node) (string, string, error) {\\n\\tswitch e := expr.(type) {\\n\\tcase *ast.Literal:\\n\\t\\treturns := compiledFunc.nextRegister()\\n\\t\\tcompiledFunc.append(&instruction.Assign{\\n\\t\\t\\tVariableName: returns,\\n\\t\\t\\tValue: e,\\n\\t\\t})\\n\\n\\t\\treturn returns, e.Kind, nil\\n\\n\\tcase *ast.Array:\\n\\t\\treturns, err := compileArray(compiledFunc, e)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn \\\"\\\", \\\"\\\", err\\n\\t\\t}\\n\\n\\t\\t// TODO(elliot): Doesn't return type.\\n\\t\\treturn returns, \\\"[]\\\", nil\\n\\n\\tcase *ast.Map:\\n\\t\\treturns, err := compileMap(compiledFunc, e)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn \\\"\\\", \\\"\\\", err\\n\\t\\t}\\n\\n\\t\\t// TODO(elliot): Doesn't return type.\\n\\t\\treturn returns, \\\"{}\\\", nil\\n\\n\\tcase *ast.Call:\\n\\t\\tresult, err := compileCall(compiledFunc, e)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn \\\"\\\", \\\"\\\", err\\n\\t\\t}\\n\\n\\t\\t// TODO(elliot): Doesn't return kind.\\n\\t\\treturn result, \\\"\\\", nil\\n\\n\\tcase *ast.Identifier:\\n\\t\\tif v, ok := compiledFunc.variables[e.Name]; ok {\\n\\t\\t\\treturn e.Name, v, nil\\n\\t\\t}\\n\\n\\t\\treturn \\\"\\\", \\\"\\\", fmt.Errorf(\\\"undefined variable: %s\\\", e.Name)\\n\\n\\tcase *ast.Binary:\\n\\t\\treturn compileBinary(compiledFunc, e)\\n\\n\\tcase *ast.Group:\\n\\t\\treturn compileExpr(compiledFunc, e.Expr)\\n\\n\\tcase *ast.Unary:\\n\\t\\treturn compileUnary(compiledFunc, e)\\n\\n\\tcase *ast.Key:\\n\\t\\treturn compileKey(compiledFunc, e)\\n\\t}\\n\\n\\tpanic(expr)\\n}\",\n \"func (r *postProcessResult) planPostProcessSpec(\\n\\tctx context.Context,\\n\\tflowCtx *execinfra.FlowCtx,\\n\\tevalCtx *tree.EvalContext,\\n\\targs *colexecargs.NewColOperatorArgs,\\n\\tpost *execinfrapb.PostProcessSpec,\\n\\tfactory coldata.ColumnFactory,\\n) error {\\n\\tif post.Projection {\\n\\t\\tr.Op, r.ColumnTypes = addProjection(r.Op, r.ColumnTypes, post.OutputColumns)\\n\\t} else if post.RenderExprs != nil {\\n\\t\\tif log.V(2) {\\n\\t\\t\\tlog.Infof(ctx, \\\"planning render expressions %+v\\\", post.RenderExprs)\\n\\t\\t}\\n\\t\\tsemaCtx := flowCtx.TypeResolverFactory.NewSemaContext(evalCtx.Txn)\\n\\t\\tvar renderedCols []uint32\\n\\t\\tfor _, renderExpr := range post.RenderExprs {\\n\\t\\t\\texpr, err := args.ExprHelper.ProcessExpr(renderExpr, semaCtx, evalCtx, r.ColumnTypes)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\tvar outputIdx int\\n\\t\\t\\tr.Op, outputIdx, r.ColumnTypes, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, expr, r.ColumnTypes, r.Op, args.StreamingMemAccount, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn errors.Wrapf(err, \\\"unable to columnarize render expression %q\\\", expr)\\n\\t\\t\\t}\\n\\t\\t\\tif outputIdx < 0 {\\n\\t\\t\\t\\treturn errors.AssertionFailedf(\\\"missing outputIdx\\\")\\n\\t\\t\\t}\\n\\t\\t\\trenderedCols = append(renderedCols, uint32(outputIdx))\\n\\t\\t}\\n\\t\\tr.Op = colexecbase.NewSimpleProjectOp(r.Op, len(r.ColumnTypes), renderedCols)\\n\\t\\tnewTypes := make([]*types.T, len(renderedCols))\\n\\t\\tfor i, j := range renderedCols {\\n\\t\\t\\tnewTypes[i] = r.ColumnTypes[j]\\n\\t\\t}\\n\\t\\tr.ColumnTypes = newTypes\\n\\t}\\n\\tif post.Offset != 0 {\\n\\t\\tr.Op = colexec.NewOffsetOp(r.Op, post.Offset)\\n\\t}\\n\\tif post.Limit != 0 {\\n\\t\\tr.Op = colexec.NewLimitOp(r.Op, post.Limit)\\n\\t}\\n\\treturn nil\\n}\",\n \"func (rp *routeTree) makePlanValue(ctx *planningContext, n sqlparser.Expr) (*sqltypes.PlanValue, error) {\\n\\tif ctx.isSubQueryToReplace(n) {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\tfor _, expr := range ctx.semTable.GetExprAndEqualities(n) {\\n\\t\\tif subq, isSubq := expr.(*sqlparser.Subquery); isSubq {\\n\\t\\t\\textractedSubquery := ctx.semTable.FindSubqueryReference(subq)\\n\\t\\t\\tif extractedSubquery == nil {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tswitch engine.PulloutOpcode(extractedSubquery.OpCode) {\\n\\t\\t\\tcase engine.PulloutIn, engine.PulloutNotIn:\\n\\t\\t\\t\\texpr = sqlparser.NewListArg(extractedSubquery.GetArgName())\\n\\t\\t\\tcase engine.PulloutValue, engine.PulloutExists:\\n\\t\\t\\t\\texpr = sqlparser.NewArgument(extractedSubquery.GetArgName())\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpv, err := makePlanValue(expr)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tif pv != nil {\\n\\t\\t\\treturn pv, nil\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil, nil\\n}\",\n \"func Compile(expr string) (*Expr, error) {\\n\\tif expr == \\\"\\\" {\\n\\t\\treturn nil, errors.New(\\\"expr expression is nil\\\")\\n\\t}\\n\\tqy, err := build(expr, nil)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif qy == nil {\\n\\t\\treturn nil, fmt.Errorf(fmt.Sprintf(\\\"undeclared variable in XPath expression: %s\\\", expr))\\n\\t}\\n\\treturn &Expr{s: expr, q: qy}, nil\\n}\",\n \"func (state *State) EvalExpr(expr string) (interface{}, error) {\\n\\texp, err := govaluate.NewEvaluableExpression(expr)\\n\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t} else {\\n\\t\\tres, err := exp.Evaluate(state.expr)\\n\\n\\t\\treturn res, err\\n\\t}\\n}\",\n \"func (c *RPCClient) CreateBreakpointWithExpr(breakPoint *api.Breakpoint, locExpr string, substitutePathRules [][2]string, suspended bool) (*api.Breakpoint, error) {\\n\\tvar out CreateBreakpointOut\\n\\terr := c.call(\\\"CreateBreakpoint\\\", CreateBreakpointIn{*breakPoint, locExpr, substitutePathRules, suspended}, &out)\\n\\treturn &out.Breakpoint, err\\n}\",\n \"func (w *World) compileExpr(fset *token.FileSet, e ast.Expr) (Runnable, error) {\\n\\terrs := new(scanner.ErrorList)\\n\\tcc := &compiler.Compiler{\\n\\t\\tFSet: fset,\\n\\t\\tErrors: errs,\\n\\t\\tNumErrors: 0,\\n\\t\\tSilentErrors: 0,\\n\\t}\\n\\n\\tx := cc.CompileExpr(w.scope.Block, false, e)\\n\\tif x == nil {\\n\\t\\terrs.Sort()\\n\\t\\treturn nil, errs.Err()\\n\\t}\\n\\n\\tvar eval func(vm.Value, *vm.Thread)\\n\\tswitch t := x.ExprType.(type) {\\n\\t// case *types.IdealIntType:\\n\\t// \\t// nothing\\n\\t// case *types.FloatType:\\n\\t// \\t// nothing\\n\\tdefault:\\n\\t\\tif tm, ok := t.(*types.MultiType); ok && len(tm.Elems) == 0 {\\n\\t\\t\\treturn &stmtCode{\\n\\t\\t\\t\\tworld: w,\\n\\t\\t\\t\\tcode: vm.Code{x.Exec},\\n\\t\\t\\t}, nil\\n\\t\\t}\\n\\t\\t// eval = compiler.GenAssign(x.Type, x)\\n\\t}\\n\\treturn &ExprCode{\\n\\t\\tworld: w,\\n\\t\\texpr: x,\\n\\t\\teval: eval,\\n\\t}, nil\\n}\",\n \"func execExprString(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(1)\\n\\tret := types.ExprString(args[0].(ast.Expr))\\n\\tp.Ret(1, ret)\\n}\",\n \"func (cm GoPlanner) Plan(queryRequest *plannerpb.QueryRequest) (*distributedpb.LogicalPlannerResult, error) {\\n\\tvar resultLen C.int\\n\\tqueryRequestBytes, err := proto.Marshal(queryRequest)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tqueryRequestData := C.CBytes(queryRequestBytes)\\n\\tdefer C.free(queryRequestData)\\n\\n\\tres := C.PlannerPlan(cm.planner, (*C.char)(queryRequestData), C.int(len(queryRequestBytes)), &resultLen)\\n\\tdefer C.StrFree(res)\\n\\tlp := C.GoBytes(unsafe.Pointer(res), resultLen)\\n\\tif resultLen == 0 {\\n\\t\\treturn nil, errors.New(\\\"no result returned\\\")\\n\\t}\\n\\n\\tplan := &distributedpb.LogicalPlannerResult{}\\n\\tif err := proto.Unmarshal(lp, plan); err != nil {\\n\\t\\treturn plan, fmt.Errorf(\\\"error: '%s'; string: '%s'\\\", err, string(lp))\\n\\t}\\n\\treturn plan, nil\\n}\",\n \"func cmdExpr(fr *Frame, argv []T) T {\\n\\t// Optimization: It's already a single arg.\\n\\tif len(argv) == 2 {\\n\\t\\treturn fr.EvalExpr(argv[1])\\n\\t}\\n\\n\\tstrs := make([]string, len(argv)-1)\\n\\n\\tfor i, t := range argv[1:] {\\n\\t\\tstrs[i] = t.String()\\n\\t}\\n\\n\\tex := strings.Join(strs, \\\" \\\")\\n\\n\\treturn fr.ParseExpression(ex)\\n}\",\n \"func (s *BasePCREListener) EnterExpr(ctx *ExprContext) {}\",\n \"func parseExpr(node *node32) (Expression, error) {\\n\\tvar stack []Expression\\n\\tvar opstack []Expression\\n\\n\\t// push an expression to the stack\\n\\tpush := func(e Expression) {\\n\\t\\tstack = append(stack, e)\\n\\t}\\n\\n\\t// peek at the top of the expression stack\\n\\tpeek := func() Expression {\\n\\t\\tif len(stack) == 0 {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn stack[len(stack)-1]\\n\\t}\\n\\n\\t// pop and return the expression at the top the expression stack\\n\\tpop := func() (ret Expression) {\\n\\t\\tret, stack = stack[len(stack)-1], stack[:len(stack)-1]\\n\\t\\treturn\\n\\t}\\n\\n\\t// push an operator to the operator stack\\n\\tpushop := func(e Expression) {\\n\\t\\topstack = append(opstack, e)\\n\\t}\\n\\n\\t// peek at the top the operator stack\\n\\tpeekop := func() Expression {\\n\\t\\tif len(opstack) == 0 {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn opstack[len(opstack)-1]\\n\\t}\\n\\n\\t// pop and return the operator at the top of the operator stack\\n\\tpopop := func() {\\n\\t\\tvar exp Expression\\n\\n\\t\\texp, opstack = opstack[len(opstack)-1], opstack[:len(opstack)-1]\\n\\n\\t\\tswitch t := exp.(type) {\\n\\t\\tcase UnaryOperator:\\n\\t\\t\\tt.SetExpression(pop())\\n\\t\\tcase BinaryOperator:\\n\\t\\t\\tt.SetRHS(pop())\\n\\t\\t\\tt.SetLHS(pop())\\n\\t\\tcase *ExprParen:\\n\\t\\t\\texp = nil\\n\\t\\t}\\n\\n\\t\\tif exp != nil {\\n\\t\\t\\tpush(exp)\\n\\t\\t}\\n\\t}\\n\\n\\t// prio returns the priority of a given operator\\n\\t// the lesser the value the more tightly the operator binds\\n\\t// values taken from the operator precedence of C\\n\\t// special case parenthesis, otherwise a high value\\n\\tprio := func(exp Expression) int {\\n\\t\\ttyp := reflect.TypeOf(exp).Elem()\\n\\t\\texpr := reflect.New(typ).Elem().Interface()\\n\\n\\t\\tvalue, exists := PriorityMap[expr]\\n\\t\\tif !exists {\\n\\t\\t\\treturn 42\\n\\t\\t}\\n\\n\\t\\treturn value\\n\\t}\\n\\n\\t// returns whether the operator is right associative\\n\\trightAssoc := func(exp Expression) bool {\\n\\t\\tswitch exp.(type) {\\n\\t\\tcase *UnaryOperatorNot,\\n\\t\\t\\t*UnaryOperatorNegate,\\n\\t\\t\\t*UnaryOperatorLen,\\n\\t\\t\\t*UnaryOperatorOrd,\\n\\t\\t\\t*UnaryOperatorChr:\\n\\t\\t\\treturn true\\n\\t\\tdefault:\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t}\\n\\n\\t// given a peg rule return the operator with the expressions set\\n\\truleToOp := func(outer, inner pegRule) Expression {\\n\\n\\t\\tvar PEGOperatorMap = map[pegRule]map[pegRule]Expression{\\n\\t\\t\\truleUNARYOPER: {\\n\\t\\t\\t\\truleBANG: &UnaryOperatorNot{},\\n\\t\\t\\t\\truleMINUS: &UnaryOperatorNegate{},\\n\\t\\t\\t\\truleLEN: &UnaryOperatorLen{},\\n\\t\\t\\t\\truleORD: &UnaryOperatorOrd{},\\n\\t\\t\\t\\truleCHR: &UnaryOperatorChr{},\\n\\t\\t\\t},\\n\\t\\t\\truleBINARYOPER: {\\n\\t\\t\\t\\truleSTAR: &BinaryOperatorMult{},\\n\\t\\t\\t\\truleDIV: &BinaryOperatorDiv{},\\n\\t\\t\\t\\truleMOD: &BinaryOperatorMod{},\\n\\t\\t\\t\\trulePLUS: &BinaryOperatorAdd{},\\n\\t\\t\\t\\truleMINUS: &BinaryOperatorSub{},\\n\\t\\t\\t\\truleGT: &BinaryOperatorGreaterThan{},\\n\\t\\t\\t\\truleGE: &BinaryOperatorGreaterEqual{},\\n\\t\\t\\t\\truleLT: &BinaryOperatorLessThan{},\\n\\t\\t\\t\\truleLE: &BinaryOperatorLessEqual{},\\n\\t\\t\\t\\truleEQUEQU: &BinaryOperatorEqual{},\\n\\t\\t\\t\\truleBANGEQU: &BinaryOperatorNotEqual{},\\n\\t\\t\\t\\truleANDAND: &BinaryOperatorAnd{},\\n\\t\\t\\t\\truleOROR: &BinaryOperatorOr{},\\n\\t\\t\\t\\truleAND: &BinaryOperatorBitAnd{},\\n\\t\\t\\t\\truleOR: &BinaryOperatorBitOr{},\\n\\t\\t\\t},\\n\\t\\t}\\n\\n\\t\\tvalue, exists := PEGOperatorMap[outer][inner]\\n\\t\\tif !exists {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\n\\t\\treturn value\\n\\t}\\n\\n\\t// process the nodes in order\\n\\tfor enode := range exprStream(node) {\\n\\t\\tswitch enode.pegRule {\\n\\t\\tcase ruleINTLITER:\\n\\t\\t\\tnum, err := strconv.ParseInt(enode.match, 10, 32)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t// number does not fit into WACC integer size\\n\\t\\t\\t\\tnumerr := err.(*strconv.NumError)\\n\\t\\t\\t\\tswitch numerr.Err {\\n\\t\\t\\t\\tcase strconv.ErrRange:\\n\\t\\t\\t\\t\\treturn nil, CreateBigIntError(\\n\\t\\t\\t\\t\\t\\t&enode.token32,\\n\\t\\t\\t\\t\\t\\tenode.match,\\n\\t\\t\\t\\t\\t)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tpush(&IntLiteral{value: int(num)})\\n\\t\\tcase ruleFALSE:\\n\\t\\t\\tpush(&BoolLiteralFalse{})\\n\\t\\tcase ruleTRUE:\\n\\t\\t\\tpush(&BoolLiteralTrue{})\\n\\t\\tcase ruleCHARLITER:\\n\\t\\t\\tpush(&CharLiteral{char: enode.up.next.match})\\n\\t\\tcase ruleSTRLITER:\\n\\t\\t\\tstrLiter := &StringLiteral{}\\n\\t\\t\\tstrNode := nextNode(enode.up, ruleSTR)\\n\\t\\t\\tif strNode != nil {\\n\\t\\t\\t\\t// string may be empty, only set contents if not\\n\\t\\t\\t\\tstrLiter.str = strNode.match\\n\\t\\t\\t}\\n\\t\\t\\tpush(strLiter)\\n\\t\\tcase rulePAIRLITER:\\n\\t\\t\\tpush(&NullPair{})\\n\\t\\tcase ruleIDENT:\\n\\t\\t\\tpush(&Ident{ident: enode.match})\\n\\t\\tcase ruleENUMLITER:\\n\\t\\t\\tenumLiter := &EnumLiteral{}\\n\\t\\t\\tenumLiter.ident = nextNode(enode.up, ruleIDENT).match\\n\\t\\t\\tenumLiter.field = nextNode(enode.up.next, ruleIDENT).match\\n\\n\\t\\t\\tpush(enumLiter)\\n\\t\\tcase ruleARRAYELEM:\\n\\t\\t\\tarrElem, err := parseArrayElem(enode.up)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tpush(arrElem)\\n\\t\\tcase ruleUNARYOPER, ruleBINARYOPER:\\n\\t\\t\\top1 := ruleToOp(enode.pegRule, enode.up.pegRule)\\n\\t\\top2l:\\n\\t\\t\\tfor op2 := peekop(); op2 != nil; op2 = peekop() {\\n\\t\\t\\t\\tif op2 == nil {\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// pop all operators with more tight binding\\n\\t\\t\\t\\tswitch {\\n\\t\\t\\t\\tcase !rightAssoc(op1) && prio(op1) >= prio(op2),\\n\\t\\t\\t\\t\\trightAssoc(op1) && prio(op1) > prio(op2):\\n\\t\\t\\t\\t\\tpopop()\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tbreak op2l\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tpushop(op1)\\n\\t\\tcase ruleLPAR:\\n\\t\\t\\tpushop(&ExprParen{})\\n\\t\\tcase ruleRPAR:\\n\\t\\t\\t// when a parenthesis is closed pop all the operators\\n\\t\\t\\t// the were inside\\n\\t\\tparloop:\\n\\t\\t\\tfor {\\n\\t\\t\\t\\tswitch peekop().(type) {\\n\\t\\t\\t\\tcase *ExprParen:\\n\\t\\t\\t\\t\\tpopop()\\n\\t\\t\\t\\t\\tbreak parloop\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tpopop()\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// set tokens on newly pushed expressions\\n\\t\\tif val := peek(); val != nil && val.Token() == nil {\\n\\t\\t\\tpeek().SetToken(&node.token32)\\n\\t\\t}\\n\\n\\t\\tif op := peekop(); op != nil && op.Token() == nil {\\n\\t\\t\\tpeekop().SetToken(&node.token32)\\n\\t\\t}\\n\\t}\\n\\n\\t// if operators are still left pop them\\n\\tfor peekop() != nil {\\n\\t\\tpopop()\\n\\t}\\n\\n\\treturn pop(), nil\\n}\",\n \"func (eq *Eq) Compile(expr *Expr, model *Model) {\\n\\teq.Expr = expr\\n\\teq.Result = eq.compile(expr, model)\\n\\n\\tfn := &Func{}\\n\\tfn.InitRAX()\\n\\tfor _, stmt := range eq.Code {\\n\\t\\tfn.BinaryOp(stmt.Op, stmt.D, stmt.A, stmt.B)\\n\\t}\\n\\tfn.Ret()\\n\\tfn.MarkExecutable()\\n\\teq.Func = fn\\n}\",\n \"func compileExpr(compiledFunc *vm.CompiledFunc, expr ast.Node, file *Compiled) ([]vm.Register, []string, error) {\\n\\tswitch e := expr.(type) {\\n\\tcase *ast.Assign:\\n\\t\\terr := compileAssign(compiledFunc, e, file)\\n\\n\\t\\treturn nil, nil, err\\n\\n\\tcase *ast.Literal:\\n\\t\\treturns := compiledFunc.NextRegister()\\n\\t\\tcompiledFunc.Append(&vm.Assign{\\n\\t\\t\\tVariableName: returns,\\n\\t\\t\\tValue: e,\\n\\t\\t})\\n\\n\\t\\treturn []vm.Register{returns}, []string{e.Kind}, nil\\n\\n\\tcase *ast.Func:\\n\\t\\tcf, err := CompileFunc(e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\tfile.FuncDefs[e.Name] = e\\n\\t\\tfile.Funcs[e.Name] = cf\\n\\t\\tfnType := e.Type()\\n\\n\\t\\treturns := compiledFunc.NextRegister()\\n\\t\\tcompiledFunc.Append(&vm.Assign{\\n\\t\\t\\tVariableName: returns,\\n\\t\\t\\tValue: &ast.Literal{\\n\\t\\t\\t\\tKind: fnType,\\n\\t\\t\\t\\tValue: e.Name,\\n\\t\\t\\t},\\n\\t\\t})\\n\\n\\t\\tcompiledFunc.Append(&vm.ParentScope{\\n\\t\\t\\tX: returns,\\n\\t\\t})\\n\\n\\t\\treturn []vm.Register{returns}, []string{fnType}, nil\\n\\n\\tcase *ast.Array:\\n\\t\\treturns, kind, err := compileArray(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\treturn []vm.Register{returns}, []string{kind}, nil\\n\\n\\tcase *ast.Map:\\n\\t\\treturns, kind, err := compileMap(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\treturn []vm.Register{returns}, []string{kind}, nil\\n\\n\\tcase *ast.Call:\\n\\t\\tresults, resultKinds, err := compileCall(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\t// TODO(elliot): Doesn't return kind.\\n\\t\\treturn results, resultKinds, nil\\n\\n\\tcase *ast.Identifier:\\n\\t\\t// TODO(elliot): Doesn't check that the upper scope variable exists or\\n\\t\\t// fetches the correct type.\\n\\t\\tif e.Name[0] == '^' {\\n\\t\\t\\treturn []vm.Register{vm.Register(e.Name)}, []string{\\\"number\\\"}, nil\\n\\t\\t}\\n\\n\\t\\tif v, ok := compiledFunc.Variables[e.Name]; ok || e.Name[0] == '^' {\\n\\t\\t\\treturn []vm.Register{vm.Register(e.Name)}, []string{v}, nil\\n\\t\\t}\\n\\n\\t\\t// It could be a package-level constant.\\n\\t\\tif c, ok := file.Constants[e.Name]; ok {\\n\\t\\t\\t// We copy it locally to make sure it's value isn't changed. The\\n\\t\\t\\t// compiler will prevent a constant from being modified directly.\\n\\t\\t\\t//\\n\\t\\t\\t// TODO(elliot): The compiler needs to raise an error when trying to\\n\\t\\t\\t// modify a constant.\\n\\t\\t\\tliteralRegister := compiledFunc.NextRegister()\\n\\t\\t\\tcompiledFunc.Append(&vm.Assign{\\n\\t\\t\\t\\tVariableName: literalRegister,\\n\\t\\t\\t\\t// TODO(elliot): Does not support non-scalar values.\\n\\t\\t\\t\\tValue: &ast.Literal{\\n\\t\\t\\t\\t\\tKind: c.Kind,\\n\\t\\t\\t\\t\\tValue: c.Value,\\n\\t\\t\\t\\t},\\n\\t\\t\\t})\\n\\n\\t\\t\\treturn []vm.Register{literalRegister}, []string{c.Kind}, nil\\n\\t\\t}\\n\\n\\t\\t// It could also reference a package-level function.\\n\\t\\tif fn, ok := file.FuncDefs[e.Name]; ok {\\n\\t\\t\\tliteralRegister := compiledFunc.NextRegister()\\n\\t\\t\\tcompiledFunc.Append(&vm.Assign{\\n\\t\\t\\t\\tVariableName: literalRegister,\\n\\t\\t\\t\\tValue: &ast.Literal{\\n\\t\\t\\t\\t\\tKind: fn.Type(),\\n\\t\\t\\t\\t\\tValue: fn.Name,\\n\\t\\t\\t\\t},\\n\\t\\t\\t})\\n\\n\\t\\t\\treturn []vm.Register{literalRegister}, []string{fn.Type()}, nil\\n\\t\\t}\\n\\n\\t\\treturn nil, nil, fmt.Errorf(\\\"%s undefined variable: %s\\\",\\n\\t\\t\\te.Pos, e.Name)\\n\\n\\tcase *ast.Binary:\\n\\t\\tresult, ty, err := compileBinary(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\treturn []vm.Register{result}, []string{ty}, nil\\n\\n\\tcase *ast.Group:\\n\\t\\treturn compileExpr(compiledFunc, e.Expr, file)\\n\\n\\tcase *ast.Unary:\\n\\t\\tresult, ty, err := compileUnary(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\treturn []vm.Register{result}, []string{ty}, nil\\n\\n\\tcase *ast.Key:\\n\\t\\tresult, ty, err := compileKey(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\treturn []vm.Register{result}, []string{ty}, nil\\n\\n\\tcase *ast.Interpolate:\\n\\t\\tresult, err := compileInterpolate(compiledFunc, e, file)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, err\\n\\t\\t}\\n\\n\\t\\treturn []vm.Register{result}, []string{\\\"string\\\"}, nil\\n\\t}\\n\\n\\tpanic(expr)\\n}\",\n \"func (b *PlanBuilder) rewriteWithPreprocess(\\n\\tctx context.Context,\\n\\texprNode ast.ExprNode,\\n\\tp LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int,\\n\\tasScalar bool,\\n\\tpreprocess func(ast.Node) ast.Node,\\n) (expression.Expression, LogicalPlan, error) {\\n\\tb.rewriterCounter++\\n\\tdefer func() { b.rewriterCounter-- }()\\n\\n\\trewriter := b.getExpressionRewriter(ctx, p)\\n\\t// The rewriter maybe is obtained from \\\"b.rewriterPool\\\", \\\"rewriter.err\\\" is\\n\\t// not nil means certain previous procedure has not handled this error.\\n\\t// Here we give us one more chance to make a correct behavior by handling\\n\\t// this missed error.\\n\\tif rewriter.err != nil {\\n\\t\\treturn nil, nil, rewriter.err\\n\\t}\\n\\n\\trewriter.aggrMap = aggMapper\\n\\trewriter.asScalar = asScalar\\n\\trewriter.preprocess = preprocess\\n\\n\\texpr, resultPlan, err := b.rewriteExprNode(rewriter, exprNode, asScalar)\\n\\treturn expr, resultPlan, err\\n}\",\n \"func (p *parser) VisitExpr(ctx *gen.ExprContext) any {\\n\\tresult := p.Visit(ctx.GetE()).(*exprpb.Expr)\\n\\tif ctx.GetOp() == nil {\\n\\t\\treturn result\\n\\t}\\n\\topID := p.helper.id(ctx.GetOp())\\n\\tifTrue := p.Visit(ctx.GetE1()).(*exprpb.Expr)\\n\\tifFalse := p.Visit(ctx.GetE2()).(*exprpb.Expr)\\n\\treturn p.globalCallOrMacro(opID, operators.Conditional, result, ifTrue, ifFalse)\\n}\",\n \"func (tr *transform) getExpression(expr ast.Expr) *expression {\\n\\te := tr.newExpression(nil)\\n\\n\\te.transform(expr)\\n\\treturn e\\n}\",\n \"func expr(out *Expr) Parser {\\r\\n\\treturn func(code string) (string, error) {\\r\\n\\t\\tcode, expr, err := ParseExpression(code)\\r\\n\\t\\tif err == nil {\\r\\n\\t\\t\\t*out = expr\\r\\n\\t\\t}\\r\\n\\t\\treturn code, err\\r\\n\\t}\\r\\n}\",\n \"func (b *PlanBuilder) rewrite(ctx context.Context, exprNode ast.ExprNode, p LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int, asScalar bool) (expression.Expression, LogicalPlan, error) {\\n\\texpr, resultPlan, err := b.rewriteWithPreprocess(ctx, exprNode, p, aggMapper, asScalar, nil)\\n\\treturn expr, resultPlan, err\\n}\",\n \"func evalAstExpr(ctx sessionctx.Context, expr ast.ExprNode) (types.Datum, error) {\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 0)\\n\\tif val, ok := expr.(*driver.ValueExpr); ok {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 4)\\n\\t\\treturn val.Datum, nil\\n\\t}\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 1)\\n\\tb := &PlanBuilder{\\n\\t\\tctx: ctx,\\n\\t\\tcolMapper: make(map[*ast.ColumnNameExpr]int),\\n\\t}\\n\\tif ctx.GetSessionVars().TxnCtx.InfoSchema != nil {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 5)\\n\\t\\tb.is = ctx.GetSessionVars().TxnCtx.InfoSchema.(infoschema.InfoSchema)\\n\\t}\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 2)\\n\\tfakePlan := LogicalTableDual{}.Init(ctx)\\n\\tnewExpr, _, err := b.rewrite(expr, fakePlan, nil, true)\\n\\tif err != nil {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 6)\\n\\t\\treturn types.Datum{}, err\\n\\t}\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 3)\\n\\treturn newExpr.Eval(chunk.Row{})\\n}\",\n \"func (x *ExprImpl) expr() {}\",\n \"func cheapExpr(n ir.Node, init *ir.Nodes) ir.Node {\\n\\tswitch n.Op() {\\n\\tcase ir.ONAME, ir.OLITERAL, ir.ONIL:\\n\\t\\treturn n\\n\\t}\\n\\n\\treturn copyExpr(n, n.Type(), init)\\n}\",\n \"func (p *Platform) Plan(destroy bool) (*plans.Plan, error) {\\n\\tp.startMiddleware()\\n\\n\\tctx, err := p.newContext(destroy)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tif _, diag := ctx.Refresh(); diag.HasErrors() {\\n\\t\\treturn nil, diag.Err()\\n\\t}\\n\\n\\tplan, diag := ctx.Plan()\\n\\tif diag.HasErrors() {\\n\\t\\treturn nil, diag.Err()\\n\\t}\\n\\n\\treturn plan, nil\\n}\",\n \"func expression(rbp int) int {\\n\\tcurrentToken := tokens[cursor]\\n\\tcursor++\\n\\tnextToken = tokens[cursor]\\n\\tleftPrefix := currentToken.(prefixHandler).nud()\\n\\n\\taddPadding()\\n\\tlog(fmt.Sprintf(\\\"<prefix %d, rbp %d, nextOp lbp %d>\\\", leftPrefix, rbp, nextToken.(infixOperator).lbp()))\\n\\tfor rbp < nextToken.(infixOperator).lbp() {\\n\\t\\tlog(fmt.Sprintf(\\\"<infix %s, lbp %d>\\\", nextToken.(infixHandler).op(), nextToken.(infixOperator).lbp()))\\n\\n\\t\\tcurrentToken = nextToken\\n\\t\\tcursor++\\n\\t\\tnextToken = tokens[cursor]\\n\\t\\tcalcResult := currentToken.(infixHandler).led(leftPrefix)\\n\\t\\tpopPadding()\\n\\t\\tlog(fmt.Sprintf(\\\"<infix %s> = %+v\\\", currentToken.(infixHandler).op(), calcResult))\\n\\n\\t\\tleftPrefix = calcResult\\n\\t}\\n\\treturn leftPrefix\\n}\",\n \"func Expr(sql string, args ...interface{}) Cond {\\n\\treturn expr{sql, args}\\n}\",\n \"func (c *Compiler) Compile(node ast.Node) error {\\n\\tswitch node := node.(type) {\\n\\tcase *ast.Program:\\n\\t\\tfor _, s := range node.Statements {\\n\\t\\t\\terr := c.Compile(s)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\tcase *ast.ExpressionStatement:\\n\\t\\terr := c.Compile(node.Expression)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tc.emit(operation.Pop)\\n\\n\\tcase *ast.InfixExpression:\\n\\t\\t// Convert LessThan operations to GreaterThan ones\\n\\t\\tif node.Operator == \\\"<\\\" {\\n\\n\\t\\t\\t// First compile the right node, then the left node, unlike other infixes\\n\\t\\t\\terr := c.Compile(node.Right)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\n\\t\\t\\terr = c.Compile(node.Left)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\n\\t\\t\\tc.emit(operation.GreaterThan)\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\n\\t\\terr := c.Compile(node.Left)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\terr = c.Compile(node.Right)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tswitch node.Operator {\\n\\t\\tcase \\\"+\\\":\\n\\t\\t\\tc.emit(operation.Add)\\n\\t\\tcase \\\"-\\\":\\n\\t\\t\\tc.emit(operation.Sub)\\n\\t\\tcase \\\"*\\\":\\n\\t\\t\\tc.emit(operation.Mul)\\n\\t\\tcase \\\"/\\\":\\n\\t\\t\\tc.emit(operation.Div)\\n\\t\\tcase \\\">\\\":\\n\\t\\t\\tc.emit(operation.GreaterThan)\\n\\t\\tcase \\\"==\\\":\\n\\t\\t\\tc.emit(operation.Equal)\\n\\t\\tcase \\\"!=\\\":\\n\\t\\t\\tc.emit(operation.NotEqual)\\n\\t\\tcase \\\"=\\\":\\n\\t\\t\\tswitch node.Left.(type) {\\n\\t\\t\\t// Index assignment\\n\\t\\t\\tcase *ast.IndexExpression:\\n\\t\\t\\t\\tie := node.Left.(*ast.IndexExpression)\\n\\n\\t\\t\\t\\t// Compile identifier\\n\\t\\t\\t\\terr := c.Compile(ie.Left)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Compile the index\\n\\t\\t\\t\\terr = c.Compile(ie.Index)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Compile the value\\n\\t\\t\\t\\terr = c.Compile(node.Right)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tc.emit(operation.SetIndex)\\n\\n\\t\\t\\t// Identifier assignment\\n\\t\\t\\tcase *ast.Identifier:\\n\\t\\t\\t\\t// Get the variable\\n\\t\\t\\t\\tident := node.Left.(*ast.Identifier)\\n\\t\\t\\t\\tsymbol, ok := c.symbols.Resolve(ident.Value)\\n\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\treturn fmt.Errorf(\\\"Variable %s is undefined\\\", node.Left)\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Compile the value to be assigned\\n\\t\\t\\t\\terr := c.Compile(node.Right)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tswitch symbol.Scope {\\n\\t\\t\\t\\tcase symbols.GlobalScope:\\n\\t\\t\\t\\t\\tc.emit(operation.SetGlobal, symbol.Index)\\n\\t\\t\\t\\tcase symbols.LocalScope:\\n\\t\\t\\t\\t\\tc.emit(operation.SetLocal, symbol.Index)\\n\\t\\t\\t\\tcase symbols.FreeScope:\\n\\t\\t\\t\\t\\tc.emit(operation.SetFree, symbol.Index)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tdefault:\\n\\t\\t\\treturn fmt.Errorf(\\\"unknown operator %s\\\", node.Operator)\\n\\t\\t}\\n\\n\\tcase *ast.PrefixExpression:\\n\\t\\terr := c.Compile(node.Right)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tswitch node.Operator {\\n\\t\\tcase \\\"!\\\":\\n\\t\\t\\tc.emit(operation.Bang)\\n\\t\\tcase \\\"-\\\":\\n\\t\\t\\tc.emit(operation.Minus)\\n\\t\\tdefault:\\n\\t\\t\\treturn fmt.Errorf(\\\"unknown operator %s\\\", node.Operator)\\n\\t\\t}\\n\\n\\tcase *ast.IntegerLiteral:\\n\\t\\tinteger := &data.Integer{Value: node.Value}\\n\\t\\tc.emit(operation.Constant, c.addConstant(integer))\\n\\n\\tcase *ast.Boolean:\\n\\t\\tif node.Value {\\n\\t\\t\\tc.emit(operation.True)\\n\\t\\t} else {\\n\\t\\t\\tc.emit(operation.False)\\n\\t\\t}\\n\\n\\tcase *ast.StringLiteral:\\n\\t\\tstr := &data.String{Value: node.Value}\\n\\t\\tc.emit(operation.Constant, c.addConstant(str))\\n\\n\\tcase *ast.ArrayLiteral:\\n\\t\\tfor _, el := range node.Elements {\\n\\t\\t\\terr := c.Compile(el)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tc.emit(operation.Array, len(node.Elements))\\n\\n\\tcase *ast.HashLiteral:\\n\\t\\tkeys := []ast.Expression{}\\n\\t\\tfor k := range node.Pairs {\\n\\t\\t\\tkeys = append(keys, k)\\n\\t\\t}\\n\\t\\t// Sort the keys as Go doesn't guarantee key/val order on iteration\\n\\t\\tsort.Slice(keys, func(i, j int) bool {\\n\\t\\t\\treturn keys[i].String() < keys[j].String()\\n\\t\\t})\\n\\t\\tfor _, k := range keys {\\n\\t\\t\\terr := c.Compile(k)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\terr = c.Compile(node.Pairs[k])\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tc.emit(operation.Hash, len(node.Pairs)*2)\\n\\n\\tcase *ast.IndexExpression:\\n\\t\\terr := c.Compile(node.Left)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\terr = c.Compile(node.Index)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tc.emit(operation.Index)\\n\\n\\tcase *ast.IfExpression:\\n\\t\\terr := c.Compile(node.Condition)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\t// Emit a `JumpNotTruthy` with a temporary operand\\n\\t\\tjumpNotTruthyPos := c.emit(operation.JumpNotTruthy, 9999)\\n\\t\\terr = c.Compile(node.Consequent)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tif c.isEmitted(operation.Pop) {\\n\\t\\t\\tc.preventPop()\\n\\t\\t}\\n\\n\\t\\t// Emit a `Jump` with a temporary operand\\n\\t\\tjumpPos := c.emit(operation.Jump, 9999)\\n\\t\\tafterConsequentPos := len(c.currentInstructions())\\n\\t\\tc.changeOperand(jumpNotTruthyPos, afterConsequentPos)\\n\\t\\tif node.Alternate == nil {\\n\\t\\t\\tc.emit(operation.Null)\\n\\t\\t} else {\\n\\t\\t\\terr := c.Compile(node.Alternate)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\tif c.isEmitted(operation.Pop) {\\n\\t\\t\\t\\tc.preventPop()\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tafterAlternatePos := len(c.currentInstructions())\\n\\t\\tc.changeOperand(jumpPos, afterAlternatePos)\\n\\n\\tcase *ast.LetStatement:\\n\\t\\tsymbol := c.symbols.Define(node.Name.Value)\\n\\t\\terr := c.Compile(node.Value)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tif symbol.Scope == symbols.GlobalScope {\\n\\t\\t\\tc.emit(operation.SetGlobal, symbol.Index)\\n\\t\\t} else {\\n\\t\\t\\tc.emit(operation.SetLocal, symbol.Index)\\n\\t\\t}\\n\\n\\tcase *ast.Identifier:\\n\\t\\tsymbol, ok := c.symbols.Resolve(node.Value)\\n\\t\\tif !ok {\\n\\t\\t\\treturn fmt.Errorf(\\\"Variable %s is undefined\\\", node.Value)\\n\\t\\t}\\n\\t\\tc.loadSymbol(symbol)\\n\\n\\tcase *ast.BlockStatement:\\n\\t\\tfor _, s := range node.Statements {\\n\\t\\t\\terr := c.Compile(s)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\tcase *ast.FunctionLiteral:\\n\\t\\tc.enterScope()\\n\\t\\tfor _, p := range node.Parameters {\\n\\t\\t\\tc.symbols.Define(p.Value)\\n\\t\\t}\\n\\t\\terr := c.Compile(node.Body)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\t// If a pop was emitted, replace it with a return value (implicit return)\\n\\t\\tif c.isEmitted(operation.Pop) {\\n\\t\\t\\tc.changeEmittedTo(operation.ReturnValue)\\n\\t\\t}\\n\\n\\t\\t// If no return value was emitted, emit a return instead (no return - empty body)\\n\\t\\tif !c.isEmitted(operation.ReturnValue) {\\n\\t\\t\\tc.emit(operation.Return)\\n\\t\\t}\\n\\n\\t\\tfreeSymbols := c.symbols.Free\\n\\t\\tlocalCount := c.symbols.DefinitionCount\\n\\t\\tinstructions := c.leaveScope()\\n\\n\\t\\tfor _, s := range freeSymbols {\\n\\t\\t\\tc.loadSymbol(s)\\n\\t\\t}\\n\\n\\t\\tcompiled := &data.CompiledFunction{\\n\\t\\t\\tInstructions: instructions,\\n\\t\\t\\tLocalCount: localCount,\\n\\t\\t\\tParamCount: len(node.Parameters),\\n\\t\\t}\\n\\n\\t\\tfnIndex := c.addConstant(compiled)\\n\\t\\tc.emit(operation.Closure, fnIndex, len(freeSymbols))\\n\\n\\tcase *ast.ReturnStatement:\\n\\t\\terr := c.Compile(node.ReturnValue)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tc.emit(operation.ReturnValue)\\n\\n\\tcase *ast.CallExpression:\\n\\t\\terr := c.Compile(node.Function)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tfor _, a := range node.Arguments {\\n\\t\\t\\terr := c.Compile(a)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tc.emit(operation.Call, len(node.Arguments))\\n\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (ann *Annotator) resExpr(ctx *Ctx, e *ast.Expr) ast.Expr {\\n\\tctx = ctx.withExpr(e)\\n\\tnode := *e\\n\\n\\t//ann.logf(\\\"resExpr %T\\\\n\\\", node)\\n\\t//ann.logf(\\\"resExpr %T (%v)\\\\n\\\", *e, ann.sprintNode2(node))\\n\\n\\t// buildname: visit node if there is a function defined for it\\n\\tname, err := reflectutil.TypeNameBase(node)\\n\\tif err != nil {\\n\\t\\treturn nilIdent()\\n\\t}\\n\\tres, err := reflectutil.InvokeByName(ann, \\\"Res\\\"+name, ctx, node)\\n\\tif err != nil {\\n\\t\\tann.logf(\\\"todo: resExpr: %v\\\", err)\\n\\t\\treturn nilIdent()\\n\\t}\\n\\tresult := res[0].Interface().(ast.Expr) // must succeed\\n\\tif result == nil {\\n\\t\\treturn nilIdent()\\n\\t}\\n\\treturn result\\n}\",\n \"func NewProcessor(provider metrics.Provider, lister ContainerAccessor, adapter MetricsAdapter, filter ContainerFilter) Processor {\\n\\treturn Processor{\\n\\t\\tmetricsProvider: provider,\\n\\t\\tctrLister: lister,\\n\\t\\tmetricsAdapter: adapter,\\n\\t\\tctrFilter: filter,\\n\\t\\textensions: map[string]ProcessorExtension{\\n\\t\\t\\tNetworkExtensionID: NewProcessorNetwork(),\\n\\t\\t},\\n\\t}\\n}\",\n \"func (p PatternExprPair) Expr() Expr {\\n\\treturn p.expr\\n}\",\n \"func (m *JobExecutor) WalkPlan(p plan.Task) (Task, error) {\\n\\tswitch p := p.(type) {\\n\\tcase *plan.PreparedStatement:\\n\\t\\treturn m.Executor.WalkPreparedStatement(p)\\n\\tcase *plan.Select:\\n\\t\\tif p.Ctx != nil && p.IsSchemaQuery() {\\n\\t\\t\\tif p.Ctx.Schema != nil && p.Ctx.Schema.InfoSchema != nil {\\n\\t\\t\\t\\tp.Ctx.Schema = p.Ctx.Schema.InfoSchema\\n\\t\\t\\t}\\n\\t\\t\\tp.Stmt.SetSystemQry()\\n\\t\\t}\\n\\t\\treturn m.Executor.WalkSelect(p)\\n\\tcase *plan.Upsert:\\n\\t\\treturn m.Executor.WalkUpsert(p)\\n\\tcase *plan.Insert:\\n\\t\\treturn m.Executor.WalkInsert(p)\\n\\tcase *plan.Update:\\n\\t\\treturn m.Executor.WalkUpdate(p)\\n\\tcase *plan.Delete:\\n\\t\\treturn m.Executor.WalkDelete(p)\\n\\tcase *plan.Command:\\n\\t\\treturn m.Executor.WalkCommand(p)\\n\\n\\t// DDL\\n\\tcase *plan.Create:\\n\\t\\treturn m.Executor.WalkCreate(p)\\n\\tcase *plan.Drop:\\n\\t\\treturn m.Executor.WalkDrop(p)\\n\\tcase *plan.Alter:\\n\\t\\treturn m.Executor.WalkAlter(p)\\n\\t}\\n\\tpanic(fmt.Sprintf(\\\"Not implemented for %T\\\", p))\\n}\",\n \"func (c *Collection) Plan(op controller.Operation,\\n\\tspec types.Spec) (object *types.Object, plan *controller.Plan, err error) {\\n\\n\\terr = c.readTxn(func() error {\\n\\n\\t\\tlog.Debug(\\\"Plan\\\", \\\"op\\\", op, \\\"spec\\\", spec, \\\"V\\\", debugV)\\n\\n\\t\\tobject, err = c.object()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tif c.PlanFunc == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\n\\t\\tif p, e := c.PlanFunc(op, spec); e == nil {\\n\\t\\t\\tplan = &p\\n\\t\\t} else {\\n\\t\\t\\terr = e\\n\\t\\t}\\n\\n\\t\\treturn err\\n\\t})\\n\\treturn\\n}\",\n \"func (k Querier) Plan(c context.Context, req *types.QueryPlanRequest) (*types.QueryPlanResponse, error) {\\n\\tif req == nil {\\n\\t\\treturn nil, status.Error(codes.InvalidArgument, \\\"invalid request\\\")\\n\\t}\\n\\n\\tctx := sdk.UnwrapSDKContext(c)\\n\\tplan, found := k.GetPlan(ctx, req.PlanId)\\n\\tif !found {\\n\\t\\treturn nil, status.Errorf(codes.NotFound, \\\"plan %d not found\\\", req.PlanId)\\n\\t}\\n\\n\\tany, err := codectypes.NewAnyWithValue(plan)\\n\\tif err != nil {\\n\\t\\treturn nil, status.Error(codes.Internal, err.Error())\\n\\t}\\n\\n\\treturn &types.QueryPlanResponse{Plan: any}, nil\\n}\",\n \"func CallExpr(fun ast.Expr, args ...ast.Expr) *ast.CallExpr {\\n\\treturn &ast.CallExpr{\\n\\t\\tFun: fun,\\n\\t\\tArgs: args,\\n\\t}\\n}\",\n \"func (p *planner) Execute(ctx context.Context, n *tree.Execute) (planNode, error) {\\n\\tif p.isPreparing {\\n\\t\\treturn nil, pgerror.NewErrorf(pgerror.CodeInvalidPreparedStatementDefinitionError,\\n\\t\\t\\t\\\"can't prepare an EXECUTE statement\\\")\\n\\t} else if p.curPlan.plannedExecute {\\n\\t\\treturn nil, pgerror.NewErrorf(pgerror.CodeSyntaxError,\\n\\t\\t\\t\\\"can't have more than 1 EXECUTE per statement\\\")\\n\\t}\\n\\tp.curPlan.plannedExecute = true\\n\\tname := n.Name.String()\\n\\tps, ok := p.preparedStatements.Get(name)\\n\\tif !ok {\\n\\t\\treturn nil, pgerror.NewErrorf(\\n\\t\\t\\tpgerror.CodeInvalidSQLStatementNameError,\\n\\t\\t\\t\\\"prepared statement %q does not exist\\\", name,\\n\\t\\t)\\n\\t}\\n\\tpInfo, err := fillInPlaceholders(\\n\\t\\tps, name, n.Params, p.EvalContext().SessionData.SearchPath,\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tp.semaCtx.Placeholders.Assign(pInfo)\\n\\n\\treturn p.newPlan(ctx, ps.Statement, nil /* desiredTypes */)\\n}\",\n \"func (o SecurityPolicyRuleMatcherOutput) Expr() ExprPtrOutput {\\n\\treturn o.ApplyT(func(v SecurityPolicyRuleMatcher) *Expr { return v.Expr }).(ExprPtrOutput)\\n}\",\n \"func (b *PlanBuilder) rewriteWithPreprocess(exprNode ast.ExprNode, p LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int, windowMapper map[*ast.WindowFuncExpr]int, asScalar bool, preprocess func(ast.Node) ast.Node) (expression.Expression, LogicalPlan, error) {\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 13)\\n\\tb.rewriterCounter++\\n\\tdefer func() { trace_util_0.Count(_expression_rewriter_00000, 16); b.rewriterCounter-- }()\\n\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 14)\\n\\trewriter := b.getExpressionRewriter(p)\\n\\t// The rewriter maybe is obtained from \\\"b.rewriterPool\\\", \\\"rewriter.err\\\" is\\n\\t// not nil means certain previous procedure has not handled this error.\\n\\t// Here we give us one more chance to make a correct behavior by handling\\n\\t// this missed error.\\n\\tif rewriter.err != nil {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 17)\\n\\t\\treturn nil, nil, rewriter.err\\n\\t}\\n\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 15)\\n\\trewriter.aggrMap = aggMapper\\n\\trewriter.windowMap = windowMapper\\n\\trewriter.asScalar = asScalar\\n\\trewriter.preprocess = preprocess\\n\\n\\texpr, resultPlan, err := b.rewriteExprNode(rewriter, exprNode, asScalar)\\n\\treturn expr, resultPlan, err\\n}\",\n \"func (_e *MockCompactionPlanContext_Expecter) execCompactionPlan(signal interface{}, plan interface{}) *MockCompactionPlanContext_execCompactionPlan_Call {\\n\\treturn &MockCompactionPlanContext_execCompactionPlan_Call{Call: _e.mock.On(\\\"execCompactionPlan\\\", signal, plan)}\\n}\",\n \"func (r *HistoryRunner) Plan(ctx context.Context) error {\\n\\tif len(r.filename) != 0 {\\n\\t\\t// file mode\\n\\t\\treturn r.planFile(ctx, r.filename)\\n\\t}\\n\\n\\t// directory mode\\n\\treturn r.planDir(ctx)\\n}\",\n \"func CMOVQPL(mr, r operand.Op) { ctx.CMOVQPL(mr, r) }\",\n \"func planCastOperator(\\n\\tctx context.Context,\\n\\tacc *mon.BoundAccount,\\n\\tcolumnTypes []*types.T,\\n\\tinput colexecop.Operator,\\n\\tinputIdx int,\\n\\tfromType *types.T,\\n\\ttoType *types.T,\\n\\tfactory coldata.ColumnFactory,\\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\\n\\toutputIdx := len(columnTypes)\\n\\top, err = colexecbase.GetCastOperator(colmem.NewAllocator(ctx, acc, factory), input, inputIdx, outputIdx, fromType, toType)\\n\\ttyps = appendOneType(columnTypes, toType)\\n\\treturn op, outputIdx, typs, err\\n}\",\n \"func (g *irgen) callExpr(pos src.XPos, typ *types.Type, fun ir.Node, args []ir.Node, dots bool) ir.Node {\\n\\tn := ir.NewCallExpr(pos, ir.OCALL, fun, args)\\n\\tn.IsDDD = dots\\n\\ttyped(typ, n)\\n\\n\\tif fun.Op() == ir.OTYPE {\\n\\t\\t// Actually a type conversion, not a function call.\\n\\t\\tif !g.delayTransform() {\\n\\t\\t\\treturn transformConvCall(n)\\n\\t\\t}\\n\\t\\treturn n\\n\\t}\\n\\n\\tif fun, ok := fun.(*ir.Name); ok && fun.BuiltinOp != 0 {\\n\\t\\tif !g.delayTransform() {\\n\\t\\t\\treturn transformBuiltin(n)\\n\\t\\t}\\n\\t\\treturn n\\n\\t}\\n\\n\\t// Add information, now that we know that fun is actually being called.\\n\\tswitch fun := fun.(type) {\\n\\tcase *ir.SelectorExpr:\\n\\t\\tif fun.Op() == ir.OMETHVALUE {\\n\\t\\t\\top := ir.ODOTMETH\\n\\t\\t\\tif fun.X.Type().IsInterface() {\\n\\t\\t\\t\\top = ir.ODOTINTER\\n\\t\\t\\t}\\n\\t\\t\\tfun.SetOp(op)\\n\\t\\t\\t// Set the type to include the receiver, since that's what\\n\\t\\t\\t// later parts of the compiler expect\\n\\t\\t\\tfun.SetType(fun.Selection.Type)\\n\\t\\t}\\n\\t}\\n\\n\\t// A function instantiation (even if fully concrete) shouldn't be\\n\\t// transformed yet, because we need to add the dictionary during the\\n\\t// transformation.\\n\\tif fun.Op() != ir.OFUNCINST && !g.delayTransform() {\\n\\t\\ttransformCall(n)\\n\\t}\\n\\treturn n\\n}\",\n \"func New(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize, bulkSize int, w io.Writer) (Executor, error) {\\n\\tswitch stm.Type() {\\n\\tcase semantic.Query:\\n\\t\\treturn newQueryPlan(ctx, store, stm, chanSize, w)\\n\\tcase semantic.Insert:\\n\\t\\treturn &insertPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Delete:\\n\\t\\treturn &deletePlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Create:\\n\\t\\treturn &createPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Drop:\\n\\t\\treturn &dropPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tcase semantic.Construct:\\n\\t\\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\\n\\t\\treturn &constructPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t\\tbulkSize: bulkSize,\\n\\t\\t\\tqueryPlan: qp,\\n\\t\\t\\tconstruct: true,\\n\\t\\t}, nil\\n\\tcase semantic.Deconstruct:\\n\\t\\tqp, _ := newQueryPlan(ctx, store, stm, chanSize, w)\\n\\t\\treturn &constructPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t\\tbulkSize: bulkSize,\\n\\t\\t\\tqueryPlan: qp,\\n\\t\\t\\tconstruct: false,\\n\\t\\t}, nil\\n\\tcase semantic.Show:\\n\\t\\treturn &showPlan{\\n\\t\\t\\tstm: stm,\\n\\t\\t\\tstore: store,\\n\\t\\t\\ttracer: w,\\n\\t\\t}, nil\\n\\tdefault:\\n\\t\\treturn nil, fmt.Errorf(\\\"planner.New: unknown statement type in statement %v\\\", stm)\\n\\t}\\n}\",\n \"func evalAstExpr(sctx sessionctx.Context, expr ast.ExprNode) (types.Datum, error) {\\n\\tif val, ok := expr.(*driver.ValueExpr); ok {\\n\\t\\treturn val.Datum, nil\\n\\t}\\n\\tvar is infoschema.InfoSchema\\n\\tif sctx.GetSessionVars().TxnCtx.InfoSchema != nil {\\n\\t\\tis = sctx.GetSessionVars().TxnCtx.InfoSchema.(infoschema.InfoSchema)\\n\\t}\\n\\tb := NewPlanBuilder(sctx, is)\\n\\tfakePlan := LogicalTableDual{}.Init(sctx)\\n\\tnewExpr, _, err := b.rewrite(context.TODO(), expr, fakePlan, nil, true)\\n\\tif err != nil {\\n\\t\\treturn types.Datum{}, err\\n\\t}\\n\\treturn newExpr.Eval(chunk.Row{})\\n}\",\n \"func NewExpr(name, source string, expr expression.Expr) *Expr {\\n\\treturn &Expr{\\n\\t\\tsource: source,\\n\\t\\tExpr: expr,\\n\\t\\tName: name,\\n\\t}\\n}\",\n \"func (p *parser) lambdaExpr() Node {\\n\\treturn p.precedence(p.primary(), 0)\\n}\",\n \"func NewMulExpr(scanner parser.Scanner, a, b Expr) Expr {\\n\\treturn newArithExpr(scanner, a, b, \\\"*\\\", func(a, b float64) float64 { return a * b })\\n}\",\n \"func pfunc(out *Expr, fn func(string) (string, Expr, error)) Parser {\\r\\n\\treturn func(code string) (string, error) {\\r\\n\\t\\tcode, expr, err := fn(code)\\r\\n\\t\\tif err == nil {\\r\\n\\t\\t\\t*out = expr\\r\\n\\t\\t}\\r\\n\\t\\treturn code, err\\r\\n\\t}\\r\\n}\",\n \"func (j *ScheduledJob) ScheduleExpr() string {\\n\\treturn j.rec.ScheduleExpr\\n}\",\n \"func NewAstExprMethodCallExpr4(a int, b int, c int, d int, e AstExprExpressionInterface, f []*AstTypeType, g string, h []*AstExprExpression) (*AstExprMethodCallExpr) {\\n\\tconv_e := javabind.NewGoToJavaCallable()\\n\\tconv_f := javabind.NewGoToJavaList(javabind.NewGoToJavaCallable())\\n\\tconv_g := javabind.NewGoToJavaString()\\n\\tconv_h := javabind.NewGoToJavaList(javabind.NewGoToJavaCallable())\\n\\tif err := conv_e.Convert(e); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tif err := conv_f.Convert(f); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tif err := conv_g.Convert(g); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tif err := conv_h.Convert(h); err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\n\\tobj, err := javabind.GetEnv().NewObject(\\\"com/github/javaparser/ast/expr/MethodCallExpr\\\", a, b, c, d, conv_e.Value().Cast(\\\"com/github/javaparser/ast/expr/Expression\\\"), conv_f.Value().Cast(\\\"java/util/List\\\"), conv_g.Value().Cast(\\\"java/lang/String\\\"), conv_h.Value().Cast(\\\"java/util/List\\\"))\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tconv_e.CleanUp()\\n\\tconv_f.CleanUp()\\n\\tconv_g.CleanUp()\\n\\tconv_h.CleanUp()\\n\\tx := &AstExprMethodCallExpr{}\\n\\tx.Callable = &javabind.Callable{obj}\\n\\treturn x\\n}\",\n \"func NewCallExpr(scanner parser.Scanner, a, b Expr) Expr {\\n\\treturn newBinExpr(scanner, a, b, \\\"call\\\", \\\"«%s»(%s)\\\", Call)\\n}\",\n \"func Expr(op string, x, y interface{}) Node {\\n\\treturn Node{&ast.Expr{Op: op, X: ToNode(x).Node, Y: ToNode(y).Node}}\\n}\",\n \"func (o SecurityPolicyRuleMatcherPtrOutput) Expr() ExprPtrOutput {\\n\\treturn o.ApplyT(func(v *SecurityPolicyRuleMatcher) *Expr {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Expr\\n\\t}).(ExprPtrOutput)\\n}\",\n \"func parse(expression string) *schedule {\\n\\treturn &schedule{}\\n}\",\n \"func (c *Context) Plan() (*Plan, error) {\\n\\tdefer c.acquireRun(\\\"plan\\\")()\\n\\n\\tp := &Plan{\\n\\t\\tModule: c.module,\\n\\t\\tVars: c.variables,\\n\\t\\tState: c.state,\\n\\t\\tTargets: c.targets,\\n\\n\\t\\tTerraformVersion: version.String(),\\n\\t\\tProviderSHA256s: c.providerSHA256s,\\n\\t}\\n\\n\\tvar operation walkOperation\\n\\tif c.destroy {\\n\\t\\toperation = walkPlanDestroy\\n\\t\\tp.Destroy = true\\n\\t} else {\\n\\t\\t// Set our state to be something temporary. We do this so that\\n\\t\\t// the plan can update a fake state so that variables work, then\\n\\t\\t// we replace it back with our old state.\\n\\t\\told := c.state\\n\\t\\tif old == nil {\\n\\t\\t\\tc.state = &State{}\\n\\t\\t\\tc.state.init()\\n\\t\\t} else {\\n\\t\\t\\tc.state = old.DeepCopy()\\n\\t\\t}\\n\\t\\tdefer func() {\\n\\t\\t\\tc.state = old\\n\\t\\t}()\\n\\n\\t\\toperation = walkPlan\\n\\t}\\n\\n\\t// Setup our diff\\n\\tc.diffLock.Lock()\\n\\tc.diff = new(Diff)\\n\\tc.diff.init()\\n\\tc.diffLock.Unlock()\\n\\n\\t// Build the graph.\\n\\tgraphType := GraphTypePlan\\n\\tif c.destroy {\\n\\t\\tgraphType = GraphTypePlanDestroy\\n\\t}\\n\\tgraph, err := c.Graph(graphType, nil)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// Do the walk\\n\\twalker, err := c.walk(graph, operation)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tp.Diff = c.diff\\n\\n\\t// If this is true, it means we're running unit tests. In this case,\\n\\t// we perform a deep copy just to ensure that all context tests also\\n\\t// test that a diff is copy-able. This will panic if it fails. This\\n\\t// is enabled during unit tests.\\n\\t//\\n\\t// This should never be true during production usage, but even if it is,\\n\\t// it can't do any real harm.\\n\\tif contextTestDeepCopyOnPlan {\\n\\t\\tp.Diff.DeepCopy()\\n\\t}\\n\\n\\t/*\\n\\t\\t// We don't do the reverification during the new destroy plan because\\n\\t\\t// it will use a different apply process.\\n\\t\\tif X_legacyGraph {\\n\\t\\t\\t// Now that we have a diff, we can build the exact graph that Apply will use\\n\\t\\t\\t// and catch any possible cycles during the Plan phase.\\n\\t\\t\\tif _, err := c.Graph(GraphTypeLegacy, nil); err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t*/\\n\\n\\tvar errs error\\n\\tif len(walker.ValidationErrors) > 0 {\\n\\t\\terrs = multierror.Append(errs, walker.ValidationErrors...)\\n\\t}\\n\\treturn p, errs\\n}\",\n \"func (p *Parser) parseMethodCallExpression(obj asti.ExpressionI) asti.ExpressionI {\\n\\tmethodCall := &ast.ObjectCallExpression{Token: p.curToken, Object: obj}\\n\\tp.nextToken()\\n\\tname := p.parseIdentifier()\\n\\tp.nextToken()\\n\\tmethodCall.Call = p.parseCallExpression(name)\\n\\treturn methodCall\\n}\",\n \"func Expr(expression string, args ...interface{}) *Query {\\n\\treturn &Query{expression, args}\\n}\",\n \"func New(zctx *zson.Context, parent proc.Interface, args []expr.Evaluator, typ zng.Type, name string) (proc.Interface, error) {\\n\\tcols := []zng.Column{{Name: name, Type: typ}}\\n\\trectyp := zctx.MustLookupTypeRecord(cols)\\n\\tbuilder := zng.NewBuilder(rectyp)\\n\\treturn &Proc{\\n\\t\\tparent: parent,\\n\\t\\tbuilder: *builder,\\n\\t\\ttyp: typ,\\n\\t\\targs: args,\\n\\t}, nil\\n}\",\n \"func (ng *Engine) exec(ctx context.Context, q *query) (model.Value, error) {\\n\\tcurrentQueries.Inc()\\n\\tdefer currentQueries.Dec()\\n\\tctx, cancel := context.WithTimeout(ctx, ng.options.Timeout)\\n\\tq.cancel = cancel\\n\\n\\tqueueTimer := q.stats.GetTimer(stats.ExecQueueTime).Start()\\n\\n\\tif err := ng.gate.Start(ctx); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tdefer ng.gate.Done()\\n\\n\\tqueueTimer.Stop()\\n\\n\\t// Cancel when execution is done or an error was raised.\\n\\tdefer q.cancel()\\n\\n\\tconst env = \\\"query execution\\\"\\n\\n\\tevalTimer := q.stats.GetTimer(stats.TotalEvalTime).Start()\\n\\tdefer evalTimer.Stop()\\n\\n\\t// The base context might already be canceled on the first iteration (e.g. during shutdown).\\n\\tif err := contextDone(ctx, env); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tswitch s := q.Statement().(type) {\\n\\tcase *EvalStmt:\\n\\t\\treturn ng.execEvalStmt(ctx, q, s)\\n\\tcase testStmt:\\n\\t\\treturn nil, s(ctx)\\n\\t}\\n\\n\\tpanic(fmt.Errorf(\\\"promql.Engine.exec: unhandled statement of type %T\\\", q.Statement()))\\n}\",\n \"func (fr *Frame) ParseExpression(s string) (result T) {\\n\\tlog.Printf(\\\"ParseExpression <- %q\\\", s)\\n\\n\\tt, _ := fr.ParseExprRel(s)\\n\\n\\treturn t\\n}\",\n \"func (fr *Frame) ParseExpression(s string) (result T) {\\n\\tt, _ := fr.ParseExprCond(s)\\n\\n\\treturn t\\n}\",\n \"func (s *BaseMuParserListener) EnterParExpr(ctx *ParExprContext) {}\",\n \"func (dsp *distSQLPlanner) PlanAndRun(\\n\\tctx context.Context, txn *client.Txn, tree planNode, recv *distSQLReceiver,\\n) error {\\n\\t// Trigger limit propagation.\\n\\ttree.SetLimitHint(math.MaxInt64, true)\\n\\n\\tplanCtx := planningCtx{\\n\\t\\tctx: ctx,\\n\\t\\tspanIter: dsp.spanResolver.NewSpanResolverIterator(),\\n\\t\\tnodeAddresses: make(map[roachpb.NodeID]string),\\n\\t}\\n\\tthisNodeID := dsp.nodeDesc.NodeID\\n\\tplanCtx.nodeAddresses[thisNodeID] = dsp.nodeDesc.Address.String()\\n\\n\\tplan, err := dsp.createPlanForNode(&planCtx, tree)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\t// If we don't already have a single result router on this node, add a final\\n\\t// stage.\\n\\tif len(plan.resultRouters) != 1 ||\\n\\t\\tplan.processors[plan.resultRouters[0]].node != thisNodeID {\\n\\t\\tdsp.addSingleGroupStage(\\n\\t\\t\\t&plan, thisNodeID, distsql.ProcessorCoreUnion{Noop: &distsql.NoopCoreSpec{}},\\n\\t\\t)\\n\\t\\tif len(plan.resultRouters) != 1 {\\n\\t\\t\\tpanic(fmt.Sprintf(\\\"%d results after single group stage\\\", len(plan.resultRouters)))\\n\\t\\t}\\n\\t}\\n\\n\\t// Set up the endpoints for p.streams.\\n\\tdsp.populateEndpoints(&planCtx, &plan)\\n\\n\\t// Set up the endpoint for the final result.\\n\\tfinalOut := &plan.processors[plan.resultRouters[0]].spec.Output[0]\\n\\tfinalOut.Streams = append(finalOut.Streams, distsql.StreamEndpointSpec{\\n\\t\\tType: distsql.StreamEndpointSpec_SYNC_RESPONSE,\\n\\t})\\n\\n\\trecv.resultToStreamColMap = plan.planToStreamColMap\\n\\n\\t// Split the processors by nodeID to create the FlowSpecs.\\n\\tflowID := distsql.FlowID{UUID: uuid.MakeV4()}\\n\\tnodeIDMap := make(map[roachpb.NodeID]int)\\n\\t// nodeAddresses contains addresses for the nodes that were referenced during\\n\\t// planning, so we're likely going to have this many nodes (and we have one\\n\\t// flow per node).\\n\\tnodeIDs := make([]roachpb.NodeID, 0, len(planCtx.nodeAddresses))\\n\\tflows := make([]distsql.FlowSpec, 0, len(planCtx.nodeAddresses))\\n\\n\\tfor _, p := range plan.processors {\\n\\t\\tidx, ok := nodeIDMap[p.node]\\n\\t\\tif !ok {\\n\\t\\t\\tflow := distsql.FlowSpec{FlowID: flowID}\\n\\t\\t\\tidx = len(flows)\\n\\t\\t\\tflows = append(flows, flow)\\n\\t\\t\\tnodeIDs = append(nodeIDs, p.node)\\n\\t\\t\\tnodeIDMap[p.node] = idx\\n\\t\\t}\\n\\t\\tflows[idx].Processors = append(flows[idx].Processors, p.spec)\\n\\t}\\n\\n\\tif logPlanDiagram {\\n\\t\\tnodeNames := make([]string, len(nodeIDs))\\n\\t\\tfor i, n := range nodeIDs {\\n\\t\\t\\tnodeNames[i] = n.String()\\n\\t\\t}\\n\\n\\t\\tvar buf bytes.Buffer\\n\\t\\tif err := distsql.GeneratePlanDiagram(flows, nodeNames, &buf); err != nil {\\n\\t\\t\\tlog.Infof(ctx, \\\"Error generating diagram: %s\\\", err)\\n\\t\\t} else {\\n\\t\\t\\tlog.Infof(ctx, \\\"Plan diagram JSON:\\\\n%s\\\", buf.String())\\n\\t\\t}\\n\\t}\\n\\n\\t// Start the flows on all other nodes.\\n\\tfor i, nodeID := range nodeIDs {\\n\\t\\tif nodeID == thisNodeID {\\n\\t\\t\\t// Skip this node.\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\treq := distsql.SetupFlowRequest{\\n\\t\\t\\tTxn: txn.Proto,\\n\\t\\t\\tFlow: flows[i],\\n\\t\\t}\\n\\t\\tif err := distsql.SetFlowRequestTrace(ctx, &req); err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tconn, err := dsp.rpcContext.GRPCDial(planCtx.nodeAddresses[nodeID])\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tclient := distsql.NewDistSQLClient(conn)\\n\\t\\t// TODO(radu): we are not waiting for the flows to complete, but we are\\n\\t\\t// still waiting for a round trip; we should start the flows in parallel, at\\n\\t\\t// least if there are enough of them.\\n\\t\\tif resp, err := client.SetupFlow(context.Background(), &req); err != nil {\\n\\t\\t\\treturn err\\n\\t\\t} else if resp.Error != nil {\\n\\t\\t\\treturn resp.Error.GoError()\\n\\t\\t}\\n\\t}\\n\\tlocalReq := distsql.SetupFlowRequest{\\n\\t\\tTxn: txn.Proto,\\n\\t\\tFlow: flows[nodeIDMap[thisNodeID]],\\n\\t}\\n\\tif err := distsql.SetFlowRequestTrace(ctx, &localReq); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tflow, err := dsp.distSQLSrv.SetupSyncFlow(ctx, &localReq, recv)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\t// TODO(radu): this should go through the flow scheduler.\\n\\tflow.Start(func() {})\\n\\tflow.Wait()\\n\\tflow.Cleanup()\\n\\n\\treturn nil\\n}\",\n \"func (b *PlanBuilder) rewrite(exprNode ast.ExprNode, p LogicalPlan, aggMapper map[*ast.AggregateFuncExpr]int, asScalar bool) (expression.Expression, LogicalPlan, error) {\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 12)\\n\\texpr, resultPlan, err := b.rewriteWithPreprocess(exprNode, p, aggMapper, nil, asScalar, nil)\\n\\treturn expr, resultPlan, err\\n}\",\n \"func (t *TimeLine) Plan(nbars, num, denom uint32, callback func(delta int32)) {\\n\\t/*\\n\\t 1. calc the abs position for the callback by using forward\\n\\t 2. rewind cursor\\n\\t 3. register callback\\n\\t 4. sort planned callbacks\\n\\t*/\\n\\n\\tsavedCursor := t.cursor\\n\\tt.forwardIgnoringCallbacks(nbars, num, denom)\\n\\tpos := t.cursor\\n\\tt.cursor = savedCursor\\n\\t//\\tfmt.Printf(\\\"cursor: %v, pos: %v\\\\n\\\", t.cursor, pos)\\n\\tt.plannedCallbacks = append(t.plannedCallbacks, plannedCallback{callback: callback, position: pos})\\n\\tsort.Sort(t.plannedCallbacks)\\n}\",\n \"func newQueryPlan(ctx context.Context, store storage.Store, stm *semantic.Statement, chanSize int, w io.Writer) (*queryPlan, error) {\\n\\tt, err := table.New([]string{})\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn &queryPlan{\\n\\t\\tstm: stm,\\n\\t\\tstore: store,\\n\\t\\tbndgs: stm.Bindings(),\\n\\t\\tgrfsNames: stm.InputGraphNames(),\\n\\t\\tclauses: stm.GraphPatternClauses(),\\n\\t\\tfilters: stm.FilterClauses(),\\n\\t\\ttbl: t,\\n\\t\\tchanSize: chanSize,\\n\\t\\ttracer: w,\\n\\t}, nil\\n}\",\n \"func CloneExpr(in Expr) Expr {\\n\\tif in == nil {\\n\\t\\treturn nil\\n\\t}\\n\\tswitch in := in.(type) {\\n\\tcase *AndExpr:\\n\\t\\treturn CloneRefOfAndExpr(in)\\n\\tcase Argument:\\n\\t\\treturn in\\n\\tcase *BinaryExpr:\\n\\t\\treturn CloneRefOfBinaryExpr(in)\\n\\tcase BoolVal:\\n\\t\\treturn in\\n\\tcase *CaseExpr:\\n\\t\\treturn CloneRefOfCaseExpr(in)\\n\\tcase *ColName:\\n\\t\\treturn CloneRefOfColName(in)\\n\\tcase *CollateExpr:\\n\\t\\treturn CloneRefOfCollateExpr(in)\\n\\tcase *ComparisonExpr:\\n\\t\\treturn CloneRefOfComparisonExpr(in)\\n\\tcase *ConvertExpr:\\n\\t\\treturn CloneRefOfConvertExpr(in)\\n\\tcase *ConvertUsingExpr:\\n\\t\\treturn CloneRefOfConvertUsingExpr(in)\\n\\tcase *CurTimeFuncExpr:\\n\\t\\treturn CloneRefOfCurTimeFuncExpr(in)\\n\\tcase *Default:\\n\\t\\treturn CloneRefOfDefault(in)\\n\\tcase *ExistsExpr:\\n\\t\\treturn CloneRefOfExistsExpr(in)\\n\\tcase *FuncExpr:\\n\\t\\treturn CloneRefOfFuncExpr(in)\\n\\tcase *GroupConcatExpr:\\n\\t\\treturn CloneRefOfGroupConcatExpr(in)\\n\\tcase *IntervalExpr:\\n\\t\\treturn CloneRefOfIntervalExpr(in)\\n\\tcase *IsExpr:\\n\\t\\treturn CloneRefOfIsExpr(in)\\n\\tcase ListArg:\\n\\t\\treturn CloneListArg(in)\\n\\tcase *Literal:\\n\\t\\treturn CloneRefOfLiteral(in)\\n\\tcase *MatchExpr:\\n\\t\\treturn CloneRefOfMatchExpr(in)\\n\\tcase *NotExpr:\\n\\t\\treturn CloneRefOfNotExpr(in)\\n\\tcase *NullVal:\\n\\t\\treturn CloneRefOfNullVal(in)\\n\\tcase *OrExpr:\\n\\t\\treturn CloneRefOfOrExpr(in)\\n\\tcase *RangeCond:\\n\\t\\treturn CloneRefOfRangeCond(in)\\n\\tcase *Subquery:\\n\\t\\treturn CloneRefOfSubquery(in)\\n\\tcase *SubstrExpr:\\n\\t\\treturn CloneRefOfSubstrExpr(in)\\n\\tcase *TimestampFuncExpr:\\n\\t\\treturn CloneRefOfTimestampFuncExpr(in)\\n\\tcase *UnaryExpr:\\n\\t\\treturn CloneRefOfUnaryExpr(in)\\n\\tcase ValTuple:\\n\\t\\treturn CloneValTuple(in)\\n\\tcase *ValuesFuncExpr:\\n\\t\\treturn CloneRefOfValuesFuncExpr(in)\\n\\tcase *XorExpr:\\n\\t\\treturn CloneRefOfXorExpr(in)\\n\\tdefault:\\n\\t\\t// this should never happen\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func (g *memoGroup) addExpr(mexpr *memoExpr) exprID {\\n\\tg.exprs = append(g.exprs, *mexpr)\\n\\treturn exprID(len(g.exprs) - 1)\\n}\",\n \"func CreateNewExpr() Expr {\\n\\tc11 := Constant{value: 1.1}\\n\\tc22 := Constant{value: 2.2}\\n\\tc33 := Constant{value: 3.3}\\n\\tbp := BinaryPlus{left: &BinaryPlus{left: &c11, right: &c22}, right: &c33}\\n\\treturn &bp\\n}\",\n \"func SelectPlan(possiblePlans []string, ov *OperatorVersion) *string {\\n\\tfor _, plan := range possiblePlans {\\n\\t\\tif _, ok := ov.Spec.Plans[plan]; ok {\\n\\t\\t\\treturn &plan\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (s *BaseConcertoListener) EnterPrimaryExpr(ctx *PrimaryExprContext) {}\",\n \"func newFuncExpr(funcName FuncName, funcs ...Expr) (*funcExpr, error) {\\n\\tswitch funcName {\\n\\tcase Avg, Max, Min, Sum:\\n\\t\\tif len(funcs) != 1 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): exactly one argument expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errParseNonUnaryAgregateFunctionCall(err)\\n\\t\\t}\\n\\n\\t\\tif !funcs[0].ReturnType().isNumberKind() {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument %v evaluate to %v, not number\\\", funcName, funcs[0], funcs[0].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\n\\tcase Count:\\n\\t\\tif len(funcs) != 1 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): exactly one argument expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errParseNonUnaryAgregateFunctionCall(err)\\n\\t\\t}\\n\\n\\t\\tswitch funcs[0].ReturnType() {\\n\\t\\tcase Null, Bool, Int, Float, String, Timestamp, column, record:\\n\\t\\tdefault:\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument %v evaluate to %v is incompatible\\\", funcName, funcs[0], funcs[0].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\n\\tcase CharLength, CharacterLength, Trim, Lower, Upper, ToTimestamp:\\n\\t\\tif len(funcs) != 1 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): exactly one argument expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errEvaluatorInvalidArguments(err)\\n\\t\\t}\\n\\n\\t\\tif !funcs[0].ReturnType().isStringKind() {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument %v evaluate to %v, not string\\\", funcName, funcs[0], funcs[0].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\n\\tcase Coalesce:\\n\\t\\tif len(funcs) < 1 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): one or more argument expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errEvaluatorInvalidArguments(err)\\n\\t\\t}\\n\\n\\t\\tfor i := range funcs {\\n\\t\\t\\tif !funcs[i].ReturnType().isBaseKind() {\\n\\t\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument-%v %v evaluate to %v is incompatible\\\", funcName, i+1, funcs[i], funcs[i].ReturnType())\\n\\t\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\n\\tcase NullIf:\\n\\t\\tif len(funcs) != 2 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): exactly two arguments expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errEvaluatorInvalidArguments(err)\\n\\t\\t}\\n\\n\\t\\tif !funcs[0].ReturnType().isBaseKind() {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument-1 %v evaluate to %v is incompatible\\\", funcName, funcs[0], funcs[0].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\tif !funcs[1].ReturnType().isBaseKind() {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument-2 %v evaluate to %v is incompatible\\\", funcName, funcs[1], funcs[1].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\n\\tcase UTCNow:\\n\\t\\tif len(funcs) != 0 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): no argument expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errEvaluatorInvalidArguments(err)\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\n\\tcase Substring:\\n\\t\\tif len(funcs) < 2 || len(funcs) > 3 {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): exactly two or three arguments expected; got %v\\\", funcName, len(funcs))\\n\\t\\t\\treturn nil, errEvaluatorInvalidArguments(err)\\n\\t\\t}\\n\\n\\t\\tif !funcs[0].ReturnType().isStringKind() {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument-1 %v evaluate to %v, not string\\\", funcName, funcs[0], funcs[0].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\tif !funcs[1].ReturnType().isIntKind() {\\n\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument-2 %v evaluate to %v, not int\\\", funcName, funcs[1], funcs[1].ReturnType())\\n\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t}\\n\\n\\t\\tif len(funcs) > 2 {\\n\\t\\t\\tif !funcs[2].ReturnType().isIntKind() {\\n\\t\\t\\t\\terr := fmt.Errorf(\\\"%v(): argument-3 %v evaluate to %v, not int\\\", funcName, funcs[2], funcs[2].ReturnType())\\n\\t\\t\\t\\treturn nil, errIncorrectSQLFunctionArgumentType(err)\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn &funcExpr{\\n\\t\\t\\targs: funcs,\\n\\t\\t\\tname: funcName,\\n\\t\\t}, nil\\n\\t}\\n\\n\\treturn nil, errUnsupportedFunction(fmt.Errorf(\\\"unknown function name %v\\\", funcName))\\n}\",\n \"func (m *Model) NewProc(ctx nn.Context) nn.Processor {\\n\\treturn &Processor{\\n\\t\\tBaseProcessor: nn.BaseProcessor{\\n\\t\\t\\tModel: m,\\n\\t\\t\\tMode: ctx.Mode,\\n\\t\\t\\tGraph: ctx.Graph,\\n\\t\\t\\tFullSeqProcessing: true,\\n\\t\\t},\\n\\t\\tscaleFactor: m.ScaleFactor,\\n\\t\\tquery: m.Query.NewProc(ctx).(*linear.Processor),\\n\\t\\tvalue: m.Value.NewProc(ctx).(*linear.Processor),\\n\\t\\tr: ctx.Graph.NewWrap(m.R),\\n\\t\\tAttention: nil,\\n\\t}\\n}\",\n \"func NewPlan(config *Config, name string) (plan *Plan, err error) {\\n\\tpath, err := FindPlanPath(config, name)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tplan, err = ReadPath(path.String())\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn plan, nil\\n}\",\n \"func (p *Qlang) Eval(expr string) (err error) {\\n\\n\\treturn p.Exec([]byte(expr), \\\"\\\")\\n}\",\n \"func (c *Context) CMOVQPL(mr, r operand.Op) {\\n\\tc.addinstruction(x86.CMOVQPL(mr, r))\\n}\",\n \"func RegexpFromQuery(q string) (*regexp.Regexp, error) {\\n\\tplan, err := query.Pipeline(query.Init(q, query.SearchTypeRegex))\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif len(plan) != 1 {\\n\\t\\treturn nil, errors.New(\\\"compute endpoint only supports one search pattern currently ('and' or 'or' operators are not supported yet)\\\")\\n\\t}\\n\\tswitch node := plan[0].Pattern.(type) {\\n\\tcase query.Operator:\\n\\t\\tif len(node.Operands) == 1 {\\n\\t\\t\\tif pattern, ok := node.Operands[0].(query.Pattern); ok && !pattern.Negated {\\n\\t\\t\\t\\trp, err := regexp.Compile(pattern.Value)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, errors.Wrap(err, \\\"regular expression is not valid for compute endpoint\\\")\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn rp, nil\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn nil, errors.New(\\\"compute endpoint only supports one search pattern currently ('and' or 'or' operators are not supported yet)\\\")\\n\\tcase query.Pattern:\\n\\t\\tif !node.Negated {\\n\\t\\t\\treturn regexp.Compile(node.Value)\\n\\t\\t}\\n\\t}\\n\\t// unreachable\\n\\treturn nil, nil\\n}\",\n \"func (m *Projection) projectionEvaluator() MessageHandler {\\n\\tout := m.MessageOut()\\n\\tcolumns := m.sql.Columns\\n\\t// if len(m.sql.From) > 1 && m.sql.From[0].Source != nil && len(m.sql.From[0].Source.Columns) > 0 {\\n\\t// \\t// we have re-written this query, lets build new list of columns\\n\\t// \\tcolumns = make(expr.Columns, 0)\\n\\t// \\tfor _, from := range m.sql.From {\\n\\t// \\t\\tfor _, col := range from.Source.Columns {\\n\\t// \\t\\t\\tcolumns = append(columns, col)\\n\\t// \\t\\t}\\n\\t// \\t}\\n\\t// }\\n\\treturn func(ctx *expr.Context, msg datasource.Message) bool {\\n\\t\\t// defer func() {\\n\\t\\t// \\tif r := recover(); r != nil {\\n\\t\\t// \\t\\tu.Errorf(\\\"crap, %v\\\", r)\\n\\t\\t// \\t}\\n\\t\\t// }()\\n\\n\\t\\t//u.Infof(\\\"got projection message: %T %#v\\\", msg, msg.Body())\\n\\t\\tvar outMsg datasource.Message\\n\\t\\tswitch mt := msg.(type) {\\n\\t\\tcase *datasource.SqlDriverMessageMap:\\n\\t\\t\\t// readContext := datasource.NewContextUrlValues(uv)\\n\\t\\t\\t// use our custom write context for example purposes\\n\\t\\t\\twriteContext := datasource.NewContextSimple()\\n\\t\\t\\toutMsg = writeContext\\n\\t\\t\\t//u.Debugf(\\\"about to project: %#v\\\", mt)\\n\\t\\t\\tfor _, col := range columns {\\n\\t\\t\\t\\tif col.ParentIndex < 0 {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//u.Debugf(\\\"col: idx:%v pidx:%v key:%v %s\\\", col.Index, col.ParentIndex, col.Key(), col.Expr)\\n\\t\\t\\t\\tif col.Guard != nil {\\n\\t\\t\\t\\t\\tifColValue, ok := vm.Eval(mt, col.Guard)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tu.Errorf(\\\"Could not evaluate if: %v\\\", col.Guard.String())\\n\\t\\t\\t\\t\\t\\t//return fmt.Errorf(\\\"Could not evaluate if clause: %v\\\", col.Guard.String())\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//u.Debugf(\\\"if eval val: %T:%v\\\", ifColValue, ifColValue)\\n\\t\\t\\t\\t\\tswitch ifColVal := ifColValue.(type) {\\n\\t\\t\\t\\t\\tcase value.BoolValue:\\n\\t\\t\\t\\t\\t\\tif ifColVal.Val() == false {\\n\\t\\t\\t\\t\\t\\t\\t//u.Debugf(\\\"Filtering out col\\\")\\n\\t\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif col.Star {\\n\\t\\t\\t\\t\\tfor k, v := range mt.Row() {\\n\\t\\t\\t\\t\\t\\twriteContext.Put(&expr.Column{As: k}, nil, value.NewValue(v))\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tv, ok := vm.Eval(mt, col.Expr)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tu.Warnf(\\\"failed eval key=%v val=%#v expr:%s mt:%#v\\\", col.Key(), v, col.Expr, mt)\\n\\t\\t\\t\\t\\t} else if v == nil {\\n\\t\\t\\t\\t\\t\\tu.Debugf(\\\"evaled: key=%v val=%v\\\", col.Key(), v)\\n\\t\\t\\t\\t\\t\\twriteContext.Put(col, mt, v)\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t//u.Debugf(\\\"evaled: key=%v val=%v\\\", col.Key(), v.Value())\\n\\t\\t\\t\\t\\t\\twriteContext.Put(col, mt, v)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tcase *datasource.ContextUrlValues:\\n\\t\\t\\t// readContext := datasource.NewContextUrlValues(uv)\\n\\t\\t\\t// use our custom write context for example purposes\\n\\t\\t\\twriteContext := datasource.NewContextSimple()\\n\\t\\t\\toutMsg = writeContext\\n\\t\\t\\t//u.Infof(\\\"about to project: colsct%v %#v\\\", len(sql.Columns), outMsg)\\n\\t\\t\\tfor _, col := range columns {\\n\\t\\t\\t\\t//u.Debugf(\\\"col: %#v\\\", col)\\n\\t\\t\\t\\tif col.Guard != nil {\\n\\t\\t\\t\\t\\tifColValue, ok := vm.Eval(mt, col.Guard)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tu.Errorf(\\\"Could not evaluate if: %v\\\", col.Guard.String())\\n\\t\\t\\t\\t\\t\\t//return fmt.Errorf(\\\"Could not evaluate if clause: %v\\\", col.Guard.String())\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//u.Debugf(\\\"if eval val: %T:%v\\\", ifColValue, ifColValue)\\n\\t\\t\\t\\t\\tswitch ifColVal := ifColValue.(type) {\\n\\t\\t\\t\\t\\tcase value.BoolValue:\\n\\t\\t\\t\\t\\t\\tif ifColVal.Val() == false {\\n\\t\\t\\t\\t\\t\\t\\t//u.Debugf(\\\"Filtering out col\\\")\\n\\t\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif col.Star {\\n\\t\\t\\t\\t\\tfor k, v := range mt.Row() {\\n\\t\\t\\t\\t\\t\\twriteContext.Put(&expr.Column{As: k}, nil, v)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t//u.Debugf(\\\"tree.Root: as?%v %#v\\\", col.As, col.Expr)\\n\\t\\t\\t\\t\\tv, ok := vm.Eval(mt, col.Expr)\\n\\t\\t\\t\\t\\t//u.Debugf(\\\"evaled: ok?%v key=%v val=%v\\\", ok, col.Key(), v)\\n\\t\\t\\t\\t\\tif ok {\\n\\t\\t\\t\\t\\t\\twriteContext.Put(col, mt, v)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\tdefault:\\n\\t\\t\\tu.Errorf(\\\"could not project msg: %T\\\", msg)\\n\\t\\t}\\n\\n\\t\\t//u.Debugf(\\\"completed projection for: %p %#v\\\", out, outMsg)\\n\\t\\tselect {\\n\\t\\tcase out <- outMsg:\\n\\t\\t\\treturn true\\n\\t\\tcase <-m.SigChan():\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t}\\n}\",\n \"func (*dedicatedRenderer) evaluateWhenExpression(params *mapEvalParameters, exprString string) (interface{}, error) {\\n\\texpr, err := govaluate.NewEvaluableExpression(exprString)\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrap(err, \\\"while parsing expression\\\")\\n\\t}\\n\\n\\tresult, err := expr.Eval(params)\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrap(err, \\\"while evaluating expression\\\")\\n\\t}\\n\\n\\treturn result, nil\\n}\",\n \"func Expr(sql string, args ...interface{}) expr {\\n\\treturn expr{sql: sql, args: args}\\n}\",\n \"func NewRuleExpression(cache *LocalActionsCache) *RuleExpression {\\n\\treturn &RuleExpression{\\n\\t\\tRuleBase: RuleBase{name: \\\"expression\\\"},\\n\\t\\tmatrixTy: nil,\\n\\t\\tstepsTy: nil,\\n\\t\\tneedsTy: nil,\\n\\t\\tworkflow: nil,\\n\\t\\tlocalActions: cache,\\n\\t}\\n}\",\n \"func eval(rpn string) {\\n\\t//The buffer stack\\n\\tbuf := new(Stack)\\n\\t//List of virtual indexes created\\n\\t//virt := []string{}\\n\\n\\t//Break the expression into fields\\n\\te := strings.Fields(rpn)\\n\\n\\t//Iterate over the stack and evaluate using the buffer stack\\n\\tfor i := range e {\\n\\t\\t//If the token is an operator, pop two items off the buffer and perform the binary operation\\n\\t\\tif isOp(e[i]) {\\n\\t\\t\\tv := performBinOp(e[i], buf.Pop().(string), buf.Pop().(string))\\n\\t\\t\\tbuf.Push(v)\\n\\t\\t} else {\\n\\t\\t\\t//If the token is not an operator, push onto the buffer\\n\\t\\t\\tbuf.Push(e[i])\\n\\t\\t}\\n\\t}\\n}\",\n \"func Eval(ctx context.Context, e Expr, vs Values) (interface{}, error) {\\r\\n\\tfn, err := FuncOf(ctx, e, vs)\\r\\n\\tif err != nil {\\r\\n\\t\\treturn nil, err\\r\\n\\t}\\r\\n\\treturn fn.Call(ctx, vs)\\r\\n}\",\n \"func (e *Evaluator) Eval(expr *tipb.Expr) (types.Datum, error) {\\n\\tswitch expr.GetTp() {\\n\\tcase tipb.ExprType_Null:\\n\\t\\treturn types.Datum{}, nil\\n\\tcase tipb.ExprType_Int64:\\n\\t\\treturn e.evalInt(expr.Val)\\n\\tcase tipb.ExprType_Uint64:\\n\\t\\treturn e.evalUint(expr.Val)\\n\\tcase tipb.ExprType_String:\\n\\t\\treturn e.evalString(expr.Val)\\n\\tcase tipb.ExprType_Bytes:\\n\\t\\treturn types.NewBytesDatum(expr.Val), nil\\n\\tcase tipb.ExprType_Float32:\\n\\t\\treturn e.evalFloat(expr.Val, true)\\n\\tcase tipb.ExprType_Float64:\\n\\t\\treturn e.evalFloat(expr.Val, false)\\n\\tcase tipb.ExprType_MysqlDecimal:\\n\\t\\treturn e.evalDecimal(expr.Val)\\n\\tcase tipb.ExprType_MysqlDuration:\\n\\t\\treturn e.evalDuration(expr.Val)\\n\\tcase tipb.ExprType_ColumnRef:\\n\\t\\treturn e.evalColumnRef(expr.Val)\\n\\tcase tipb.ExprType_LT:\\n\\t\\treturn e.evalLT(expr)\\n\\tcase tipb.ExprType_LE:\\n\\t\\treturn e.evalLE(expr)\\n\\tcase tipb.ExprType_EQ:\\n\\t\\treturn e.evalEQ(expr)\\n\\tcase tipb.ExprType_NE:\\n\\t\\treturn e.evalNE(expr)\\n\\tcase tipb.ExprType_GE:\\n\\t\\treturn e.evalGE(expr)\\n\\tcase tipb.ExprType_GT:\\n\\t\\treturn e.evalGT(expr)\\n\\tcase tipb.ExprType_NullEQ:\\n\\t\\treturn e.evalNullEQ(expr)\\n\\tcase tipb.ExprType_And:\\n\\t\\treturn e.evalAnd(expr)\\n\\tcase tipb.ExprType_Or:\\n\\t\\treturn e.evalOr(expr)\\n\\tcase tipb.ExprType_Like:\\n\\t\\treturn e.evalLike(expr)\\n\\tcase tipb.ExprType_Not:\\n\\t\\treturn e.evalNot(expr)\\n\\tcase tipb.ExprType_In:\\n\\t\\treturn e.evalIn(expr)\\n\\tcase tipb.ExprType_Plus, tipb.ExprType_Div:\\n\\t\\treturn e.evalArithmetic(expr)\\n\\t}\\n\\treturn types.Datum{}, nil\\n}\",\n \"func (stmt *statement) Expr(expr string, args ...interface{}) Statement {\\n\\tstmt.addPart(stmt.position, \\\"\\\", expr, args, \\\", \\\")\\n\\treturn stmt\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6671298","0.63801324","0.56326646","0.5561662","0.5532963","0.5225251","0.52004224","0.51350623","0.51319087","0.50917375","0.5091232","0.5029617","0.49621376","0.49549094","0.49485353","0.49356198","0.49250898","0.49079174","0.49051112","0.48947218","0.48618853","0.4858834","0.48398924","0.4778492","0.4776515","0.4759164","0.47467348","0.4735773","0.4719524","0.468991","0.4674814","0.46641243","0.46497273","0.46175662","0.4587783","0.45859236","0.45718676","0.4568315","0.45669493","0.45556173","0.45405954","0.452176","0.4517431","0.44866553","0.4480683","0.44783726","0.44765836","0.4461731","0.44474116","0.44149026","0.4413862","0.44126165","0.4411959","0.4403739","0.44026887","0.43942407","0.4390769","0.43746817","0.4364804","0.4364029","0.43619692","0.43487504","0.43478337","0.43402597","0.43231457","0.43164006","0.43159354","0.43152994","0.43118662","0.43034378","0.42993513","0.4292562","0.42923412","0.42754066","0.42711404","0.4270651","0.42704317","0.42688268","0.42624223","0.42605457","0.42593694","0.42555988","0.42517918","0.4249458","0.42420498","0.42267233","0.4218301","0.42180932","0.421359","0.4211993","0.42096645","0.41980436","0.4179795","0.41744035","0.4167154","0.4167106","0.4165974","0.41619903","0.41591814","0.41578212"],"string":"[\n \"0.6671298\",\n \"0.63801324\",\n \"0.56326646\",\n \"0.5561662\",\n \"0.5532963\",\n \"0.5225251\",\n \"0.52004224\",\n \"0.51350623\",\n \"0.51319087\",\n \"0.50917375\",\n \"0.5091232\",\n \"0.5029617\",\n \"0.49621376\",\n \"0.49549094\",\n \"0.49485353\",\n \"0.49356198\",\n \"0.49250898\",\n \"0.49079174\",\n \"0.49051112\",\n \"0.48947218\",\n \"0.48618853\",\n \"0.4858834\",\n \"0.48398924\",\n \"0.4778492\",\n \"0.4776515\",\n \"0.4759164\",\n \"0.47467348\",\n \"0.4735773\",\n \"0.4719524\",\n \"0.468991\",\n \"0.4674814\",\n \"0.46641243\",\n \"0.46497273\",\n \"0.46175662\",\n \"0.4587783\",\n \"0.45859236\",\n \"0.45718676\",\n \"0.4568315\",\n \"0.45669493\",\n \"0.45556173\",\n \"0.45405954\",\n \"0.452176\",\n \"0.4517431\",\n \"0.44866553\",\n \"0.4480683\",\n \"0.44783726\",\n \"0.44765836\",\n \"0.4461731\",\n \"0.44474116\",\n \"0.44149026\",\n \"0.4413862\",\n \"0.44126165\",\n \"0.4411959\",\n \"0.4403739\",\n \"0.44026887\",\n \"0.43942407\",\n \"0.4390769\",\n \"0.43746817\",\n \"0.4364804\",\n \"0.4364029\",\n \"0.43619692\",\n \"0.43487504\",\n \"0.43478337\",\n \"0.43402597\",\n \"0.43231457\",\n \"0.43164006\",\n \"0.43159354\",\n \"0.43152994\",\n \"0.43118662\",\n \"0.43034378\",\n \"0.42993513\",\n \"0.4292562\",\n \"0.42923412\",\n \"0.42754066\",\n \"0.42711404\",\n \"0.4270651\",\n \"0.42704317\",\n \"0.42688268\",\n \"0.42624223\",\n \"0.42605457\",\n \"0.42593694\",\n \"0.42555988\",\n \"0.42517918\",\n \"0.4249458\",\n \"0.42420498\",\n \"0.42267233\",\n \"0.4218301\",\n \"0.42180932\",\n \"0.421359\",\n \"0.4211993\",\n \"0.42096645\",\n \"0.41980436\",\n \"0.4179795\",\n \"0.41744035\",\n \"0.4167154\",\n \"0.4167106\",\n \"0.4165974\",\n \"0.41619903\",\n \"0.41591814\",\n \"0.41578212\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.79593897"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":2796,"cells":{"query":{"kind":"string","value":"planCall generates a processor for a function call."},"document":{"kind":"string","value":"func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {\n\t// Ensure there is a single argument.\n\tif len(c.Args) != 1 {\n\t\treturn nil, fmt.Errorf(\"expected one argument for %s()\", c.Name)\n\t}\n\n\t// Ensure the argument is a variable reference.\n\tref, ok := c.Args[0].(*VarRef)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"expected field argument in %s()\", c.Name)\n\t}\n\n\t// Extract the substatement for the call.\n\tsub, err := e.stmt.Substatement(ref)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tname := sub.Source.(*Measurement).Name\n\n\t// Extract tags from conditional.\n\ttags := make(map[string]string)\n\tcondition, err := p.extractTags(name, sub.Condition, tags)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tsub.Condition = condition\n\n\t// Find field.\n\tfname := strings.TrimPrefix(ref.Val, name+\".\")\n\tfieldID, typ := e.db.Field(name, fname)\n\tif fieldID == 0 {\n\t\treturn nil, fmt.Errorf(\"field not found: %s.%s\", name, fname)\n\t}\n\n\t// Generate a reducer for the given function.\n\tr := newReducer(e)\n\tr.stmt = sub\n\n\t// Retrieve a list of series data ids.\n\tseriesIDs := p.DB.MatchSeries(name, tags)\n\n\t// Generate mappers for each id.\n\tr.mappers = make([]*mapper, len(seriesIDs))\n\tfor i, seriesID := range seriesIDs {\n\t\tm := newMapper(e, seriesID, fieldID, typ)\n\t\tm.min, m.max = e.min.UnixNano(), e.max.UnixNano()\n\t\tm.interval = int64(e.interval)\n\t\tm.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)\n\t\tr.mappers[i] = m\n\t}\n\n\t// Set the appropriate reducer function.\n\tswitch strings.ToLower(c.Name) {\n\tcase \"count\":\n\t\tr.fn = reduceSum\n\t\tfor _, m := range r.mappers {\n\t\t\tm.fn = mapCount\n\t\t}\n\tcase \"sum\":\n\t\tr.fn = reduceSum\n\t\tfor _, m := range r.mappers {\n\t\t\tm.fn = mapSum\n\t\t}\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"function not found: %q\", c.Name)\n\t}\n\n\treturn r, nil\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (t *TimeLine) Plan(nbars, num, denom uint32, callback func(delta int32)) {\n\t/*\n\t 1. calc the abs position for the callback by using forward\n\t 2. rewind cursor\n\t 3. register callback\n\t 4. sort planned callbacks\n\t*/\n\n\tsavedCursor := t.cursor\n\tt.forwardIgnoringCallbacks(nbars, num, denom)\n\tpos := t.cursor\n\tt.cursor = savedCursor\n\t//\tfmt.Printf(\"cursor: %v, pos: %v\\n\", t.cursor, pos)\n\tt.plannedCallbacks = append(t.plannedCallbacks, plannedCallback{callback: callback, position: pos})\n\tsort.Sort(t.plannedCallbacks)\n}","func (runner *suiteRunner) forkCall(method *reflect.FuncValue, kind funcKind,\n dispatcher func(c *C)) *C {\n c := newC(method, kind, runner.tempDir)\n runner.tracker.waitForCall(c)\n go (func() {\n defer runner.callDone(c)\n dispatcher(c)\n })()\n return c\n}","func (a *answer) queueCall(result *answer, transform []capnp.PipelineOp, call *capnp.Call) error {\n\ta.mu.Lock()\n\tdefer a.mu.Unlock()\n\tif a.done {\n\t\tpanic(\"answer.queueCall called on resolved answer\")\n\t}\n\tif len(a.queue) == cap(a.queue) {\n\t\treturn errQueueFull\n\t}\n\tcc, err := call.Copy(nil)\n\tif err != nil {\n\t\treturn err\n\t}\n\ta.queue = append(a.queue, pcall{\n\t\ttransform: transform,\n\t\tqcall: qcall{\n\t\t\ta: result,\n\t\t\tcall: cc,\n\t\t},\n\t})\n\treturn nil\n}","func transformCall(n *ir.CallExpr) {\n\t// Set base.Pos, since transformArgs below may need it, but transformCall\n\t// is called in some passes that don't set base.Pos.\n\tir.SetPos(n)\n\t// n.Type() can be nil for calls with no return value\n\tassert(n.Typecheck() == 1)\n\ttransformArgs(n)\n\tl := n.X\n\tt := l.Type()\n\n\tswitch l.Op() {\n\tcase ir.ODOTINTER:\n\t\tn.SetOp(ir.OCALLINTER)\n\n\tcase ir.ODOTMETH:\n\t\tl := l.(*ir.SelectorExpr)\n\t\tn.SetOp(ir.OCALLMETH)\n\n\t\ttp := t.Recv().Type\n\n\t\tif l.X == nil || !types.Identical(l.X.Type(), tp) {\n\t\t\tbase.Fatalf(\"method receiver\")\n\t\t}\n\n\tdefault:\n\t\tn.SetOp(ir.OCALLFUNC)\n\t}\n\n\ttypecheckaste(ir.OCALL, n.X, n.IsDDD, t.Params(), n.Args)\n\tif l.Op() == ir.ODOTMETH && len(deref(n.X.Type().Recv().Type).RParams()) == 0 {\n\t\ttypecheck.FixMethodCall(n)\n\t}\n\tif t.NumResults() == 1 {\n\t\tif n.Op() == ir.OCALLFUNC && n.X.Op() == ir.ONAME {\n\t\t\tif sym := n.X.(*ir.Name).Sym(); types.IsRuntimePkg(sym.Pkg) && sym.Name == \"getg\" {\n\t\t\t\t// Emit code for runtime.getg() directly instead of calling function.\n\t\t\t\t// Most such rewrites (for example the similar one for math.Sqrt) should be done in walk,\n\t\t\t\t// so that the ordering pass can make sure to preserve the semantics of the original code\n\t\t\t\t// (in particular, the exact time of the function call) by introducing temporaries.\n\t\t\t\t// In this case, we know getg() always returns the same result within a given function\n\t\t\t\t// and we want to avoid the temporaries, so we do the rewrite earlier than is typical.\n\t\t\t\tn.SetOp(ir.OGETG)\n\t\t\t}\n\t\t}\n\t\treturn\n\t}\n}","func (fi *funcInfo) emitCall(line, a, nArgs, nRet int) {\r\n\tfi.emitABC(line, OP_CALL, a, nArgs+1, nRet+1)\r\n}","func generateCall(generator *Generator, node parser.Node) string {\n\tvar identifier string\n\n\t// Check if it is a built-in function or not\n\tif strings.Contains(node.Value, \"|\") {\n\t\t// Get the function identifier by spliting the value by the pipe\n\t\tidentifier = strings.Split(node.Value, \"|\")[1]\n\n\t\tcheckCall(generator, node)\n\n\t\t// Add import to the generator\n\t\taddCallImport(\n\t\t\tgenerator,\n\t\t\tnode.Value,\n\t\t)\n\t} else {\n\t\tidentifier = node.Value\n\t}\n\n\t// Translate the params\n\tparams := generateParams(generator, node.Params)\n\n\t// Link all the translations together\n\treturn fmt.Sprintf(\n\t\tcCall,\n\t\tidentifier,\n\t\tstrings.Join(params, \",\"),\n\t)\n}","func CALL(r operand.Op) { ctx.CALL(r) }","func (_e *MockCompactionPlanContext_Expecter) execCompactionPlan(signal interface{}, plan interface{}) *MockCompactionPlanContext_execCompactionPlan_Call {\n\treturn &MockCompactionPlanContext_execCompactionPlan_Call{Call: _e.mock.On(\"execCompactionPlan\", signal, plan)}\n}","func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\n\tswitch expr := expr.(type) {\n\tcase *VarRef:\n\t\tpanic(\"TODO\")\n\tcase *Call:\n\t\treturn p.planCall(e, expr)\n\tcase *BinaryExpr:\n\t\treturn p.planBinaryExpr(e, expr)\n\tcase *ParenExpr:\n\t\treturn p.planExpr(e, expr.Expr)\n\tcase *NumberLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *StringLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *BooleanLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *TimeLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *DurationLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\t}\n\tpanic(\"unreachable\")\n}","func (pc *programCode) createCall(name string) {\n\tcode := \"\"\n\tcode += \"\\n\\tcall \" + name + \"\\t; call label \" + name + \"\\n\"\n\tpc.appendCode(code)\n}","func (p *Process) Call(procFnc func(p *Process)) {\n\tprocFnc(p)\n}","func walkCall(n *ir.CallExpr, init *ir.Nodes) ir.Node {\n\tif n.Op() == ir.OCALLMETH {\n\t\tbase.FatalfAt(n.Pos(), \"OCALLMETH missed by typecheck\")\n\t}\n\tif n.Op() == ir.OCALLINTER || n.X.Op() == ir.OMETHEXPR {\n\t\t// We expect both interface call reflect.Type.Method and concrete\n\t\t// call reflect.(*rtype).Method.\n\t\tusemethod(n)\n\t}\n\tif n.Op() == ir.OCALLINTER {\n\t\treflectdata.MarkUsedIfaceMethod(n)\n\t}\n\n\tif n.Op() == ir.OCALLFUNC && n.X.Op() == ir.OCLOSURE {\n\t\tdirectClosureCall(n)\n\t}\n\n\tif isFuncPCIntrinsic(n) {\n\t\t// For internal/abi.FuncPCABIxxx(fn), if fn is a defined function, rewrite\n\t\t// it to the address of the function of the ABI fn is defined.\n\t\tname := n.X.(*ir.Name).Sym().Name\n\t\targ := n.Args[0]\n\t\tvar wantABI obj.ABI\n\t\tswitch name {\n\t\tcase \"FuncPCABI0\":\n\t\t\twantABI = obj.ABI0\n\t\tcase \"FuncPCABIInternal\":\n\t\t\twantABI = obj.ABIInternal\n\t\t}\n\t\tif isIfaceOfFunc(arg) {\n\t\t\tfn := arg.(*ir.ConvExpr).X.(*ir.Name)\n\t\t\tabi := fn.Func.ABI\n\t\t\tif abi != wantABI {\n\t\t\t\tbase.ErrorfAt(n.Pos(), \"internal/abi.%s expects an %v function, %s is defined as %v\", name, wantABI, fn.Sym().Name, abi)\n\t\t\t}\n\t\t\tvar e ir.Node = ir.NewLinksymExpr(n.Pos(), fn.Sym().LinksymABI(abi), types.Types[types.TUINTPTR])\n\t\t\te = ir.NewAddrExpr(n.Pos(), e)\n\t\t\te.SetType(types.Types[types.TUINTPTR].PtrTo())\n\t\t\te = ir.NewConvExpr(n.Pos(), ir.OCONVNOP, n.Type(), e)\n\t\t\treturn e\n\t\t}\n\t\t// fn is not a defined function. It must be ABIInternal.\n\t\t// Read the address from func value, i.e. *(*uintptr)(idata(fn)).\n\t\tif wantABI != obj.ABIInternal {\n\t\t\tbase.ErrorfAt(n.Pos(), \"internal/abi.%s does not accept func expression, which is ABIInternal\", name)\n\t\t}\n\t\targ = walkExpr(arg, init)\n\t\tvar e ir.Node = ir.NewUnaryExpr(n.Pos(), ir.OIDATA, arg)\n\t\te.SetType(n.Type().PtrTo())\n\t\te = ir.NewStarExpr(n.Pos(), e)\n\t\te.SetType(n.Type())\n\t\treturn e\n\t}\n\n\twalkCall1(n, init)\n\treturn n\n}","func call(i Instruction, ls *LuaState) {\n\ta, b, c := i.ABC()\n\ta += 1\n\n\t// println(\":::\"+ ls.StackToString())\n\tnArgs := _pushFuncAndArgs(a, b, ls)\n\tls.Call(nArgs, c-1)\n\t_popResults(a, c, ls)\n}","func (r *HistoryRunner) Plan(ctx context.Context) error {\n\tif len(r.filename) != 0 {\n\t\t// file mode\n\t\treturn r.planFile(ctx, r.filename)\n\t}\n\n\t// directory mode\n\treturn r.planDir(ctx)\n}","func (vm *VM) opCall(instr []uint16, nextI int) int {\n\ta := vm.get(instr[0])\n\tvm.stack = append(vm.stack, uint16(nextI)+2)\n\t//fmt.Printf(\"stack after call: %v\\n\", vm.stack)\n\n\treturn int(a)\n}","func EvalCall(a, b Attrib) (*AddrCode, error) {\n\tentry_ := a.(*AddrCode).Symbol\n\tentry, ok := entry_.(*codegen.TargetEntry)\n\tvar varEntry *codegen.VariableEntry\n\tif !ok {\n\t\tif variable, ok1 := entry_.(*codegen.VariableEntry); ok1 {\n\t\t\tif t, ok2 := variable.Type().(codegen.FuncType); ok2 {\n\t\t\t\tentry = t.Target\n\t\t\t\tvarEntry = variable\n\t\t\t} else {\n\t\t\t\treturn nil, fmt.Errorf(\"invalid function call statement\")\n\t\t\t}\n\t\t} else {\n\t\t\treturn nil, fmt.Errorf(\"invalid function call statement\")\n\t\t}\n\t}\n\texprList, ok := b.([]*AddrCode)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"unable to type cast %v to []*AddrCode\", b)\n\t}\n\n\tvar isSystem bool\n\n\tif entry.Target == \"printf\" || entry.Target == \"scanf\" {\n\t\tisSystem = true\n\t}\n\n\tif !isSystem && len(exprList) != len(entry.InType) {\n\t\treturn nil, fmt.Errorf(\"wrong number of arguments in function call. expected %d, got %d\", len(entry.InType), len(exprList))\n\t}\n\tcode := a.(*AddrCode).Code\n\tfor i := len(exprList) - 1; i >= 0; i-- {\n\t\tif !isSystem && !SameType(exprList[i].Symbol.Type(), entry.InType[i]) {\n\t\t\treturn nil, fmt.Errorf(\"wrong type of argument %d in function call. expected %v, got %v\", i, entry.InType[i], exprList[i].Symbol.Type())\n\t\t}\n\t\tif isSystem && i == 0 {\n\t\t\tif !SameType(exprList[i].Symbol.Type(), stringType) {\n\t\t\t\treturn nil, fmt.Errorf(\"wrong type of 1st argument in function call. expected %v, got %v\", stringType, exprList[i].Symbol.Type())\n\t\t\t}\n\t\t}\n\t\tevaluatedExpr := EvalWrapped(exprList[i])\n\t\tcode = append(code, evaluatedExpr.Code...)\n\t\tcode = append(code, codegen.IRIns{\n\t\t\tTyp: codegen.KEY,\n\t\t\tOp: codegen.PARAM,\n\t\t\tArg1: evaluatedExpr.Symbol,\n\t\t})\n\t}\n\tif varEntry == nil {\n\t\tcode = append(code, codegen.IRIns{\n\t\t\tTyp: codegen.KEY,\n\t\t\tOp: codegen.CALL,\n\t\t\tArg1: entry,\n\t\t})\n\t} else {\n\t\tcode = append(code, codegen.IRIns{\n\t\t\tTyp: codegen.KEY,\n\t\t\tOp: codegen.CALL,\n\t\t\tArg1: varEntry,\n\t\t})\n\t}\n\t// code = append(code, codegen.IRIns{\n\t// \tTyp: codegen.KEY,\n\t// \tOp: codegen.UNALLOC,\n\t// \tArg1: &codegen.LiteralEntry{\n\t// \t\tValue: len(exprList) * 4,\n\t// \t\tLType: intType,\n\t// \t},\n\t// })\n\tentry1 := CreateTemporary(entry.RetType)\n\tcode = append(code, entry1.Code...)\n\tcode = append(code, codegen.IRIns{\n\t\tTyp: codegen.KEY,\n\t\tOp: codegen.SETRET,\n\t\tArg1: entry1.Symbol,\n\t})\n\treturn &AddrCode{\n\t\tCode: code,\n\t\tSymbol: entry1.Symbol,\n\t}, nil\n}","func (node *CallProc) formatFast(buf *TrackedBuffer) {\n\tbuf.WriteString(\"call \")\n\tnode.Name.formatFast(buf)\n\tbuf.WriteByte('(')\n\tnode.Params.formatFast(buf)\n\tbuf.WriteByte(')')\n}","func ResolveCall(ctx *broker.Context, node *specs.Node, call *specs.Call, flow specs.FlowInterface) (err error) {\n\tif call.Request != nil {\n\t\terr = ResolveParameterMap(ctx, node, call.Request, flow)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\tif call.Response != nil {\n\t\terr = ResolveParameterMap(ctx, node, call.Response, flow)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}","func (c *Context) CALL(r operand.Op) {\n\tc.addinstruction(x86.CALL(r))\n}","func call(context *Context) {\n context.cpu.sp++\n context.stack[context.cpu.sp] = context.cpu.pc\n context.cpu.pc = context.opcode & 0x0FFF\n}","func (dsp *distSQLPlanner) PlanAndRun(\n\tctx context.Context, txn *client.Txn, tree planNode, recv *distSQLReceiver,\n) error {\n\t// Trigger limit propagation.\n\ttree.SetLimitHint(math.MaxInt64, true)\n\n\tplanCtx := planningCtx{\n\t\tctx: ctx,\n\t\tspanIter: dsp.spanResolver.NewSpanResolverIterator(),\n\t\tnodeAddresses: make(map[roachpb.NodeID]string),\n\t}\n\tthisNodeID := dsp.nodeDesc.NodeID\n\tplanCtx.nodeAddresses[thisNodeID] = dsp.nodeDesc.Address.String()\n\n\tplan, err := dsp.createPlanForNode(&planCtx, tree)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// If we don't already have a single result router on this node, add a final\n\t// stage.\n\tif len(plan.resultRouters) != 1 ||\n\t\tplan.processors[plan.resultRouters[0]].node != thisNodeID {\n\t\tdsp.addSingleGroupStage(\n\t\t\t&plan, thisNodeID, distsql.ProcessorCoreUnion{Noop: &distsql.NoopCoreSpec{}},\n\t\t)\n\t\tif len(plan.resultRouters) != 1 {\n\t\t\tpanic(fmt.Sprintf(\"%d results after single group stage\", len(plan.resultRouters)))\n\t\t}\n\t}\n\n\t// Set up the endpoints for p.streams.\n\tdsp.populateEndpoints(&planCtx, &plan)\n\n\t// Set up the endpoint for the final result.\n\tfinalOut := &plan.processors[plan.resultRouters[0]].spec.Output[0]\n\tfinalOut.Streams = append(finalOut.Streams, distsql.StreamEndpointSpec{\n\t\tType: distsql.StreamEndpointSpec_SYNC_RESPONSE,\n\t})\n\n\trecv.resultToStreamColMap = plan.planToStreamColMap\n\n\t// Split the processors by nodeID to create the FlowSpecs.\n\tflowID := distsql.FlowID{UUID: uuid.MakeV4()}\n\tnodeIDMap := make(map[roachpb.NodeID]int)\n\t// nodeAddresses contains addresses for the nodes that were referenced during\n\t// planning, so we're likely going to have this many nodes (and we have one\n\t// flow per node).\n\tnodeIDs := make([]roachpb.NodeID, 0, len(planCtx.nodeAddresses))\n\tflows := make([]distsql.FlowSpec, 0, len(planCtx.nodeAddresses))\n\n\tfor _, p := range plan.processors {\n\t\tidx, ok := nodeIDMap[p.node]\n\t\tif !ok {\n\t\t\tflow := distsql.FlowSpec{FlowID: flowID}\n\t\t\tidx = len(flows)\n\t\t\tflows = append(flows, flow)\n\t\t\tnodeIDs = append(nodeIDs, p.node)\n\t\t\tnodeIDMap[p.node] = idx\n\t\t}\n\t\tflows[idx].Processors = append(flows[idx].Processors, p.spec)\n\t}\n\n\tif logPlanDiagram {\n\t\tnodeNames := make([]string, len(nodeIDs))\n\t\tfor i, n := range nodeIDs {\n\t\t\tnodeNames[i] = n.String()\n\t\t}\n\n\t\tvar buf bytes.Buffer\n\t\tif err := distsql.GeneratePlanDiagram(flows, nodeNames, &buf); err != nil {\n\t\t\tlog.Infof(ctx, \"Error generating diagram: %s\", err)\n\t\t} else {\n\t\t\tlog.Infof(ctx, \"Plan diagram JSON:\\n%s\", buf.String())\n\t\t}\n\t}\n\n\t// Start the flows on all other nodes.\n\tfor i, nodeID := range nodeIDs {\n\t\tif nodeID == thisNodeID {\n\t\t\t// Skip this node.\n\t\t\tcontinue\n\t\t}\n\t\treq := distsql.SetupFlowRequest{\n\t\t\tTxn: txn.Proto,\n\t\t\tFlow: flows[i],\n\t\t}\n\t\tif err := distsql.SetFlowRequestTrace(ctx, &req); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tconn, err := dsp.rpcContext.GRPCDial(planCtx.nodeAddresses[nodeID])\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tclient := distsql.NewDistSQLClient(conn)\n\t\t// TODO(radu): we are not waiting for the flows to complete, but we are\n\t\t// still waiting for a round trip; we should start the flows in parallel, at\n\t\t// least if there are enough of them.\n\t\tif resp, err := client.SetupFlow(context.Background(), &req); err != nil {\n\t\t\treturn err\n\t\t} else if resp.Error != nil {\n\t\t\treturn resp.Error.GoError()\n\t\t}\n\t}\n\tlocalReq := distsql.SetupFlowRequest{\n\t\tTxn: txn.Proto,\n\t\tFlow: flows[nodeIDMap[thisNodeID]],\n\t}\n\tif err := distsql.SetFlowRequestTrace(ctx, &localReq); err != nil {\n\t\treturn err\n\t}\n\tflow, err := dsp.distSQLSrv.SetupSyncFlow(ctx, &localReq, recv)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// TODO(radu): this should go through the flow scheduler.\n\tflow.Start(func() {})\n\tflow.Wait()\n\tflow.Cleanup()\n\n\treturn nil\n}","func (r *HistoryRunner) planFile(ctx context.Context, filename string) error {\n\tif r.hc.AlreadyApplied(filename) {\n\t\treturn fmt.Errorf(\"a migration has already been applied: %s\", filename)\n\t}\n\n\tfr, err := NewFileRunner(filename, r.config, r.option)\n\tif err != nil {\n\t\tlog.Printf(\"[ERROR] [runner] failed to plan: %s\\n\", filename)\n\t\treturn err\n\t}\n\n\treturn fr.Plan(ctx)\n}","func (e *executor) call(fn func() error, format string, args ...interface{}) error {\n\treturn e.function(e.opts, fn, format, args...)\n}","func (p *Planner) planField(e *Executor, f *Field) (processor, error) {\n\treturn p.planExpr(e, f.Expr)\n}","func TraceCall_(trace interface{}) {}","func makeCall(method string, params ...interface{}) methodCall {\n\tvar r methodCall\n\tr.Method = method\n\tr.Params = makeParams(params...)\n\treturn r\n}","func (g *irgen) callExpr(pos src.XPos, typ *types.Type, fun ir.Node, args []ir.Node, dots bool) ir.Node {\n\tn := ir.NewCallExpr(pos, ir.OCALL, fun, args)\n\tn.IsDDD = dots\n\ttyped(typ, n)\n\n\tif fun.Op() == ir.OTYPE {\n\t\t// Actually a type conversion, not a function call.\n\t\tif !g.delayTransform() {\n\t\t\treturn transformConvCall(n)\n\t\t}\n\t\treturn n\n\t}\n\n\tif fun, ok := fun.(*ir.Name); ok && fun.BuiltinOp != 0 {\n\t\tif !g.delayTransform() {\n\t\t\treturn transformBuiltin(n)\n\t\t}\n\t\treturn n\n\t}\n\n\t// Add information, now that we know that fun is actually being called.\n\tswitch fun := fun.(type) {\n\tcase *ir.SelectorExpr:\n\t\tif fun.Op() == ir.OMETHVALUE {\n\t\t\top := ir.ODOTMETH\n\t\t\tif fun.X.Type().IsInterface() {\n\t\t\t\top = ir.ODOTINTER\n\t\t\t}\n\t\t\tfun.SetOp(op)\n\t\t\t// Set the type to include the receiver, since that's what\n\t\t\t// later parts of the compiler expect\n\t\t\tfun.SetType(fun.Selection.Type)\n\t\t}\n\t}\n\n\t// A function instantiation (even if fully concrete) shouldn't be\n\t// transformed yet, because we need to add the dictionary during the\n\t// transformation.\n\tif fun.Op() != ir.OFUNCINST && !g.delayTransform() {\n\t\ttransformCall(n)\n\t}\n\treturn n\n}","func (t *Translator) translateCallStatement(stmt *vm_ast.CallStatement) []string {\n\tkeyString := generateUuidForIdent()\n\treturnAddressLabel := \"return_to_\" + keyString\n\n\t// push return address\n\tresult := []string{\n\t\t\"@\" + returnAddressLabel,\n\t\t\"D=A;\",\n\t}\n\tresult = append(result, t.pushDregStatements()...)\n\n\t// push current LCL\n\tresult = append(result, []string{\n\t\t\"@LCL\",\n\t\t\"D=M;\",\n\t}...)\n\tresult = append(result, t.pushDregStatements()...)\n\n\t// push current ARG\n\tresult = append(result, []string{\n\t\t\"@ARG\",\n\t\t\"D=M;\",\n\t}...)\n\tresult = append(result, t.pushDregStatements()...)\n\n\t// push current THIS\n\tresult = append(result, []string{\n\t\t\"@THIS\",\n\t\t\"D=M;\",\n\t}...)\n\tresult = append(result, t.pushDregStatements()...)\n\n\t// push current THAT\n\tresult = append(result, []string{\n\t\t\"@THAT\",\n\t\t\"D=M;\",\n\t}...)\n\tresult = append(result, t.pushDregStatements()...)\n\n\t// ARG = SP - stmt.LocalNum.Literal - 5\n\tresult = append(result, []string{\n\t\t// save current M[SP] in M[R5]\n\t\t\"@SP\",\n\t\t\"D=M;\",\n\t\t\"@R5\",\n\t\t\"M=D;\",\n\t}...)\n\tcalcM := []string{}\n\tswitch stmt.ArgNum.Type {\n\tcase vm_tokenizer.IDENT:\n\t\tcalcM = []string{\n\t\t\t\"@\" + stmt.ArgNum.Literal,\n\t\t\t\"D=M;\",\n\t\t\t\"@R5\",\n\t\t\t\"M=M-D;\",\n\t\t}\n\tcase vm_tokenizer.INT:\n\t\tcalcM = []string{\n\t\t\t\"@\" + stmt.ArgNum.Literal,\n\t\t\t\"D=A;\",\n\t\t\t\"@R5\",\n\t\t\t\"M=M-D;\",\n\t\t}\n\tdefault:\n\t\tlog.Fatalf(\"unexpected token type\")\n\t}\n\tresult = append(result, calcM...)\n\tresult = append(result, []string{\n\t\t\"@5\",\n\t\t\"D=A;\",\n\t\t\"@R5\",\n\t\t\"M=M-D;\",\n\t\t\"D=M;\",\n\t\t\"@ARG\",\n\t\t\"M=D;\",\n\t}...)\n\n\t// LCL = SP\n\tresult = append(result, []string{\n\t\t\"@SP\",\n\t\t\"D=M;\",\n\t\t\"@LCL\",\n\t\t\"M=D;\",\n\t}...)\n\n\tresult = append(result, []string{\n\t\t\"@\" + getFunctionLabel(stmt.Name.Literal),\n\t\t\"0;JMP\",\n\t\t\"(return_to_\" + keyString + \")\",\n\t}...)\n\n\treturn result\n}","func (m *JobExecutor) WalkPlan(p plan.Task) (Task, error) {\n\tswitch p := p.(type) {\n\tcase *plan.PreparedStatement:\n\t\treturn m.Executor.WalkPreparedStatement(p)\n\tcase *plan.Select:\n\t\tif p.Ctx != nil && p.IsSchemaQuery() {\n\t\t\tif p.Ctx.Schema != nil && p.Ctx.Schema.InfoSchema != nil {\n\t\t\t\tp.Ctx.Schema = p.Ctx.Schema.InfoSchema\n\t\t\t}\n\t\t\tp.Stmt.SetSystemQry()\n\t\t}\n\t\treturn m.Executor.WalkSelect(p)\n\tcase *plan.Upsert:\n\t\treturn m.Executor.WalkUpsert(p)\n\tcase *plan.Insert:\n\t\treturn m.Executor.WalkInsert(p)\n\tcase *plan.Update:\n\t\treturn m.Executor.WalkUpdate(p)\n\tcase *plan.Delete:\n\t\treturn m.Executor.WalkDelete(p)\n\tcase *plan.Command:\n\t\treturn m.Executor.WalkCommand(p)\n\n\t// DDL\n\tcase *plan.Create:\n\t\treturn m.Executor.WalkCreate(p)\n\tcase *plan.Drop:\n\t\treturn m.Executor.WalkDrop(p)\n\tcase *plan.Alter:\n\t\treturn m.Executor.WalkAlter(p)\n\t}\n\tpanic(fmt.Sprintf(\"Not implemented for %T\", p))\n}","func rcCallFunc(p *TCompiler, code *TCode) (*value.Value, error) {\n\tres, err := p.runCallFunc(code)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tp.regSet(code.A, res)\n\t// println(\"call=\", res.ToString())\n\tp.moveNext()\n\treturn res, nil\n}","func TraceCall(log logr.Logger) {\n\tcallerInfo := GetCaller(MyCaller, true)\n\tlog.V(TraceLevel).Info(\"Entering function\", \"function\", callerInfo.FunctionName, \"source\", callerInfo.SourceFile, \"line\", callerInfo.SourceLine)\n}","func (p *callgrindProfiler) incrementCallRef(name string, loc *token.Location) *callRef {\n\tp.Lock()\n\tdefer p.Unlock()\n\tthread := &([]int32{1}[0])\n\tframeRef := new(callRef)\n\tframeRef.name = name\n\tframeRef.children = make([]*callRef, 0)\n\tif loc != nil {\n\t\tframeRef.file = loc.File\n\t\tframeRef.line = loc.Line\n\t}\n\tif current, ok := p.callRefs[*thread]; ok && current != nil {\n\t\tframeRef.prev = current\n\t\tframeRef.prev.children = append(frameRef.prev.children, frameRef)\n\t}\n\tms := &runtime.MemStats{}\n\truntime.ReadMemStats(ms)\n\tframeRef.startMemory = ms.TotalAlloc\n\tframeRef.start = time.Now()\n\tp.callRefs[*thread] = frameRef\n\treturn frameRef\n}","func (s *BasePlSqlParserListener) EnterCall_spec(ctx *Call_specContext) {}","func (cm GoPlanner) Plan(queryRequest *plannerpb.QueryRequest) (*distributedpb.LogicalPlannerResult, error) {\n\tvar resultLen C.int\n\tqueryRequestBytes, err := proto.Marshal(queryRequest)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tqueryRequestData := C.CBytes(queryRequestBytes)\n\tdefer C.free(queryRequestData)\n\n\tres := C.PlannerPlan(cm.planner, (*C.char)(queryRequestData), C.int(len(queryRequestBytes)), &resultLen)\n\tdefer C.StrFree(res)\n\tlp := C.GoBytes(unsafe.Pointer(res), resultLen)\n\tif resultLen == 0 {\n\t\treturn nil, errors.New(\"no result returned\")\n\t}\n\n\tplan := &distributedpb.LogicalPlannerResult{}\n\tif err := proto.Unmarshal(lp, plan); err != nil {\n\t\treturn plan, fmt.Errorf(\"error: '%s'; string: '%s'\", err, string(lp))\n\t}\n\treturn plan, nil\n}","func newCall(name string) *Instruction {\n\treturn &Instruction{\n\t\tType: CallInst,\n\t\tName: name,\n\t}\n}","func (vm *VM) NewCall(sender, actor Interface, msg *Message, target, context Interface) *Call {\n\treturn &Call{\n\t\tObject: *vm.CoreInstance(\"Call\"),\n\t\tSender: sender,\n\t\tActivated: actor,\n\t\tMsg: msg,\n\t\tTarget: target,\n\t\tContext: context,\n\t\tCoroutine: vm,\n\t}\n}","func BenchmarkCaller(b *testing.B) {\n\tbenchmarks := []struct {\n\t\tname string\n\t\tcaller func() CallerInfo\n\t}{\n\t\t{\"direct caller\", callerA},\n\t\t{\"chain caller\", callerB},\n\t\t{\"lambda caller\", callerC},\n\t}\n\tfor _, bm := range benchmarks {\n\t\ttc := bm\n\t\tb.Run(bm.name, func(b *testing.B) {\n\t\t\tb.ReportAllocs()\n\t\t\tfor i := 0; i < b.N; i++ {\n\t\t\t\t_ = tc.caller()\n\t\t\t}\n\t\t})\n\t}\n}","func (e FunctionCallExpression) Visit(env Environment) Value {\n\treturn NoneValue()\n}","func call(ctx context.Context, req *pulumirpc.CallRequest, engineConn *grpc.ClientConn,\n\tcallF callFunc) (*pulumirpc.CallResponse, error) {\n\n\t// Configure the RunInfo.\n\trunInfo := RunInfo{\n\t\tProject: req.GetProject(),\n\t\tStack: req.GetStack(),\n\t\tConfig: req.GetConfig(),\n\t\tParallel: int(req.GetParallel()),\n\t\tDryRun: req.GetDryRun(),\n\t\tMonitorAddr: req.GetMonitorEndpoint(),\n\t\tengineConn: engineConn,\n\t}\n\tpulumiCtx, err := NewContext(ctx, runInfo)\n\tif err != nil {\n\t\treturn nil, errors.Wrap(err, \"constructing run context\")\n\t}\n\n\t// Deserialize the inputs and apply appropriate dependencies.\n\targDependencies := req.GetArgDependencies()\n\tdeserializedArgs, err := plugin.UnmarshalProperties(\n\t\treq.GetArgs(),\n\t\tplugin.MarshalOptions{KeepSecrets: true, KeepResources: true, KeepUnknowns: req.GetDryRun()},\n\t)\n\tif err != nil {\n\t\treturn nil, errors.Wrap(err, \"unmarshaling inputs\")\n\t}\n\targs := make(map[string]interface{}, len(deserializedArgs))\n\tfor key, value := range deserializedArgs {\n\t\tk := string(key)\n\t\tvar deps []Resource\n\t\tif inputDeps, ok := argDependencies[k]; ok {\n\t\t\tdeps = make([]Resource, len(inputDeps.GetUrns()))\n\t\t\tfor i, depURN := range inputDeps.GetUrns() {\n\t\t\t\tdeps[i] = pulumiCtx.newDependencyResource(URN(depURN))\n\t\t\t}\n\t\t}\n\n\t\targs[k] = &constructInput{\n\t\t\tvalue: value,\n\t\t\tdeps: deps,\n\t\t}\n\t}\n\n\tresult, err := callF(pulumiCtx, req.GetTok(), args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Wait for async work to finish.\n\tif err = pulumiCtx.wait(); err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Serialize all result properties, first by awaiting them, and then marshaling them to the requisite gRPC values.\n\tresolvedProps, propertyDeps, _, err := marshalInputs(result)\n\tif err != nil {\n\t\treturn nil, errors.Wrap(err, \"marshaling properties\")\n\t}\n\n\t// Marshal all properties for the RPC call.\n\tkeepUnknowns := req.GetDryRun()\n\trpcProps, err := plugin.MarshalProperties(\n\t\tresolvedProps,\n\t\tplugin.MarshalOptions{KeepSecrets: true, KeepUnknowns: keepUnknowns, KeepResources: pulumiCtx.keepResources})\n\tif err != nil {\n\t\treturn nil, errors.Wrap(err, \"marshaling properties\")\n\t}\n\n\t// Convert the property dependencies map for RPC and remove duplicates.\n\trpcPropertyDeps := make(map[string]*pulumirpc.CallResponse_ReturnDependencies)\n\tfor k, deps := range propertyDeps {\n\t\tsort.Slice(deps, func(i, j int) bool { return deps[i] < deps[j] })\n\n\t\turns := make([]string, 0, len(deps))\n\t\tfor i, d := range deps {\n\t\t\tif i > 0 && urns[i-1] == string(d) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\turns = append(urns, string(d))\n\t\t}\n\n\t\trpcPropertyDeps[k] = &pulumirpc.CallResponse_ReturnDependencies{\n\t\t\tUrns: urns,\n\t\t}\n\t}\n\n\treturn &pulumirpc.CallResponse{\n\t\tReturn: rpcProps,\n\t\tReturnDependencies: rpcPropertyDeps,\n\t}, nil\n}","func (e *Payments) Call(ctx context.Context, req *payments.Request, rsp *payments.Response) error {\n\tlog.Log(\"Received Payments.Call request\")\n\trsp.Msg = \"Hello \" + req.Name\n\treturn nil\n}","func (client *Client) call(serviceMethod string, args interface{}, reply interface{}, done chan *Call, expiration uint64) *Call {\n\tcall := new(Call)\n\tcall.ServiceMethod = serviceMethod\n\tcall.Args = args\n\tcall.Reply = reply\n\tif done == nil {\n\t\tdone = make(chan *Call, 10) // buffered.\n\t} else {\n\t\tif cap(done) == 0 {\n\t\t\tlog.Panic(\"rpc: done channel is unbuffered\")\n\t\t}\n\t}\n\tcall.Done = done\n\tclient.send(call, expiration)\n\treturn call\n}","func (parser *Parser) callFunc(id string) (*FunctionCall, error) {\n\tparser.trace(\"CALL_FUNC\")\n\tdefer parser.untrace()\n\t_, err, found := parser.match(fxsymbols.LeftPar)\n\tif err != nil {\n\t\t// return ErrSyntax\n\t\treturn nil, err\n\t}\n\tif !found {\n\t\treturn nil, ErrNoMatch\n\t}\n\targs, err := parser.args()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif _, _, found = parser.match(fxsymbols.RightPar); !found {\n\t\treturn nil, parser.Errorf(ErrNoRightPar)\n\t}\n\tif _, _, found = parser.match(fxsymbols.Scol); !found {\n\t\treturn nil, parser.Errorf(ErrNoScol)\n\t}\n\treturn NewFuncCall(id, args), nil\n}","func (c *Collection) Plan(op controller.Operation,\n\tspec types.Spec) (object *types.Object, plan *controller.Plan, err error) {\n\n\terr = c.readTxn(func() error {\n\n\t\tlog.Debug(\"Plan\", \"op\", op, \"spec\", spec, \"V\", debugV)\n\n\t\tobject, err = c.object()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tif c.PlanFunc == nil {\n\t\t\treturn nil\n\t\t}\n\n\t\tif p, e := c.PlanFunc(op, spec); e == nil {\n\t\t\tplan = &p\n\t\t} else {\n\t\t\terr = e\n\t\t}\n\n\t\treturn err\n\t})\n\treturn\n}","func callFn(name string, unit reflect.Value, args []reflect.Value) error {\n\tif fn := unit.MethodByName(name); fn.IsValid() == false {\n\t\treturn nil\n\t} else if ret := fn.Call(args); len(ret) != 1 {\n\t\treturn nil\n\t} else if err, ok := ret[0].Interface().(error); ok {\n\t\treturn err\n\t} else if err == nil {\n\t\treturn nil\n\t} else {\n\t\treturn gopi.ErrBadParameter.WithPrefix(name)\n\t}\n}","func Call(f func()) {\n\tcheckRun()\n\tdone := make(chan struct{})\n\tcallQueue <- func() {\n\t\tf()\n\t\tdone <- struct{}{}\n\t}\n\t<-done\n}","func (p *parser) VisitMemberCall(ctx *gen.MemberCallContext) any {\n\toperand := p.Visit(ctx.Member()).(*exprpb.Expr)\n\t// Handle the error case where no valid identifier is specified.\n\tif ctx.GetId() == nil {\n\t\treturn p.helper.newExpr(ctx)\n\t}\n\tid := ctx.GetId().GetText()\n\topID := p.helper.id(ctx.GetOpen())\n\treturn p.receiverCallOrMacro(opID, id, operand, p.visitExprList(ctx.GetArgs())...)\n}","func newCallNode(args []Node) Node {\n\tif len(args) > 0 {\n\t\treturn CallNode{NodeType: NodeCall, Callee: args[0], Args: args[1:]}\n\t} else {\n\t\treturn nilNode\n\t}\n}","func TraceCall(trace interface{}) {\n\tTraceCaller = true\n\tdefer SetTraceCaller(false)\n\tTrace(trace)\n}","func (mr *MockIApiMockRecorder) CreatePlan(arg0 interface{}) *gomock.Call {\n\tmr.mock.ctrl.T.Helper()\n\treturn mr.mock.ctrl.RecordCallWithMethodType(mr.mock, \"CreatePlan\", reflect.TypeOf((*MockIApi)(nil).CreatePlan), arg0)\n}","func newCallNode(args []Node) Node {\n\tif len(args) > 0 {\n\t\treturn &CallNode{NodeType: NodeCall, Callee: args[0], Args: args[1:]}\n\t} else {\n\t\treturn nilNode\n\t}\n}","func call(method string, argsArray []string) {\n\tfmt.Println(\"------ start ------ \", method)\n\t// all args\n\tvar args [][]byte\n\targs = append(args, []byte(method))\n\tfmt.Printf(\"- args=[\")\n\tfmt.Printf(\"p0=%s\", method)\n\tif argsArray != nil {\n\t\tfor i := 0; i < len(argsArray); i++ {\n\t\t\targs = append(args, []byte(argsArray[i]))\n\t\t\tfmt.Printf(\",p%d=%s\", i+1, argsArray[i])\n\t\t}\n\t}\n\tfmt.Printf(\"]\")\n\tfmt.Println(\"\")\n\t// invoke\n\tresponse := stub.MockInvoke(\"uuid\", args)\n\tfmt.Printf(\"- status=\")\n\tfmt.Println(response.GetStatus())\n\tfmt.Printf(\"- error message=\")\n\tfmt.Println(response.GetMessage())\n\tfmt.Printf(\"- payload=\")\n\tfmt.Println(string(response.GetPayload()))\n\tfmt.Println(\"------ end ------ \")\n\tfmt.Println(\"\")\n}","func (k Querier) Plan(c context.Context, req *types.QueryPlanRequest) (*types.QueryPlanResponse, error) {\n\tif req == nil {\n\t\treturn nil, status.Error(codes.InvalidArgument, \"invalid request\")\n\t}\n\n\tctx := sdk.UnwrapSDKContext(c)\n\tplan, found := k.GetPlan(ctx, req.PlanId)\n\tif !found {\n\t\treturn nil, status.Errorf(codes.NotFound, \"plan %d not found\", req.PlanId)\n\t}\n\n\tany, err := codectypes.NewAnyWithValue(plan)\n\tif err != nil {\n\t\treturn nil, status.Error(codes.Internal, err.Error())\n\t}\n\n\treturn &types.QueryPlanResponse{Plan: any}, nil\n}","func (self *journeyPlanner) planTrip(from flap.ICAOCode, to flap.ICAOCode, length flap.Days, pp flap.Passport, startOfDay flap.EpochTime, fe *flap.Engine) error {\n\tlogDebug(\"planTrip for: \", pp.ToString(), \" starting \", startOfDay.ToTime())\n\tf,err := self.buildFlight(from,to,startOfDay,fe)\n\tif (err != nil) {\n\t\treturn err\n\t}\n\tj:= journey{jt:jtOutbound,flight:*f,length:length}\n\treturn self.addJourney(pp,j)\n}","func (r *SubscriptionsService) ChangePlan(customerId string, subscriptionId string, changeplanrequest *ChangePlanRequest) *SubscriptionsChangePlanCall {\n\treturn &SubscriptionsChangePlanCall{\n\t\ts: r.s,\n\t\tcustomerId: customerId,\n\t\tsubscriptionId: subscriptionId,\n\t\tchangeplanrequest: changeplanrequest,\n\t\tcaller_: googleapi.JSONCall{},\n\t\tparams_: make(map[string][]string),\n\t\tpathTemplate_: \"customers/{customerId}/subscriptions/{subscriptionId}/changePlan\",\n\t\tcontext_: googleapi.NoContext,\n\t}\n}","func (mock *ProcessorPipelineMock) TransformCalls() []struct {\n\tIn1 image.Image\n} {\n\tvar calls []struct {\n\t\tIn1 image.Image\n\t}\n\tlockProcessorPipelineMockTransform.RLock()\n\tcalls = mock.calls.Transform\n\tlockProcessorPipelineMockTransform.RUnlock()\n\treturn calls\n}","func (l *logicalPlanner) Plan(ctx context.Context, logicalPlan *Spec) (*Spec, error) {\n\tnewLogicalPlan, err := l.heuristicPlanner.Plan(ctx, logicalPlan)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// check integrity after planning is complete\n\tif !l.disableIntegrityChecks {\n\t\terr := newLogicalPlan.CheckIntegrity()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\treturn newLogicalPlan, nil\n}","func (cli *DockerCli) CmdFuncCall(args ...string) error {\n\tcmd := Cli.Subcmd(\"func call\", []string{\"NAME\"}, \"Call a function\", false)\n\tsync := cmd.Bool([]string{\"-sync\"}, false, \"Block until the call is completed\")\n\n\tcmd.Require(flag.Exact, 1)\n\tif err := cmd.ParseFlags(args, true); err != nil {\n\t\treturn err\n\t}\n\n\tname := cmd.Arg(0)\n\tname = strings.Replace(name, \"/\", \"\", -1)\n\n\tvar stdin io.Reader\n\tif fi, err := os.Stdin.Stat(); err == nil {\n\t\tif fi.Mode()&os.ModeNamedPipe != 0 {\n\t\t\tstdin = bufio.NewReader(os.Stdin)\n\t\t}\n\t}\n\n\tbody, err := cli.client.FuncCall(context.Background(), cli.region, name, stdin, *sync)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer body.Close()\n\n\tif *sync {\n\t\t_, err = io.Copy(cli.out, body)\n\t\treturn err\n\t}\n\n\tvar ret types.FuncCallResponse\n\terr = json.NewDecoder(body).Decode(&ret)\n\tif err != nil {\n\t\treturn err\n\t}\n\tfmt.Fprintf(cli.out, \"CallId: %s\\n\", ret.CallId)\n\n\treturn nil\n}","func (a *api) Call(name string, args ...interface{}) {\n\tformat := a.Name(name) + \"(%s\" + strings.Repeat(\", %s\", len(args)-1) + \")\"\n\ta.Linef(format, args...)\n}","func (e *MockExecutor) addCall(target **MockExecutorCall, call MockExecutorCall) {\n\te.Calls = append(e.Calls, call)\n\tif target != nil {\n\t\t*target = &call\n\t}\n}","func (s *BasePlSqlParserListener) EnterProcedure_call(ctx *Procedure_callContext) {}","func (n Node) Call(args ...interface{}) Node {\n\treturn Call(n, args...)\n}","func (p *tsdbBasedPlanner) Plan(_ context.Context, metasByMinTime []*metadata.Meta, _ chan error, _ any) ([]*metadata.Meta, error) {\n\treturn p.plan(p.noCompBlocksFunc(), metasByMinTime)\n}","func (_DelegateProfile *DelegateProfileCallerRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\n\treturn _DelegateProfile.Contract.contract.Call(opts, result, method, params...)\n}","func (n *Node) QueueCall(ctx context.Context, expectedEpochNumber epochtime.EpochTime, call []byte) error {\n\t// Check if we are a leader. Note that we may be in the middle of a\n\t// transition, but this shouldn't matter as the client will retry.\n\tepochSnapshot := n.commonNode.Group.GetEpochSnapshot()\n\tif !epochSnapshot.IsTransactionSchedulerLeader() {\n\t\treturn api.ErrNotLeader\n\t}\n\t// Check if expected client's epoch matches the current worker's one.\n\tif epochSnapshot.GetEpochNumber() != expectedEpochNumber {\n\t\tn.logger.Error(\"unable to QueueCall\",\n\t\t\t\"err\", api.ErrEpochNumberMismatch,\n\t\t\t\"current_epoch_number\", epochSnapshot.GetEpochNumber(),\n\t\t\t\"expected_epoch_number\", expectedEpochNumber,\n\t\t)\n\t\treturn api.ErrEpochNumberMismatch\n\t}\n\n\tif n.checkTxEnabled {\n\t\t// Check transaction before queuing it.\n\t\tif err := n.CheckTx(ctx, call); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tn.logger.Debug(\"worker CheckTx successful, queuing transaction\")\n\t}\n\n\tn.algorithmMutex.RLock()\n\tdefer n.algorithmMutex.RUnlock()\n\n\tif n.algorithm == nil || !n.algorithm.IsInitialized() {\n\t\treturn api.ErrNotReady\n\t}\n\tif err := n.algorithm.ScheduleTx(call); err != nil {\n\t\treturn err\n\t}\n\n\tincomingQueueSize.With(n.getMetricLabels()).Set(float64(n.algorithm.UnscheduledSize()))\n\n\treturn nil\n}","func FollowOperationPlan(ctx context.Context, getPlan GetPlanFunc) <-chan PlanEvent {\n\tch := make(chan PlanEvent)\n\tgo func() {\n\t\tdefer close(ch)\n\t\t// Send an initial batch of events from the initial state of the plan.\n\t\tplan, err := getPlan()\n\t\tif err == nil {\n\t\t\terr = sendPlanChanges(ctx, GetPlanProgress(*plan), *plan, ch)\n\t\t\tif errors.Is(err, errStopUpdates) {\n\t\t\t\t// Done\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t\tticker := backoff.NewTicker(getFollowStepPolicy())\n\t\tdefer ticker.Stop()\n\t\tdefer logrus.Info(\"Operation plan watcher done.\")\n\t\tfor {\n\t\t\tselect {\n\t\t\tcase <-ticker.C:\n\t\t\t\tnextPlan, err := getPlan()\n\t\t\t\tif err != nil {\n\t\t\t\t\tlogrus.WithError(err).Error(\"Failed to reload plan.\")\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tchanges, err := diffPlan(plan, *nextPlan)\n\t\t\t\tif err != nil {\n\t\t\t\t\tlogrus.WithError(err).Error(\"Failed to diff plans.\")\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\terr = sendPlanChanges(ctx, changes, *nextPlan, ch)\n\t\t\t\tif errors.Is(err, errStopUpdates) {\n\t\t\t\t\t// Done\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tif err != nil {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\t// Update the current plan for comparison on the next cycle and\n\t\t\t\t// reset the backoff so the ticker keeps ticking every second\n\t\t\t\t// as long as there are no errors.\n\t\t\t\tplan = nextPlan\n\t\t\tcase <-ctx.Done():\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}()\n\treturn ch\n}","func main() {\n call()\n}","func (_e *MockCompactionPlanContext_Expecter) start() *MockCompactionPlanContext_start_Call {\n\treturn &MockCompactionPlanContext_start_Call{Call: _e.mock.On(\"start\")}\n}","func (vm *ChaincodeVM) callFunction(funcnum int, debug Dumper, extraArgs ...Value) (Value, error) {\n\tvar retval Value\n\tif funcnum <= vm.infunc || funcnum >= len(vm.functions) {\n\t\treturn retval, vm.runtimeError(newRuntimeError(\"invalid function number (no recursion allowed)\"))\n\t}\n\n\tchildvm, err := vm.CreateForFunc(funcnum)\n\tif err != nil {\n\t\treturn retval, vm.runtimeError(err)\n\t}\n\tfor _, e := range extraArgs {\n\t\terr := childvm.stack.Push(e)\n\t\tif err != nil {\n\t\t\treturn retval, vm.runtimeError(err)\n\t\t}\n\t}\n\terr = childvm.Run(debug)\n\t// no matter what, we want the history\n\tvm.history = append(vm.history, childvm.history...)\n\tif err != nil {\n\t\treturn retval, vm.runtimeError(err)\n\t}\n\t// we've called the child function, now get back its return value\n\tretval, err = childvm.stack.Pop()\n\tif err != nil {\n\t\treturn retval, vm.runtimeError(err)\n\t}\n\treturn retval, nil\n}","func (fi *funcInfo) emitTailCall(line, a, nArgs int) {\r\n\tfi.emitABC(line, OP_TAILCALL, a, nArgs+1, 0)\r\n}","func (_Casper *CasperRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\n\treturn _Casper.Contract.CasperCaller.contract.Call(opts, result, method, params...)\n}","func Plan(ctx context.Context, input Input) (Output, error) {\n\t// create a copy of the cloned repo and run all commands there\n\t// wipe out the directory in case Plan has been run previously\n\t// but the change command has been edited and you want to run again\n\tplanDir := path.Join(input.WorkDir, \"planned\")\n\tif err := os.RemoveAll(planDir); err != nil {\n\t\treturn Output{Success: false}, fmt.Errorf(\"could not clear directory %s\", planDir)\n\t}\n\tcmd := exec.CommandContext(ctx, \"cp\", \"-a\", \"./.\", planDir) // \"./.\" copies all the contents of the current directory into the target directory\n\tcmd.Dir = input.RepoDir\n\tif output, err := cmd.CombinedOutput(); err != nil {\n\t\treturn Output{Success: false}, errors.New(string(output))\n\t}\n\n\t// run the change command, git add, and git commit\n\tfor _, cmd := range []Command{\n\t\tinput.Command,\n\t\tCommand{Path: \"git\", Args: []string{\"checkout\", \"-b\", input.BranchName}},\n\t\tCommand{Path: \"git\", Args: []string{\"add\", \"-A\"}},\n\t\tCommand{Path: \"git\", Args: []string{\"commit\", \"-m\", input.CommitMessage}},\n\t} {\n\t\texecCmd := exec.CommandContext(ctx, cmd.Path, cmd.Args...)\n\t\texecCmd.Dir = planDir\n\t\t// Set MICROPLANE_<X> convenience env vars, for use in user's script\n\t\texecCmd.Env = append(os.Environ(), fmt.Sprintf(\"MICROPLANE_REPO=%s\", input.RepoName))\n\t\tif output, err := execCmd.CombinedOutput(); err != nil {\n\t\t\treturn Output{Success: false}, errors.New(string(output))\n\t\t}\n\t}\n\n\t// add the git diff to output, might be useful / convenient?\n\tvar gitDiff string\n\tgitDiffCmd := exec.CommandContext(ctx, \"git\", \"diff\", \"HEAD^\", \"HEAD\")\n\tgitDiffCmd.Dir = planDir\n\toutput, err := gitDiffCmd.CombinedOutput()\n\tif err != nil {\n\t\treturn Output{Success: false}, errors.New(string(output))\n\t}\n\tgitDiff = string(output)\n\n\treturn Output{\n\t\tSuccess: true,\n\t\tPlanDir: planDir,\n\t\tGitDiff: gitDiff,\n\t\tBranchName: input.BranchName,\n\t\tCommitMessage: input.CommitMessage,\n\t}, nil\n}","func (_DelegateProfile *DelegateProfileRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\n\treturn _DelegateProfile.Contract.DelegateProfileCaller.contract.Call(opts, result, method, params...)\n}","func tForCall(i Instruction, ls *LuaState) {\n\ta, _, c := i.ABC()\n\ta += 1\n\n\t_pushFuncAndArgs(a, 3, ls)\n\tls.Call(2, c)\n\t_popResults(a+3, c+1, ls)\n}","func (c *Context) Plan() (*Plan, error) {\n\tdefer c.acquireRun(\"plan\")()\n\n\tp := &Plan{\n\t\tModule: c.module,\n\t\tVars: c.variables,\n\t\tState: c.state,\n\t\tTargets: c.targets,\n\n\t\tTerraformVersion: version.String(),\n\t\tProviderSHA256s: c.providerSHA256s,\n\t}\n\n\tvar operation walkOperation\n\tif c.destroy {\n\t\toperation = walkPlanDestroy\n\t\tp.Destroy = true\n\t} else {\n\t\t// Set our state to be something temporary. We do this so that\n\t\t// the plan can update a fake state so that variables work, then\n\t\t// we replace it back with our old state.\n\t\told := c.state\n\t\tif old == nil {\n\t\t\tc.state = &State{}\n\t\t\tc.state.init()\n\t\t} else {\n\t\t\tc.state = old.DeepCopy()\n\t\t}\n\t\tdefer func() {\n\t\t\tc.state = old\n\t\t}()\n\n\t\toperation = walkPlan\n\t}\n\n\t// Setup our diff\n\tc.diffLock.Lock()\n\tc.diff = new(Diff)\n\tc.diff.init()\n\tc.diffLock.Unlock()\n\n\t// Build the graph.\n\tgraphType := GraphTypePlan\n\tif c.destroy {\n\t\tgraphType = GraphTypePlanDestroy\n\t}\n\tgraph, err := c.Graph(graphType, nil)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Do the walk\n\twalker, err := c.walk(graph, operation)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tp.Diff = c.diff\n\n\t// If this is true, it means we're running unit tests. In this case,\n\t// we perform a deep copy just to ensure that all context tests also\n\t// test that a diff is copy-able. This will panic if it fails. This\n\t// is enabled during unit tests.\n\t//\n\t// This should never be true during production usage, but even if it is,\n\t// it can't do any real harm.\n\tif contextTestDeepCopyOnPlan {\n\t\tp.Diff.DeepCopy()\n\t}\n\n\t/*\n\t\t// We don't do the reverification during the new destroy plan because\n\t\t// it will use a different apply process.\n\t\tif X_legacyGraph {\n\t\t\t// Now that we have a diff, we can build the exact graph that Apply will use\n\t\t\t// and catch any possible cycles during the Plan phase.\n\t\t\tif _, err := c.Graph(GraphTypeLegacy, nil); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t*/\n\n\tvar errs error\n\tif len(walker.ValidationErrors) > 0 {\n\t\terrs = multierror.Append(errs, walker.ValidationErrors...)\n\t}\n\treturn p, errs\n}","func (m Function) Call(params ...jen.Code) jen.Code {\n\treturn m.qual.Clone().Call(params...)\n}","func (b *Builder) Call(f FunctionInfo) {\n\tb.popStackMulti(f.Parameters)\n\tpush := f.ReturnType != protocol.Type_Void\n\tif push {\n\t\tb.pushStack(f.ReturnType)\n\t}\n\tb.instructions = append(b.instructions, asm.Call{\n\t\tPushReturn: push,\n\t\tApiIndex: f.ApiIndex,\n\t\tFunctionID: f.ID,\n\t})\n}","func (r ApiCreatePlanRequest) PlanRequest(planRequest PlanRequest) ApiCreatePlanRequest {\n\tr.planRequest = &planRequest\n\treturn r\n}","func (p *Parser) parseCallExpression(function asti.ExpressionI) asti.ExpressionI {\n\texp := &ast.CallExpression{Token: p.curToken, Function: function}\n\texp.Arguments = p.parseExpressionList(tokentype.RPAREN)\n\treturn exp\n}","func (breaker *ServiceBreaker) Call(exec func() (interface{}, error)) (interface{}, error) {\n\tlog.Printf(\"start call, %v state is %v\\n\", breaker.name, breaker.state)\n\t//before call\n\terr := breaker.beforeCall()\n\tif err != nil {\n\t\tlog.Printf(\"end call,%v batch:%v,metrics:(%v,%v,%v,%v,%v),window time start:%v\\n\\n\",\n\t\t\tbreaker.name,\n\t\t\tbreaker.metrics.WindowBatch,\n\t\t\tbreaker.metrics.CountAll,\n\t\t\tbreaker.metrics.CountSuccess,\n\t\t\tbreaker.metrics.CountFail,\n\t\t\tbreaker.metrics.ConsecutiveSuccess,\n\t\t\tbreaker.metrics.ConsecutiveFail,\n\t\t\tbreaker.metrics.WindowTimeStart.Format(\"2006/01/02 15:04:05\"))\n\t\treturn nil, err\n\t}\n\n\t//if panic occur\n\tdefer func() {\n\t\terr := recover()\n\t\tif err != nil {\n\t\t\tbreaker.afterCall(false)\n\t\t\tpanic(err) //todo?\n\t\t}\n\t}()\n\n\t//call\n\tbreaker.metrics.OnCall()\n\tresult, err := exec()\n\n\t//after call\n\tbreaker.afterCall(err == nil)\n\tlog.Printf(\"end call,%v batch:%v,metrics:(%v,%v,%v,%v,%v),window time start:%v\\n\\n\",\n\t\tbreaker.name,\n\t\tbreaker.metrics.WindowBatch,\n\t\tbreaker.metrics.CountAll,\n\t\tbreaker.metrics.CountSuccess,\n\t\tbreaker.metrics.CountFail,\n\t\tbreaker.metrics.ConsecutiveSuccess,\n\t\tbreaker.metrics.ConsecutiveFail,\n\t\tbreaker.metrics.WindowTimeStart.Format(\"2006/1/2 15:04:05\"))\n\n\treturn result, err\n}","func (b *block) Plan(pointIds ...string) ([]spi.PointSPI, error) {\n\tpoints := []spi.PointSPI{}\n\n\tif len(pointIds) == 0 {\n\t\t// if there are no specified points, include all points\n\n\t\tfor _, p := range b.points {\n\t\t\tpoints = append(points, p)\n\t\t}\n\t} else {\n\t\tincluded := map[string]bool{}\n\t\tincluded_sf := map[string]bool{}\n\n\t\t// include all specified points\n\t\tfor _, id := range pointIds {\n\t\t\tif p, ok := b.points[id]; !ok {\n\t\t\t\treturn nil, sunspec.ErrNoSuchPoint\n\t\t\t} else {\n\t\t\t\tif !included[id] {\n\t\t\t\t\tpoints = append(points, p)\n\t\t\t\t\tincluded[id] = true\n\t\t\t\t}\n\t\t\t\tif p.Type() == typelabel.ScaleFactor {\n\t\t\t\t\tincluded_sf[id] = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// include their scale factors too...\n\t\t//\n\t\t// we do this for several reasons:\n\t\t// - to interpret a point that uses a scale factor, we need the scale factor too\n\t\t// - if we don't there we may read a value point after its scale factor point has changed\n\t\t// By forcing contemporaneous reads of a scale factor and its related points we help to ensure\n\t\t// that the two values are consistent.\n\t\t// - we want to avoid app programmers having to encode knowedlege in their programs\n\t\t// about these depednencies - the knowledge is in the SMDX documents, so lets use it\n\t\tfor _, p := range points {\n\t\t\tsfp := p.(*point).scaleFactor\n\t\t\tif sfp != nil {\n\t\t\t\tif !included[sfp.Id()] {\n\t\t\t\t\tpoints = append(points, sfp.(spi.PointSPI))\n\t\t\t\t\tincluded[sfp.Id()] = true\n\t\t\t\t\tincluded_sf[sfp.Id()] = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// We also include all the currently valid points that reference any scale\n\t\t// factor points we are going to read since we don't want such points to\n\t\t// unexpectedly enter an error state when they are invalidated by the\n\t\t// read of the scale factor point. This allows twp separate reads each\n\t\t// of which have a point that reference a shared scale factor point to\n\t\t// be equivalent to a single read of all points or to two reads in which\n\t\t// all points related to a single scale factor are read in the same read\n\t\t// as the scale factor itself.\n\t\t//\n\t\t// One consequence of this behaviour is that any local changes (via a\n\t\t// setter) to a point dependent on a scale factor point may be lost by a\n\t\t// read of any point that is dependent on the same scale factor which\n\t\t// itself means that local changes to points should be written to the\n\t\t// physical device with Block.Write before the next Block.Read or else\n\t\t// they may be lost under some circumstances even if the point concerned\n\t\t// is not directly referened by the Read call.\n\t\t//\n\t\t// Part of the reason we do this is to maximise the consistency of data\n\t\t// exposed by the API while minimising both the effort for the programmer\n\t\t// to maintain the consistency and also surprising behaviour.\n\t\tfor _, p := range b.points {\n\t\t\tif sfp := p.scaleFactor; sfp == nil || p.Error() != nil || !included_sf[sfp.Id()] {\n\t\t\t\tcontinue\n\t\t\t} else {\n\t\t\t\tif !included[p.Id()] {\n\t\t\t\t\tpoints = append(points, p)\n\t\t\t\t\tincluded[p.Id()] = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// sort so scale factors come first, then other points in offset order\n\tsort.Sort(scaleFactorFirstOrder(points))\n\treturn points, nil\n}","func (_Flopper *FlopperRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\n\treturn _Flopper.Contract.FlopperCaller.contract.Call(opts, result, method, params...)\n}","func (runner *suiteRunner) runFunc(method *reflect.FuncValue, kind funcKind,\n dispatcher func(c *C)) *C {\n c := runner.forkCall(method, kind, dispatcher)\n <-c.done\n return c\n}","func (_e *MockRecurringTaskRequirements_Expecter) processTask() *MockRecurringTaskRequirements_processTask_Call {\n\treturn &MockRecurringTaskRequirements_processTask_Call{Call: _e.mock.On(\"processTask\")}\n}","func (m Method) Call(on string, params ...jen.Code) jen.Code {\n\treturn jen.Id(on).Dot(m.function.name).Call(params...)\n}","func (s *BasevhdlListener) EnterProcedure_call(ctx *Procedure_callContext) {}","func (er *expressionRewriter) rewriteFuncCall(v *ast.FuncCallExpr) bool {\n\ttrace_util_0.Count(_expression_rewriter_00000, 413)\n\tswitch v.FnName.L {\n\t// when column is not null, ifnull on such column is not necessary.\n\tcase ast.Ifnull:\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 414)\n\t\tif len(v.Args) != 2 {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 422)\n\t\t\ter.err = expression.ErrIncorrectParameterCount.GenWithStackByArgs(v.FnName.O)\n\t\t\treturn true\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 415)\n\t\tstackLen := len(er.ctxStack)\n\t\targ1 := er.ctxStack[stackLen-2]\n\t\tcol, isColumn := arg1.(*expression.Column)\n\t\t// if expr1 is a column and column has not null flag, then we can eliminate ifnull on\n\t\t// this column.\n\t\tif isColumn && mysql.HasNotNullFlag(col.RetType.Flag) {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 423)\n\t\t\tnewCol := col.Clone().(*expression.Column)\n\t\t\tnewCol.IsReferenced = true\n\t\t\ter.ctxStack = er.ctxStack[:stackLen-len(v.Args)]\n\t\t\ter.ctxStack = append(er.ctxStack, newCol)\n\t\t\treturn true\n\t\t}\n\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 416)\n\t\treturn false\n\tcase ast.Nullif:\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 417)\n\t\tif len(v.Args) != 2 {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 424)\n\t\t\ter.err = expression.ErrIncorrectParameterCount.GenWithStackByArgs(v.FnName.O)\n\t\t\treturn true\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 418)\n\t\tstackLen := len(er.ctxStack)\n\t\tparam1 := er.ctxStack[stackLen-2]\n\t\tparam2 := er.ctxStack[stackLen-1]\n\t\t// param1 = param2\n\t\tfuncCompare, err := er.constructBinaryOpFunction(param1, param2, ast.EQ)\n\t\tif err != nil {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 425)\n\t\t\ter.err = err\n\t\t\treturn true\n\t\t}\n\t\t// NULL\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 419)\n\t\tnullTp := types.NewFieldType(mysql.TypeNull)\n\t\tnullTp.Flen, nullTp.Decimal = mysql.GetDefaultFieldLengthAndDecimal(mysql.TypeNull)\n\t\tparamNull := &expression.Constant{\n\t\t\tValue: types.NewDatum(nil),\n\t\t\tRetType: nullTp,\n\t\t}\n\t\t// if(param1 = param2, NULL, param1)\n\t\tfuncIf, err := er.newFunction(ast.If, &v.Type, funcCompare, paramNull, param1)\n\t\tif err != nil {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 426)\n\t\t\ter.err = err\n\t\t\treturn true\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 420)\n\t\ter.ctxStack = er.ctxStack[:stackLen-len(v.Args)]\n\t\ter.ctxStack = append(er.ctxStack, funcIf)\n\t\treturn true\n\tdefault:\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 421)\n\t\treturn false\n\t}\n}","func (core *coreService) TraceCall(ctx context.Context,\n\tcallerAddr address.Address,\n\tblkNumOrHash any,\n\tcontractAddress string,\n\tnonce uint64,\n\tamount *big.Int,\n\tgasLimit uint64,\n\tdata []byte,\n\tconfig *logger.Config) ([]byte, *action.Receipt, *logger.StructLogger, error) {\n\tvar (\n\t\tblkHash hash.Hash256\n\t\terr error\n\t)\n\t// ignore the incoming blkNumOrHash and use the latest height.\n\tblkHash, err = core.dao.GetBlockHash(core.TipHeight())\n\tif err != nil {\n\t\treturn nil, nil, nil, err\n\t}\n\tif gasLimit == 0 {\n\t\tgasLimit = core.bc.Genesis().BlockGasLimit\n\t}\n\ttraces := logger.NewStructLogger(config)\n\tctx = protocol.WithVMConfigCtx(ctx, vm.Config{\n\t\tDebug: true,\n\t\tTracer: traces,\n\t\tNoBaseFee: true,\n\t})\n\tctx, err = core.bc.Context(ctx)\n\tif err != nil {\n\t\treturn nil, nil, nil, err\n\t}\n\tif nonce == 0 {\n\t\tstate, err := accountutil.AccountState(ctx, core.sf, callerAddr)\n\t\tif err != nil {\n\t\t\treturn nil, nil, nil, err\n\t\t}\n\t\tnonce = state.PendingNonce()\n\t}\n\texec, err := action.NewExecution(\n\t\tcontractAddress,\n\t\tnonce,\n\t\tamount,\n\t\tgasLimit,\n\t\tbig.NewInt(0),\n\t\tdata,\n\t)\n\tif err != nil {\n\t\treturn nil, nil, nil, err\n\t}\n\tgetblockHash := func(height uint64) (hash.Hash256, error) {\n\t\treturn blkHash, nil\n\t}\n\tretval, receipt, err := core.sf.SimulateExecution(ctx, callerAddr, exec, getblockHash)\n\treturn retval, receipt, traces, err\n}","func (s *state) evalCall(dot, fun reflect.Value, node parse.Node, name string, args []parse.Node, final reflect.Value) reflect.Value {\n\tif args != nil {\n\t\targs = args[1:] // Zeroth arg is function name/node; not passed to function.\n\t}\n\ttyp := fun.Type()\n\tnumIn := len(args)\n\tif final.IsValid() {\n\t\tnumIn++\n\t}\n\tnumFixed := len(args)\n\tif typ.IsVariadic() {\n\t\tnumFixed = typ.NumIn() - 1 // last arg is the variadic one.\n\t\tif numIn < numFixed {\n\t\t\ts.errorf(\"wrong number of args for %s: want at least %d got %d\", name, typ.NumIn()-1, len(args))\n\t\t}\n\t} else if numIn < typ.NumIn()-1 || !typ.IsVariadic() && numIn != typ.NumIn() {\n\t\ts.errorf(\"wrong number of args for %s: want %d got %d\", name, typ.NumIn(), len(args))\n\t}\n\tif !goodFunc(typ) {\n\t\t// TODO: This could still be a confusing error; maybe goodFunc should provide info.\n\t\ts.errorf(\"can't call method/function %q with %d results\", name, typ.NumOut())\n\t}\n\t// Build the arg list.\n\targv := make([]reflect.Value, numIn)\n\t// Args must be evaluated. Fixed args first.\n\ti := 0\n\tfor ; i < numFixed && i < len(args); i++ {\n\t\targv[i] = s.evalArg(dot, typ.In(i), args[i])\n\t}\n\t// Now the ... args.\n\tif typ.IsVariadic() {\n\t\targType := typ.In(typ.NumIn() - 1).Elem() // Argument is a slice.\n\t\tfor ; i < len(args); i++ {\n\t\t\targv[i] = s.evalArg(dot, argType, args[i])\n\t\t}\n\t}\n\t// Add final value if necessary.\n\tif final.IsValid() {\n\t\tt := typ.In(typ.NumIn() - 1)\n\t\tif typ.IsVariadic() {\n\t\t\tt = t.Elem()\n\t\t}\n\t\targv[i] = s.validateType(final, t)\n\t}\n\tresult := fun.Call(argv)\n\t// If we have an error that is not nil, stop execution and return that error to the caller.\n\tif len(result) == 2 && !result[1].IsNil() {\n\t\ts.at(node)\n\t\ts.errorf(\"error calling %s: %s\", name, result[1].Interface().(error))\n\t}\n\treturn result[0]\n}","func (_Casper *CasperCallerRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\n\treturn _Casper.Contract.contract.Call(opts, result, method, params...)\n}","func NewCall(name string, args []Expression, opts FunctionOptions) Expression {\n\treturn &Call{funcName: name, args: args, options: opts}\n}","func (_Mapping *MappingCallerRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\n\treturn _Mapping.Contract.contract.Call(opts, result, method, params...)\n}","func (bf *boardFilter) processCallingPoints(s ldb.Service) {\n\tif len(s.CallingPoints) > 0 {\n\t\tviaRequest := bf.addVia(s.RID, s.CallingPoints[len(s.CallingPoints)-1].Tiploc)\n\n\t\tfor _, cp := range s.CallingPoints {\n\t\t\tbf.addTiploc(cp.Tiploc)\n\t\t\tviaRequest.AppendTiploc(cp.Tiploc)\n\t\t}\n\t}\n}","func (a *agent) GetCall(opts ...CallOpt) (Call, error) {\n\tvar c call\n\n\t// add additional agent options after any call specific options\n\t// NOTE(reed): this policy is open to being the opposite way around, have at it,\n\t// the thinking being things like FromHTTPRequest are in supplied opts...\n\topts = append(opts, a.callOpts...)\n\n\tfor _, o := range opts {\n\t\terr := o(&c)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\t// TODO typed errors to test\n\tif c.req == nil || c.Call == nil {\n\t\treturn nil, errors.New(\"no model or request provided for call\")\n\t}\n\n\t// If overrider is present, let's allow it to modify models.Call\n\t// and call extensions\n\tif a.callOverrider != nil {\n\t\text, err := a.callOverrider(c.req, c.Call, c.extensions)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tc.extensions = ext\n\t}\n\n\tmem := c.Memory + uint64(c.TmpFsSize)\n\tif !a.resources.IsResourcePossible(mem, c.CPUs) {\n\t\treturn nil, models.ErrCallResourceTooBig\n\t}\n\n\tif c.Call.Config == nil {\n\t\tc.Call.Config = make(models.Config)\n\t}\n\tc.Call.Config[\"FN_LISTENER\"] = \"unix:\" + filepath.Join(iofsDockerMountDest, udsFilename)\n\tc.Call.Config[\"FN_FORMAT\"] = \"http-stream\" // TODO: remove this after fdk's forget what it means\n\t// TODO we could set type here too, for now, or anything else not based in fn/app/trigger config\n\n\tsetupCtx(&c)\n\n\tc.ct = a\n\tif c.stderr == nil {\n\t\t// TODO(reed): is line writer is vulnerable to attack?\n\t\t// XXX(reed): forcing this as default is not great / configuring it isn't great either. reconsider.\n\t\tc.stderr = setupLogger(c.req.Context(), a.cfg.MaxLogSize, !a.cfg.DisableDebugUserLogs, c.Call)\n\t}\n\tif c.respWriter == nil {\n\t\t// send function output to logs if no writer given (TODO no longer need w/o async?)\n\t\t// TODO we could/should probably make this explicit to GetCall, ala 'WithLogger', but it's dupe code (who cares?)\n\t\tc.respWriter = c.stderr\n\t}\n\n\treturn &c, nil\n}","func trampoline(ctxt *ld.Link, r *sym.Reloc, s *sym.Symbol) {\n\n\t// Trampolines are created if the branch offset is too large and the linker cannot insert a call stub to handle it.\n\t// For internal linking, trampolines are always created for long calls.\n\t// For external linking, the linker can insert a call stub to handle a long call, but depends on having the TOC address in\n\t// r2. For those build modes with external linking where the TOC address is not maintained in r2, trampolines must be created.\n\tif ctxt.LinkMode == ld.LinkExternal && (ctxt.DynlinkingGo() || ctxt.BuildMode == ld.BuildModeCArchive || ctxt.BuildMode == ld.BuildModeCShared || ctxt.BuildMode == ld.BuildModePIE) {\n\t\t// No trampolines needed since r2 contains the TOC\n\t\treturn\n\t}\n\n\tt := ld.Symaddr(r.Sym) + r.Add - (s.Value + int64(r.Off))\n\tswitch r.Type {\n\tcase objabi.R_CALLPOWER:\n\n\t\t// If branch offset is too far then create a trampoline.\n\n\t\tif (ctxt.LinkMode == ld.LinkExternal && s.Sect != r.Sym.Sect) || (ctxt.LinkMode == ld.LinkInternal && int64(int32(t<<6)>>6) != t) || (*ld.FlagDebugTramp > 1 && s.File != r.Sym.File) {\n\t\t\tvar tramp *sym.Symbol\n\t\t\tfor i := 0; ; i++ {\n\n\t\t\t\t// Using r.Add as part of the name is significant in functions like duffzero where the call\n\t\t\t\t// target is at some offset within the function. Calls to duff+8 and duff+256 must appear as\n\t\t\t\t// distinct trampolines.\n\n\t\t\t\tname := r.Sym.Name\n\t\t\t\tif r.Add == 0 {\n\t\t\t\t\tname = name + fmt.Sprintf(\"-tramp%d\", i)\n\t\t\t\t} else {\n\t\t\t\t\tname = name + fmt.Sprintf(\"%+x-tramp%d\", r.Add, i)\n\t\t\t\t}\n\n\t\t\t\t// Look up the trampoline in case it already exists\n\n\t\t\t\ttramp = ctxt.Syms.Lookup(name, int(r.Sym.Version))\n\t\t\t\tif tramp.Value == 0 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\n\t\t\t\tt = ld.Symaddr(tramp) + r.Add - (s.Value + int64(r.Off))\n\n\t\t\t\t// With internal linking, the trampoline can be used if it is not too far.\n\t\t\t\t// With external linking, the trampoline must be in this section for it to be reused.\n\t\t\t\tif (ctxt.LinkMode == ld.LinkInternal && int64(int32(t<<6)>>6) == t) || (ctxt.LinkMode == ld.LinkExternal && s.Sect == tramp.Sect) {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif tramp.Type == 0 {\n\t\t\t\tif ctxt.DynlinkingGo() || ctxt.BuildMode == ld.BuildModeCArchive || ctxt.BuildMode == ld.BuildModeCShared || ctxt.BuildMode == ld.BuildModePIE {\n\t\t\t\t\t// Should have returned for above cases\n\t\t\t\t\tld.Errorf(s, \"unexpected trampoline for shared or dynamic linking\\n\")\n\t\t\t\t} else {\n\t\t\t\t\tctxt.AddTramp(tramp)\n\t\t\t\t\tgentramp(ctxt, tramp, r.Sym, r.Add)\n\t\t\t\t}\n\t\t\t}\n\t\t\tr.Sym = tramp\n\t\t\tr.Add = 0 // This was folded into the trampoline target address\n\t\t\tr.Done = false\n\t\t}\n\tdefault:\n\t\tld.Errorf(s, \"trampoline called with non-jump reloc: %d (%s)\", r.Type, sym.RelocName(ctxt.Arch, r.Type))\n\t}\n}","func (_m *MockCompactionPlanContext) execCompactionPlan(signal *compactionSignal, plan *datapb.CompactionPlan) error {\n\tret := _m.Called(signal, plan)\n\n\tvar r0 error\n\tif rf, ok := ret.Get(0).(func(*compactionSignal, *datapb.CompactionPlan) error); ok {\n\t\tr0 = rf(signal, plan)\n\t} else {\n\t\tr0 = ret.Error(0)\n\t}\n\n\treturn r0\n}","func Call(f func()) {\n\tdone := dPool.Get().(chan struct{})\n\tdefer dPool.Put(done)\n\tfq <- fun{fn: f, done: done}\n\t<-done\n}","func (fn FunctionN) Call(args ...Expression) (Expression, error) {\n\treturn fn.Fn(args...)\n}","func (self *TravellerBots) planTrips(cars *CountriesAirportsRoutes, jp* journeyPlanner, fe *flap.Engine,currentDay flap.EpochTime,deterministic bool,dayOfModel flap.Days, threads uint) error {\n\t\n\t// Create configured number of threads to plan trips and wait for them to finish\n\tperrs := make(chan error, threads)\n\tvar wg sync.WaitGroup\n\tfor i := uint(0); i < threads; i++ {\n\t\twg.Add(1)\n\t\tt := func (step uint,offset uint) {perrs <- self.doPlanTrips(cars,jp,fe,currentDay,deterministic,dayOfModel,step,offset);wg.Done()}\n\t\tgo t(threads,i)\n\t}\n\twg.Wait()\n\n\t// Return first error reported\n\tclose(perrs)\n\tfor elem := range perrs {\n\t\tif elem != nil {\n\t\t\treturn elem\n\t\t}\n\t}\n\treturn nil\n}","func (th *Thread) PushCall(fn Callable, this Value, as *ArgSpec, args ...Value) Value {\n\tbase := th.sp\n\tfor _, x := range args {\n\t\tth.Push(x)\n\t}\n\tresult := fn.Call(th, this, as)\n\tth.sp = base\n\treturn result\n}","func (ob *Observation) make_call(fv reflect.Value, inputs []reflect.Value) []reflect.Value {\n\tif ob.can_panic {\n\t\tdefer func() {\n\t\t\tob.Panic = recover()\n\t\t}()\n\t}\n\n\tob.Start = time.Now()\n\tret := fv.Call(inputs)\n\tob.Duration = time.Since(ob.Start)\n\treturn ret\n}"],"string":"[\n \"func (t *TimeLine) Plan(nbars, num, denom uint32, callback func(delta int32)) {\\n\\t/*\\n\\t 1. calc the abs position for the callback by using forward\\n\\t 2. rewind cursor\\n\\t 3. register callback\\n\\t 4. sort planned callbacks\\n\\t*/\\n\\n\\tsavedCursor := t.cursor\\n\\tt.forwardIgnoringCallbacks(nbars, num, denom)\\n\\tpos := t.cursor\\n\\tt.cursor = savedCursor\\n\\t//\\tfmt.Printf(\\\"cursor: %v, pos: %v\\\\n\\\", t.cursor, pos)\\n\\tt.plannedCallbacks = append(t.plannedCallbacks, plannedCallback{callback: callback, position: pos})\\n\\tsort.Sort(t.plannedCallbacks)\\n}\",\n \"func (runner *suiteRunner) forkCall(method *reflect.FuncValue, kind funcKind,\\n dispatcher func(c *C)) *C {\\n c := newC(method, kind, runner.tempDir)\\n runner.tracker.waitForCall(c)\\n go (func() {\\n defer runner.callDone(c)\\n dispatcher(c)\\n })()\\n return c\\n}\",\n \"func (a *answer) queueCall(result *answer, transform []capnp.PipelineOp, call *capnp.Call) error {\\n\\ta.mu.Lock()\\n\\tdefer a.mu.Unlock()\\n\\tif a.done {\\n\\t\\tpanic(\\\"answer.queueCall called on resolved answer\\\")\\n\\t}\\n\\tif len(a.queue) == cap(a.queue) {\\n\\t\\treturn errQueueFull\\n\\t}\\n\\tcc, err := call.Copy(nil)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\ta.queue = append(a.queue, pcall{\\n\\t\\ttransform: transform,\\n\\t\\tqcall: qcall{\\n\\t\\t\\ta: result,\\n\\t\\t\\tcall: cc,\\n\\t\\t},\\n\\t})\\n\\treturn nil\\n}\",\n \"func transformCall(n *ir.CallExpr) {\\n\\t// Set base.Pos, since transformArgs below may need it, but transformCall\\n\\t// is called in some passes that don't set base.Pos.\\n\\tir.SetPos(n)\\n\\t// n.Type() can be nil for calls with no return value\\n\\tassert(n.Typecheck() == 1)\\n\\ttransformArgs(n)\\n\\tl := n.X\\n\\tt := l.Type()\\n\\n\\tswitch l.Op() {\\n\\tcase ir.ODOTINTER:\\n\\t\\tn.SetOp(ir.OCALLINTER)\\n\\n\\tcase ir.ODOTMETH:\\n\\t\\tl := l.(*ir.SelectorExpr)\\n\\t\\tn.SetOp(ir.OCALLMETH)\\n\\n\\t\\ttp := t.Recv().Type\\n\\n\\t\\tif l.X == nil || !types.Identical(l.X.Type(), tp) {\\n\\t\\t\\tbase.Fatalf(\\\"method receiver\\\")\\n\\t\\t}\\n\\n\\tdefault:\\n\\t\\tn.SetOp(ir.OCALLFUNC)\\n\\t}\\n\\n\\ttypecheckaste(ir.OCALL, n.X, n.IsDDD, t.Params(), n.Args)\\n\\tif l.Op() == ir.ODOTMETH && len(deref(n.X.Type().Recv().Type).RParams()) == 0 {\\n\\t\\ttypecheck.FixMethodCall(n)\\n\\t}\\n\\tif t.NumResults() == 1 {\\n\\t\\tif n.Op() == ir.OCALLFUNC && n.X.Op() == ir.ONAME {\\n\\t\\t\\tif sym := n.X.(*ir.Name).Sym(); types.IsRuntimePkg(sym.Pkg) && sym.Name == \\\"getg\\\" {\\n\\t\\t\\t\\t// Emit code for runtime.getg() directly instead of calling function.\\n\\t\\t\\t\\t// Most such rewrites (for example the similar one for math.Sqrt) should be done in walk,\\n\\t\\t\\t\\t// so that the ordering pass can make sure to preserve the semantics of the original code\\n\\t\\t\\t\\t// (in particular, the exact time of the function call) by introducing temporaries.\\n\\t\\t\\t\\t// In this case, we know getg() always returns the same result within a given function\\n\\t\\t\\t\\t// and we want to avoid the temporaries, so we do the rewrite earlier than is typical.\\n\\t\\t\\t\\tn.SetOp(ir.OGETG)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn\\n\\t}\\n}\",\n \"func (fi *funcInfo) emitCall(line, a, nArgs, nRet int) {\\r\\n\\tfi.emitABC(line, OP_CALL, a, nArgs+1, nRet+1)\\r\\n}\",\n \"func generateCall(generator *Generator, node parser.Node) string {\\n\\tvar identifier string\\n\\n\\t// Check if it is a built-in function or not\\n\\tif strings.Contains(node.Value, \\\"|\\\") {\\n\\t\\t// Get the function identifier by spliting the value by the pipe\\n\\t\\tidentifier = strings.Split(node.Value, \\\"|\\\")[1]\\n\\n\\t\\tcheckCall(generator, node)\\n\\n\\t\\t// Add import to the generator\\n\\t\\taddCallImport(\\n\\t\\t\\tgenerator,\\n\\t\\t\\tnode.Value,\\n\\t\\t)\\n\\t} else {\\n\\t\\tidentifier = node.Value\\n\\t}\\n\\n\\t// Translate the params\\n\\tparams := generateParams(generator, node.Params)\\n\\n\\t// Link all the translations together\\n\\treturn fmt.Sprintf(\\n\\t\\tcCall,\\n\\t\\tidentifier,\\n\\t\\tstrings.Join(params, \\\",\\\"),\\n\\t)\\n}\",\n \"func CALL(r operand.Op) { ctx.CALL(r) }\",\n \"func (_e *MockCompactionPlanContext_Expecter) execCompactionPlan(signal interface{}, plan interface{}) *MockCompactionPlanContext_execCompactionPlan_Call {\\n\\treturn &MockCompactionPlanContext_execCompactionPlan_Call{Call: _e.mock.On(\\\"execCompactionPlan\\\", signal, plan)}\\n}\",\n \"func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\\n\\tswitch expr := expr.(type) {\\n\\tcase *VarRef:\\n\\t\\tpanic(\\\"TODO\\\")\\n\\tcase *Call:\\n\\t\\treturn p.planCall(e, expr)\\n\\tcase *BinaryExpr:\\n\\t\\treturn p.planBinaryExpr(e, expr)\\n\\tcase *ParenExpr:\\n\\t\\treturn p.planExpr(e, expr.Expr)\\n\\tcase *NumberLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *StringLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *BooleanLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *TimeLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *DurationLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\t}\\n\\tpanic(\\\"unreachable\\\")\\n}\",\n \"func (pc *programCode) createCall(name string) {\\n\\tcode := \\\"\\\"\\n\\tcode += \\\"\\\\n\\\\tcall \\\" + name + \\\"\\\\t; call label \\\" + name + \\\"\\\\n\\\"\\n\\tpc.appendCode(code)\\n}\",\n \"func (p *Process) Call(procFnc func(p *Process)) {\\n\\tprocFnc(p)\\n}\",\n \"func walkCall(n *ir.CallExpr, init *ir.Nodes) ir.Node {\\n\\tif n.Op() == ir.OCALLMETH {\\n\\t\\tbase.FatalfAt(n.Pos(), \\\"OCALLMETH missed by typecheck\\\")\\n\\t}\\n\\tif n.Op() == ir.OCALLINTER || n.X.Op() == ir.OMETHEXPR {\\n\\t\\t// We expect both interface call reflect.Type.Method and concrete\\n\\t\\t// call reflect.(*rtype).Method.\\n\\t\\tusemethod(n)\\n\\t}\\n\\tif n.Op() == ir.OCALLINTER {\\n\\t\\treflectdata.MarkUsedIfaceMethod(n)\\n\\t}\\n\\n\\tif n.Op() == ir.OCALLFUNC && n.X.Op() == ir.OCLOSURE {\\n\\t\\tdirectClosureCall(n)\\n\\t}\\n\\n\\tif isFuncPCIntrinsic(n) {\\n\\t\\t// For internal/abi.FuncPCABIxxx(fn), if fn is a defined function, rewrite\\n\\t\\t// it to the address of the function of the ABI fn is defined.\\n\\t\\tname := n.X.(*ir.Name).Sym().Name\\n\\t\\targ := n.Args[0]\\n\\t\\tvar wantABI obj.ABI\\n\\t\\tswitch name {\\n\\t\\tcase \\\"FuncPCABI0\\\":\\n\\t\\t\\twantABI = obj.ABI0\\n\\t\\tcase \\\"FuncPCABIInternal\\\":\\n\\t\\t\\twantABI = obj.ABIInternal\\n\\t\\t}\\n\\t\\tif isIfaceOfFunc(arg) {\\n\\t\\t\\tfn := arg.(*ir.ConvExpr).X.(*ir.Name)\\n\\t\\t\\tabi := fn.Func.ABI\\n\\t\\t\\tif abi != wantABI {\\n\\t\\t\\t\\tbase.ErrorfAt(n.Pos(), \\\"internal/abi.%s expects an %v function, %s is defined as %v\\\", name, wantABI, fn.Sym().Name, abi)\\n\\t\\t\\t}\\n\\t\\t\\tvar e ir.Node = ir.NewLinksymExpr(n.Pos(), fn.Sym().LinksymABI(abi), types.Types[types.TUINTPTR])\\n\\t\\t\\te = ir.NewAddrExpr(n.Pos(), e)\\n\\t\\t\\te.SetType(types.Types[types.TUINTPTR].PtrTo())\\n\\t\\t\\te = ir.NewConvExpr(n.Pos(), ir.OCONVNOP, n.Type(), e)\\n\\t\\t\\treturn e\\n\\t\\t}\\n\\t\\t// fn is not a defined function. It must be ABIInternal.\\n\\t\\t// Read the address from func value, i.e. *(*uintptr)(idata(fn)).\\n\\t\\tif wantABI != obj.ABIInternal {\\n\\t\\t\\tbase.ErrorfAt(n.Pos(), \\\"internal/abi.%s does not accept func expression, which is ABIInternal\\\", name)\\n\\t\\t}\\n\\t\\targ = walkExpr(arg, init)\\n\\t\\tvar e ir.Node = ir.NewUnaryExpr(n.Pos(), ir.OIDATA, arg)\\n\\t\\te.SetType(n.Type().PtrTo())\\n\\t\\te = ir.NewStarExpr(n.Pos(), e)\\n\\t\\te.SetType(n.Type())\\n\\t\\treturn e\\n\\t}\\n\\n\\twalkCall1(n, init)\\n\\treturn n\\n}\",\n \"func call(i Instruction, ls *LuaState) {\\n\\ta, b, c := i.ABC()\\n\\ta += 1\\n\\n\\t// println(\\\":::\\\"+ ls.StackToString())\\n\\tnArgs := _pushFuncAndArgs(a, b, ls)\\n\\tls.Call(nArgs, c-1)\\n\\t_popResults(a, c, ls)\\n}\",\n \"func (r *HistoryRunner) Plan(ctx context.Context) error {\\n\\tif len(r.filename) != 0 {\\n\\t\\t// file mode\\n\\t\\treturn r.planFile(ctx, r.filename)\\n\\t}\\n\\n\\t// directory mode\\n\\treturn r.planDir(ctx)\\n}\",\n \"func (vm *VM) opCall(instr []uint16, nextI int) int {\\n\\ta := vm.get(instr[0])\\n\\tvm.stack = append(vm.stack, uint16(nextI)+2)\\n\\t//fmt.Printf(\\\"stack after call: %v\\\\n\\\", vm.stack)\\n\\n\\treturn int(a)\\n}\",\n \"func EvalCall(a, b Attrib) (*AddrCode, error) {\\n\\tentry_ := a.(*AddrCode).Symbol\\n\\tentry, ok := entry_.(*codegen.TargetEntry)\\n\\tvar varEntry *codegen.VariableEntry\\n\\tif !ok {\\n\\t\\tif variable, ok1 := entry_.(*codegen.VariableEntry); ok1 {\\n\\t\\t\\tif t, ok2 := variable.Type().(codegen.FuncType); ok2 {\\n\\t\\t\\t\\tentry = t.Target\\n\\t\\t\\t\\tvarEntry = variable\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn nil, fmt.Errorf(\\\"invalid function call statement\\\")\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"invalid function call statement\\\")\\n\\t\\t}\\n\\t}\\n\\texprList, ok := b.([]*AddrCode)\\n\\tif !ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"unable to type cast %v to []*AddrCode\\\", b)\\n\\t}\\n\\n\\tvar isSystem bool\\n\\n\\tif entry.Target == \\\"printf\\\" || entry.Target == \\\"scanf\\\" {\\n\\t\\tisSystem = true\\n\\t}\\n\\n\\tif !isSystem && len(exprList) != len(entry.InType) {\\n\\t\\treturn nil, fmt.Errorf(\\\"wrong number of arguments in function call. expected %d, got %d\\\", len(entry.InType), len(exprList))\\n\\t}\\n\\tcode := a.(*AddrCode).Code\\n\\tfor i := len(exprList) - 1; i >= 0; i-- {\\n\\t\\tif !isSystem && !SameType(exprList[i].Symbol.Type(), entry.InType[i]) {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"wrong type of argument %d in function call. expected %v, got %v\\\", i, entry.InType[i], exprList[i].Symbol.Type())\\n\\t\\t}\\n\\t\\tif isSystem && i == 0 {\\n\\t\\t\\tif !SameType(exprList[i].Symbol.Type(), stringType) {\\n\\t\\t\\t\\treturn nil, fmt.Errorf(\\\"wrong type of 1st argument in function call. expected %v, got %v\\\", stringType, exprList[i].Symbol.Type())\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tevaluatedExpr := EvalWrapped(exprList[i])\\n\\t\\tcode = append(code, evaluatedExpr.Code...)\\n\\t\\tcode = append(code, codegen.IRIns{\\n\\t\\t\\tTyp: codegen.KEY,\\n\\t\\t\\tOp: codegen.PARAM,\\n\\t\\t\\tArg1: evaluatedExpr.Symbol,\\n\\t\\t})\\n\\t}\\n\\tif varEntry == nil {\\n\\t\\tcode = append(code, codegen.IRIns{\\n\\t\\t\\tTyp: codegen.KEY,\\n\\t\\t\\tOp: codegen.CALL,\\n\\t\\t\\tArg1: entry,\\n\\t\\t})\\n\\t} else {\\n\\t\\tcode = append(code, codegen.IRIns{\\n\\t\\t\\tTyp: codegen.KEY,\\n\\t\\t\\tOp: codegen.CALL,\\n\\t\\t\\tArg1: varEntry,\\n\\t\\t})\\n\\t}\\n\\t// code = append(code, codegen.IRIns{\\n\\t// \\tTyp: codegen.KEY,\\n\\t// \\tOp: codegen.UNALLOC,\\n\\t// \\tArg1: &codegen.LiteralEntry{\\n\\t// \\t\\tValue: len(exprList) * 4,\\n\\t// \\t\\tLType: intType,\\n\\t// \\t},\\n\\t// })\\n\\tentry1 := CreateTemporary(entry.RetType)\\n\\tcode = append(code, entry1.Code...)\\n\\tcode = append(code, codegen.IRIns{\\n\\t\\tTyp: codegen.KEY,\\n\\t\\tOp: codegen.SETRET,\\n\\t\\tArg1: entry1.Symbol,\\n\\t})\\n\\treturn &AddrCode{\\n\\t\\tCode: code,\\n\\t\\tSymbol: entry1.Symbol,\\n\\t}, nil\\n}\",\n \"func (node *CallProc) formatFast(buf *TrackedBuffer) {\\n\\tbuf.WriteString(\\\"call \\\")\\n\\tnode.Name.formatFast(buf)\\n\\tbuf.WriteByte('(')\\n\\tnode.Params.formatFast(buf)\\n\\tbuf.WriteByte(')')\\n}\",\n \"func ResolveCall(ctx *broker.Context, node *specs.Node, call *specs.Call, flow specs.FlowInterface) (err error) {\\n\\tif call.Request != nil {\\n\\t\\terr = ResolveParameterMap(ctx, node, call.Request, flow)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\n\\tif call.Response != nil {\\n\\t\\terr = ResolveParameterMap(ctx, node, call.Response, flow)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (c *Context) CALL(r operand.Op) {\\n\\tc.addinstruction(x86.CALL(r))\\n}\",\n \"func call(context *Context) {\\n context.cpu.sp++\\n context.stack[context.cpu.sp] = context.cpu.pc\\n context.cpu.pc = context.opcode & 0x0FFF\\n}\",\n \"func (dsp *distSQLPlanner) PlanAndRun(\\n\\tctx context.Context, txn *client.Txn, tree planNode, recv *distSQLReceiver,\\n) error {\\n\\t// Trigger limit propagation.\\n\\ttree.SetLimitHint(math.MaxInt64, true)\\n\\n\\tplanCtx := planningCtx{\\n\\t\\tctx: ctx,\\n\\t\\tspanIter: dsp.spanResolver.NewSpanResolverIterator(),\\n\\t\\tnodeAddresses: make(map[roachpb.NodeID]string),\\n\\t}\\n\\tthisNodeID := dsp.nodeDesc.NodeID\\n\\tplanCtx.nodeAddresses[thisNodeID] = dsp.nodeDesc.Address.String()\\n\\n\\tplan, err := dsp.createPlanForNode(&planCtx, tree)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\t// If we don't already have a single result router on this node, add a final\\n\\t// stage.\\n\\tif len(plan.resultRouters) != 1 ||\\n\\t\\tplan.processors[plan.resultRouters[0]].node != thisNodeID {\\n\\t\\tdsp.addSingleGroupStage(\\n\\t\\t\\t&plan, thisNodeID, distsql.ProcessorCoreUnion{Noop: &distsql.NoopCoreSpec{}},\\n\\t\\t)\\n\\t\\tif len(plan.resultRouters) != 1 {\\n\\t\\t\\tpanic(fmt.Sprintf(\\\"%d results after single group stage\\\", len(plan.resultRouters)))\\n\\t\\t}\\n\\t}\\n\\n\\t// Set up the endpoints for p.streams.\\n\\tdsp.populateEndpoints(&planCtx, &plan)\\n\\n\\t// Set up the endpoint for the final result.\\n\\tfinalOut := &plan.processors[plan.resultRouters[0]].spec.Output[0]\\n\\tfinalOut.Streams = append(finalOut.Streams, distsql.StreamEndpointSpec{\\n\\t\\tType: distsql.StreamEndpointSpec_SYNC_RESPONSE,\\n\\t})\\n\\n\\trecv.resultToStreamColMap = plan.planToStreamColMap\\n\\n\\t// Split the processors by nodeID to create the FlowSpecs.\\n\\tflowID := distsql.FlowID{UUID: uuid.MakeV4()}\\n\\tnodeIDMap := make(map[roachpb.NodeID]int)\\n\\t// nodeAddresses contains addresses for the nodes that were referenced during\\n\\t// planning, so we're likely going to have this many nodes (and we have one\\n\\t// flow per node).\\n\\tnodeIDs := make([]roachpb.NodeID, 0, len(planCtx.nodeAddresses))\\n\\tflows := make([]distsql.FlowSpec, 0, len(planCtx.nodeAddresses))\\n\\n\\tfor _, p := range plan.processors {\\n\\t\\tidx, ok := nodeIDMap[p.node]\\n\\t\\tif !ok {\\n\\t\\t\\tflow := distsql.FlowSpec{FlowID: flowID}\\n\\t\\t\\tidx = len(flows)\\n\\t\\t\\tflows = append(flows, flow)\\n\\t\\t\\tnodeIDs = append(nodeIDs, p.node)\\n\\t\\t\\tnodeIDMap[p.node] = idx\\n\\t\\t}\\n\\t\\tflows[idx].Processors = append(flows[idx].Processors, p.spec)\\n\\t}\\n\\n\\tif logPlanDiagram {\\n\\t\\tnodeNames := make([]string, len(nodeIDs))\\n\\t\\tfor i, n := range nodeIDs {\\n\\t\\t\\tnodeNames[i] = n.String()\\n\\t\\t}\\n\\n\\t\\tvar buf bytes.Buffer\\n\\t\\tif err := distsql.GeneratePlanDiagram(flows, nodeNames, &buf); err != nil {\\n\\t\\t\\tlog.Infof(ctx, \\\"Error generating diagram: %s\\\", err)\\n\\t\\t} else {\\n\\t\\t\\tlog.Infof(ctx, \\\"Plan diagram JSON:\\\\n%s\\\", buf.String())\\n\\t\\t}\\n\\t}\\n\\n\\t// Start the flows on all other nodes.\\n\\tfor i, nodeID := range nodeIDs {\\n\\t\\tif nodeID == thisNodeID {\\n\\t\\t\\t// Skip this node.\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\treq := distsql.SetupFlowRequest{\\n\\t\\t\\tTxn: txn.Proto,\\n\\t\\t\\tFlow: flows[i],\\n\\t\\t}\\n\\t\\tif err := distsql.SetFlowRequestTrace(ctx, &req); err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tconn, err := dsp.rpcContext.GRPCDial(planCtx.nodeAddresses[nodeID])\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tclient := distsql.NewDistSQLClient(conn)\\n\\t\\t// TODO(radu): we are not waiting for the flows to complete, but we are\\n\\t\\t// still waiting for a round trip; we should start the flows in parallel, at\\n\\t\\t// least if there are enough of them.\\n\\t\\tif resp, err := client.SetupFlow(context.Background(), &req); err != nil {\\n\\t\\t\\treturn err\\n\\t\\t} else if resp.Error != nil {\\n\\t\\t\\treturn resp.Error.GoError()\\n\\t\\t}\\n\\t}\\n\\tlocalReq := distsql.SetupFlowRequest{\\n\\t\\tTxn: txn.Proto,\\n\\t\\tFlow: flows[nodeIDMap[thisNodeID]],\\n\\t}\\n\\tif err := distsql.SetFlowRequestTrace(ctx, &localReq); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tflow, err := dsp.distSQLSrv.SetupSyncFlow(ctx, &localReq, recv)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\t// TODO(radu): this should go through the flow scheduler.\\n\\tflow.Start(func() {})\\n\\tflow.Wait()\\n\\tflow.Cleanup()\\n\\n\\treturn nil\\n}\",\n \"func (r *HistoryRunner) planFile(ctx context.Context, filename string) error {\\n\\tif r.hc.AlreadyApplied(filename) {\\n\\t\\treturn fmt.Errorf(\\\"a migration has already been applied: %s\\\", filename)\\n\\t}\\n\\n\\tfr, err := NewFileRunner(filename, r.config, r.option)\\n\\tif err != nil {\\n\\t\\tlog.Printf(\\\"[ERROR] [runner] failed to plan: %s\\\\n\\\", filename)\\n\\t\\treturn err\\n\\t}\\n\\n\\treturn fr.Plan(ctx)\\n}\",\n \"func (e *executor) call(fn func() error, format string, args ...interface{}) error {\\n\\treturn e.function(e.opts, fn, format, args...)\\n}\",\n \"func (p *Planner) planField(e *Executor, f *Field) (processor, error) {\\n\\treturn p.planExpr(e, f.Expr)\\n}\",\n \"func TraceCall_(trace interface{}) {}\",\n \"func makeCall(method string, params ...interface{}) methodCall {\\n\\tvar r methodCall\\n\\tr.Method = method\\n\\tr.Params = makeParams(params...)\\n\\treturn r\\n}\",\n \"func (g *irgen) callExpr(pos src.XPos, typ *types.Type, fun ir.Node, args []ir.Node, dots bool) ir.Node {\\n\\tn := ir.NewCallExpr(pos, ir.OCALL, fun, args)\\n\\tn.IsDDD = dots\\n\\ttyped(typ, n)\\n\\n\\tif fun.Op() == ir.OTYPE {\\n\\t\\t// Actually a type conversion, not a function call.\\n\\t\\tif !g.delayTransform() {\\n\\t\\t\\treturn transformConvCall(n)\\n\\t\\t}\\n\\t\\treturn n\\n\\t}\\n\\n\\tif fun, ok := fun.(*ir.Name); ok && fun.BuiltinOp != 0 {\\n\\t\\tif !g.delayTransform() {\\n\\t\\t\\treturn transformBuiltin(n)\\n\\t\\t}\\n\\t\\treturn n\\n\\t}\\n\\n\\t// Add information, now that we know that fun is actually being called.\\n\\tswitch fun := fun.(type) {\\n\\tcase *ir.SelectorExpr:\\n\\t\\tif fun.Op() == ir.OMETHVALUE {\\n\\t\\t\\top := ir.ODOTMETH\\n\\t\\t\\tif fun.X.Type().IsInterface() {\\n\\t\\t\\t\\top = ir.ODOTINTER\\n\\t\\t\\t}\\n\\t\\t\\tfun.SetOp(op)\\n\\t\\t\\t// Set the type to include the receiver, since that's what\\n\\t\\t\\t// later parts of the compiler expect\\n\\t\\t\\tfun.SetType(fun.Selection.Type)\\n\\t\\t}\\n\\t}\\n\\n\\t// A function instantiation (even if fully concrete) shouldn't be\\n\\t// transformed yet, because we need to add the dictionary during the\\n\\t// transformation.\\n\\tif fun.Op() != ir.OFUNCINST && !g.delayTransform() {\\n\\t\\ttransformCall(n)\\n\\t}\\n\\treturn n\\n}\",\n \"func (t *Translator) translateCallStatement(stmt *vm_ast.CallStatement) []string {\\n\\tkeyString := generateUuidForIdent()\\n\\treturnAddressLabel := \\\"return_to_\\\" + keyString\\n\\n\\t// push return address\\n\\tresult := []string{\\n\\t\\t\\\"@\\\" + returnAddressLabel,\\n\\t\\t\\\"D=A;\\\",\\n\\t}\\n\\tresult = append(result, t.pushDregStatements()...)\\n\\n\\t// push current LCL\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@LCL\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t}...)\\n\\tresult = append(result, t.pushDregStatements()...)\\n\\n\\t// push current ARG\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@ARG\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t}...)\\n\\tresult = append(result, t.pushDregStatements()...)\\n\\n\\t// push current THIS\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@THIS\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t}...)\\n\\tresult = append(result, t.pushDregStatements()...)\\n\\n\\t// push current THAT\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@THAT\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t}...)\\n\\tresult = append(result, t.pushDregStatements()...)\\n\\n\\t// ARG = SP - stmt.LocalNum.Literal - 5\\n\\tresult = append(result, []string{\\n\\t\\t// save current M[SP] in M[R5]\\n\\t\\t\\\"@SP\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t\\t\\\"@R5\\\",\\n\\t\\t\\\"M=D;\\\",\\n\\t}...)\\n\\tcalcM := []string{}\\n\\tswitch stmt.ArgNum.Type {\\n\\tcase vm_tokenizer.IDENT:\\n\\t\\tcalcM = []string{\\n\\t\\t\\t\\\"@\\\" + stmt.ArgNum.Literal,\\n\\t\\t\\t\\\"D=M;\\\",\\n\\t\\t\\t\\\"@R5\\\",\\n\\t\\t\\t\\\"M=M-D;\\\",\\n\\t\\t}\\n\\tcase vm_tokenizer.INT:\\n\\t\\tcalcM = []string{\\n\\t\\t\\t\\\"@\\\" + stmt.ArgNum.Literal,\\n\\t\\t\\t\\\"D=A;\\\",\\n\\t\\t\\t\\\"@R5\\\",\\n\\t\\t\\t\\\"M=M-D;\\\",\\n\\t\\t}\\n\\tdefault:\\n\\t\\tlog.Fatalf(\\\"unexpected token type\\\")\\n\\t}\\n\\tresult = append(result, calcM...)\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@5\\\",\\n\\t\\t\\\"D=A;\\\",\\n\\t\\t\\\"@R5\\\",\\n\\t\\t\\\"M=M-D;\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t\\t\\\"@ARG\\\",\\n\\t\\t\\\"M=D;\\\",\\n\\t}...)\\n\\n\\t// LCL = SP\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@SP\\\",\\n\\t\\t\\\"D=M;\\\",\\n\\t\\t\\\"@LCL\\\",\\n\\t\\t\\\"M=D;\\\",\\n\\t}...)\\n\\n\\tresult = append(result, []string{\\n\\t\\t\\\"@\\\" + getFunctionLabel(stmt.Name.Literal),\\n\\t\\t\\\"0;JMP\\\",\\n\\t\\t\\\"(return_to_\\\" + keyString + \\\")\\\",\\n\\t}...)\\n\\n\\treturn result\\n}\",\n \"func (m *JobExecutor) WalkPlan(p plan.Task) (Task, error) {\\n\\tswitch p := p.(type) {\\n\\tcase *plan.PreparedStatement:\\n\\t\\treturn m.Executor.WalkPreparedStatement(p)\\n\\tcase *plan.Select:\\n\\t\\tif p.Ctx != nil && p.IsSchemaQuery() {\\n\\t\\t\\tif p.Ctx.Schema != nil && p.Ctx.Schema.InfoSchema != nil {\\n\\t\\t\\t\\tp.Ctx.Schema = p.Ctx.Schema.InfoSchema\\n\\t\\t\\t}\\n\\t\\t\\tp.Stmt.SetSystemQry()\\n\\t\\t}\\n\\t\\treturn m.Executor.WalkSelect(p)\\n\\tcase *plan.Upsert:\\n\\t\\treturn m.Executor.WalkUpsert(p)\\n\\tcase *plan.Insert:\\n\\t\\treturn m.Executor.WalkInsert(p)\\n\\tcase *plan.Update:\\n\\t\\treturn m.Executor.WalkUpdate(p)\\n\\tcase *plan.Delete:\\n\\t\\treturn m.Executor.WalkDelete(p)\\n\\tcase *plan.Command:\\n\\t\\treturn m.Executor.WalkCommand(p)\\n\\n\\t// DDL\\n\\tcase *plan.Create:\\n\\t\\treturn m.Executor.WalkCreate(p)\\n\\tcase *plan.Drop:\\n\\t\\treturn m.Executor.WalkDrop(p)\\n\\tcase *plan.Alter:\\n\\t\\treturn m.Executor.WalkAlter(p)\\n\\t}\\n\\tpanic(fmt.Sprintf(\\\"Not implemented for %T\\\", p))\\n}\",\n \"func rcCallFunc(p *TCompiler, code *TCode) (*value.Value, error) {\\n\\tres, err := p.runCallFunc(code)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tp.regSet(code.A, res)\\n\\t// println(\\\"call=\\\", res.ToString())\\n\\tp.moveNext()\\n\\treturn res, nil\\n}\",\n \"func TraceCall(log logr.Logger) {\\n\\tcallerInfo := GetCaller(MyCaller, true)\\n\\tlog.V(TraceLevel).Info(\\\"Entering function\\\", \\\"function\\\", callerInfo.FunctionName, \\\"source\\\", callerInfo.SourceFile, \\\"line\\\", callerInfo.SourceLine)\\n}\",\n \"func (p *callgrindProfiler) incrementCallRef(name string, loc *token.Location) *callRef {\\n\\tp.Lock()\\n\\tdefer p.Unlock()\\n\\tthread := &([]int32{1}[0])\\n\\tframeRef := new(callRef)\\n\\tframeRef.name = name\\n\\tframeRef.children = make([]*callRef, 0)\\n\\tif loc != nil {\\n\\t\\tframeRef.file = loc.File\\n\\t\\tframeRef.line = loc.Line\\n\\t}\\n\\tif current, ok := p.callRefs[*thread]; ok && current != nil {\\n\\t\\tframeRef.prev = current\\n\\t\\tframeRef.prev.children = append(frameRef.prev.children, frameRef)\\n\\t}\\n\\tms := &runtime.MemStats{}\\n\\truntime.ReadMemStats(ms)\\n\\tframeRef.startMemory = ms.TotalAlloc\\n\\tframeRef.start = time.Now()\\n\\tp.callRefs[*thread] = frameRef\\n\\treturn frameRef\\n}\",\n \"func (s *BasePlSqlParserListener) EnterCall_spec(ctx *Call_specContext) {}\",\n \"func (cm GoPlanner) Plan(queryRequest *plannerpb.QueryRequest) (*distributedpb.LogicalPlannerResult, error) {\\n\\tvar resultLen C.int\\n\\tqueryRequestBytes, err := proto.Marshal(queryRequest)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tqueryRequestData := C.CBytes(queryRequestBytes)\\n\\tdefer C.free(queryRequestData)\\n\\n\\tres := C.PlannerPlan(cm.planner, (*C.char)(queryRequestData), C.int(len(queryRequestBytes)), &resultLen)\\n\\tdefer C.StrFree(res)\\n\\tlp := C.GoBytes(unsafe.Pointer(res), resultLen)\\n\\tif resultLen == 0 {\\n\\t\\treturn nil, errors.New(\\\"no result returned\\\")\\n\\t}\\n\\n\\tplan := &distributedpb.LogicalPlannerResult{}\\n\\tif err := proto.Unmarshal(lp, plan); err != nil {\\n\\t\\treturn plan, fmt.Errorf(\\\"error: '%s'; string: '%s'\\\", err, string(lp))\\n\\t}\\n\\treturn plan, nil\\n}\",\n \"func newCall(name string) *Instruction {\\n\\treturn &Instruction{\\n\\t\\tType: CallInst,\\n\\t\\tName: name,\\n\\t}\\n}\",\n \"func (vm *VM) NewCall(sender, actor Interface, msg *Message, target, context Interface) *Call {\\n\\treturn &Call{\\n\\t\\tObject: *vm.CoreInstance(\\\"Call\\\"),\\n\\t\\tSender: sender,\\n\\t\\tActivated: actor,\\n\\t\\tMsg: msg,\\n\\t\\tTarget: target,\\n\\t\\tContext: context,\\n\\t\\tCoroutine: vm,\\n\\t}\\n}\",\n \"func BenchmarkCaller(b *testing.B) {\\n\\tbenchmarks := []struct {\\n\\t\\tname string\\n\\t\\tcaller func() CallerInfo\\n\\t}{\\n\\t\\t{\\\"direct caller\\\", callerA},\\n\\t\\t{\\\"chain caller\\\", callerB},\\n\\t\\t{\\\"lambda caller\\\", callerC},\\n\\t}\\n\\tfor _, bm := range benchmarks {\\n\\t\\ttc := bm\\n\\t\\tb.Run(bm.name, func(b *testing.B) {\\n\\t\\t\\tb.ReportAllocs()\\n\\t\\t\\tfor i := 0; i < b.N; i++ {\\n\\t\\t\\t\\t_ = tc.caller()\\n\\t\\t\\t}\\n\\t\\t})\\n\\t}\\n}\",\n \"func (e FunctionCallExpression) Visit(env Environment) Value {\\n\\treturn NoneValue()\\n}\",\n \"func call(ctx context.Context, req *pulumirpc.CallRequest, engineConn *grpc.ClientConn,\\n\\tcallF callFunc) (*pulumirpc.CallResponse, error) {\\n\\n\\t// Configure the RunInfo.\\n\\trunInfo := RunInfo{\\n\\t\\tProject: req.GetProject(),\\n\\t\\tStack: req.GetStack(),\\n\\t\\tConfig: req.GetConfig(),\\n\\t\\tParallel: int(req.GetParallel()),\\n\\t\\tDryRun: req.GetDryRun(),\\n\\t\\tMonitorAddr: req.GetMonitorEndpoint(),\\n\\t\\tengineConn: engineConn,\\n\\t}\\n\\tpulumiCtx, err := NewContext(ctx, runInfo)\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrap(err, \\\"constructing run context\\\")\\n\\t}\\n\\n\\t// Deserialize the inputs and apply appropriate dependencies.\\n\\targDependencies := req.GetArgDependencies()\\n\\tdeserializedArgs, err := plugin.UnmarshalProperties(\\n\\t\\treq.GetArgs(),\\n\\t\\tplugin.MarshalOptions{KeepSecrets: true, KeepResources: true, KeepUnknowns: req.GetDryRun()},\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrap(err, \\\"unmarshaling inputs\\\")\\n\\t}\\n\\targs := make(map[string]interface{}, len(deserializedArgs))\\n\\tfor key, value := range deserializedArgs {\\n\\t\\tk := string(key)\\n\\t\\tvar deps []Resource\\n\\t\\tif inputDeps, ok := argDependencies[k]; ok {\\n\\t\\t\\tdeps = make([]Resource, len(inputDeps.GetUrns()))\\n\\t\\t\\tfor i, depURN := range inputDeps.GetUrns() {\\n\\t\\t\\t\\tdeps[i] = pulumiCtx.newDependencyResource(URN(depURN))\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\targs[k] = &constructInput{\\n\\t\\t\\tvalue: value,\\n\\t\\t\\tdeps: deps,\\n\\t\\t}\\n\\t}\\n\\n\\tresult, err := callF(pulumiCtx, req.GetTok(), args)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// Wait for async work to finish.\\n\\tif err = pulumiCtx.wait(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// Serialize all result properties, first by awaiting them, and then marshaling them to the requisite gRPC values.\\n\\tresolvedProps, propertyDeps, _, err := marshalInputs(result)\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrap(err, \\\"marshaling properties\\\")\\n\\t}\\n\\n\\t// Marshal all properties for the RPC call.\\n\\tkeepUnknowns := req.GetDryRun()\\n\\trpcProps, err := plugin.MarshalProperties(\\n\\t\\tresolvedProps,\\n\\t\\tplugin.MarshalOptions{KeepSecrets: true, KeepUnknowns: keepUnknowns, KeepResources: pulumiCtx.keepResources})\\n\\tif err != nil {\\n\\t\\treturn nil, errors.Wrap(err, \\\"marshaling properties\\\")\\n\\t}\\n\\n\\t// Convert the property dependencies map for RPC and remove duplicates.\\n\\trpcPropertyDeps := make(map[string]*pulumirpc.CallResponse_ReturnDependencies)\\n\\tfor k, deps := range propertyDeps {\\n\\t\\tsort.Slice(deps, func(i, j int) bool { return deps[i] < deps[j] })\\n\\n\\t\\turns := make([]string, 0, len(deps))\\n\\t\\tfor i, d := range deps {\\n\\t\\t\\tif i > 0 && urns[i-1] == string(d) {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\turns = append(urns, string(d))\\n\\t\\t}\\n\\n\\t\\trpcPropertyDeps[k] = &pulumirpc.CallResponse_ReturnDependencies{\\n\\t\\t\\tUrns: urns,\\n\\t\\t}\\n\\t}\\n\\n\\treturn &pulumirpc.CallResponse{\\n\\t\\tReturn: rpcProps,\\n\\t\\tReturnDependencies: rpcPropertyDeps,\\n\\t}, nil\\n}\",\n \"func (e *Payments) Call(ctx context.Context, req *payments.Request, rsp *payments.Response) error {\\n\\tlog.Log(\\\"Received Payments.Call request\\\")\\n\\trsp.Msg = \\\"Hello \\\" + req.Name\\n\\treturn nil\\n}\",\n \"func (client *Client) call(serviceMethod string, args interface{}, reply interface{}, done chan *Call, expiration uint64) *Call {\\n\\tcall := new(Call)\\n\\tcall.ServiceMethod = serviceMethod\\n\\tcall.Args = args\\n\\tcall.Reply = reply\\n\\tif done == nil {\\n\\t\\tdone = make(chan *Call, 10) // buffered.\\n\\t} else {\\n\\t\\tif cap(done) == 0 {\\n\\t\\t\\tlog.Panic(\\\"rpc: done channel is unbuffered\\\")\\n\\t\\t}\\n\\t}\\n\\tcall.Done = done\\n\\tclient.send(call, expiration)\\n\\treturn call\\n}\",\n \"func (parser *Parser) callFunc(id string) (*FunctionCall, error) {\\n\\tparser.trace(\\\"CALL_FUNC\\\")\\n\\tdefer parser.untrace()\\n\\t_, err, found := parser.match(fxsymbols.LeftPar)\\n\\tif err != nil {\\n\\t\\t// return ErrSyntax\\n\\t\\treturn nil, err\\n\\t}\\n\\tif !found {\\n\\t\\treturn nil, ErrNoMatch\\n\\t}\\n\\targs, err := parser.args()\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif _, _, found = parser.match(fxsymbols.RightPar); !found {\\n\\t\\treturn nil, parser.Errorf(ErrNoRightPar)\\n\\t}\\n\\tif _, _, found = parser.match(fxsymbols.Scol); !found {\\n\\t\\treturn nil, parser.Errorf(ErrNoScol)\\n\\t}\\n\\treturn NewFuncCall(id, args), nil\\n}\",\n \"func (c *Collection) Plan(op controller.Operation,\\n\\tspec types.Spec) (object *types.Object, plan *controller.Plan, err error) {\\n\\n\\terr = c.readTxn(func() error {\\n\\n\\t\\tlog.Debug(\\\"Plan\\\", \\\"op\\\", op, \\\"spec\\\", spec, \\\"V\\\", debugV)\\n\\n\\t\\tobject, err = c.object()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\tif c.PlanFunc == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\n\\t\\tif p, e := c.PlanFunc(op, spec); e == nil {\\n\\t\\t\\tplan = &p\\n\\t\\t} else {\\n\\t\\t\\terr = e\\n\\t\\t}\\n\\n\\t\\treturn err\\n\\t})\\n\\treturn\\n}\",\n \"func callFn(name string, unit reflect.Value, args []reflect.Value) error {\\n\\tif fn := unit.MethodByName(name); fn.IsValid() == false {\\n\\t\\treturn nil\\n\\t} else if ret := fn.Call(args); len(ret) != 1 {\\n\\t\\treturn nil\\n\\t} else if err, ok := ret[0].Interface().(error); ok {\\n\\t\\treturn err\\n\\t} else if err == nil {\\n\\t\\treturn nil\\n\\t} else {\\n\\t\\treturn gopi.ErrBadParameter.WithPrefix(name)\\n\\t}\\n}\",\n \"func Call(f func()) {\\n\\tcheckRun()\\n\\tdone := make(chan struct{})\\n\\tcallQueue <- func() {\\n\\t\\tf()\\n\\t\\tdone <- struct{}{}\\n\\t}\\n\\t<-done\\n}\",\n \"func (p *parser) VisitMemberCall(ctx *gen.MemberCallContext) any {\\n\\toperand := p.Visit(ctx.Member()).(*exprpb.Expr)\\n\\t// Handle the error case where no valid identifier is specified.\\n\\tif ctx.GetId() == nil {\\n\\t\\treturn p.helper.newExpr(ctx)\\n\\t}\\n\\tid := ctx.GetId().GetText()\\n\\topID := p.helper.id(ctx.GetOpen())\\n\\treturn p.receiverCallOrMacro(opID, id, operand, p.visitExprList(ctx.GetArgs())...)\\n}\",\n \"func newCallNode(args []Node) Node {\\n\\tif len(args) > 0 {\\n\\t\\treturn CallNode{NodeType: NodeCall, Callee: args[0], Args: args[1:]}\\n\\t} else {\\n\\t\\treturn nilNode\\n\\t}\\n}\",\n \"func TraceCall(trace interface{}) {\\n\\tTraceCaller = true\\n\\tdefer SetTraceCaller(false)\\n\\tTrace(trace)\\n}\",\n \"func (mr *MockIApiMockRecorder) CreatePlan(arg0 interface{}) *gomock.Call {\\n\\tmr.mock.ctrl.T.Helper()\\n\\treturn mr.mock.ctrl.RecordCallWithMethodType(mr.mock, \\\"CreatePlan\\\", reflect.TypeOf((*MockIApi)(nil).CreatePlan), arg0)\\n}\",\n \"func newCallNode(args []Node) Node {\\n\\tif len(args) > 0 {\\n\\t\\treturn &CallNode{NodeType: NodeCall, Callee: args[0], Args: args[1:]}\\n\\t} else {\\n\\t\\treturn nilNode\\n\\t}\\n}\",\n \"func call(method string, argsArray []string) {\\n\\tfmt.Println(\\\"------ start ------ \\\", method)\\n\\t// all args\\n\\tvar args [][]byte\\n\\targs = append(args, []byte(method))\\n\\tfmt.Printf(\\\"- args=[\\\")\\n\\tfmt.Printf(\\\"p0=%s\\\", method)\\n\\tif argsArray != nil {\\n\\t\\tfor i := 0; i < len(argsArray); i++ {\\n\\t\\t\\targs = append(args, []byte(argsArray[i]))\\n\\t\\t\\tfmt.Printf(\\\",p%d=%s\\\", i+1, argsArray[i])\\n\\t\\t}\\n\\t}\\n\\tfmt.Printf(\\\"]\\\")\\n\\tfmt.Println(\\\"\\\")\\n\\t// invoke\\n\\tresponse := stub.MockInvoke(\\\"uuid\\\", args)\\n\\tfmt.Printf(\\\"- status=\\\")\\n\\tfmt.Println(response.GetStatus())\\n\\tfmt.Printf(\\\"- error message=\\\")\\n\\tfmt.Println(response.GetMessage())\\n\\tfmt.Printf(\\\"- payload=\\\")\\n\\tfmt.Println(string(response.GetPayload()))\\n\\tfmt.Println(\\\"------ end ------ \\\")\\n\\tfmt.Println(\\\"\\\")\\n}\",\n \"func (k Querier) Plan(c context.Context, req *types.QueryPlanRequest) (*types.QueryPlanResponse, error) {\\n\\tif req == nil {\\n\\t\\treturn nil, status.Error(codes.InvalidArgument, \\\"invalid request\\\")\\n\\t}\\n\\n\\tctx := sdk.UnwrapSDKContext(c)\\n\\tplan, found := k.GetPlan(ctx, req.PlanId)\\n\\tif !found {\\n\\t\\treturn nil, status.Errorf(codes.NotFound, \\\"plan %d not found\\\", req.PlanId)\\n\\t}\\n\\n\\tany, err := codectypes.NewAnyWithValue(plan)\\n\\tif err != nil {\\n\\t\\treturn nil, status.Error(codes.Internal, err.Error())\\n\\t}\\n\\n\\treturn &types.QueryPlanResponse{Plan: any}, nil\\n}\",\n \"func (self *journeyPlanner) planTrip(from flap.ICAOCode, to flap.ICAOCode, length flap.Days, pp flap.Passport, startOfDay flap.EpochTime, fe *flap.Engine) error {\\n\\tlogDebug(\\\"planTrip for: \\\", pp.ToString(), \\\" starting \\\", startOfDay.ToTime())\\n\\tf,err := self.buildFlight(from,to,startOfDay,fe)\\n\\tif (err != nil) {\\n\\t\\treturn err\\n\\t}\\n\\tj:= journey{jt:jtOutbound,flight:*f,length:length}\\n\\treturn self.addJourney(pp,j)\\n}\",\n \"func (r *SubscriptionsService) ChangePlan(customerId string, subscriptionId string, changeplanrequest *ChangePlanRequest) *SubscriptionsChangePlanCall {\\n\\treturn &SubscriptionsChangePlanCall{\\n\\t\\ts: r.s,\\n\\t\\tcustomerId: customerId,\\n\\t\\tsubscriptionId: subscriptionId,\\n\\t\\tchangeplanrequest: changeplanrequest,\\n\\t\\tcaller_: googleapi.JSONCall{},\\n\\t\\tparams_: make(map[string][]string),\\n\\t\\tpathTemplate_: \\\"customers/{customerId}/subscriptions/{subscriptionId}/changePlan\\\",\\n\\t\\tcontext_: googleapi.NoContext,\\n\\t}\\n}\",\n \"func (mock *ProcessorPipelineMock) TransformCalls() []struct {\\n\\tIn1 image.Image\\n} {\\n\\tvar calls []struct {\\n\\t\\tIn1 image.Image\\n\\t}\\n\\tlockProcessorPipelineMockTransform.RLock()\\n\\tcalls = mock.calls.Transform\\n\\tlockProcessorPipelineMockTransform.RUnlock()\\n\\treturn calls\\n}\",\n \"func (l *logicalPlanner) Plan(ctx context.Context, logicalPlan *Spec) (*Spec, error) {\\n\\tnewLogicalPlan, err := l.heuristicPlanner.Plan(ctx, logicalPlan)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// check integrity after planning is complete\\n\\tif !l.disableIntegrityChecks {\\n\\t\\terr := newLogicalPlan.CheckIntegrity()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\n\\treturn newLogicalPlan, nil\\n}\",\n \"func (cli *DockerCli) CmdFuncCall(args ...string) error {\\n\\tcmd := Cli.Subcmd(\\\"func call\\\", []string{\\\"NAME\\\"}, \\\"Call a function\\\", false)\\n\\tsync := cmd.Bool([]string{\\\"-sync\\\"}, false, \\\"Block until the call is completed\\\")\\n\\n\\tcmd.Require(flag.Exact, 1)\\n\\tif err := cmd.ParseFlags(args, true); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tname := cmd.Arg(0)\\n\\tname = strings.Replace(name, \\\"/\\\", \\\"\\\", -1)\\n\\n\\tvar stdin io.Reader\\n\\tif fi, err := os.Stdin.Stat(); err == nil {\\n\\t\\tif fi.Mode()&os.ModeNamedPipe != 0 {\\n\\t\\t\\tstdin = bufio.NewReader(os.Stdin)\\n\\t\\t}\\n\\t}\\n\\n\\tbody, err := cli.client.FuncCall(context.Background(), cli.region, name, stdin, *sync)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tdefer body.Close()\\n\\n\\tif *sync {\\n\\t\\t_, err = io.Copy(cli.out, body)\\n\\t\\treturn err\\n\\t}\\n\\n\\tvar ret types.FuncCallResponse\\n\\terr = json.NewDecoder(body).Decode(&ret)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tfmt.Fprintf(cli.out, \\\"CallId: %s\\\\n\\\", ret.CallId)\\n\\n\\treturn nil\\n}\",\n \"func (a *api) Call(name string, args ...interface{}) {\\n\\tformat := a.Name(name) + \\\"(%s\\\" + strings.Repeat(\\\", %s\\\", len(args)-1) + \\\")\\\"\\n\\ta.Linef(format, args...)\\n}\",\n \"func (e *MockExecutor) addCall(target **MockExecutorCall, call MockExecutorCall) {\\n\\te.Calls = append(e.Calls, call)\\n\\tif target != nil {\\n\\t\\t*target = &call\\n\\t}\\n}\",\n \"func (s *BasePlSqlParserListener) EnterProcedure_call(ctx *Procedure_callContext) {}\",\n \"func (n Node) Call(args ...interface{}) Node {\\n\\treturn Call(n, args...)\\n}\",\n \"func (p *tsdbBasedPlanner) Plan(_ context.Context, metasByMinTime []*metadata.Meta, _ chan error, _ any) ([]*metadata.Meta, error) {\\n\\treturn p.plan(p.noCompBlocksFunc(), metasByMinTime)\\n}\",\n \"func (_DelegateProfile *DelegateProfileCallerRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\\n\\treturn _DelegateProfile.Contract.contract.Call(opts, result, method, params...)\\n}\",\n \"func (n *Node) QueueCall(ctx context.Context, expectedEpochNumber epochtime.EpochTime, call []byte) error {\\n\\t// Check if we are a leader. Note that we may be in the middle of a\\n\\t// transition, but this shouldn't matter as the client will retry.\\n\\tepochSnapshot := n.commonNode.Group.GetEpochSnapshot()\\n\\tif !epochSnapshot.IsTransactionSchedulerLeader() {\\n\\t\\treturn api.ErrNotLeader\\n\\t}\\n\\t// Check if expected client's epoch matches the current worker's one.\\n\\tif epochSnapshot.GetEpochNumber() != expectedEpochNumber {\\n\\t\\tn.logger.Error(\\\"unable to QueueCall\\\",\\n\\t\\t\\t\\\"err\\\", api.ErrEpochNumberMismatch,\\n\\t\\t\\t\\\"current_epoch_number\\\", epochSnapshot.GetEpochNumber(),\\n\\t\\t\\t\\\"expected_epoch_number\\\", expectedEpochNumber,\\n\\t\\t)\\n\\t\\treturn api.ErrEpochNumberMismatch\\n\\t}\\n\\n\\tif n.checkTxEnabled {\\n\\t\\t// Check transaction before queuing it.\\n\\t\\tif err := n.CheckTx(ctx, call); err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tn.logger.Debug(\\\"worker CheckTx successful, queuing transaction\\\")\\n\\t}\\n\\n\\tn.algorithmMutex.RLock()\\n\\tdefer n.algorithmMutex.RUnlock()\\n\\n\\tif n.algorithm == nil || !n.algorithm.IsInitialized() {\\n\\t\\treturn api.ErrNotReady\\n\\t}\\n\\tif err := n.algorithm.ScheduleTx(call); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tincomingQueueSize.With(n.getMetricLabels()).Set(float64(n.algorithm.UnscheduledSize()))\\n\\n\\treturn nil\\n}\",\n \"func FollowOperationPlan(ctx context.Context, getPlan GetPlanFunc) <-chan PlanEvent {\\n\\tch := make(chan PlanEvent)\\n\\tgo func() {\\n\\t\\tdefer close(ch)\\n\\t\\t// Send an initial batch of events from the initial state of the plan.\\n\\t\\tplan, err := getPlan()\\n\\t\\tif err == nil {\\n\\t\\t\\terr = sendPlanChanges(ctx, GetPlanProgress(*plan), *plan, ch)\\n\\t\\t\\tif errors.Is(err, errStopUpdates) {\\n\\t\\t\\t\\t// Done\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tticker := backoff.NewTicker(getFollowStepPolicy())\\n\\t\\tdefer ticker.Stop()\\n\\t\\tdefer logrus.Info(\\\"Operation plan watcher done.\\\")\\n\\t\\tfor {\\n\\t\\t\\tselect {\\n\\t\\t\\tcase <-ticker.C:\\n\\t\\t\\t\\tnextPlan, err := getPlan()\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tlogrus.WithError(err).Error(\\\"Failed to reload plan.\\\")\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tchanges, err := diffPlan(plan, *nextPlan)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tlogrus.WithError(err).Error(\\\"Failed to diff plans.\\\")\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\terr = sendPlanChanges(ctx, changes, *nextPlan, ch)\\n\\t\\t\\t\\tif errors.Is(err, errStopUpdates) {\\n\\t\\t\\t\\t\\t// Done\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Update the current plan for comparison on the next cycle and\\n\\t\\t\\t\\t// reset the backoff so the ticker keeps ticking every second\\n\\t\\t\\t\\t// as long as there are no errors.\\n\\t\\t\\t\\tplan = nextPlan\\n\\t\\t\\tcase <-ctx.Done():\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\treturn ch\\n}\",\n \"func main() {\\n call()\\n}\",\n \"func (_e *MockCompactionPlanContext_Expecter) start() *MockCompactionPlanContext_start_Call {\\n\\treturn &MockCompactionPlanContext_start_Call{Call: _e.mock.On(\\\"start\\\")}\\n}\",\n \"func (vm *ChaincodeVM) callFunction(funcnum int, debug Dumper, extraArgs ...Value) (Value, error) {\\n\\tvar retval Value\\n\\tif funcnum <= vm.infunc || funcnum >= len(vm.functions) {\\n\\t\\treturn retval, vm.runtimeError(newRuntimeError(\\\"invalid function number (no recursion allowed)\\\"))\\n\\t}\\n\\n\\tchildvm, err := vm.CreateForFunc(funcnum)\\n\\tif err != nil {\\n\\t\\treturn retval, vm.runtimeError(err)\\n\\t}\\n\\tfor _, e := range extraArgs {\\n\\t\\terr := childvm.stack.Push(e)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn retval, vm.runtimeError(err)\\n\\t\\t}\\n\\t}\\n\\terr = childvm.Run(debug)\\n\\t// no matter what, we want the history\\n\\tvm.history = append(vm.history, childvm.history...)\\n\\tif err != nil {\\n\\t\\treturn retval, vm.runtimeError(err)\\n\\t}\\n\\t// we've called the child function, now get back its return value\\n\\tretval, err = childvm.stack.Pop()\\n\\tif err != nil {\\n\\t\\treturn retval, vm.runtimeError(err)\\n\\t}\\n\\treturn retval, nil\\n}\",\n \"func (fi *funcInfo) emitTailCall(line, a, nArgs int) {\\r\\n\\tfi.emitABC(line, OP_TAILCALL, a, nArgs+1, 0)\\r\\n}\",\n \"func (_Casper *CasperRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\\n\\treturn _Casper.Contract.CasperCaller.contract.Call(opts, result, method, params...)\\n}\",\n \"func Plan(ctx context.Context, input Input) (Output, error) {\\n\\t// create a copy of the cloned repo and run all commands there\\n\\t// wipe out the directory in case Plan has been run previously\\n\\t// but the change command has been edited and you want to run again\\n\\tplanDir := path.Join(input.WorkDir, \\\"planned\\\")\\n\\tif err := os.RemoveAll(planDir); err != nil {\\n\\t\\treturn Output{Success: false}, fmt.Errorf(\\\"could not clear directory %s\\\", planDir)\\n\\t}\\n\\tcmd := exec.CommandContext(ctx, \\\"cp\\\", \\\"-a\\\", \\\"./.\\\", planDir) // \\\"./.\\\" copies all the contents of the current directory into the target directory\\n\\tcmd.Dir = input.RepoDir\\n\\tif output, err := cmd.CombinedOutput(); err != nil {\\n\\t\\treturn Output{Success: false}, errors.New(string(output))\\n\\t}\\n\\n\\t// run the change command, git add, and git commit\\n\\tfor _, cmd := range []Command{\\n\\t\\tinput.Command,\\n\\t\\tCommand{Path: \\\"git\\\", Args: []string{\\\"checkout\\\", \\\"-b\\\", input.BranchName}},\\n\\t\\tCommand{Path: \\\"git\\\", Args: []string{\\\"add\\\", \\\"-A\\\"}},\\n\\t\\tCommand{Path: \\\"git\\\", Args: []string{\\\"commit\\\", \\\"-m\\\", input.CommitMessage}},\\n\\t} {\\n\\t\\texecCmd := exec.CommandContext(ctx, cmd.Path, cmd.Args...)\\n\\t\\texecCmd.Dir = planDir\\n\\t\\t// Set MICROPLANE_<X> convenience env vars, for use in user's script\\n\\t\\texecCmd.Env = append(os.Environ(), fmt.Sprintf(\\\"MICROPLANE_REPO=%s\\\", input.RepoName))\\n\\t\\tif output, err := execCmd.CombinedOutput(); err != nil {\\n\\t\\t\\treturn Output{Success: false}, errors.New(string(output))\\n\\t\\t}\\n\\t}\\n\\n\\t// add the git diff to output, might be useful / convenient?\\n\\tvar gitDiff string\\n\\tgitDiffCmd := exec.CommandContext(ctx, \\\"git\\\", \\\"diff\\\", \\\"HEAD^\\\", \\\"HEAD\\\")\\n\\tgitDiffCmd.Dir = planDir\\n\\toutput, err := gitDiffCmd.CombinedOutput()\\n\\tif err != nil {\\n\\t\\treturn Output{Success: false}, errors.New(string(output))\\n\\t}\\n\\tgitDiff = string(output)\\n\\n\\treturn Output{\\n\\t\\tSuccess: true,\\n\\t\\tPlanDir: planDir,\\n\\t\\tGitDiff: gitDiff,\\n\\t\\tBranchName: input.BranchName,\\n\\t\\tCommitMessage: input.CommitMessage,\\n\\t}, nil\\n}\",\n \"func (_DelegateProfile *DelegateProfileRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\\n\\treturn _DelegateProfile.Contract.DelegateProfileCaller.contract.Call(opts, result, method, params...)\\n}\",\n \"func tForCall(i Instruction, ls *LuaState) {\\n\\ta, _, c := i.ABC()\\n\\ta += 1\\n\\n\\t_pushFuncAndArgs(a, 3, ls)\\n\\tls.Call(2, c)\\n\\t_popResults(a+3, c+1, ls)\\n}\",\n \"func (c *Context) Plan() (*Plan, error) {\\n\\tdefer c.acquireRun(\\\"plan\\\")()\\n\\n\\tp := &Plan{\\n\\t\\tModule: c.module,\\n\\t\\tVars: c.variables,\\n\\t\\tState: c.state,\\n\\t\\tTargets: c.targets,\\n\\n\\t\\tTerraformVersion: version.String(),\\n\\t\\tProviderSHA256s: c.providerSHA256s,\\n\\t}\\n\\n\\tvar operation walkOperation\\n\\tif c.destroy {\\n\\t\\toperation = walkPlanDestroy\\n\\t\\tp.Destroy = true\\n\\t} else {\\n\\t\\t// Set our state to be something temporary. We do this so that\\n\\t\\t// the plan can update a fake state so that variables work, then\\n\\t\\t// we replace it back with our old state.\\n\\t\\told := c.state\\n\\t\\tif old == nil {\\n\\t\\t\\tc.state = &State{}\\n\\t\\t\\tc.state.init()\\n\\t\\t} else {\\n\\t\\t\\tc.state = old.DeepCopy()\\n\\t\\t}\\n\\t\\tdefer func() {\\n\\t\\t\\tc.state = old\\n\\t\\t}()\\n\\n\\t\\toperation = walkPlan\\n\\t}\\n\\n\\t// Setup our diff\\n\\tc.diffLock.Lock()\\n\\tc.diff = new(Diff)\\n\\tc.diff.init()\\n\\tc.diffLock.Unlock()\\n\\n\\t// Build the graph.\\n\\tgraphType := GraphTypePlan\\n\\tif c.destroy {\\n\\t\\tgraphType = GraphTypePlanDestroy\\n\\t}\\n\\tgraph, err := c.Graph(graphType, nil)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// Do the walk\\n\\twalker, err := c.walk(graph, operation)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tp.Diff = c.diff\\n\\n\\t// If this is true, it means we're running unit tests. In this case,\\n\\t// we perform a deep copy just to ensure that all context tests also\\n\\t// test that a diff is copy-able. This will panic if it fails. This\\n\\t// is enabled during unit tests.\\n\\t//\\n\\t// This should never be true during production usage, but even if it is,\\n\\t// it can't do any real harm.\\n\\tif contextTestDeepCopyOnPlan {\\n\\t\\tp.Diff.DeepCopy()\\n\\t}\\n\\n\\t/*\\n\\t\\t// We don't do the reverification during the new destroy plan because\\n\\t\\t// it will use a different apply process.\\n\\t\\tif X_legacyGraph {\\n\\t\\t\\t// Now that we have a diff, we can build the exact graph that Apply will use\\n\\t\\t\\t// and catch any possible cycles during the Plan phase.\\n\\t\\t\\tif _, err := c.Graph(GraphTypeLegacy, nil); err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t*/\\n\\n\\tvar errs error\\n\\tif len(walker.ValidationErrors) > 0 {\\n\\t\\terrs = multierror.Append(errs, walker.ValidationErrors...)\\n\\t}\\n\\treturn p, errs\\n}\",\n \"func (m Function) Call(params ...jen.Code) jen.Code {\\n\\treturn m.qual.Clone().Call(params...)\\n}\",\n \"func (b *Builder) Call(f FunctionInfo) {\\n\\tb.popStackMulti(f.Parameters)\\n\\tpush := f.ReturnType != protocol.Type_Void\\n\\tif push {\\n\\t\\tb.pushStack(f.ReturnType)\\n\\t}\\n\\tb.instructions = append(b.instructions, asm.Call{\\n\\t\\tPushReturn: push,\\n\\t\\tApiIndex: f.ApiIndex,\\n\\t\\tFunctionID: f.ID,\\n\\t})\\n}\",\n \"func (r ApiCreatePlanRequest) PlanRequest(planRequest PlanRequest) ApiCreatePlanRequest {\\n\\tr.planRequest = &planRequest\\n\\treturn r\\n}\",\n \"func (p *Parser) parseCallExpression(function asti.ExpressionI) asti.ExpressionI {\\n\\texp := &ast.CallExpression{Token: p.curToken, Function: function}\\n\\texp.Arguments = p.parseExpressionList(tokentype.RPAREN)\\n\\treturn exp\\n}\",\n \"func (breaker *ServiceBreaker) Call(exec func() (interface{}, error)) (interface{}, error) {\\n\\tlog.Printf(\\\"start call, %v state is %v\\\\n\\\", breaker.name, breaker.state)\\n\\t//before call\\n\\terr := breaker.beforeCall()\\n\\tif err != nil {\\n\\t\\tlog.Printf(\\\"end call,%v batch:%v,metrics:(%v,%v,%v,%v,%v),window time start:%v\\\\n\\\\n\\\",\\n\\t\\t\\tbreaker.name,\\n\\t\\t\\tbreaker.metrics.WindowBatch,\\n\\t\\t\\tbreaker.metrics.CountAll,\\n\\t\\t\\tbreaker.metrics.CountSuccess,\\n\\t\\t\\tbreaker.metrics.CountFail,\\n\\t\\t\\tbreaker.metrics.ConsecutiveSuccess,\\n\\t\\t\\tbreaker.metrics.ConsecutiveFail,\\n\\t\\t\\tbreaker.metrics.WindowTimeStart.Format(\\\"2006/01/02 15:04:05\\\"))\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t//if panic occur\\n\\tdefer func() {\\n\\t\\terr := recover()\\n\\t\\tif err != nil {\\n\\t\\t\\tbreaker.afterCall(false)\\n\\t\\t\\tpanic(err) //todo?\\n\\t\\t}\\n\\t}()\\n\\n\\t//call\\n\\tbreaker.metrics.OnCall()\\n\\tresult, err := exec()\\n\\n\\t//after call\\n\\tbreaker.afterCall(err == nil)\\n\\tlog.Printf(\\\"end call,%v batch:%v,metrics:(%v,%v,%v,%v,%v),window time start:%v\\\\n\\\\n\\\",\\n\\t\\tbreaker.name,\\n\\t\\tbreaker.metrics.WindowBatch,\\n\\t\\tbreaker.metrics.CountAll,\\n\\t\\tbreaker.metrics.CountSuccess,\\n\\t\\tbreaker.metrics.CountFail,\\n\\t\\tbreaker.metrics.ConsecutiveSuccess,\\n\\t\\tbreaker.metrics.ConsecutiveFail,\\n\\t\\tbreaker.metrics.WindowTimeStart.Format(\\\"2006/1/2 15:04:05\\\"))\\n\\n\\treturn result, err\\n}\",\n \"func (b *block) Plan(pointIds ...string) ([]spi.PointSPI, error) {\\n\\tpoints := []spi.PointSPI{}\\n\\n\\tif len(pointIds) == 0 {\\n\\t\\t// if there are no specified points, include all points\\n\\n\\t\\tfor _, p := range b.points {\\n\\t\\t\\tpoints = append(points, p)\\n\\t\\t}\\n\\t} else {\\n\\t\\tincluded := map[string]bool{}\\n\\t\\tincluded_sf := map[string]bool{}\\n\\n\\t\\t// include all specified points\\n\\t\\tfor _, id := range pointIds {\\n\\t\\t\\tif p, ok := b.points[id]; !ok {\\n\\t\\t\\t\\treturn nil, sunspec.ErrNoSuchPoint\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif !included[id] {\\n\\t\\t\\t\\t\\tpoints = append(points, p)\\n\\t\\t\\t\\t\\tincluded[id] = true\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif p.Type() == typelabel.ScaleFactor {\\n\\t\\t\\t\\t\\tincluded_sf[id] = true\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// include their scale factors too...\\n\\t\\t//\\n\\t\\t// we do this for several reasons:\\n\\t\\t// - to interpret a point that uses a scale factor, we need the scale factor too\\n\\t\\t// - if we don't there we may read a value point after its scale factor point has changed\\n\\t\\t// By forcing contemporaneous reads of a scale factor and its related points we help to ensure\\n\\t\\t// that the two values are consistent.\\n\\t\\t// - we want to avoid app programmers having to encode knowedlege in their programs\\n\\t\\t// about these depednencies - the knowledge is in the SMDX documents, so lets use it\\n\\t\\tfor _, p := range points {\\n\\t\\t\\tsfp := p.(*point).scaleFactor\\n\\t\\t\\tif sfp != nil {\\n\\t\\t\\t\\tif !included[sfp.Id()] {\\n\\t\\t\\t\\t\\tpoints = append(points, sfp.(spi.PointSPI))\\n\\t\\t\\t\\t\\tincluded[sfp.Id()] = true\\n\\t\\t\\t\\t\\tincluded_sf[sfp.Id()] = true\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// We also include all the currently valid points that reference any scale\\n\\t\\t// factor points we are going to read since we don't want such points to\\n\\t\\t// unexpectedly enter an error state when they are invalidated by the\\n\\t\\t// read of the scale factor point. This allows twp separate reads each\\n\\t\\t// of which have a point that reference a shared scale factor point to\\n\\t\\t// be equivalent to a single read of all points or to two reads in which\\n\\t\\t// all points related to a single scale factor are read in the same read\\n\\t\\t// as the scale factor itself.\\n\\t\\t//\\n\\t\\t// One consequence of this behaviour is that any local changes (via a\\n\\t\\t// setter) to a point dependent on a scale factor point may be lost by a\\n\\t\\t// read of any point that is dependent on the same scale factor which\\n\\t\\t// itself means that local changes to points should be written to the\\n\\t\\t// physical device with Block.Write before the next Block.Read or else\\n\\t\\t// they may be lost under some circumstances even if the point concerned\\n\\t\\t// is not directly referened by the Read call.\\n\\t\\t//\\n\\t\\t// Part of the reason we do this is to maximise the consistency of data\\n\\t\\t// exposed by the API while minimising both the effort for the programmer\\n\\t\\t// to maintain the consistency and also surprising behaviour.\\n\\t\\tfor _, p := range b.points {\\n\\t\\t\\tif sfp := p.scaleFactor; sfp == nil || p.Error() != nil || !included_sf[sfp.Id()] {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif !included[p.Id()] {\\n\\t\\t\\t\\t\\tpoints = append(points, p)\\n\\t\\t\\t\\t\\tincluded[p.Id()] = true\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// sort so scale factors come first, then other points in offset order\\n\\tsort.Sort(scaleFactorFirstOrder(points))\\n\\treturn points, nil\\n}\",\n \"func (_Flopper *FlopperRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\\n\\treturn _Flopper.Contract.FlopperCaller.contract.Call(opts, result, method, params...)\\n}\",\n \"func (runner *suiteRunner) runFunc(method *reflect.FuncValue, kind funcKind,\\n dispatcher func(c *C)) *C {\\n c := runner.forkCall(method, kind, dispatcher)\\n <-c.done\\n return c\\n}\",\n \"func (_e *MockRecurringTaskRequirements_Expecter) processTask() *MockRecurringTaskRequirements_processTask_Call {\\n\\treturn &MockRecurringTaskRequirements_processTask_Call{Call: _e.mock.On(\\\"processTask\\\")}\\n}\",\n \"func (m Method) Call(on string, params ...jen.Code) jen.Code {\\n\\treturn jen.Id(on).Dot(m.function.name).Call(params...)\\n}\",\n \"func (s *BasevhdlListener) EnterProcedure_call(ctx *Procedure_callContext) {}\",\n \"func (er *expressionRewriter) rewriteFuncCall(v *ast.FuncCallExpr) bool {\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 413)\\n\\tswitch v.FnName.L {\\n\\t// when column is not null, ifnull on such column is not necessary.\\n\\tcase ast.Ifnull:\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 414)\\n\\t\\tif len(v.Args) != 2 {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 422)\\n\\t\\t\\ter.err = expression.ErrIncorrectParameterCount.GenWithStackByArgs(v.FnName.O)\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 415)\\n\\t\\tstackLen := len(er.ctxStack)\\n\\t\\targ1 := er.ctxStack[stackLen-2]\\n\\t\\tcol, isColumn := arg1.(*expression.Column)\\n\\t\\t// if expr1 is a column and column has not null flag, then we can eliminate ifnull on\\n\\t\\t// this column.\\n\\t\\tif isColumn && mysql.HasNotNullFlag(col.RetType.Flag) {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 423)\\n\\t\\t\\tnewCol := col.Clone().(*expression.Column)\\n\\t\\t\\tnewCol.IsReferenced = true\\n\\t\\t\\ter.ctxStack = er.ctxStack[:stackLen-len(v.Args)]\\n\\t\\t\\ter.ctxStack = append(er.ctxStack, newCol)\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 416)\\n\\t\\treturn false\\n\\tcase ast.Nullif:\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 417)\\n\\t\\tif len(v.Args) != 2 {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 424)\\n\\t\\t\\ter.err = expression.ErrIncorrectParameterCount.GenWithStackByArgs(v.FnName.O)\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 418)\\n\\t\\tstackLen := len(er.ctxStack)\\n\\t\\tparam1 := er.ctxStack[stackLen-2]\\n\\t\\tparam2 := er.ctxStack[stackLen-1]\\n\\t\\t// param1 = param2\\n\\t\\tfuncCompare, err := er.constructBinaryOpFunction(param1, param2, ast.EQ)\\n\\t\\tif err != nil {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 425)\\n\\t\\t\\ter.err = err\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t\\t// NULL\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 419)\\n\\t\\tnullTp := types.NewFieldType(mysql.TypeNull)\\n\\t\\tnullTp.Flen, nullTp.Decimal = mysql.GetDefaultFieldLengthAndDecimal(mysql.TypeNull)\\n\\t\\tparamNull := &expression.Constant{\\n\\t\\t\\tValue: types.NewDatum(nil),\\n\\t\\t\\tRetType: nullTp,\\n\\t\\t}\\n\\t\\t// if(param1 = param2, NULL, param1)\\n\\t\\tfuncIf, err := er.newFunction(ast.If, &v.Type, funcCompare, paramNull, param1)\\n\\t\\tif err != nil {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 426)\\n\\t\\t\\ter.err = err\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 420)\\n\\t\\ter.ctxStack = er.ctxStack[:stackLen-len(v.Args)]\\n\\t\\ter.ctxStack = append(er.ctxStack, funcIf)\\n\\t\\treturn true\\n\\tdefault:\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 421)\\n\\t\\treturn false\\n\\t}\\n}\",\n \"func (core *coreService) TraceCall(ctx context.Context,\\n\\tcallerAddr address.Address,\\n\\tblkNumOrHash any,\\n\\tcontractAddress string,\\n\\tnonce uint64,\\n\\tamount *big.Int,\\n\\tgasLimit uint64,\\n\\tdata []byte,\\n\\tconfig *logger.Config) ([]byte, *action.Receipt, *logger.StructLogger, error) {\\n\\tvar (\\n\\t\\tblkHash hash.Hash256\\n\\t\\terr error\\n\\t)\\n\\t// ignore the incoming blkNumOrHash and use the latest height.\\n\\tblkHash, err = core.dao.GetBlockHash(core.TipHeight())\\n\\tif err != nil {\\n\\t\\treturn nil, nil, nil, err\\n\\t}\\n\\tif gasLimit == 0 {\\n\\t\\tgasLimit = core.bc.Genesis().BlockGasLimit\\n\\t}\\n\\ttraces := logger.NewStructLogger(config)\\n\\tctx = protocol.WithVMConfigCtx(ctx, vm.Config{\\n\\t\\tDebug: true,\\n\\t\\tTracer: traces,\\n\\t\\tNoBaseFee: true,\\n\\t})\\n\\tctx, err = core.bc.Context(ctx)\\n\\tif err != nil {\\n\\t\\treturn nil, nil, nil, err\\n\\t}\\n\\tif nonce == 0 {\\n\\t\\tstate, err := accountutil.AccountState(ctx, core.sf, callerAddr)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, nil, nil, err\\n\\t\\t}\\n\\t\\tnonce = state.PendingNonce()\\n\\t}\\n\\texec, err := action.NewExecution(\\n\\t\\tcontractAddress,\\n\\t\\tnonce,\\n\\t\\tamount,\\n\\t\\tgasLimit,\\n\\t\\tbig.NewInt(0),\\n\\t\\tdata,\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn nil, nil, nil, err\\n\\t}\\n\\tgetblockHash := func(height uint64) (hash.Hash256, error) {\\n\\t\\treturn blkHash, nil\\n\\t}\\n\\tretval, receipt, err := core.sf.SimulateExecution(ctx, callerAddr, exec, getblockHash)\\n\\treturn retval, receipt, traces, err\\n}\",\n \"func (s *state) evalCall(dot, fun reflect.Value, node parse.Node, name string, args []parse.Node, final reflect.Value) reflect.Value {\\n\\tif args != nil {\\n\\t\\targs = args[1:] // Zeroth arg is function name/node; not passed to function.\\n\\t}\\n\\ttyp := fun.Type()\\n\\tnumIn := len(args)\\n\\tif final.IsValid() {\\n\\t\\tnumIn++\\n\\t}\\n\\tnumFixed := len(args)\\n\\tif typ.IsVariadic() {\\n\\t\\tnumFixed = typ.NumIn() - 1 // last arg is the variadic one.\\n\\t\\tif numIn < numFixed {\\n\\t\\t\\ts.errorf(\\\"wrong number of args for %s: want at least %d got %d\\\", name, typ.NumIn()-1, len(args))\\n\\t\\t}\\n\\t} else if numIn < typ.NumIn()-1 || !typ.IsVariadic() && numIn != typ.NumIn() {\\n\\t\\ts.errorf(\\\"wrong number of args for %s: want %d got %d\\\", name, typ.NumIn(), len(args))\\n\\t}\\n\\tif !goodFunc(typ) {\\n\\t\\t// TODO: This could still be a confusing error; maybe goodFunc should provide info.\\n\\t\\ts.errorf(\\\"can't call method/function %q with %d results\\\", name, typ.NumOut())\\n\\t}\\n\\t// Build the arg list.\\n\\targv := make([]reflect.Value, numIn)\\n\\t// Args must be evaluated. Fixed args first.\\n\\ti := 0\\n\\tfor ; i < numFixed && i < len(args); i++ {\\n\\t\\targv[i] = s.evalArg(dot, typ.In(i), args[i])\\n\\t}\\n\\t// Now the ... args.\\n\\tif typ.IsVariadic() {\\n\\t\\targType := typ.In(typ.NumIn() - 1).Elem() // Argument is a slice.\\n\\t\\tfor ; i < len(args); i++ {\\n\\t\\t\\targv[i] = s.evalArg(dot, argType, args[i])\\n\\t\\t}\\n\\t}\\n\\t// Add final value if necessary.\\n\\tif final.IsValid() {\\n\\t\\tt := typ.In(typ.NumIn() - 1)\\n\\t\\tif typ.IsVariadic() {\\n\\t\\t\\tt = t.Elem()\\n\\t\\t}\\n\\t\\targv[i] = s.validateType(final, t)\\n\\t}\\n\\tresult := fun.Call(argv)\\n\\t// If we have an error that is not nil, stop execution and return that error to the caller.\\n\\tif len(result) == 2 && !result[1].IsNil() {\\n\\t\\ts.at(node)\\n\\t\\ts.errorf(\\\"error calling %s: %s\\\", name, result[1].Interface().(error))\\n\\t}\\n\\treturn result[0]\\n}\",\n \"func (_Casper *CasperCallerRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\\n\\treturn _Casper.Contract.contract.Call(opts, result, method, params...)\\n}\",\n \"func NewCall(name string, args []Expression, opts FunctionOptions) Expression {\\n\\treturn &Call{funcName: name, args: args, options: opts}\\n}\",\n \"func (_Mapping *MappingCallerRaw) Call(opts *bind.CallOpts, result interface{}, method string, params ...interface{}) error {\\n\\treturn _Mapping.Contract.contract.Call(opts, result, method, params...)\\n}\",\n \"func (bf *boardFilter) processCallingPoints(s ldb.Service) {\\n\\tif len(s.CallingPoints) > 0 {\\n\\t\\tviaRequest := bf.addVia(s.RID, s.CallingPoints[len(s.CallingPoints)-1].Tiploc)\\n\\n\\t\\tfor _, cp := range s.CallingPoints {\\n\\t\\t\\tbf.addTiploc(cp.Tiploc)\\n\\t\\t\\tviaRequest.AppendTiploc(cp.Tiploc)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (a *agent) GetCall(opts ...CallOpt) (Call, error) {\\n\\tvar c call\\n\\n\\t// add additional agent options after any call specific options\\n\\t// NOTE(reed): this policy is open to being the opposite way around, have at it,\\n\\t// the thinking being things like FromHTTPRequest are in supplied opts...\\n\\topts = append(opts, a.callOpts...)\\n\\n\\tfor _, o := range opts {\\n\\t\\terr := o(&c)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\n\\t// TODO typed errors to test\\n\\tif c.req == nil || c.Call == nil {\\n\\t\\treturn nil, errors.New(\\\"no model or request provided for call\\\")\\n\\t}\\n\\n\\t// If overrider is present, let's allow it to modify models.Call\\n\\t// and call extensions\\n\\tif a.callOverrider != nil {\\n\\t\\text, err := a.callOverrider(c.req, c.Call, c.extensions)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tc.extensions = ext\\n\\t}\\n\\n\\tmem := c.Memory + uint64(c.TmpFsSize)\\n\\tif !a.resources.IsResourcePossible(mem, c.CPUs) {\\n\\t\\treturn nil, models.ErrCallResourceTooBig\\n\\t}\\n\\n\\tif c.Call.Config == nil {\\n\\t\\tc.Call.Config = make(models.Config)\\n\\t}\\n\\tc.Call.Config[\\\"FN_LISTENER\\\"] = \\\"unix:\\\" + filepath.Join(iofsDockerMountDest, udsFilename)\\n\\tc.Call.Config[\\\"FN_FORMAT\\\"] = \\\"http-stream\\\" // TODO: remove this after fdk's forget what it means\\n\\t// TODO we could set type here too, for now, or anything else not based in fn/app/trigger config\\n\\n\\tsetupCtx(&c)\\n\\n\\tc.ct = a\\n\\tif c.stderr == nil {\\n\\t\\t// TODO(reed): is line writer is vulnerable to attack?\\n\\t\\t// XXX(reed): forcing this as default is not great / configuring it isn't great either. reconsider.\\n\\t\\tc.stderr = setupLogger(c.req.Context(), a.cfg.MaxLogSize, !a.cfg.DisableDebugUserLogs, c.Call)\\n\\t}\\n\\tif c.respWriter == nil {\\n\\t\\t// send function output to logs if no writer given (TODO no longer need w/o async?)\\n\\t\\t// TODO we could/should probably make this explicit to GetCall, ala 'WithLogger', but it's dupe code (who cares?)\\n\\t\\tc.respWriter = c.stderr\\n\\t}\\n\\n\\treturn &c, nil\\n}\",\n \"func trampoline(ctxt *ld.Link, r *sym.Reloc, s *sym.Symbol) {\\n\\n\\t// Trampolines are created if the branch offset is too large and the linker cannot insert a call stub to handle it.\\n\\t// For internal linking, trampolines are always created for long calls.\\n\\t// For external linking, the linker can insert a call stub to handle a long call, but depends on having the TOC address in\\n\\t// r2. For those build modes with external linking where the TOC address is not maintained in r2, trampolines must be created.\\n\\tif ctxt.LinkMode == ld.LinkExternal && (ctxt.DynlinkingGo() || ctxt.BuildMode == ld.BuildModeCArchive || ctxt.BuildMode == ld.BuildModeCShared || ctxt.BuildMode == ld.BuildModePIE) {\\n\\t\\t// No trampolines needed since r2 contains the TOC\\n\\t\\treturn\\n\\t}\\n\\n\\tt := ld.Symaddr(r.Sym) + r.Add - (s.Value + int64(r.Off))\\n\\tswitch r.Type {\\n\\tcase objabi.R_CALLPOWER:\\n\\n\\t\\t// If branch offset is too far then create a trampoline.\\n\\n\\t\\tif (ctxt.LinkMode == ld.LinkExternal && s.Sect != r.Sym.Sect) || (ctxt.LinkMode == ld.LinkInternal && int64(int32(t<<6)>>6) != t) || (*ld.FlagDebugTramp > 1 && s.File != r.Sym.File) {\\n\\t\\t\\tvar tramp *sym.Symbol\\n\\t\\t\\tfor i := 0; ; i++ {\\n\\n\\t\\t\\t\\t// Using r.Add as part of the name is significant in functions like duffzero where the call\\n\\t\\t\\t\\t// target is at some offset within the function. Calls to duff+8 and duff+256 must appear as\\n\\t\\t\\t\\t// distinct trampolines.\\n\\n\\t\\t\\t\\tname := r.Sym.Name\\n\\t\\t\\t\\tif r.Add == 0 {\\n\\t\\t\\t\\t\\tname = name + fmt.Sprintf(\\\"-tramp%d\\\", i)\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tname = name + fmt.Sprintf(\\\"%+x-tramp%d\\\", r.Add, i)\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Look up the trampoline in case it already exists\\n\\n\\t\\t\\t\\ttramp = ctxt.Syms.Lookup(name, int(r.Sym.Version))\\n\\t\\t\\t\\tif tramp.Value == 0 {\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tt = ld.Symaddr(tramp) + r.Add - (s.Value + int64(r.Off))\\n\\n\\t\\t\\t\\t// With internal linking, the trampoline can be used if it is not too far.\\n\\t\\t\\t\\t// With external linking, the trampoline must be in this section for it to be reused.\\n\\t\\t\\t\\tif (ctxt.LinkMode == ld.LinkInternal && int64(int32(t<<6)>>6) == t) || (ctxt.LinkMode == ld.LinkExternal && s.Sect == tramp.Sect) {\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif tramp.Type == 0 {\\n\\t\\t\\t\\tif ctxt.DynlinkingGo() || ctxt.BuildMode == ld.BuildModeCArchive || ctxt.BuildMode == ld.BuildModeCShared || ctxt.BuildMode == ld.BuildModePIE {\\n\\t\\t\\t\\t\\t// Should have returned for above cases\\n\\t\\t\\t\\t\\tld.Errorf(s, \\\"unexpected trampoline for shared or dynamic linking\\\\n\\\")\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tctxt.AddTramp(tramp)\\n\\t\\t\\t\\t\\tgentramp(ctxt, tramp, r.Sym, r.Add)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tr.Sym = tramp\\n\\t\\t\\tr.Add = 0 // This was folded into the trampoline target address\\n\\t\\t\\tr.Done = false\\n\\t\\t}\\n\\tdefault:\\n\\t\\tld.Errorf(s, \\\"trampoline called with non-jump reloc: %d (%s)\\\", r.Type, sym.RelocName(ctxt.Arch, r.Type))\\n\\t}\\n}\",\n \"func (_m *MockCompactionPlanContext) execCompactionPlan(signal *compactionSignal, plan *datapb.CompactionPlan) error {\\n\\tret := _m.Called(signal, plan)\\n\\n\\tvar r0 error\\n\\tif rf, ok := ret.Get(0).(func(*compactionSignal, *datapb.CompactionPlan) error); ok {\\n\\t\\tr0 = rf(signal, plan)\\n\\t} else {\\n\\t\\tr0 = ret.Error(0)\\n\\t}\\n\\n\\treturn r0\\n}\",\n \"func Call(f func()) {\\n\\tdone := dPool.Get().(chan struct{})\\n\\tdefer dPool.Put(done)\\n\\tfq <- fun{fn: f, done: done}\\n\\t<-done\\n}\",\n \"func (fn FunctionN) Call(args ...Expression) (Expression, error) {\\n\\treturn fn.Fn(args...)\\n}\",\n \"func (self *TravellerBots) planTrips(cars *CountriesAirportsRoutes, jp* journeyPlanner, fe *flap.Engine,currentDay flap.EpochTime,deterministic bool,dayOfModel flap.Days, threads uint) error {\\n\\t\\n\\t// Create configured number of threads to plan trips and wait for them to finish\\n\\tperrs := make(chan error, threads)\\n\\tvar wg sync.WaitGroup\\n\\tfor i := uint(0); i < threads; i++ {\\n\\t\\twg.Add(1)\\n\\t\\tt := func (step uint,offset uint) {perrs <- self.doPlanTrips(cars,jp,fe,currentDay,deterministic,dayOfModel,step,offset);wg.Done()}\\n\\t\\tgo t(threads,i)\\n\\t}\\n\\twg.Wait()\\n\\n\\t// Return first error reported\\n\\tclose(perrs)\\n\\tfor elem := range perrs {\\n\\t\\tif elem != nil {\\n\\t\\t\\treturn elem\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (th *Thread) PushCall(fn Callable, this Value, as *ArgSpec, args ...Value) Value {\\n\\tbase := th.sp\\n\\tfor _, x := range args {\\n\\t\\tth.Push(x)\\n\\t}\\n\\tresult := fn.Call(th, this, as)\\n\\tth.sp = base\\n\\treturn result\\n}\",\n \"func (ob *Observation) make_call(fv reflect.Value, inputs []reflect.Value) []reflect.Value {\\n\\tif ob.can_panic {\\n\\t\\tdefer func() {\\n\\t\\t\\tob.Panic = recover()\\n\\t\\t}()\\n\\t}\\n\\n\\tob.Start = time.Now()\\n\\tret := fv.Call(inputs)\\n\\tob.Duration = time.Since(ob.Start)\\n\\treturn ret\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5957647","0.5939454","0.5878916","0.5844865","0.578538","0.5709484","0.5678076","0.55843925","0.5496034","0.5492764","0.54183","0.5409136","0.5385073","0.53798765","0.5378616","0.53784394","0.5343292","0.5333596","0.5331891","0.5302641","0.5196999","0.51672333","0.5165845","0.512169","0.5113747","0.51091987","0.5105213","0.5100166","0.50768167","0.50741464","0.50361025","0.5028062","0.5023915","0.50066334","0.49945706","0.49915963","0.49845508","0.496287","0.49525476","0.49317396","0.492949","0.49247375","0.49238753","0.49210933","0.4915692","0.49098954","0.49059513","0.4904257","0.49021736","0.48972484","0.4893944","0.4893022","0.48871106","0.48757932","0.48718855","0.48700657","0.48549214","0.48525238","0.48503852","0.48379293","0.48379254","0.4834764","0.4832962","0.48256063","0.4823232","0.48207778","0.47972485","0.47933298","0.47903466","0.47818267","0.47801718","0.4779033","0.47777915","0.47727337","0.47666723","0.47623324","0.4753584","0.47427708","0.4742233","0.47379827","0.47367638","0.47365668","0.47325426","0.47294527","0.47125566","0.47114438","0.47096285","0.47087073","0.47082034","0.4703305","0.4701674","0.46994895","0.4694511","0.46940276","0.46907812","0.46864396","0.46854937","0.46835303","0.46832335","0.4675155"],"string":"[\n \"0.5957647\",\n \"0.5939454\",\n \"0.5878916\",\n \"0.5844865\",\n \"0.578538\",\n \"0.5709484\",\n \"0.5678076\",\n \"0.55843925\",\n \"0.5496034\",\n \"0.5492764\",\n \"0.54183\",\n \"0.5409136\",\n \"0.5385073\",\n \"0.53798765\",\n \"0.5378616\",\n \"0.53784394\",\n \"0.5343292\",\n \"0.5333596\",\n \"0.5331891\",\n \"0.5302641\",\n \"0.5196999\",\n \"0.51672333\",\n \"0.5165845\",\n \"0.512169\",\n \"0.5113747\",\n \"0.51091987\",\n \"0.5105213\",\n \"0.5100166\",\n \"0.50768167\",\n \"0.50741464\",\n \"0.50361025\",\n \"0.5028062\",\n \"0.5023915\",\n \"0.50066334\",\n \"0.49945706\",\n \"0.49915963\",\n \"0.49845508\",\n \"0.496287\",\n \"0.49525476\",\n \"0.49317396\",\n \"0.492949\",\n \"0.49247375\",\n \"0.49238753\",\n \"0.49210933\",\n \"0.4915692\",\n \"0.49098954\",\n \"0.49059513\",\n \"0.4904257\",\n \"0.49021736\",\n \"0.48972484\",\n \"0.4893944\",\n \"0.4893022\",\n \"0.48871106\",\n \"0.48757932\",\n \"0.48718855\",\n \"0.48700657\",\n \"0.48549214\",\n \"0.48525238\",\n \"0.48503852\",\n \"0.48379293\",\n \"0.48379254\",\n \"0.4834764\",\n \"0.4832962\",\n \"0.48256063\",\n \"0.4823232\",\n \"0.48207778\",\n \"0.47972485\",\n \"0.47933298\",\n \"0.47903466\",\n \"0.47818267\",\n \"0.47801718\",\n \"0.4779033\",\n \"0.47777915\",\n \"0.47727337\",\n \"0.47666723\",\n \"0.47623324\",\n \"0.4753584\",\n \"0.47427708\",\n \"0.4742233\",\n \"0.47379827\",\n \"0.47367638\",\n \"0.47365668\",\n \"0.47325426\",\n \"0.47294527\",\n \"0.47125566\",\n \"0.47114438\",\n \"0.47096285\",\n \"0.47087073\",\n \"0.47082034\",\n \"0.4703305\",\n \"0.4701674\",\n \"0.46994895\",\n \"0.4694511\",\n \"0.46940276\",\n \"0.46907812\",\n \"0.46864396\",\n \"0.46854937\",\n \"0.46835303\",\n \"0.46832335\",\n \"0.4675155\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.769013"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":2797,"cells":{"query":{"kind":"string","value":"planBinaryExpr generates a processor for a binary expression. A binary expression represents a join operator between two processors."},"document":{"kind":"string","value":"func (p *Planner) planBinaryExpr(e *Executor, expr *BinaryExpr) (processor, error) {\n\t// Create processor for LHS.\n\tlhs, err := p.planExpr(e, expr.LHS)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"lhs: %s\", err)\n\t}\n\n\t// Create processor for RHS.\n\trhs, err := p.planExpr(e, expr.RHS)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"rhs: %s\", err)\n\t}\n\n\t// Combine processors.\n\treturn newBinaryExprEvaluator(e, expr.Op, lhs, rhs), nil\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func newBinaryExprEvaluator(e *Executor, op Token, lhs, rhs processor) *binaryExprEvaluator {\n\treturn &binaryExprEvaluator{\n\t\texecutor: e,\n\t\top: op,\n\t\tlhs: lhs,\n\t\trhs: rhs,\n\t\tc: make(chan map[string]interface{}, 0),\n\t\tdone: make(chan chan struct{}, 0),\n\t}\n}","func TestCompiler_Compile_binaryExpr(t *testing.T) {\n\texpr := ast.BinaryExpr{\n\t\tX: ast.ScalarExpr{Val: \"1\", Typ: token.INT},\n\t\tOp: token.ADD,\n\t\tY: ast.BinaryExpr{\n\t\t\tX: ast.ScalarExpr{Val: \"2\", Typ: token.INT},\n\t\t\tOp: token.MUL,\n\t\t\tY: ast.ScalarExpr{Val: \"2\", Typ: token.INT},\n\t\t},\n\t}\n\tc := NewCompiler()\n\texpected := []Instruction{\n\t\t{Op: MULTIPLY, Arg1: Argument{Val: \"2\", ValType: INTEGER}, Arg2: Argument{Val: \"2\", ValType: INTEGER}, Ret: Argument{TVal: 1}},\n\t\t{Op: ADD, Arg1: Argument{Val: \"1\", ValType: INTEGER}, Arg2: Argument{TVal: 1}, Ret: Argument{TVal: 2}},\n\t}\n\tinsts := c.Compile(expr)\n\tif insts.tvals != 2 {\n\t\tt.Errorf(\"expected 2 got %d\", insts.tvals)\n\t}\n\tfor i, actual := range insts.instructions {\n\t\tif compareInstrucions(expected[i], actual) == false {\n\t\t\tt.Errorf(\"expected %s got %s\", expected, actual)\n\t\t}\n\t}\n}","func binary(typ int, od1 *expr, op string, od2 *expr) *expr {\n\treturn &expr{\n\t\tsexp: append(exprlist{atomic(typ, op)}, od1, od2),\n\t}\n}","func parseBinary(lex *lexer, prec1 int) Expr {\n\tlhs := parseUnary(lex)\n\tfor prec := precedence(lex.token); prec >= prec1; prec-- {\n\t\tfor precedence(lex.token) == prec {\n\t\t\top := lex.token\n\t\t\tlex.next() // consume operator\n\t\t\trhs := parseBinary(lex, prec+1)\n\t\t\tlhs = binary{op, lhs, rhs}\n\t\t}\n\t}\n\treturn lhs\n}","func NewBinaryBooleanExpression(op OP, lE, rE Evaluator) (Evaluator, error) {\n\tswitch op {\n\tcase AND, OR:\n\t\treturn &booleanNode{\n\t\t\top: op,\n\t\t\tlS: true,\n\t\t\tlE: lE,\n\t\t\trS: true,\n\t\t\trE: rE,\n\t\t}, nil\n\tdefault:\n\t\treturn nil, errors.New(\"binary boolean expressions require the operation to be one for the follwing 'and', 'or'\")\n\t}\n}","func newBinaryOp(op string, expr1, expr2 Expression) Expression {\n\tswitch {\n\tcase expr1 != nil && expr2 != nil:\n\t\treturn &BinaryOp{\n\t\t\tOp: op,\n\t\t\tExpr1: expr1,\n\t\t\tExpr2: expr2,\n\t\t}\n\tcase expr1 != nil && expr2 == nil:\n\t\treturn expr1\n\tcase expr1 == nil && expr2 != nil:\n\t\treturn expr2\n\tcase expr1 == nil && expr2 == nil:\n\t\treturn nil\n\t}\n\tpanic(\"unreachable\")\n}","func evalBinaryStringExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar err error\n\tvar r string\n\tvar b bool\n\tis_bool := false\n\n\txx, yy := x.String(), y.String()\n\tswitch op {\n\tcase token.ADD:\tr = xx + yy\n\tcase token.EQL: b = xx == yy; is_bool = true\n\tcase token.NEQ: b = xx != yy; is_bool = true\n\tcase token.LEQ: b = xx <= yy; is_bool = true\n\tcase token.GEQ: b = xx >= yy; is_bool = true\n\tcase token.LSS: b = xx < yy; is_bool = true\n\tcase token.GTR: b = xx > yy; is_bool = true\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\tif is_bool {\n\t\treturn reflect.ValueOf(b), err\n\t} else {\n\t\treturn reflect.ValueOf(r).Convert(x.Type()), err\n\t}\n}","func NewBinaryExpr(op BinaryOp, lhs, rhs Expr) Expr {\n\t// assert(ExprWidth(lhs) == ExprWidth(rhs), \"binary expr width mismatch: op=%s (%T) %d != (%T) %d\", op, lhs, ExprWidth(lhs), rhs, ExprWidth(rhs))\n\n\tswitch op {\n\t// Arithmetic operators\n\tcase ADD:\n\t\treturn newAddExpr(lhs, rhs)\n\tcase SUB:\n\t\treturn newSubExpr(lhs, rhs)\n\tcase MUL:\n\t\treturn newMulExpr(lhs, rhs)\n\tcase UDIV, SDIV:\n\t\treturn newDivExpr(op, lhs, rhs)\n\tcase UREM, SREM:\n\t\treturn newRemExpr(op, lhs, rhs)\n\tcase AND:\n\t\treturn newAndExpr(lhs, rhs)\n\tcase OR:\n\t\treturn newOrExpr(lhs, rhs)\n\tcase XOR:\n\t\treturn newXorExpr(lhs, rhs)\n\tcase SHL:\n\t\treturn newShlExpr(lhs, rhs)\n\tcase LSHR:\n\t\treturn newLShrExpr(lhs, rhs)\n\tcase ASHR:\n\t\treturn newAShrExpr(lhs, rhs)\n\n\t// Comparison operators\n\tcase EQ:\n\t\treturn newEqExpr(lhs, rhs)\n\tcase NE:\n\t\treturn NewBinaryExpr(EQ, NewConstantExpr(0, WidthBool), NewBinaryExpr(EQ, lhs, rhs))\n\tcase ULT:\n\t\treturn newUltExpr(lhs, rhs)\n\tcase UGT:\n\t\treturn newUltExpr(rhs, lhs) // reverse\n\tcase ULE:\n\t\treturn newUleExpr(lhs, rhs)\n\tcase UGE:\n\t\treturn newUleExpr(rhs, lhs) // reverse\n\tcase SLT:\n\t\treturn newSltExpr(lhs, rhs)\n\tcase SGT:\n\t\treturn newSltExpr(rhs, lhs) // reverse\n\tcase SLE:\n\t\treturn newSleExpr(lhs, rhs)\n\tcase SGE:\n\t\treturn newSleExpr(rhs, lhs) // reverse\n\n\tdefault:\n\t\tpanic(\"unreachable\")\n\t}\n}","func evalBinaryIntExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar r int64\n\tvar err error\n\tvar b bool\n\tis_bool := false\n\n\txx, yy := x.Int(), y.Int()\n\tswitch op {\n\tcase token.ADD: r = xx + yy\n\tcase token.SUB: r = xx - yy\n\tcase token.MUL: r = xx * yy\n\tcase token.QUO: r = xx / yy\n\tcase token.REM: r = xx % yy\n\tcase token.AND: r = xx & yy\n\tcase token.OR: r = xx | yy\n\tcase token.XOR: r = xx ^ yy\n\tcase token.AND_NOT: r = xx &^ yy\n\tcase token.EQL: b = xx == yy; is_bool = true\n\tcase token.NEQ: b = xx != yy; is_bool = true\n\tcase token.LEQ: b = xx <= yy; is_bool = true\n\tcase token.GEQ: b = xx >= yy; is_bool = true\n\tcase token.LSS: b = xx < yy; is_bool = true\n\tcase token.GTR: b = xx > yy; is_bool = true\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\tif is_bool {\n\t\treturn reflect.ValueOf(b), err\n\t} else {\n\t\treturn reflect.ValueOf(r).Convert(x.Type()), err\n\t}\n}","func NewBinary(left Expr, op *token.T, right Expr) *Binary {\n\treturn &Binary{\n\t\tLeft: left,\n\t\tOperator: op,\n\t\tRight: right,\n\t}\n}","func _b(x interface{}, op string, y interface{}) ast.Expr {\n\tvar xx, yx ast.Expr\n\tif xstr, ok := x.(string); ok {\n\t\txx = _x(xstr)\n\t} else {\n\t\txx = x.(ast.Expr)\n\t}\n\tif ystr, ok := y.(string); ok {\n\t\tyx = _x(ystr)\n\t} else {\n\t\tyx = y.(ast.Expr)\n\t}\n\treturn &ast.BinaryExpr{\n\t\tX: xx,\n\t\tOp: _op(op),\n\t\tY: yx,\n\t}\n}","func (*Base) Binary(p ASTPass, node *ast.Binary, ctx Context) {\n\tp.Visit(p, &node.Left, ctx)\n\tp.Fodder(p, &node.OpFodder, ctx)\n\tp.Visit(p, &node.Right, ctx)\n}","func (fi *funcInfo) emitBinaryOp(line int, op TokenType, a, b, c int) {\r\n\tif opcode, found := arithAndBitwiseBinops[op]; found {\r\n\t\tfi.emitABC(line, opcode, a, b, c)\r\n\t} else {\r\n\t\tswitch op {\r\n\t\tcase TOKEN_OP_EQ:\r\n\t\t\tfi.emitABC(line, OP_EQ, 1, b, c)\r\n\t\tcase TOKEN_OP_NE:\r\n\t\t\tfi.emitABC(line, OP_EQ, 0, b, c)\r\n\t\tcase TOKEN_OP_LT:\r\n\t\t\tfi.emitABC(line, OP_LT, 1, b, c)\r\n\t\tcase TOKEN_OP_GT:\r\n\t\t\tfi.emitABC(line, OP_LT, 1, c, b)\r\n\t\tcase TOKEN_OP_LE:\r\n\t\t\tfi.emitABC(line, OP_LE, 1, b, c)\r\n\t\tcase TOKEN_OP_GE:\r\n\t\t\tfi.emitABC(line, OP_LE, 1, c, b)\r\n\t\t}\r\n\t\tfi.emitJmp(line, 0, 1)\r\n\t\tfi.emitLoadBool(line, a, 0, 1)\r\n\t\tfi.emitLoadBool(line, a, 1, 0)\r\n\t}\r\n}","func evalBinaryComplexExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar err error\n\tvar r complex128\n\n\txx, yy := x.Complex(), y.Complex()\n\tswitch op {\n\tcase token.ADD: r = xx + yy\n\tcase token.SUB: r = xx - yy\n\tcase token.MUL: r = xx * yy\n\tcase token.QUO: r = xx / yy\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\treturn reflect.ValueOf(r).Convert(x.Type()), err\n}","func (s *BaseMySqlParserListener) EnterBinaryComparasionPredicate(ctx *BinaryComparasionPredicateContext) {\n}","func (s *BaselimboListener) EnterBinary_expression(ctx *Binary_expressionContext) {}","func NewBinary(op circuit.Operation, a, b, o *Wire) *Gate {\n\tgate := &Gate{\n\t\tOp: op,\n\t\tA: a,\n\t\tB: b,\n\t\tO: o,\n\t}\n\ta.AddOutput(gate)\n\tb.AddOutput(gate)\n\to.SetInput(gate)\n\n\treturn gate\n}","func evalBinaryUintExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar err error\n\tvar r uint64\n\tvar b bool\n\tis_bool := false\n\n\txx, yy := x.Uint(), y.Uint()\n\tswitch op {\n\tcase token.ADD: r = xx + yy\n\tcase token.SUB: r = xx - yy\n\tcase token.MUL: r = xx * yy\n\tcase token.QUO: r = xx / yy\n\tcase token.REM: r = xx % yy\n\tcase token.AND: r = xx & yy\n\tcase token.OR: r = xx | yy\n\tcase token.XOR: r = xx ^ yy\n\tcase token.AND_NOT: r = xx &^ yy\n\tcase token.EQL: b = xx == yy; is_bool = true\n\tcase token.NEQ: b = xx != yy; is_bool = true\n\tcase token.LEQ: b = xx <= yy; is_bool = true\n\tcase token.GEQ: b = xx >= yy; is_bool = true\n\tcase token.LSS: b = xx < yy; is_bool = true\n\tcase token.GTR: b = xx > yy; is_bool = true\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\tif is_bool {\n\t\treturn reflect.ValueOf(b), err\n\t} else {\n\t\treturn reflect.ValueOf(r).Convert(x.Type()), err\n\t}\n}","func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\n\tswitch expr := expr.(type) {\n\tcase *VarRef:\n\t\tpanic(\"TODO\")\n\tcase *Call:\n\t\treturn p.planCall(e, expr)\n\tcase *BinaryExpr:\n\t\treturn p.planBinaryExpr(e, expr)\n\tcase *ParenExpr:\n\t\treturn p.planExpr(e, expr.Expr)\n\tcase *NumberLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *StringLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *BooleanLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *TimeLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\tcase *DurationLiteral:\n\t\treturn newLiteralProcessor(expr.Val), nil\n\t}\n\tpanic(\"unreachable\")\n}","func (s *BaseGraffleParserListener) EnterBin_arithm_operator(ctx *Bin_arithm_operatorContext) {}","func NewBinaryExpression(left Expression, op string, right Expression) Expression {\n\tlType := left.Type().GetKind()\n\trType := right.Type().GetKind()\n\n\tif lType != rType {\n\t\tpanic(\"mismatching types\")\n\t}\n\n\tvar retVal Expression\n\tswitch op {\n\tcase \"+\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerAddition{left: left, right: right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realAddition{left: left, right: right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"-\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerSubstraction{left: left, right: right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realSubstraction{left: left, right: right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"*\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerMultiplication{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realMultiplication{left: left, right: right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"/\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerDivision{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realDivision{left: left, right: right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"%\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerModulo{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"|\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerOr{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"^\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerXor{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"&\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerAnd{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"or\":\n\t\tif lType == BOOLEAN {\n\t\t\tretVal = &booleanOr{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"and\":\n\t\tif lType == BOOLEAN {\n\t\t\tretVal = &booleanAnd{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"==\":\n\t\tif lType == BOOLEAN {\n\t\t\tretVal = &booleanEqual{left, right}\n\t\t} else if lType == INTEGER {\n\t\t\tretVal = &integerEqual{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realEqual{left, right}\n\t\t} else if lType == FUNCTION {\n\t\t\tretVal = &funcEqual{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"!=\":\n\t\tif lType == BOOLEAN {\n\t\t\tretVal = &booleanNotEqual{left, right}\n\t\t} else if lType == INTEGER {\n\t\t\tretVal = &integerNotEqual{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realNotEqual{left, right}\n\t\t} else if lType == FUNCTION {\n\t\t\tretVal = &funcNotEqual{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"<\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerLessThan{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realLessThan{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \">\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerGreaterThan{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realGreaterThan{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \"<=\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerLessOrEqual{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realLessOrEqual{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tcase \">=\":\n\t\tif lType == INTEGER {\n\t\t\tretVal = &integerGreaterOrEqual{left, right}\n\t\t} else if lType == REAL {\n\t\t\tretVal = &realGreaterOrEqual{left, right}\n\t\t} else {\n\t\t\tpanic(\"unsupported type\")\n\t\t}\n\tdefault:\n\t\tpanic(\"unsupported operand\")\n\t}\n\n\t// fmt.Println(retVal.String())\n\treturn retVal\n}","func VPBROADCASTB(ops ...operand.Op) { ctx.VPBROADCASTB(ops...) }","func (w *Writer) PutBinaryExpr(b *ast.BinaryExpr) {\n\tif *flagParens {\n\t\tw.Put(\"(\")\n\t}\n\n\tunsigned := IsUnsigned(TypeOf(b.X)) || IsUnsigned(TypeOf(b.Y))\n\n\tx := RValue(b.X)\n\ty := RValue(b.Y)\n\n\tswitch b.Op {\n\tdefault:\n\t\tw.Put(x, b.Op.String(), y)\n\tcase token.EQL:\n\t\tw.PutJEquals(JTypeOfExpr(b.X), x, JTypeOfExpr(b.Y), y)\n\tcase token.LSS, token.GTR, token.LEQ, token.GEQ, token.QUO, token.REM:\n\t\tif unsigned {\n\t\t\tw.PutUnsignedOp(b.X, b.Op, b.Y)\n\t\t} else {\n\t\t\tw.Put(x, b.Op.String(), y) // default\n\t\t}\n\tcase token.SHL, token.SHR, token.AND, token.OR, token.XOR:\n\t\t// different precedence in Go and Java, parentisize to be sure\n\t\tw.Put(\"(\", x, b.Op.String(), y, \")\")\n\tcase token.AND_NOT: //\n\t\t// not in java\n\t\tw.Put(\"(\", x, \"&~\", y, \")\")\n\t}\n\n\tif *flagParens {\n\t\tw.Put(\")\")\n\t}\n}","func (er *expressionRewriter) constructBinaryOpFunction(l expression.Expression, r expression.Expression, op string) (expression.Expression, error) {\n\tlLen, rLen := expression.GetRowLen(l), expression.GetRowLen(r)\n\tif lLen == 1 && rLen == 1 {\n\t\treturn er.newFunction(op, types.NewFieldType(mysql.TypeTiny), l, r)\n\t} else if rLen != lLen {\n\t\treturn nil, expression.ErrOperandColumns.GenWithStackByArgs(lLen)\n\t}\n\tswitch op {\n\tcase ast.EQ, ast.NE:\n\t\tfuncs := make([]expression.Expression, lLen)\n\t\tfor i := 0; i < lLen; i++ {\n\t\t\tvar err error\n\t\t\tfuncs[i], err = er.constructBinaryOpFunction(expression.GetFuncArg(l, i), expression.GetFuncArg(r, i), op)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\tif op == ast.NE {\n\t\t\treturn expression.ComposeDNFCondition(er.sctx, funcs...), nil\n\t\t}\n\t\treturn expression.ComposeCNFCondition(er.sctx, funcs...), nil\n\tdefault:\n\t\tlarg0, rarg0 := expression.GetFuncArg(l, 0), expression.GetFuncArg(r, 0)\n\t\tvar expr1, expr2, expr3, expr4, expr5 expression.Expression\n\t\texpr1 = expression.NewFunctionInternal(er.sctx, ast.NE, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\n\t\texpr2 = expression.NewFunctionInternal(er.sctx, op, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\n\t\texpr3 = expression.NewFunctionInternal(er.sctx, ast.IsNull, types.NewFieldType(mysql.TypeTiny), expr1)\n\t\tvar err error\n\t\tl, err = expression.PopRowFirstArg(er.sctx, l)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tr, err = expression.PopRowFirstArg(er.sctx, r)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr4, err = er.constructBinaryOpFunction(l, r, op)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr5, err = er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr3, expression.Null, expr4)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr1, expr2, expr5)\n\t}\n}","func (p *parser) parseBinaryOps(ops []map[TokenType]*Operation) (Expression, hcl.Diagnostics) {\n\tif len(ops) == 0 {\n\t\t// We've run out of operators, so now we'll just try to parse a term.\n\t\treturn p.parseExpressionWithTraversals()\n\t}\n\n\tthisLevel := ops[0]\n\tremaining := ops[1:]\n\n\tvar lhs, rhs Expression\n\tvar operation *Operation\n\tvar diags hcl.Diagnostics\n\n\t// Parse a term that might be the first operand of a binary\n\t// operation or it might just be a standalone term.\n\t// We won't know until we've parsed it and can look ahead\n\t// to see if there's an operator token for this level.\n\tlhs, lhsDiags := p.parseBinaryOps(remaining)\n\tdiags = append(diags, lhsDiags...)\n\tif p.recovery && lhsDiags.HasErrors() {\n\t\treturn lhs, diags\n\t}\n\n\t// We'll keep eating up operators until we run out, so that operators\n\t// with the same precedence will combine in a left-associative manner:\n\t// a+b+c => (a+b)+c, not a+(b+c)\n\t//\n\t// Should we later want to have right-associative operators, a way\n\t// to achieve that would be to call back up to ParseExpression here\n\t// instead of iteratively parsing only the remaining operators.\n\tfor {\n\t\tnext := p.Peek()\n\t\tvar newOp *Operation\n\t\tvar ok bool\n\t\tif newOp, ok = thisLevel[next.Type]; !ok {\n\t\t\tbreak\n\t\t}\n\n\t\t// Are we extending an expression started on the previous iteration?\n\t\tif operation != nil {\n\t\t\tlhs = &BinaryOpExpr{\n\t\t\t\tLHS: lhs,\n\t\t\t\tOp: operation,\n\t\t\t\tRHS: rhs,\n\n\t\t\t\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\n\t\t\t}\n\t\t}\n\n\t\toperation = newOp\n\t\tp.Read() // eat operator token\n\t\tvar rhsDiags hcl.Diagnostics\n\t\trhs, rhsDiags = p.parseBinaryOps(remaining)\n\t\tdiags = append(diags, rhsDiags...)\n\t\tif p.recovery && rhsDiags.HasErrors() {\n\t\t\treturn lhs, diags\n\t\t}\n\t}\n\n\tif operation == nil {\n\t\treturn lhs, diags\n\t}\n\n\treturn &BinaryOpExpr{\n\t\tLHS: lhs,\n\t\tOp: operation,\n\t\tRHS: rhs,\n\n\t\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\n\t}, diags\n}","func (er *expressionRewriter) constructBinaryOpFunction(l expression.Expression, r expression.Expression, op string) (expression.Expression, error) {\n\ttrace_util_0.Count(_expression_rewriter_00000, 33)\n\tlLen, rLen := expression.GetRowLen(l), expression.GetRowLen(r)\n\tif lLen == 1 && rLen == 1 {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 35)\n\t\treturn er.newFunction(op, types.NewFieldType(mysql.TypeTiny), l, r)\n\t} else {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 36)\n\t\tif rLen != lLen {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 37)\n\t\t\treturn nil, expression.ErrOperandColumns.GenWithStackByArgs(lLen)\n\t\t}\n\t}\n\ttrace_util_0.Count(_expression_rewriter_00000, 34)\n\tswitch op {\n\tcase ast.EQ, ast.NE, ast.NullEQ:\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 38)\n\t\tfuncs := make([]expression.Expression, lLen)\n\t\tfor i := 0; i < lLen; i++ {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 46)\n\t\t\tvar err error\n\t\t\tfuncs[i], err = er.constructBinaryOpFunction(expression.GetFuncArg(l, i), expression.GetFuncArg(r, i), op)\n\t\t\tif err != nil {\n\t\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 47)\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 39)\n\t\tif op == ast.NE {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 48)\n\t\t\treturn expression.ComposeDNFCondition(er.ctx, funcs...), nil\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 40)\n\t\treturn expression.ComposeCNFCondition(er.ctx, funcs...), nil\n\tdefault:\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 41)\n\t\tlarg0, rarg0 := expression.GetFuncArg(l, 0), expression.GetFuncArg(r, 0)\n\t\tvar expr1, expr2, expr3, expr4, expr5 expression.Expression\n\t\texpr1 = expression.NewFunctionInternal(er.ctx, ast.NE, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\n\t\texpr2 = expression.NewFunctionInternal(er.ctx, op, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\n\t\texpr3 = expression.NewFunctionInternal(er.ctx, ast.IsNull, types.NewFieldType(mysql.TypeTiny), expr1)\n\t\tvar err error\n\t\tl, err = expression.PopRowFirstArg(er.ctx, l)\n\t\tif err != nil {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 49)\n\t\t\treturn nil, err\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 42)\n\t\tr, err = expression.PopRowFirstArg(er.ctx, r)\n\t\tif err != nil {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 50)\n\t\t\treturn nil, err\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 43)\n\t\texpr4, err = er.constructBinaryOpFunction(l, r, op)\n\t\tif err != nil {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 51)\n\t\t\treturn nil, err\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 44)\n\t\texpr5, err = er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr3, expression.Null, expr4)\n\t\tif err != nil {\n\t\t\ttrace_util_0.Count(_expression_rewriter_00000, 52)\n\t\t\treturn nil, err\n\t\t}\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 45)\n\t\treturn er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr1, expr2, expr5)\n\t}\n}","func check_bin_prim(t ast.Ast) func(*block) *block {\n\ta, ok := t.(ast.Apply)\n\tif ok {\n\t\ti, ok := a.Rator.(ast.Iden)\n\t\tif ok {\n\t\t\tf, ok := strict_binary_primitives[i.Val]\n\t\t\tif ok {\n\t\t\t\treturn f\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}","func (p *Parser) parseBitwiseExpression() Expression {\n\tleft := p.parseEqualityExpression()\n\tfor {\n\t\tif op, ok := p.match(ttBitAnd, ttBitOr, ttBitXor); ok {\n\t\t\tright := p.parseEqualityExpression()\n\t\t\tleft = NewBinaryExpression(left, op.typ, right)\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn left\n}","func AsBinaryExpr(node ast.Node) *ast.BinaryExpr {\n\texpr, ok := node.(*ast.BinaryExpr)\n\tif !ok {\n\t\tpanic(\"expected *ast.BinaryExpr\")\n\t}\n\treturn expr\n}","func evalBinaryFloatExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar err error\n\tvar r float64\n\n\txx, yy := x.Float(), y.Float()\n\tswitch op {\n\tcase token.ADD: r = xx + yy\n\tcase token.SUB: r = xx - yy\n\tcase token.MUL: r = xx * yy\n\tcase token.QUO: r = xx / yy\n\t// case token.EQL: b = xx == yy\n\t// case token.LSS: b = xx < yy\n\t// case token.GTR: b = xx > yy\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\treturn reflect.ValueOf(r).Convert(x.Type()), err\n}","func planLogicalProjectionOp(\n\tctx context.Context,\n\tevalCtx *tree.EvalContext,\n\texpr tree.TypedExpr,\n\tcolumnTypes []*types.T,\n\tinput colexecop.Operator,\n\tacc *mon.BoundAccount,\n\tfactory coldata.ColumnFactory,\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\n\t// Add a new boolean column that will store the result of the projection.\n\tresultIdx = len(columnTypes)\n\ttyps = appendOneType(columnTypes, types.Bool)\n\tvar (\n\t\ttypedLeft, typedRight tree.TypedExpr\n\t\tleftProjOpChain, rightProjOpChain colexecop.Operator\n\t\tleftIdx, rightIdx int\n\t)\n\tleftFeedOp := colexecop.NewFeedOperator()\n\trightFeedOp := colexecop.NewFeedOperator()\n\tswitch t := expr.(type) {\n\tcase *tree.AndExpr:\n\t\ttypedLeft = t.TypedLeft()\n\t\ttypedRight = t.TypedRight()\n\tcase *tree.OrExpr:\n\t\ttypedLeft = t.TypedLeft()\n\t\ttypedRight = t.TypedRight()\n\tdefault:\n\t\tcolexecerror.InternalError(errors.AssertionFailedf(\"unexpected logical expression type %s\", t.String()))\n\t}\n\tleftProjOpChain, leftIdx, typs, err = planProjectionOperators(\n\t\tctx, evalCtx, typedLeft, typs, leftFeedOp, acc, factory,\n\t)\n\tif err != nil {\n\t\treturn nil, resultIdx, typs, err\n\t}\n\trightProjOpChain, rightIdx, typs, err = planProjectionOperators(\n\t\tctx, evalCtx, typedRight, typs, rightFeedOp, acc, factory,\n\t)\n\tif err != nil {\n\t\treturn nil, resultIdx, typs, err\n\t}\n\tallocator := colmem.NewAllocator(ctx, acc, factory)\n\tinput = colexecutils.NewBatchSchemaSubsetEnforcer(allocator, input, typs, resultIdx, len(typs))\n\tswitch expr.(type) {\n\tcase *tree.AndExpr:\n\t\top, err = colexec.NewAndProjOp(\n\t\t\tallocator,\n\t\t\tinput, leftProjOpChain, rightProjOpChain,\n\t\t\tleftFeedOp, rightFeedOp,\n\t\t\ttyps[leftIdx], typs[rightIdx],\n\t\t\tleftIdx, rightIdx, resultIdx,\n\t\t)\n\tcase *tree.OrExpr:\n\t\top, err = colexec.NewOrProjOp(\n\t\t\tallocator,\n\t\t\tinput, leftProjOpChain, rightProjOpChain,\n\t\t\tleftFeedOp, rightFeedOp,\n\t\t\ttyps[leftIdx], typs[rightIdx],\n\t\t\tleftIdx, rightIdx, resultIdx,\n\t\t)\n\t}\n\treturn op, resultIdx, typs, err\n}","func NewBinaryExpression(left Expression, op TokenType, right Expression) *BinaryExpression {\n\treturn &BinaryExpression{\n\t\tleft: left,\n\t\top: op,\n\t\tright: right,\n\t}\n}","func planProjectionOperators(\n\tctx context.Context,\n\tevalCtx *tree.EvalContext,\n\texpr tree.TypedExpr,\n\tcolumnTypes []*types.T,\n\tinput colexecop.Operator,\n\tacc *mon.BoundAccount,\n\tfactory coldata.ColumnFactory,\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\n\t// projectDatum is a helper function that adds a new constant projection\n\t// operator for the given datum. typs are updated accordingly.\n\tprojectDatum := func(datum tree.Datum) (colexecop.Operator, error) {\n\t\tresultIdx = len(columnTypes)\n\t\tdatumType := datum.ResolvedType()\n\t\ttyps = appendOneType(columnTypes, datumType)\n\t\tif datumType.Family() == types.UnknownFamily {\n\t\t\t// We handle Unknown type by planning a special constant null\n\t\t\t// operator.\n\t\t\treturn colexecbase.NewConstNullOp(colmem.NewAllocator(ctx, acc, factory), input, resultIdx), nil\n\t\t}\n\t\tconstVal := colconv.GetDatumToPhysicalFn(datumType)(datum)\n\t\treturn colexecbase.NewConstOp(colmem.NewAllocator(ctx, acc, factory), input, datumType, constVal, resultIdx)\n\t}\n\tresultIdx = -1\n\tswitch t := expr.(type) {\n\tcase *tree.IndexedVar:\n\t\treturn input, t.Idx, columnTypes, nil\n\tcase *tree.ComparisonExpr:\n\t\treturn planProjectionExpr(\n\t\t\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\n\t\t\tcolumnTypes, input, acc, factory, nil /* binFn */, t,\n\t\t)\n\tcase *tree.BinaryExpr:\n\t\tif err = checkSupportedBinaryExpr(t.TypedLeft(), t.TypedRight(), t.ResolvedType()); err != nil {\n\t\t\treturn op, resultIdx, typs, err\n\t\t}\n\t\treturn planProjectionExpr(\n\t\t\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\n\t\t\tcolumnTypes, input, acc, factory, t.Fn.Fn, nil, /* cmpExpr */\n\t\t)\n\tcase *tree.IsNullExpr:\n\t\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, false /* negate */, factory)\n\tcase *tree.IsNotNullExpr:\n\t\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, true /* negate */, factory)\n\tcase *tree.CastExpr:\n\t\texpr := t.Expr.(tree.TypedExpr)\n\t\top, resultIdx, typs, err = planProjectionOperators(\n\t\t\tctx, evalCtx, expr, columnTypes, input, acc, factory,\n\t\t)\n\t\tif err != nil {\n\t\t\treturn nil, 0, nil, err\n\t\t}\n\t\top, resultIdx, typs, err = planCastOperator(ctx, acc, typs, op, resultIdx, expr.ResolvedType(), t.ResolvedType(), factory)\n\t\treturn op, resultIdx, typs, err\n\tcase *tree.FuncExpr:\n\t\tvar inputCols []int\n\t\ttyps = make([]*types.T, len(columnTypes))\n\t\tcopy(typs, columnTypes)\n\t\top = input\n\t\tfor _, e := range t.Exprs {\n\t\t\tvar err error\n\t\t\t// TODO(rohany): This could be done better, especially in the case\n\t\t\t// of constant arguments, because the vectorized engine right now\n\t\t\t// creates a new column full of the constant value.\n\t\t\top, resultIdx, typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, e.(tree.TypedExpr), typs, op, acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, nil, err\n\t\t\t}\n\t\t\tinputCols = append(inputCols, resultIdx)\n\t\t}\n\t\tresultIdx = len(typs)\n\t\top, err = colexec.NewBuiltinFunctionOperator(\n\t\t\tcolmem.NewAllocator(ctx, acc, factory), evalCtx, t, typs, inputCols, resultIdx, op,\n\t\t)\n\t\ttyps = appendOneType(typs, t.ResolvedType())\n\t\treturn op, resultIdx, typs, err\n\tcase tree.Datum:\n\t\top, err = projectDatum(t)\n\t\treturn op, resultIdx, typs, err\n\tcase *tree.Tuple:\n\t\tisConstTuple := true\n\t\tfor _, expr := range t.Exprs {\n\t\t\tif _, isDatum := expr.(tree.Datum); !isDatum {\n\t\t\t\tisConstTuple = false\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif isConstTuple {\n\t\t\t// Tuple expression is a constant, so we can evaluate it and\n\t\t\t// project the resulting datum.\n\t\t\ttuple, err := t.Eval(evalCtx)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t\top, err = projectDatum(tuple)\n\t\t\treturn op, resultIdx, typs, err\n\t\t}\n\t\toutputType := t.ResolvedType()\n\t\ttyps = make([]*types.T, len(columnTypes))\n\t\tcopy(typs, columnTypes)\n\t\ttupleContentsIdxs := make([]int, len(t.Exprs))\n\t\tfor i, expr := range t.Exprs {\n\t\t\tinput, tupleContentsIdxs[i], typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, expr.(tree.TypedExpr), typs, input, acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t}\n\t\tresultIdx = len(typs)\n\t\top = colexec.NewTupleProjOp(\n\t\t\tcolmem.NewAllocator(ctx, acc, factory), typs, tupleContentsIdxs, outputType, input, resultIdx,\n\t\t)\n\t\ttyps = appendOneType(typs, outputType)\n\t\treturn op, resultIdx, typs, err\n\tcase *tree.CaseExpr:\n\t\tif t.Expr != nil {\n\t\t\treturn nil, resultIdx, typs, errors.New(\"CASE <expr> WHEN expressions unsupported\")\n\t\t}\n\n\t\tallocator := colmem.NewAllocator(ctx, acc, factory)\n\t\tcaseOutputType := t.ResolvedType()\n\t\tif typeconv.TypeFamilyToCanonicalTypeFamily(caseOutputType.Family()) == types.BytesFamily {\n\t\t\t// Currently, there is a contradiction between the way CASE operator\n\t\t\t// works (which populates its output in arbitrary order) and the\n\t\t\t// flat bytes implementation of Bytes type (which prohibits sets in\n\t\t\t// arbitrary order), so we reject such scenario to fall back to\n\t\t\t// row-by-row engine.\n\t\t\treturn nil, resultIdx, typs, errors.Newf(\n\t\t\t\t\"unsupported type %s in CASE operator\", caseOutputType)\n\t\t}\n\t\tcaseOutputIdx := len(columnTypes)\n\t\t// We don't know the schema yet and will update it below, right before\n\t\t// instantiating caseOp. The same goes for subsetEndIdx.\n\t\tschemaEnforcer := colexecutils.NewBatchSchemaSubsetEnforcer(\n\t\t\tallocator, input, nil /* typs */, caseOutputIdx, -1, /* subsetEndIdx */\n\t\t)\n\t\tbuffer := colexec.NewBufferOp(schemaEnforcer)\n\t\tcaseOps := make([]colexecop.Operator, len(t.Whens))\n\t\ttyps = appendOneType(columnTypes, caseOutputType)\n\t\tthenIdxs := make([]int, len(t.Whens)+1)\n\t\tfor i, when := range t.Whens {\n\t\t\t// The case operator is assembled from n WHEN arms, n THEN arms, and\n\t\t\t// an ELSE arm. Each WHEN arm is a boolean projection. Each THEN arm\n\t\t\t// (and the ELSE arm) is a projection of the type of the CASE\n\t\t\t// expression. We set up each WHEN arm to write its output to a\n\t\t\t// fresh column, and likewise for the THEN arms and the ELSE arm.\n\t\t\t// Each WHEN arm individually acts on the single input batch from\n\t\t\t// the CaseExpr's input and is then transformed into a selection\n\t\t\t// vector, after which the THEN arm runs to create the output just\n\t\t\t// for the tuples that matched the WHEN arm. Each subsequent WHEN\n\t\t\t// arm will use the inverse of the selection vector to avoid running\n\t\t\t// the WHEN projection on tuples that have already been matched by a\n\t\t\t// previous WHEN arm. Finally, after each WHEN arm runs, we copy the\n\t\t\t// results of the WHEN into a single output vector, assembling the\n\t\t\t// final result of the case projection.\n\t\t\twhenTyped := when.Cond.(tree.TypedExpr)\n\t\t\tcaseOps[i], resultIdx, typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, whenTyped, typs, buffer, acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t\tcaseOps[i], err = colexecutils.BoolOrUnknownToSelOp(caseOps[i], typs, resultIdx)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\n\t\t\t// Run the \"then\" clause on those tuples that were selected.\n\t\t\tcaseOps[i], thenIdxs[i], typs, err = planProjectionOperators(\n\t\t\t\tctx, evalCtx, when.Val.(tree.TypedExpr), typs, caseOps[i], acc, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t\tif !typs[thenIdxs[i]].Identical(typs[caseOutputIdx]) {\n\t\t\t\t// It is possible that the projection of this THEN arm has\n\t\t\t\t// different column type (for example, we expect INT2, but INT8\n\t\t\t\t// is given). In such case, we need to plan a cast.\n\t\t\t\tfromType, toType := typs[thenIdxs[i]], typs[caseOutputIdx]\n\t\t\t\tcaseOps[i], thenIdxs[i], typs, err = planCastOperator(\n\t\t\t\t\tctx, acc, typs, caseOps[i], thenIdxs[i], fromType, toType, factory,\n\t\t\t\t)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvar elseOp colexecop.Operator\n\t\telseExpr := t.Else\n\t\tif elseExpr == nil {\n\t\t\t// If there's no ELSE arm, we write NULLs.\n\t\t\telseExpr = tree.DNull\n\t\t}\n\t\telseOp, thenIdxs[len(t.Whens)], typs, err = planProjectionOperators(\n\t\t\tctx, evalCtx, elseExpr.(tree.TypedExpr), typs, buffer, acc, factory,\n\t\t)\n\t\tif err != nil {\n\t\t\treturn nil, resultIdx, typs, err\n\t\t}\n\t\tif !typs[thenIdxs[len(t.Whens)]].Identical(typs[caseOutputIdx]) {\n\t\t\t// It is possible that the projection of the ELSE arm has different\n\t\t\t// column type (for example, we expect INT2, but INT8 is given). In\n\t\t\t// such case, we need to plan a cast.\n\t\t\telseIdx := thenIdxs[len(t.Whens)]\n\t\t\tfromType, toType := typs[elseIdx], typs[caseOutputIdx]\n\t\t\telseOp, thenIdxs[len(t.Whens)], typs, err = planCastOperator(\n\t\t\t\tctx, acc, typs, elseOp, elseIdx, fromType, toType, factory,\n\t\t\t)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, resultIdx, typs, err\n\t\t\t}\n\t\t}\n\n\t\tschemaEnforcer.SetTypes(typs)\n\t\top := colexec.NewCaseOp(allocator, buffer, caseOps, elseOp, thenIdxs, caseOutputIdx, caseOutputType)\n\t\treturn op, caseOutputIdx, typs, err\n\tcase *tree.AndExpr, *tree.OrExpr:\n\t\treturn planLogicalProjectionOp(ctx, evalCtx, expr, columnTypes, input, acc, factory)\n\tdefault:\n\t\treturn nil, resultIdx, nil, errors.Errorf(\"unhandled projection expression type: %s\", reflect.TypeOf(t))\n\t}\n}","func ToBinaryExpr(x ast.Node) *ast.BinaryExpr {\n\tif x, ok := x.(*ast.BinaryExpr); ok {\n\t\treturn x\n\t}\n\treturn NilBinaryExpr\n}","func (expr *BinaryExpr) String() string {\n\tswitch expr.Op {\n\tcase PLUS:\n\t\treturn expr.X.String() + \" + \" + expr.Y.String()\n\tcase MINUS:\n\t\treturn expr.X.String() + \" - \" + expr.Y.String()\n\tcase STAR:\n\t\treturn expr.X.String() + \" * \" + expr.Y.String()\n\tcase SLASH:\n\t\treturn expr.X.String() + \" / \" + expr.Y.String()\n\tcase REM:\n\t\treturn expr.X.String() + \" % \" + expr.Y.String()\n\tcase CONCAT:\n\t\treturn expr.X.String() + \" || \" + expr.Y.String()\n\tcase BETWEEN:\n\t\treturn expr.X.String() + \" BETWEEN \" + expr.Y.String()\n\tcase NOTBETWEEN:\n\t\treturn expr.X.String() + \" NOT BETWEEN \" + expr.Y.String()\n\tcase LSHIFT:\n\t\treturn expr.X.String() + \" << \" + expr.Y.String()\n\tcase RSHIFT:\n\t\treturn expr.X.String() + \" >> \" + expr.Y.String()\n\tcase BITAND:\n\t\treturn expr.X.String() + \" & \" + expr.Y.String()\n\tcase BITOR:\n\t\treturn expr.X.String() + \" | \" + expr.Y.String()\n\tcase LT:\n\t\treturn expr.X.String() + \" < \" + expr.Y.String()\n\tcase LE:\n\t\treturn expr.X.String() + \" <= \" + expr.Y.String()\n\tcase GT:\n\t\treturn expr.X.String() + \" > \" + expr.Y.String()\n\tcase GE:\n\t\treturn expr.X.String() + \" >= \" + expr.Y.String()\n\tcase EQ:\n\t\treturn expr.X.String() + \" = \" + expr.Y.String()\n\tcase NE:\n\t\treturn expr.X.String() + \" != \" + expr.Y.String()\n\tcase IS:\n\t\treturn expr.X.String() + \" IS \" + expr.Y.String()\n\tcase ISNOT:\n\t\treturn expr.X.String() + \" IS NOT \" + expr.Y.String()\n\tcase IN:\n\t\treturn expr.X.String() + \" IN \" + expr.Y.String()\n\tcase NOTIN:\n\t\treturn expr.X.String() + \" NOT IN \" + expr.Y.String()\n\tcase LIKE:\n\t\treturn expr.X.String() + \" LIKE \" + expr.Y.String()\n\tcase NOTLIKE:\n\t\treturn expr.X.String() + \" NOT LIKE \" + expr.Y.String()\n\tcase GLOB:\n\t\treturn expr.X.String() + \" GLOB \" + expr.Y.String()\n\tcase NOTGLOB:\n\t\treturn expr.X.String() + \" NOT GLOB \" + expr.Y.String()\n\tcase MATCH:\n\t\treturn expr.X.String() + \" MATCH \" + expr.Y.String()\n\tcase NOTMATCH:\n\t\treturn expr.X.String() + \" NOT MATCH \" + expr.Y.String()\n\tcase REGEXP:\n\t\treturn expr.X.String() + \" REGEXP \" + expr.Y.String()\n\tcase NOTREGEXP:\n\t\treturn expr.X.String() + \" NOT REGEXP \" + expr.Y.String()\n\tcase AND:\n\t\treturn expr.X.String() + \" AND \" + expr.Y.String()\n\tcase OR:\n\t\treturn expr.X.String() + \" OR \" + expr.Y.String()\n\tdefault:\n\t\tpanic(fmt.Sprintf(\"sql.BinaryExpr.String(): invalid op %s\", expr.Op))\n\t}\n}","func (p *ExecutionPlanner) compileExpr(expr parser.Expr) (_ types.PlanExpression, err error) {\n\tif expr == nil {\n\t\treturn nil, nil\n\t}\n\n\tswitch expr := expr.(type) {\n\tcase *parser.BinaryExpr:\n\t\treturn p.compileBinaryExpr(expr)\n\n\tcase *parser.BoolLit:\n\t\treturn newBoolLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.Call:\n\t\treturn p.compileCallExpr(expr)\n\n\tcase *parser.CastExpr:\n\t\tcastExpr, err := p.compileExpr(expr.X)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tdataType, err := dataTypeFromParserType(expr.Type)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newCastPlanExpression(castExpr, dataType), nil\n\n\tcase *parser.Exists:\n\t\treturn nil, sql3.NewErrInternal(\"exists expressions are not supported\")\n\n\tcase *parser.ExprList:\n\t\texprList := []types.PlanExpression{}\n\t\tfor _, e := range expr.Exprs {\n\t\t\tlistExpr, err := p.compileExpr(e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\texprList = append(exprList, listExpr)\n\t\t}\n\t\treturn newExprListExpression(exprList), nil\n\n\tcase *parser.SetLiteralExpr:\n\t\texprList := []types.PlanExpression{}\n\t\tfor _, e := range expr.Members {\n\t\t\tlistExpr, err := p.compileExpr(e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\texprList = append(exprList, listExpr)\n\t\t}\n\t\treturn newExprSetLiteralPlanExpression(exprList, expr.DataType()), nil\n\n\tcase *parser.TupleLiteralExpr:\n\t\texprList := []types.PlanExpression{}\n\t\tfor _, e := range expr.Members {\n\t\t\tlistExpr, err := p.compileExpr(e)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\texprList = append(exprList, listExpr)\n\t\t}\n\t\treturn newExprTupleLiteralPlanExpression(exprList, expr.DataType()), nil\n\n\tcase *parser.Ident:\n\t\treturn nil, sql3.NewErrInternal(\"identifiers are not supported\")\n\n\tcase *parser.NullLit:\n\t\treturn newNullLiteralPlanExpression(), nil\n\n\tcase *parser.IntegerLit:\n\t\treturn newIntLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.FloatLit:\n\t\treturn newFloatLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.DateLit:\n\t\treturn newDateLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.ParenExpr:\n\t\treturn p.compileExpr(expr.X)\n\n\tcase *parser.QualifiedRef:\n\t\tref := newQualifiedRefPlanExpression(parser.IdentName(expr.Table), parser.IdentName(expr.Column), expr.ColumnIndex, expr.DataType())\n\t\tp.addReference(ref)\n\t\treturn ref, nil\n\n\tcase *parser.Range:\n\t\tlhs, err := p.compileExpr(expr.X)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\trhs, err := p.compileExpr(expr.Y)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newRangeOpPlanExpression(lhs, rhs, expr.ResultDataType), nil\n\n\tcase *parser.StringLit:\n\t\treturn newStringLiteralPlanExpression(expr.Value), nil\n\n\tcase *parser.UnaryExpr:\n\t\treturn p.compileUnaryExpr(expr)\n\n\tcase *parser.CaseExpr:\n\t\toperand, err := p.compileExpr(expr.Operand)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tblocks := []types.PlanExpression{}\n\t\tfor _, b := range expr.Blocks {\n\t\t\tblock, err := p.compileExpr(b)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tblocks = append(blocks, block)\n\t\t}\n\n\t\telseExpr, err := p.compileExpr(expr.ElseExpr)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newCasePlanExpression(operand, blocks, elseExpr, expr.DataType()), nil\n\n\tcase *parser.CaseBlock:\n\n\t\tcondition, err := p.compileExpr(expr.Condition)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tbody, err := p.compileExpr(expr.Body)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newCaseBlockPlanExpression(condition, body), nil\n\n\tcase *parser.SelectStatement:\n\t\tselOp, err := p.compileSelectStatement(expr, true)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\treturn newSubqueryPlanExpression(selOp), nil\n\n\tdefault:\n\t\treturn nil, sql3.NewErrInternalf(\"unexpected SQL expression type: %T\", expr)\n\t}\n}","func (e *binaryExprEvaluator) start() {\n\te.lhs.start()\n\te.rhs.start()\n\tgo e.run()\n}","func chopBinary(expr string) (left, op, right string, ok bool) {\n\t// XXX implementation redacted for CHALLENGE1.\n\t// TODO restore implementation and replace '__'\n\tparts := strings.Split(expr, \"__\")\n\tif len(parts) != 3 {\n\t\treturn\n\t}\n\tleft = parts[0]\n\top = parts[1]\n\tright = parts[2]\n\tok = true\n\treturn\n}","func performBinOp(optr string, oprnd1 string, oprnd2 string) string {\n\n\t//Connect to server (TESTING)\n\tclient, _ := redis.Dial(&redis.DialConfig{Address: \"127.0.0.1:6379\"})\n\n\tlog.Println(\"Evaluating: \", oprnd1, \" \", optr, \" \", oprnd2)\n\n\ti1, n1 := buildIndex(oprnd1)\n\ti2, n2 := buildIndex(oprnd2)\n\n\t//Verify the existence of both indices, log fatal if not exists\n\ti1exists, _ := client.Exists(i1)\n\ti2exists, _ := client.Exists(i2)\n\n\tif !i1exists {\n\t\tlog.Fatal(\"KEY DOES NOT EXIST: \", i1)\n\t}\n\tif !i2exists {\n\t\tlog.Fatal(\"KEY DOES NOT EXIST: \", i2)\n\t}\n\n\t//If the first operand is negated, create a temporary (virtual) idnex\n\tif n1 {\n\t\tclient.BitOp(\"NOT:\" + i1, i1)\n\t\ti1 = \"NOT:\" + i1\n\t}\n\t//If the second operand is negated, create a temporary (virtual) idnex\n\tif n2 {\n\t\tclient.BitOp(\"NOT:\" + i2, i2)\n\t\ti2 = \"NOT:\" + i2\n\t}\n\n\t//Perform the operation\n\tclient.BitOp(optr, i1 + optr + i2, i1, i2)\n\n\tlog.Println(\"('\" + i1 + optr + i2 + \"')\")\n\treturn \"('\" + i1 + optr + i2 + \"')\"\n}","func Binary(sc trace.SpanContext) []byte {\n\tif sc == (trace.SpanContext{}) {\n\t\treturn nil\n\t}\n\tvar b [29]byte\n\tcopy(b[2:18], sc.TraceID[:])\n\tb[18] = 1\n\tcopy(b[19:27], sc.SpanID[:])\n\tb[27] = 2\n\tb[28] = uint8(sc.TraceOptions)\n\treturn b[:]\n}","func _binaryArith(i Instruction, ls *LuaState, op ArithOp) {\n\ta, b, c := i.ABC()\n\ta += 1\n\n\tls.getRK(b)\n\tls.getRK(c)\n\tluaArith(ls, op)\n\tluaReplace(ls, a)\n}","func PAND(mx, x operand.Op) { ctx.PAND(mx, x) }","func (b *BinaryExpr) Evaluate(env ExpressionEnv) (EvalResult, error) {\n\tlVal, err := b.Left.Evaluate(env)\n\tif err != nil {\n\t\treturn EvalResult{}, err\n\t}\n\trVal, err := b.Right.Evaluate(env)\n\tif err != nil {\n\t\treturn EvalResult{}, err\n\t}\n\treturn b.Op.Evaluate(lVal, rVal)\n}","func binaryEval(binaryOp stmt.BinaryOP, left, right *collections.FloatArray) *collections.FloatArray {\n\tif left == nil || right == nil {\n\t\treturn nil\n\t}\n\tif left.IsEmpty() && right.IsEmpty() {\n\t\treturn nil\n\t}\n\n\tcapacity := left.Capacity()\n\tresult := collections.NewFloatArray(capacity)\n\n\tfor i := 0; i < capacity; i++ {\n\t\tleftHasValue := left.HasValue(i)\n\t\trightHasValue := right.HasValue(i)\n\t\tswitch {\n\t\tcase !leftHasValue && right.IsSingle():\n\t\tcase left.IsSingle() && !rightHasValue:\n\t\tcase leftHasValue || rightHasValue:\n\t\t\tresult.SetValue(i, eval(binaryOp, left.GetValue(i), right.GetValue(i)))\n\t\t}\n\t}\n\n\treturn result\n}","func PMINSB(mx, x operand.Op) { ctx.PMINSB(mx, x) }","func TestCheckBinaryExprComplexAndComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i & 8.0i`, env,\n\t\t`illegal constant expression: untyped number & untyped number`,\n\t)\n\n}","func TestCheckBinaryExprComplexAndInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i & 4`, env,\n\t\t`illegal constant expression: untyped number & untyped number`,\n\t)\n\n}","func VPBROADCASTW(ops ...operand.Op) { ctx.VPBROADCASTW(ops...) }","func reduceBinOp(op string, left, right *LiteralExpr) *LiteralExpr {\n\tmerged := mergeBinOp(\n\t\top,\n\t\t&promql.Sample{Point: promql.Point{V: left.value}},\n\t\t&promql.Sample{Point: promql.Point{V: right.value}},\n\t\tfalse,\n\t\tfalse,\n\t)\n\treturn &LiteralExpr{value: merged.V}\n}","func TestCheckBinaryExprComplexAndBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i & true`, env,\n\t\t`cannot convert true to type complex128`,\n\t\t`invalid operation: 8i & true (mismatched types complex128 and bool)`,\n\t)\n\n}","func generate(op string) {\n\tswitch op {\n\tcase \"and\":\n\t\tTEXT(\"And\", NOSPLIT, \"func(a []uint64, b []uint64)\")\n\t\tDoc(\"And And computes the intersection between two slices and stores the result in the first one\")\n\tcase \"or\":\n\t\tTEXT(\"Or\", NOSPLIT, \"func(a []uint64, b []uint64)\")\n\t\tDoc(\"Or computes the union between two slices and stores the result in the first one\")\n\tcase \"andnot\":\n\t\tTEXT(\"AndNot\", NOSPLIT, \"func(a []uint64, b []uint64)\")\n\t\tDoc(\"AndNot computes the difference between two slices and stores the result in the first one\")\n\tcase \"xor\":\n\t\tTEXT(\"Xor\", NOSPLIT, \"func(a []uint64, b []uint64)\")\n\t\tDoc(\"Xor computes the symmetric difference between two slices and stores the result in the first one\")\n\t}\n\n\t// Load the a and b addresses as well as the current len(a). Assume len(a) == len(b)\n\ta := Mem{Base: Load(Param(\"a\").Base(), GP64())}\n\tb := Mem{Base: Load(Param(\"b\").Base(), GP64())}\n\tn := Load(Param(\"a\").Len(), GP64())\n\n\t// The register for the tail, we xor it with itself to zero out\n\ts := GP64()\n\tXORQ(s, s)\n\n\tconst size, unroll = 32, 2 // bytes (256bit * 2)\n\tconst blocksize = size * unroll\n\n\tCommentf(\"perform vectorized operation for every block of %v bits\", blocksize*8)\n\tLabel(\"body\")\n\tCMPQ(n, U32(4*unroll))\n\tJL(LabelRef(\"tail\"))\n\n\t// Create a vector\n\tvector := make([]VecVirtual, unroll)\n\tfor i := 0; i < unroll; i++ {\n\t\tvector[i] = YMM()\n\t}\n\n\t// Move memory vector into position\n\tCommentf(\"perform the logical \\\"%v\\\" operation\", strings.ToUpper(op))\n\tfor i := 0; i < unroll; i++ {\n\t\tVMOVUPD(b.Offset(size*i), vector[i])\n\t}\n\n\t// Perform the actual operation\n\tfor i := 0; i < unroll; i++ {\n\t\tswitch op {\n\t\tcase \"and\":\n\t\t\tVPAND(a.Offset(size*i), vector[i], vector[i])\n\t\tcase \"or\":\n\t\t\tVPOR(a.Offset(size*i), vector[i], vector[i])\n\t\tcase \"andnot\":\n\t\t\tVPANDN(a.Offset(size*i), vector[i], vector[i])\n\t\tcase \"xor\":\n\t\t\tVPXOR(a.Offset(size*i), vector[i], vector[i])\n\t\t}\n\t}\n\n\t// Move the result to \"a\" by copying the vector\n\tfor i := 0; i < unroll; i++ {\n\t\tVMOVUPD(vector[i], a.Offset(size*i))\n\t}\n\n\t// Continue the iteration\n\tComment(\"continue the interation by moving read pointers\")\n\tADDQ(U32(blocksize), a.Base)\n\tADDQ(U32(blocksize), b.Base)\n\tSUBQ(U32(4*unroll), n)\n\tJMP(LabelRef(\"body\"))\n\n\t// Now, we only have less than 512 bits left, use normal scalar operation\n\tLabel(\"tail\")\n\tCMPQ(n, Imm(0))\n\tJE(LabelRef(\"done\"))\n\n\t// Perform the actual operation\n\tCommentf(\"perform the logical \\\"%v\\\" operation\", strings.ToUpper(op))\n\tMOVQ(Mem{Base: b.Base}, s)\n\tswitch op {\n\tcase \"and\":\n\t\tANDQ(Mem{Base: a.Base}, s)\n\tcase \"or\":\n\t\tORQ(Mem{Base: a.Base}, s)\n\tcase \"andnot\":\n\t\tANDNQ(Mem{Base: a.Base}, s, s)\n\tcase \"xor\":\n\t\tXORQ(Mem{Base: a.Base}, s)\n\t}\n\tMOVQ(s, Mem{Base: a.Base})\n\n\t// Continue the iteration\n\tComment(\"continue the interation by moving read pointers\")\n\tADDQ(U32(8), a.Base)\n\tADDQ(U32(8), b.Base)\n\tSUBQ(U32(1), n)\n\tJMP(LabelRef(\"tail\"))\n\n\tLabel(\"done\")\n\tRET()\n}","func ANDPS(mx, x operand.Op) { ctx.ANDPS(mx, x) }","func TestCheckBinaryExprBoolAndComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true & 8.0i`, env,\n\t\t`cannot convert 8i to type bool`,\n\t\t`invalid operation: true & 8i (mismatched types bool and complex128)`,\n\t)\n\n}","func TestCheckBinaryExprBoolAddComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true + 8.0i`, env,\n\t\t`cannot convert 8i to type bool`,\n\t\t`invalid operation: true + 8i (mismatched types bool and complex128)`,\n\t)\n\n}","func TestCheckBinaryExprIntAddBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `4 + true`, env,\n\t\t`cannot convert true to type int`,\n\t\t`invalid operation: 4 + true (mismatched types int and bool)`,\n\t)\n\n}","func binaryOperation(operation string, a, b NumberArray) (resultingMatrix NumberArray, err error) {\n\tvar mathFunc binaryMathFunc\n\tswitch operation {\n\tcase \"Add\":\n\t\tmathFunc = add\n\tcase \"Substract\":\n\t\tmathFunc = substract\n\tcase \"MultiplyElementwise\":\n\t\tmathFunc = multiply\n\tdefault:\n\t\treturn resultingMatrix, fmt.Errorf(\"Can't handle the given operation:\"+\n\t\t\t\" %v\\n\", operation)\n\t}\n\tif !EqualDimensions(a, b) {\n\t\treturn resultingMatrix, fmt.Errorf(\"Can't perform \" + operation + \" on\" +\n\t\t\t\" matrices of different dimensions\")\n\t}\n\tresultingMatrix, _ = NewMatrix(a.GetRows(), a.GetColumns())\n\tfor i := 0; i < a.GetRows(); i++ {\n\t\tfor j := 0; j < a.GetColumns(); j++ {\n\t\t\toperandA, _ := a.GetValue(i, j)\n\t\t\toperandB, _ := b.GetValue(i, j)\n\t\t\tresultingMatrix.SetValue(i, j, mathFunc(operandA, operandB))\n\t\t}\n\t}\n\treturn resultingMatrix, err\n}","func composeConditionWithBinaryOp(ctx sessionctx.Context, conditions []Expression, funcName string) Expression {\n\tlength := len(conditions)\n\tif length == 0 {\n\t\treturn nil\n\t}\n\tif length == 1 {\n\t\treturn conditions[0]\n\t}\n\texpr := NewFunctionInternal(ctx, funcName,\n\t\ttypes.NewFieldType(mysql.TypeTiny),\n\t\tcomposeConditionWithBinaryOp(ctx, conditions[:length/2], funcName),\n\t\tcomposeConditionWithBinaryOp(ctx, conditions[length/2:], funcName))\n\treturn expr\n}","func TestCheckBinaryExprBoolAddInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true + 4`, env,\n\t\t`cannot convert 4 to type bool`,\n\t\t`invalid operation: true + 4 (mismatched types bool and int)`,\n\t)\n\n}","func ANDPD(mx, x operand.Op) { ctx.ANDPD(mx, x) }","func ANDNPS(mx, x operand.Op) { ctx.ANDNPS(mx, x) }","func PANDN(mx, x operand.Op) { ctx.PANDN(mx, x) }","func (s *BaseSyslParserListener) EnterExpr_bitand(ctx *Expr_bitandContext) {}","func TestCheckBinaryExprIntAndBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `4 & true`, env,\n\t\t`cannot convert true to type int`,\n\t\t`invalid operation: 4 & true (mismatched types int and bool)`,\n\t)\n\n}","func (s *BasePlSqlParserListener) EnterUnary_logical_expression(ctx *Unary_logical_expressionContext) {\n}","func Binary(subtype byte, data []byte) Val {\n\treturn Val{t: bsontype.Binary, primitive: primitive.Binary{Subtype: subtype, Data: data}}\n}","func TestCheckBinaryExprBoolAddBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true + true`, env,\n\t\t`invalid operation: true + true (operator + not defined on bool)`,\n\t)\n\n}","func BitwiseAnd(a, b Expr) Expr {\n\treturn &arithmeticOperator{&simpleOperator{a, b, scanner.BITWISEAND}}\n}","func EqualsRefOfBinaryExpr(a, b *BinaryExpr) bool {\n\tif a == b {\n\t\treturn true\n\t}\n\tif a == nil || b == nil {\n\t\treturn false\n\t}\n\treturn a.Operator == b.Operator &&\n\t\tEqualsExpr(a.Left, b.Left) &&\n\t\tEqualsExpr(a.Right, b.Right)\n}","func TestCheckBinaryExprComplexAddBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i + true`, env,\n\t\t`cannot convert true to type complex128`,\n\t\t`invalid operation: 8i + true (mismatched types complex128 and bool)`,\n\t)\n\n}","func TestCheckBinaryExprBoolAndInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true & 4`, env,\n\t\t`cannot convert 4 to type bool`,\n\t\t`invalid operation: true & 4 (mismatched types bool and int)`,\n\t)\n\n}","func binaryMatrixOp(c Context, i Value, op string, j Value) Value {\n\tu, v := i.(*Matrix), j.(*Matrix)\n\tshape := u.shape\n\tvar n []Value\n\t// One or the other may be a scalar in disguise.\n\tswitch {\n\tcase isScalar(u):\n\t\t// Scalar op Matrix.\n\t\tshape = v.shape\n\t\tn = make([]Value, len(v.data))\n\t\tfor k := range v.data {\n\t\t\tn[k] = c.EvalBinary(u.data[0], op, v.data[k])\n\t\t}\n\tcase isScalar(v):\n\t\t// Matrix op Scalar.\n\t\tn = make([]Value, len(u.data))\n\t\tfor k := range u.data {\n\t\t\tn[k] = c.EvalBinary(u.data[k], op, v.data[0])\n\t\t}\n\tcase isVector(u, v.shape):\n\t\t// Vector op Matrix.\n\t\tshape = v.shape\n\t\tn = make([]Value, len(v.data))\n\t\tdim := u.shape[0]\n\t\tindex := 0\n\t\tfor k := range v.data {\n\t\t\tn[k] = c.EvalBinary(u.data[index], op, v.data[k])\n\t\t\tindex++\n\t\t\tif index >= dim {\n\t\t\t\tindex = 0\n\t\t\t}\n\t\t}\n\tcase isVector(v, u.shape):\n\t\t// Matrix op Vector.\n\t\tn = make([]Value, len(u.data))\n\t\tdim := v.shape[0]\n\t\tindex := 0\n\t\tfor k := range u.data {\n\t\t\tn[k] = c.EvalBinary(u.data[k], op, v.data[index])\n\t\t\tindex++\n\t\t\tif index >= dim {\n\t\t\t\tindex = 0\n\t\t\t}\n\t\t}\n\tdefault:\n\t\t// Matrix op Matrix.\n\t\tu.sameShape(v)\n\t\tn = make([]Value, len(u.data))\n\t\tfor k := range u.data {\n\t\t\tn[k] = c.EvalBinary(u.data[k], op, v.data[k])\n\t\t}\n\t}\n\treturn NewMatrix(shape, NewVector(n))\n}","func TestCheckBinaryExprIntAndComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `4 & 8.0i`, env,\n\t\t`illegal constant expression: untyped number & untyped number`,\n\t)\n\n}","func TestCheckBinaryExprIntAndInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectConst(t, `4 & 4`, env, NewConstInt64(4 & 4), ConstInt)\n}","func init() {\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenVerticalBarVerticalBar,\n\t\tleftBindingPower: exprLeftBindingPowerLogicalOr,\n\t\toperation: ast.OperationOr,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenAmpersandAmpersand,\n\t\tleftBindingPower: exprLeftBindingPowerLogicalAnd,\n\t\toperation: ast.OperationAnd,\n\t})\n\n\tdefineLessThanOrTypeArgumentsExpression()\n\tdefineGreaterThanOrBitwiseRightShiftExpression()\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenLessEqual,\n\t\tleftBindingPower: exprLeftBindingPowerComparison,\n\t\toperation: ast.OperationLessEqual,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenGreaterEqual,\n\t\tleftBindingPower: exprLeftBindingPowerComparison,\n\t\toperation: ast.OperationGreaterEqual,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenEqualEqual,\n\t\tleftBindingPower: exprLeftBindingPowerComparison,\n\t\toperation: ast.OperationEqual,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenNotEqual,\n\t\tleftBindingPower: exprLeftBindingPowerComparison,\n\t\toperation: ast.OperationNotEqual,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenDoubleQuestionMark,\n\t\tleftBindingPower: exprLeftBindingPowerNilCoalescing,\n\t\toperation: ast.OperationNilCoalesce,\n\t\trightAssociative: true,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenVerticalBar,\n\t\tleftBindingPower: exprLeftBindingPowerBitwiseOr,\n\t\toperation: ast.OperationBitwiseOr,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenCaret,\n\t\tleftBindingPower: exprLeftBindingPowerBitwiseXor,\n\t\toperation: ast.OperationBitwiseXor,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenAmpersand,\n\t\tleftBindingPower: exprLeftBindingPowerBitwiseAnd,\n\t\toperation: ast.OperationBitwiseAnd,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenLessLess,\n\t\tleftBindingPower: exprLeftBindingPowerBitwiseShift,\n\t\toperation: ast.OperationBitwiseLeftShift,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenPlus,\n\t\tleftBindingPower: exprLeftBindingPowerAddition,\n\t\toperation: ast.OperationPlus,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenMinus,\n\t\tleftBindingPower: exprLeftBindingPowerAddition,\n\t\toperation: ast.OperationMinus,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenStar,\n\t\tleftBindingPower: exprLeftBindingPowerMultiplication,\n\t\toperation: ast.OperationMul,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenSlash,\n\t\tleftBindingPower: exprLeftBindingPowerMultiplication,\n\t\toperation: ast.OperationDiv,\n\t})\n\n\tdefineExpr(binaryExpr{\n\t\ttokenType: lexer.TokenPercent,\n\t\tleftBindingPower: exprLeftBindingPowerMultiplication,\n\t\toperation: ast.OperationMod,\n\t})\n\n\tdefineIdentifierLeftDenotations()\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenBinaryIntegerLiteral,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\treturn parseIntegerLiteral(\n\t\t\t\tp,\n\t\t\t\tliteral,\n\t\t\t\tliteral[2:],\n\t\t\t\tcommon.IntegerLiteralKindBinary,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenOctalIntegerLiteral,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\treturn parseIntegerLiteral(\n\t\t\t\tp,\n\t\t\t\tliteral,\n\t\t\t\tliteral[2:],\n\t\t\t\tcommon.IntegerLiteralKindOctal,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenDecimalIntegerLiteral,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\treturn parseIntegerLiteral(\n\t\t\t\tp,\n\t\t\t\tliteral,\n\t\t\t\tliteral,\n\t\t\t\tcommon.IntegerLiteralKindDecimal,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenHexadecimalIntegerLiteral,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\treturn parseIntegerLiteral(\n\t\t\t\tp,\n\t\t\t\tliteral,\n\t\t\t\tliteral[2:],\n\t\t\t\tcommon.IntegerLiteralKindHexadecimal,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenUnknownBaseIntegerLiteral,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\treturn parseIntegerLiteral(\n\t\t\t\tp,\n\t\t\t\tliteral,\n\t\t\t\tliteral[2:],\n\t\t\t\tcommon.IntegerLiteralKindUnknown,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenFixedPointNumberLiteral,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\treturn parseFixedPointLiteral(\n\t\t\t\tp,\n\t\t\t\tliteral,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(literalExpr{\n\t\ttokenType: lexer.TokenString,\n\t\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\n\t\t\tliteral := p.tokenSource(token)\n\t\t\tparsedString := parseStringLiteral(p, literal)\n\t\t\treturn ast.NewStringExpression(\n\t\t\t\tp.memoryGauge,\n\t\t\t\tparsedString,\n\t\t\t\ttoken.Range,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(prefixExpr{\n\t\ttokenType: lexer.TokenMinus,\n\t\tbindingPower: exprLeftBindingPowerUnaryPrefix,\n\t\tnullDenotation: func(p *parser, right ast.Expression, tokenRange ast.Range) (ast.Expression, error) {\n\t\t\tswitch right := right.(type) {\n\t\t\tcase *ast.IntegerExpression:\n\t\t\t\tif right.Value.Sign() > 0 {\n\t\t\t\t\tif right.Value != nil {\n\t\t\t\t\t\tright.Value.Neg(right.Value)\n\t\t\t\t\t}\n\t\t\t\t\tright.StartPos = tokenRange.StartPos\n\t\t\t\t\treturn right, nil\n\t\t\t\t}\n\n\t\t\tcase *ast.FixedPointExpression:\n\t\t\t\tif !right.Negative {\n\t\t\t\t\tright.Negative = !right.Negative\n\t\t\t\t\tright.StartPos = tokenRange.StartPos\n\t\t\t\t\treturn right, nil\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn ast.NewUnaryExpression(\n\t\t\t\tp.memoryGauge,\n\t\t\t\tast.OperationMinus,\n\t\t\t\tright,\n\t\t\t\ttokenRange.StartPos,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineExpr(unaryExpr{\n\t\ttokenType: lexer.TokenExclamationMark,\n\t\tbindingPower: exprLeftBindingPowerUnaryPrefix,\n\t\toperation: ast.OperationNegate,\n\t})\n\n\tdefineExpr(unaryExpr{\n\t\ttokenType: lexer.TokenLeftArrow,\n\t\tbindingPower: exprLeftBindingPowerUnaryPrefix,\n\t\toperation: ast.OperationMove,\n\t})\n\n\tdefineExpr(postfixExpr{\n\t\ttokenType: lexer.TokenExclamationMark,\n\t\tbindingPower: exprLeftBindingPowerUnaryPostfix,\n\t\tleftDenotation: func(p *parser, left ast.Expression, tokenRange ast.Range) (ast.Expression, error) {\n\t\t\treturn ast.NewForceExpression(\n\t\t\t\tp.memoryGauge,\n\t\t\t\tleft,\n\t\t\t\ttokenRange.EndPos,\n\t\t\t), nil\n\t\t},\n\t})\n\n\tdefineNestedExpression()\n\tdefineInvocationExpression()\n\tdefineArrayExpression()\n\tdefineDictionaryExpression()\n\tdefineIndexExpression()\n\tdefinePathExpression()\n\tdefineConditionalExpression()\n\tdefineReferenceExpression()\n\tdefineMemberExpression()\n\tdefineIdentifierExpression()\n\n\tsetExprNullDenotation(lexer.TokenEOF, func(parser *parser, token lexer.Token) (ast.Expression, error) {\n\t\treturn nil, NewSyntaxError(token.StartPos, \"unexpected end of program\")\n\t})\n}","func BinaryOp(x Value, op token.Token, y Value) Value {\n\tvx, okx := x.(*ratVal)\n\tvy, oky := y.(*ratVal)\n\tif okx || oky {\n\t\tif okx {\n\t\t\tx = vx.Value\n\t\t}\n\t\tif oky {\n\t\t\ty = vy.Value\n\t\t}\n\t\tret := constant.BinaryOp(x, gotoken.Token(op), y)\n\t\treturn &ratVal{ret}\n\t}\n\treturn constant.BinaryOp(x, gotoken.Token(op), y)\n}","func NewBitOp(left, right sql.Expression, op string) *BitOp {\n\treturn &BitOp{BinaryExpression{Left: left, Right: right}, op}\n}","func ANDNPD(mx, x operand.Op) { ctx.ANDNPD(mx, x) }","func TestBinaryOp(t *testing.T) {\n\tfor i, geomCase := range []struct {\n\t\tinput1, input2 string\n\t\tunion, inter, fwdDiff, revDiff, symDiff, relate string\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\t / \\\n\t\t\t +--------------+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,1 2,2 0,0 0))\",\n\t\t\tinput2: \"POLYGON((0 1,2 1,1 3,0 1))\",\n\t\t\tunion: \"POLYGON((0 0,0.5 1,0 1,1 3,2 1,1.5 1,2 0,0 0))\",\n\t\t\tinter: \"POLYGON((0.5 1,1 2,1.5 1,0.5 1))\",\n\t\t\tfwdDiff: \"POLYGON((0 0,2 0,1.5 1,0.5 1,0 0))\",\n\t\t\trevDiff: \"POLYGON((1 3,2 1,1.5 1,1 2,0.5 1,0 1,1 3))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 0,2 0,1.5 1,0.5 1,0 0)),((0 1,0.5 1,1 2,1.5 1,2 1,1 3,0 1)))\",\n\t\t\trelate: \"212101212\",\n\t\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\t*/\n\t\t\tinput1: \"POLYGON((0 0,2 0,2 2,0 2,0 0))\",\n\t\t\tinput2: \"POLYGON((1 1,3 1,3 3,1 3,1 1))\",\n\t\t\tunion: \"POLYGON((0 0,2 0,2 1,3 1,3 3,1 3,1 2,0 2,0 0))\",\n\t\t\tinter: \"POLYGON((1 1,2 1,2 2,1 2,1 1))\",\n\t\t\tfwdDiff: \"POLYGON((0 0,2 0,2 1,1 1,1 2,0 2,0 0))\",\n\t\t\trevDiff: \"POLYGON((2 1,3 1,3 3,1 3,1 2,2 2,2 1))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 0,2 0,2 1,1 1,1 2,0 2,0 0)),((2 1,3 1,3 3,1 3,1 2,2 2,2 1)))\",\n\t\t\trelate: \"212101212\",\n\t\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\n\n\t\t\t +-----+\n\t\t\t | |\n\t\t\t | |\n\t\t\t +-----+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,1 0,1 1,0 1,0 0))\",\n\t\t\tinput2: \"POLYGON((2 2,3 2,3 3,2 3,2 2))\",\n\t\t\tunion: \"MULTIPOLYGON(((0 0,1 0,1 1,0 1,0 0)),((2 2,3 2,3 3,2 3,2 2)))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tfwdDiff: \"POLYGON((0 0,1 0,1 1,0 1,0 0))\",\n\t\t\trevDiff: \"POLYGON((2 2,3 2,3 3,2 3,2 2))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 0,1 0,1 1,0 1,0 0)),((2 2,3 2,3 3,2 3,2 2)))\",\n\t\t\trelate: \"FF2FF1212\",\n\t\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\t*/\n\t\t\tinput1: \"POLYGON((0 0,3 0,3 3,0 3,0 0))\",\n\t\t\tinput2: \"POLYGON((1 1,2 1,2 2,1 2,1 1))\",\n\t\t\tunion: \"POLYGON((0 0,3 0,3 3,0 3,0 0))\",\n\t\t\tinter: \"POLYGON((1 1,2 1,2 2,1 2,1 1))\",\n\t\t\tfwdDiff: \"POLYGON((0 0,3 0,3 3,0 3,0 0),(1 1,2 1,2 2,1 2,1 1))\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"POLYGON((0 0,0 3,3 3,3 0,0 0),(1 1,2 1,2 2,1 2,1 1))\",\n\t\t\trelate: \"212FF1FF2\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +-----+\n\t\t\t | A |\n\t\t\t | |\n\t\t\t +-----+\n\n\n\t\t\t +-----------+\n\t\t\t | A |\n\t\t\t | |\n\t\t\t | +-----+-----+\n\t\t\t | | A&B | |\n\t\t\t | | | |\n\t\t\t +-----+-----+ | +-----+\n\t\t\t | | | B |\n\t\t\t | B | | |\n\t\t\t o +-----------+ +-----+\n\t\t\t*/\n\t\t\tinput1: \"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 1,0 1)))\",\n\t\t\tinput2: \"MULTIPOLYGON(((4 0,4 1,5 1,5 0,4 0)),((1 0,1 2,3 2,3 0,1 0)))\",\n\t\t\tunion: \"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 2,3 2,3 0,1 0,1 1,0 1)),((4 0,4 1,5 1,5 0,4 0)))\",\n\t\t\tinter: \"POLYGON((2 2,2 1,1 1,1 2,2 2))\",\n\t\t\tfwdDiff: \"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 2,1 2,1 1,0 1)))\",\n\t\t\trevDiff: \"MULTIPOLYGON(((4 0,4 1,5 1,5 0,4 0)),((1 0,1 1,2 1,2 2,3 2,3 0,1 0)))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 2,1 2,1 1,0 1)),((1 1,2 1,2 2,3 2,3 0,1 0,1 1)),((4 0,4 1,5 1,5 0,4 0)))\",\n\t\t\trelate: \"212101212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\n\t\t\t Two interlocking rings:\n\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\t | | | |\n\t\t\t | +-----------+ |\n\t\t\t | |\n\t\t\t +-------------------+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 2,5 2,5 7,0 7,0 2),(1 3,4 3,4 6,1 6,1 3))\",\n\t\t\tinput2: \"POLYGON((2 0,7 0,7 5,2 5,2 0),(3 1,6 1,6 4,3 4,3 1))\",\n\t\t\tunion: \"POLYGON((2 2,0 2,0 7,5 7,5 5,7 5,7 0,2 0,2 2),(5 4,5 2,3 2,3 1,6 1,6 4,5 4),(1 3,2 3,2 5,4 5,4 6,1 6,1 3),(3 3,4 3,4 4,3 4,3 3))\",\n\t\t\tinter: \"MULTIPOLYGON(((3 2,2 2,2 3,3 3,3 2)),((5 5,5 4,4 4,4 5,5 5)))\",\n\t\t\tfwdDiff: \"MULTIPOLYGON(((2 2,0 2,0 7,5 7,5 5,4 5,4 6,1 6,1 3,2 3,2 2)),((5 4,5 2,3 2,3 3,4 3,4 4,5 4)))\",\n\t\t\trevDiff: \"MULTIPOLYGON(((5 5,7 5,7 0,2 0,2 2,3 2,3 1,6 1,6 4,5 4,5 5)),((2 3,2 5,4 5,4 4,3 4,3 3,2 3)))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((5 5,7 5,7 0,2 0,2 2,3 2,3 1,6 1,6 4,5 4,5 5)),((5 5,4 5,4 6,1 6,1 3,2 3,2 2,0 2,0 7,5 7,5 5)),((2 3,2 5,4 5,4 4,3 4,3 3,2 3)),((4 4,5 4,5 2,3 2,3 3,4 3,4 4)))\",\n\t\t\trelate: \"212101212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\n\t\t\t /\\ /\\\n\t\t\t / \\ / \\\n\t\t\t / A \\ / A \\\n\t\t\t / \\/ \\\n\t\t\t \\ /\\ /\\ /\\ /\n\t\t\t \\/AB\\/ \\/AB\\/\n\t\t\t /\\ /\\ /\\ /\\\n\t\t\t / \\/ \\/ \\/ \\\n\t\t\t \\ /\\ /\n\t\t\t \\ B / \\ B /\n\t\t\t \\ / \\ /\n\t\t\t \\/ \\/\n\n\t\t\t*/\n\t\t\tinput1: \"MULTIPOLYGON(((0 2,1 1,2 2,1 3,0 2)),((2 2,3 1,4 2,3 3,2 2)))\",\n\t\t\tinput2: \"MULTIPOLYGON(((0 1,1 2,2 1,1 0,0 1)),((2 1,3 0,4 1,3 2,2 1)))\",\n\t\t\tunion: \"MULTIPOLYGON(((0.5 1.5,0 2,1 3,2 2,1.5 1.5,2 1,1 0,0 1,0.5 1.5)),((2.5 1.5,2 2,3 3,4 2,3.5 1.5,4 1,3 0,2 1,2.5 1.5)))\",\n\t\t\tinter: \"MULTIPOLYGON(((1.5 1.5,1 1,0.5 1.5,1 2,1.5 1.5)),((3.5 1.5,3 1,2.5 1.5,3 2,3.5 1.5)))\",\n\t\t\tfwdDiff: \"MULTIPOLYGON(((0.5 1.5,0 2,1 3,2 2,1.5 1.5,1 2,0.5 1.5)),((2.5 1.5,2 2,3 3,4 2,3.5 1.5,3 2,2.5 1.5)))\",\n\t\t\trevDiff: \"MULTIPOLYGON(((1 0,0 1,0.5 1.5,1 1,1.5 1.5,2 1,1 0)),((3.5 1.5,4 1,3 0,2 1,2.5 1.5,3 1,3.5 1.5)))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((1 0,0 1,0.5 1.5,1 1,1.5 1.5,2 1,1 0)),((1.5 1.5,1 2,0.5 1.5,0 2,1 3,2 2,1.5 1.5)),((3.5 1.5,4 1,3 0,2 1,2.5 1.5,3 1,3.5 1.5)),((3.5 1.5,3 2,2.5 1.5,2 2,3 3,4 2,3.5 1.5)))\",\n\t\t\trelate: \"212101212\",\n\t\t},\n\n\t\t{\n\t\t\t/*\n\t\t\t +-----+-----+\n\t\t\t | B | A |\n\t\t\t | | |\n\t\t\t +-----+-----+\n\t\t\t | A | B |\n\t\t\t | | |\n\t\t\t +-----+-----+\n\t\t\t*/\n\t\t\tinput1: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((1 1,1 2,2 2,2 1,1 1)))\",\n\t\t\tinput2: \"MULTIPOLYGON(((0 1,0 2,1 2,1 1,0 1)),((1 0,1 1,2 1,2 0,1 0)))\",\n\t\t\tunion: \"POLYGON((0 0,0 1,0 2,1 2,2 2,2 1,2 0,1 0,0 0))\",\n\t\t\tinter: \"MULTILINESTRING((0 1,1 1),(1 1,1 0),(1 1,1 2),(2 1,1 1))\",\n\t\t\tfwdDiff: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((1 1,1 2,2 2,2 1,1 1)))\",\n\t\t\trevDiff: \"MULTIPOLYGON(((0 1,0 2,1 2,1 1,0 1)),((1 0,1 1,2 1,2 0,1 0)))\",\n\t\t\tsymDiff: \"POLYGON((0 0,0 1,0 2,1 2,2 2,2 1,2 0,1 0,0 0))\",\n\t\t\trelate: \"FF2F11212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +-----+-----+\n\t\t\t | A | B |\n\t\t\t | | |\n\t\t\t +-----+-----+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t\tinput2: \"POLYGON((1 0,1 1,2 1,2 0,1 0))\",\n\t\t\tunion: \"POLYGON((0 0,0 1,1 1,2 1,2 0,1 0,0 0))\",\n\t\t\tinter: \"LINESTRING(1 1,1 0)\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t\trevDiff: \"POLYGON((1 0,1 1,2 1,2 0,1 0))\",\n\t\t\tsymDiff: \"POLYGON((1 1,2 1,2 0,1 0,0 0,0 1,1 1))\",\n\t\t\trelate: \"FF2F11212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +-------+\n\t\t\t | A |\n\t\t\t | +-------+\n\t\t\t | | B |\n\t\t\t +-------+ |\n\t\t\t | |\n\t\t\t +-------+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0.5,0 1.5,1 1.5,1 0.5,0 0.5))\",\n\t\t\tinput2: \"POLYGON((1 0,1 1,2 1,2 0,1 0))\",\n\t\t\tunion: \"POLYGON((0 0.5,0 1.5,1 1.5,1 1,2 1,2 0,1 0,1 0.5,0 0.5))\",\n\t\t\tinter: \"LINESTRING(1 1,1 0.5)\",\n\t\t\tfwdDiff: \"POLYGON((0 0.5,0 1.5,1 1.5,1 1,1 0.5,0 0.5))\",\n\t\t\trevDiff: \"POLYGON((1 0,1 0.5,1 1,2 1,2 0,1 0))\",\n\t\t\tsymDiff: \"POLYGON((1 0,1 0.5,0 0.5,0 1.5,1 1.5,1 1,2 1,2 0,1 0))\",\n\t\t\trelate: \"FF2F11212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +-----+\n\t\t\t | A&B |\n\t\t\t | |\n\t\t\t +-----+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t\tinput2: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t\tunion: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t\tinter: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t\tfwdDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trelate: \"2FFF1FFF2\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t *-------*\n\t\t\t |\\ A&B /|\n\t\t\t | \\ / |\n\t\t\t | \\ / |\n\t\t\t * * *\n\t\t\t | A | B |\n\t\t\t | | |\n\t\t\t *---*---*\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,0 2,2 2,1 1,1 0,0 0))\",\n\t\t\tinput2: \"POLYGON((1 0,1 1,0 2,2 2,2 0,1 0))\",\n\t\t\tunion: \"POLYGON((0 0,0 2,2 2,2 0,1 0,0 0))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION(LINESTRING(1 1,1 0),POLYGON((0 2,2 2,1 1,0 2)))\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 2,1 1,1 0,0 0))\",\n\t\t\trevDiff: \"POLYGON((1 0,1 1,2 2,2 0,1 0))\",\n\t\t\tsymDiff: \"POLYGON((0 2,1 1,2 2,2 0,1 0,0 0,0 2))\",\n\t\t\trelate: \"212111212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +---+\n\t\t\t | A |\n\t\t\t +---+---+\n\t\t\t | B |\n\t\t\t +---+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 1,1 1,1 2,0 2,0 1))\",\n\t\t\tinput2: \"POLYGON((1 0,2 0,2 1,1 1,1 0))\",\n\t\t\tunion: \"MULTIPOLYGON(((1 1,0 1,0 2,1 2,1 1)),((1 1,2 1,2 0,1 0,1 1)))\",\n\t\t\tinter: \"POINT(1 1)\",\n\t\t\tfwdDiff: \"POLYGON((1 1,0 1,0 2,1 2,1 1))\",\n\t\t\trevDiff: \"POLYGON((1 1,2 1,2 0,1 0,1 1))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((1 1,2 1,2 0,1 0,1 1)),((1 1,0 1,0 2,1 2,1 1)))\",\n\t\t\trelate: \"FF2F01212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +-----+-----+\n\t\t\t | / \\ |\n\t\t\t | +-+-+ |\n\t\t\t | A | B |\n\t\t\t +-----+-----+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,2 0,2 1,1 1,2 2,0 2,0 0))\",\n\t\t\tinput2: \"POLYGON((2 0,4 0,4 2,2 2,3 1,2 1,2 0))\",\n\t\t\tunion: \"POLYGON((2 0,0 0,0 2,2 2,4 2,4 0,2 0),(2 2,1 1,2 1,3 1,2 2))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION(POINT(2 2),LINESTRING(2 0,2 1))\",\n\t\t\tfwdDiff: \"POLYGON((2 0,0 0,0 2,2 2,1 1,2 1,2 0))\",\n\t\t\trevDiff: \"POLYGON((2 2,4 2,4 0,2 0,2 1,3 1,2 2))\",\n\t\t\tsymDiff: \"POLYGON((2 2,4 2,4 0,2 0,0 0,0 2,2 2),(2 2,1 1,2 1,3 1,2 2))\",\n\t\t\trelate: \"FF2F11212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +---+\n\t\t\t | A |\n\t\t\t +---+---+\n\t\t\t | B |\n\t\t\t +---+ +---+\n\t\t\t |A&B|\n\t\t\t +---+\n\t\t\t*/\n\t\t\tinput1: \"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((1 2,2 2,2 3,1 3,1 2)))\",\n\t\t\tinput2: \"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((2 1,3 1,3 2,2 2,2 1)))\",\n\t\t\tunion: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 2,1 2,1 3,2 3,2 2)),((2 2,3 2,3 1,2 1,2 2)))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION(POINT(2 2),POLYGON((0 0,0 1,1 1,1 0,0 0)))\",\n\t\t\tfwdDiff: \"POLYGON((2 2,1 2,1 3,2 3,2 2))\",\n\t\t\trevDiff: \"POLYGON((2 2,3 2,3 1,2 1,2 2))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((2 2,3 2,3 1,2 1,2 2)),((2 2,1 2,1 3,2 3,2 2)))\",\n\t\t\trelate: \"2F2F11212\",\n\t\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 | A | |\n\t\t\t | +---+ |\n\t\t\t | | | |\n\t\t\t +---+---+ |\n\t\t\t |A&B| B |\n\t\t\t +---+-------+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,1 0,1 4,0 4,0 0))\",\n\t\t\tinput2: \"POLYGON((0 0,3 0,3 5,1 5,1 4,2 4,2 3,1 3,1 2,2 2,2 1,0 1,0 0))\",\n\t\t\tunion: \"POLYGON((1 0,0 0,0 1,0 4,1 4,1 5,3 5,3 0,1 0),(1 4,1 3,2 3,2 4,1 4),(1 2,1 1,2 1,2 2,1 2))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION(POINT(1 4),LINESTRING(1 2,1 3),POLYGON((1 0,0 0,0 1,1 1,1 0)))\",\n\t\t\tfwdDiff: \"POLYGON((1 2,1 1,0 1,0 4,1 4,1 3,1 2))\",\n\t\t\trevDiff: \"POLYGON((1 4,1 5,3 5,3 0,1 0,1 1,2 1,2 2,1 2,1 3,2 3,2 4,1 4))\",\n\t\t\tsymDiff: \"POLYGON((1 4,1 5,3 5,3 0,1 0,1 1,0 1,0 4,1 4),(1 1,2 1,2 2,1 2,1 1),(1 4,1 3,2 3,2 4,1 4))\",\n\t\t\trelate: \"212111212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +-------+-------+\n\t\t\t | A | B |\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\n\t\t\tinput1: \"POLYGON((0 0,2 0,2 1,1 1,1 2,2 2,2 3,0 3,0 0))\",\n\t\t\tinput2: \"POLYGON((2 0,4 0,4 3,2 3,2 2,3 2,3 1,2 1,2 0))\",\n\t\t\tunion: \"POLYGON((2 0,0 0,0 3,2 3,4 3,4 0,2 0),(2 2,1 2,1 1,2 1,3 1,3 2,2 2))\",\n\t\t\tinter: \"MULTILINESTRING((2 0,2 1),(2 2,2 3))\",\n\t\t\tfwdDiff: \"POLYGON((2 0,0 0,0 3,2 3,2 2,1 2,1 1,2 1,2 0))\",\n\t\t\trevDiff: \"POLYGON((2 3,4 3,4 0,2 0,2 1,3 1,3 2,2 2,2 3))\",\n\t\t\tsymDiff: \"POLYGON((2 3,4 3,4 0,2 0,0 0,0 3,2 3),(2 1,3 1,3 2,2 2,1 2,1 1,2 1))\",\n\t\t\trelate: \"FF2F11212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t *-------------+\n\t\t\t |\\`. B |\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 | A `. \\|\n\t\t\t +-----------`-*\n\t\t\t*/\n\n\t\t\tinput1: \"POLYGON((0 0,3 0,1 1,0 3,0 0))\",\n\t\t\tinput2: \"POLYGON((3 0,3 3,0 3,2 2,3 0))\",\n\t\t\tunion: \"MULTIPOLYGON(((3 0,0 0,0 3,1 1,3 0)),((0 3,3 3,3 0,2 2,0 3)))\",\n\t\t\tinter: \"MULTIPOINT(0 3,3 0)\",\n\t\t\tfwdDiff: \"POLYGON((3 0,0 0,0 3,1 1,3 0))\",\n\t\t\trevDiff: \"POLYGON((0 3,3 3,3 0,2 2,0 3))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 3,3 3,3 0,2 2,0 3)),((3 0,0 0,0 3,1 1,3 0)))\",\n\t\t\trelate: \"FF2F01212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +\n\t\t\t |A\n\t\t\t | B\n\t\t\t +----+\n\t\t\t*/\n\t\t\tinput1: \"LINESTRING(0 0,0 1)\",\n\t\t\tinput2: \"LINESTRING(0 0,1 0)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0 1),(0 0,1 0))\",\n\t\t\tinter: \"POINT(0 0)\",\n\t\t\tfwdDiff: \"LINESTRING(0 0,0 1)\",\n\t\t\trevDiff: \"LINESTRING(0 0,1 0)\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 0,1 0),(0 0,0 1))\",\n\t\t\trelate: \"FF1F00102\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t + +\n\t\t\t | |\n\t\t\t A B\n\t\t\t | |\n\t\t\t +--A&B--+\n\t\t\t*/\n\t\t\tinput1: \"LINESTRING(0 1,0 0,1 0)\",\n\t\t\tinput2: \"LINESTRING(0 0,1 0,1 1)\",\n\t\t\tunion: \"MULTILINESTRING((0 1,0 0),(0 0,1 0),(1 0,1 1))\",\n\t\t\tinter: \"LINESTRING(0 0,1 0)\",\n\t\t\tfwdDiff: \"LINESTRING(0 1,0 0)\",\n\t\t\trevDiff: \"LINESTRING(1 0,1 1)\",\n\t\t\tsymDiff: \"MULTILINESTRING((1 0,1 1),(0 1,0 0))\",\n\t\t\trelate: \"1010F0102\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t \\ /\n\t\t\t \\ /\n\t\t\t B A\n\t\t\t \\/\n\t\t\t /\\\n\t\t\t A B\n\t\t\t / \\\n\t\t\t / \\\n\t\t\t*/\n\t\t\tinput1: \"LINESTRING(0 0,1 1)\",\n\t\t\tinput2: \"LINESTRING(0 1,1 0)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(0 1,0.5 0.5),(0.5 0.5,1 0))\",\n\t\t\tinter: \"POINT(0.5 0.5)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1))\",\n\t\t\trevDiff: \"MULTILINESTRING((0 1,0.5 0.5),(0.5 0.5,1 0))\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 1,0.5 0.5),(0.5 0.5,1 0),(0 0,0.5 0.5),(0.5 0.5,1 1))\",\n\t\t\trelate: \"0F1FF0102\",\n\t\t},\n\t\t{\n\t\t\t// +---A---+\n\t\t\t// | |\n\t\t\t// B B\n\t\t\t// | |\n\t\t\t// +---A---+\n\t\t\t//\n\t\t\tinput1: \"MULTILINESTRING((0 0,1 0),(0 1,1 1))\",\n\t\t\tinput2: \"MULTILINESTRING((0 0,0 1),(1 0,1 1))\",\n\t\t\tunion: \"MULTILINESTRING((0 0,1 0),(0 1,1 1),(0 0,0 1),(1 0,1 1))\",\n\t\t\tinter: \"MULTIPOINT(0 0,0 1,1 0,1 1)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,1 0),(0 1,1 1))\",\n\t\t\trevDiff: \"MULTILINESTRING((0 0,0 1),(1 0,1 1))\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 0,0 1),(1 0,1 1),(0 0,1 0),(0 1,1 1))\",\n\t\t\trelate: \"FF1F0F1F2\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +--A&B--+---A---+\n\t\t\t | | |\n\t\t\t A&B B A\n\t\t\t | | |\n\t\t\t +---A---+---A---+\n\t\t\t | |\n\t\t\t B B\n\t\t\t | |\n\t\t\t +---B---+\n\t\t\t*/\n\t\t\tinput1: \"LINESTRING(0 2,2 2,2 1,0 1,0 2)\",\n\t\t\tinput2: \"LINESTRING(1 2,1 0,0 0,0 2,1 2)\",\n\t\t\tunion: \"MULTILINESTRING((0 2,1 2),(1 2,2 2,2 1,1 1),(1 1,0 1),(0 1,0 2),(1 2,1 1),(1 1,1 0,0 0,0 1))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION(POINT(1 1),LINESTRING(0 2,1 2),LINESTRING(0 1,0 2))\",\n\t\t\tfwdDiff: \"MULTILINESTRING((1 2,2 2,2 1,1 1),(1 1,0 1))\",\n\t\t\trevDiff: \"MULTILINESTRING((1 2,1 1),(1 1,1 0,0 0,0 1))\",\n\t\t\tsymDiff: \"MULTILINESTRING((1 2,2 2,2 1,1 1),(1 1,0 1),(1 2,1 1),(1 1,1 0,0 0,0 1))\",\n\t\t\trelate: \"1F1FFF1F2\",\n\t\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\n\t\t\t*/\n\t\t\tinput1: \"LINESTRING(0 0,2 2,0 2,2 0)\",\n\t\t\tinput2: \"LINESTRING(2 0,3 1,2 2)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,1 1),(1 1,2 2),(2 2,0 2,1 1),(1 1,2 0),(2 0,3 1,2 2))\",\n\t\t\tinter: \"MULTIPOINT(2 0,2 2)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,1 1),(1 1,2 2),(2 2,0 2,1 1),(1 1,2 0))\",\n\t\t\trevDiff: \"LINESTRING(2 0,3 1,2 2)\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 0,1 1),(1 1,2 2),(2 2,0 2,1 1),(1 1,2 0),(2 0,3 1,2 2))\",\n\t\t\trelate: \"F01F001F2\",\n\t\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\tinput1: \"POLYGON((0 0,0 2,2 2,2 0,0 0))\",\n\t\t\tinput2: \"LINESTRING(1 1,1 3)\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(LINESTRING(1 2,1 3),POLYGON((0 0,0 2,1 2,2 2,2 0,0 0)))\",\n\t\t\tinter: \"LINESTRING(1 1,1 2)\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 2,1 2,2 2,2 0,0 0))\",\n\t\t\trevDiff: \"LINESTRING(1 2,1 3)\",\n\t\t\tsymDiff: \"GEOMETRYCOLLECTION(LINESTRING(1 2,1 3),POLYGON((0 0,0 2,1 2,2 2,2 0,0 0)))\",\n\t\t\trelate: \"1020F1102\",\n\t\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\tinput1: \"POLYGON((0 0,0 3,3 3,3 0,0 0))\",\n\t\t\tinput2: \"LINESTRING(1 1,2 2)\",\n\t\t\tunion: \"POLYGON((0 0,0 3,3 3,3 0,0 0))\",\n\t\t\tinter: \"LINESTRING(1 1,2 2)\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 3,3 3,3 0,0 0))\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"POLYGON((0 0,0 3,3 3,3 0,0 0))\",\n\t\t\trelate: \"102FF1FF2\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +---+---+---+\n\t\t\t | A |A&B|\n\t\t\t +---+---+---+\n\t\t\t |A&B| B |\n\t\t\t +---+---+---+\n\t\t\t | A |A&B|\n\t\t\t +---+---+---+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,3 0,3 1,1 1,1 2,3 2,3 3,0 3,0 0))\",\n\t\t\tinput2: \"POLYGON((0 1,0 2,2 2,2 3,3 3,3 0,2 0,2 1,0 1))\",\n\t\t\tunion: \"POLYGON((2 0,0 0,0 1,0 2,0 3,2 3,3 3,3 2,3 1,3 0,2 0))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION(LINESTRING(2 1,1 1),LINESTRING(1 2,2 2),POLYGON((3 0,2 0,2 1,3 1,3 0)),POLYGON((1 2,1 1,0 1,0 2,1 2)),POLYGON((3 2,2 2,2 3,3 3,3 2)))\",\n\t\t\tfwdDiff: \"MULTIPOLYGON(((2 0,0 0,0 1,1 1,2 1,2 0)),((2 2,1 2,0 2,0 3,2 3,2 2)))\",\n\t\t\trevDiff: \"POLYGON((1 2,2 2,3 2,3 1,2 1,1 1,1 2))\",\n\t\t\tsymDiff: \"POLYGON((1 2,0 2,0 3,2 3,2 2,3 2,3 1,2 1,2 0,0 0,0 1,1 1,1 2))\",\n\t\t\trelate: \"212111212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t + + +\n\t\t\t A A&B B\n\t\t\t*/\n\t\t\tinput1: \"MULTIPOINT(0 0,1 1)\",\n\t\t\tinput2: \"MULTIPOINT(1 1,2 2)\",\n\t\t\tunion: \"MULTIPOINT(0 0,1 1,2 2)\",\n\t\t\tinter: \"POINT(1 1)\",\n\t\t\tfwdDiff: \"POINT(0 0)\",\n\t\t\trevDiff: \"POINT(2 2)\",\n\t\t\tsymDiff: \"MULTIPOINT(0 0,2 2)\",\n\t\t\trelate: \"0F0FFF0F2\",\n\t\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\tinput1: \"POLYGON((0 0,0 2,2 2,2 0,0 0))\",\n\t\t\tinput2: \"MULTIPOINT(1 1,3 1)\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(POINT(3 1),POLYGON((0 0,0 2,2 2,2 1,2 0,0 0)))\",\n\t\t\tinter: \"POINT(1 1)\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 2,2 2,2 1,2 0,0 0))\",\n\t\t\trevDiff: \"POINT(3 1)\",\n\t\t\tsymDiff: \"GEOMETRYCOLLECTION(POINT(3 1),POLYGON((0 0,0 2,2 2,2 1,2 0,0 0)))\",\n\t\t\trelate: \"0F2FF10F2\",\n\t\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 O-----+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,0 1,1 0,0 0))\",\n\t\t\tinput2: \"POINT(0 0)\",\n\t\t\tunion: \"POLYGON((0 0,0 1,1 0,0 0))\",\n\t\t\tinter: \"POINT(0 0)\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 1,1 0,0 0))\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"POLYGON((0 0,0 1,1 0,0 0))\",\n\t\t\trelate: \"FF20F1FF2\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t +\n\t\t\t |\\\n\t\t\t | \\\n\t\t\t | O\n\t\t\t | \\\n\t\t\t | \\\n\t\t\t +-----+\n\t\t\t*/\n\t\t\tinput1: \"POLYGON((0 0,0 1,1 0,0 0))\",\n\t\t\tinput2: \"POINT(0.5 0.5)\",\n\t\t\tunion: \"POLYGON((0 0,0 1,0.5 0.5,1 0,0 0))\",\n\t\t\tinter: \"POINT(0.5 0.5)\",\n\t\t\tfwdDiff: \"POLYGON((0 0,0 1,0.5 0.5,1 0,0 0))\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"POLYGON((0 0,0 1,0.5 0.5,1 0,0 0))\",\n\t\t\trelate: \"FF20F1FF2\",\n\t\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\tinput1: \"LINESTRING(0 0,0 1,1 1,1 0,0 0,0 1)\", // overlapping line segment\n\t\t\tinput2: \"POINT(0.5 0.5)\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(LINESTRING(0 0,0 1),LINESTRING(0 1,1 1,1 0,0 0),POINT(0.5 0.5))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0 1),(0 1,1 1,1 0,0 0))\",\n\t\t\trevDiff: \"POINT(0.5 0.5)\",\n\t\t\tsymDiff: \"GEOMETRYCOLLECTION(LINESTRING(0 0,0 1),LINESTRING(0 1,1 1,1 0,0 0),POINT(0.5 0.5))\",\n\t\t\trelate: \"FF1FF00F2\",\n\t\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\tinput1: \"LINESTRING(0 0,1 1)\",\n\t\t\tinput2: \"POINT(0.35355339059327373 0.35355339059327373)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0.35355339059327373 0.35355339059327373),(0.35355339059327373 0.35355339059327373,1 1))\",\n\t\t\tinter: \"POINT(0.35355339059327373 0.35355339059327373)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0.35355339059327373 0.35355339059327373),(0.35355339059327373 0.35355339059327373,1 1))\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 0,0.35355339059327373 0.35355339059327373),(0.35355339059327373 0.35355339059327373,1 1))\",\n\t\t\trelate: \"0F1FF0FF2\",\n\t\t},\n\t\t{\n\t\t\t// LineString with a Point in the middle of it.\n\t\t\tinput1: \"POINT(5 5)\",\n\t\t\tinput2: \"LINESTRING(1 2,9 8)\",\n\t\t\tunion: \"MULTILINESTRING((1 2,5 5),(5 5,9 8))\",\n\t\t\tinter: \"POINT(5 5)\",\n\t\t\tfwdDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trevDiff: \"MULTILINESTRING((1 2,5 5),(5 5,9 8))\",\n\t\t\tsymDiff: \"MULTILINESTRING((1 2,5 5),(5 5,9 8))\",\n\t\t\trelate: \"0FFFFF102\",\n\t\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\n\t\t\t// Tests a case where intersection between two segments is *not* commutative if done naively.\n\t\t\tinput1: \"LINESTRING(0 0,1 2)\",\n\t\t\tinput2: \"LINESTRING(0 1,1 0)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2),(0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\",\n\t\t\tinter: \"POINT(0.3333333333 0.6666666667)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\",\n\t\t\trevDiff: \"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0),(0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\",\n\t\t\trelate: \"0F1FF0102\",\n\t\t},\n\t\t{\n\t\t\t// Similar case for when line segment non-commutative operations are\n\t\t\t// done, but this time with a line segment doubling back on itself.\n\t\t\tinput1: \"LINESTRING(0 0,1 2,0 0)\",\n\t\t\tinput2: \"LINESTRING(0 1,1 0)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2),(0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\",\n\t\t\tinter: \"POINT(0.3333333333 0.6666666667)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\",\n\t\t\trevDiff: \"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\",\n\t\t\tsymDiff: \"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0),(0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\",\n\t\t\trelate: \"0F1FFF102\",\n\t\t},\n\n\t\t// In the following test cases, lines from the first input intersect\n\t\t// *almost* exactly with one of the vertices in the second input.\n\t\t{\n\t\t\tinput1: \"LINESTRING(-1 1,1 -1)\",\n\t\t\tinput2: \"POLYGON((-1 0,-0.070710678118655 0.070710678118655,0 1,-1 0))\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(LINESTRING(-1 1,-0.5 0.5),LINESTRING(-0.070710678118655 0.070710678118655,1 -1),POLYGON((-1 0,-0.5 0.5,0 1,-0.070710678118655 0.070710678118655,-1 0)))\",\n\t\t\tinter: \"LINESTRING(-0.5 0.5,-0.070710678118655 0.070710678118655)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((-1 1,-0.5 0.5),(-0.070710678118655 0.070710678118655,1 -1))\",\n\t\t\trevDiff: \"POLYGON((-1 0,-0.5 0.5,0 1,-0.070710678118655 0.070710678118655,-1 0))\",\n\t\t\tsymDiff: \"GEOMETRYCOLLECTION(LINESTRING(-1 1,-0.5 0.5),LINESTRING(-0.070710678118655 0.070710678118655,1 -1),POLYGON((-1 0,-0.5 0.5,0 1,-0.070710678118655 0.070710678118655,-1 0)))\",\n\t\t\trelate: \"101FF0212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(0 0,1 1)\",\n\t\t\tinput2: \"LINESTRING(1 0,0.5000000000000001 0.5,0 1)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(1 0,0.5 0.5),(0.5 0.5,0 1))\",\n\t\t\tinter: \"POINT(0.5 0.5)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1))\",\n\t\t\trevDiff: \"MULTILINESTRING((1 0,0.5 0.5),(0.5 0.5,0 1))\",\n\t\t\tsymDiff: \"MULTILINESTRING((1 0,0.5 0.5),(0.5 0.5,0 1),(0 0,0.5 0.5),(0.5 0.5,1 1))\",\n\t\t\trelate: \"0F1FF0102\",\n\t\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\tinput1: \"GEOMETRYCOLLECTION(POLYGON((1 0,3 2,1 2,1 0)))\",\n\t\t\tinput2: \"GEOMETRYCOLLECTION(LINESTRING(0 1,3 1))\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(POLYGON((1 0,2 1,3 2,1 2,1 1,1 0)),LINESTRING(0 1,1 1),LINESTRING(2 1,3 1))\",\n\t\t\tinter: \"LINESTRING(1 1,2 1)\",\n\t\t\tfwdDiff: \"POLYGON((1 0,2 1,3 2,1 2,1 1,1 0))\",\n\t\t\trevDiff: \"MULTILINESTRING((0 1,1 1),(2 1,3 1))\",\n\t\t\tsymDiff: \"GEOMETRYCOLLECTION(POLYGON((1 0,2 1,3 2,1 2,1 1,1 0)),LINESTRING(0 1,1 1),LINESTRING(2 1,3 1))\",\n\t\t\trelate: \"1F20F1102\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t Reproduces a bug with set ops between self-intersecting GeometryCollections.\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 +--+--+--+-----+--+1B\n\t\t\t | | |\\ \\\n\t\t\t | | | \\ 2A \\\n\t\t\t | +--+--+-----+\n\t\t\t | | \\\n\t\t\t | 1A | \\\n\t\t\t +-----+-----+\n\t\t\t |\n\t\t\t |2B\n\t\t\t +\n\t\t\t*/\n\t\t\tinput1: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((1 1,5 5,1 5,1 1)),\n\t\t\t\tLINESTRING(0 3,6 3))`,\n\t\t\tinput2: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 0,6 4,2 4,2 0)),\n\t\t\t\tLINESTRING(3 0,3 6))`,\n\t\t\tunion: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 2,2 0,3 1,5 3,6 4,4 4,5 5,3 5,1 5,1 3,1 1,2 2)),\n\t\t\t\tLINESTRING(0 3,1 3),\n\t\t\t\tLINESTRING(5 3,6 3),\n\t\t\t\tLINESTRING(3 0,3 1),\n\t\t\t\tLINESTRING(3 5,3 6))`,\n\t\t\tinter: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 2,3 3,4 4,3 4,2 4,2 3,2 2)),\n\t\t\t\tLINESTRING(3 3,5 3),\n\t\t\t\tLINESTRING(3 4,3 5))`,\n\t\t\tfwdDiff: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((1 1,2 2,2 3,2 4,3 4,4 4,5 5,3 5,1 5,1 3,1 1)),\n\t\t\t\tLINESTRING(0 3,1 3),\n\t\t\t\tLINESTRING(5 3,6 3))`,\n\t\t\trevDiff: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((3 1,5 3,6 4,4 4,3 3,2 2,2 0,3 1)),\n\t\t\t\tLINESTRING(3 0,3 1),\n\t\t\t\tLINESTRING(3 5,3 6))`,\n\t\t\tsymDiff: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((1 1,2 2,2 3,2 4,3 4,4 4,5 5,3 5,1 5,1 3,1 1)),\n\t\t\t\tPOLYGON((3 1,5 3,6 4,4 4,3 3,2 2,2 0,3 1)),\n\t\t\t\tLINESTRING(0 3,1 3),\n\t\t\t\tLINESTRING(5 3,6 3),\n\t\t\t\tLINESTRING(3 0,3 1),\n\t\t\t\tLINESTRING(3 5,3 6))`,\n\t\t\trelate: `212101212`,\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t Reproduces a bug with set ops between self-intersecting GeometryCollections.\n\t\t\t Similar to the previous case, but none of the crossing points are coincident.\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\t | | | \\ \\\n\t\t\t +--+--+--+--+--+--+--+1B\n\t\t\t | | | \\ \\\n\t\t\t | | | \\ 2A \\\n\t\t\t | +--+-----+-----+\n\t\t\t | | \\\n\t\t\t | 1A | \\\n\t\t\t +-----+--------+\n\t\t\t |\n\t\t\t |2B\n\t\t\t +\n\t\t\t*/\n\t\t\tinput1: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((1 1,6 6,1 6,1 1)),\n\t\t\t\tLINESTRING(0 4,7 4))`,\n\t\t\tinput2: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 0,7 5,2 5,2 0)),\n\t\t\t\tLINESTRING(3 0,3 7))`,\n\t\t\tunion: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 2,2 0,3 1,6 4,7 5,5 5,6 6,3 6,1 6,1 4,1 1,2 2)),\n\t\t\t\tLINESTRING(0 4,1 4),\n\t\t\t\tLINESTRING(6 4,7 4),\n\t\t\t\tLINESTRING(3 0,3 1),\n\t\t\t\tLINESTRING(3 6,3 7))`,\n\t\t\tinter: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 2,3 3,4 4,5 5,3 5,2 5,2 4,2 2)),\n\t\t\t\tLINESTRING(4 4,6 4),\n\t\t\t\tLINESTRING(3 5,3 6))`,\n\t\t\tfwdDiff: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((5 5,6 6,3 6,1 6,1 4,1 1,2 2,2 4,2 5,3 5,5 5)),\n\t\t\t\tLINESTRING(0 4,1 4),\n\t\t\t\tLINESTRING(6 4,7 4))`,\n\t\t\trevDiff: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 0,3 1,6 4,7 5,5 5,4 4,3 3,2 2,2 0)),\n\t\t\t\tLINESTRING(3 0,3 1),\n\t\t\t\tLINESTRING(3 6,3 7))`,\n\t\t\tsymDiff: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((3 6,1 6,1 4,1 1,2 2,2 4,2 5,3 5,5 5,6 6,3 6)),\n\t\t\t\tPOLYGON((3 3,2 2,2 0,3 1,6 4,7 5,5 5,4 4,3 3)),\n\t\t\t\tLINESTRING(0 4,1 4),\n\t\t\t\tLINESTRING(6 4,7 4),\n\t\t\t\tLINESTRING(3 0,3 1),\n\t\t\t\tLINESTRING(3 6,3 7))`,\n\t\t\trelate: `212101212`,\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t\t+-----+--+ +-----+--+\n\t\t\t\t| 1A |2 | | |\n\t\t\t\t| +--+--+ | +\n\t\t\t\t| | | | -> | |\n\t\t\t\t+--+--+ | +--+ |\n\t\t\t\t | 1B | | |\n\t\t\t\t +--+--+ +--+--+\n\t\t\t*/\n\t\t\tinput1: \"GEOMETRYCOLLECTION(POLYGON((0 0,2 0,2 2,0 2,0 0)),POLYGON((1 1,3 1,3 3,1 3,1 1)))\",\n\t\t\tinput2: \"POLYGON((2 0,3 0,3 1,2 1,2 0))\",\n\t\t\tunion: \"POLYGON((2 0,3 0,3 1,3 3,1 3,1 2,0 2,0 0,2 0))\",\n\t\t\tinter: \"MULTILINESTRING((2 1,3 1),(2 0,2 1))\",\n\t\t\tfwdDiff: \"POLYGON((1 2,0 2,0 0,2 0,2 1,3 1,3 3,1 3,1 2))\",\n\t\t\trevDiff: \"POLYGON((2 0,3 0,3 1,2 1,2 0))\",\n\t\t\tsymDiff: \"POLYGON((0 0,2 0,3 0,3 1,3 3,1 3,1 2,0 2,0 0))\",\n\t\t\trelate: \"FF2F11212\",\n\t\t},\n\t\t{\n\t\t\t/*\n\t\t\t\t +--------+ +--------+\n\t\t\t\t | | | |\n\t\t\t\t | 1A | | |\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| 2A | | 2B | -> | | | |\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 | 1B | | |\n\t\t\t\t | | | |\n\t\t\t\t +--------+ +--------+\n\t\t\t*/\n\t\t\tinput1: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((2 0,5 0,5 3,2 3,2 0)),\n\t\t\t\tPOLYGON((2 4,5 4,5 7,2 7,2 4)))`,\n\t\t\tinput2: `GEOMETRYCOLLECTION(\n\t\t\t\tPOLYGON((0 2,3 2,3 5,0 5,0 2)),\n\t\t\t\tPOLYGON((4 2,7 2,7 5,4 5,4 2)))`,\n\t\t\tunion: `POLYGON(\n\t\t\t\t(0 2,2 2,2 0,5 0,5 2,7 2,7 5,5 5,5 7,2 7,2 5,0 5,0 2),\n\t\t\t\t(3 3,3 4,4 4,4 3,3 3))`,\n\t\t\tinter: `MULTIPOLYGON(\n\t\t\t\t((2 2,3 2,3 3,2 3,2 2)),\n\t\t\t\t((2 4,3 4,3 5,2 5,2 4)),\n\t\t\t\t((4 2,5 2,5 3,4 3,4 2)),\n\t\t\t\t((4 4,5 4,5 5,4 5,4 4)))`,\n\t\t\tfwdDiff: `MULTIPOLYGON(\n\t\t\t\t((2 0,5 0,5 2,4 2,4 3,3 3,3 2,2 2,2 0)),\n\t\t\t\t((3 4,4 4,4 5,5 5,5 7,2 7,2 5,3 5,3 4)))`,\n\t\t\trevDiff: `MULTIPOLYGON(\n\t\t\t\t((0 2,2 2,2 3,3 3,3 4,2 4,2 5,0 5,0 2)),\n\t\t\t\t((5 2,7 2,7 5,5 5,5 4,4 4,4 3,5 3,5 2)))`,\n\t\t\tsymDiff: `MULTIPOLYGON(\n\t\t\t\t((2 0,5 0,5 2,4 2,4 3,3 3,3 2,2 2,2 0)),\n\t\t\t\t((2 2,2 3,3 3,3 4,2 4,2 5,0 5,0 2,2 2)),\n\t\t\t\t((3 4,4 4,4 5,5 5,5 7,2 7,2 5,3 5,3 4)),\n\t\t\t\t((4 3,5 3,5 2,7 2,7 5,5 5,5 4,4 4,4 3)))`,\n\t\t\trelate: \"212101212\",\n\t\t},\n\n\t\t// Empty cases for relate.\n\t\t{input1: \"POINT EMPTY\", input2: \"POINT(0 0)\", relate: \"FFFFFF0F2\"},\n\t\t{input1: \"POINT EMPTY\", input2: \"LINESTRING(0 0,1 1)\", relate: \"FFFFFF102\"},\n\t\t{input1: \"POINT EMPTY\", input2: \"LINESTRING(0 0,0 1,1 0,0 0)\", relate: \"FFFFFF1F2\"},\n\t\t{input1: \"POINT EMPTY\", input2: \"POLYGON((0 0,0 1,1 0,0 0))\", relate: \"FFFFFF212\"},\n\n\t\t// Cases involving geometry collections where polygons from one of the\n\t\t// inputs interact with each other.\n\t\t{\n\t\t\tinput1: `GEOMETRYCOLLECTION(\n\t\t\t\t\t\tPOLYGON((0 0,1 0,0 1,0 0)),\n\t\t\t\t\t\tPOLYGON((0 0,1 1,0 1,0 0)))`,\n\t\t\tinput2: \"LINESTRING(0 0,1 1)\",\n\t\t\tunion: \"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\",\n\t\t\tinter: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1))\",\n\t\t\tfwdDiff: \"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\",\n\t\t\trevDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tsymDiff: \"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\",\n\t\t\trelate: \"1F2101FF2\",\n\t\t},\n\t\t{\n\t\t\tinput1: `GEOMETRYCOLLECTION(\n\t\t\t\t\t\tPOLYGON((0 0,1 0,0 1,0 0)),\n\t\t\t\t\t\tPOLYGON((1 1,0 1,1 0,1 1)))`,\n\t\t\tinput2: \"POLYGON((0 0,2 0,2 2,0 2,0 0))\",\n\t\t\tunion: \"POLYGON((0 0,1 0,2 0,2 2,0 2,0 1,0 0))\",\n\t\t\tinter: \"POLYGON((0 0,1 0,1 1,0 1,0 0))\",\n\t\t\tfwdDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trevDiff: \"POLYGON((1 0,2 0,2 2,0 2,0 1,1 1,1 0))\",\n\t\t\tsymDiff: \"POLYGON((1 0,2 0,2 2,0 2,0 1,1 1,1 0))\",\n\t\t\trelate: \"2FF11F212\",\n\t\t},\n\t\t{\n\t\t\tinput1: `GEOMETRYCOLLECTION(\n\t\t\t\t\t\tPOLYGON((0 0,2 0,2 1,0 1,0 0)),\n\t\t\t\t\t\tPOLYGON((0 0,1 0,1 2,0 2,0 0)))`,\n\t\t\tinput2: \"POLYGON((1 0,2 1,1 2,0 1,1 0))\",\n\t\t\tunion: \"POLYGON((0 0,1 0,2 0,2 1,1 2,0 2,0 1,0 0))\",\n\t\t\tinter: \"POLYGON((1 0,2 1,1 1,1 2,0 1,1 0))\",\n\t\t\tfwdDiff: \"MULTIPOLYGON(((0 0,1 0,0 1,0 0)),((1 0,2 0,2 1,1 0)),((0 1,1 2,0 2,0 1)))\",\n\t\t\trevDiff: \"POLYGON((1 1,2 1,1 2,1 1))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 0,1 0,0 1,0 0)),((1 0,2 0,2 1,1 0)),((0 1,1 2,0 2,0 1)),((1 1,2 1,1 2,1 1)))\",\n\t\t\trelate: \"212101212\",\n\t\t},\n\n\t\t// Bug reproductions:\n\t\t{\n\t\t\tinput1: \"LINESTRING(-1 1,1 -1)\",\n\t\t\tinput2: \"MULTILINESTRING((1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2))\",\n\t\t\tunion: \"MULTILINESTRING((-1 1,1 -1),(1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tfwdDiff: \"LINESTRING(-1 1,1 -1)\",\n\t\t\trevDiff: \"MULTILINESTRING((1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2))\",\n\t\t\tsymDiff: \"MULTILINESTRING((1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2),(-1 1,1 -1))\",\n\t\t\trelate: \"FF1FF0102\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(0 1,1 0)\",\n\t\t\tinput2: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\",\n\t\t\tunion: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0.5,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\",\n\t\t\tinter: \"LINESTRING(0 1,1 0)\",\n\t\t\tfwdDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trevDiff: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0.5,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0.5,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\",\n\t\t\trelate: \"1FFF0F212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"POLYGON((1 0,0 1,1 1,1 0))\",\n\t\t\tinput2: \"POLYGON((2 0,2 1,3 1,3 0,2 0))\",\n\t\t\tunion: \"MULTIPOLYGON(((1 0,0 1,1 1,1 0)),((2 0,2 1,3 1,3 0,2 0)))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tfwdDiff: \"POLYGON((1 0,0 1,1 1,1 0))\",\n\t\t\trevDiff: \"POLYGON((2 0,2 1,3 1,3 0,2 0))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((2 0,2 1,3 1,3 0,2 0)),((1 0,0 1,1 1,1 0)))\",\n\t\t\trelate: \"FF2FF1212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"POLYGON((0 0,1 1,1 0,0 0))\",\n\t\t\tinput2: \"POLYGON((2 2,3 2,3 1,2 1,2 2))\",\n\t\t\tunion: \"MULTIPOLYGON(((0 0,1 0,1 1,0 0)),((2 1,2 2,3 2,3 1,2 1)))\",\n\t\t\tinter: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\tfwdDiff: \"POLYGON((0 0,1 1,1 0,0 0))\",\n\t\t\trevDiff: \"POLYGON((2 1,2 2,3 2,3 1,2 1))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((2 1,2 2,3 2,3 1,2 1)),((0 0,1 0,1 1,0 0)))\",\n\t\t\trelate: \"FF2FF1212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(0 1,1 0)\",\n\t\t\tinput2: \"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((2 1,2 2,3 2,3 1,2 1)))\",\n\t\t\tunion: \"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((2 1,2 2,3 2,3 1,2 1)))\",\n\t\t\tinter: \"LINESTRING(0 1,1 0)\",\n\t\t\tfwdDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trevDiff: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 1,2 2,3 2,3 1,2 1)))\",\n\t\t\tsymDiff: \"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 1,2 2,3 2,3 1,2 1)))\",\n\t\t\trelate: \"1FFF0F212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"POINT(5 5)\",\n\t\t\tinput2: \"LINESTRING(5 3,4 8,1 2,9 8)\",\n\t\t\tfwdDiff: \"GEOMETRYCOLLECTION EMPTY\",\n\t\t\trelate: \"0FFFFF102\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(1 1,2 2,3 3,0 0)\",\n\t\t\tinput2: \"LINESTRING(1 2,2 0)\",\n\t\t\tinter: \"POINT(1.3333333333 1.3333333333)\",\n\t\t\trelate: \"0F1FF0102\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"MULTILINESTRING((0 0,1 1),(0 1,1 0))\",\n\t\t\tinput2: \"LINESTRING(0 1,0.3333333333 0.6666666667,1 0)\",\n\t\t\tunion: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(0 1,0.3333333333 0.6666666667,0.5 0.5),(0.5 0.5,1 0))\",\n\t\t\trelate: \"1F1F00FF2\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"POLYGON((-1 0,0 0,0 1,-1 0))\",\n\t\t\tinput2: \"POLYGON((1 0,-0.9 -0.2,-1 -0.0000000000000032310891488651735,-0.9 0.2,1 0))\",\n\t\t\tunion: \"POLYGON((-1 0,-0.9 0.2,-0.80952380952381 0.19047619047619,0 1,0 0.105263157894737,1 0,-0.9 -0.2,-1 0))\",\n\t\t\trelate: \"212101212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(1 2.1,2.1 1)\",\n\t\t\tinput2: \"POLYGON((0 0,0 10,10 10,10 0,0 0),(1.5 1.5,8.5 1.5,8.5 8.5,1.5 8.5,1.5 1.5))\",\n\t\t\tinter: \"MULTILINESTRING((1 2.1,1.5 1.6),(1.6 1.5,2.1 1))\",\n\t\t\trelate: \"1010FF212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(1 2,2 3)\",\n\t\t\tinput2: \"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((1 2,2 2,2 3,1 3,1 2)))\",\n\t\t\tunion: \"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((1 2,2 2,2 3,1 3,1 2)))\",\n\t\t\trelate: \"1FFF0F212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(0 1,0 0,1 0)\",\n\t\t\tinput2: \"POLYGON((0 0,1 0,1 1,0 1,0 0.5,0 0))\",\n\t\t\tunion: \"POLYGON((0 0,1 0,1 1,0 1,0 0.5,0 0))\",\n\t\t\trelate: \"F1FF0F212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(2 2,3 3,4 4,5 5,0 0)\",\n\t\t\tinput2: \"LINESTRING(0 0,1 1)\",\n\t\t\tfwdDiff: \"MULTILINESTRING((2 2,3 3,4 4,5 5),(1 1,2 2))\",\n\t\t\trelate: \"101F00FF2\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(0 0,0 0,0 1,1 0,0 0)\",\n\t\t\tinput2: \"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(0 1,0.3333333333 0.6666666667,0.5 0.5),(0.5 0.5,1 0))\",\n\t\t\tfwdDiff: \"MULTILINESTRING((0 0,0 1),(1 0,0 0))\",\n\t\t\trelate: \"101FFF102\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(1 0,0.5000000000000001 0.5,0 1)\",\n\t\t\tinput2: \"MULTIPOLYGON(((0 0,2 0,2 2,0 2,0 0),(0.5 0.5,1 0.5,1 1.5,0.5 1.5,0.5 0.5)))\",\n\t\t\tunion: \"POLYGON((0 0,1 0,2 0,2 2,0 2,0 1,0 0),(0.5000000000000001 0.5,1 0.5,1 1.5,0.5 1.5,0.5000000000000001 0.5))\",\n\t\t\trelate: \"10FF0F212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(1 1,3 1,1 1,3 1)\",\n\t\t\tinput2: \"POLYGON((0 0,0 2,2 2,2 0,0 0))\",\n\t\t\trelate: \"1010F0212\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(-1 1,1 -1)\",\n\t\t\tinput2: \"MULTILINESTRING((0 0,0 1),(0 0,1 0))\",\n\t\t\trelate: \"0F1FF0102\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"MULTILINESTRING((2 0,2 1),(2 2,2 3))\",\n\t\t\tinput2: \"POLYGON((0 0,0 10,10 10,10 0,0 0),(1.5 1.5,8.5 1.5,8.5 8.5,1.5 8.5,1.5 1.5))\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(POLYGON((2 0,10 0,10 10,0 10,0 0,2 0),(1.5 1.5,1.5 8.5,8.5 8.5,8.5 1.5,1.5 1.5)),LINESTRING(2 2,2 3))\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"POINT(0 0)\",\n\t\t\tinput2: \"POINT(0 0)\",\n\t\t\trelate: \"0FFFFFFF2\",\n\t\t\tunion: \"POINT(0 0)\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"GEOMETRYCOLLECTION(POINT(0 0))\",\n\t\t\tinput2: \"GEOMETRYCOLLECTION(LINESTRING(2 0,2 1))\",\n\t\t\tunion: \"GEOMETRYCOLLECTION(POINT(0 0),LINESTRING(2 0,2 1))\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"GEOMETRYCOLLECTION(POLYGON((0 0,1 0,0 1,0 0)),POLYGON((0 0,1 1,0 1,0 0)))\",\n\t\t\tinput2: \"POINT(0 0)\",\n\t\t\tunion: \"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"GEOMETRYCOLLECTION(POLYGON((0 0,0 1,1 0,0 0)),POLYGON((0 1,1 1,1 0,0 1)))\",\n\t\t\tinput2: \"POLYGON EMPTY\",\n\t\t\tunion: \"POLYGON((0 0,0 1,1 1,1 0,0 0))\",\n\t\t},\n\t\t{\n\t\t\tinput1: \"LINESTRING(0 0,0 0,0 1,1 0,0 0)\",\n\t\t\tinput2: \"LINESTRING(0.1 0.1,0.5 0.5)\",\n\t\t\tinter: \"POINT(0.5 0.5)\",\n\t\t},\n\t} {\n\t\tt.Run(strconv.Itoa(i), func(t *testing.T) {\n\t\t\tg1 := geomFromWKT(t, geomCase.input1)\n\t\t\tg2 := geomFromWKT(t, geomCase.input2)\n\t\t\tt.Logf(\"input1: %s\", geomCase.input1)\n\t\t\tt.Logf(\"input2: %s\", geomCase.input2)\n\t\t\tfor _, opCase := range []struct {\n\t\t\t\topName string\n\t\t\t\top func(geom.Geometry, geom.Geometry) (geom.Geometry, error)\n\t\t\t\twant string\n\t\t\t}{\n\t\t\t\t{\"union\", geom.Union, geomCase.union},\n\t\t\t\t{\"inter\", geom.Intersection, geomCase.inter},\n\t\t\t\t{\"fwd_diff\", geom.Difference, geomCase.fwdDiff},\n\t\t\t\t{\"rev_diff\", func(a, b geom.Geometry) (geom.Geometry, error) { return geom.Difference(b, a) }, geomCase.revDiff},\n\t\t\t\t{\"sym_diff\", geom.SymmetricDifference, geomCase.symDiff},\n\t\t\t} {\n\t\t\t\tt.Run(opCase.opName, func(t *testing.T) {\n\t\t\t\t\tif opCase.want == \"\" {\n\t\t\t\t\t\tt.Skip(\"Skipping test because it's not specified or is commented out\")\n\t\t\t\t\t}\n\t\t\t\t\twant := geomFromWKT(t, opCase.want)\n\t\t\t\t\tgot, err := opCase.op(g1, g2)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\tt.Fatalf(\"could not perform op: %v\", err)\n\t\t\t\t\t}\n\t\t\t\t\texpectGeomEq(t, got, want, geom.IgnoreOrder, geom.ToleranceXY(1e-7))\n\t\t\t\t})\n\t\t\t}\n\t\t\tt.Run(\"relate\", func(t *testing.T) {\n\t\t\t\tif geomCase.relate == \"\" {\n\t\t\t\t\tt.Skip(\"Skipping test because it's not specified or is commented out\")\n\t\t\t\t}\n\t\t\t\tfor _, swap := range []struct {\n\t\t\t\t\tdescription string\n\t\t\t\t\treverse bool\n\t\t\t\t}{\n\t\t\t\t\t{\"fwd\", false},\n\t\t\t\t\t{\"rev\", true},\n\t\t\t\t} {\n\t\t\t\t\tt.Run(swap.description, func(t *testing.T) {\n\t\t\t\t\t\tvar (\n\t\t\t\t\t\t\tgot string\n\t\t\t\t\t\t\terr error\n\t\t\t\t\t\t)\n\t\t\t\t\t\tif swap.reverse {\n\t\t\t\t\t\t\tgot, err = geom.Relate(g2, g1)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tgot, err = geom.Relate(g1, g2)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\tt.Fatal(\"could not perform relate op\")\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\twant := geomCase.relate\n\t\t\t\t\t\tif swap.reverse {\n\t\t\t\t\t\t\twant = \"\"\n\t\t\t\t\t\t\tfor j := 0; j < 9; j++ {\n\t\t\t\t\t\t\t\tk := 3*(j%3) + j/3\n\t\t\t\t\t\t\t\twant += geomCase.relate[k : k+1]\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif got != want {\n\t\t\t\t\t\t\tt.Errorf(\"\\nwant: %v\\ngot: %v\\n\", want, got)\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\t}\n}","func JB(r operand.Op) { ctx.JB(r) }","func (c *compiledField) compileExpr(expr influxql.Expr) error {\n\tswitch expr := expr.(type) {\n\tcase *influxql.VarRef:\n\t\t// A bare variable reference will require auxiliary fields.\n\t\tc.global.HasAuxiliaryFields = true\n\t\treturn nil\n\tcase *influxql.Wildcard:\n\t\t// Wildcards use auxiliary fields. We assume there will be at least one\n\t\t// expansion.\n\t\tc.global.HasAuxiliaryFields = true\n\t\tif !c.AllowWildcard {\n\t\t\treturn errors.New(\"unable to use wildcard in a binary expression\")\n\t\t}\n\t\treturn nil\n\tcase *influxql.RegexLiteral:\n\t\tif !c.AllowWildcard {\n\t\t\treturn errors.New(\"unable to use regex in a binary expression\")\n\t\t}\n\t\tc.global.HasAuxiliaryFields = true\n\t\treturn nil\n\tcase *influxql.Call:\n\t\tif isMathFunction(expr) {\n\t\t\treturn c.compileMathFunction(expr)\n\t\t}\n\n\t\t// Register the function call in the list of function calls.\n\t\tc.global.FunctionCalls = append(c.global.FunctionCalls, expr)\n\n\t\tswitch expr.Name {\n\t\tcase \"percentile\":\n\t\t\treturn c.compilePercentile(expr.Args)\n\t\tcase \"sample\":\n\t\t\treturn c.compileSample(expr.Args)\n\t\tcase \"distinct\":\n\t\t\treturn c.compileDistinct(expr.Args, false)\n\t\tcase \"top\", \"bottom\":\n\t\t\treturn c.compileTopBottom(expr)\n\t\tcase \"derivative\", \"non_negative_derivative\":\n\t\t\tisNonNegative := expr.Name == \"non_negative_derivative\"\n\t\t\treturn c.compileDerivative(expr.Args, isNonNegative)\n\t\tcase \"difference\", \"non_negative_difference\":\n\t\t\tisNonNegative := expr.Name == \"non_negative_difference\"\n\t\t\treturn c.compileDifference(expr.Args, isNonNegative)\n\t\tcase \"cumulative_sum\":\n\t\t\treturn c.compileCumulativeSum(expr.Args)\n\t\tcase \"moving_average\":\n\t\t\treturn c.compileMovingAverage(expr.Args)\n\t\tcase \"exponential_moving_average\", \"double_exponential_moving_average\", \"triple_exponential_moving_average\", \"relative_strength_index\", \"triple_exponential_derivative\":\n\t\t\treturn c.compileExponentialMovingAverage(expr.Name, expr.Args)\n\t\tcase \"kaufmans_efficiency_ratio\", \"kaufmans_adaptive_moving_average\":\n\t\t\treturn c.compileKaufmans(expr.Name, expr.Args)\n\t\tcase \"chande_momentum_oscillator\":\n\t\t\treturn c.compileChandeMomentumOscillator(expr.Args)\n\t\tcase \"elapsed\":\n\t\t\treturn c.compileElapsed(expr.Args)\n\t\tcase \"integral\":\n\t\t\treturn c.compileIntegral(expr.Args)\n\t\tcase \"holt_winters\", \"holt_winters_with_fit\":\n\t\t\twithFit := expr.Name == \"holt_winters_with_fit\"\n\t\t\treturn c.compileHoltWinters(expr.Args, withFit)\n\t\tdefault:\n\t\t\treturn c.compileFunction(expr)\n\t\t}\n\tcase *influxql.Distinct:\n\t\tcall := expr.NewCall()\n\t\tc.global.FunctionCalls = append(c.global.FunctionCalls, call)\n\t\treturn c.compileDistinct(call.Args, false)\n\tcase *influxql.BinaryExpr:\n\t\t// Disallow wildcards in binary expressions. RewriteFields, which expands\n\t\t// wildcards, is too complicated if we allow wildcards inside of expressions.\n\t\tc.AllowWildcard = false\n\n\t\t// Check if either side is a literal so we only compile one side if it is.\n\t\tif _, ok := expr.LHS.(influxql.Literal); ok {\n\t\t\tif _, ok := expr.RHS.(influxql.Literal); ok {\n\t\t\t\treturn errors.New(\"cannot perform a binary expression on two literals\")\n\t\t\t}\n\t\t\treturn c.compileExpr(expr.RHS)\n\t\t} else if _, ok := expr.RHS.(influxql.Literal); ok {\n\t\t\treturn c.compileExpr(expr.LHS)\n\t\t} else {\n\t\t\t// Validate both sides of the expression.\n\t\t\tif err := c.compileExpr(expr.LHS); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif err := c.compileExpr(expr.RHS); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\treturn nil\n\t\t}\n\tcase *influxql.ParenExpr:\n\t\treturn c.compileExpr(expr.Expr)\n\tcase influxql.Literal:\n\t\treturn errors.New(\"field must contain at least one variable\")\n\t}\n\treturn errors.New(\"unimplemented\")\n}","func TestCheckBinaryExprComplexAndNotComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i &^ 8.0i`, env,\n\t\t`illegal constant expression: untyped number &^ untyped number`,\n\t)\n\n}","func (bo BinaryOperator) EvaluateLeftAndRight(vars map[string]interface{}, ctx interface{}, funcs FunctionMap, quotes []string) (map[string]interface{}, interface{}, interface{}, error) {\n\n\tvars, lv, err := bo.Left.Evaluate(vars, ctx, funcs, quotes)\n\tif err != nil {\n\t\treturn vars, false, false, err\n\t}\n\tvars, rv, err := bo.Right.Evaluate(vars, ctx, funcs, quotes)\n\tif err != nil {\n\t\treturn vars, false, false, err\n\t}\n\treturn vars, lv, rv, nil\n}","func VPBROADCASTQ(ops ...operand.Op) { ctx.VPBROADCASTQ(ops...) }","func TestCheckBinaryExprBoolAndNotComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true &^ 8.0i`, env,\n\t\t`cannot convert 8i to type bool`,\n\t\t`invalid operation: true &^ 8i (mismatched types bool and complex128)`,\n\t)\n\n}","func TestCheckBinaryExprBoolOrComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true | 8.0i`, env,\n\t\t`cannot convert 8i to type bool`,\n\t\t`invalid operation: true | 8i (mismatched types bool and complex128)`,\n\t)\n\n}","func (parser *Parser) ParseBinOpRHS(exprPrec int, lhs ExprAST) (ExprAST, error) {\n\tfor {\n\t\t// If this is a binop, find its precedence.\n\t\tprecedence := parser.tokenPrecedence()\n\n\t\t// If this is a binop that binds at least as tightly as the current binop,\n\t\t// consume it, otherwise we are done.\n\t\tif precedence < exprPrec {\n\t\t\treturn lhs, nil\n\t\t}\n\n\t\t// Okay, we know this is a binop.\n\t\tbinOp := parser.lexer.LastChar\n\t\tparser.Next() // Eat binary operator.\n\n\t\t// Parse the primary expression after the binary operator.\n\t\trhs, rhsErr := parser.ParsePrimary()\n\t\tif rhsErr != nil {\n\t\t\treturn nil, rhsErr\n\t\t}\n\n\t\t// If BinOp binds less tightly with RHS than the operator after RHS, let\n\t\t// the pending operator take RHS as its LHS.\n\t\tnextPrecedence := parser.tokenPrecedence()\n\t\tif precedence < nextPrecedence {\n\t\t\tvar rhsError error\n\t\t\trhs, rhsError = parser.ParseBinOpRHS(precedence+1, rhs)\n\t\t\tif rhsError != nil {\n\t\t\t\treturn nil, rhsErr\n\t\t\t}\n\t\t}\n\n\t\t// Merge LHS/RHS.\n\t\tlhs = &BinaryExprAST{binOp, lhs, rhs}\n\t}\n}","func NewBinaryFrame(p []byte) Frame {\n\treturn NewFrame(OpBinary, true, p)\n}","func TestCheckBinaryExprComplexOrBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i | true`, env,\n\t\t`cannot convert true to type complex128`,\n\t\t`invalid operation: 8i | true (mismatched types complex128 and bool)`,\n\t)\n\n}","func BinaryCommit(G, b *RingMartix, Ba, Bra int) (A, B, ra, rb, a *RingMartix, err error) {\n\tnttParams := settings.nttParams\n\tseed := time.Now().UnixNano() // may consider more secure seeds\n\n\t// build a\n\ta, err = NewRingMartix(b.col, 1, nttParams)\n\tif a == nil {\n\t\terr = errors.New(\"NewRingMartix fail\")\n\t\treturn\n\t}\n\ta.SetRandomBRingMartix(&b.ringvectors[0].rings[0], seed, settings.d, Ba, true)\n\n\tA, B, ra, rb, err = BinaryCommitWithA(G, a, b, Ba, Bra)\n\treturn\n}","func TestCheckBinaryExprBoolAndBool(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true & true`, env,\n\t\t`invalid operation: true & true (operator & not defined on bool)`,\n\t)\n\n}","func BinaryCommitWithA(G, a, b *RingMartix, Ba, Bra int) (A, B, ra, rb *RingMartix, err error) {\n\tnttParams := settings.nttParams\n\n\t// build c\n\tc, err := NewRingMartix(b.col, 1, nttParams)\n\tif c == nil {\n\t\terr = errors.New(\"NewRingMartix fail\")\n\t\treturn\n\t}\n\tc.SetRingMartix(&b.ringvectors[0].rings[0])\n\n\tcoeffs := make([]bigint.Int, settings.d)\n\tcoeffs[0].SetInt(int64(1))\n\tonering, _ := ring.CopyRing(&b.ringvectors[0].rings[0])\n\t_ = onering.Poly.SetCoefficients(coeffs)\n\n\tnonering, _ := ring.CopyRing(onering)\n\tcoeffs[0].SetInt(int64(-1))\n\t_ = nonering.Poly.SetCoefficients(coeffs)\n\n\tntworing, _ := ring.CopyRing(onering)\n\tcoeffs[0].SetInt(int64(-2))\n\t_ = ntworing.Poly.SetCoefficients(coeffs)\n\n\t// c = (-2 * b + 1) * a\n\t_, err = c.RingMatScalarMul(ntworing, b)\n\t_, err = c.RingMatScalarAdd(onering, c)\n\t_, err = c.RingMatHadamardProd(c, a)\n\n\t// build d\n\td, err := NewRingMartix(b.col, 1, nttParams)\n\tif d == nil {\n\t\terr = errors.New(\"NewRingMartix fail\")\n\t\treturn\n\t}\n\td.SetRingMartix(&b.ringvectors[0].rings[0])\n\n\t// d = 0 - a^2\n\t_, err = d.RingMatHadamardProd(a, a)\n\t_, err = d.RingMatScalarMul(nonering, d)\n\n\t// bc = (b, c)\n\tbc, err := NewRingMartix(b.col + c.col, 1, nttParams)\n\tif bc == nil {\n\t\terr = errors.New(\"NewRingMartix fail\")\n\t\treturn\n\t}\n\n\t_, err = bc.RingMatCombine(b, c)\n\tB, rb, err = Commitment(G, bc, settings.B)\n\n\t// ad = (a, d)\n\tad, err := NewRingMartix(a.col + d.col, 1, nttParams)\n\tif ad == nil {\n\t\terr = errors.New(\"NewRingMartix fail\")\n\t\treturn\n\t}\n\n\t_, err = ad.RingMatCombine(a, d)\n\tA, ra, err = Commitment(G, ad, Bra)\n\n\treturn\n}","func TestCheckBinaryExprIntAddComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectConst(t, `4 + 8.0i`, env, NewConstComplex128(4 + 8.0i), ConstComplex)\n}","func PADDSB(mx, x operand.Op) { ctx.PADDSB(mx, x) }","func (r FieldRule) ValidateBinaryExpr(expr *ast.BinaryExpr) error {\n\tbatchError := pepperlint.NewBatchError()\n\n\tif errs := r.checkBinaryExprFields(expr); len(errs) > 0 {\n\t\tbatchError.Add(errs...)\n\t}\n\n\treturn batchError.Return()\n}","func TestCheckBinaryExprComplexEqlInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectConst(t, `8.0i == 4`, env, (8.0i == 4), ConstBool)\n}","func TestCheckBinaryExprComplexAddComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectConst(t, `8.0i + 8.0i`, env, NewConstComplex128(8.0i + 8.0i), ConstComplex)\n}","func TestCheckBinaryExprBoolAndNotInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `true &^ 4`, env,\n\t\t`cannot convert 4 to type bool`,\n\t\t`invalid operation: true &^ 4 (mismatched types bool and int)`,\n\t)\n\n}","func TestCheckBinaryExprComplexOrComplex(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectCheckError(t, `8.0i | 8.0i`, env,\n\t\t`illegal constant expression: untyped number | untyped number`,\n\t)\n\n}","func addb(context *Context) {\n x := context.opcode & 0x0F00 >> 8\n b := byte(context.opcode & 0x00FF)\n context.cpu.v[x] += b\n context.cpu.pc += 2\n}","func TestCheckBinaryExprIntAddInt(t *testing.T) {\n\tenv := MakeSimpleEnv()\n\n\texpectConst(t, `4 + 4`, env, NewConstInt64(4 + 4), ConstInt)\n}"],"string":"[\n \"func newBinaryExprEvaluator(e *Executor, op Token, lhs, rhs processor) *binaryExprEvaluator {\\n\\treturn &binaryExprEvaluator{\\n\\t\\texecutor: e,\\n\\t\\top: op,\\n\\t\\tlhs: lhs,\\n\\t\\trhs: rhs,\\n\\t\\tc: make(chan map[string]interface{}, 0),\\n\\t\\tdone: make(chan chan struct{}, 0),\\n\\t}\\n}\",\n \"func TestCompiler_Compile_binaryExpr(t *testing.T) {\\n\\texpr := ast.BinaryExpr{\\n\\t\\tX: ast.ScalarExpr{Val: \\\"1\\\", Typ: token.INT},\\n\\t\\tOp: token.ADD,\\n\\t\\tY: ast.BinaryExpr{\\n\\t\\t\\tX: ast.ScalarExpr{Val: \\\"2\\\", Typ: token.INT},\\n\\t\\t\\tOp: token.MUL,\\n\\t\\t\\tY: ast.ScalarExpr{Val: \\\"2\\\", Typ: token.INT},\\n\\t\\t},\\n\\t}\\n\\tc := NewCompiler()\\n\\texpected := []Instruction{\\n\\t\\t{Op: MULTIPLY, Arg1: Argument{Val: \\\"2\\\", ValType: INTEGER}, Arg2: Argument{Val: \\\"2\\\", ValType: INTEGER}, Ret: Argument{TVal: 1}},\\n\\t\\t{Op: ADD, Arg1: Argument{Val: \\\"1\\\", ValType: INTEGER}, Arg2: Argument{TVal: 1}, Ret: Argument{TVal: 2}},\\n\\t}\\n\\tinsts := c.Compile(expr)\\n\\tif insts.tvals != 2 {\\n\\t\\tt.Errorf(\\\"expected 2 got %d\\\", insts.tvals)\\n\\t}\\n\\tfor i, actual := range insts.instructions {\\n\\t\\tif compareInstrucions(expected[i], actual) == false {\\n\\t\\t\\tt.Errorf(\\\"expected %s got %s\\\", expected, actual)\\n\\t\\t}\\n\\t}\\n}\",\n \"func binary(typ int, od1 *expr, op string, od2 *expr) *expr {\\n\\treturn &expr{\\n\\t\\tsexp: append(exprlist{atomic(typ, op)}, od1, od2),\\n\\t}\\n}\",\n \"func parseBinary(lex *lexer, prec1 int) Expr {\\n\\tlhs := parseUnary(lex)\\n\\tfor prec := precedence(lex.token); prec >= prec1; prec-- {\\n\\t\\tfor precedence(lex.token) == prec {\\n\\t\\t\\top := lex.token\\n\\t\\t\\tlex.next() // consume operator\\n\\t\\t\\trhs := parseBinary(lex, prec+1)\\n\\t\\t\\tlhs = binary{op, lhs, rhs}\\n\\t\\t}\\n\\t}\\n\\treturn lhs\\n}\",\n \"func NewBinaryBooleanExpression(op OP, lE, rE Evaluator) (Evaluator, error) {\\n\\tswitch op {\\n\\tcase AND, OR:\\n\\t\\treturn &booleanNode{\\n\\t\\t\\top: op,\\n\\t\\t\\tlS: true,\\n\\t\\t\\tlE: lE,\\n\\t\\t\\trS: true,\\n\\t\\t\\trE: rE,\\n\\t\\t}, nil\\n\\tdefault:\\n\\t\\treturn nil, errors.New(\\\"binary boolean expressions require the operation to be one for the follwing 'and', 'or'\\\")\\n\\t}\\n}\",\n \"func newBinaryOp(op string, expr1, expr2 Expression) Expression {\\n\\tswitch {\\n\\tcase expr1 != nil && expr2 != nil:\\n\\t\\treturn &BinaryOp{\\n\\t\\t\\tOp: op,\\n\\t\\t\\tExpr1: expr1,\\n\\t\\t\\tExpr2: expr2,\\n\\t\\t}\\n\\tcase expr1 != nil && expr2 == nil:\\n\\t\\treturn expr1\\n\\tcase expr1 == nil && expr2 != nil:\\n\\t\\treturn expr2\\n\\tcase expr1 == nil && expr2 == nil:\\n\\t\\treturn nil\\n\\t}\\n\\tpanic(\\\"unreachable\\\")\\n}\",\n \"func evalBinaryStringExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar err error\\n\\tvar r string\\n\\tvar b bool\\n\\tis_bool := false\\n\\n\\txx, yy := x.String(), y.String()\\n\\tswitch op {\\n\\tcase token.ADD:\\tr = xx + yy\\n\\tcase token.EQL: b = xx == yy; is_bool = true\\n\\tcase token.NEQ: b = xx != yy; is_bool = true\\n\\tcase token.LEQ: b = xx <= yy; is_bool = true\\n\\tcase token.GEQ: b = xx >= yy; is_bool = true\\n\\tcase token.LSS: b = xx < yy; is_bool = true\\n\\tcase token.GTR: b = xx > yy; is_bool = true\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\tif is_bool {\\n\\t\\treturn reflect.ValueOf(b), err\\n\\t} else {\\n\\t\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n\\t}\\n}\",\n \"func NewBinaryExpr(op BinaryOp, lhs, rhs Expr) Expr {\\n\\t// assert(ExprWidth(lhs) == ExprWidth(rhs), \\\"binary expr width mismatch: op=%s (%T) %d != (%T) %d\\\", op, lhs, ExprWidth(lhs), rhs, ExprWidth(rhs))\\n\\n\\tswitch op {\\n\\t// Arithmetic operators\\n\\tcase ADD:\\n\\t\\treturn newAddExpr(lhs, rhs)\\n\\tcase SUB:\\n\\t\\treturn newSubExpr(lhs, rhs)\\n\\tcase MUL:\\n\\t\\treturn newMulExpr(lhs, rhs)\\n\\tcase UDIV, SDIV:\\n\\t\\treturn newDivExpr(op, lhs, rhs)\\n\\tcase UREM, SREM:\\n\\t\\treturn newRemExpr(op, lhs, rhs)\\n\\tcase AND:\\n\\t\\treturn newAndExpr(lhs, rhs)\\n\\tcase OR:\\n\\t\\treturn newOrExpr(lhs, rhs)\\n\\tcase XOR:\\n\\t\\treturn newXorExpr(lhs, rhs)\\n\\tcase SHL:\\n\\t\\treturn newShlExpr(lhs, rhs)\\n\\tcase LSHR:\\n\\t\\treturn newLShrExpr(lhs, rhs)\\n\\tcase ASHR:\\n\\t\\treturn newAShrExpr(lhs, rhs)\\n\\n\\t// Comparison operators\\n\\tcase EQ:\\n\\t\\treturn newEqExpr(lhs, rhs)\\n\\tcase NE:\\n\\t\\treturn NewBinaryExpr(EQ, NewConstantExpr(0, WidthBool), NewBinaryExpr(EQ, lhs, rhs))\\n\\tcase ULT:\\n\\t\\treturn newUltExpr(lhs, rhs)\\n\\tcase UGT:\\n\\t\\treturn newUltExpr(rhs, lhs) // reverse\\n\\tcase ULE:\\n\\t\\treturn newUleExpr(lhs, rhs)\\n\\tcase UGE:\\n\\t\\treturn newUleExpr(rhs, lhs) // reverse\\n\\tcase SLT:\\n\\t\\treturn newSltExpr(lhs, rhs)\\n\\tcase SGT:\\n\\t\\treturn newSltExpr(rhs, lhs) // reverse\\n\\tcase SLE:\\n\\t\\treturn newSleExpr(lhs, rhs)\\n\\tcase SGE:\\n\\t\\treturn newSleExpr(rhs, lhs) // reverse\\n\\n\\tdefault:\\n\\t\\tpanic(\\\"unreachable\\\")\\n\\t}\\n}\",\n \"func evalBinaryIntExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar r int64\\n\\tvar err error\\n\\tvar b bool\\n\\tis_bool := false\\n\\n\\txx, yy := x.Int(), y.Int()\\n\\tswitch op {\\n\\tcase token.ADD: r = xx + yy\\n\\tcase token.SUB: r = xx - yy\\n\\tcase token.MUL: r = xx * yy\\n\\tcase token.QUO: r = xx / yy\\n\\tcase token.REM: r = xx % yy\\n\\tcase token.AND: r = xx & yy\\n\\tcase token.OR: r = xx | yy\\n\\tcase token.XOR: r = xx ^ yy\\n\\tcase token.AND_NOT: r = xx &^ yy\\n\\tcase token.EQL: b = xx == yy; is_bool = true\\n\\tcase token.NEQ: b = xx != yy; is_bool = true\\n\\tcase token.LEQ: b = xx <= yy; is_bool = true\\n\\tcase token.GEQ: b = xx >= yy; is_bool = true\\n\\tcase token.LSS: b = xx < yy; is_bool = true\\n\\tcase token.GTR: b = xx > yy; is_bool = true\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\tif is_bool {\\n\\t\\treturn reflect.ValueOf(b), err\\n\\t} else {\\n\\t\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n\\t}\\n}\",\n \"func NewBinary(left Expr, op *token.T, right Expr) *Binary {\\n\\treturn &Binary{\\n\\t\\tLeft: left,\\n\\t\\tOperator: op,\\n\\t\\tRight: right,\\n\\t}\\n}\",\n \"func _b(x interface{}, op string, y interface{}) ast.Expr {\\n\\tvar xx, yx ast.Expr\\n\\tif xstr, ok := x.(string); ok {\\n\\t\\txx = _x(xstr)\\n\\t} else {\\n\\t\\txx = x.(ast.Expr)\\n\\t}\\n\\tif ystr, ok := y.(string); ok {\\n\\t\\tyx = _x(ystr)\\n\\t} else {\\n\\t\\tyx = y.(ast.Expr)\\n\\t}\\n\\treturn &ast.BinaryExpr{\\n\\t\\tX: xx,\\n\\t\\tOp: _op(op),\\n\\t\\tY: yx,\\n\\t}\\n}\",\n \"func (*Base) Binary(p ASTPass, node *ast.Binary, ctx Context) {\\n\\tp.Visit(p, &node.Left, ctx)\\n\\tp.Fodder(p, &node.OpFodder, ctx)\\n\\tp.Visit(p, &node.Right, ctx)\\n}\",\n \"func (fi *funcInfo) emitBinaryOp(line int, op TokenType, a, b, c int) {\\r\\n\\tif opcode, found := arithAndBitwiseBinops[op]; found {\\r\\n\\t\\tfi.emitABC(line, opcode, a, b, c)\\r\\n\\t} else {\\r\\n\\t\\tswitch op {\\r\\n\\t\\tcase TOKEN_OP_EQ:\\r\\n\\t\\t\\tfi.emitABC(line, OP_EQ, 1, b, c)\\r\\n\\t\\tcase TOKEN_OP_NE:\\r\\n\\t\\t\\tfi.emitABC(line, OP_EQ, 0, b, c)\\r\\n\\t\\tcase TOKEN_OP_LT:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LT, 1, b, c)\\r\\n\\t\\tcase TOKEN_OP_GT:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LT, 1, c, b)\\r\\n\\t\\tcase TOKEN_OP_LE:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LE, 1, b, c)\\r\\n\\t\\tcase TOKEN_OP_GE:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LE, 1, c, b)\\r\\n\\t\\t}\\r\\n\\t\\tfi.emitJmp(line, 0, 1)\\r\\n\\t\\tfi.emitLoadBool(line, a, 0, 1)\\r\\n\\t\\tfi.emitLoadBool(line, a, 1, 0)\\r\\n\\t}\\r\\n}\",\n \"func evalBinaryComplexExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar err error\\n\\tvar r complex128\\n\\n\\txx, yy := x.Complex(), y.Complex()\\n\\tswitch op {\\n\\tcase token.ADD: r = xx + yy\\n\\tcase token.SUB: r = xx - yy\\n\\tcase token.MUL: r = xx * yy\\n\\tcase token.QUO: r = xx / yy\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n}\",\n \"func (s *BaseMySqlParserListener) EnterBinaryComparasionPredicate(ctx *BinaryComparasionPredicateContext) {\\n}\",\n \"func (s *BaselimboListener) EnterBinary_expression(ctx *Binary_expressionContext) {}\",\n \"func NewBinary(op circuit.Operation, a, b, o *Wire) *Gate {\\n\\tgate := &Gate{\\n\\t\\tOp: op,\\n\\t\\tA: a,\\n\\t\\tB: b,\\n\\t\\tO: o,\\n\\t}\\n\\ta.AddOutput(gate)\\n\\tb.AddOutput(gate)\\n\\to.SetInput(gate)\\n\\n\\treturn gate\\n}\",\n \"func evalBinaryUintExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar err error\\n\\tvar r uint64\\n\\tvar b bool\\n\\tis_bool := false\\n\\n\\txx, yy := x.Uint(), y.Uint()\\n\\tswitch op {\\n\\tcase token.ADD: r = xx + yy\\n\\tcase token.SUB: r = xx - yy\\n\\tcase token.MUL: r = xx * yy\\n\\tcase token.QUO: r = xx / yy\\n\\tcase token.REM: r = xx % yy\\n\\tcase token.AND: r = xx & yy\\n\\tcase token.OR: r = xx | yy\\n\\tcase token.XOR: r = xx ^ yy\\n\\tcase token.AND_NOT: r = xx &^ yy\\n\\tcase token.EQL: b = xx == yy; is_bool = true\\n\\tcase token.NEQ: b = xx != yy; is_bool = true\\n\\tcase token.LEQ: b = xx <= yy; is_bool = true\\n\\tcase token.GEQ: b = xx >= yy; is_bool = true\\n\\tcase token.LSS: b = xx < yy; is_bool = true\\n\\tcase token.GTR: b = xx > yy; is_bool = true\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\tif is_bool {\\n\\t\\treturn reflect.ValueOf(b), err\\n\\t} else {\\n\\t\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n\\t}\\n}\",\n \"func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {\\n\\tswitch expr := expr.(type) {\\n\\tcase *VarRef:\\n\\t\\tpanic(\\\"TODO\\\")\\n\\tcase *Call:\\n\\t\\treturn p.planCall(e, expr)\\n\\tcase *BinaryExpr:\\n\\t\\treturn p.planBinaryExpr(e, expr)\\n\\tcase *ParenExpr:\\n\\t\\treturn p.planExpr(e, expr.Expr)\\n\\tcase *NumberLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *StringLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *BooleanLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *TimeLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\tcase *DurationLiteral:\\n\\t\\treturn newLiteralProcessor(expr.Val), nil\\n\\t}\\n\\tpanic(\\\"unreachable\\\")\\n}\",\n \"func (s *BaseGraffleParserListener) EnterBin_arithm_operator(ctx *Bin_arithm_operatorContext) {}\",\n \"func NewBinaryExpression(left Expression, op string, right Expression) Expression {\\n\\tlType := left.Type().GetKind()\\n\\trType := right.Type().GetKind()\\n\\n\\tif lType != rType {\\n\\t\\tpanic(\\\"mismatching types\\\")\\n\\t}\\n\\n\\tvar retVal Expression\\n\\tswitch op {\\n\\tcase \\\"+\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerAddition{left: left, right: right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realAddition{left: left, right: right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"-\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerSubstraction{left: left, right: right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realSubstraction{left: left, right: right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"*\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerMultiplication{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realMultiplication{left: left, right: right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"/\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerDivision{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realDivision{left: left, right: right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"%\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerModulo{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"|\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerOr{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"^\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerXor{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"&\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerAnd{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"or\\\":\\n\\t\\tif lType == BOOLEAN {\\n\\t\\t\\tretVal = &booleanOr{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"and\\\":\\n\\t\\tif lType == BOOLEAN {\\n\\t\\t\\tretVal = &booleanAnd{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"==\\\":\\n\\t\\tif lType == BOOLEAN {\\n\\t\\t\\tretVal = &booleanEqual{left, right}\\n\\t\\t} else if lType == INTEGER {\\n\\t\\t\\tretVal = &integerEqual{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realEqual{left, right}\\n\\t\\t} else if lType == FUNCTION {\\n\\t\\t\\tretVal = &funcEqual{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"!=\\\":\\n\\t\\tif lType == BOOLEAN {\\n\\t\\t\\tretVal = &booleanNotEqual{left, right}\\n\\t\\t} else if lType == INTEGER {\\n\\t\\t\\tretVal = &integerNotEqual{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realNotEqual{left, right}\\n\\t\\t} else if lType == FUNCTION {\\n\\t\\t\\tretVal = &funcNotEqual{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"<\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerLessThan{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realLessThan{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\">\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerGreaterThan{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realGreaterThan{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\"<=\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerLessOrEqual{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realLessOrEqual{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tcase \\\">=\\\":\\n\\t\\tif lType == INTEGER {\\n\\t\\t\\tretVal = &integerGreaterOrEqual{left, right}\\n\\t\\t} else if lType == REAL {\\n\\t\\t\\tretVal = &realGreaterOrEqual{left, right}\\n\\t\\t} else {\\n\\t\\t\\tpanic(\\\"unsupported type\\\")\\n\\t\\t}\\n\\tdefault:\\n\\t\\tpanic(\\\"unsupported operand\\\")\\n\\t}\\n\\n\\t// fmt.Println(retVal.String())\\n\\treturn retVal\\n}\",\n \"func VPBROADCASTB(ops ...operand.Op) { ctx.VPBROADCASTB(ops...) }\",\n \"func (w *Writer) PutBinaryExpr(b *ast.BinaryExpr) {\\n\\tif *flagParens {\\n\\t\\tw.Put(\\\"(\\\")\\n\\t}\\n\\n\\tunsigned := IsUnsigned(TypeOf(b.X)) || IsUnsigned(TypeOf(b.Y))\\n\\n\\tx := RValue(b.X)\\n\\ty := RValue(b.Y)\\n\\n\\tswitch b.Op {\\n\\tdefault:\\n\\t\\tw.Put(x, b.Op.String(), y)\\n\\tcase token.EQL:\\n\\t\\tw.PutJEquals(JTypeOfExpr(b.X), x, JTypeOfExpr(b.Y), y)\\n\\tcase token.LSS, token.GTR, token.LEQ, token.GEQ, token.QUO, token.REM:\\n\\t\\tif unsigned {\\n\\t\\t\\tw.PutUnsignedOp(b.X, b.Op, b.Y)\\n\\t\\t} else {\\n\\t\\t\\tw.Put(x, b.Op.String(), y) // default\\n\\t\\t}\\n\\tcase token.SHL, token.SHR, token.AND, token.OR, token.XOR:\\n\\t\\t// different precedence in Go and Java, parentisize to be sure\\n\\t\\tw.Put(\\\"(\\\", x, b.Op.String(), y, \\\")\\\")\\n\\tcase token.AND_NOT: //\\n\\t\\t// not in java\\n\\t\\tw.Put(\\\"(\\\", x, \\\"&~\\\", y, \\\")\\\")\\n\\t}\\n\\n\\tif *flagParens {\\n\\t\\tw.Put(\\\")\\\")\\n\\t}\\n}\",\n \"func (er *expressionRewriter) constructBinaryOpFunction(l expression.Expression, r expression.Expression, op string) (expression.Expression, error) {\\n\\tlLen, rLen := expression.GetRowLen(l), expression.GetRowLen(r)\\n\\tif lLen == 1 && rLen == 1 {\\n\\t\\treturn er.newFunction(op, types.NewFieldType(mysql.TypeTiny), l, r)\\n\\t} else if rLen != lLen {\\n\\t\\treturn nil, expression.ErrOperandColumns.GenWithStackByArgs(lLen)\\n\\t}\\n\\tswitch op {\\n\\tcase ast.EQ, ast.NE:\\n\\t\\tfuncs := make([]expression.Expression, lLen)\\n\\t\\tfor i := 0; i < lLen; i++ {\\n\\t\\t\\tvar err error\\n\\t\\t\\tfuncs[i], err = er.constructBinaryOpFunction(expression.GetFuncArg(l, i), expression.GetFuncArg(r, i), op)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif op == ast.NE {\\n\\t\\t\\treturn expression.ComposeDNFCondition(er.sctx, funcs...), nil\\n\\t\\t}\\n\\t\\treturn expression.ComposeCNFCondition(er.sctx, funcs...), nil\\n\\tdefault:\\n\\t\\tlarg0, rarg0 := expression.GetFuncArg(l, 0), expression.GetFuncArg(r, 0)\\n\\t\\tvar expr1, expr2, expr3, expr4, expr5 expression.Expression\\n\\t\\texpr1 = expression.NewFunctionInternal(er.sctx, ast.NE, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\\n\\t\\texpr2 = expression.NewFunctionInternal(er.sctx, op, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\\n\\t\\texpr3 = expression.NewFunctionInternal(er.sctx, ast.IsNull, types.NewFieldType(mysql.TypeTiny), expr1)\\n\\t\\tvar err error\\n\\t\\tl, err = expression.PopRowFirstArg(er.sctx, l)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tr, err = expression.PopRowFirstArg(er.sctx, r)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\texpr4, err = er.constructBinaryOpFunction(l, r, op)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\texpr5, err = er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr3, expression.Null, expr4)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr1, expr2, expr5)\\n\\t}\\n}\",\n \"func (p *parser) parseBinaryOps(ops []map[TokenType]*Operation) (Expression, hcl.Diagnostics) {\\n\\tif len(ops) == 0 {\\n\\t\\t// We've run out of operators, so now we'll just try to parse a term.\\n\\t\\treturn p.parseExpressionWithTraversals()\\n\\t}\\n\\n\\tthisLevel := ops[0]\\n\\tremaining := ops[1:]\\n\\n\\tvar lhs, rhs Expression\\n\\tvar operation *Operation\\n\\tvar diags hcl.Diagnostics\\n\\n\\t// Parse a term that might be the first operand of a binary\\n\\t// operation or it might just be a standalone term.\\n\\t// We won't know until we've parsed it and can look ahead\\n\\t// to see if there's an operator token for this level.\\n\\tlhs, lhsDiags := p.parseBinaryOps(remaining)\\n\\tdiags = append(diags, lhsDiags...)\\n\\tif p.recovery && lhsDiags.HasErrors() {\\n\\t\\treturn lhs, diags\\n\\t}\\n\\n\\t// We'll keep eating up operators until we run out, so that operators\\n\\t// with the same precedence will combine in a left-associative manner:\\n\\t// a+b+c => (a+b)+c, not a+(b+c)\\n\\t//\\n\\t// Should we later want to have right-associative operators, a way\\n\\t// to achieve that would be to call back up to ParseExpression here\\n\\t// instead of iteratively parsing only the remaining operators.\\n\\tfor {\\n\\t\\tnext := p.Peek()\\n\\t\\tvar newOp *Operation\\n\\t\\tvar ok bool\\n\\t\\tif newOp, ok = thisLevel[next.Type]; !ok {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\t// Are we extending an expression started on the previous iteration?\\n\\t\\tif operation != nil {\\n\\t\\t\\tlhs = &BinaryOpExpr{\\n\\t\\t\\t\\tLHS: lhs,\\n\\t\\t\\t\\tOp: operation,\\n\\t\\t\\t\\tRHS: rhs,\\n\\n\\t\\t\\t\\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\toperation = newOp\\n\\t\\tp.Read() // eat operator token\\n\\t\\tvar rhsDiags hcl.Diagnostics\\n\\t\\trhs, rhsDiags = p.parseBinaryOps(remaining)\\n\\t\\tdiags = append(diags, rhsDiags...)\\n\\t\\tif p.recovery && rhsDiags.HasErrors() {\\n\\t\\t\\treturn lhs, diags\\n\\t\\t}\\n\\t}\\n\\n\\tif operation == nil {\\n\\t\\treturn lhs, diags\\n\\t}\\n\\n\\treturn &BinaryOpExpr{\\n\\t\\tLHS: lhs,\\n\\t\\tOp: operation,\\n\\t\\tRHS: rhs,\\n\\n\\t\\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\\n\\t}, diags\\n}\",\n \"func (er *expressionRewriter) constructBinaryOpFunction(l expression.Expression, r expression.Expression, op string) (expression.Expression, error) {\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 33)\\n\\tlLen, rLen := expression.GetRowLen(l), expression.GetRowLen(r)\\n\\tif lLen == 1 && rLen == 1 {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 35)\\n\\t\\treturn er.newFunction(op, types.NewFieldType(mysql.TypeTiny), l, r)\\n\\t} else {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 36)\\n\\t\\tif rLen != lLen {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 37)\\n\\t\\t\\treturn nil, expression.ErrOperandColumns.GenWithStackByArgs(lLen)\\n\\t\\t}\\n\\t}\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 34)\\n\\tswitch op {\\n\\tcase ast.EQ, ast.NE, ast.NullEQ:\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 38)\\n\\t\\tfuncs := make([]expression.Expression, lLen)\\n\\t\\tfor i := 0; i < lLen; i++ {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 46)\\n\\t\\t\\tvar err error\\n\\t\\t\\tfuncs[i], err = er.constructBinaryOpFunction(expression.GetFuncArg(l, i), expression.GetFuncArg(r, i), op)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 47)\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 39)\\n\\t\\tif op == ast.NE {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 48)\\n\\t\\t\\treturn expression.ComposeDNFCondition(er.ctx, funcs...), nil\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 40)\\n\\t\\treturn expression.ComposeCNFCondition(er.ctx, funcs...), nil\\n\\tdefault:\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 41)\\n\\t\\tlarg0, rarg0 := expression.GetFuncArg(l, 0), expression.GetFuncArg(r, 0)\\n\\t\\tvar expr1, expr2, expr3, expr4, expr5 expression.Expression\\n\\t\\texpr1 = expression.NewFunctionInternal(er.ctx, ast.NE, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\\n\\t\\texpr2 = expression.NewFunctionInternal(er.ctx, op, types.NewFieldType(mysql.TypeTiny), larg0, rarg0)\\n\\t\\texpr3 = expression.NewFunctionInternal(er.ctx, ast.IsNull, types.NewFieldType(mysql.TypeTiny), expr1)\\n\\t\\tvar err error\\n\\t\\tl, err = expression.PopRowFirstArg(er.ctx, l)\\n\\t\\tif err != nil {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 49)\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 42)\\n\\t\\tr, err = expression.PopRowFirstArg(er.ctx, r)\\n\\t\\tif err != nil {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 50)\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 43)\\n\\t\\texpr4, err = er.constructBinaryOpFunction(l, r, op)\\n\\t\\tif err != nil {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 51)\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 44)\\n\\t\\texpr5, err = er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr3, expression.Null, expr4)\\n\\t\\tif err != nil {\\n\\t\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 52)\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 45)\\n\\t\\treturn er.newFunction(ast.If, types.NewFieldType(mysql.TypeTiny), expr1, expr2, expr5)\\n\\t}\\n}\",\n \"func check_bin_prim(t ast.Ast) func(*block) *block {\\n\\ta, ok := t.(ast.Apply)\\n\\tif ok {\\n\\t\\ti, ok := a.Rator.(ast.Iden)\\n\\t\\tif ok {\\n\\t\\t\\tf, ok := strict_binary_primitives[i.Val]\\n\\t\\t\\tif ok {\\n\\t\\t\\t\\treturn f\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (p *Parser) parseBitwiseExpression() Expression {\\n\\tleft := p.parseEqualityExpression()\\n\\tfor {\\n\\t\\tif op, ok := p.match(ttBitAnd, ttBitOr, ttBitXor); ok {\\n\\t\\t\\tright := p.parseEqualityExpression()\\n\\t\\t\\tleft = NewBinaryExpression(left, op.typ, right)\\n\\t\\t} else {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\treturn left\\n}\",\n \"func AsBinaryExpr(node ast.Node) *ast.BinaryExpr {\\n\\texpr, ok := node.(*ast.BinaryExpr)\\n\\tif !ok {\\n\\t\\tpanic(\\\"expected *ast.BinaryExpr\\\")\\n\\t}\\n\\treturn expr\\n}\",\n \"func evalBinaryFloatExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar err error\\n\\tvar r float64\\n\\n\\txx, yy := x.Float(), y.Float()\\n\\tswitch op {\\n\\tcase token.ADD: r = xx + yy\\n\\tcase token.SUB: r = xx - yy\\n\\tcase token.MUL: r = xx * yy\\n\\tcase token.QUO: r = xx / yy\\n\\t// case token.EQL: b = xx == yy\\n\\t// case token.LSS: b = xx < yy\\n\\t// case token.GTR: b = xx > yy\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n}\",\n \"func planLogicalProjectionOp(\\n\\tctx context.Context,\\n\\tevalCtx *tree.EvalContext,\\n\\texpr tree.TypedExpr,\\n\\tcolumnTypes []*types.T,\\n\\tinput colexecop.Operator,\\n\\tacc *mon.BoundAccount,\\n\\tfactory coldata.ColumnFactory,\\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\\n\\t// Add a new boolean column that will store the result of the projection.\\n\\tresultIdx = len(columnTypes)\\n\\ttyps = appendOneType(columnTypes, types.Bool)\\n\\tvar (\\n\\t\\ttypedLeft, typedRight tree.TypedExpr\\n\\t\\tleftProjOpChain, rightProjOpChain colexecop.Operator\\n\\t\\tleftIdx, rightIdx int\\n\\t)\\n\\tleftFeedOp := colexecop.NewFeedOperator()\\n\\trightFeedOp := colexecop.NewFeedOperator()\\n\\tswitch t := expr.(type) {\\n\\tcase *tree.AndExpr:\\n\\t\\ttypedLeft = t.TypedLeft()\\n\\t\\ttypedRight = t.TypedRight()\\n\\tcase *tree.OrExpr:\\n\\t\\ttypedLeft = t.TypedLeft()\\n\\t\\ttypedRight = t.TypedRight()\\n\\tdefault:\\n\\t\\tcolexecerror.InternalError(errors.AssertionFailedf(\\\"unexpected logical expression type %s\\\", t.String()))\\n\\t}\\n\\tleftProjOpChain, leftIdx, typs, err = planProjectionOperators(\\n\\t\\tctx, evalCtx, typedLeft, typs, leftFeedOp, acc, factory,\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn nil, resultIdx, typs, err\\n\\t}\\n\\trightProjOpChain, rightIdx, typs, err = planProjectionOperators(\\n\\t\\tctx, evalCtx, typedRight, typs, rightFeedOp, acc, factory,\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn nil, resultIdx, typs, err\\n\\t}\\n\\tallocator := colmem.NewAllocator(ctx, acc, factory)\\n\\tinput = colexecutils.NewBatchSchemaSubsetEnforcer(allocator, input, typs, resultIdx, len(typs))\\n\\tswitch expr.(type) {\\n\\tcase *tree.AndExpr:\\n\\t\\top, err = colexec.NewAndProjOp(\\n\\t\\t\\tallocator,\\n\\t\\t\\tinput, leftProjOpChain, rightProjOpChain,\\n\\t\\t\\tleftFeedOp, rightFeedOp,\\n\\t\\t\\ttyps[leftIdx], typs[rightIdx],\\n\\t\\t\\tleftIdx, rightIdx, resultIdx,\\n\\t\\t)\\n\\tcase *tree.OrExpr:\\n\\t\\top, err = colexec.NewOrProjOp(\\n\\t\\t\\tallocator,\\n\\t\\t\\tinput, leftProjOpChain, rightProjOpChain,\\n\\t\\t\\tleftFeedOp, rightFeedOp,\\n\\t\\t\\ttyps[leftIdx], typs[rightIdx],\\n\\t\\t\\tleftIdx, rightIdx, resultIdx,\\n\\t\\t)\\n\\t}\\n\\treturn op, resultIdx, typs, err\\n}\",\n \"func NewBinaryExpression(left Expression, op TokenType, right Expression) *BinaryExpression {\\n\\treturn &BinaryExpression{\\n\\t\\tleft: left,\\n\\t\\top: op,\\n\\t\\tright: right,\\n\\t}\\n}\",\n \"func planProjectionOperators(\\n\\tctx context.Context,\\n\\tevalCtx *tree.EvalContext,\\n\\texpr tree.TypedExpr,\\n\\tcolumnTypes []*types.T,\\n\\tinput colexecop.Operator,\\n\\tacc *mon.BoundAccount,\\n\\tfactory coldata.ColumnFactory,\\n) (op colexecop.Operator, resultIdx int, typs []*types.T, err error) {\\n\\t// projectDatum is a helper function that adds a new constant projection\\n\\t// operator for the given datum. typs are updated accordingly.\\n\\tprojectDatum := func(datum tree.Datum) (colexecop.Operator, error) {\\n\\t\\tresultIdx = len(columnTypes)\\n\\t\\tdatumType := datum.ResolvedType()\\n\\t\\ttyps = appendOneType(columnTypes, datumType)\\n\\t\\tif datumType.Family() == types.UnknownFamily {\\n\\t\\t\\t// We handle Unknown type by planning a special constant null\\n\\t\\t\\t// operator.\\n\\t\\t\\treturn colexecbase.NewConstNullOp(colmem.NewAllocator(ctx, acc, factory), input, resultIdx), nil\\n\\t\\t}\\n\\t\\tconstVal := colconv.GetDatumToPhysicalFn(datumType)(datum)\\n\\t\\treturn colexecbase.NewConstOp(colmem.NewAllocator(ctx, acc, factory), input, datumType, constVal, resultIdx)\\n\\t}\\n\\tresultIdx = -1\\n\\tswitch t := expr.(type) {\\n\\tcase *tree.IndexedVar:\\n\\t\\treturn input, t.Idx, columnTypes, nil\\n\\tcase *tree.ComparisonExpr:\\n\\t\\treturn planProjectionExpr(\\n\\t\\t\\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\\n\\t\\t\\tcolumnTypes, input, acc, factory, nil /* binFn */, t,\\n\\t\\t)\\n\\tcase *tree.BinaryExpr:\\n\\t\\tif err = checkSupportedBinaryExpr(t.TypedLeft(), t.TypedRight(), t.ResolvedType()); err != nil {\\n\\t\\t\\treturn op, resultIdx, typs, err\\n\\t\\t}\\n\\t\\treturn planProjectionExpr(\\n\\t\\t\\tctx, evalCtx, t.Operator, t.ResolvedType(), t.TypedLeft(), t.TypedRight(),\\n\\t\\t\\tcolumnTypes, input, acc, factory, t.Fn.Fn, nil, /* cmpExpr */\\n\\t\\t)\\n\\tcase *tree.IsNullExpr:\\n\\t\\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, false /* negate */, factory)\\n\\tcase *tree.IsNotNullExpr:\\n\\t\\treturn planIsNullProjectionOp(ctx, evalCtx, t.ResolvedType(), t.TypedInnerExpr(), columnTypes, input, acc, true /* negate */, factory)\\n\\tcase *tree.CastExpr:\\n\\t\\texpr := t.Expr.(tree.TypedExpr)\\n\\t\\top, resultIdx, typs, err = planProjectionOperators(\\n\\t\\t\\tctx, evalCtx, expr, columnTypes, input, acc, factory,\\n\\t\\t)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, 0, nil, err\\n\\t\\t}\\n\\t\\top, resultIdx, typs, err = planCastOperator(ctx, acc, typs, op, resultIdx, expr.ResolvedType(), t.ResolvedType(), factory)\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase *tree.FuncExpr:\\n\\t\\tvar inputCols []int\\n\\t\\ttyps = make([]*types.T, len(columnTypes))\\n\\t\\tcopy(typs, columnTypes)\\n\\t\\top = input\\n\\t\\tfor _, e := range t.Exprs {\\n\\t\\t\\tvar err error\\n\\t\\t\\t// TODO(rohany): This could be done better, especially in the case\\n\\t\\t\\t// of constant arguments, because the vectorized engine right now\\n\\t\\t\\t// creates a new column full of the constant value.\\n\\t\\t\\top, resultIdx, typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, e.(tree.TypedExpr), typs, op, acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, nil, err\\n\\t\\t\\t}\\n\\t\\t\\tinputCols = append(inputCols, resultIdx)\\n\\t\\t}\\n\\t\\tresultIdx = len(typs)\\n\\t\\top, err = colexec.NewBuiltinFunctionOperator(\\n\\t\\t\\tcolmem.NewAllocator(ctx, acc, factory), evalCtx, t, typs, inputCols, resultIdx, op,\\n\\t\\t)\\n\\t\\ttyps = appendOneType(typs, t.ResolvedType())\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase tree.Datum:\\n\\t\\top, err = projectDatum(t)\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase *tree.Tuple:\\n\\t\\tisConstTuple := true\\n\\t\\tfor _, expr := range t.Exprs {\\n\\t\\t\\tif _, isDatum := expr.(tree.Datum); !isDatum {\\n\\t\\t\\t\\tisConstTuple = false\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif isConstTuple {\\n\\t\\t\\t// Tuple expression is a constant, so we can evaluate it and\\n\\t\\t\\t// project the resulting datum.\\n\\t\\t\\ttuple, err := t.Eval(evalCtx)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t\\top, err = projectDatum(tuple)\\n\\t\\t\\treturn op, resultIdx, typs, err\\n\\t\\t}\\n\\t\\toutputType := t.ResolvedType()\\n\\t\\ttyps = make([]*types.T, len(columnTypes))\\n\\t\\tcopy(typs, columnTypes)\\n\\t\\ttupleContentsIdxs := make([]int, len(t.Exprs))\\n\\t\\tfor i, expr := range t.Exprs {\\n\\t\\t\\tinput, tupleContentsIdxs[i], typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, expr.(tree.TypedExpr), typs, input, acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tresultIdx = len(typs)\\n\\t\\top = colexec.NewTupleProjOp(\\n\\t\\t\\tcolmem.NewAllocator(ctx, acc, factory), typs, tupleContentsIdxs, outputType, input, resultIdx,\\n\\t\\t)\\n\\t\\ttyps = appendOneType(typs, outputType)\\n\\t\\treturn op, resultIdx, typs, err\\n\\tcase *tree.CaseExpr:\\n\\t\\tif t.Expr != nil {\\n\\t\\t\\treturn nil, resultIdx, typs, errors.New(\\\"CASE <expr> WHEN expressions unsupported\\\")\\n\\t\\t}\\n\\n\\t\\tallocator := colmem.NewAllocator(ctx, acc, factory)\\n\\t\\tcaseOutputType := t.ResolvedType()\\n\\t\\tif typeconv.TypeFamilyToCanonicalTypeFamily(caseOutputType.Family()) == types.BytesFamily {\\n\\t\\t\\t// Currently, there is a contradiction between the way CASE operator\\n\\t\\t\\t// works (which populates its output in arbitrary order) and the\\n\\t\\t\\t// flat bytes implementation of Bytes type (which prohibits sets in\\n\\t\\t\\t// arbitrary order), so we reject such scenario to fall back to\\n\\t\\t\\t// row-by-row engine.\\n\\t\\t\\treturn nil, resultIdx, typs, errors.Newf(\\n\\t\\t\\t\\t\\\"unsupported type %s in CASE operator\\\", caseOutputType)\\n\\t\\t}\\n\\t\\tcaseOutputIdx := len(columnTypes)\\n\\t\\t// We don't know the schema yet and will update it below, right before\\n\\t\\t// instantiating caseOp. The same goes for subsetEndIdx.\\n\\t\\tschemaEnforcer := colexecutils.NewBatchSchemaSubsetEnforcer(\\n\\t\\t\\tallocator, input, nil /* typs */, caseOutputIdx, -1, /* subsetEndIdx */\\n\\t\\t)\\n\\t\\tbuffer := colexec.NewBufferOp(schemaEnforcer)\\n\\t\\tcaseOps := make([]colexecop.Operator, len(t.Whens))\\n\\t\\ttyps = appendOneType(columnTypes, caseOutputType)\\n\\t\\tthenIdxs := make([]int, len(t.Whens)+1)\\n\\t\\tfor i, when := range t.Whens {\\n\\t\\t\\t// The case operator is assembled from n WHEN arms, n THEN arms, and\\n\\t\\t\\t// an ELSE arm. Each WHEN arm is a boolean projection. Each THEN arm\\n\\t\\t\\t// (and the ELSE arm) is a projection of the type of the CASE\\n\\t\\t\\t// expression. We set up each WHEN arm to write its output to a\\n\\t\\t\\t// fresh column, and likewise for the THEN arms and the ELSE arm.\\n\\t\\t\\t// Each WHEN arm individually acts on the single input batch from\\n\\t\\t\\t// the CaseExpr's input and is then transformed into a selection\\n\\t\\t\\t// vector, after which the THEN arm runs to create the output just\\n\\t\\t\\t// for the tuples that matched the WHEN arm. Each subsequent WHEN\\n\\t\\t\\t// arm will use the inverse of the selection vector to avoid running\\n\\t\\t\\t// the WHEN projection on tuples that have already been matched by a\\n\\t\\t\\t// previous WHEN arm. Finally, after each WHEN arm runs, we copy the\\n\\t\\t\\t// results of the WHEN into a single output vector, assembling the\\n\\t\\t\\t// final result of the case projection.\\n\\t\\t\\twhenTyped := when.Cond.(tree.TypedExpr)\\n\\t\\t\\tcaseOps[i], resultIdx, typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, whenTyped, typs, buffer, acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t\\tcaseOps[i], err = colexecutils.BoolOrUnknownToSelOp(caseOps[i], typs, resultIdx)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Run the \\\"then\\\" clause on those tuples that were selected.\\n\\t\\t\\tcaseOps[i], thenIdxs[i], typs, err = planProjectionOperators(\\n\\t\\t\\t\\tctx, evalCtx, when.Val.(tree.TypedExpr), typs, caseOps[i], acc, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t\\tif !typs[thenIdxs[i]].Identical(typs[caseOutputIdx]) {\\n\\t\\t\\t\\t// It is possible that the projection of this THEN arm has\\n\\t\\t\\t\\t// different column type (for example, we expect INT2, but INT8\\n\\t\\t\\t\\t// is given). In such case, we need to plan a cast.\\n\\t\\t\\t\\tfromType, toType := typs[thenIdxs[i]], typs[caseOutputIdx]\\n\\t\\t\\t\\tcaseOps[i], thenIdxs[i], typs, err = planCastOperator(\\n\\t\\t\\t\\t\\tctx, acc, typs, caseOps[i], thenIdxs[i], fromType, toType, factory,\\n\\t\\t\\t\\t)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvar elseOp colexecop.Operator\\n\\t\\telseExpr := t.Else\\n\\t\\tif elseExpr == nil {\\n\\t\\t\\t// If there's no ELSE arm, we write NULLs.\\n\\t\\t\\telseExpr = tree.DNull\\n\\t\\t}\\n\\t\\telseOp, thenIdxs[len(t.Whens)], typs, err = planProjectionOperators(\\n\\t\\t\\tctx, evalCtx, elseExpr.(tree.TypedExpr), typs, buffer, acc, factory,\\n\\t\\t)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t}\\n\\t\\tif !typs[thenIdxs[len(t.Whens)]].Identical(typs[caseOutputIdx]) {\\n\\t\\t\\t// It is possible that the projection of the ELSE arm has different\\n\\t\\t\\t// column type (for example, we expect INT2, but INT8 is given). In\\n\\t\\t\\t// such case, we need to plan a cast.\\n\\t\\t\\telseIdx := thenIdxs[len(t.Whens)]\\n\\t\\t\\tfromType, toType := typs[elseIdx], typs[caseOutputIdx]\\n\\t\\t\\telseOp, thenIdxs[len(t.Whens)], typs, err = planCastOperator(\\n\\t\\t\\t\\tctx, acc, typs, elseOp, elseIdx, fromType, toType, factory,\\n\\t\\t\\t)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, resultIdx, typs, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tschemaEnforcer.SetTypes(typs)\\n\\t\\top := colexec.NewCaseOp(allocator, buffer, caseOps, elseOp, thenIdxs, caseOutputIdx, caseOutputType)\\n\\t\\treturn op, caseOutputIdx, typs, err\\n\\tcase *tree.AndExpr, *tree.OrExpr:\\n\\t\\treturn planLogicalProjectionOp(ctx, evalCtx, expr, columnTypes, input, acc, factory)\\n\\tdefault:\\n\\t\\treturn nil, resultIdx, nil, errors.Errorf(\\\"unhandled projection expression type: %s\\\", reflect.TypeOf(t))\\n\\t}\\n}\",\n \"func ToBinaryExpr(x ast.Node) *ast.BinaryExpr {\\n\\tif x, ok := x.(*ast.BinaryExpr); ok {\\n\\t\\treturn x\\n\\t}\\n\\treturn NilBinaryExpr\\n}\",\n \"func (expr *BinaryExpr) String() string {\\n\\tswitch expr.Op {\\n\\tcase PLUS:\\n\\t\\treturn expr.X.String() + \\\" + \\\" + expr.Y.String()\\n\\tcase MINUS:\\n\\t\\treturn expr.X.String() + \\\" - \\\" + expr.Y.String()\\n\\tcase STAR:\\n\\t\\treturn expr.X.String() + \\\" * \\\" + expr.Y.String()\\n\\tcase SLASH:\\n\\t\\treturn expr.X.String() + \\\" / \\\" + expr.Y.String()\\n\\tcase REM:\\n\\t\\treturn expr.X.String() + \\\" % \\\" + expr.Y.String()\\n\\tcase CONCAT:\\n\\t\\treturn expr.X.String() + \\\" || \\\" + expr.Y.String()\\n\\tcase BETWEEN:\\n\\t\\treturn expr.X.String() + \\\" BETWEEN \\\" + expr.Y.String()\\n\\tcase NOTBETWEEN:\\n\\t\\treturn expr.X.String() + \\\" NOT BETWEEN \\\" + expr.Y.String()\\n\\tcase LSHIFT:\\n\\t\\treturn expr.X.String() + \\\" << \\\" + expr.Y.String()\\n\\tcase RSHIFT:\\n\\t\\treturn expr.X.String() + \\\" >> \\\" + expr.Y.String()\\n\\tcase BITAND:\\n\\t\\treturn expr.X.String() + \\\" & \\\" + expr.Y.String()\\n\\tcase BITOR:\\n\\t\\treturn expr.X.String() + \\\" | \\\" + expr.Y.String()\\n\\tcase LT:\\n\\t\\treturn expr.X.String() + \\\" < \\\" + expr.Y.String()\\n\\tcase LE:\\n\\t\\treturn expr.X.String() + \\\" <= \\\" + expr.Y.String()\\n\\tcase GT:\\n\\t\\treturn expr.X.String() + \\\" > \\\" + expr.Y.String()\\n\\tcase GE:\\n\\t\\treturn expr.X.String() + \\\" >= \\\" + expr.Y.String()\\n\\tcase EQ:\\n\\t\\treturn expr.X.String() + \\\" = \\\" + expr.Y.String()\\n\\tcase NE:\\n\\t\\treturn expr.X.String() + \\\" != \\\" + expr.Y.String()\\n\\tcase IS:\\n\\t\\treturn expr.X.String() + \\\" IS \\\" + expr.Y.String()\\n\\tcase ISNOT:\\n\\t\\treturn expr.X.String() + \\\" IS NOT \\\" + expr.Y.String()\\n\\tcase IN:\\n\\t\\treturn expr.X.String() + \\\" IN \\\" + expr.Y.String()\\n\\tcase NOTIN:\\n\\t\\treturn expr.X.String() + \\\" NOT IN \\\" + expr.Y.String()\\n\\tcase LIKE:\\n\\t\\treturn expr.X.String() + \\\" LIKE \\\" + expr.Y.String()\\n\\tcase NOTLIKE:\\n\\t\\treturn expr.X.String() + \\\" NOT LIKE \\\" + expr.Y.String()\\n\\tcase GLOB:\\n\\t\\treturn expr.X.String() + \\\" GLOB \\\" + expr.Y.String()\\n\\tcase NOTGLOB:\\n\\t\\treturn expr.X.String() + \\\" NOT GLOB \\\" + expr.Y.String()\\n\\tcase MATCH:\\n\\t\\treturn expr.X.String() + \\\" MATCH \\\" + expr.Y.String()\\n\\tcase NOTMATCH:\\n\\t\\treturn expr.X.String() + \\\" NOT MATCH \\\" + expr.Y.String()\\n\\tcase REGEXP:\\n\\t\\treturn expr.X.String() + \\\" REGEXP \\\" + expr.Y.String()\\n\\tcase NOTREGEXP:\\n\\t\\treturn expr.X.String() + \\\" NOT REGEXP \\\" + expr.Y.String()\\n\\tcase AND:\\n\\t\\treturn expr.X.String() + \\\" AND \\\" + expr.Y.String()\\n\\tcase OR:\\n\\t\\treturn expr.X.String() + \\\" OR \\\" + expr.Y.String()\\n\\tdefault:\\n\\t\\tpanic(fmt.Sprintf(\\\"sql.BinaryExpr.String(): invalid op %s\\\", expr.Op))\\n\\t}\\n}\",\n \"func (p *ExecutionPlanner) compileExpr(expr parser.Expr) (_ types.PlanExpression, err error) {\\n\\tif expr == nil {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\tswitch expr := expr.(type) {\\n\\tcase *parser.BinaryExpr:\\n\\t\\treturn p.compileBinaryExpr(expr)\\n\\n\\tcase *parser.BoolLit:\\n\\t\\treturn newBoolLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.Call:\\n\\t\\treturn p.compileCallExpr(expr)\\n\\n\\tcase *parser.CastExpr:\\n\\t\\tcastExpr, err := p.compileExpr(expr.X)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tdataType, err := dataTypeFromParserType(expr.Type)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newCastPlanExpression(castExpr, dataType), nil\\n\\n\\tcase *parser.Exists:\\n\\t\\treturn nil, sql3.NewErrInternal(\\\"exists expressions are not supported\\\")\\n\\n\\tcase *parser.ExprList:\\n\\t\\texprList := []types.PlanExpression{}\\n\\t\\tfor _, e := range expr.Exprs {\\n\\t\\t\\tlistExpr, err := p.compileExpr(e)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\texprList = append(exprList, listExpr)\\n\\t\\t}\\n\\t\\treturn newExprListExpression(exprList), nil\\n\\n\\tcase *parser.SetLiteralExpr:\\n\\t\\texprList := []types.PlanExpression{}\\n\\t\\tfor _, e := range expr.Members {\\n\\t\\t\\tlistExpr, err := p.compileExpr(e)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\texprList = append(exprList, listExpr)\\n\\t\\t}\\n\\t\\treturn newExprSetLiteralPlanExpression(exprList, expr.DataType()), nil\\n\\n\\tcase *parser.TupleLiteralExpr:\\n\\t\\texprList := []types.PlanExpression{}\\n\\t\\tfor _, e := range expr.Members {\\n\\t\\t\\tlistExpr, err := p.compileExpr(e)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\texprList = append(exprList, listExpr)\\n\\t\\t}\\n\\t\\treturn newExprTupleLiteralPlanExpression(exprList, expr.DataType()), nil\\n\\n\\tcase *parser.Ident:\\n\\t\\treturn nil, sql3.NewErrInternal(\\\"identifiers are not supported\\\")\\n\\n\\tcase *parser.NullLit:\\n\\t\\treturn newNullLiteralPlanExpression(), nil\\n\\n\\tcase *parser.IntegerLit:\\n\\t\\treturn newIntLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.FloatLit:\\n\\t\\treturn newFloatLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.DateLit:\\n\\t\\treturn newDateLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.ParenExpr:\\n\\t\\treturn p.compileExpr(expr.X)\\n\\n\\tcase *parser.QualifiedRef:\\n\\t\\tref := newQualifiedRefPlanExpression(parser.IdentName(expr.Table), parser.IdentName(expr.Column), expr.ColumnIndex, expr.DataType())\\n\\t\\tp.addReference(ref)\\n\\t\\treturn ref, nil\\n\\n\\tcase *parser.Range:\\n\\t\\tlhs, err := p.compileExpr(expr.X)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\trhs, err := p.compileExpr(expr.Y)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newRangeOpPlanExpression(lhs, rhs, expr.ResultDataType), nil\\n\\n\\tcase *parser.StringLit:\\n\\t\\treturn newStringLiteralPlanExpression(expr.Value), nil\\n\\n\\tcase *parser.UnaryExpr:\\n\\t\\treturn p.compileUnaryExpr(expr)\\n\\n\\tcase *parser.CaseExpr:\\n\\t\\toperand, err := p.compileExpr(expr.Operand)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tblocks := []types.PlanExpression{}\\n\\t\\tfor _, b := range expr.Blocks {\\n\\t\\t\\tblock, err := p.compileExpr(b)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tblocks = append(blocks, block)\\n\\t\\t}\\n\\n\\t\\telseExpr, err := p.compileExpr(expr.ElseExpr)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newCasePlanExpression(operand, blocks, elseExpr, expr.DataType()), nil\\n\\n\\tcase *parser.CaseBlock:\\n\\n\\t\\tcondition, err := p.compileExpr(expr.Condition)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tbody, err := p.compileExpr(expr.Body)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newCaseBlockPlanExpression(condition, body), nil\\n\\n\\tcase *parser.SelectStatement:\\n\\t\\tselOp, err := p.compileSelectStatement(expr, true)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\treturn newSubqueryPlanExpression(selOp), nil\\n\\n\\tdefault:\\n\\t\\treturn nil, sql3.NewErrInternalf(\\\"unexpected SQL expression type: %T\\\", expr)\\n\\t}\\n}\",\n \"func (e *binaryExprEvaluator) start() {\\n\\te.lhs.start()\\n\\te.rhs.start()\\n\\tgo e.run()\\n}\",\n \"func chopBinary(expr string) (left, op, right string, ok bool) {\\n\\t// XXX implementation redacted for CHALLENGE1.\\n\\t// TODO restore implementation and replace '__'\\n\\tparts := strings.Split(expr, \\\"__\\\")\\n\\tif len(parts) != 3 {\\n\\t\\treturn\\n\\t}\\n\\tleft = parts[0]\\n\\top = parts[1]\\n\\tright = parts[2]\\n\\tok = true\\n\\treturn\\n}\",\n \"func performBinOp(optr string, oprnd1 string, oprnd2 string) string {\\n\\n\\t//Connect to server (TESTING)\\n\\tclient, _ := redis.Dial(&redis.DialConfig{Address: \\\"127.0.0.1:6379\\\"})\\n\\n\\tlog.Println(\\\"Evaluating: \\\", oprnd1, \\\" \\\", optr, \\\" \\\", oprnd2)\\n\\n\\ti1, n1 := buildIndex(oprnd1)\\n\\ti2, n2 := buildIndex(oprnd2)\\n\\n\\t//Verify the existence of both indices, log fatal if not exists\\n\\ti1exists, _ := client.Exists(i1)\\n\\ti2exists, _ := client.Exists(i2)\\n\\n\\tif !i1exists {\\n\\t\\tlog.Fatal(\\\"KEY DOES NOT EXIST: \\\", i1)\\n\\t}\\n\\tif !i2exists {\\n\\t\\tlog.Fatal(\\\"KEY DOES NOT EXIST: \\\", i2)\\n\\t}\\n\\n\\t//If the first operand is negated, create a temporary (virtual) idnex\\n\\tif n1 {\\n\\t\\tclient.BitOp(\\\"NOT:\\\" + i1, i1)\\n\\t\\ti1 = \\\"NOT:\\\" + i1\\n\\t}\\n\\t//If the second operand is negated, create a temporary (virtual) idnex\\n\\tif n2 {\\n\\t\\tclient.BitOp(\\\"NOT:\\\" + i2, i2)\\n\\t\\ti2 = \\\"NOT:\\\" + i2\\n\\t}\\n\\n\\t//Perform the operation\\n\\tclient.BitOp(optr, i1 + optr + i2, i1, i2)\\n\\n\\tlog.Println(\\\"('\\\" + i1 + optr + i2 + \\\"')\\\")\\n\\treturn \\\"('\\\" + i1 + optr + i2 + \\\"')\\\"\\n}\",\n \"func Binary(sc trace.SpanContext) []byte {\\n\\tif sc == (trace.SpanContext{}) {\\n\\t\\treturn nil\\n\\t}\\n\\tvar b [29]byte\\n\\tcopy(b[2:18], sc.TraceID[:])\\n\\tb[18] = 1\\n\\tcopy(b[19:27], sc.SpanID[:])\\n\\tb[27] = 2\\n\\tb[28] = uint8(sc.TraceOptions)\\n\\treturn b[:]\\n}\",\n \"func _binaryArith(i Instruction, ls *LuaState, op ArithOp) {\\n\\ta, b, c := i.ABC()\\n\\ta += 1\\n\\n\\tls.getRK(b)\\n\\tls.getRK(c)\\n\\tluaArith(ls, op)\\n\\tluaReplace(ls, a)\\n}\",\n \"func PAND(mx, x operand.Op) { ctx.PAND(mx, x) }\",\n \"func (b *BinaryExpr) Evaluate(env ExpressionEnv) (EvalResult, error) {\\n\\tlVal, err := b.Left.Evaluate(env)\\n\\tif err != nil {\\n\\t\\treturn EvalResult{}, err\\n\\t}\\n\\trVal, err := b.Right.Evaluate(env)\\n\\tif err != nil {\\n\\t\\treturn EvalResult{}, err\\n\\t}\\n\\treturn b.Op.Evaluate(lVal, rVal)\\n}\",\n \"func binaryEval(binaryOp stmt.BinaryOP, left, right *collections.FloatArray) *collections.FloatArray {\\n\\tif left == nil || right == nil {\\n\\t\\treturn nil\\n\\t}\\n\\tif left.IsEmpty() && right.IsEmpty() {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tcapacity := left.Capacity()\\n\\tresult := collections.NewFloatArray(capacity)\\n\\n\\tfor i := 0; i < capacity; i++ {\\n\\t\\tleftHasValue := left.HasValue(i)\\n\\t\\trightHasValue := right.HasValue(i)\\n\\t\\tswitch {\\n\\t\\tcase !leftHasValue && right.IsSingle():\\n\\t\\tcase left.IsSingle() && !rightHasValue:\\n\\t\\tcase leftHasValue || rightHasValue:\\n\\t\\t\\tresult.SetValue(i, eval(binaryOp, left.GetValue(i), right.GetValue(i)))\\n\\t\\t}\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func PMINSB(mx, x operand.Op) { ctx.PMINSB(mx, x) }\",\n \"func TestCheckBinaryExprComplexAndComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i & 8.0i`, env,\\n\\t\\t`illegal constant expression: untyped number & untyped number`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprComplexAndInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i & 4`, env,\\n\\t\\t`illegal constant expression: untyped number & untyped number`,\\n\\t)\\n\\n}\",\n \"func VPBROADCASTW(ops ...operand.Op) { ctx.VPBROADCASTW(ops...) }\",\n \"func reduceBinOp(op string, left, right *LiteralExpr) *LiteralExpr {\\n\\tmerged := mergeBinOp(\\n\\t\\top,\\n\\t\\t&promql.Sample{Point: promql.Point{V: left.value}},\\n\\t\\t&promql.Sample{Point: promql.Point{V: right.value}},\\n\\t\\tfalse,\\n\\t\\tfalse,\\n\\t)\\n\\treturn &LiteralExpr{value: merged.V}\\n}\",\n \"func TestCheckBinaryExprComplexAndBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i & true`, env,\\n\\t\\t`cannot convert true to type complex128`,\\n\\t\\t`invalid operation: 8i & true (mismatched types complex128 and bool)`,\\n\\t)\\n\\n}\",\n \"func generate(op string) {\\n\\tswitch op {\\n\\tcase \\\"and\\\":\\n\\t\\tTEXT(\\\"And\\\", NOSPLIT, \\\"func(a []uint64, b []uint64)\\\")\\n\\t\\tDoc(\\\"And And computes the intersection between two slices and stores the result in the first one\\\")\\n\\tcase \\\"or\\\":\\n\\t\\tTEXT(\\\"Or\\\", NOSPLIT, \\\"func(a []uint64, b []uint64)\\\")\\n\\t\\tDoc(\\\"Or computes the union between two slices and stores the result in the first one\\\")\\n\\tcase \\\"andnot\\\":\\n\\t\\tTEXT(\\\"AndNot\\\", NOSPLIT, \\\"func(a []uint64, b []uint64)\\\")\\n\\t\\tDoc(\\\"AndNot computes the difference between two slices and stores the result in the first one\\\")\\n\\tcase \\\"xor\\\":\\n\\t\\tTEXT(\\\"Xor\\\", NOSPLIT, \\\"func(a []uint64, b []uint64)\\\")\\n\\t\\tDoc(\\\"Xor computes the symmetric difference between two slices and stores the result in the first one\\\")\\n\\t}\\n\\n\\t// Load the a and b addresses as well as the current len(a). Assume len(a) == len(b)\\n\\ta := Mem{Base: Load(Param(\\\"a\\\").Base(), GP64())}\\n\\tb := Mem{Base: Load(Param(\\\"b\\\").Base(), GP64())}\\n\\tn := Load(Param(\\\"a\\\").Len(), GP64())\\n\\n\\t// The register for the tail, we xor it with itself to zero out\\n\\ts := GP64()\\n\\tXORQ(s, s)\\n\\n\\tconst size, unroll = 32, 2 // bytes (256bit * 2)\\n\\tconst blocksize = size * unroll\\n\\n\\tCommentf(\\\"perform vectorized operation for every block of %v bits\\\", blocksize*8)\\n\\tLabel(\\\"body\\\")\\n\\tCMPQ(n, U32(4*unroll))\\n\\tJL(LabelRef(\\\"tail\\\"))\\n\\n\\t// Create a vector\\n\\tvector := make([]VecVirtual, unroll)\\n\\tfor i := 0; i < unroll; i++ {\\n\\t\\tvector[i] = YMM()\\n\\t}\\n\\n\\t// Move memory vector into position\\n\\tCommentf(\\\"perform the logical \\\\\\\"%v\\\\\\\" operation\\\", strings.ToUpper(op))\\n\\tfor i := 0; i < unroll; i++ {\\n\\t\\tVMOVUPD(b.Offset(size*i), vector[i])\\n\\t}\\n\\n\\t// Perform the actual operation\\n\\tfor i := 0; i < unroll; i++ {\\n\\t\\tswitch op {\\n\\t\\tcase \\\"and\\\":\\n\\t\\t\\tVPAND(a.Offset(size*i), vector[i], vector[i])\\n\\t\\tcase \\\"or\\\":\\n\\t\\t\\tVPOR(a.Offset(size*i), vector[i], vector[i])\\n\\t\\tcase \\\"andnot\\\":\\n\\t\\t\\tVPANDN(a.Offset(size*i), vector[i], vector[i])\\n\\t\\tcase \\\"xor\\\":\\n\\t\\t\\tVPXOR(a.Offset(size*i), vector[i], vector[i])\\n\\t\\t}\\n\\t}\\n\\n\\t// Move the result to \\\"a\\\" by copying the vector\\n\\tfor i := 0; i < unroll; i++ {\\n\\t\\tVMOVUPD(vector[i], a.Offset(size*i))\\n\\t}\\n\\n\\t// Continue the iteration\\n\\tComment(\\\"continue the interation by moving read pointers\\\")\\n\\tADDQ(U32(blocksize), a.Base)\\n\\tADDQ(U32(blocksize), b.Base)\\n\\tSUBQ(U32(4*unroll), n)\\n\\tJMP(LabelRef(\\\"body\\\"))\\n\\n\\t// Now, we only have less than 512 bits left, use normal scalar operation\\n\\tLabel(\\\"tail\\\")\\n\\tCMPQ(n, Imm(0))\\n\\tJE(LabelRef(\\\"done\\\"))\\n\\n\\t// Perform the actual operation\\n\\tCommentf(\\\"perform the logical \\\\\\\"%v\\\\\\\" operation\\\", strings.ToUpper(op))\\n\\tMOVQ(Mem{Base: b.Base}, s)\\n\\tswitch op {\\n\\tcase \\\"and\\\":\\n\\t\\tANDQ(Mem{Base: a.Base}, s)\\n\\tcase \\\"or\\\":\\n\\t\\tORQ(Mem{Base: a.Base}, s)\\n\\tcase \\\"andnot\\\":\\n\\t\\tANDNQ(Mem{Base: a.Base}, s, s)\\n\\tcase \\\"xor\\\":\\n\\t\\tXORQ(Mem{Base: a.Base}, s)\\n\\t}\\n\\tMOVQ(s, Mem{Base: a.Base})\\n\\n\\t// Continue the iteration\\n\\tComment(\\\"continue the interation by moving read pointers\\\")\\n\\tADDQ(U32(8), a.Base)\\n\\tADDQ(U32(8), b.Base)\\n\\tSUBQ(U32(1), n)\\n\\tJMP(LabelRef(\\\"tail\\\"))\\n\\n\\tLabel(\\\"done\\\")\\n\\tRET()\\n}\",\n \"func ANDPS(mx, x operand.Op) { ctx.ANDPS(mx, x) }\",\n \"func TestCheckBinaryExprBoolAndComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true & 8.0i`, env,\\n\\t\\t`cannot convert 8i to type bool`,\\n\\t\\t`invalid operation: true & 8i (mismatched types bool and complex128)`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprBoolAddComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true + 8.0i`, env,\\n\\t\\t`cannot convert 8i to type bool`,\\n\\t\\t`invalid operation: true + 8i (mismatched types bool and complex128)`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprIntAddBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `4 + true`, env,\\n\\t\\t`cannot convert true to type int`,\\n\\t\\t`invalid operation: 4 + true (mismatched types int and bool)`,\\n\\t)\\n\\n}\",\n \"func binaryOperation(operation string, a, b NumberArray) (resultingMatrix NumberArray, err error) {\\n\\tvar mathFunc binaryMathFunc\\n\\tswitch operation {\\n\\tcase \\\"Add\\\":\\n\\t\\tmathFunc = add\\n\\tcase \\\"Substract\\\":\\n\\t\\tmathFunc = substract\\n\\tcase \\\"MultiplyElementwise\\\":\\n\\t\\tmathFunc = multiply\\n\\tdefault:\\n\\t\\treturn resultingMatrix, fmt.Errorf(\\\"Can't handle the given operation:\\\"+\\n\\t\\t\\t\\\" %v\\\\n\\\", operation)\\n\\t}\\n\\tif !EqualDimensions(a, b) {\\n\\t\\treturn resultingMatrix, fmt.Errorf(\\\"Can't perform \\\" + operation + \\\" on\\\" +\\n\\t\\t\\t\\\" matrices of different dimensions\\\")\\n\\t}\\n\\tresultingMatrix, _ = NewMatrix(a.GetRows(), a.GetColumns())\\n\\tfor i := 0; i < a.GetRows(); i++ {\\n\\t\\tfor j := 0; j < a.GetColumns(); j++ {\\n\\t\\t\\toperandA, _ := a.GetValue(i, j)\\n\\t\\t\\toperandB, _ := b.GetValue(i, j)\\n\\t\\t\\tresultingMatrix.SetValue(i, j, mathFunc(operandA, operandB))\\n\\t\\t}\\n\\t}\\n\\treturn resultingMatrix, err\\n}\",\n \"func composeConditionWithBinaryOp(ctx sessionctx.Context, conditions []Expression, funcName string) Expression {\\n\\tlength := len(conditions)\\n\\tif length == 0 {\\n\\t\\treturn nil\\n\\t}\\n\\tif length == 1 {\\n\\t\\treturn conditions[0]\\n\\t}\\n\\texpr := NewFunctionInternal(ctx, funcName,\\n\\t\\ttypes.NewFieldType(mysql.TypeTiny),\\n\\t\\tcomposeConditionWithBinaryOp(ctx, conditions[:length/2], funcName),\\n\\t\\tcomposeConditionWithBinaryOp(ctx, conditions[length/2:], funcName))\\n\\treturn expr\\n}\",\n \"func TestCheckBinaryExprBoolAddInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true + 4`, env,\\n\\t\\t`cannot convert 4 to type bool`,\\n\\t\\t`invalid operation: true + 4 (mismatched types bool and int)`,\\n\\t)\\n\\n}\",\n \"func ANDPD(mx, x operand.Op) { ctx.ANDPD(mx, x) }\",\n \"func ANDNPS(mx, x operand.Op) { ctx.ANDNPS(mx, x) }\",\n \"func PANDN(mx, x operand.Op) { ctx.PANDN(mx, x) }\",\n \"func (s *BaseSyslParserListener) EnterExpr_bitand(ctx *Expr_bitandContext) {}\",\n \"func TestCheckBinaryExprIntAndBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `4 & true`, env,\\n\\t\\t`cannot convert true to type int`,\\n\\t\\t`invalid operation: 4 & true (mismatched types int and bool)`,\\n\\t)\\n\\n}\",\n \"func (s *BasePlSqlParserListener) EnterUnary_logical_expression(ctx *Unary_logical_expressionContext) {\\n}\",\n \"func Binary(subtype byte, data []byte) Val {\\n\\treturn Val{t: bsontype.Binary, primitive: primitive.Binary{Subtype: subtype, Data: data}}\\n}\",\n \"func TestCheckBinaryExprBoolAddBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true + true`, env,\\n\\t\\t`invalid operation: true + true (operator + not defined on bool)`,\\n\\t)\\n\\n}\",\n \"func BitwiseAnd(a, b Expr) Expr {\\n\\treturn &arithmeticOperator{&simpleOperator{a, b, scanner.BITWISEAND}}\\n}\",\n \"func EqualsRefOfBinaryExpr(a, b *BinaryExpr) bool {\\n\\tif a == b {\\n\\t\\treturn true\\n\\t}\\n\\tif a == nil || b == nil {\\n\\t\\treturn false\\n\\t}\\n\\treturn a.Operator == b.Operator &&\\n\\t\\tEqualsExpr(a.Left, b.Left) &&\\n\\t\\tEqualsExpr(a.Right, b.Right)\\n}\",\n \"func TestCheckBinaryExprComplexAddBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i + true`, env,\\n\\t\\t`cannot convert true to type complex128`,\\n\\t\\t`invalid operation: 8i + true (mismatched types complex128 and bool)`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprBoolAndInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true & 4`, env,\\n\\t\\t`cannot convert 4 to type bool`,\\n\\t\\t`invalid operation: true & 4 (mismatched types bool and int)`,\\n\\t)\\n\\n}\",\n \"func binaryMatrixOp(c Context, i Value, op string, j Value) Value {\\n\\tu, v := i.(*Matrix), j.(*Matrix)\\n\\tshape := u.shape\\n\\tvar n []Value\\n\\t// One or the other may be a scalar in disguise.\\n\\tswitch {\\n\\tcase isScalar(u):\\n\\t\\t// Scalar op Matrix.\\n\\t\\tshape = v.shape\\n\\t\\tn = make([]Value, len(v.data))\\n\\t\\tfor k := range v.data {\\n\\t\\t\\tn[k] = c.EvalBinary(u.data[0], op, v.data[k])\\n\\t\\t}\\n\\tcase isScalar(v):\\n\\t\\t// Matrix op Scalar.\\n\\t\\tn = make([]Value, len(u.data))\\n\\t\\tfor k := range u.data {\\n\\t\\t\\tn[k] = c.EvalBinary(u.data[k], op, v.data[0])\\n\\t\\t}\\n\\tcase isVector(u, v.shape):\\n\\t\\t// Vector op Matrix.\\n\\t\\tshape = v.shape\\n\\t\\tn = make([]Value, len(v.data))\\n\\t\\tdim := u.shape[0]\\n\\t\\tindex := 0\\n\\t\\tfor k := range v.data {\\n\\t\\t\\tn[k] = c.EvalBinary(u.data[index], op, v.data[k])\\n\\t\\t\\tindex++\\n\\t\\t\\tif index >= dim {\\n\\t\\t\\t\\tindex = 0\\n\\t\\t\\t}\\n\\t\\t}\\n\\tcase isVector(v, u.shape):\\n\\t\\t// Matrix op Vector.\\n\\t\\tn = make([]Value, len(u.data))\\n\\t\\tdim := v.shape[0]\\n\\t\\tindex := 0\\n\\t\\tfor k := range u.data {\\n\\t\\t\\tn[k] = c.EvalBinary(u.data[k], op, v.data[index])\\n\\t\\t\\tindex++\\n\\t\\t\\tif index >= dim {\\n\\t\\t\\t\\tindex = 0\\n\\t\\t\\t}\\n\\t\\t}\\n\\tdefault:\\n\\t\\t// Matrix op Matrix.\\n\\t\\tu.sameShape(v)\\n\\t\\tn = make([]Value, len(u.data))\\n\\t\\tfor k := range u.data {\\n\\t\\t\\tn[k] = c.EvalBinary(u.data[k], op, v.data[k])\\n\\t\\t}\\n\\t}\\n\\treturn NewMatrix(shape, NewVector(n))\\n}\",\n \"func TestCheckBinaryExprIntAndComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `4 & 8.0i`, env,\\n\\t\\t`illegal constant expression: untyped number & untyped number`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprIntAndInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectConst(t, `4 & 4`, env, NewConstInt64(4 & 4), ConstInt)\\n}\",\n \"func init() {\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenVerticalBarVerticalBar,\\n\\t\\tleftBindingPower: exprLeftBindingPowerLogicalOr,\\n\\t\\toperation: ast.OperationOr,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenAmpersandAmpersand,\\n\\t\\tleftBindingPower: exprLeftBindingPowerLogicalAnd,\\n\\t\\toperation: ast.OperationAnd,\\n\\t})\\n\\n\\tdefineLessThanOrTypeArgumentsExpression()\\n\\tdefineGreaterThanOrBitwiseRightShiftExpression()\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenLessEqual,\\n\\t\\tleftBindingPower: exprLeftBindingPowerComparison,\\n\\t\\toperation: ast.OperationLessEqual,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenGreaterEqual,\\n\\t\\tleftBindingPower: exprLeftBindingPowerComparison,\\n\\t\\toperation: ast.OperationGreaterEqual,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenEqualEqual,\\n\\t\\tleftBindingPower: exprLeftBindingPowerComparison,\\n\\t\\toperation: ast.OperationEqual,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenNotEqual,\\n\\t\\tleftBindingPower: exprLeftBindingPowerComparison,\\n\\t\\toperation: ast.OperationNotEqual,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenDoubleQuestionMark,\\n\\t\\tleftBindingPower: exprLeftBindingPowerNilCoalescing,\\n\\t\\toperation: ast.OperationNilCoalesce,\\n\\t\\trightAssociative: true,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenVerticalBar,\\n\\t\\tleftBindingPower: exprLeftBindingPowerBitwiseOr,\\n\\t\\toperation: ast.OperationBitwiseOr,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenCaret,\\n\\t\\tleftBindingPower: exprLeftBindingPowerBitwiseXor,\\n\\t\\toperation: ast.OperationBitwiseXor,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenAmpersand,\\n\\t\\tleftBindingPower: exprLeftBindingPowerBitwiseAnd,\\n\\t\\toperation: ast.OperationBitwiseAnd,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenLessLess,\\n\\t\\tleftBindingPower: exprLeftBindingPowerBitwiseShift,\\n\\t\\toperation: ast.OperationBitwiseLeftShift,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenPlus,\\n\\t\\tleftBindingPower: exprLeftBindingPowerAddition,\\n\\t\\toperation: ast.OperationPlus,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenMinus,\\n\\t\\tleftBindingPower: exprLeftBindingPowerAddition,\\n\\t\\toperation: ast.OperationMinus,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenStar,\\n\\t\\tleftBindingPower: exprLeftBindingPowerMultiplication,\\n\\t\\toperation: ast.OperationMul,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenSlash,\\n\\t\\tleftBindingPower: exprLeftBindingPowerMultiplication,\\n\\t\\toperation: ast.OperationDiv,\\n\\t})\\n\\n\\tdefineExpr(binaryExpr{\\n\\t\\ttokenType: lexer.TokenPercent,\\n\\t\\tleftBindingPower: exprLeftBindingPowerMultiplication,\\n\\t\\toperation: ast.OperationMod,\\n\\t})\\n\\n\\tdefineIdentifierLeftDenotations()\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenBinaryIntegerLiteral,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\treturn parseIntegerLiteral(\\n\\t\\t\\t\\tp,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\tliteral[2:],\\n\\t\\t\\t\\tcommon.IntegerLiteralKindBinary,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenOctalIntegerLiteral,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\treturn parseIntegerLiteral(\\n\\t\\t\\t\\tp,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\tliteral[2:],\\n\\t\\t\\t\\tcommon.IntegerLiteralKindOctal,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenDecimalIntegerLiteral,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\treturn parseIntegerLiteral(\\n\\t\\t\\t\\tp,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\tcommon.IntegerLiteralKindDecimal,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenHexadecimalIntegerLiteral,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\treturn parseIntegerLiteral(\\n\\t\\t\\t\\tp,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\tliteral[2:],\\n\\t\\t\\t\\tcommon.IntegerLiteralKindHexadecimal,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenUnknownBaseIntegerLiteral,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\treturn parseIntegerLiteral(\\n\\t\\t\\t\\tp,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\tliteral[2:],\\n\\t\\t\\t\\tcommon.IntegerLiteralKindUnknown,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenFixedPointNumberLiteral,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\treturn parseFixedPointLiteral(\\n\\t\\t\\t\\tp,\\n\\t\\t\\t\\tliteral,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(literalExpr{\\n\\t\\ttokenType: lexer.TokenString,\\n\\t\\tnullDenotation: func(p *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\t\\tliteral := p.tokenSource(token)\\n\\t\\t\\tparsedString := parseStringLiteral(p, literal)\\n\\t\\t\\treturn ast.NewStringExpression(\\n\\t\\t\\t\\tp.memoryGauge,\\n\\t\\t\\t\\tparsedString,\\n\\t\\t\\t\\ttoken.Range,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(prefixExpr{\\n\\t\\ttokenType: lexer.TokenMinus,\\n\\t\\tbindingPower: exprLeftBindingPowerUnaryPrefix,\\n\\t\\tnullDenotation: func(p *parser, right ast.Expression, tokenRange ast.Range) (ast.Expression, error) {\\n\\t\\t\\tswitch right := right.(type) {\\n\\t\\t\\tcase *ast.IntegerExpression:\\n\\t\\t\\t\\tif right.Value.Sign() > 0 {\\n\\t\\t\\t\\t\\tif right.Value != nil {\\n\\t\\t\\t\\t\\t\\tright.Value.Neg(right.Value)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tright.StartPos = tokenRange.StartPos\\n\\t\\t\\t\\t\\treturn right, nil\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase *ast.FixedPointExpression:\\n\\t\\t\\t\\tif !right.Negative {\\n\\t\\t\\t\\t\\tright.Negative = !right.Negative\\n\\t\\t\\t\\t\\tright.StartPos = tokenRange.StartPos\\n\\t\\t\\t\\t\\treturn right, nil\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn ast.NewUnaryExpression(\\n\\t\\t\\t\\tp.memoryGauge,\\n\\t\\t\\t\\tast.OperationMinus,\\n\\t\\t\\t\\tright,\\n\\t\\t\\t\\ttokenRange.StartPos,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineExpr(unaryExpr{\\n\\t\\ttokenType: lexer.TokenExclamationMark,\\n\\t\\tbindingPower: exprLeftBindingPowerUnaryPrefix,\\n\\t\\toperation: ast.OperationNegate,\\n\\t})\\n\\n\\tdefineExpr(unaryExpr{\\n\\t\\ttokenType: lexer.TokenLeftArrow,\\n\\t\\tbindingPower: exprLeftBindingPowerUnaryPrefix,\\n\\t\\toperation: ast.OperationMove,\\n\\t})\\n\\n\\tdefineExpr(postfixExpr{\\n\\t\\ttokenType: lexer.TokenExclamationMark,\\n\\t\\tbindingPower: exprLeftBindingPowerUnaryPostfix,\\n\\t\\tleftDenotation: func(p *parser, left ast.Expression, tokenRange ast.Range) (ast.Expression, error) {\\n\\t\\t\\treturn ast.NewForceExpression(\\n\\t\\t\\t\\tp.memoryGauge,\\n\\t\\t\\t\\tleft,\\n\\t\\t\\t\\ttokenRange.EndPos,\\n\\t\\t\\t), nil\\n\\t\\t},\\n\\t})\\n\\n\\tdefineNestedExpression()\\n\\tdefineInvocationExpression()\\n\\tdefineArrayExpression()\\n\\tdefineDictionaryExpression()\\n\\tdefineIndexExpression()\\n\\tdefinePathExpression()\\n\\tdefineConditionalExpression()\\n\\tdefineReferenceExpression()\\n\\tdefineMemberExpression()\\n\\tdefineIdentifierExpression()\\n\\n\\tsetExprNullDenotation(lexer.TokenEOF, func(parser *parser, token lexer.Token) (ast.Expression, error) {\\n\\t\\treturn nil, NewSyntaxError(token.StartPos, \\\"unexpected end of program\\\")\\n\\t})\\n}\",\n \"func BinaryOp(x Value, op token.Token, y Value) Value {\\n\\tvx, okx := x.(*ratVal)\\n\\tvy, oky := y.(*ratVal)\\n\\tif okx || oky {\\n\\t\\tif okx {\\n\\t\\t\\tx = vx.Value\\n\\t\\t}\\n\\t\\tif oky {\\n\\t\\t\\ty = vy.Value\\n\\t\\t}\\n\\t\\tret := constant.BinaryOp(x, gotoken.Token(op), y)\\n\\t\\treturn &ratVal{ret}\\n\\t}\\n\\treturn constant.BinaryOp(x, gotoken.Token(op), y)\\n}\",\n \"func NewBitOp(left, right sql.Expression, op string) *BitOp {\\n\\treturn &BitOp{BinaryExpression{Left: left, Right: right}, op}\\n}\",\n \"func ANDNPD(mx, x operand.Op) { ctx.ANDNPD(mx, x) }\",\n \"func TestBinaryOp(t *testing.T) {\\n\\tfor i, geomCase := range []struct {\\n\\t\\tinput1, input2 string\\n\\t\\tunion, inter, fwdDiff, revDiff, symDiff, relate string\\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\\t / \\\\\\n\\t\\t\\t +--------------+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,1 2,2 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 1,2 1,1 3,0 1))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0.5 1,0 1,1 3,2 1,1.5 1,2 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((0.5 1,1 2,1.5 1,0.5 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,2 0,1.5 1,0.5 1,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 3,2 1,1.5 1,1 2,0.5 1,0 1,1 3))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 0,2 0,1.5 1,0.5 1,0 0)),((0 1,0.5 1,1 2,1.5 1,2 1,1 3,0 1)))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\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\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,2 0,2 2,0 2,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 1,3 1,3 3,1 3,1 1))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,2 0,2 1,3 1,3 3,1 3,1 2,0 2,0 0))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((1 1,2 1,2 2,1 2,1 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,2 0,2 1,1 1,1 2,0 2,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 1,3 1,3 3,1 3,1 2,2 2,2 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 0,2 0,2 1,1 1,1 2,0 2,0 0)),((2 1,3 1,3 3,1 3,1 2,2 2,2 1)))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\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\\n\\n\\t\\t\\t +-----+\\n\\t\\t\\t | |\\n\\t\\t\\t | |\\n\\t\\t\\t +-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,1 0,1 1,0 1,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 2,3 2,3 3,2 3,2 2))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((0 0,1 0,1 1,0 1,0 0)),((2 2,3 2,3 3,2 3,2 2)))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,1 0,1 1,0 1,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 2,3 2,3 3,2 3,2 2))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 0,1 0,1 1,0 1,0 0)),((2 2,3 2,3 3,2 3,2 2)))\\\",\\n\\t\\t\\trelate: \\\"FF2FF1212\\\",\\n\\t\\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\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,3 0,3 3,0 3,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 1,2 1,2 2,1 2,1 1))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,3 0,3 3,0 3,0 0))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((1 1,2 1,2 2,1 2,1 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,3 0,3 3,0 3,0 0),(1 1,2 1,2 2,1 2,1 1))\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,0 3,3 3,3 0,0 0),(1 1,2 1,2 2,1 2,1 1))\\\",\\n\\t\\t\\trelate: \\\"212FF1FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-----+\\n\\t\\t\\t | A |\\n\\t\\t\\t | |\\n\\t\\t\\t +-----+\\n\\n\\n\\t\\t\\t +-----------+\\n\\t\\t\\t | A |\\n\\t\\t\\t | |\\n\\t\\t\\t | +-----+-----+\\n\\t\\t\\t | | A&B | |\\n\\t\\t\\t | | | |\\n\\t\\t\\t +-----+-----+ | +-----+\\n\\t\\t\\t | | | B |\\n\\t\\t\\t | B | | |\\n\\t\\t\\t o +-----------+ +-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 1,0 1)))\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((4 0,4 1,5 1,5 0,4 0)),((1 0,1 2,3 2,3 0,1 0)))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 2,3 2,3 0,1 0,1 1,0 1)),((4 0,4 1,5 1,5 0,4 0)))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((2 2,2 1,1 1,1 2,2 2))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 2,1 2,1 1,0 1)))\\\",\\n\\t\\t\\trevDiff: \\\"MULTIPOLYGON(((4 0,4 1,5 1,5 0,4 0)),((1 0,1 1,2 1,2 2,3 2,3 0,1 0)))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 4,0 5,1 5,1 4,0 4)),((0 1,0 3,2 3,2 2,1 2,1 1,0 1)),((1 1,2 1,2 2,3 2,3 0,1 0,1 1)),((4 0,4 1,5 1,5 0,4 0)))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\n\\t\\t\\t Two interlocking rings:\\n\\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\\t | | | |\\n\\t\\t\\t | +-----------+ |\\n\\t\\t\\t | |\\n\\t\\t\\t +-------------------+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 2,5 2,5 7,0 7,0 2),(1 3,4 3,4 6,1 6,1 3))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 0,7 0,7 5,2 5,2 0),(3 1,6 1,6 4,3 4,3 1))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((2 2,0 2,0 7,5 7,5 5,7 5,7 0,2 0,2 2),(5 4,5 2,3 2,3 1,6 1,6 4,5 4),(1 3,2 3,2 5,4 5,4 6,1 6,1 3),(3 3,4 3,4 4,3 4,3 3))\\\",\\n\\t\\t\\tinter: \\\"MULTIPOLYGON(((3 2,2 2,2 3,3 3,3 2)),((5 5,5 4,4 4,4 5,5 5)))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTIPOLYGON(((2 2,0 2,0 7,5 7,5 5,4 5,4 6,1 6,1 3,2 3,2 2)),((5 4,5 2,3 2,3 3,4 3,4 4,5 4)))\\\",\\n\\t\\t\\trevDiff: \\\"MULTIPOLYGON(((5 5,7 5,7 0,2 0,2 2,3 2,3 1,6 1,6 4,5 4,5 5)),((2 3,2 5,4 5,4 4,3 4,3 3,2 3)))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((5 5,7 5,7 0,2 0,2 2,3 2,3 1,6 1,6 4,5 4,5 5)),((5 5,4 5,4 6,1 6,1 3,2 3,2 2,0 2,0 7,5 7,5 5)),((2 3,2 5,4 5,4 4,3 4,3 3,2 3)),((4 4,5 4,5 2,3 2,3 3,4 3,4 4)))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\n\\t\\t\\t /\\\\ /\\\\\\n\\t\\t\\t / \\\\ / \\\\\\n\\t\\t\\t / A \\\\ / A \\\\\\n\\t\\t\\t / \\\\/ \\\\\\n\\t\\t\\t \\\\ /\\\\ /\\\\ /\\\\ /\\n\\t\\t\\t \\\\/AB\\\\/ \\\\/AB\\\\/\\n\\t\\t\\t /\\\\ /\\\\ /\\\\ /\\\\\\n\\t\\t\\t / \\\\/ \\\\/ \\\\/ \\\\\\n\\t\\t\\t \\\\ /\\\\ /\\n\\t\\t\\t \\\\ B / \\\\ B /\\n\\t\\t\\t \\\\ / \\\\ /\\n\\t\\t\\t \\\\/ \\\\/\\n\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"MULTIPOLYGON(((0 2,1 1,2 2,1 3,0 2)),((2 2,3 1,4 2,3 3,2 2)))\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((0 1,1 2,2 1,1 0,0 1)),((2 1,3 0,4 1,3 2,2 1)))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((0.5 1.5,0 2,1 3,2 2,1.5 1.5,2 1,1 0,0 1,0.5 1.5)),((2.5 1.5,2 2,3 3,4 2,3.5 1.5,4 1,3 0,2 1,2.5 1.5)))\\\",\\n\\t\\t\\tinter: \\\"MULTIPOLYGON(((1.5 1.5,1 1,0.5 1.5,1 2,1.5 1.5)),((3.5 1.5,3 1,2.5 1.5,3 2,3.5 1.5)))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTIPOLYGON(((0.5 1.5,0 2,1 3,2 2,1.5 1.5,1 2,0.5 1.5)),((2.5 1.5,2 2,3 3,4 2,3.5 1.5,3 2,2.5 1.5)))\\\",\\n\\t\\t\\trevDiff: \\\"MULTIPOLYGON(((1 0,0 1,0.5 1.5,1 1,1.5 1.5,2 1,1 0)),((3.5 1.5,4 1,3 0,2 1,2.5 1.5,3 1,3.5 1.5)))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((1 0,0 1,0.5 1.5,1 1,1.5 1.5,2 1,1 0)),((1.5 1.5,1 2,0.5 1.5,0 2,1 3,2 2,1.5 1.5)),((3.5 1.5,4 1,3 0,2 1,2.5 1.5,3 1,3.5 1.5)),((3.5 1.5,3 2,2.5 1.5,2 2,3 3,4 2,3.5 1.5)))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\t},\\n\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t | B | A |\\n\\t\\t\\t | | |\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t | A | B |\\n\\t\\t\\t | | |\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((1 1,1 2,2 2,2 1,1 1)))\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((0 1,0 2,1 2,1 1,0 1)),((1 0,1 1,2 1,2 0,1 0)))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 1,0 2,1 2,2 2,2 1,2 0,1 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"MULTILINESTRING((0 1,1 1),(1 1,1 0),(1 1,1 2),(2 1,1 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((1 1,1 2,2 2,2 1,1 1)))\\\",\\n\\t\\t\\trevDiff: \\\"MULTIPOLYGON(((0 1,0 2,1 2,1 1,0 1)),((1 0,1 1,2 1,2 0,1 0)))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,0 1,0 2,1 2,2 2,2 1,2 0,1 0,0 0))\\\",\\n\\t\\t\\trelate: \\\"FF2F11212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t | A | B |\\n\\t\\t\\t | | |\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 0,1 1,2 1,2 0,1 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 1,1 1,2 1,2 0,1 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(1 1,1 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 0,1 1,2 1,2 0,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((1 1,2 1,2 0,1 0,0 0,0 1,1 1))\\\",\\n\\t\\t\\trelate: \\\"FF2F11212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-------+\\n\\t\\t\\t | A |\\n\\t\\t\\t | +-------+\\n\\t\\t\\t | | B |\\n\\t\\t\\t +-------+ |\\n\\t\\t\\t | |\\n\\t\\t\\t +-------+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0.5,0 1.5,1 1.5,1 0.5,0 0.5))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 0,1 1,2 1,2 0,1 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0.5,0 1.5,1 1.5,1 1,2 1,2 0,1 0,1 0.5,0 0.5))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(1 1,1 0.5)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0.5,0 1.5,1 1.5,1 1,1 0.5,0 0.5))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 0,1 0.5,1 1,2 1,2 0,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((1 0,1 0.5,0 0.5,0 1.5,1 1.5,1 1,2 1,2 0,1 0))\\\",\\n\\t\\t\\trelate: \\\"FF2F11212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-----+\\n\\t\\t\\t | A&B |\\n\\t\\t\\t | |\\n\\t\\t\\t +-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\tfwdDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trelate: \\\"2FFF1FFF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t *-------*\\n\\t\\t\\t |\\\\ A&B /|\\n\\t\\t\\t | \\\\ / |\\n\\t\\t\\t | \\\\ / |\\n\\t\\t\\t * * *\\n\\t\\t\\t | A | B |\\n\\t\\t\\t | | |\\n\\t\\t\\t *---*---*\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,0 2,2 2,1 1,1 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 0,1 1,0 2,2 2,2 0,1 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 2,2 2,2 0,1 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION(LINESTRING(1 1,1 0),POLYGON((0 2,2 2,1 1,0 2)))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 2,1 1,1 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 0,1 1,2 2,2 0,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 2,1 1,2 2,2 0,1 0,0 0,0 2))\\\",\\n\\t\\t\\trelate: \\\"212111212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +---+\\n\\t\\t\\t | A |\\n\\t\\t\\t +---+---+\\n\\t\\t\\t | B |\\n\\t\\t\\t +---+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 1,1 1,1 2,0 2,0 1))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 0,2 0,2 1,1 1,1 0))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((1 1,0 1,0 2,1 2,1 1)),((1 1,2 1,2 0,1 0,1 1)))\\\",\\n\\t\\t\\tinter: \\\"POINT(1 1)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((1 1,0 1,0 2,1 2,1 1))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 1,2 1,2 0,1 0,1 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((1 1,2 1,2 0,1 0,1 1)),((1 1,0 1,0 2,1 2,1 1)))\\\",\\n\\t\\t\\trelate: \\\"FF2F01212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t | / \\\\ |\\n\\t\\t\\t | +-+-+ |\\n\\t\\t\\t | A | B |\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,2 0,2 1,1 1,2 2,0 2,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 0,4 0,4 2,2 2,3 1,2 1,2 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((2 0,0 0,0 2,2 2,4 2,4 0,2 0),(2 2,1 1,2 1,3 1,2 2))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION(POINT(2 2),LINESTRING(2 0,2 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((2 0,0 0,0 2,2 2,1 1,2 1,2 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 2,4 2,4 0,2 0,2 1,3 1,2 2))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((2 2,4 2,4 0,2 0,0 0,0 2,2 2),(2 2,1 1,2 1,3 1,2 2))\\\",\\n\\t\\t\\trelate: \\\"FF2F11212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +---+\\n\\t\\t\\t | A |\\n\\t\\t\\t +---+---+\\n\\t\\t\\t | B |\\n\\t\\t\\t +---+ +---+\\n\\t\\t\\t |A&B|\\n\\t\\t\\t +---+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((1 2,2 2,2 3,1 3,1 2)))\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((2 1,3 1,3 2,2 2,2 1)))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 2,1 2,1 3,2 3,2 2)),((2 2,3 2,3 1,2 1,2 2)))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION(POINT(2 2),POLYGON((0 0,0 1,1 1,1 0,0 0)))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((2 2,1 2,1 3,2 3,2 2))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 2,3 2,3 1,2 1,2 2))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((2 2,3 2,3 1,2 1,2 2)),((2 2,1 2,1 3,2 3,2 2)))\\\",\\n\\t\\t\\trelate: \\\"2F2F11212\\\",\\n\\t\\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 | A | |\\n\\t\\t\\t | +---+ |\\n\\t\\t\\t | | | |\\n\\t\\t\\t +---+---+ |\\n\\t\\t\\t |A&B| B |\\n\\t\\t\\t +---+-------+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,1 0,1 4,0 4,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,3 0,3 5,1 5,1 4,2 4,2 3,1 3,1 2,2 2,2 1,0 1,0 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((1 0,0 0,0 1,0 4,1 4,1 5,3 5,3 0,1 0),(1 4,1 3,2 3,2 4,1 4),(1 2,1 1,2 1,2 2,1 2))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION(POINT(1 4),LINESTRING(1 2,1 3),POLYGON((1 0,0 0,0 1,1 1,1 0)))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((1 2,1 1,0 1,0 4,1 4,1 3,1 2))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 4,1 5,3 5,3 0,1 0,1 1,2 1,2 2,1 2,1 3,2 3,2 4,1 4))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((1 4,1 5,3 5,3 0,1 0,1 1,0 1,0 4,1 4),(1 1,2 1,2 2,1 2,1 1),(1 4,1 3,2 3,2 4,1 4))\\\",\\n\\t\\t\\trelate: \\\"212111212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +-------+-------+\\n\\t\\t\\t | A | B |\\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\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,2 0,2 1,1 1,1 2,2 2,2 3,0 3,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 0,4 0,4 3,2 3,2 2,3 2,3 1,2 1,2 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((2 0,0 0,0 3,2 3,4 3,4 0,2 0),(2 2,1 2,1 1,2 1,3 1,3 2,2 2))\\\",\\n\\t\\t\\tinter: \\\"MULTILINESTRING((2 0,2 1),(2 2,2 3))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((2 0,0 0,0 3,2 3,2 2,1 2,1 1,2 1,2 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 3,4 3,4 0,2 0,2 1,3 1,3 2,2 2,2 3))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((2 3,4 3,4 0,2 0,0 0,0 3,2 3),(2 1,3 1,3 2,2 2,1 2,1 1,2 1))\\\",\\n\\t\\t\\trelate: \\\"FF2F11212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t *-------------+\\n\\t\\t\\t |\\\\`. B |\\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 | A `. \\\\|\\n\\t\\t\\t +-----------`-*\\n\\t\\t\\t*/\\n\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,3 0,1 1,0 3,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((3 0,3 3,0 3,2 2,3 0))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((3 0,0 0,0 3,1 1,3 0)),((0 3,3 3,3 0,2 2,0 3)))\\\",\\n\\t\\t\\tinter: \\\"MULTIPOINT(0 3,3 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((3 0,0 0,0 3,1 1,3 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((0 3,3 3,3 0,2 2,0 3))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 3,3 3,3 0,2 2,0 3)),((3 0,0 0,0 3,1 1,3 0)))\\\",\\n\\t\\t\\trelate: \\\"FF2F01212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +\\n\\t\\t\\t |A\\n\\t\\t\\t | B\\n\\t\\t\\t +----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,0 1)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 0,1 0)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0 1),(0 0,1 0))\\\",\\n\\t\\t\\tinter: \\\"POINT(0 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"LINESTRING(0 0,0 1)\\\",\\n\\t\\t\\trevDiff: \\\"LINESTRING(0 0,1 0)\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 0,1 0),(0 0,0 1))\\\",\\n\\t\\t\\trelate: \\\"FF1F00102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t + +\\n\\t\\t\\t | |\\n\\t\\t\\t A B\\n\\t\\t\\t | |\\n\\t\\t\\t +--A&B--+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"LINESTRING(0 1,0 0,1 0)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 0,1 0,1 1)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 1,0 0),(0 0,1 0),(1 0,1 1))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(0 0,1 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"LINESTRING(0 1,0 0)\\\",\\n\\t\\t\\trevDiff: \\\"LINESTRING(1 0,1 1)\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((1 0,1 1),(0 1,0 0))\\\",\\n\\t\\t\\trelate: \\\"1010F0102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t \\\\ /\\n\\t\\t\\t \\\\ /\\n\\t\\t\\t B A\\n\\t\\t\\t \\\\/\\n\\t\\t\\t /\\\\\\n\\t\\t\\t A B\\n\\t\\t\\t / \\\\\\n\\t\\t\\t / \\\\\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,1 1)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(0 1,0.5 0.5),(0.5 0.5,1 0))\\\",\\n\\t\\t\\tinter: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((0 1,0.5 0.5),(0.5 0.5,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 1,0.5 0.5),(0.5 0.5,1 0),(0 0,0.5 0.5),(0.5 0.5,1 1))\\\",\\n\\t\\t\\trelate: \\\"0F1FF0102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t// +---A---+\\n\\t\\t\\t// | |\\n\\t\\t\\t// B B\\n\\t\\t\\t// | |\\n\\t\\t\\t// +---A---+\\n\\t\\t\\t//\\n\\t\\t\\tinput1: \\\"MULTILINESTRING((0 0,1 0),(0 1,1 1))\\\",\\n\\t\\t\\tinput2: \\\"MULTILINESTRING((0 0,0 1),(1 0,1 1))\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,1 0),(0 1,1 1),(0 0,0 1),(1 0,1 1))\\\",\\n\\t\\t\\tinter: \\\"MULTIPOINT(0 0,0 1,1 0,1 1)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,1 0),(0 1,1 1))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((0 0,0 1),(1 0,1 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 0,0 1),(1 0,1 1),(0 0,1 0),(0 1,1 1))\\\",\\n\\t\\t\\trelate: \\\"FF1F0F1F2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +--A&B--+---A---+\\n\\t\\t\\t | | |\\n\\t\\t\\t A&B B A\\n\\t\\t\\t | | |\\n\\t\\t\\t +---A---+---A---+\\n\\t\\t\\t | |\\n\\t\\t\\t B B\\n\\t\\t\\t | |\\n\\t\\t\\t +---B---+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"LINESTRING(0 2,2 2,2 1,0 1,0 2)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(1 2,1 0,0 0,0 2,1 2)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 2,1 2),(1 2,2 2,2 1,1 1),(1 1,0 1),(0 1,0 2),(1 2,1 1),(1 1,1 0,0 0,0 1))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION(POINT(1 1),LINESTRING(0 2,1 2),LINESTRING(0 1,0 2))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((1 2,2 2,2 1,1 1),(1 1,0 1))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((1 2,1 1),(1 1,1 0,0 0,0 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((1 2,2 2,2 1,1 1),(1 1,0 1),(1 2,1 1),(1 1,1 0,0 0,0 1))\\\",\\n\\t\\t\\trelate: \\\"1F1FFF1F2\\\",\\n\\t\\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\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,2 2,0 2,2 0)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(2 0,3 1,2 2)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,1 1),(1 1,2 2),(2 2,0 2,1 1),(1 1,2 0),(2 0,3 1,2 2))\\\",\\n\\t\\t\\tinter: \\\"MULTIPOINT(2 0,2 2)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,1 1),(1 1,2 2),(2 2,0 2,1 1),(1 1,2 0))\\\",\\n\\t\\t\\trevDiff: \\\"LINESTRING(2 0,3 1,2 2)\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 0,1 1),(1 1,2 2),(2 2,0 2,1 1),(1 1,2 0),(2 0,3 1,2 2))\\\",\\n\\t\\t\\trelate: \\\"F01F001F2\\\",\\n\\t\\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\\tinput1: \\\"POLYGON((0 0,0 2,2 2,2 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(1 1,1 3)\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(LINESTRING(1 2,1 3),POLYGON((0 0,0 2,1 2,2 2,2 0,0 0)))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(1 1,1 2)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 2,1 2,2 2,2 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"LINESTRING(1 2,1 3)\\\",\\n\\t\\t\\tsymDiff: \\\"GEOMETRYCOLLECTION(LINESTRING(1 2,1 3),POLYGON((0 0,0 2,1 2,2 2,2 0,0 0)))\\\",\\n\\t\\t\\trelate: \\\"1020F1102\\\",\\n\\t\\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\\tinput1: \\\"POLYGON((0 0,0 3,3 3,3 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(1 1,2 2)\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 3,3 3,3 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(1 1,2 2)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 3,3 3,3 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,0 3,3 3,3 0,0 0))\\\",\\n\\t\\t\\trelate: \\\"102FF1FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +---+---+---+\\n\\t\\t\\t | A |A&B|\\n\\t\\t\\t +---+---+---+\\n\\t\\t\\t |A&B| B |\\n\\t\\t\\t +---+---+---+\\n\\t\\t\\t | A |A&B|\\n\\t\\t\\t +---+---+---+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,3 0,3 1,1 1,1 2,3 2,3 3,0 3,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 1,0 2,2 2,2 3,3 3,3 0,2 0,2 1,0 1))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((2 0,0 0,0 1,0 2,0 3,2 3,3 3,3 2,3 1,3 0,2 0))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION(LINESTRING(2 1,1 1),LINESTRING(1 2,2 2),POLYGON((3 0,2 0,2 1,3 1,3 0)),POLYGON((1 2,1 1,0 1,0 2,1 2)),POLYGON((3 2,2 2,2 3,3 3,3 2)))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTIPOLYGON(((2 0,0 0,0 1,1 1,2 1,2 0)),((2 2,1 2,0 2,0 3,2 3,2 2)))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 2,2 2,3 2,3 1,2 1,1 1,1 2))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((1 2,0 2,0 3,2 3,2 2,3 2,3 1,2 1,2 0,0 0,0 1,1 1,1 2))\\\",\\n\\t\\t\\trelate: \\\"212111212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t + + +\\n\\t\\t\\t A A&B B\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"MULTIPOINT(0 0,1 1)\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOINT(1 1,2 2)\\\",\\n\\t\\t\\tunion: \\\"MULTIPOINT(0 0,1 1,2 2)\\\",\\n\\t\\t\\tinter: \\\"POINT(1 1)\\\",\\n\\t\\t\\tfwdDiff: \\\"POINT(0 0)\\\",\\n\\t\\t\\trevDiff: \\\"POINT(2 2)\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOINT(0 0,2 2)\\\",\\n\\t\\t\\trelate: \\\"0F0FFF0F2\\\",\\n\\t\\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\\tinput1: \\\"POLYGON((0 0,0 2,2 2,2 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOINT(1 1,3 1)\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(POINT(3 1),POLYGON((0 0,0 2,2 2,2 1,2 0,0 0)))\\\",\\n\\t\\t\\tinter: \\\"POINT(1 1)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 2,2 2,2 1,2 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POINT(3 1)\\\",\\n\\t\\t\\tsymDiff: \\\"GEOMETRYCOLLECTION(POINT(3 1),POLYGON((0 0,0 2,2 2,2 1,2 0,0 0)))\\\",\\n\\t\\t\\trelate: \\\"0F2FF10F2\\\",\\n\\t\\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 O-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,0 1,1 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POINT(0 0)\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 1,1 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"POINT(0 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 1,1 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,0 1,1 0,0 0))\\\",\\n\\t\\t\\trelate: \\\"FF20F1FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t +\\n\\t\\t\\t |\\\\\\n\\t\\t\\t | \\\\\\n\\t\\t\\t | O\\n\\t\\t\\t | \\\\\\n\\t\\t\\t | \\\\\\n\\t\\t\\t +-----+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,0 1,1 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 1,0.5 0.5,1 0,0 0))\\\",\\n\\t\\t\\tinter: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,0 1,0.5 0.5,1 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,0 1,0.5 0.5,1 0,0 0))\\\",\\n\\t\\t\\trelate: \\\"FF20F1FF2\\\",\\n\\t\\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\\tinput1: \\\"LINESTRING(0 0,0 1,1 1,1 0,0 0,0 1)\\\", // overlapping line segment\\n\\t\\t\\tinput2: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(LINESTRING(0 0,0 1),LINESTRING(0 1,1 1,1 0,0 0),POINT(0.5 0.5))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0 1),(0 1,1 1,1 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t\\tsymDiff: \\\"GEOMETRYCOLLECTION(LINESTRING(0 0,0 1),LINESTRING(0 1,1 1,1 0,0 0),POINT(0.5 0.5))\\\",\\n\\t\\t\\trelate: \\\"FF1FF00F2\\\",\\n\\t\\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\\tinput1: \\\"LINESTRING(0 0,1 1)\\\",\\n\\t\\t\\tinput2: \\\"POINT(0.35355339059327373 0.35355339059327373)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0.35355339059327373 0.35355339059327373),(0.35355339059327373 0.35355339059327373,1 1))\\\",\\n\\t\\t\\tinter: \\\"POINT(0.35355339059327373 0.35355339059327373)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0.35355339059327373 0.35355339059327373),(0.35355339059327373 0.35355339059327373,1 1))\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 0,0.35355339059327373 0.35355339059327373),(0.35355339059327373 0.35355339059327373,1 1))\\\",\\n\\t\\t\\trelate: \\\"0F1FF0FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t// LineString with a Point in the middle of it.\\n\\t\\t\\tinput1: \\\"POINT(5 5)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(1 2,9 8)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((1 2,5 5),(5 5,9 8))\\\",\\n\\t\\t\\tinter: \\\"POINT(5 5)\\\",\\n\\t\\t\\tfwdDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((1 2,5 5),(5 5,9 8))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((1 2,5 5),(5 5,9 8))\\\",\\n\\t\\t\\trelate: \\\"0FFFFF102\\\",\\n\\t\\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\\n\\t\\t\\t// Tests a case where intersection between two segments is *not* commutative if done naively.\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,1 2)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2),(0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\\\",\\n\\t\\t\\tinter: \\\"POINT(0.3333333333 0.6666666667)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0),(0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\\\",\\n\\t\\t\\trelate: \\\"0F1FF0102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t// Similar case for when line segment non-commutative operations are\\n\\t\\t\\t// done, but this time with a line segment doubling back on itself.\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,1 2,0 0)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2),(0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\\\",\\n\\t\\t\\tinter: \\\"POINT(0.3333333333 0.6666666667)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((0 1,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 0),(0 0,0.3333333333 0.6666666667),(0.3333333333 0.6666666667,1 2))\\\",\\n\\t\\t\\trelate: \\\"0F1FFF102\\\",\\n\\t\\t},\\n\\n\\t\\t// In the following test cases, lines from the first input intersect\\n\\t\\t// *almost* exactly with one of the vertices in the second input.\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(-1 1,1 -1)\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((-1 0,-0.070710678118655 0.070710678118655,0 1,-1 0))\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(LINESTRING(-1 1,-0.5 0.5),LINESTRING(-0.070710678118655 0.070710678118655,1 -1),POLYGON((-1 0,-0.5 0.5,0 1,-0.070710678118655 0.070710678118655,-1 0)))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(-0.5 0.5,-0.070710678118655 0.070710678118655)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((-1 1,-0.5 0.5),(-0.070710678118655 0.070710678118655,1 -1))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((-1 0,-0.5 0.5,0 1,-0.070710678118655 0.070710678118655,-1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"GEOMETRYCOLLECTION(LINESTRING(-1 1,-0.5 0.5),LINESTRING(-0.070710678118655 0.070710678118655,1 -1),POLYGON((-1 0,-0.5 0.5,0 1,-0.070710678118655 0.070710678118655,-1 0)))\\\",\\n\\t\\t\\trelate: \\\"101FF0212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,1 1)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(1 0,0.5000000000000001 0.5,0 1)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(1 0,0.5 0.5),(0.5 0.5,0 1))\\\",\\n\\t\\t\\tinter: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((1 0,0.5 0.5),(0.5 0.5,0 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((1 0,0.5 0.5),(0.5 0.5,0 1),(0 0,0.5 0.5),(0.5 0.5,1 1))\\\",\\n\\t\\t\\trelate: \\\"0F1FF0102\\\",\\n\\t\\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\\tinput1: \\\"GEOMETRYCOLLECTION(POLYGON((1 0,3 2,1 2,1 0)))\\\",\\n\\t\\t\\tinput2: \\\"GEOMETRYCOLLECTION(LINESTRING(0 1,3 1))\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(POLYGON((1 0,2 1,3 2,1 2,1 1,1 0)),LINESTRING(0 1,1 1),LINESTRING(2 1,3 1))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(1 1,2 1)\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((1 0,2 1,3 2,1 2,1 1,1 0))\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((0 1,1 1),(2 1,3 1))\\\",\\n\\t\\t\\tsymDiff: \\\"GEOMETRYCOLLECTION(POLYGON((1 0,2 1,3 2,1 2,1 1,1 0)),LINESTRING(0 1,1 1),LINESTRING(2 1,3 1))\\\",\\n\\t\\t\\trelate: \\\"1F20F1102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t Reproduces a bug with set ops between self-intersecting GeometryCollections.\\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 +--+--+--+-----+--+1B\\n\\t\\t\\t | | |\\\\ \\\\\\n\\t\\t\\t | | | \\\\ 2A \\\\\\n\\t\\t\\t | +--+--+-----+\\n\\t\\t\\t | | \\\\\\n\\t\\t\\t | 1A | \\\\\\n\\t\\t\\t +-----+-----+\\n\\t\\t\\t |\\n\\t\\t\\t |2B\\n\\t\\t\\t +\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((1 1,5 5,1 5,1 1)),\\n\\t\\t\\t\\tLINESTRING(0 3,6 3))`,\\n\\t\\t\\tinput2: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 0,6 4,2 4,2 0)),\\n\\t\\t\\t\\tLINESTRING(3 0,3 6))`,\\n\\t\\t\\tunion: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 2,2 0,3 1,5 3,6 4,4 4,5 5,3 5,1 5,1 3,1 1,2 2)),\\n\\t\\t\\t\\tLINESTRING(0 3,1 3),\\n\\t\\t\\t\\tLINESTRING(5 3,6 3),\\n\\t\\t\\t\\tLINESTRING(3 0,3 1),\\n\\t\\t\\t\\tLINESTRING(3 5,3 6))`,\\n\\t\\t\\tinter: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 2,3 3,4 4,3 4,2 4,2 3,2 2)),\\n\\t\\t\\t\\tLINESTRING(3 3,5 3),\\n\\t\\t\\t\\tLINESTRING(3 4,3 5))`,\\n\\t\\t\\tfwdDiff: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((1 1,2 2,2 3,2 4,3 4,4 4,5 5,3 5,1 5,1 3,1 1)),\\n\\t\\t\\t\\tLINESTRING(0 3,1 3),\\n\\t\\t\\t\\tLINESTRING(5 3,6 3))`,\\n\\t\\t\\trevDiff: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((3 1,5 3,6 4,4 4,3 3,2 2,2 0,3 1)),\\n\\t\\t\\t\\tLINESTRING(3 0,3 1),\\n\\t\\t\\t\\tLINESTRING(3 5,3 6))`,\\n\\t\\t\\tsymDiff: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((1 1,2 2,2 3,2 4,3 4,4 4,5 5,3 5,1 5,1 3,1 1)),\\n\\t\\t\\t\\tPOLYGON((3 1,5 3,6 4,4 4,3 3,2 2,2 0,3 1)),\\n\\t\\t\\t\\tLINESTRING(0 3,1 3),\\n\\t\\t\\t\\tLINESTRING(5 3,6 3),\\n\\t\\t\\t\\tLINESTRING(3 0,3 1),\\n\\t\\t\\t\\tLINESTRING(3 5,3 6))`,\\n\\t\\t\\trelate: `212101212`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t Reproduces a bug with set ops between self-intersecting GeometryCollections.\\n\\t\\t\\t Similar to the previous case, but none of the crossing points are coincident.\\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\\t | | | \\\\ \\\\\\n\\t\\t\\t +--+--+--+--+--+--+--+1B\\n\\t\\t\\t | | | \\\\ \\\\\\n\\t\\t\\t | | | \\\\ 2A \\\\\\n\\t\\t\\t | +--+-----+-----+\\n\\t\\t\\t | | \\\\\\n\\t\\t\\t | 1A | \\\\\\n\\t\\t\\t +-----+--------+\\n\\t\\t\\t |\\n\\t\\t\\t |2B\\n\\t\\t\\t +\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((1 1,6 6,1 6,1 1)),\\n\\t\\t\\t\\tLINESTRING(0 4,7 4))`,\\n\\t\\t\\tinput2: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 0,7 5,2 5,2 0)),\\n\\t\\t\\t\\tLINESTRING(3 0,3 7))`,\\n\\t\\t\\tunion: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 2,2 0,3 1,6 4,7 5,5 5,6 6,3 6,1 6,1 4,1 1,2 2)),\\n\\t\\t\\t\\tLINESTRING(0 4,1 4),\\n\\t\\t\\t\\tLINESTRING(6 4,7 4),\\n\\t\\t\\t\\tLINESTRING(3 0,3 1),\\n\\t\\t\\t\\tLINESTRING(3 6,3 7))`,\\n\\t\\t\\tinter: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 2,3 3,4 4,5 5,3 5,2 5,2 4,2 2)),\\n\\t\\t\\t\\tLINESTRING(4 4,6 4),\\n\\t\\t\\t\\tLINESTRING(3 5,3 6))`,\\n\\t\\t\\tfwdDiff: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((5 5,6 6,3 6,1 6,1 4,1 1,2 2,2 4,2 5,3 5,5 5)),\\n\\t\\t\\t\\tLINESTRING(0 4,1 4),\\n\\t\\t\\t\\tLINESTRING(6 4,7 4))`,\\n\\t\\t\\trevDiff: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 0,3 1,6 4,7 5,5 5,4 4,3 3,2 2,2 0)),\\n\\t\\t\\t\\tLINESTRING(3 0,3 1),\\n\\t\\t\\t\\tLINESTRING(3 6,3 7))`,\\n\\t\\t\\tsymDiff: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((3 6,1 6,1 4,1 1,2 2,2 4,2 5,3 5,5 5,6 6,3 6)),\\n\\t\\t\\t\\tPOLYGON((3 3,2 2,2 0,3 1,6 4,7 5,5 5,4 4,3 3)),\\n\\t\\t\\t\\tLINESTRING(0 4,1 4),\\n\\t\\t\\t\\tLINESTRING(6 4,7 4),\\n\\t\\t\\t\\tLINESTRING(3 0,3 1),\\n\\t\\t\\t\\tLINESTRING(3 6,3 7))`,\\n\\t\\t\\trelate: `212101212`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t\\t+-----+--+ +-----+--+\\n\\t\\t\\t\\t| 1A |2 | | |\\n\\t\\t\\t\\t| +--+--+ | +\\n\\t\\t\\t\\t| | | | -> | |\\n\\t\\t\\t\\t+--+--+ | +--+ |\\n\\t\\t\\t\\t | 1B | | |\\n\\t\\t\\t\\t +--+--+ +--+--+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: \\\"GEOMETRYCOLLECTION(POLYGON((0 0,2 0,2 2,0 2,0 0)),POLYGON((1 1,3 1,3 3,1 3,1 1)))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 0,3 0,3 1,2 1,2 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((2 0,3 0,3 1,3 3,1 3,1 2,0 2,0 0,2 0))\\\",\\n\\t\\t\\tinter: \\\"MULTILINESTRING((2 1,3 1),(2 0,2 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((1 2,0 2,0 0,2 0,2 1,3 1,3 3,1 3,1 2))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 0,3 0,3 1,2 1,2 0))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,2 0,3 0,3 1,3 3,1 3,1 2,0 2,0 0))\\\",\\n\\t\\t\\trelate: \\\"FF2F11212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t/*\\n\\t\\t\\t\\t +--------+ +--------+\\n\\t\\t\\t\\t | | | |\\n\\t\\t\\t\\t | 1A | | |\\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| 2A | | 2B | -> | | | |\\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 | 1B | | |\\n\\t\\t\\t\\t | | | |\\n\\t\\t\\t\\t +--------+ +--------+\\n\\t\\t\\t*/\\n\\t\\t\\tinput1: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((2 0,5 0,5 3,2 3,2 0)),\\n\\t\\t\\t\\tPOLYGON((2 4,5 4,5 7,2 7,2 4)))`,\\n\\t\\t\\tinput2: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\tPOLYGON((0 2,3 2,3 5,0 5,0 2)),\\n\\t\\t\\t\\tPOLYGON((4 2,7 2,7 5,4 5,4 2)))`,\\n\\t\\t\\tunion: `POLYGON(\\n\\t\\t\\t\\t(0 2,2 2,2 0,5 0,5 2,7 2,7 5,5 5,5 7,2 7,2 5,0 5,0 2),\\n\\t\\t\\t\\t(3 3,3 4,4 4,4 3,3 3))`,\\n\\t\\t\\tinter: `MULTIPOLYGON(\\n\\t\\t\\t\\t((2 2,3 2,3 3,2 3,2 2)),\\n\\t\\t\\t\\t((2 4,3 4,3 5,2 5,2 4)),\\n\\t\\t\\t\\t((4 2,5 2,5 3,4 3,4 2)),\\n\\t\\t\\t\\t((4 4,5 4,5 5,4 5,4 4)))`,\\n\\t\\t\\tfwdDiff: `MULTIPOLYGON(\\n\\t\\t\\t\\t((2 0,5 0,5 2,4 2,4 3,3 3,3 2,2 2,2 0)),\\n\\t\\t\\t\\t((3 4,4 4,4 5,5 5,5 7,2 7,2 5,3 5,3 4)))`,\\n\\t\\t\\trevDiff: `MULTIPOLYGON(\\n\\t\\t\\t\\t((0 2,2 2,2 3,3 3,3 4,2 4,2 5,0 5,0 2)),\\n\\t\\t\\t\\t((5 2,7 2,7 5,5 5,5 4,4 4,4 3,5 3,5 2)))`,\\n\\t\\t\\tsymDiff: `MULTIPOLYGON(\\n\\t\\t\\t\\t((2 0,5 0,5 2,4 2,4 3,3 3,3 2,2 2,2 0)),\\n\\t\\t\\t\\t((2 2,2 3,3 3,3 4,2 4,2 5,0 5,0 2,2 2)),\\n\\t\\t\\t\\t((3 4,4 4,4 5,5 5,5 7,2 7,2 5,3 5,3 4)),\\n\\t\\t\\t\\t((4 3,5 3,5 2,7 2,7 5,5 5,5 4,4 4,4 3)))`,\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\t},\\n\\n\\t\\t// Empty cases for relate.\\n\\t\\t{input1: \\\"POINT EMPTY\\\", input2: \\\"POINT(0 0)\\\", relate: \\\"FFFFFF0F2\\\"},\\n\\t\\t{input1: \\\"POINT EMPTY\\\", input2: \\\"LINESTRING(0 0,1 1)\\\", relate: \\\"FFFFFF102\\\"},\\n\\t\\t{input1: \\\"POINT EMPTY\\\", input2: \\\"LINESTRING(0 0,0 1,1 0,0 0)\\\", relate: \\\"FFFFFF1F2\\\"},\\n\\t\\t{input1: \\\"POINT EMPTY\\\", input2: \\\"POLYGON((0 0,0 1,1 0,0 0))\\\", relate: \\\"FFFFFF212\\\"},\\n\\n\\t\\t// Cases involving geometry collections where polygons from one of the\\n\\t\\t// inputs interact with each other.\\n\\t\\t{\\n\\t\\t\\tinput1: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\t\\t\\tPOLYGON((0 0,1 0,0 1,0 0)),\\n\\t\\t\\t\\t\\t\\tPOLYGON((0 0,1 1,0 1,0 0)))`,\\n\\t\\t\\tinput2: \\\"LINESTRING(0 0,1 1)\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\\\",\\n\\t\\t\\tinter: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1))\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\\\",\\n\\t\\t\\trelate: \\\"1F2101FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\t\\t\\tPOLYGON((0 0,1 0,0 1,0 0)),\\n\\t\\t\\t\\t\\t\\tPOLYGON((1 1,0 1,1 0,1 1)))`,\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,2 0,2 2,0 2,0 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,1 0,2 0,2 2,0 2,0 1,0 0))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((0 0,1 0,1 1,0 1,0 0))\\\",\\n\\t\\t\\tfwdDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 0,2 0,2 2,0 2,0 1,1 1,1 0))\\\",\\n\\t\\t\\tsymDiff: \\\"POLYGON((1 0,2 0,2 2,0 2,0 1,1 1,1 0))\\\",\\n\\t\\t\\trelate: \\\"2FF11F212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: `GEOMETRYCOLLECTION(\\n\\t\\t\\t\\t\\t\\tPOLYGON((0 0,2 0,2 1,0 1,0 0)),\\n\\t\\t\\t\\t\\t\\tPOLYGON((0 0,1 0,1 2,0 2,0 0)))`,\\n\\t\\t\\tinput2: \\\"POLYGON((1 0,2 1,1 2,0 1,1 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,1 0,2 0,2 1,1 2,0 2,0 1,0 0))\\\",\\n\\t\\t\\tinter: \\\"POLYGON((1 0,2 1,1 1,1 2,0 1,1 0))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTIPOLYGON(((0 0,1 0,0 1,0 0)),((1 0,2 0,2 1,1 0)),((0 1,1 2,0 2,0 1)))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((1 1,2 1,1 2,1 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 0,1 0,0 1,0 0)),((1 0,2 0,2 1,1 0)),((0 1,1 2,0 2,0 1)),((1 1,2 1,1 2,1 1)))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\t},\\n\\n\\t\\t// Bug reproductions:\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(-1 1,1 -1)\\\",\\n\\t\\t\\tinput2: \\\"MULTILINESTRING((1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2))\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((-1 1,1 -1),(1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tfwdDiff: \\\"LINESTRING(-1 1,1 -1)\\\",\\n\\t\\t\\trevDiff: \\\"MULTILINESTRING((1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTILINESTRING((1 0,0 1),(0 1,1 2),(2 0,3 1),(3 1,2 2),(-1 1,1 -1))\\\",\\n\\t\\t\\trelate: \\\"FF1FF0102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0.5,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trevDiff: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0.5,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0.5,1 0,0 0)),((2 0,2 1,3 1,3 0,2 0)))\\\",\\n\\t\\t\\trelate: \\\"1FFF0F212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"POLYGON((1 0,0 1,1 1,1 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 0,2 1,3 1,3 0,2 0))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((1 0,0 1,1 1,1 0)),((2 0,2 1,3 1,3 0,2 0)))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((1 0,0 1,1 1,1 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 0,2 1,3 1,3 0,2 0))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((2 0,2 1,3 1,3 0,2 0)),((1 0,0 1,1 1,1 0)))\\\",\\n\\t\\t\\trelate: \\\"FF2FF1212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"POLYGON((0 0,1 1,1 0,0 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((2 2,3 2,3 1,2 1,2 2))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((0 0,1 0,1 1,0 0)),((2 1,2 2,3 2,3 1,2 1)))\\\",\\n\\t\\t\\tinter: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\tfwdDiff: \\\"POLYGON((0 0,1 1,1 0,0 0))\\\",\\n\\t\\t\\trevDiff: \\\"POLYGON((2 1,2 2,3 2,3 1,2 1))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((2 1,2 2,3 2,3 1,2 1)),((0 0,1 0,1 1,0 0)))\\\",\\n\\t\\t\\trelate: \\\"FF2FF1212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((2 1,2 2,3 2,3 1,2 1)))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((2 1,2 2,3 2,3 1,2 1)))\\\",\\n\\t\\t\\tinter: \\\"LINESTRING(0 1,1 0)\\\",\\n\\t\\t\\tfwdDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trevDiff: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 1,2 2,3 2,3 1,2 1)))\\\",\\n\\t\\t\\tsymDiff: \\\"MULTIPOLYGON(((0 0,0 1,1 1,1 0,0 0)),((2 1,2 2,3 2,3 1,2 1)))\\\",\\n\\t\\t\\trelate: \\\"1FFF0F212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"POINT(5 5)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(5 3,4 8,1 2,9 8)\\\",\\n\\t\\t\\tfwdDiff: \\\"GEOMETRYCOLLECTION EMPTY\\\",\\n\\t\\t\\trelate: \\\"0FFFFF102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(1 1,2 2,3 3,0 0)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(1 2,2 0)\\\",\\n\\t\\t\\tinter: \\\"POINT(1.3333333333 1.3333333333)\\\",\\n\\t\\t\\trelate: \\\"0F1FF0102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"MULTILINESTRING((0 0,1 1),(0 1,1 0))\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 1,0.3333333333 0.6666666667,1 0)\\\",\\n\\t\\t\\tunion: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(0 1,0.3333333333 0.6666666667,0.5 0.5),(0.5 0.5,1 0))\\\",\\n\\t\\t\\trelate: \\\"1F1F00FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"POLYGON((-1 0,0 0,0 1,-1 0))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((1 0,-0.9 -0.2,-1 -0.0000000000000032310891488651735,-0.9 0.2,1 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((-1 0,-0.9 0.2,-0.80952380952381 0.19047619047619,0 1,0 0.105263157894737,1 0,-0.9 -0.2,-1 0))\\\",\\n\\t\\t\\trelate: \\\"212101212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(1 2.1,2.1 1)\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,0 10,10 10,10 0,0 0),(1.5 1.5,8.5 1.5,8.5 8.5,1.5 8.5,1.5 1.5))\\\",\\n\\t\\t\\tinter: \\\"MULTILINESTRING((1 2.1,1.5 1.6),(1.6 1.5,2.1 1))\\\",\\n\\t\\t\\trelate: \\\"1010FF212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(1 2,2 3)\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((1 2,2 2,2 3,1 3,1 2)))\\\",\\n\\t\\t\\tunion: \\\"MULTIPOLYGON(((1 1,1 0,0 0,0 1,1 1)),((1 2,2 2,2 3,1 3,1 2)))\\\",\\n\\t\\t\\trelate: \\\"1FFF0F212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(0 1,0 0,1 0)\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,1 0,1 1,0 1,0 0.5,0 0))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,1 0,1 1,0 1,0 0.5,0 0))\\\",\\n\\t\\t\\trelate: \\\"F1FF0F212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(2 2,3 3,4 4,5 5,0 0)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0 0,1 1)\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((2 2,3 3,4 4,5 5),(1 1,2 2))\\\",\\n\\t\\t\\trelate: \\\"101F00FF2\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,0 0,0 1,1 0,0 0)\\\",\\n\\t\\t\\tinput2: \\\"MULTILINESTRING((0 0,0.5 0.5),(0.5 0.5,1 1),(0 1,0.3333333333 0.6666666667,0.5 0.5),(0.5 0.5,1 0))\\\",\\n\\t\\t\\tfwdDiff: \\\"MULTILINESTRING((0 0,0 1),(1 0,0 0))\\\",\\n\\t\\t\\trelate: \\\"101FFF102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(1 0,0.5000000000000001 0.5,0 1)\\\",\\n\\t\\t\\tinput2: \\\"MULTIPOLYGON(((0 0,2 0,2 2,0 2,0 0),(0.5 0.5,1 0.5,1 1.5,0.5 1.5,0.5 0.5)))\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,1 0,2 0,2 2,0 2,0 1,0 0),(0.5000000000000001 0.5,1 0.5,1 1.5,0.5 1.5,0.5000000000000001 0.5))\\\",\\n\\t\\t\\trelate: \\\"10FF0F212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(1 1,3 1,1 1,3 1)\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,0 2,2 2,2 0,0 0))\\\",\\n\\t\\t\\trelate: \\\"1010F0212\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(-1 1,1 -1)\\\",\\n\\t\\t\\tinput2: \\\"MULTILINESTRING((0 0,0 1),(0 0,1 0))\\\",\\n\\t\\t\\trelate: \\\"0F1FF0102\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"MULTILINESTRING((2 0,2 1),(2 2,2 3))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON((0 0,0 10,10 10,10 0,0 0),(1.5 1.5,8.5 1.5,8.5 8.5,1.5 8.5,1.5 1.5))\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(POLYGON((2 0,10 0,10 10,0 10,0 0,2 0),(1.5 1.5,1.5 8.5,8.5 8.5,8.5 1.5,1.5 1.5)),LINESTRING(2 2,2 3))\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"POINT(0 0)\\\",\\n\\t\\t\\tinput2: \\\"POINT(0 0)\\\",\\n\\t\\t\\trelate: \\\"0FFFFFFF2\\\",\\n\\t\\t\\tunion: \\\"POINT(0 0)\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"GEOMETRYCOLLECTION(POINT(0 0))\\\",\\n\\t\\t\\tinput2: \\\"GEOMETRYCOLLECTION(LINESTRING(2 0,2 1))\\\",\\n\\t\\t\\tunion: \\\"GEOMETRYCOLLECTION(POINT(0 0),LINESTRING(2 0,2 1))\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"GEOMETRYCOLLECTION(POLYGON((0 0,1 0,0 1,0 0)),POLYGON((0 0,1 1,0 1,0 0)))\\\",\\n\\t\\t\\tinput2: \\\"POINT(0 0)\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,1 0,0.5 0.5,1 1,0 1,0 0))\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"GEOMETRYCOLLECTION(POLYGON((0 0,0 1,1 0,0 0)),POLYGON((0 1,1 1,1 0,0 1)))\\\",\\n\\t\\t\\tinput2: \\\"POLYGON EMPTY\\\",\\n\\t\\t\\tunion: \\\"POLYGON((0 0,0 1,1 1,1 0,0 0))\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tinput1: \\\"LINESTRING(0 0,0 0,0 1,1 0,0 0)\\\",\\n\\t\\t\\tinput2: \\\"LINESTRING(0.1 0.1,0.5 0.5)\\\",\\n\\t\\t\\tinter: \\\"POINT(0.5 0.5)\\\",\\n\\t\\t},\\n\\t} {\\n\\t\\tt.Run(strconv.Itoa(i), func(t *testing.T) {\\n\\t\\t\\tg1 := geomFromWKT(t, geomCase.input1)\\n\\t\\t\\tg2 := geomFromWKT(t, geomCase.input2)\\n\\t\\t\\tt.Logf(\\\"input1: %s\\\", geomCase.input1)\\n\\t\\t\\tt.Logf(\\\"input2: %s\\\", geomCase.input2)\\n\\t\\t\\tfor _, opCase := range []struct {\\n\\t\\t\\t\\topName string\\n\\t\\t\\t\\top func(geom.Geometry, geom.Geometry) (geom.Geometry, error)\\n\\t\\t\\t\\twant string\\n\\t\\t\\t}{\\n\\t\\t\\t\\t{\\\"union\\\", geom.Union, geomCase.union},\\n\\t\\t\\t\\t{\\\"inter\\\", geom.Intersection, geomCase.inter},\\n\\t\\t\\t\\t{\\\"fwd_diff\\\", geom.Difference, geomCase.fwdDiff},\\n\\t\\t\\t\\t{\\\"rev_diff\\\", func(a, b geom.Geometry) (geom.Geometry, error) { return geom.Difference(b, a) }, geomCase.revDiff},\\n\\t\\t\\t\\t{\\\"sym_diff\\\", geom.SymmetricDifference, geomCase.symDiff},\\n\\t\\t\\t} {\\n\\t\\t\\t\\tt.Run(opCase.opName, func(t *testing.T) {\\n\\t\\t\\t\\t\\tif opCase.want == \\\"\\\" {\\n\\t\\t\\t\\t\\t\\tt.Skip(\\\"Skipping test because it's not specified or is commented out\\\")\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\twant := geomFromWKT(t, opCase.want)\\n\\t\\t\\t\\t\\tgot, err := opCase.op(g1, g2)\\n\\t\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\t\\tt.Fatalf(\\\"could not perform op: %v\\\", err)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\texpectGeomEq(t, got, want, geom.IgnoreOrder, geom.ToleranceXY(1e-7))\\n\\t\\t\\t\\t})\\n\\t\\t\\t}\\n\\t\\t\\tt.Run(\\\"relate\\\", func(t *testing.T) {\\n\\t\\t\\t\\tif geomCase.relate == \\\"\\\" {\\n\\t\\t\\t\\t\\tt.Skip(\\\"Skipping test because it's not specified or is commented out\\\")\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor _, swap := range []struct {\\n\\t\\t\\t\\t\\tdescription string\\n\\t\\t\\t\\t\\treverse bool\\n\\t\\t\\t\\t}{\\n\\t\\t\\t\\t\\t{\\\"fwd\\\", false},\\n\\t\\t\\t\\t\\t{\\\"rev\\\", true},\\n\\t\\t\\t\\t} {\\n\\t\\t\\t\\t\\tt.Run(swap.description, func(t *testing.T) {\\n\\t\\t\\t\\t\\t\\tvar (\\n\\t\\t\\t\\t\\t\\t\\tgot string\\n\\t\\t\\t\\t\\t\\t\\terr error\\n\\t\\t\\t\\t\\t\\t)\\n\\t\\t\\t\\t\\t\\tif swap.reverse {\\n\\t\\t\\t\\t\\t\\t\\tgot, err = geom.Relate(g2, g1)\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\tgot, err = geom.Relate(g1, g2)\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\t\\t\\tt.Fatal(\\\"could not perform relate op\\\")\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\twant := geomCase.relate\\n\\t\\t\\t\\t\\t\\tif swap.reverse {\\n\\t\\t\\t\\t\\t\\t\\twant = \\\"\\\"\\n\\t\\t\\t\\t\\t\\t\\tfor j := 0; j < 9; j++ {\\n\\t\\t\\t\\t\\t\\t\\t\\tk := 3*(j%3) + j/3\\n\\t\\t\\t\\t\\t\\t\\t\\twant += geomCase.relate[k : k+1]\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif got != want {\\n\\t\\t\\t\\t\\t\\t\\tt.Errorf(\\\"\\\\nwant: %v\\\\ngot: %v\\\\n\\\", want, got)\\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\\t}\\n}\",\n \"func JB(r operand.Op) { ctx.JB(r) }\",\n \"func (c *compiledField) compileExpr(expr influxql.Expr) error {\\n\\tswitch expr := expr.(type) {\\n\\tcase *influxql.VarRef:\\n\\t\\t// A bare variable reference will require auxiliary fields.\\n\\t\\tc.global.HasAuxiliaryFields = true\\n\\t\\treturn nil\\n\\tcase *influxql.Wildcard:\\n\\t\\t// Wildcards use auxiliary fields. We assume there will be at least one\\n\\t\\t// expansion.\\n\\t\\tc.global.HasAuxiliaryFields = true\\n\\t\\tif !c.AllowWildcard {\\n\\t\\t\\treturn errors.New(\\\"unable to use wildcard in a binary expression\\\")\\n\\t\\t}\\n\\t\\treturn nil\\n\\tcase *influxql.RegexLiteral:\\n\\t\\tif !c.AllowWildcard {\\n\\t\\t\\treturn errors.New(\\\"unable to use regex in a binary expression\\\")\\n\\t\\t}\\n\\t\\tc.global.HasAuxiliaryFields = true\\n\\t\\treturn nil\\n\\tcase *influxql.Call:\\n\\t\\tif isMathFunction(expr) {\\n\\t\\t\\treturn c.compileMathFunction(expr)\\n\\t\\t}\\n\\n\\t\\t// Register the function call in the list of function calls.\\n\\t\\tc.global.FunctionCalls = append(c.global.FunctionCalls, expr)\\n\\n\\t\\tswitch expr.Name {\\n\\t\\tcase \\\"percentile\\\":\\n\\t\\t\\treturn c.compilePercentile(expr.Args)\\n\\t\\tcase \\\"sample\\\":\\n\\t\\t\\treturn c.compileSample(expr.Args)\\n\\t\\tcase \\\"distinct\\\":\\n\\t\\t\\treturn c.compileDistinct(expr.Args, false)\\n\\t\\tcase \\\"top\\\", \\\"bottom\\\":\\n\\t\\t\\treturn c.compileTopBottom(expr)\\n\\t\\tcase \\\"derivative\\\", \\\"non_negative_derivative\\\":\\n\\t\\t\\tisNonNegative := expr.Name == \\\"non_negative_derivative\\\"\\n\\t\\t\\treturn c.compileDerivative(expr.Args, isNonNegative)\\n\\t\\tcase \\\"difference\\\", \\\"non_negative_difference\\\":\\n\\t\\t\\tisNonNegative := expr.Name == \\\"non_negative_difference\\\"\\n\\t\\t\\treturn c.compileDifference(expr.Args, isNonNegative)\\n\\t\\tcase \\\"cumulative_sum\\\":\\n\\t\\t\\treturn c.compileCumulativeSum(expr.Args)\\n\\t\\tcase \\\"moving_average\\\":\\n\\t\\t\\treturn c.compileMovingAverage(expr.Args)\\n\\t\\tcase \\\"exponential_moving_average\\\", \\\"double_exponential_moving_average\\\", \\\"triple_exponential_moving_average\\\", \\\"relative_strength_index\\\", \\\"triple_exponential_derivative\\\":\\n\\t\\t\\treturn c.compileExponentialMovingAverage(expr.Name, expr.Args)\\n\\t\\tcase \\\"kaufmans_efficiency_ratio\\\", \\\"kaufmans_adaptive_moving_average\\\":\\n\\t\\t\\treturn c.compileKaufmans(expr.Name, expr.Args)\\n\\t\\tcase \\\"chande_momentum_oscillator\\\":\\n\\t\\t\\treturn c.compileChandeMomentumOscillator(expr.Args)\\n\\t\\tcase \\\"elapsed\\\":\\n\\t\\t\\treturn c.compileElapsed(expr.Args)\\n\\t\\tcase \\\"integral\\\":\\n\\t\\t\\treturn c.compileIntegral(expr.Args)\\n\\t\\tcase \\\"holt_winters\\\", \\\"holt_winters_with_fit\\\":\\n\\t\\t\\twithFit := expr.Name == \\\"holt_winters_with_fit\\\"\\n\\t\\t\\treturn c.compileHoltWinters(expr.Args, withFit)\\n\\t\\tdefault:\\n\\t\\t\\treturn c.compileFunction(expr)\\n\\t\\t}\\n\\tcase *influxql.Distinct:\\n\\t\\tcall := expr.NewCall()\\n\\t\\tc.global.FunctionCalls = append(c.global.FunctionCalls, call)\\n\\t\\treturn c.compileDistinct(call.Args, false)\\n\\tcase *influxql.BinaryExpr:\\n\\t\\t// Disallow wildcards in binary expressions. RewriteFields, which expands\\n\\t\\t// wildcards, is too complicated if we allow wildcards inside of expressions.\\n\\t\\tc.AllowWildcard = false\\n\\n\\t\\t// Check if either side is a literal so we only compile one side if it is.\\n\\t\\tif _, ok := expr.LHS.(influxql.Literal); ok {\\n\\t\\t\\tif _, ok := expr.RHS.(influxql.Literal); ok {\\n\\t\\t\\t\\treturn errors.New(\\\"cannot perform a binary expression on two literals\\\")\\n\\t\\t\\t}\\n\\t\\t\\treturn c.compileExpr(expr.RHS)\\n\\t\\t} else if _, ok := expr.RHS.(influxql.Literal); ok {\\n\\t\\t\\treturn c.compileExpr(expr.LHS)\\n\\t\\t} else {\\n\\t\\t\\t// Validate both sides of the expression.\\n\\t\\t\\tif err := c.compileExpr(expr.LHS); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\tif err := c.compileExpr(expr.RHS); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\tcase *influxql.ParenExpr:\\n\\t\\treturn c.compileExpr(expr.Expr)\\n\\tcase influxql.Literal:\\n\\t\\treturn errors.New(\\\"field must contain at least one variable\\\")\\n\\t}\\n\\treturn errors.New(\\\"unimplemented\\\")\\n}\",\n \"func TestCheckBinaryExprComplexAndNotComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i &^ 8.0i`, env,\\n\\t\\t`illegal constant expression: untyped number &^ untyped number`,\\n\\t)\\n\\n}\",\n \"func (bo BinaryOperator) EvaluateLeftAndRight(vars map[string]interface{}, ctx interface{}, funcs FunctionMap, quotes []string) (map[string]interface{}, interface{}, interface{}, error) {\\n\\n\\tvars, lv, err := bo.Left.Evaluate(vars, ctx, funcs, quotes)\\n\\tif err != nil {\\n\\t\\treturn vars, false, false, err\\n\\t}\\n\\tvars, rv, err := bo.Right.Evaluate(vars, ctx, funcs, quotes)\\n\\tif err != nil {\\n\\t\\treturn vars, false, false, err\\n\\t}\\n\\treturn vars, lv, rv, nil\\n}\",\n \"func VPBROADCASTQ(ops ...operand.Op) { ctx.VPBROADCASTQ(ops...) }\",\n \"func TestCheckBinaryExprBoolAndNotComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true &^ 8.0i`, env,\\n\\t\\t`cannot convert 8i to type bool`,\\n\\t\\t`invalid operation: true &^ 8i (mismatched types bool and complex128)`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprBoolOrComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true | 8.0i`, env,\\n\\t\\t`cannot convert 8i to type bool`,\\n\\t\\t`invalid operation: true | 8i (mismatched types bool and complex128)`,\\n\\t)\\n\\n}\",\n \"func (parser *Parser) ParseBinOpRHS(exprPrec int, lhs ExprAST) (ExprAST, error) {\\n\\tfor {\\n\\t\\t// If this is a binop, find its precedence.\\n\\t\\tprecedence := parser.tokenPrecedence()\\n\\n\\t\\t// If this is a binop that binds at least as tightly as the current binop,\\n\\t\\t// consume it, otherwise we are done.\\n\\t\\tif precedence < exprPrec {\\n\\t\\t\\treturn lhs, nil\\n\\t\\t}\\n\\n\\t\\t// Okay, we know this is a binop.\\n\\t\\tbinOp := parser.lexer.LastChar\\n\\t\\tparser.Next() // Eat binary operator.\\n\\n\\t\\t// Parse the primary expression after the binary operator.\\n\\t\\trhs, rhsErr := parser.ParsePrimary()\\n\\t\\tif rhsErr != nil {\\n\\t\\t\\treturn nil, rhsErr\\n\\t\\t}\\n\\n\\t\\t// If BinOp binds less tightly with RHS than the operator after RHS, let\\n\\t\\t// the pending operator take RHS as its LHS.\\n\\t\\tnextPrecedence := parser.tokenPrecedence()\\n\\t\\tif precedence < nextPrecedence {\\n\\t\\t\\tvar rhsError error\\n\\t\\t\\trhs, rhsError = parser.ParseBinOpRHS(precedence+1, rhs)\\n\\t\\t\\tif rhsError != nil {\\n\\t\\t\\t\\treturn nil, rhsErr\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Merge LHS/RHS.\\n\\t\\tlhs = &BinaryExprAST{binOp, lhs, rhs}\\n\\t}\\n}\",\n \"func NewBinaryFrame(p []byte) Frame {\\n\\treturn NewFrame(OpBinary, true, p)\\n}\",\n \"func TestCheckBinaryExprComplexOrBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i | true`, env,\\n\\t\\t`cannot convert true to type complex128`,\\n\\t\\t`invalid operation: 8i | true (mismatched types complex128 and bool)`,\\n\\t)\\n\\n}\",\n \"func BinaryCommit(G, b *RingMartix, Ba, Bra int) (A, B, ra, rb, a *RingMartix, err error) {\\n\\tnttParams := settings.nttParams\\n\\tseed := time.Now().UnixNano() // may consider more secure seeds\\n\\n\\t// build a\\n\\ta, err = NewRingMartix(b.col, 1, nttParams)\\n\\tif a == nil {\\n\\t\\terr = errors.New(\\\"NewRingMartix fail\\\")\\n\\t\\treturn\\n\\t}\\n\\ta.SetRandomBRingMartix(&b.ringvectors[0].rings[0], seed, settings.d, Ba, true)\\n\\n\\tA, B, ra, rb, err = BinaryCommitWithA(G, a, b, Ba, Bra)\\n\\treturn\\n}\",\n \"func TestCheckBinaryExprBoolAndBool(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true & true`, env,\\n\\t\\t`invalid operation: true & true (operator & not defined on bool)`,\\n\\t)\\n\\n}\",\n \"func BinaryCommitWithA(G, a, b *RingMartix, Ba, Bra int) (A, B, ra, rb *RingMartix, err error) {\\n\\tnttParams := settings.nttParams\\n\\n\\t// build c\\n\\tc, err := NewRingMartix(b.col, 1, nttParams)\\n\\tif c == nil {\\n\\t\\terr = errors.New(\\\"NewRingMartix fail\\\")\\n\\t\\treturn\\n\\t}\\n\\tc.SetRingMartix(&b.ringvectors[0].rings[0])\\n\\n\\tcoeffs := make([]bigint.Int, settings.d)\\n\\tcoeffs[0].SetInt(int64(1))\\n\\tonering, _ := ring.CopyRing(&b.ringvectors[0].rings[0])\\n\\t_ = onering.Poly.SetCoefficients(coeffs)\\n\\n\\tnonering, _ := ring.CopyRing(onering)\\n\\tcoeffs[0].SetInt(int64(-1))\\n\\t_ = nonering.Poly.SetCoefficients(coeffs)\\n\\n\\tntworing, _ := ring.CopyRing(onering)\\n\\tcoeffs[0].SetInt(int64(-2))\\n\\t_ = ntworing.Poly.SetCoefficients(coeffs)\\n\\n\\t// c = (-2 * b + 1) * a\\n\\t_, err = c.RingMatScalarMul(ntworing, b)\\n\\t_, err = c.RingMatScalarAdd(onering, c)\\n\\t_, err = c.RingMatHadamardProd(c, a)\\n\\n\\t// build d\\n\\td, err := NewRingMartix(b.col, 1, nttParams)\\n\\tif d == nil {\\n\\t\\terr = errors.New(\\\"NewRingMartix fail\\\")\\n\\t\\treturn\\n\\t}\\n\\td.SetRingMartix(&b.ringvectors[0].rings[0])\\n\\n\\t// d = 0 - a^2\\n\\t_, err = d.RingMatHadamardProd(a, a)\\n\\t_, err = d.RingMatScalarMul(nonering, d)\\n\\n\\t// bc = (b, c)\\n\\tbc, err := NewRingMartix(b.col + c.col, 1, nttParams)\\n\\tif bc == nil {\\n\\t\\terr = errors.New(\\\"NewRingMartix fail\\\")\\n\\t\\treturn\\n\\t}\\n\\n\\t_, err = bc.RingMatCombine(b, c)\\n\\tB, rb, err = Commitment(G, bc, settings.B)\\n\\n\\t// ad = (a, d)\\n\\tad, err := NewRingMartix(a.col + d.col, 1, nttParams)\\n\\tif ad == nil {\\n\\t\\terr = errors.New(\\\"NewRingMartix fail\\\")\\n\\t\\treturn\\n\\t}\\n\\n\\t_, err = ad.RingMatCombine(a, d)\\n\\tA, ra, err = Commitment(G, ad, Bra)\\n\\n\\treturn\\n}\",\n \"func TestCheckBinaryExprIntAddComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectConst(t, `4 + 8.0i`, env, NewConstComplex128(4 + 8.0i), ConstComplex)\\n}\",\n \"func PADDSB(mx, x operand.Op) { ctx.PADDSB(mx, x) }\",\n \"func (r FieldRule) ValidateBinaryExpr(expr *ast.BinaryExpr) error {\\n\\tbatchError := pepperlint.NewBatchError()\\n\\n\\tif errs := r.checkBinaryExprFields(expr); len(errs) > 0 {\\n\\t\\tbatchError.Add(errs...)\\n\\t}\\n\\n\\treturn batchError.Return()\\n}\",\n \"func TestCheckBinaryExprComplexEqlInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectConst(t, `8.0i == 4`, env, (8.0i == 4), ConstBool)\\n}\",\n \"func TestCheckBinaryExprComplexAddComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectConst(t, `8.0i + 8.0i`, env, NewConstComplex128(8.0i + 8.0i), ConstComplex)\\n}\",\n \"func TestCheckBinaryExprBoolAndNotInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `true &^ 4`, env,\\n\\t\\t`cannot convert 4 to type bool`,\\n\\t\\t`invalid operation: true &^ 4 (mismatched types bool and int)`,\\n\\t)\\n\\n}\",\n \"func TestCheckBinaryExprComplexOrComplex(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectCheckError(t, `8.0i | 8.0i`, env,\\n\\t\\t`illegal constant expression: untyped number | untyped number`,\\n\\t)\\n\\n}\",\n \"func addb(context *Context) {\\n x := context.opcode & 0x0F00 >> 8\\n b := byte(context.opcode & 0x00FF)\\n context.cpu.v[x] += b\\n context.cpu.pc += 2\\n}\",\n \"func TestCheckBinaryExprIntAddInt(t *testing.T) {\\n\\tenv := MakeSimpleEnv()\\n\\n\\texpectConst(t, `4 + 4`, env, NewConstInt64(4 + 4), ConstInt)\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66887915","0.62147105","0.61825645","0.5908567","0.58572567","0.5844639","0.5791973","0.57730836","0.57260466","0.56870455","0.5641738","0.5616734","0.55070674","0.5478003","0.54041564","0.53786176","0.5364959","0.52595145","0.5206847","0.51054","0.510294","0.5072614","0.503414","0.5011863","0.4992927","0.49677658","0.4943081","0.49370748","0.4913006","0.4904132","0.49011308","0.48455885","0.484401","0.48234904","0.48225743","0.47749567","0.47457102","0.47423515","0.4739557","0.47125584","0.4706054","0.46842414","0.46784502","0.4663298","0.46530795","0.46482033","0.4641348","0.4640978","0.4635788","0.4632993","0.4616027","0.45969278","0.45958248","0.45801002","0.45773083","0.4576657","0.45694095","0.45552596","0.45440447","0.45415995","0.45375407","0.453282","0.45324507","0.4526512","0.45243818","0.45183945","0.45180494","0.45159644","0.45125183","0.45063463","0.45044953","0.45024386","0.45003262","0.44970006","0.44783014","0.44781074","0.447647","0.4474526","0.4466805","0.4466619","0.44563955","0.4449767","0.44296896","0.4428595","0.44189575","0.44154608","0.4408912","0.44041198","0.44029462","0.4401049","0.4397541","0.43836278","0.43788815","0.43752378","0.43733907","0.43703791","0.43703055","0.4368333","0.43681952","0.43630362"],"string":"[\n \"0.66887915\",\n \"0.62147105\",\n \"0.61825645\",\n \"0.5908567\",\n \"0.58572567\",\n \"0.5844639\",\n \"0.5791973\",\n \"0.57730836\",\n \"0.57260466\",\n \"0.56870455\",\n \"0.5641738\",\n \"0.5616734\",\n \"0.55070674\",\n \"0.5478003\",\n \"0.54041564\",\n \"0.53786176\",\n \"0.5364959\",\n \"0.52595145\",\n \"0.5206847\",\n \"0.51054\",\n \"0.510294\",\n \"0.5072614\",\n \"0.503414\",\n \"0.5011863\",\n \"0.4992927\",\n \"0.49677658\",\n \"0.4943081\",\n \"0.49370748\",\n \"0.4913006\",\n \"0.4904132\",\n \"0.49011308\",\n \"0.48455885\",\n \"0.484401\",\n \"0.48234904\",\n \"0.48225743\",\n \"0.47749567\",\n \"0.47457102\",\n \"0.47423515\",\n \"0.4739557\",\n \"0.47125584\",\n \"0.4706054\",\n \"0.46842414\",\n \"0.46784502\",\n \"0.4663298\",\n \"0.46530795\",\n \"0.46482033\",\n \"0.4641348\",\n \"0.4640978\",\n \"0.4635788\",\n \"0.4632993\",\n \"0.4616027\",\n \"0.45969278\",\n \"0.45958248\",\n \"0.45801002\",\n \"0.45773083\",\n \"0.4576657\",\n \"0.45694095\",\n \"0.45552596\",\n \"0.45440447\",\n \"0.45415995\",\n \"0.45375407\",\n \"0.453282\",\n \"0.45324507\",\n \"0.4526512\",\n \"0.45243818\",\n \"0.45183945\",\n \"0.45180494\",\n \"0.45159644\",\n \"0.45125183\",\n \"0.45063463\",\n \"0.45044953\",\n \"0.45024386\",\n \"0.45003262\",\n \"0.44970006\",\n \"0.44783014\",\n \"0.44781074\",\n \"0.447647\",\n \"0.4474526\",\n \"0.4466805\",\n \"0.4466619\",\n \"0.44563955\",\n \"0.4449767\",\n \"0.44296896\",\n \"0.4428595\",\n \"0.44189575\",\n \"0.44154608\",\n \"0.4408912\",\n \"0.44041198\",\n \"0.44029462\",\n \"0.4401049\",\n \"0.4397541\",\n \"0.43836278\",\n \"0.43788815\",\n \"0.43752378\",\n \"0.43733907\",\n \"0.43703791\",\n \"0.43703055\",\n \"0.4368333\",\n \"0.43681952\",\n \"0.43630362\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.79556304"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":2798,"cells":{"query":{"kind":"string","value":"extractTags extracts a tag key/value map from a statement. Extracted tags are removed from the statement."},"document":{"kind":"string","value":"func (p *Planner) extractTags(name string, expr Expr, tags map[string]string) (Expr, error) {\n\t// TODO: Refactor into a walk-like Replace().\n\tswitch expr := expr.(type) {\n\tcase *BinaryExpr:\n\t\t// If the LHS is a variable ref then check for tag equality.\n\t\tif lhs, ok := expr.LHS.(*VarRef); ok && expr.Op == EQ {\n\t\t\treturn p.extractBinaryExprTags(name, expr, lhs, expr.RHS, tags)\n\t\t}\n\n\t\t// If the RHS is a variable ref then check for tag equality.\n\t\tif rhs, ok := expr.RHS.(*VarRef); ok && expr.Op == EQ {\n\t\t\treturn p.extractBinaryExprTags(name, expr, rhs, expr.LHS, tags)\n\t\t}\n\n\t\t// Recursively process LHS.\n\t\tlhs, err := p.extractTags(name, expr.LHS, tags)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr.LHS = lhs\n\n\t\t// Recursively process RHS.\n\t\trhs, err := p.extractTags(name, expr.RHS, tags)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr.RHS = rhs\n\n\t\treturn expr, nil\n\n\tcase *ParenExpr:\n\t\te, err := p.extractTags(name, expr.Expr, tags)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr.Expr = e\n\t\treturn expr, nil\n\n\tdefault:\n\t\treturn expr, nil\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func Extract(ctx context.Context) *Tags {\n\tt, ok := ctx.Value(ctxMarkerKey).(*Tags)\n\tif !ok {\n\t\treturn &Tags{values: make(map[string]interface{})}\n\t}\n\n\treturn t\n}","func (r serverResult) ExtractTags() ([]string, error) {\n\tvar s struct {\n\t\tTags []string `json:\"tags\"`\n\t}\n\terr := r.ExtractInto(&s)\n\treturn s.Tags, err\n}","func extractTagValues(regex *regexp.Regexp, tagList []string, input string) api.TagSet {\n\tmatches := regex.FindStringSubmatch(input)\n\tif matches == nil {\n\t\treturn nil\n\t}\n\ttagSet := api.NewTagSet()\n\tfor index, tagValue := range matches {\n\t\tif index == 0 {\n\t\t\tcontinue\n\t\t}\n\t\ttagKey := tagList[index-1]\n\t\ttagSet[tagKey] = tagValue\n\t}\n\treturn tagSet\n}","func parseTags(st reflect.StructTag) tags {\n\ts := st.Get(ndrNameSpace)\n\tt := tags{\n\t\tValues: []string{},\n\t\tMap: make(map[string]string),\n\t}\n\tif s != \"\" {\n\t\tndrTags := strings.Trim(s, `\"`)\n\t\tfor _, tag := range strings.Split(ndrTags, \",\") {\n\t\t\tif strings.Contains(tag, \":\") {\n\t\t\t\tm := strings.SplitN(tag, \":\", 2)\n\t\t\t\tt.Map[m[0]] = m[1]\n\t\t\t} else {\n\t\t\t\tt.Values = append(t.Values, tag)\n\t\t\t}\n\t\t}\n\t}\n\treturn t\n}","func (t SemanticTagsTechnique) Extract(html string) DirtyExtracted {\n\textracted := GetEmptyDirtyExtracted()\n\tt.setName(\"SemanticTagsTechnique\")\n\tdoc, err := goquery.NewDocumentFromReader(strings.NewReader(html))\n\tif err != nil {\n\t\treturn extracted\n\t}\n\n\textractStr := *t.getExtractString()\n\textractAttr := *t.getExtractAttribute()\n\tfor _, val := range extractStr {\n\t\tdoc.Find(val.tag).EachWithBreak(func(i int, selection *goquery.Selection) bool {\n\t\t\tif i < val.maxStores {\n\t\t\t\textracted[val.dest] = append(extracted[val.dest], selection.Text())\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn false\n\t\t})\n\t}\n\n\tfor _, val := range extractAttr {\n\t\tdoc.Find(val.tag).EachWithBreak(func(i int, selection *goquery.Selection) bool {\n\t\t\tif i < val.maxStores {\n\t\t\t\tif attr, ok := selection.Attr(val.attr); ok {\n\t\t\t\t\textracted[val.dest] = append(extracted[val.dest], attr)\n\t\t\t\t}\n\t\t\t\treturn true\n\t\t\t}\n\t\t\treturn false\n\t\t})\n\t}\n\treturn extracted\n}","func (p *Planner) extractBinaryExprTags(name string, expr Expr, ref *VarRef, value Expr, tags map[string]string) (Expr, error) {\n\t// Ignore if the value is not a string literal.\n\tlit, ok := value.(*StringLiteral)\n\tif !ok {\n\t\treturn expr, nil\n\t}\n\n\t// Extract the key and remove the measurement prefix.\n\tkey := strings.TrimPrefix(ref.Val, name+\".\")\n\n\t// If tag is already filtered then return error.\n\tif _, ok := tags[key]; ok {\n\t\treturn nil, fmt.Errorf(\"duplicate tag filter: %s.%s\", name, key)\n\t}\n\n\t// Add tag to the filter.\n\ttags[key] = lit.Val\n\n\t// Return nil to remove the expression.\n\treturn nil, nil\n}","func parseTags(tag string) (ret block.Dict) {\n\tif len(tag) > 0 {\n\t\ttags := make(block.Dict)\n\t\tvisitTags(tag, func(k, v string) {\n\t\t\ttags[k] = parseCommas(v)\n\t\t})\n\t\tret = tags\n\t}\n\treturn\n}","func parseTag(stag StructTag) map[string]string {\n\ttag := string(stag)\n\tm := make(map[string]string)\n\tfor tag != \"\" {\n\t\ti := 0\n\t\tfor i < len(tag) && tag[i] == ' ' {\n\t\t\ti += 1\n\t\t}\n\t\ttag = tag[i:]\n\t\tif tag == \"\" {\n\t\t\tbreak\n\t\t}\n\n\t\ti = 0\n\t\tfor i < len(tag) && tag[i] > ' ' && tag[i] != ':' && tag[i] != '\"' && tag[i] != 0x7f {\n\t\t\ti++\n\t\t}\n\t\tif i == 0 || i+1 >= len(tag) || tag[i] != ':' || tag[i+1] != '\"' {\n\t\t\tbreak\n\t\t}\n\t\tname := string(tag[:i])\n\t\ttag = tag[i+1:]\n\n\t\ti = 1\n\t\tfor i < len(tag) && tag[i] != '\"' {\n\t\t\tif tag[i] == '\\\\' {\n\t\t\t\ti++\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t\tif i >= len(tag) {\n\t\t\tbreak\n\t\t}\n\t\tqvalue := string(tag[:i+1])\n\t\ttag = tag[i+1:]\n\n\t\tvalue, err := strconv.Unquote(qvalue)\n\t\tif err != nil {\n\t\t\tcontinue\n\t\t\tm[name] = value\n\t\t}\n\t\treturn m\n\t}\n\treturn m\n}","func tagKeysToMap(tags string) map[string]*string {\n\toutput := make(map[string]*string)\n\n\tfor _, tag := range strings.Split(strings.TrimSpace(tags), \",\") {\n\t\tsplit := strings.SplitN(tag, \"=\", 2)\n\t\tkey := strings.TrimSpace(split[0])\n\t\tvalue := \"\"\n\n\t\tif key == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tif len(split) > 1 {\n\t\t\tvalue = strings.TrimSpace(split[1])\n\t\t}\n\n\t\toutput[key] = &value\n\t}\n\n\tif len(output) == 0 {\n\t\treturn nil\n\t}\n\n\treturn output\n}","func (t HTML5SemanticTagsTechnique) Extract(html string) DirtyExtracted {\n\textracted := GetEmptyDirtyExtracted()\n\tt.setName(\"HTML5SemanticTagsTechnique\")\n\n\tdoc, err := goquery.NewDocumentFromReader(strings.NewReader(html))\n\tif err != nil {\n\t\treturn extracted\n\t}\n\n\tdoc.Find(\"article\").Each(func(i int, selection *goquery.Selection) {\n\t\tif title := selection.Find(\"h1\").Text(); title != EmptyString {\n\t\t\textracted[TitlesField] = append(extracted[TitlesField], title)\n\t\t}\n\t\tif desc := selection.Find(\"p\").Text(); desc != EmptyString {\n\t\t\textracted[DescriptionsField] = append(extracted[DescriptionsField], desc)\n\t\t}\n\t})\n\n\tdoc.Find(\"video\").Each(func(i int, selection *goquery.Selection) {\n\t\tselection.Find(\"source\").Each(func(i int, selection *goquery.Selection) {\n\t\t\tif src, ok := selection.Attr(\"src\"); ok {\n\t\t\t\textracted[VideosField] = append(extracted[VideosField], src)\n\t\t\t}\n\t\t})\n\t})\n\treturn extracted\n}","func ExtractEntries(parserInfo []plugins.Entries, trigger string) map[string]string {\n\tentries := make(map[string]string)\n\n\tvar parser metatools.Parser\n\tparser.Init(trigger)\n\n\tfmt.Println(\"extracting extries for sentence : \", trigger)\n\tfor _, e := range parserInfo {\n\t\tres := e.Resources.(map[string]interface{})\n\t\tswitch e.Parser {\n\t\tcase \"before\":\n\t\t\tentries[e.Name] = parser.Before(res[\"key\"].(string), int(res[\"x\"].(float64)))\n\t\tcase \"after\":\n\t\t\tentries[e.Name] = parser.After(res[\"key\"].(string), int(res[\"x\"].(float64)))\n\t\tcase \"between\":\n\t\t\tentries[e.Name] = parser.Between(res[\"after\"].(string), res[\"before\"].(string), int(res[\"x\"].(float64)), int(res[\"y\"].(float64)))\n\t\t}\n\t}\n\treturn entries\n}","func (it *Regex) TagResults(dst map[string]graph.Value) {\n\tfor _, tag := range it.tags.Tags() {\n\t\tdst[tag] = it.Result()\n\t}\n\n\tfor tag, value := range it.tags.Fixed() {\n\t\tdst[tag] = value\n\t}\n\n\tit.subIt.TagResults(dst)\n}","func (e *Extractor) FieldValueFromTagMap(tag string) (out map[string]interface{}, err error) {\n\n\tif err := e.isValidStruct(); err != nil {\n\t\treturn nil, err\n\t}\n\n\tout = make(map[string]interface{})\n\ts := reflect.ValueOf(e.StructAddr).Elem()\n\tfields := e.fields(s)\n\n\tfor _, field := range fields {\n\t\tif val, ok := field.tags.Lookup(tag); ok {\n\t\t\tkey, omit := e.parseOmitempty(val, field.value)\n\t\t\tif omit {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tout[key] = field.value.Interface()\n\t\t}\n\n\t}\n\n\treturn\n}","func extractTags(txt string) []string {\n\ttags := []string{}\n\tfor _, match := range TagsRx.FindAllStringSubmatch(txt, -1) {\n\t\ttags = append(tags, strings.TrimLeft(match[1], \"#\"))\n\t}\n\treturn tags\n}","func (conjure *Conjure) extract(inheritance *handler.ConjureFileHandler, targetFile []byte, targetTag string) []byte {\n\tvar tags []string\n\tvar groupId string\n\n\tfor _, group := range inheritance.Config.Groups {\n\t\tgroupId, tags = internal.ExtractIdTag(group.Id)\n\n\t\tif tags == nil {\n\t\t\t// and any groups with no tags\n\t\t\ttags = append(tags, \"\")\n\t\t}\n\n\t\tfor _, tag := range tags {\n\t\t\tif tag == targetTag {\n\t\t\t\tfor _, item := range group.Items {\n\t\t\t\t\tval := reflect.ValueOf(item.Value)\n\t\t\t\t\tre := regexp.MustCompile(fmt.Sprintf(`\\${.*(?:%s\\.%s).*}`, groupId, item.Id))\n\t\t\t\t\tswitch val.Kind() {\n\t\t\t\t\tcase reflect.Int, reflect.Int64, reflect.Int32:\n\t\t\t\t\t\ttargetFile = re.ReplaceAll(targetFile, []byte(strconv.FormatInt(val.Int(), 10)))\n\t\t\t\t\tcase reflect.String:\n\t\t\t\t\t\ttargetFile = re.ReplaceAll(targetFile, []byte(val.String()))\n\t\t\t\t\tcase reflect.Array, reflect.Slice, reflect.Interface:\n\t\t\t\t\t\tvar out string\n\t\t\t\t\t\tfor i := 0; i < val.Len(); i++ {\n\t\t\t\t\t\t\tswitch val.Index(i).Kind() {\n\t\t\t\t\t\t\tcase reflect.Interface:\n\t\t\t\t\t\t\t\tout += fmt.Sprintf(\"%s,\", val.Index(i).Interface().(string))\n\t\t\t\t\t\t\tcase reflect.Int, reflect.Int64, reflect.Int32:\n\t\t\t\t\t\t\t\tout += fmt.Sprintf(\"%s,\", strconv.FormatInt(val.Index(i).Int(), 10))\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttargetFile = re.ReplaceAll(targetFile, []byte(fmt.Sprintf(\"[%s]\", out[:len(out)-1])))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}\n\n\treturn targetFile\n}","func ParseTags(in string) (map[string]string, error) {\n\tout := map[string]string{}\n\n\tfor _, entry := range strings.Split(in, \",\") {\n\t\tentry = strings.TrimSpace(entry)\n\t\tif entry == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tfields := strings.SplitN(entry, \":\", 2)\n\t\tif len(fields) < 2 {\n\t\t\treturn nil, fmt.Errorf(\"Invalid tag: %s\", entry)\n\t\t}\n\n\t\t_, ok := out[fields[0]]\n\t\tif ok {\n\t\t\treturn nil, fmt.Errorf(\"Duplicate tag: %s\", entry)\n\t\t}\n\n\t\tout[fields[0]] = fields[1]\n\t}\n\n\treturn out, nil\n}","func ExtractMetaTags(doc *goquery.Document, prefix string) (Map, error) {\n\tm := Map{}\n\t// now get open graph tags\n\tdoc.Find(\"meta\").Each(func(i int, s *goquery.Selection) {\n\t\tif name, _ := s.Attr(\"property\"); strings.HasPrefix(name, prefix) {\n\t\t\tvalue, _ := s.Attr(\"content\")\n\t\t\tname = strings.TrimSpace(strings.TrimPrefix(name, prefix))\n\t\t\tvalue = strings.TrimSpace(value)\n\t\t\tif value != \"\" && name != \"\" {\n\t\t\t\tm[name] = value\n\t\t\t}\n\t\t}\n\t})\n\treturn m, nil\n}","func ExtractVariables(configDict map[string]interface{}, pattern *regexp.Regexp) map[string]string {\n\tif pattern == nil {\n\t\tpattern = defaultPattern\n\t}\n\treturn recurseExtract(configDict, pattern)\n}","func (sm *SpecMore) TagsMap(inclTop, inclOps bool) map[string]int {\n\ttagsMap := map[string]int{}\n\tif inclTop {\n\t\tfor _, tag := range sm.Spec.Tags {\n\t\t\ttagName := strings.TrimSpace(tag.Name)\n\t\t\tif len(tagName) > 0 {\n\t\t\t\tif _, ok := tagsMap[tagName]; !ok {\n\t\t\t\t\ttagsMap[tagName] = 0\n\t\t\t\t}\n\t\t\t\ttagsMap[tagName]++\n\t\t\t}\n\t\t}\n\t}\n\tif inclOps {\n\t\tVisitOperations(sm.Spec, func(skipPath, skipMethod string, op *oas3.Operation) {\n\t\t\tfor _, tagName := range op.Tags {\n\t\t\t\ttagName = strings.TrimSpace(tagName)\n\t\t\t\tif len(tagName) > 0 {\n\t\t\t\t\tif _, ok := tagsMap[tagName]; !ok {\n\t\t\t\t\t\ttagsMap[tagName] = 0\n\t\t\t\t\t}\n\t\t\t\t\ttagsMap[tagName]++\n\t\t\t\t}\n\t\t\t}\n\t\t})\n\t}\n\treturn tagsMap\n}","func copyTags(tags map[string]string) map[string]string {\n\tnewTags := make(map[string]string)\n\tfor k, v := range tags {\n\t\tnewTags[k] = v\n\t}\n\treturn newTags\n}","func mapTags(tags []*elb.Tag) map[string]string {\n\ttagMap := make(map[string]string)\n\tfor _, t := range tags {\n\t\ttagMap[*t.Key] = *t.Value\n\t}\n\n\treturn tagMap\n}","func BuildTagMapping(structTemplatePointer interface{}, mappedKeyTag string, resultExclusionTag string, inheritKeyFromField bool, convertKeyToLowerCase bool, tags []string) map[string](map[string]string) {\n\treflectStructType := DiscoverTypeByKind(structTemplatePointer, reflect.Struct)\n\tvar result = make(map[string]map[string]string)\n\tvar anonymousMappings = make(map[string]map[string]string)\n\n\tfor i := 0; i < reflectStructType.NumField(); i++ {\n\t\tvar field reflect.StructField\n\t\tfield = reflectStructType.Field(i)\n\t\tkey := getTagValues(field, mappedKeyTag)\n\n\t\tif field.Anonymous && key == \"\" {\n\t\t\tvar anonymousType = DereferenceType(field.Type)\n\t\t\tif anonymousType.Kind() == reflect.Struct {\n\t\t\t\tanonymousMapping := BuildTagMapping(reflect.New(anonymousType).Interface(), mappedKeyTag, resultExclusionTag, inheritKeyFromField, convertKeyToLowerCase, tags)\n\t\t\t\tfor k, v := range anonymousMapping {\n\t\t\t\t\tanonymousMappings[k] = v\n\t\t\t\t\tanonymousMappings[k][anonymousKey] = \"true\"\n\t\t\t\t\tanonymousMappings[k][fieldIndexKey] = AsString(i)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcontinue\n\t\t}\n\n\t\tisTransient := strings.EqualFold(field.Tag.Get(resultExclusionTag), \"true\")\n\t\tif isTransient {\n\t\t\tcontinue\n\t\t}\n\n\t\tif key == \"\" {\n\t\t\tif !inheritKeyFromField {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tkey = field.Name\n\t\t}\n\n\t\tif convertKeyToLowerCase {\n\t\t\tkey = strings.ToLower(key)\n\t\t}\n\n\t\tresult[key] = make(map[string]string)\n\t\tfor _, tag := range tags {\n\t\t\ttagValue := field.Tag.Get(tag)\n\t\t\tif len(tagValue) > 0 {\n\t\t\t\tresult[key][tag] = tagValue\n\t\t\t}\n\t\t}\n\t\tresult[key][fieldNameKey] = field.Name\n\t}\n\n\tfor k, v := range anonymousMappings {\n\t\tif _, has := result[k]; !has {\n\t\t\tresult[k] = v\n\t\t}\n\t}\n\treturn result\n}","func (t *TagExtracter) ExtractTags(text string, topK int) (tags Segments) {\n\tfreqMap := make(map[string]float64)\n\n\tfor _, w := range t.seg.Cut(text, true) {\n\t\tw = strings.TrimSpace(w)\n\t\tif utf8.RuneCountInString(w) < 2 {\n\t\t\tcontinue\n\t\t}\n\t\tif t.stopWord.IsStopWord(w) {\n\t\t\tcontinue\n\t\t}\n\n\t\tif f, ok := freqMap[w]; ok {\n\t\t\tfreqMap[w] = f + 1.0\n\t\t} else {\n\t\t\tfreqMap[w] = 1.0\n\t\t}\n\t}\n\n\ttotal := 0.0\n\tfor _, freq := range freqMap {\n\t\ttotal += freq\n\t}\n\n\tfor k, v := range freqMap {\n\t\tfreqMap[k] = v / total\n\t}\n\n\tws := make(Segments, 0)\n\tvar s Segment\n\tfor k, v := range freqMap {\n\t\tif freq, _, ok := t.Idf.Freq(k); ok {\n\t\t\ts = Segment{text: k, weight: freq * v}\n\t\t} else {\n\t\t\ts = Segment{text: k, weight: t.Idf.median * v}\n\t\t}\n\t\tws = append(ws, s)\n\t}\n\n\tsort.Sort(sort.Reverse(ws))\n\n\tif len(ws) > topK {\n\t\ttags = ws[:topK]\n\t\treturn\n\t}\n\n\ttags = ws\n\treturn\n}","func (e *Extractor) TagMapping(from, to string) (out map[string]string, err error) {\n\tif err := e.isValidStruct(); err != nil {\n\t\treturn nil, err\n\t}\n\n\tout = make(map[string]string)\n\ts := reflect.ValueOf(e.StructAddr).Elem()\n\tfields := e.fields(s)\n\n\tfor _, field := range fields {\n\t\tfromTag, fromOk := field.tags.Lookup(from)\n\t\ttoTag, toOk := field.tags.Lookup(to)\n\t\tif toOk && fromOk {\n\t\t\tout[fromTag] = toTag\n\t\t}\n\t}\n\n\treturn\n}","func extractTags(pattern string) []string {\n\tif len(pattern) == 0 {\n\t\treturn nil // empty pattern is not allowed.\n\t}\n\tsplitted := strings.Split(pattern, \"%\")\n\tif len(splitted)%2 == 0 {\n\t\treturn nil // invalid tags.\n\t}\n\n\tresult := make([]string, len(splitted)/2, len(splitted)/2)\n\tfor index, token := range splitted {\n\t\tif isTagPortion(index) {\n\t\t\tif len(token) == 0 {\n\t\t\t\treturn nil // no empty tag\n\t\t\t}\n\t\t\tresult[index/2] = token\n\t\t}\n\t}\n\n\t// check for duplicates.\n\texists := make(map[string]bool)\n\tfor _, token := range result {\n\t\tif exists[token] {\n\t\t\treturn nil // no duplicate\n\t\t}\n\t\texists[token] = true\n\t}\n\treturn result\n}","func getTagsForEntries(entries data.Entries) []string {\n\tmapping := make(map[string]bool)\n\tfor _, entry := range entries {\n\t\tfor _, tag := range entry.Tags {\n\t\t\tmapping[tag] = true\n\t\t}\n\t}\n\treturn go_utils.MapToArray(mapping)\n}","func TagsDiff(sqsTags map[string]string, newTags map[string]string) (removed, added map[string]string) {\n\tremoved = map[string]string{}\n\tfor k, v := range sqsTags {\n\t\tif _, ok := newTags[k]; !ok {\n\t\t\tremoved[k] = v\n\t\t}\n\t}\n\n\tadded = map[string]string{}\n\tfor k, newV := range newTags {\n\t\tif oldV, ok := sqsTags[k]; !ok || oldV != newV {\n\t\t\tadded[k] = newV\n\t\t}\n\t}\n\treturn\n}","func (e *endpoint) extract(sel *goquery.Selection) result {\n\tr := result{}\n\tfor field, ext := range e.Result {\n\t\tif v := ext.execute(sel); v != \"\" {\n\t\t\tr[field] = v\n\t\t\t// log.Printf(\"%s: %s\", field, v)\n\t\t}\n\t}\n\treturn r\n}","func ParseTags(line string) Tags {\n\tret := Tags{}\n\n\ttags := strings.Split(line, \";\")\n\tfor _, tag := range tags {\n\t\tparts := strings.SplitN(tag, \"=\", 2)\n\t\tif len(parts) < 2 {\n\t\t\tret[parts[0]] = \"\"\n\t\t\tcontinue\n\t\t}\n\n\t\tret[parts[0]] = ParseTagValue(parts[1])\n\t}\n\n\treturn ret\n}","func (it *AllIterator) TagResults(dst map[string]graph.Value) {\n\tfor _, tag := range it.tags.Tags() {\n\t\tdst[tag] = it.Result()\n\t}\n\n\tfor tag, value := range it.tags.Fixed() {\n\t\tdst[tag] = value\n\t}\n}","func (aiService *AppinsightsMonitorService) getTags(tagType string, name string) map[string]*string {\n\n\ttags := make(map[string]*string)\n\n\tcomponentHiddenlink := fmt.Sprintf(\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/components/%s\", aiService.subscriptionID, aiService.resourceGroup, aiService.name)\n\twebtestHiddenlink := fmt.Sprintf(\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/webtests/%s\", aiService.subscriptionID, aiService.resourceGroup, name)\n\tvalue := \"Resource\"\n\n\tif tagType == \"webtest\" {\n\t\ttags[componentHiddenlink] = &value\n\t}\n\n\tif tagType == \"alert\" {\n\n\t\ttags[componentHiddenlink] = &value\n\t\ttags[webtestHiddenlink] = &value\n\t}\n\n\treturn tags\n}","func (point *Point) GetTags(noarray bool, separator string) map[string]string {\n\ttags := map[string]string{}\n\ttags[\"vcenter\"] = point.VCenter\n\ttags[\"type\"] = point.ObjectType\n\ttags[\"name\"] = point.ObjectName\n\tif noarray {\n\t\tif len(point.Datastore) > 0 {\n\t\t\ttags[\"datastore\"] = point.Datastore[0]\n\t\t}\n\t} else {\n\t\tif len(point.Datastore) > 0 {\n\t\t\ttags[\"datastore\"] = strings.Join(point.Datastore, separator)\n\t\t}\n\t}\n\tif noarray {\n\t\tif len(point.Network) > 0 {\n\t\t\ttags[\"network\"] = point.Network[0]\n\t\t}\n\t} else {\n\t\tif len(point.Network) > 0 {\n\t\t\ttags[\"network\"] = strings.Join(point.Network, separator)\n\t\t}\n\t}\n\tif len(point.ESXi) > 0 {\n\t\ttags[\"host\"] = point.ESXi\n\t}\n\tif len(point.Cluster) > 0 {\n\t\ttags[\"cluster\"] = point.Cluster\n\t}\n\tif len(point.Instance) > 0 {\n\t\ttags[\"instance\"] = point.Instance\n\t}\n\tif len(point.ResourcePool) > 0 {\n\t\ttags[\"resourcepool\"] = point.ResourcePool\n\t}\n\tif len(point.Folder) > 0 {\n\t\ttags[\"folder\"] = point.Folder\n\t}\n\tif noarray {\n\t\tif len(point.ViTags) > 0 {\n\t\t\ttags[\"vitags\"] = point.ViTags[0]\n\t\t}\n\t} else {\n\t\tif len(point.ViTags) > 0 {\n\t\t\ttags[\"vitags\"] = strings.Join(point.ViTags, separator)\n\t\t}\n\t}\n\t/*\n\t\tif point.NumCPU != 0 {\n\t\t\ttags[\"numcpu\"] = strconv.FormatInt(int64(point.NumCPU), 10)\n\t\t}\n\t\tif point.MemorySizeMB != 0 {\n\t\t\ttags[\"memorysizemb\"] = strconv.FormatInt(int64(point.MemorySizeMB), 10)\n\t\t}\n\t*/\n\treturn tags\n}","func (src *prometheusMetricsSource) buildTags(m *dto.Metric) map[string]string {\n\tresult := map[string]string{}\n\tfor k, v := range src.tags {\n\t\tif len(v) > 0 {\n\t\t\tresult[k] = v\n\t\t}\n\t}\n\tfor _, lp := range m.Label {\n\t\tif len(lp.GetValue()) > 0 {\n\t\t\tresult[lp.GetName()] = lp.GetValue()\n\t\t}\n\t}\n\treturn result\n}","func (e *Extractor) ValuesFromTag(tag string) (out []interface{}, err error) {\n\n\tif err := e.isValidStruct(); err != nil {\n\t\treturn nil, err\n\t}\n\n\ts := reflect.ValueOf(e.StructAddr).Elem()\n\tfields := e.fields(s)\n\n\tfor _, field := range fields {\n\t\tif val, ok := field.tags.Lookup(tag); ok {\n\t\t\tif _, omit := e.parseOmitempty(val, field.value); omit {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tout = append(out, field.value.Interface())\n\t\t}\n\t}\n\n\treturn\n}","func parseTag(tag string) (key string, opts map[string]string) {\n\topts = map[string]string{}\n\tfor i, s := range strings.Split(tag, \",\") {\n\t\tif i == 0 {\n\t\t\tkey = s\n\t\t\tcontinue\n\t\t}\n\n\t\tpp := strings.SplitN(s, \"=\", 2)\n\t\tif len(pp) == 1 {\n\t\t\topts[pp[0]] = \"\"\n\t\t} else {\n\t\t\topts[pp[0]] = pp[1]\n\t\t}\n\t}\n\treturn key, opts\n}","func GetValueTagMap(src map[string]interface{}) map[string]interface{} {\n\tres := NewEmptyTagMap()\n\tres[\"inname\"] = \"value\"\n\tres[\"exname\"] = \"value\"\n\tres[\"type\"] = src[\"type\"]\n\tres[\"length\"] = src[\"length\"]\n\tres[\"scale\"] = src[\"scale\"]\n\tres[\"precision\"] = src[\"precision\"]\n\tres[\"fieldid\"] = src[\"fieldid\"]\n\treturn res\n}","func GetColumnAttributesFromTag(tag *reflect.StructTag) map[string]bool {\n\tfieldTags := strings.Split(tag.Get(\"field\"), \",\")\n\tattributes := map[string]bool{}\n\tfor _, tag := range fieldTags[1:] {\n\t\tattributes[tag] = true\n\t}\n\treturn attributes\n}","func (t TextTemplate) ExtractTemplateRuleMap(input string) map[string]string {\n\tresults := t.extractVarsAroundToken(input)\n\tm := map[string]string{}\n\n\tfor _, v := range results {\n\t\tmetaTemplate := t.MatchMetaTemplate(v)\n\n\t\tif len(metaTemplate) != 0 {\n\t\t\tm[v] = metaTemplate\n\t\t}\n\t}\n\n\treturn m\n}","func mapColumnTags(tables map[string]schema.Schema) (m map[uint64]string) {\n\tm = make(map[uint64]string, len(tables))\n\tfor tbl, sch := range tables {\n\t\tfor _, tag := range sch.GetAllCols().Tags {\n\t\t\tm[tag] = tbl\n\t\t}\n\t}\n\treturn\n}","func extractQuery(c *gin.Context, tag string) (string, []string, error) {\n\tname, required, defaultVal, err := parseTagKey(tag)\n\tif err != nil {\n\t\treturn \"\", nil, err\n\t}\n\tvar params []string\n\tquery := c.Request.URL.Query()[name]\n\n\tif c.GetBool(ExplodeTag) {\n\t\t// Delete empty elements so default and required arguments\n\t\t// will play nice together. Append to a new collection to\n\t\t// preserve order without too much copying.\n\t\tparams = make([]string, 0, len(query))\n\t\tfor i := range query {\n\t\t\tif query[i] != \"\" {\n\t\t\t\tparams = append(params, query[i])\n\t\t\t}\n\t\t}\n\t} else {\n\t\tsplitFn := func(c rune) bool {\n\t\t\treturn c == ','\n\t\t}\n\t\tif len(query) > 1 {\n\t\t\treturn name, nil, errors.New(\"repeating values not supported: use comma-separated list\")\n\t\t} else if len(query) == 1 {\n\t\t\tparams = strings.FieldsFunc(query[0], splitFn)\n\t\t}\n\t}\n\n\t// XXX: deprecated, use of \"default\" tag is preferred\n\tif len(params) == 0 && defaultVal != \"\" {\n\t\treturn name, []string{defaultVal}, nil\n\t}\n\t// XXX: deprecated, use of \"validate\" tag is preferred\n\tif len(params) == 0 && required {\n\t\treturn \"\", nil, fmt.Errorf(\"missing query parameter: %s\", name)\n\t}\n\treturn name, params, nil\n}","func (s *Site) calculateTags() {\n\n\ttags := make(map[string][]Page)\n\tfor _, post := range s.posts {\n\t\tfor _, tag := range post.GetTags() {\n\t\t\tif posts, ok := tags[tag]; ok == true {\n\t\t\t\ttags[tag] = append(posts, post)\n\t\t\t} else {\n\t\t\t\ttags[tag] = []Page{post}\n\t\t\t}\n\t\t}\n\t}\n\n\ts.Conf.Set(\"tags\", tags)\n}","func processTags(tags []string) []string {\n\tif tags == nil {\n\t\treturn nil\n\t}\n\tprocessedTags := []string{}\n\tusedTags := make(map[string]bool)\n\tfor _, tag := range tags {\n\t\ttag = strings.TrimSpace(tag)\n\t\tif len(tag) > 0 && !usedTags[tag] {\n\t\t\tprocessedTags = append(processedTags, tag)\n\t\t\tusedTags[tag] = true\n\t\t}\n\t}\n\treturn processedTags\n}","func (p *Parser) switchFieldToTag(tags map[string]string, fields map[string]interface{}) (map[string]string, map[string]interface{}) {\n\tfor name, value := range fields {\n\t\tif p.tagFilter == nil {\n\t\t\tcontinue\n\t\t}\n\t\t// skip switch statement if tagkey doesn't match fieldname\n\t\tif !p.tagFilter.Match(name) {\n\t\t\tcontinue\n\t\t}\n\t\t// switch any fields in TagKeys into tags\n\t\tswitch t := value.(type) {\n\t\tcase string:\n\t\t\ttags[name] = t\n\t\t\tdelete(fields, name)\n\t\tcase bool:\n\t\t\ttags[name] = strconv.FormatBool(t)\n\t\t\tdelete(fields, name)\n\t\tcase float64:\n\t\t\ttags[name] = strconv.FormatFloat(t, 'f', -1, 64)\n\t\t\tdelete(fields, name)\n\t\tdefault:\n\t\t\tp.Log.Errorf(\"Unrecognized type %T\", value)\n\t\t}\n\t}\n\n\t// remove any additional string/bool values from fields\n\tfor fk := range fields {\n\t\tswitch fields[fk].(type) {\n\t\tcase string, bool:\n\t\t\tif p.stringFilter != nil && p.stringFilter.Match(fk) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tdelete(fields, fk)\n\t\t}\n\t}\n\treturn tags, fields\n}","func ExtractTagsFromText(rawTxt string) []Tag {\n\n\ttags := map[string]int{}\n\n\t// noddy Crapitalisation algorithm\n\tfor _, foo := range tagPats.tag.FindAllStringSubmatch(rawTxt, -1) {\n\t\tm := foo[1]\n\t\tm = tagPats.compressSpace.ReplaceAllString(m, \" \")\n\n\t\t// ignore short tags unless they look like acronymns\n\t\tif len(m) <= 3 && m != strings.ToUpper(m) {\n\t\t\tcontinue\n\t\t}\n\n\t\t// discard tags with more than 4 words\n\t\tif len(strings.Split(m, \" \")) > 4 {\n\t\t\tcontinue\n\t\t}\n\n\t\tm = strings.ToLower(m)\n\t\t// TODO: check against blacklist\n\t\t// apply synonyms?\n\t\t// classify?\n\n\t\t// remove any leading \"mr\" \"mrs\" etc...\n\t\tm = tagPats.prefixStrip.ReplaceAllLiteralString(m, \"\")\n\n\t\ttags[m] += 1\n\t}\n\n\tout := []Tag{}\n\tfor name, freq := range tags {\n\t\tout = append(out, Tag{name, freq})\n\t}\n\n\treturn out\n\t/*\n\t blacklist = GetBlacklist()\n\t countries = GetCountryList()\n\t synonyms = {}\n\n\t # extract phrases with the first letter of each word capitalised,\n\t # but not at the beginning of a sentence.\n\t tagpat = re.compile( u'[^.\\\\s]\\\\s*(([A-Z]\\\\w+)(\\\\s+([A-Z]\\\\w+))*)', re.UNICODE|re.DOTALL )\n\n\t # prefixes we'll trim off\n\t prefixpat = re.compile( u'^(mr|dr|ms|mrs)\\\\s+',re.UNICODE|re.IGNORECASE )\n\n\t # calculate tags using noddy Crapitisation algorithm\n\t tags = {}\n\t for m in tagpat.findall(txt):\n\t # compress whitespace\n\t words = m[0].split()\n\t if len( words ) > 4:\n\t continue # discard tags with more than 4 words\n\t t = ' '.join( words )\n\n\t # ignore short tags unless they look like acronymns\n\t if len(t)<=3 and t != t.upper():\n\t continue\n\n\t t = t.lower()\n\t if t in blacklist:\n\t continue\n\n\t # trim off any title prefixes (mr, mrs, ms, dr)\n\t t = prefixpat.sub( u'', t )\n\n\t # is there a synonym to remap this key?\n\t if synonyms.has_key(t):\n\t t=synonyms[t]\n\n\n\t # which kind of term is it?\n\t kind = ' ' # unknown\n\t if t in countries:\n\t kind = 'c'\n\n\n\t # TODO: kind field in DB should be part of primary key too!\n\n\t # key is tag name _and_ kind of tag!\n\t k = (t,kind)\n\t tags[k] = tags.get(k,0) + 1 # ++freq\n\t*/\n}","func (t HeadTagsTechnique) Extract(html string) DirtyExtracted {\n\textracted := GetEmptyDirtyExtracted()\n\tt.setName(\"HeadTagsTechnique\")\n\n\t// Load the HTML document\n\tdoc, err := goquery.NewDocumentFromReader(strings.NewReader(html))\n\tif err != nil {\n\t\treturn extracted\n\t}\n\t// Find the title\n\tif title := doc.Find(\"title\").First().Text(); title != EmptyString {\n\t\textracted[TitlesField] = append(extracted[TitlesField], title)\n\t}\n\t// extract data from meta tags\n\tmetaNameMap := *t.getMetaNameMap()\n\tdoc.Find(\"meta\").Each(func(i int, selection *goquery.Selection) {\n\t\tname, e1 := selection.Attr(\"name\")\n\t\tcontent, e2 := selection.Attr(\"content\")\n\t\tif e1 && e2 {\n\t\t\tif nameDest, ok := metaNameMap[name]; ok {\n\t\t\t\tif _, ok1 := extracted[nameDest]; ok1 {\n\t\t\t\t\textracted[nameDest] = append(extracted[nameDest], content)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t})\n\n\t// extract data from link tags\n\tdoc.Find(\"link\").Each(func(i int, selection *goquery.Selection) {\n\t\tif rel, ok := selection.Attr(\"rel\"); ok {\n\t\t\thref, ok1 := selection.Attr(\"href\")\n\t\t\t_type, ok2 := selection.Attr(\"type\")\n\t\t\tif strings.Contains(rel, \"canonical\") && ok1 {\n\t\t\t\tif _, ok3 := extracted[UrlsField]; ok3 {\n\t\t\t\t\textracted[UrlsField] = append(extracted[UrlsField], href)\n\t\t\t\t}\n\t\t\t} else if strings.Contains(rel, \"alternate\") && ok1 && ok2 && _type == \"application/rss+xml\" {\n\t\t\t\tif _, ok3 := extracted[FeedsField]; ok3 {\n\t\t\t\t\textracted[FeedsField] = append(extracted[FeedsField], href)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t})\n\n\treturn extracted\n}","func (r *Rule) Tags() pulumi.MapOutput {\n\treturn (pulumi.MapOutput)(r.s.State[\"tags\"])\n}","func (s *stringMapPropagator) Extract(ctx context.Context, reader HeaderReader) (context.Context, error) {\n\tif err := reader.ForEachKey(func(key string, value []byte) error {\n\t\tif _, ok := s.keys[key]; ok {\n\t\t\tctx = context.WithValue(ctx, contextKey(key), string(value))\n\t\t}\n\t\treturn nil\n\t}); err != nil {\n\t\treturn nil, err\n\t}\n\treturn ctx, nil\n}","func (s *Structx) Tags(key string) (map[string]string, error) {\n\tresult := map[string]string{}\n\n\tfs := s.Fields()\n\tfor _, v := range fs {\n\t\tif !v.IsExport() {\n\t\t\tcontinue\n\t\t}\n\t\tresult[v.Name()] = v.Tag(key)\n\t}\n\n\treturn result, nil\n}","func getTagNamesByIDs(db *sql.DB, tagIDs []string) (map[string]string, error) {\n\ttags := make(map[string]string)\n\n\trows, err := db.Query(\"select tag_id, tag from tags where tag_id = any($1)\", pg.Array(tagIDs))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor rows.Next() {\n\t\tvar tagID string\n\t\tvar tag string\n\t\tif err = rows.Scan(&tagID, &tag); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\ttags[tagID] = tag\n\n\t}\n\n\treturn tags, nil\n}","func (o LookupMulticastDomainResultOutput) Tags() pulumi.StringMapOutput {\n\treturn o.ApplyT(func(v LookupMulticastDomainResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\n}","func keyvalTagsMap(keyMap []string, valueMap []interface{}, f *Feature) (tags []uint32, err error) {\n\n\tif f == nil {\n\t\treturn nil, ErrNilFeature\n\t}\n\n\tvar kidx, vidx int64\n\n\tfor key, val := range f.Tags {\n\n\t\tkidx, vidx = -1, -1 // Set to known not found value.\n\n\t\tfor i, k := range keyMap {\n\t\t\tif k != key {\n\t\t\t\tcontinue // move to the next key\n\t\t\t}\n\t\t\tkidx = int64(i)\n\t\t\tbreak // we found a match\n\t\t}\n\n\t\tif kidx == -1 {\n\t\t\tlog.Printf(\"did not find key (%v) in keymap.\", key)\n\t\t\treturn tags, fmt.Errorf(\"did not find key (%v) in keymap.\", key)\n\t\t}\n\n\t\t// if val is nil we skip it for now\n\t\t// https://github.com/mapbox/vector-tile-spec/issues/62\n\t\tif val == nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tfor i, v := range valueMap {\n\t\t\tswitch tv := val.(type) {\n\t\t\tdefault:\n\t\t\t\treturn tags, fmt.Errorf(\"value (%[1]v) of type (%[1]T) for key (%[2]v) is not supported.\", tv, key)\n\t\t\tcase string:\n\t\t\t\tvmt, ok := v.(string) // Make sure the type of the Value map matches the type of the Tag's value\n\t\t\t\tif !ok || vmt != tv { // and that the values match\n\t\t\t\t\tcontinue // if they don't match move to the next value.\n\t\t\t\t}\n\t\t\tcase fmt.Stringer:\n\t\t\t\tvmt, ok := v.(fmt.Stringer)\n\t\t\t\tif !ok || vmt.String() != tv.String() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int:\n\t\t\t\tvmt, ok := v.(int)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int8:\n\t\t\t\tvmt, ok := v.(int8)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int16:\n\t\t\t\tvmt, ok := v.(int16)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int32:\n\t\t\t\tvmt, ok := v.(int32)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int64:\n\t\t\t\tvmt, ok := v.(int64)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint:\n\t\t\t\tvmt, ok := v.(uint)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint8:\n\t\t\t\tvmt, ok := v.(uint8)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint16:\n\t\t\t\tvmt, ok := v.(uint16)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint32:\n\t\t\t\tvmt, ok := v.(uint32)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint64:\n\t\t\t\tvmt, ok := v.(uint64)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\tcase float32:\n\t\t\t\tvmt, ok := v.(float32)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase float64:\n\t\t\t\tvmt, ok := v.(float64)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase bool:\n\t\t\t\tvmt, ok := v.(bool)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t} // Values Switch Statement\n\t\t\t// if the values match let's record the index.\n\t\t\tvidx = int64(i)\n\t\t\tbreak // we found our value no need to continue on.\n\t\t} // range on value\n\n\t\tif vidx == -1 { // None of the values matched.\n\t\t\treturn tags, fmt.Errorf(\"did not find a value: %v in valuemap.\", val)\n\t\t}\n\t\ttags = append(tags, uint32(kidx), uint32(vidx))\n\t} // Move to the next tag key and value.\n\n\treturn tags, nil\n}","func mapTags(ec echo.Context, latency time.Duration) map[string]interface{} {\n\ttags := map[string]interface{}{}\n\n\treq := ec.Request()\n\tres := ec.Response()\n\n\tid := req.Header.Get(echo.HeaderXRequestID)\n\tif id == \"\" {\n\t\tid = res.Header().Get(echo.HeaderXRequestID)\n\t}\n\n\ttags[logID] = id\n\ttags[logRemoteIP] = ec.RealIP()\n\ttags[logURI] = req.RequestURI\n\ttags[logHost] = req.Host\n\ttags[logMethod] = req.Method\n\n\tpath := req.URL.Path\n\tif path == \"\" {\n\t\tpath = \"/\"\n\t}\n\n\ttags[logPath] = path\n\ttags[logRoute] = ec.Path()\n\ttags[logProtocol] = req.Proto\n\ttags[logReferer] = req.Referer()\n\ttags[logUserAgent] = req.UserAgent()\n\ttags[logStatus] = res.Status\n\ttags[logLatency] = strconv.FormatInt(int64(latency), base)\n\ttags[logLatencyHuman] = latency.String()\n\n\tcl := req.Header.Get(echo.HeaderContentLength)\n\tif cl == \"\" {\n\t\tcl = \"0\"\n\t}\n\n\ttags[logBytesIn] = cl\n\ttags[logBytesOut] = strconv.FormatInt(res.Size, base)\n\n\treturn tags\n}","func (l *LocalService) GetTags() map[string]string {\n\treturn map[string]string{}\n}","func (gap *groupByAttrsProcessor) extractGroupingAttributes(attrMap pcommon.Map) (bool, pcommon.Map) {\n\n\tgroupingAttributes := pcommon.NewMap()\n\tfoundMatch := false\n\n\tfor _, attrKey := range gap.groupByKeys {\n\t\tattrVal, found := attrMap.Get(attrKey)\n\t\tif found {\n\t\t\tattrVal.CopyTo(groupingAttributes.PutEmpty(attrKey))\n\t\t\tfoundMatch = true\n\t\t}\n\t}\n\n\treturn foundMatch, groupingAttributes\n}","func (o *OptionsProvider) ExportToMapWithTag(tag string) map[string]interface{} {\n\tspec := reflect.ValueOf(o.spec).Elem()\n\tspecType := spec.Type()\n\tm := make(map[string]interface{})\n\tfor i := 0; i < specType.NumField(); i++ {\n\t\texportedName := specType.Field(i).Name\n\t\tif !o.IsSet(exportedName) {\n\t\t\tcontinue\n\t\t}\n\t\tif tag != \"\" {\n\t\t\ttaggedName := specType.Field(i).Tag.Get(tag)\n\t\t\tif taggedName != \"\" {\n\t\t\t\texportedName = taggedName\n\t\t\t}\n\t\t}\n\t\tm[exportedName] = spec.Field(i).FieldByName(\"Value\").Interface()\n\t}\n\treturn m\n}","func getTags(s interface{}, tag string) []string {\n\tvar columns []string\n\ttblStructType := reflect.TypeOf(s)\n\n\tfor fnum := 0; fnum < tblStructType.NumField(); fnum++ {\n\t\tfield := tblStructType.Field(fnum)\n\t\tif fieldName, ok := field.Tag.Lookup(tag); ok {\n\t\t\tif fieldName != \"\" {\n\t\t\t\tcolumns = append(columns, fieldName)\n\t\t\t}\n\t\t}\n\t}\n\treturn columns\n}","func (v extractAggregatesVisitor) extract(typedExpr parser.TypedExpr) (parser.TypedExpr, error) {\n\tv.err = nil\n\texpr, _ := parser.WalkExpr(&v, typedExpr)\n\treturn expr.(parser.TypedExpr), v.err\n}","func (this *runner) extractTagsFromMetricsName(name string) (realName string, tags map[string]string) {\n\ttags = map[string]string{\n\t\t\"host\": this.cf.hostname,\n\t}\n\n\ti := strings.Index(name, tagSep)\n\tif i < 0 {\n\t\t// no tag\n\t\treturn name, tags\n\t}\n\n\t// has tag\n\trealName = name[i+1:]\n\n\tu, _ := url.ParseQuery(name[:i])\n\tfor k, v := range u {\n\t\ttags[k] = v[0] // we use only 1st item\n\t}\n\n\treturn\n}","func (p *Profiler) TagWrapper(tags map[string]string, cb func()) error {\n\terr := p.Tag(tags)\n\tif err != nil {\n\t\treturn err\n\t}\n\tcb()\n\tvar tagKeys []string\n\tfor key := range tags {\n\t\ttagKeys = append(tagKeys, key)\n\t}\n\terr = p.RemoveTags(tagKeys...)\n\treturn err\n}","func (v *View) TagFilter() map[string]string {\n\tfilter := map[string]string{}\n\tfor _, t := range v.tags {\n\t\tp := strings.Split(t, \"=\")\n\t\tif len(p) == 2 {\n\t\t\tfilter[p[0]] = p[1]\n\t\t} else {\n\t\t\tfilter[p[0]] = \"\"\n\t\t}\n\t}\n\treturn filter\n}","func GetTagsIn(ctx context.Context) map[string]*string {\n\tif inContext, ok := tftags.FromContext(ctx); ok {\n\t\tif tags := Tags(inContext.TagsIn.UnwrapOrDefault()); len(tags) > 0 {\n\t\t\treturn tags\n\t\t}\n\t}\n\n\treturn nil\n}","func (e *Extractor) NamesFromTag(tag string) (out []string, err error) {\n\n\tif err := e.isValidStruct(); err != nil {\n\t\treturn nil, err\n\t}\n\n\ts := reflect.ValueOf(e.StructAddr).Elem()\n\tfields := e.fields(s)\n\n\tfor _, field := range fields {\n\t\tif val, ok := field.tags.Lookup(tag); ok {\n\t\t\tkey, omit := e.parseOmitempty(val, field.value)\n\t\t\tif omit {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tout = append(out, key)\n\t\t}\n\t}\n\n\treturn\n}","func (e ExtraLayers) Extract() []string {\n\tvar l []string\n\tfor k, v := range extraLayersMap {\n\t\tif (e & v) > 0 {\n\t\t\tl = append(l, k)\n\t\t}\n\t}\n\treturn l\n}","func Bvextract(t TermT, i uint32, j uint32) TermT {\n\treturn TermT(C.yices_bvextract(C.term_t(t), C.uint32_t(i), C.uint32_t(j)))\n}","func ProcessTags(t, sep string, repl ...string) []string {\n\tr := regexp.MustCompile(\"(?i)\" + strings.Join(repl, \"|\"))\n\tout := r.ReplaceAllString(strings.ToLower(t), \"\")\n\tout = strings.Replace(out, \"and\", sep, -1)\n\treturn TrimSpacesList(strings.Split(out, sep))\n}","func (fs *Memory) Tags(_ string) (map[string]string, error) {\n\ttags := make(map[string]string)\n\treturn tags, nil\n}","func RegexpExtract(content, pattern string) (map[string]string, error) {\n\tre, err := pool.Compile(pattern)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"re:[%s] error:%+v\", pattern, err)\n\t}\n\tmatch := re.FindStringSubmatch(content)\n\tif len(match) == 0 {\n\t\treturn nil, nil\n\t}\n\tret := make(map[string]string)\n\tfor i, name := range re.SubexpNames() {\n\t\tif i != 0 {\n\t\t\tif name == \"\" {\n\t\t\t\tname = fmt.Sprintf(\"%d\", i)\n\t\t\t}\n\t\t\tret[name] = strings.TrimSpace(match[i])\n\t\t}\n\t}\n\treturn ret, nil\n}","func ValuesForTag(doc, tag string) ([]interface{}, error) {\n\tn, err := DocToTree(doc)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tm := make(map[string]interface{})\n\tm[n.key] = n.treeToMap(false)\n\n\treturn ValuesForKey(m, tag), nil\n}","func (r *tagReader) CollectTagValues(\n\ttagKeyID tag.KeyID,\n\ttagValueIDs *roaring.Bitmap,\n\ttagValues map[uint32]string,\n) error {\n\tfor _, reader := range r.readers {\n\t\tif tagValueIDs.IsEmpty() {\n\t\t\treturn nil\n\t\t}\n\t\ttagKeyMetaBlock, err := reader.Get(uint32(tagKeyID))\n\t\tif err != nil {\n\t\t\tcontinue\n\t\t}\n\t\ttagKeyMeta, err := newTagKeyMetaFn(tagKeyMetaBlock)\n\t\tif err != nil {\n\t\t\tcontinue\n\t\t}\n\t\tif err := tagKeyMeta.CollectTagValues(tagValueIDs, tagValues); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}","func (p *packet) retrieveMap(value reflect.Value, tags []string) error {\n\tmatchedInstances := reflect.MakeMap(value.Type().Elem())\n\tfor tag, prv := range p.getProviders(tags) {\n\t\tinstance, err := prv.getInstance(p.ctn)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tmatchedInstances.SetMapIndex(reflect.ValueOf(tag), instance)\n\t}\n\tvalue.Elem().Set(matchedInstances)\n\treturn nil\n}","func (r *implementation) DistinctTags(ctx context.Context) ([]string, error) {\n\tvar tags []string\n\terr := pgxscan.Select(ctx, r.db, &tags, `\nSELECT DISTINCT UNNEST(tags) FROM articles\n`)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn tags, nil\n}","func getTagIDsByNames(tx *sql.Tx, tags []string) (map[string]string, error) {\n\ttagIDs := make(map[string]string)\n\n\trows, err := tx.Query(\"select tag_id, tag from tags where tag = any($1)\", pg.Array(tags))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor rows.Next() {\n\t\tvar tagID string\n\t\tvar tag string\n\t\tif err = rows.Scan(&tagID, &tag); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\ttagIDs[tag] = tagID\n\t}\n\n\treturn tagIDs, nil\n}","func (o EcsLaunchTemplateOutput) Tags() pulumi.MapOutput {\n\treturn o.ApplyT(func(v *EcsLaunchTemplate) pulumi.MapOutput { return v.Tags }).(pulumi.MapOutput)\n}","func (r *LogGroup) Tags() pulumi.MapOutput {\n\treturn (pulumi.MapOutput)(r.s.State[\"tags\"])\n}","func Tags(tags tftags.KeyValueTags) map[string]*string {\n\treturn aws.StringMap(tags.Map())\n}","func (o TransitRouterMulticastDomainOutput) Tags() pulumi.MapOutput {\n\treturn o.ApplyT(func(v *TransitRouterMulticastDomain) pulumi.MapOutput { return v.Tags }).(pulumi.MapOutput)\n}","func PackTags(in map[string]string) string {\n\ttags := []string{}\n\n\tfor k, v := range in {\n\t\ttags = append(tags, fmt.Sprintf(\"%s:%s\", k, v))\n\t}\n\n\tsort.Strings(tags)\n\n\treturn strings.Join(tags, \",\")\n}","func getFieldTags(t reflect.StructField) (res []string) {\n\tif tags := t.Tag.Get(mapEnvTagName); len(tags) > 0 {\n\t\tfor _, s := range strings.Split(tags, \",\") {\n\t\t\tif len(s) > 0 {\n\t\t\t\tres = append(res, s)\n\t\t\t}\n\t\t}\n\t}\n\n\t// ignore json tags and field name if mpe tag is present\n\tif len(res) > 0 {\n\t\treturn\n\t}\n\n\tif tags := t.Tag.Get(\"json\"); len(tags) > 0 {\n\t\tjsonTags := strings.Split(tags, \",\")\n\t\tif len(jsonTags) > 0 && len(jsonTags[0]) > 0 {\n\t\t\tres = append(res, jsonTags[0])\n\t\t}\n\t}\n\n\t// ignore field name if json tag is present\n\tif len(res) > 0 {\n\t\treturn\n\t}\n\n\tres = append(res, t.Name)\n\n\treturn\n}","func (o LookupListenerResultOutput) Tags() pulumi.StringMapOutput {\n\treturn o.ApplyT(func(v LookupListenerResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\n}","func (o EntityRecognizerOutput) Tags() pulumi.StringMapOutput {\n\treturn o.ApplyT(func(v *EntityRecognizer) pulumi.StringMapOutput { return v.Tags }).(pulumi.StringMapOutput)\n}","func Tags(v interface{}, key string) (map[string]string, error) {\n\treturn New(v).Tags(key)\n}","func elbTags(tags map[string]string) []*elb.Tag {\n\tvar e []*elb.Tag\n\n\tfor k, v := range tags {\n\t\te = append(e, elbTag(k, v))\n\t}\n\n\treturn e\n}","func SetTagsOut(ctx context.Context, tags map[string]*string) {\n\tif inContext, ok := tftags.FromContext(ctx); ok {\n\t\tinContext.TagsOut = types.Some(KeyValueTags(ctx, tags))\n\t}\n}","func processJaegerTags(s *model.Span) (*string, *trace.Endpoint, map[string]string) {\n\tvar kind *string\n\tvar remote *trace.Endpoint\n\ttags := make(map[string]string, len(s.Tags))\n\n\tensureRemote := func() {\n\t\tif remote == nil {\n\t\t\tremote = &trace.Endpoint{}\n\t\t}\n\t}\n\n\tfor i := range s.Tags {\n\t\tswitch s.Tags[i].Key {\n\t\tcase string(ext.PeerHostIPv4):\n\t\t\tip := convertPeerIPv4(&s.Tags[i])\n\t\t\tif ip == \"\" {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tensureRemote()\n\t\t\tremote.Ipv4 = pointer.String(ip)\n\t\t// ipv6 host is always string\n\t\tcase string(ext.PeerHostIPv6):\n\t\t\tif s.Tags[i].VStr != \"\" {\n\t\t\t\tensureRemote()\n\t\t\t\tremote.Ipv6 = pointer.String(s.Tags[i].VStr)\n\t\t\t}\n\t\tcase string(ext.PeerPort):\n\t\t\tport := convertPeerPort(&s.Tags[i])\n\t\t\tif port == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tensureRemote()\n\t\t\tremote.Port = &port\n\t\tcase string(ext.PeerService):\n\t\t\tensureRemote()\n\t\t\tremote.ServiceName = pointer.String(s.Tags[i].VStr)\n\t\tcase string(ext.SpanKind):\n\t\t\tkind = convertKind(&s.Tags[i])\n\t\tdefault:\n\t\t\tval := tagValueToString(&s.Tags[i])\n\t\t\tif val != \"\" {\n\t\t\t\ttags[s.Tags[i].Key] = val\n\t\t\t}\n\t\t}\n\t}\n\treturn kind, remote, tags\n}","func Tags(tags tftags.KeyValueTags) []*inspector.Tag {\n\tresult := make([]*inspector.Tag, 0, len(tags))\n\n\tfor k, v := range tags.Map() {\n\t\ttag := &inspector.Tag{\n\t\t\tKey: aws.String(k),\n\t\t\tValue: aws.String(v),\n\t\t}\n\n\t\tresult = append(result, tag)\n\t}\n\n\treturn result\n}","func promGroupTags(args []parse.Node) (parse.Tags, error) {\n\ttags := make(parse.Tags)\n\tcsvTags := strings.Split(args[1].(*parse.StringNode).Text, \",\")\n\tfor _, k := range csvTags {\n\t\ttags[k] = struct{}{}\n\t}\n\treturn tags, nil\n}","func (r *Distribution) Tags() pulumi.MapOutput {\n\treturn (pulumi.MapOutput)(r.s.State[\"tags\"])\n}","func (m FieldMap) Tags() []Tag {\n\ttags := make([]Tag, 0, len(m.tagLookup))\n\tfor t := range m.tagLookup {\n\t\ttags = append(tags, t)\n\t}\n\n\treturn tags\n}","func getTagsForSuggestions(q Queryable, suggs []*mpdata.Suggestion) (err error) {\n\tgetTagsStmt, err := q.Prepare(\"SELECT tag.tag FROM tag WHERE tag.mealid = ?\")\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer getTagsStmt.Close()\n\n\tfor _, sugg := range suggs {\n\t\tsugg.MT.Tags, err = getMealTagsPrepared(getTagsStmt, sugg.MT.Meal.ID)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}","func extractHeader(c *gin.Context, tag string) (string, []string, error) {\n\tname, required, defaultVal, err := parseTagKey(tag)\n\tif err != nil {\n\t\treturn \"\", nil, err\n\t}\n\theader := c.GetHeader(name)\n\n\t// XXX: deprecated, use of \"default\" tag is preferred\n\tif header == \"\" && defaultVal != \"\" {\n\t\treturn name, []string{defaultVal}, nil\n\t}\n\t// XXX: deprecated, use of \"validate\" tag is preferred\n\tif required && header == \"\" {\n\t\treturn \"\", nil, fmt.Errorf(\"missing header parameter: %s\", name)\n\t}\n\treturn name, []string{header}, nil\n}","func (e Extractor) extract(dst interface{}, o metav1.Object) (interface{}, error) {\n\tdata := make(map[string]interface{})\n\tfor name, annotationParser := range e.annotations {\n\t\tval, err := annotationParser.Parse(o)\n\t\tglog.V(6).Infof(\"annotation %v in %v %v/%v: %v\", name, \"o.GetKind()\", o.GetNamespace(), o.GetName(), val)\n\t\tif err != nil {\n\t\t\tif errors.IsMissingAnnotations(err) {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tglog.V(5).Infof(\"error reading %v annotation in %v %v/%v: %v\", name, \"o.GetKind()\", o.GetNamespace(), o.GetName(), err)\n\t\t\treturn dst, err\n\t\t}\n\t\tif val != nil {\n\t\t\tdata[name] = val\n\t\t}\n\t}\n\terr := mergo.MapWithOverwrite(dst, data)\n\tif err != nil {\n\t\tglog.Errorf(\"unexpected error merging extracted annotations: %v\", err)\n\t\treturn dst, err\n\t}\n\n\treturn dst, nil\n}","func (o LookupGroupResultOutput) Tags() pulumi.StringMapOutput {\n\treturn o.ApplyT(func(v LookupGroupResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\n}","func (p Paperless) GetTag(s string, caseSensitive bool) (TagList, error) {\n\t// A place to store the results\n\tvar t Tag\n\tvar tl TagList\n\n\t// Make the request\n\tif caseSensitive {\n\t\tp.Root += \"/tags/?name__contains=\" + s\n\t} else {\n\t\tp.Root += \"/tags/?name__icontains=\" + s\n\t}\n\tu := fmt.Sprint(p)\n\tresults, err := p.MakeGetRequest(u)\n\tif err != nil {\n\t\tlog.Errorf(\"An error occurred making request: %v\", err.Error())\n\t}\n\n\t// Append results so far to TagList tl\n\tfor _, tag := range results {\n\t\tjson.Unmarshal([]byte(tag.Raw), &t)\n\t\ttl = append(tl, t)\n\t}\n\treturn tl, nil\n}","func (o LookupFirewallPolicyResultOutput) Tags() pulumi.StringMapOutput {\n\treturn o.ApplyT(func(v LookupFirewallPolicyResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\n}","func userSelectTags(props []string) (map[string][]string, error) {\n\tfmt.Printf(\"There are %d properties from which tags can be created. The properties are %+v.\\n\", len(props), props)\n\tfmt.Printf(\"For each property, please indicate whether or not you want to create tags.\\n\")\n\n\tcfgTags := make(map[string][]string)\n\treader := bufio.NewReader(os.Stdin)\n\n\t// Ask user which of the properties should be made to tags.\n\tfor _, p := range props {\n\t\tfmt.Printf(\"Create tags for %s? Y/n\\n\", p)\n\n\t\tuserInput, err := reader.ReadString('\\n')\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tif userInput == \"Y\\n\" || userInput == \"y\\n\" {\n\t\t\tps := setPresets(p)\n\t\t\tcfgTags[p] = ps\n\t\t}\n\t}\n\n\tfmt.Println(\"Tags to be created for \", cfgTags)\n\n\treturn cfgTags, nil\n}","func (d *Dao) processTag(context *tagContext) (err error) {\n\n\tif context.objectContainer.Has(context.tag.Name) {\n\t\treturn nil\n\t}\n\n\tif context.tag.IsArray {\n\t\tvar collection = data.NewCollection()\n\t\tcontext.objectContainer.Put(context.tag.Name, collection)\n\t\terr = context.referenceValues.Apply(context.tag.Name, collection)\n\t} else {\n\t\tvar object = make(map[string]interface{})\n\t\tcontext.objectContainer.Put(context.tag.Name, object)\n\t\terr = context.referenceValues.Apply(context.tag.Name, object)\n\t}\n\treturn err\n}","func prepareStmts(db *sql.DB, unprepared map[string]string) (map[string]*sql.Stmt, error) {\n\tprepared := map[string]*sql.Stmt{}\n\tfor k, v := range unprepared {\n\t\tstmt, err := db.Prepare(v)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tprepared[k] = stmt\n\t}\n\n\treturn prepared, nil\n}","func (u *UniProt) extractSites() {\n\ttags := map[string]string{\n\t\t\"ACT_SITE\": \"active\", // https://www.uniprot.org/help/act_site\n\t\t\"METAL\": \"metal\", // https://www.uniprot.org/help/metal\n\t\t\"BINDING\": \"binding\", // https://www.uniprot.org/help/binding\n\t\t\"SITE\": \"site\", // https://www.uniprot.org/help/site\n\t}\n\n\tfor tag, name := range tags {\n\t\tr, _ := regexp.Compile(\"(?ms)^FT[ ]*\" + tag + \"[ ]*([0-9]*)$.*?note=\\\"(.*?)\\\"\")\n\t\tmatches := r.FindAllStringSubmatch(string(u.Raw), -1)\n\n\t\tfor _, site := range matches {\n\t\t\tpos, _ := strconv.ParseInt(site[1], 10, 64)\n\t\t\tu.Sites = append(u.Sites,\n\t\t\t\t&Site{\n\t\t\t\t\tType: name,\n\t\t\t\t\tPosition: pos,\n\t\t\t\t\tNote: site[2],\n\t\t\t\t},\n\t\t\t)\n\t\t}\n\t}\n}","func (o LookupDedicatedIpPoolResultOutput) Tags() pulumi.StringMapOutput {\n\treturn o.ApplyT(func(v LookupDedicatedIpPoolResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\n}","func extract(buf []byte, name string) []byte {\n\textractRE := regexp.MustCompile(`\\s+` + name + `.+?{`)\n\tbuf = buf[extractRE.FindIndex(buf)[0]:]\n\treturn buf[:endRE.FindIndex(buf)[1]]\n}"],"string":"[\n \"func Extract(ctx context.Context) *Tags {\\n\\tt, ok := ctx.Value(ctxMarkerKey).(*Tags)\\n\\tif !ok {\\n\\t\\treturn &Tags{values: make(map[string]interface{})}\\n\\t}\\n\\n\\treturn t\\n}\",\n \"func (r serverResult) ExtractTags() ([]string, error) {\\n\\tvar s struct {\\n\\t\\tTags []string `json:\\\"tags\\\"`\\n\\t}\\n\\terr := r.ExtractInto(&s)\\n\\treturn s.Tags, err\\n}\",\n \"func extractTagValues(regex *regexp.Regexp, tagList []string, input string) api.TagSet {\\n\\tmatches := regex.FindStringSubmatch(input)\\n\\tif matches == nil {\\n\\t\\treturn nil\\n\\t}\\n\\ttagSet := api.NewTagSet()\\n\\tfor index, tagValue := range matches {\\n\\t\\tif index == 0 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\ttagKey := tagList[index-1]\\n\\t\\ttagSet[tagKey] = tagValue\\n\\t}\\n\\treturn tagSet\\n}\",\n \"func parseTags(st reflect.StructTag) tags {\\n\\ts := st.Get(ndrNameSpace)\\n\\tt := tags{\\n\\t\\tValues: []string{},\\n\\t\\tMap: make(map[string]string),\\n\\t}\\n\\tif s != \\\"\\\" {\\n\\t\\tndrTags := strings.Trim(s, `\\\"`)\\n\\t\\tfor _, tag := range strings.Split(ndrTags, \\\",\\\") {\\n\\t\\t\\tif strings.Contains(tag, \\\":\\\") {\\n\\t\\t\\t\\tm := strings.SplitN(tag, \\\":\\\", 2)\\n\\t\\t\\t\\tt.Map[m[0]] = m[1]\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tt.Values = append(t.Values, tag)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn t\\n}\",\n \"func (t SemanticTagsTechnique) Extract(html string) DirtyExtracted {\\n\\textracted := GetEmptyDirtyExtracted()\\n\\tt.setName(\\\"SemanticTagsTechnique\\\")\\n\\tdoc, err := goquery.NewDocumentFromReader(strings.NewReader(html))\\n\\tif err != nil {\\n\\t\\treturn extracted\\n\\t}\\n\\n\\textractStr := *t.getExtractString()\\n\\textractAttr := *t.getExtractAttribute()\\n\\tfor _, val := range extractStr {\\n\\t\\tdoc.Find(val.tag).EachWithBreak(func(i int, selection *goquery.Selection) bool {\\n\\t\\t\\tif i < val.maxStores {\\n\\t\\t\\t\\textracted[val.dest] = append(extracted[val.dest], selection.Text())\\n\\t\\t\\t\\treturn true\\n\\t\\t\\t}\\n\\t\\t\\treturn false\\n\\t\\t})\\n\\t}\\n\\n\\tfor _, val := range extractAttr {\\n\\t\\tdoc.Find(val.tag).EachWithBreak(func(i int, selection *goquery.Selection) bool {\\n\\t\\t\\tif i < val.maxStores {\\n\\t\\t\\t\\tif attr, ok := selection.Attr(val.attr); ok {\\n\\t\\t\\t\\t\\textracted[val.dest] = append(extracted[val.dest], attr)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn true\\n\\t\\t\\t}\\n\\t\\t\\treturn false\\n\\t\\t})\\n\\t}\\n\\treturn extracted\\n}\",\n \"func (p *Planner) extractBinaryExprTags(name string, expr Expr, ref *VarRef, value Expr, tags map[string]string) (Expr, error) {\\n\\t// Ignore if the value is not a string literal.\\n\\tlit, ok := value.(*StringLiteral)\\n\\tif !ok {\\n\\t\\treturn expr, nil\\n\\t}\\n\\n\\t// Extract the key and remove the measurement prefix.\\n\\tkey := strings.TrimPrefix(ref.Val, name+\\\".\\\")\\n\\n\\t// If tag is already filtered then return error.\\n\\tif _, ok := tags[key]; ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"duplicate tag filter: %s.%s\\\", name, key)\\n\\t}\\n\\n\\t// Add tag to the filter.\\n\\ttags[key] = lit.Val\\n\\n\\t// Return nil to remove the expression.\\n\\treturn nil, nil\\n}\",\n \"func parseTags(tag string) (ret block.Dict) {\\n\\tif len(tag) > 0 {\\n\\t\\ttags := make(block.Dict)\\n\\t\\tvisitTags(tag, func(k, v string) {\\n\\t\\t\\ttags[k] = parseCommas(v)\\n\\t\\t})\\n\\t\\tret = tags\\n\\t}\\n\\treturn\\n}\",\n \"func parseTag(stag StructTag) map[string]string {\\n\\ttag := string(stag)\\n\\tm := make(map[string]string)\\n\\tfor tag != \\\"\\\" {\\n\\t\\ti := 0\\n\\t\\tfor i < len(tag) && tag[i] == ' ' {\\n\\t\\t\\ti += 1\\n\\t\\t}\\n\\t\\ttag = tag[i:]\\n\\t\\tif tag == \\\"\\\" {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\ti = 0\\n\\t\\tfor i < len(tag) && tag[i] > ' ' && tag[i] != ':' && tag[i] != '\\\"' && tag[i] != 0x7f {\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t\\tif i == 0 || i+1 >= len(tag) || tag[i] != ':' || tag[i+1] != '\\\"' {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tname := string(tag[:i])\\n\\t\\ttag = tag[i+1:]\\n\\n\\t\\ti = 1\\n\\t\\tfor i < len(tag) && tag[i] != '\\\"' {\\n\\t\\t\\tif tag[i] == '\\\\\\\\' {\\n\\t\\t\\t\\ti++\\n\\t\\t\\t}\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t\\tif i >= len(tag) {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tqvalue := string(tag[:i+1])\\n\\t\\ttag = tag[i+1:]\\n\\n\\t\\tvalue, err := strconv.Unquote(qvalue)\\n\\t\\tif err != nil {\\n\\t\\t\\tcontinue\\n\\t\\t\\tm[name] = value\\n\\t\\t}\\n\\t\\treturn m\\n\\t}\\n\\treturn m\\n}\",\n \"func tagKeysToMap(tags string) map[string]*string {\\n\\toutput := make(map[string]*string)\\n\\n\\tfor _, tag := range strings.Split(strings.TrimSpace(tags), \\\",\\\") {\\n\\t\\tsplit := strings.SplitN(tag, \\\"=\\\", 2)\\n\\t\\tkey := strings.TrimSpace(split[0])\\n\\t\\tvalue := \\\"\\\"\\n\\n\\t\\tif key == \\\"\\\" {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif len(split) > 1 {\\n\\t\\t\\tvalue = strings.TrimSpace(split[1])\\n\\t\\t}\\n\\n\\t\\toutput[key] = &value\\n\\t}\\n\\n\\tif len(output) == 0 {\\n\\t\\treturn nil\\n\\t}\\n\\n\\treturn output\\n}\",\n \"func (t HTML5SemanticTagsTechnique) Extract(html string) DirtyExtracted {\\n\\textracted := GetEmptyDirtyExtracted()\\n\\tt.setName(\\\"HTML5SemanticTagsTechnique\\\")\\n\\n\\tdoc, err := goquery.NewDocumentFromReader(strings.NewReader(html))\\n\\tif err != nil {\\n\\t\\treturn extracted\\n\\t}\\n\\n\\tdoc.Find(\\\"article\\\").Each(func(i int, selection *goquery.Selection) {\\n\\t\\tif title := selection.Find(\\\"h1\\\").Text(); title != EmptyString {\\n\\t\\t\\textracted[TitlesField] = append(extracted[TitlesField], title)\\n\\t\\t}\\n\\t\\tif desc := selection.Find(\\\"p\\\").Text(); desc != EmptyString {\\n\\t\\t\\textracted[DescriptionsField] = append(extracted[DescriptionsField], desc)\\n\\t\\t}\\n\\t})\\n\\n\\tdoc.Find(\\\"video\\\").Each(func(i int, selection *goquery.Selection) {\\n\\t\\tselection.Find(\\\"source\\\").Each(func(i int, selection *goquery.Selection) {\\n\\t\\t\\tif src, ok := selection.Attr(\\\"src\\\"); ok {\\n\\t\\t\\t\\textracted[VideosField] = append(extracted[VideosField], src)\\n\\t\\t\\t}\\n\\t\\t})\\n\\t})\\n\\treturn extracted\\n}\",\n \"func ExtractEntries(parserInfo []plugins.Entries, trigger string) map[string]string {\\n\\tentries := make(map[string]string)\\n\\n\\tvar parser metatools.Parser\\n\\tparser.Init(trigger)\\n\\n\\tfmt.Println(\\\"extracting extries for sentence : \\\", trigger)\\n\\tfor _, e := range parserInfo {\\n\\t\\tres := e.Resources.(map[string]interface{})\\n\\t\\tswitch e.Parser {\\n\\t\\tcase \\\"before\\\":\\n\\t\\t\\tentries[e.Name] = parser.Before(res[\\\"key\\\"].(string), int(res[\\\"x\\\"].(float64)))\\n\\t\\tcase \\\"after\\\":\\n\\t\\t\\tentries[e.Name] = parser.After(res[\\\"key\\\"].(string), int(res[\\\"x\\\"].(float64)))\\n\\t\\tcase \\\"between\\\":\\n\\t\\t\\tentries[e.Name] = parser.Between(res[\\\"after\\\"].(string), res[\\\"before\\\"].(string), int(res[\\\"x\\\"].(float64)), int(res[\\\"y\\\"].(float64)))\\n\\t\\t}\\n\\t}\\n\\treturn entries\\n}\",\n \"func (it *Regex) TagResults(dst map[string]graph.Value) {\\n\\tfor _, tag := range it.tags.Tags() {\\n\\t\\tdst[tag] = it.Result()\\n\\t}\\n\\n\\tfor tag, value := range it.tags.Fixed() {\\n\\t\\tdst[tag] = value\\n\\t}\\n\\n\\tit.subIt.TagResults(dst)\\n}\",\n \"func (e *Extractor) FieldValueFromTagMap(tag string) (out map[string]interface{}, err error) {\\n\\n\\tif err := e.isValidStruct(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tout = make(map[string]interface{})\\n\\ts := reflect.ValueOf(e.StructAddr).Elem()\\n\\tfields := e.fields(s)\\n\\n\\tfor _, field := range fields {\\n\\t\\tif val, ok := field.tags.Lookup(tag); ok {\\n\\t\\t\\tkey, omit := e.parseOmitempty(val, field.value)\\n\\t\\t\\tif omit {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tout[key] = field.value.Interface()\\n\\t\\t}\\n\\n\\t}\\n\\n\\treturn\\n}\",\n \"func extractTags(txt string) []string {\\n\\ttags := []string{}\\n\\tfor _, match := range TagsRx.FindAllStringSubmatch(txt, -1) {\\n\\t\\ttags = append(tags, strings.TrimLeft(match[1], \\\"#\\\"))\\n\\t}\\n\\treturn tags\\n}\",\n \"func (conjure *Conjure) extract(inheritance *handler.ConjureFileHandler, targetFile []byte, targetTag string) []byte {\\n\\tvar tags []string\\n\\tvar groupId string\\n\\n\\tfor _, group := range inheritance.Config.Groups {\\n\\t\\tgroupId, tags = internal.ExtractIdTag(group.Id)\\n\\n\\t\\tif tags == nil {\\n\\t\\t\\t// and any groups with no tags\\n\\t\\t\\ttags = append(tags, \\\"\\\")\\n\\t\\t}\\n\\n\\t\\tfor _, tag := range tags {\\n\\t\\t\\tif tag == targetTag {\\n\\t\\t\\t\\tfor _, item := range group.Items {\\n\\t\\t\\t\\t\\tval := reflect.ValueOf(item.Value)\\n\\t\\t\\t\\t\\tre := regexp.MustCompile(fmt.Sprintf(`\\\\${.*(?:%s\\\\.%s).*}`, groupId, item.Id))\\n\\t\\t\\t\\t\\tswitch val.Kind() {\\n\\t\\t\\t\\t\\tcase reflect.Int, reflect.Int64, reflect.Int32:\\n\\t\\t\\t\\t\\t\\ttargetFile = re.ReplaceAll(targetFile, []byte(strconv.FormatInt(val.Int(), 10)))\\n\\t\\t\\t\\t\\tcase reflect.String:\\n\\t\\t\\t\\t\\t\\ttargetFile = re.ReplaceAll(targetFile, []byte(val.String()))\\n\\t\\t\\t\\t\\tcase reflect.Array, reflect.Slice, reflect.Interface:\\n\\t\\t\\t\\t\\t\\tvar out string\\n\\t\\t\\t\\t\\t\\tfor i := 0; i < val.Len(); i++ {\\n\\t\\t\\t\\t\\t\\t\\tswitch val.Index(i).Kind() {\\n\\t\\t\\t\\t\\t\\t\\tcase reflect.Interface:\\n\\t\\t\\t\\t\\t\\t\\t\\tout += fmt.Sprintf(\\\"%s,\\\", val.Index(i).Interface().(string))\\n\\t\\t\\t\\t\\t\\t\\tcase reflect.Int, reflect.Int64, reflect.Int32:\\n\\t\\t\\t\\t\\t\\t\\t\\tout += fmt.Sprintf(\\\"%s,\\\", strconv.FormatInt(val.Index(i).Int(), 10))\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\ttargetFile = re.ReplaceAll(targetFile, []byte(fmt.Sprintf(\\\"[%s]\\\", out[:len(out)-1])))\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\\n\\n\\treturn targetFile\\n}\",\n \"func ParseTags(in string) (map[string]string, error) {\\n\\tout := map[string]string{}\\n\\n\\tfor _, entry := range strings.Split(in, \\\",\\\") {\\n\\t\\tentry = strings.TrimSpace(entry)\\n\\t\\tif entry == \\\"\\\" {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tfields := strings.SplitN(entry, \\\":\\\", 2)\\n\\t\\tif len(fields) < 2 {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"Invalid tag: %s\\\", entry)\\n\\t\\t}\\n\\n\\t\\t_, ok := out[fields[0]]\\n\\t\\tif ok {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"Duplicate tag: %s\\\", entry)\\n\\t\\t}\\n\\n\\t\\tout[fields[0]] = fields[1]\\n\\t}\\n\\n\\treturn out, nil\\n}\",\n \"func ExtractMetaTags(doc *goquery.Document, prefix string) (Map, error) {\\n\\tm := Map{}\\n\\t// now get open graph tags\\n\\tdoc.Find(\\\"meta\\\").Each(func(i int, s *goquery.Selection) {\\n\\t\\tif name, _ := s.Attr(\\\"property\\\"); strings.HasPrefix(name, prefix) {\\n\\t\\t\\tvalue, _ := s.Attr(\\\"content\\\")\\n\\t\\t\\tname = strings.TrimSpace(strings.TrimPrefix(name, prefix))\\n\\t\\t\\tvalue = strings.TrimSpace(value)\\n\\t\\t\\tif value != \\\"\\\" && name != \\\"\\\" {\\n\\t\\t\\t\\tm[name] = value\\n\\t\\t\\t}\\n\\t\\t}\\n\\t})\\n\\treturn m, nil\\n}\",\n \"func ExtractVariables(configDict map[string]interface{}, pattern *regexp.Regexp) map[string]string {\\n\\tif pattern == nil {\\n\\t\\tpattern = defaultPattern\\n\\t}\\n\\treturn recurseExtract(configDict, pattern)\\n}\",\n \"func (sm *SpecMore) TagsMap(inclTop, inclOps bool) map[string]int {\\n\\ttagsMap := map[string]int{}\\n\\tif inclTop {\\n\\t\\tfor _, tag := range sm.Spec.Tags {\\n\\t\\t\\ttagName := strings.TrimSpace(tag.Name)\\n\\t\\t\\tif len(tagName) > 0 {\\n\\t\\t\\t\\tif _, ok := tagsMap[tagName]; !ok {\\n\\t\\t\\t\\t\\ttagsMap[tagName] = 0\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttagsMap[tagName]++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif inclOps {\\n\\t\\tVisitOperations(sm.Spec, func(skipPath, skipMethod string, op *oas3.Operation) {\\n\\t\\t\\tfor _, tagName := range op.Tags {\\n\\t\\t\\t\\ttagName = strings.TrimSpace(tagName)\\n\\t\\t\\t\\tif len(tagName) > 0 {\\n\\t\\t\\t\\t\\tif _, ok := tagsMap[tagName]; !ok {\\n\\t\\t\\t\\t\\t\\ttagsMap[tagName] = 0\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ttagsMap[tagName]++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t})\\n\\t}\\n\\treturn tagsMap\\n}\",\n \"func copyTags(tags map[string]string) map[string]string {\\n\\tnewTags := make(map[string]string)\\n\\tfor k, v := range tags {\\n\\t\\tnewTags[k] = v\\n\\t}\\n\\treturn newTags\\n}\",\n \"func mapTags(tags []*elb.Tag) map[string]string {\\n\\ttagMap := make(map[string]string)\\n\\tfor _, t := range tags {\\n\\t\\ttagMap[*t.Key] = *t.Value\\n\\t}\\n\\n\\treturn tagMap\\n}\",\n \"func BuildTagMapping(structTemplatePointer interface{}, mappedKeyTag string, resultExclusionTag string, inheritKeyFromField bool, convertKeyToLowerCase bool, tags []string) map[string](map[string]string) {\\n\\treflectStructType := DiscoverTypeByKind(structTemplatePointer, reflect.Struct)\\n\\tvar result = make(map[string]map[string]string)\\n\\tvar anonymousMappings = make(map[string]map[string]string)\\n\\n\\tfor i := 0; i < reflectStructType.NumField(); i++ {\\n\\t\\tvar field reflect.StructField\\n\\t\\tfield = reflectStructType.Field(i)\\n\\t\\tkey := getTagValues(field, mappedKeyTag)\\n\\n\\t\\tif field.Anonymous && key == \\\"\\\" {\\n\\t\\t\\tvar anonymousType = DereferenceType(field.Type)\\n\\t\\t\\tif anonymousType.Kind() == reflect.Struct {\\n\\t\\t\\t\\tanonymousMapping := BuildTagMapping(reflect.New(anonymousType).Interface(), mappedKeyTag, resultExclusionTag, inheritKeyFromField, convertKeyToLowerCase, tags)\\n\\t\\t\\t\\tfor k, v := range anonymousMapping {\\n\\t\\t\\t\\t\\tanonymousMappings[k] = v\\n\\t\\t\\t\\t\\tanonymousMappings[k][anonymousKey] = \\\"true\\\"\\n\\t\\t\\t\\t\\tanonymousMappings[k][fieldIndexKey] = AsString(i)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tisTransient := strings.EqualFold(field.Tag.Get(resultExclusionTag), \\\"true\\\")\\n\\t\\tif isTransient {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif key == \\\"\\\" {\\n\\t\\t\\tif !inheritKeyFromField {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tkey = field.Name\\n\\t\\t}\\n\\n\\t\\tif convertKeyToLowerCase {\\n\\t\\t\\tkey = strings.ToLower(key)\\n\\t\\t}\\n\\n\\t\\tresult[key] = make(map[string]string)\\n\\t\\tfor _, tag := range tags {\\n\\t\\t\\ttagValue := field.Tag.Get(tag)\\n\\t\\t\\tif len(tagValue) > 0 {\\n\\t\\t\\t\\tresult[key][tag] = tagValue\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tresult[key][fieldNameKey] = field.Name\\n\\t}\\n\\n\\tfor k, v := range anonymousMappings {\\n\\t\\tif _, has := result[k]; !has {\\n\\t\\t\\tresult[k] = v\\n\\t\\t}\\n\\t}\\n\\treturn result\\n}\",\n \"func (t *TagExtracter) ExtractTags(text string, topK int) (tags Segments) {\\n\\tfreqMap := make(map[string]float64)\\n\\n\\tfor _, w := range t.seg.Cut(text, true) {\\n\\t\\tw = strings.TrimSpace(w)\\n\\t\\tif utf8.RuneCountInString(w) < 2 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tif t.stopWord.IsStopWord(w) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif f, ok := freqMap[w]; ok {\\n\\t\\t\\tfreqMap[w] = f + 1.0\\n\\t\\t} else {\\n\\t\\t\\tfreqMap[w] = 1.0\\n\\t\\t}\\n\\t}\\n\\n\\ttotal := 0.0\\n\\tfor _, freq := range freqMap {\\n\\t\\ttotal += freq\\n\\t}\\n\\n\\tfor k, v := range freqMap {\\n\\t\\tfreqMap[k] = v / total\\n\\t}\\n\\n\\tws := make(Segments, 0)\\n\\tvar s Segment\\n\\tfor k, v := range freqMap {\\n\\t\\tif freq, _, ok := t.Idf.Freq(k); ok {\\n\\t\\t\\ts = Segment{text: k, weight: freq * v}\\n\\t\\t} else {\\n\\t\\t\\ts = Segment{text: k, weight: t.Idf.median * v}\\n\\t\\t}\\n\\t\\tws = append(ws, s)\\n\\t}\\n\\n\\tsort.Sort(sort.Reverse(ws))\\n\\n\\tif len(ws) > topK {\\n\\t\\ttags = ws[:topK]\\n\\t\\treturn\\n\\t}\\n\\n\\ttags = ws\\n\\treturn\\n}\",\n \"func (e *Extractor) TagMapping(from, to string) (out map[string]string, err error) {\\n\\tif err := e.isValidStruct(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tout = make(map[string]string)\\n\\ts := reflect.ValueOf(e.StructAddr).Elem()\\n\\tfields := e.fields(s)\\n\\n\\tfor _, field := range fields {\\n\\t\\tfromTag, fromOk := field.tags.Lookup(from)\\n\\t\\ttoTag, toOk := field.tags.Lookup(to)\\n\\t\\tif toOk && fromOk {\\n\\t\\t\\tout[fromTag] = toTag\\n\\t\\t}\\n\\t}\\n\\n\\treturn\\n}\",\n \"func extractTags(pattern string) []string {\\n\\tif len(pattern) == 0 {\\n\\t\\treturn nil // empty pattern is not allowed.\\n\\t}\\n\\tsplitted := strings.Split(pattern, \\\"%\\\")\\n\\tif len(splitted)%2 == 0 {\\n\\t\\treturn nil // invalid tags.\\n\\t}\\n\\n\\tresult := make([]string, len(splitted)/2, len(splitted)/2)\\n\\tfor index, token := range splitted {\\n\\t\\tif isTagPortion(index) {\\n\\t\\t\\tif len(token) == 0 {\\n\\t\\t\\t\\treturn nil // no empty tag\\n\\t\\t\\t}\\n\\t\\t\\tresult[index/2] = token\\n\\t\\t}\\n\\t}\\n\\n\\t// check for duplicates.\\n\\texists := make(map[string]bool)\\n\\tfor _, token := range result {\\n\\t\\tif exists[token] {\\n\\t\\t\\treturn nil // no duplicate\\n\\t\\t}\\n\\t\\texists[token] = true\\n\\t}\\n\\treturn result\\n}\",\n \"func getTagsForEntries(entries data.Entries) []string {\\n\\tmapping := make(map[string]bool)\\n\\tfor _, entry := range entries {\\n\\t\\tfor _, tag := range entry.Tags {\\n\\t\\t\\tmapping[tag] = true\\n\\t\\t}\\n\\t}\\n\\treturn go_utils.MapToArray(mapping)\\n}\",\n \"func TagsDiff(sqsTags map[string]string, newTags map[string]string) (removed, added map[string]string) {\\n\\tremoved = map[string]string{}\\n\\tfor k, v := range sqsTags {\\n\\t\\tif _, ok := newTags[k]; !ok {\\n\\t\\t\\tremoved[k] = v\\n\\t\\t}\\n\\t}\\n\\n\\tadded = map[string]string{}\\n\\tfor k, newV := range newTags {\\n\\t\\tif oldV, ok := sqsTags[k]; !ok || oldV != newV {\\n\\t\\t\\tadded[k] = newV\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func (e *endpoint) extract(sel *goquery.Selection) result {\\n\\tr := result{}\\n\\tfor field, ext := range e.Result {\\n\\t\\tif v := ext.execute(sel); v != \\\"\\\" {\\n\\t\\t\\tr[field] = v\\n\\t\\t\\t// log.Printf(\\\"%s: %s\\\", field, v)\\n\\t\\t}\\n\\t}\\n\\treturn r\\n}\",\n \"func ParseTags(line string) Tags {\\n\\tret := Tags{}\\n\\n\\ttags := strings.Split(line, \\\";\\\")\\n\\tfor _, tag := range tags {\\n\\t\\tparts := strings.SplitN(tag, \\\"=\\\", 2)\\n\\t\\tif len(parts) < 2 {\\n\\t\\t\\tret[parts[0]] = \\\"\\\"\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tret[parts[0]] = ParseTagValue(parts[1])\\n\\t}\\n\\n\\treturn ret\\n}\",\n \"func (it *AllIterator) TagResults(dst map[string]graph.Value) {\\n\\tfor _, tag := range it.tags.Tags() {\\n\\t\\tdst[tag] = it.Result()\\n\\t}\\n\\n\\tfor tag, value := range it.tags.Fixed() {\\n\\t\\tdst[tag] = value\\n\\t}\\n}\",\n \"func (aiService *AppinsightsMonitorService) getTags(tagType string, name string) map[string]*string {\\n\\n\\ttags := make(map[string]*string)\\n\\n\\tcomponentHiddenlink := fmt.Sprintf(\\\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/components/%s\\\", aiService.subscriptionID, aiService.resourceGroup, aiService.name)\\n\\twebtestHiddenlink := fmt.Sprintf(\\\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/webtests/%s\\\", aiService.subscriptionID, aiService.resourceGroup, name)\\n\\tvalue := \\\"Resource\\\"\\n\\n\\tif tagType == \\\"webtest\\\" {\\n\\t\\ttags[componentHiddenlink] = &value\\n\\t}\\n\\n\\tif tagType == \\\"alert\\\" {\\n\\n\\t\\ttags[componentHiddenlink] = &value\\n\\t\\ttags[webtestHiddenlink] = &value\\n\\t}\\n\\n\\treturn tags\\n}\",\n \"func (point *Point) GetTags(noarray bool, separator string) map[string]string {\\n\\ttags := map[string]string{}\\n\\ttags[\\\"vcenter\\\"] = point.VCenter\\n\\ttags[\\\"type\\\"] = point.ObjectType\\n\\ttags[\\\"name\\\"] = point.ObjectName\\n\\tif noarray {\\n\\t\\tif len(point.Datastore) > 0 {\\n\\t\\t\\ttags[\\\"datastore\\\"] = point.Datastore[0]\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(point.Datastore) > 0 {\\n\\t\\t\\ttags[\\\"datastore\\\"] = strings.Join(point.Datastore, separator)\\n\\t\\t}\\n\\t}\\n\\tif noarray {\\n\\t\\tif len(point.Network) > 0 {\\n\\t\\t\\ttags[\\\"network\\\"] = point.Network[0]\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(point.Network) > 0 {\\n\\t\\t\\ttags[\\\"network\\\"] = strings.Join(point.Network, separator)\\n\\t\\t}\\n\\t}\\n\\tif len(point.ESXi) > 0 {\\n\\t\\ttags[\\\"host\\\"] = point.ESXi\\n\\t}\\n\\tif len(point.Cluster) > 0 {\\n\\t\\ttags[\\\"cluster\\\"] = point.Cluster\\n\\t}\\n\\tif len(point.Instance) > 0 {\\n\\t\\ttags[\\\"instance\\\"] = point.Instance\\n\\t}\\n\\tif len(point.ResourcePool) > 0 {\\n\\t\\ttags[\\\"resourcepool\\\"] = point.ResourcePool\\n\\t}\\n\\tif len(point.Folder) > 0 {\\n\\t\\ttags[\\\"folder\\\"] = point.Folder\\n\\t}\\n\\tif noarray {\\n\\t\\tif len(point.ViTags) > 0 {\\n\\t\\t\\ttags[\\\"vitags\\\"] = point.ViTags[0]\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(point.ViTags) > 0 {\\n\\t\\t\\ttags[\\\"vitags\\\"] = strings.Join(point.ViTags, separator)\\n\\t\\t}\\n\\t}\\n\\t/*\\n\\t\\tif point.NumCPU != 0 {\\n\\t\\t\\ttags[\\\"numcpu\\\"] = strconv.FormatInt(int64(point.NumCPU), 10)\\n\\t\\t}\\n\\t\\tif point.MemorySizeMB != 0 {\\n\\t\\t\\ttags[\\\"memorysizemb\\\"] = strconv.FormatInt(int64(point.MemorySizeMB), 10)\\n\\t\\t}\\n\\t*/\\n\\treturn tags\\n}\",\n \"func (src *prometheusMetricsSource) buildTags(m *dto.Metric) map[string]string {\\n\\tresult := map[string]string{}\\n\\tfor k, v := range src.tags {\\n\\t\\tif len(v) > 0 {\\n\\t\\t\\tresult[k] = v\\n\\t\\t}\\n\\t}\\n\\tfor _, lp := range m.Label {\\n\\t\\tif len(lp.GetValue()) > 0 {\\n\\t\\t\\tresult[lp.GetName()] = lp.GetValue()\\n\\t\\t}\\n\\t}\\n\\treturn result\\n}\",\n \"func (e *Extractor) ValuesFromTag(tag string) (out []interface{}, err error) {\\n\\n\\tif err := e.isValidStruct(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\ts := reflect.ValueOf(e.StructAddr).Elem()\\n\\tfields := e.fields(s)\\n\\n\\tfor _, field := range fields {\\n\\t\\tif val, ok := field.tags.Lookup(tag); ok {\\n\\t\\t\\tif _, omit := e.parseOmitempty(val, field.value); omit {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tout = append(out, field.value.Interface())\\n\\t\\t}\\n\\t}\\n\\n\\treturn\\n}\",\n \"func parseTag(tag string) (key string, opts map[string]string) {\\n\\topts = map[string]string{}\\n\\tfor i, s := range strings.Split(tag, \\\",\\\") {\\n\\t\\tif i == 0 {\\n\\t\\t\\tkey = s\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tpp := strings.SplitN(s, \\\"=\\\", 2)\\n\\t\\tif len(pp) == 1 {\\n\\t\\t\\topts[pp[0]] = \\\"\\\"\\n\\t\\t} else {\\n\\t\\t\\topts[pp[0]] = pp[1]\\n\\t\\t}\\n\\t}\\n\\treturn key, opts\\n}\",\n \"func GetValueTagMap(src map[string]interface{}) map[string]interface{} {\\n\\tres := NewEmptyTagMap()\\n\\tres[\\\"inname\\\"] = \\\"value\\\"\\n\\tres[\\\"exname\\\"] = \\\"value\\\"\\n\\tres[\\\"type\\\"] = src[\\\"type\\\"]\\n\\tres[\\\"length\\\"] = src[\\\"length\\\"]\\n\\tres[\\\"scale\\\"] = src[\\\"scale\\\"]\\n\\tres[\\\"precision\\\"] = src[\\\"precision\\\"]\\n\\tres[\\\"fieldid\\\"] = src[\\\"fieldid\\\"]\\n\\treturn res\\n}\",\n \"func GetColumnAttributesFromTag(tag *reflect.StructTag) map[string]bool {\\n\\tfieldTags := strings.Split(tag.Get(\\\"field\\\"), \\\",\\\")\\n\\tattributes := map[string]bool{}\\n\\tfor _, tag := range fieldTags[1:] {\\n\\t\\tattributes[tag] = true\\n\\t}\\n\\treturn attributes\\n}\",\n \"func (t TextTemplate) ExtractTemplateRuleMap(input string) map[string]string {\\n\\tresults := t.extractVarsAroundToken(input)\\n\\tm := map[string]string{}\\n\\n\\tfor _, v := range results {\\n\\t\\tmetaTemplate := t.MatchMetaTemplate(v)\\n\\n\\t\\tif len(metaTemplate) != 0 {\\n\\t\\t\\tm[v] = metaTemplate\\n\\t\\t}\\n\\t}\\n\\n\\treturn m\\n}\",\n \"func mapColumnTags(tables map[string]schema.Schema) (m map[uint64]string) {\\n\\tm = make(map[uint64]string, len(tables))\\n\\tfor tbl, sch := range tables {\\n\\t\\tfor _, tag := range sch.GetAllCols().Tags {\\n\\t\\t\\tm[tag] = tbl\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func extractQuery(c *gin.Context, tag string) (string, []string, error) {\\n\\tname, required, defaultVal, err := parseTagKey(tag)\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", nil, err\\n\\t}\\n\\tvar params []string\\n\\tquery := c.Request.URL.Query()[name]\\n\\n\\tif c.GetBool(ExplodeTag) {\\n\\t\\t// Delete empty elements so default and required arguments\\n\\t\\t// will play nice together. Append to a new collection to\\n\\t\\t// preserve order without too much copying.\\n\\t\\tparams = make([]string, 0, len(query))\\n\\t\\tfor i := range query {\\n\\t\\t\\tif query[i] != \\\"\\\" {\\n\\t\\t\\t\\tparams = append(params, query[i])\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} else {\\n\\t\\tsplitFn := func(c rune) bool {\\n\\t\\t\\treturn c == ','\\n\\t\\t}\\n\\t\\tif len(query) > 1 {\\n\\t\\t\\treturn name, nil, errors.New(\\\"repeating values not supported: use comma-separated list\\\")\\n\\t\\t} else if len(query) == 1 {\\n\\t\\t\\tparams = strings.FieldsFunc(query[0], splitFn)\\n\\t\\t}\\n\\t}\\n\\n\\t// XXX: deprecated, use of \\\"default\\\" tag is preferred\\n\\tif len(params) == 0 && defaultVal != \\\"\\\" {\\n\\t\\treturn name, []string{defaultVal}, nil\\n\\t}\\n\\t// XXX: deprecated, use of \\\"validate\\\" tag is preferred\\n\\tif len(params) == 0 && required {\\n\\t\\treturn \\\"\\\", nil, fmt.Errorf(\\\"missing query parameter: %s\\\", name)\\n\\t}\\n\\treturn name, params, nil\\n}\",\n \"func (s *Site) calculateTags() {\\n\\n\\ttags := make(map[string][]Page)\\n\\tfor _, post := range s.posts {\\n\\t\\tfor _, tag := range post.GetTags() {\\n\\t\\t\\tif posts, ok := tags[tag]; ok == true {\\n\\t\\t\\t\\ttags[tag] = append(posts, post)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttags[tag] = []Page{post}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\ts.Conf.Set(\\\"tags\\\", tags)\\n}\",\n \"func processTags(tags []string) []string {\\n\\tif tags == nil {\\n\\t\\treturn nil\\n\\t}\\n\\tprocessedTags := []string{}\\n\\tusedTags := make(map[string]bool)\\n\\tfor _, tag := range tags {\\n\\t\\ttag = strings.TrimSpace(tag)\\n\\t\\tif len(tag) > 0 && !usedTags[tag] {\\n\\t\\t\\tprocessedTags = append(processedTags, tag)\\n\\t\\t\\tusedTags[tag] = true\\n\\t\\t}\\n\\t}\\n\\treturn processedTags\\n}\",\n \"func (p *Parser) switchFieldToTag(tags map[string]string, fields map[string]interface{}) (map[string]string, map[string]interface{}) {\\n\\tfor name, value := range fields {\\n\\t\\tif p.tagFilter == nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\t// skip switch statement if tagkey doesn't match fieldname\\n\\t\\tif !p.tagFilter.Match(name) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\t// switch any fields in TagKeys into tags\\n\\t\\tswitch t := value.(type) {\\n\\t\\tcase string:\\n\\t\\t\\ttags[name] = t\\n\\t\\t\\tdelete(fields, name)\\n\\t\\tcase bool:\\n\\t\\t\\ttags[name] = strconv.FormatBool(t)\\n\\t\\t\\tdelete(fields, name)\\n\\t\\tcase float64:\\n\\t\\t\\ttags[name] = strconv.FormatFloat(t, 'f', -1, 64)\\n\\t\\t\\tdelete(fields, name)\\n\\t\\tdefault:\\n\\t\\t\\tp.Log.Errorf(\\\"Unrecognized type %T\\\", value)\\n\\t\\t}\\n\\t}\\n\\n\\t// remove any additional string/bool values from fields\\n\\tfor fk := range fields {\\n\\t\\tswitch fields[fk].(type) {\\n\\t\\tcase string, bool:\\n\\t\\t\\tif p.stringFilter != nil && p.stringFilter.Match(fk) {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tdelete(fields, fk)\\n\\t\\t}\\n\\t}\\n\\treturn tags, fields\\n}\",\n \"func ExtractTagsFromText(rawTxt string) []Tag {\\n\\n\\ttags := map[string]int{}\\n\\n\\t// noddy Crapitalisation algorithm\\n\\tfor _, foo := range tagPats.tag.FindAllStringSubmatch(rawTxt, -1) {\\n\\t\\tm := foo[1]\\n\\t\\tm = tagPats.compressSpace.ReplaceAllString(m, \\\" \\\")\\n\\n\\t\\t// ignore short tags unless they look like acronymns\\n\\t\\tif len(m) <= 3 && m != strings.ToUpper(m) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\t// discard tags with more than 4 words\\n\\t\\tif len(strings.Split(m, \\\" \\\")) > 4 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tm = strings.ToLower(m)\\n\\t\\t// TODO: check against blacklist\\n\\t\\t// apply synonyms?\\n\\t\\t// classify?\\n\\n\\t\\t// remove any leading \\\"mr\\\" \\\"mrs\\\" etc...\\n\\t\\tm = tagPats.prefixStrip.ReplaceAllLiteralString(m, \\\"\\\")\\n\\n\\t\\ttags[m] += 1\\n\\t}\\n\\n\\tout := []Tag{}\\n\\tfor name, freq := range tags {\\n\\t\\tout = append(out, Tag{name, freq})\\n\\t}\\n\\n\\treturn out\\n\\t/*\\n\\t blacklist = GetBlacklist()\\n\\t countries = GetCountryList()\\n\\t synonyms = {}\\n\\n\\t # extract phrases with the first letter of each word capitalised,\\n\\t # but not at the beginning of a sentence.\\n\\t tagpat = re.compile( u'[^.\\\\\\\\s]\\\\\\\\s*(([A-Z]\\\\\\\\w+)(\\\\\\\\s+([A-Z]\\\\\\\\w+))*)', re.UNICODE|re.DOTALL )\\n\\n\\t # prefixes we'll trim off\\n\\t prefixpat = re.compile( u'^(mr|dr|ms|mrs)\\\\\\\\s+',re.UNICODE|re.IGNORECASE )\\n\\n\\t # calculate tags using noddy Crapitisation algorithm\\n\\t tags = {}\\n\\t for m in tagpat.findall(txt):\\n\\t # compress whitespace\\n\\t words = m[0].split()\\n\\t if len( words ) > 4:\\n\\t continue # discard tags with more than 4 words\\n\\t t = ' '.join( words )\\n\\n\\t # ignore short tags unless they look like acronymns\\n\\t if len(t)<=3 and t != t.upper():\\n\\t continue\\n\\n\\t t = t.lower()\\n\\t if t in blacklist:\\n\\t continue\\n\\n\\t # trim off any title prefixes (mr, mrs, ms, dr)\\n\\t t = prefixpat.sub( u'', t )\\n\\n\\t # is there a synonym to remap this key?\\n\\t if synonyms.has_key(t):\\n\\t t=synonyms[t]\\n\\n\\n\\t # which kind of term is it?\\n\\t kind = ' ' # unknown\\n\\t if t in countries:\\n\\t kind = 'c'\\n\\n\\n\\t # TODO: kind field in DB should be part of primary key too!\\n\\n\\t # key is tag name _and_ kind of tag!\\n\\t k = (t,kind)\\n\\t tags[k] = tags.get(k,0) + 1 # ++freq\\n\\t*/\\n}\",\n \"func (t HeadTagsTechnique) Extract(html string) DirtyExtracted {\\n\\textracted := GetEmptyDirtyExtracted()\\n\\tt.setName(\\\"HeadTagsTechnique\\\")\\n\\n\\t// Load the HTML document\\n\\tdoc, err := goquery.NewDocumentFromReader(strings.NewReader(html))\\n\\tif err != nil {\\n\\t\\treturn extracted\\n\\t}\\n\\t// Find the title\\n\\tif title := doc.Find(\\\"title\\\").First().Text(); title != EmptyString {\\n\\t\\textracted[TitlesField] = append(extracted[TitlesField], title)\\n\\t}\\n\\t// extract data from meta tags\\n\\tmetaNameMap := *t.getMetaNameMap()\\n\\tdoc.Find(\\\"meta\\\").Each(func(i int, selection *goquery.Selection) {\\n\\t\\tname, e1 := selection.Attr(\\\"name\\\")\\n\\t\\tcontent, e2 := selection.Attr(\\\"content\\\")\\n\\t\\tif e1 && e2 {\\n\\t\\t\\tif nameDest, ok := metaNameMap[name]; ok {\\n\\t\\t\\t\\tif _, ok1 := extracted[nameDest]; ok1 {\\n\\t\\t\\t\\t\\textracted[nameDest] = append(extracted[nameDest], content)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t})\\n\\n\\t// extract data from link tags\\n\\tdoc.Find(\\\"link\\\").Each(func(i int, selection *goquery.Selection) {\\n\\t\\tif rel, ok := selection.Attr(\\\"rel\\\"); ok {\\n\\t\\t\\thref, ok1 := selection.Attr(\\\"href\\\")\\n\\t\\t\\t_type, ok2 := selection.Attr(\\\"type\\\")\\n\\t\\t\\tif strings.Contains(rel, \\\"canonical\\\") && ok1 {\\n\\t\\t\\t\\tif _, ok3 := extracted[UrlsField]; ok3 {\\n\\t\\t\\t\\t\\textracted[UrlsField] = append(extracted[UrlsField], href)\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if strings.Contains(rel, \\\"alternate\\\") && ok1 && ok2 && _type == \\\"application/rss+xml\\\" {\\n\\t\\t\\t\\tif _, ok3 := extracted[FeedsField]; ok3 {\\n\\t\\t\\t\\t\\textracted[FeedsField] = append(extracted[FeedsField], href)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t})\\n\\n\\treturn extracted\\n}\",\n \"func (r *Rule) Tags() pulumi.MapOutput {\\n\\treturn (pulumi.MapOutput)(r.s.State[\\\"tags\\\"])\\n}\",\n \"func (s *stringMapPropagator) Extract(ctx context.Context, reader HeaderReader) (context.Context, error) {\\n\\tif err := reader.ForEachKey(func(key string, value []byte) error {\\n\\t\\tif _, ok := s.keys[key]; ok {\\n\\t\\t\\tctx = context.WithValue(ctx, contextKey(key), string(value))\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn ctx, nil\\n}\",\n \"func (s *Structx) Tags(key string) (map[string]string, error) {\\n\\tresult := map[string]string{}\\n\\n\\tfs := s.Fields()\\n\\tfor _, v := range fs {\\n\\t\\tif !v.IsExport() {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tresult[v.Name()] = v.Tag(key)\\n\\t}\\n\\n\\treturn result, nil\\n}\",\n \"func getTagNamesByIDs(db *sql.DB, tagIDs []string) (map[string]string, error) {\\n\\ttags := make(map[string]string)\\n\\n\\trows, err := db.Query(\\\"select tag_id, tag from tags where tag_id = any($1)\\\", pg.Array(tagIDs))\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tfor rows.Next() {\\n\\t\\tvar tagID string\\n\\t\\tvar tag string\\n\\t\\tif err = rows.Scan(&tagID, &tag); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttags[tagID] = tag\\n\\n\\t}\\n\\n\\treturn tags, nil\\n}\",\n \"func (o LookupMulticastDomainResultOutput) Tags() pulumi.StringMapOutput {\\n\\treturn o.ApplyT(func(v LookupMulticastDomainResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\\n}\",\n \"func keyvalTagsMap(keyMap []string, valueMap []interface{}, f *Feature) (tags []uint32, err error) {\\n\\n\\tif f == nil {\\n\\t\\treturn nil, ErrNilFeature\\n\\t}\\n\\n\\tvar kidx, vidx int64\\n\\n\\tfor key, val := range f.Tags {\\n\\n\\t\\tkidx, vidx = -1, -1 // Set to known not found value.\\n\\n\\t\\tfor i, k := range keyMap {\\n\\t\\t\\tif k != key {\\n\\t\\t\\t\\tcontinue // move to the next key\\n\\t\\t\\t}\\n\\t\\t\\tkidx = int64(i)\\n\\t\\t\\tbreak // we found a match\\n\\t\\t}\\n\\n\\t\\tif kidx == -1 {\\n\\t\\t\\tlog.Printf(\\\"did not find key (%v) in keymap.\\\", key)\\n\\t\\t\\treturn tags, fmt.Errorf(\\\"did not find key (%v) in keymap.\\\", key)\\n\\t\\t}\\n\\n\\t\\t// if val is nil we skip it for now\\n\\t\\t// https://github.com/mapbox/vector-tile-spec/issues/62\\n\\t\\tif val == nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tfor i, v := range valueMap {\\n\\t\\t\\tswitch tv := val.(type) {\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\treturn tags, fmt.Errorf(\\\"value (%[1]v) of type (%[1]T) for key (%[2]v) is not supported.\\\", tv, key)\\n\\t\\t\\tcase string:\\n\\t\\t\\t\\tvmt, ok := v.(string) // Make sure the type of the Value map matches the type of the Tag's value\\n\\t\\t\\t\\tif !ok || vmt != tv { // and that the values match\\n\\t\\t\\t\\t\\tcontinue // if they don't match move to the next value.\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase fmt.Stringer:\\n\\t\\t\\t\\tvmt, ok := v.(fmt.Stringer)\\n\\t\\t\\t\\tif !ok || vmt.String() != tv.String() {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int:\\n\\t\\t\\t\\tvmt, ok := v.(int)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int8:\\n\\t\\t\\t\\tvmt, ok := v.(int8)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int16:\\n\\t\\t\\t\\tvmt, ok := v.(int16)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int32:\\n\\t\\t\\t\\tvmt, ok := v.(int32)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int64:\\n\\t\\t\\t\\tvmt, ok := v.(int64)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint:\\n\\t\\t\\t\\tvmt, ok := v.(uint)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint8:\\n\\t\\t\\t\\tvmt, ok := v.(uint8)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint16:\\n\\t\\t\\t\\tvmt, ok := v.(uint16)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint32:\\n\\t\\t\\t\\tvmt, ok := v.(uint32)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint64:\\n\\t\\t\\t\\tvmt, ok := v.(uint64)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase float32:\\n\\t\\t\\t\\tvmt, ok := v.(float32)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase float64:\\n\\t\\t\\t\\tvmt, ok := v.(float64)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase bool:\\n\\t\\t\\t\\tvmt, ok := v.(bool)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t} // Values Switch Statement\\n\\t\\t\\t// if the values match let's record the index.\\n\\t\\t\\tvidx = int64(i)\\n\\t\\t\\tbreak // we found our value no need to continue on.\\n\\t\\t} // range on value\\n\\n\\t\\tif vidx == -1 { // None of the values matched.\\n\\t\\t\\treturn tags, fmt.Errorf(\\\"did not find a value: %v in valuemap.\\\", val)\\n\\t\\t}\\n\\t\\ttags = append(tags, uint32(kidx), uint32(vidx))\\n\\t} // Move to the next tag key and value.\\n\\n\\treturn tags, nil\\n}\",\n \"func mapTags(ec echo.Context, latency time.Duration) map[string]interface{} {\\n\\ttags := map[string]interface{}{}\\n\\n\\treq := ec.Request()\\n\\tres := ec.Response()\\n\\n\\tid := req.Header.Get(echo.HeaderXRequestID)\\n\\tif id == \\\"\\\" {\\n\\t\\tid = res.Header().Get(echo.HeaderXRequestID)\\n\\t}\\n\\n\\ttags[logID] = id\\n\\ttags[logRemoteIP] = ec.RealIP()\\n\\ttags[logURI] = req.RequestURI\\n\\ttags[logHost] = req.Host\\n\\ttags[logMethod] = req.Method\\n\\n\\tpath := req.URL.Path\\n\\tif path == \\\"\\\" {\\n\\t\\tpath = \\\"/\\\"\\n\\t}\\n\\n\\ttags[logPath] = path\\n\\ttags[logRoute] = ec.Path()\\n\\ttags[logProtocol] = req.Proto\\n\\ttags[logReferer] = req.Referer()\\n\\ttags[logUserAgent] = req.UserAgent()\\n\\ttags[logStatus] = res.Status\\n\\ttags[logLatency] = strconv.FormatInt(int64(latency), base)\\n\\ttags[logLatencyHuman] = latency.String()\\n\\n\\tcl := req.Header.Get(echo.HeaderContentLength)\\n\\tif cl == \\\"\\\" {\\n\\t\\tcl = \\\"0\\\"\\n\\t}\\n\\n\\ttags[logBytesIn] = cl\\n\\ttags[logBytesOut] = strconv.FormatInt(res.Size, base)\\n\\n\\treturn tags\\n}\",\n \"func (l *LocalService) GetTags() map[string]string {\\n\\treturn map[string]string{}\\n}\",\n \"func (gap *groupByAttrsProcessor) extractGroupingAttributes(attrMap pcommon.Map) (bool, pcommon.Map) {\\n\\n\\tgroupingAttributes := pcommon.NewMap()\\n\\tfoundMatch := false\\n\\n\\tfor _, attrKey := range gap.groupByKeys {\\n\\t\\tattrVal, found := attrMap.Get(attrKey)\\n\\t\\tif found {\\n\\t\\t\\tattrVal.CopyTo(groupingAttributes.PutEmpty(attrKey))\\n\\t\\t\\tfoundMatch = true\\n\\t\\t}\\n\\t}\\n\\n\\treturn foundMatch, groupingAttributes\\n}\",\n \"func (o *OptionsProvider) ExportToMapWithTag(tag string) map[string]interface{} {\\n\\tspec := reflect.ValueOf(o.spec).Elem()\\n\\tspecType := spec.Type()\\n\\tm := make(map[string]interface{})\\n\\tfor i := 0; i < specType.NumField(); i++ {\\n\\t\\texportedName := specType.Field(i).Name\\n\\t\\tif !o.IsSet(exportedName) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tif tag != \\\"\\\" {\\n\\t\\t\\ttaggedName := specType.Field(i).Tag.Get(tag)\\n\\t\\t\\tif taggedName != \\\"\\\" {\\n\\t\\t\\t\\texportedName = taggedName\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tm[exportedName] = spec.Field(i).FieldByName(\\\"Value\\\").Interface()\\n\\t}\\n\\treturn m\\n}\",\n \"func getTags(s interface{}, tag string) []string {\\n\\tvar columns []string\\n\\ttblStructType := reflect.TypeOf(s)\\n\\n\\tfor fnum := 0; fnum < tblStructType.NumField(); fnum++ {\\n\\t\\tfield := tblStructType.Field(fnum)\\n\\t\\tif fieldName, ok := field.Tag.Lookup(tag); ok {\\n\\t\\t\\tif fieldName != \\\"\\\" {\\n\\t\\t\\t\\tcolumns = append(columns, fieldName)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn columns\\n}\",\n \"func (v extractAggregatesVisitor) extract(typedExpr parser.TypedExpr) (parser.TypedExpr, error) {\\n\\tv.err = nil\\n\\texpr, _ := parser.WalkExpr(&v, typedExpr)\\n\\treturn expr.(parser.TypedExpr), v.err\\n}\",\n \"func (this *runner) extractTagsFromMetricsName(name string) (realName string, tags map[string]string) {\\n\\ttags = map[string]string{\\n\\t\\t\\\"host\\\": this.cf.hostname,\\n\\t}\\n\\n\\ti := strings.Index(name, tagSep)\\n\\tif i < 0 {\\n\\t\\t// no tag\\n\\t\\treturn name, tags\\n\\t}\\n\\n\\t// has tag\\n\\trealName = name[i+1:]\\n\\n\\tu, _ := url.ParseQuery(name[:i])\\n\\tfor k, v := range u {\\n\\t\\ttags[k] = v[0] // we use only 1st item\\n\\t}\\n\\n\\treturn\\n}\",\n \"func (p *Profiler) TagWrapper(tags map[string]string, cb func()) error {\\n\\terr := p.Tag(tags)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tcb()\\n\\tvar tagKeys []string\\n\\tfor key := range tags {\\n\\t\\ttagKeys = append(tagKeys, key)\\n\\t}\\n\\terr = p.RemoveTags(tagKeys...)\\n\\treturn err\\n}\",\n \"func (v *View) TagFilter() map[string]string {\\n\\tfilter := map[string]string{}\\n\\tfor _, t := range v.tags {\\n\\t\\tp := strings.Split(t, \\\"=\\\")\\n\\t\\tif len(p) == 2 {\\n\\t\\t\\tfilter[p[0]] = p[1]\\n\\t\\t} else {\\n\\t\\t\\tfilter[p[0]] = \\\"\\\"\\n\\t\\t}\\n\\t}\\n\\treturn filter\\n}\",\n \"func GetTagsIn(ctx context.Context) map[string]*string {\\n\\tif inContext, ok := tftags.FromContext(ctx); ok {\\n\\t\\tif tags := Tags(inContext.TagsIn.UnwrapOrDefault()); len(tags) > 0 {\\n\\t\\t\\treturn tags\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (e *Extractor) NamesFromTag(tag string) (out []string, err error) {\\n\\n\\tif err := e.isValidStruct(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\ts := reflect.ValueOf(e.StructAddr).Elem()\\n\\tfields := e.fields(s)\\n\\n\\tfor _, field := range fields {\\n\\t\\tif val, ok := field.tags.Lookup(tag); ok {\\n\\t\\t\\tkey, omit := e.parseOmitempty(val, field.value)\\n\\t\\t\\tif omit {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tout = append(out, key)\\n\\t\\t}\\n\\t}\\n\\n\\treturn\\n}\",\n \"func (e ExtraLayers) Extract() []string {\\n\\tvar l []string\\n\\tfor k, v := range extraLayersMap {\\n\\t\\tif (e & v) > 0 {\\n\\t\\t\\tl = append(l, k)\\n\\t\\t}\\n\\t}\\n\\treturn l\\n}\",\n \"func Bvextract(t TermT, i uint32, j uint32) TermT {\\n\\treturn TermT(C.yices_bvextract(C.term_t(t), C.uint32_t(i), C.uint32_t(j)))\\n}\",\n \"func ProcessTags(t, sep string, repl ...string) []string {\\n\\tr := regexp.MustCompile(\\\"(?i)\\\" + strings.Join(repl, \\\"|\\\"))\\n\\tout := r.ReplaceAllString(strings.ToLower(t), \\\"\\\")\\n\\tout = strings.Replace(out, \\\"and\\\", sep, -1)\\n\\treturn TrimSpacesList(strings.Split(out, sep))\\n}\",\n \"func (fs *Memory) Tags(_ string) (map[string]string, error) {\\n\\ttags := make(map[string]string)\\n\\treturn tags, nil\\n}\",\n \"func RegexpExtract(content, pattern string) (map[string]string, error) {\\n\\tre, err := pool.Compile(pattern)\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"re:[%s] error:%+v\\\", pattern, err)\\n\\t}\\n\\tmatch := re.FindStringSubmatch(content)\\n\\tif len(match) == 0 {\\n\\t\\treturn nil, nil\\n\\t}\\n\\tret := make(map[string]string)\\n\\tfor i, name := range re.SubexpNames() {\\n\\t\\tif i != 0 {\\n\\t\\t\\tif name == \\\"\\\" {\\n\\t\\t\\t\\tname = fmt.Sprintf(\\\"%d\\\", i)\\n\\t\\t\\t}\\n\\t\\t\\tret[name] = strings.TrimSpace(match[i])\\n\\t\\t}\\n\\t}\\n\\treturn ret, nil\\n}\",\n \"func ValuesForTag(doc, tag string) ([]interface{}, error) {\\n\\tn, err := DocToTree(doc)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tm := make(map[string]interface{})\\n\\tm[n.key] = n.treeToMap(false)\\n\\n\\treturn ValuesForKey(m, tag), nil\\n}\",\n \"func (r *tagReader) CollectTagValues(\\n\\ttagKeyID tag.KeyID,\\n\\ttagValueIDs *roaring.Bitmap,\\n\\ttagValues map[uint32]string,\\n) error {\\n\\tfor _, reader := range r.readers {\\n\\t\\tif tagValueIDs.IsEmpty() {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\ttagKeyMetaBlock, err := reader.Get(uint32(tagKeyID))\\n\\t\\tif err != nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\ttagKeyMeta, err := newTagKeyMetaFn(tagKeyMetaBlock)\\n\\t\\tif err != nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tif err := tagKeyMeta.CollectTagValues(tagValueIDs, tagValues); err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (p *packet) retrieveMap(value reflect.Value, tags []string) error {\\n\\tmatchedInstances := reflect.MakeMap(value.Type().Elem())\\n\\tfor tag, prv := range p.getProviders(tags) {\\n\\t\\tinstance, err := prv.getInstance(p.ctn)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tmatchedInstances.SetMapIndex(reflect.ValueOf(tag), instance)\\n\\t}\\n\\tvalue.Elem().Set(matchedInstances)\\n\\treturn nil\\n}\",\n \"func (r *implementation) DistinctTags(ctx context.Context) ([]string, error) {\\n\\tvar tags []string\\n\\terr := pgxscan.Select(ctx, r.db, &tags, `\\nSELECT DISTINCT UNNEST(tags) FROM articles\\n`)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn tags, nil\\n}\",\n \"func getTagIDsByNames(tx *sql.Tx, tags []string) (map[string]string, error) {\\n\\ttagIDs := make(map[string]string)\\n\\n\\trows, err := tx.Query(\\\"select tag_id, tag from tags where tag = any($1)\\\", pg.Array(tags))\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tfor rows.Next() {\\n\\t\\tvar tagID string\\n\\t\\tvar tag string\\n\\t\\tif err = rows.Scan(&tagID, &tag); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttagIDs[tag] = tagID\\n\\t}\\n\\n\\treturn tagIDs, nil\\n}\",\n \"func (o EcsLaunchTemplateOutput) Tags() pulumi.MapOutput {\\n\\treturn o.ApplyT(func(v *EcsLaunchTemplate) pulumi.MapOutput { return v.Tags }).(pulumi.MapOutput)\\n}\",\n \"func (r *LogGroup) Tags() pulumi.MapOutput {\\n\\treturn (pulumi.MapOutput)(r.s.State[\\\"tags\\\"])\\n}\",\n \"func Tags(tags tftags.KeyValueTags) map[string]*string {\\n\\treturn aws.StringMap(tags.Map())\\n}\",\n \"func (o TransitRouterMulticastDomainOutput) Tags() pulumi.MapOutput {\\n\\treturn o.ApplyT(func(v *TransitRouterMulticastDomain) pulumi.MapOutput { return v.Tags }).(pulumi.MapOutput)\\n}\",\n \"func PackTags(in map[string]string) string {\\n\\ttags := []string{}\\n\\n\\tfor k, v := range in {\\n\\t\\ttags = append(tags, fmt.Sprintf(\\\"%s:%s\\\", k, v))\\n\\t}\\n\\n\\tsort.Strings(tags)\\n\\n\\treturn strings.Join(tags, \\\",\\\")\\n}\",\n \"func getFieldTags(t reflect.StructField) (res []string) {\\n\\tif tags := t.Tag.Get(mapEnvTagName); len(tags) > 0 {\\n\\t\\tfor _, s := range strings.Split(tags, \\\",\\\") {\\n\\t\\t\\tif len(s) > 0 {\\n\\t\\t\\t\\tres = append(res, s)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// ignore json tags and field name if mpe tag is present\\n\\tif len(res) > 0 {\\n\\t\\treturn\\n\\t}\\n\\n\\tif tags := t.Tag.Get(\\\"json\\\"); len(tags) > 0 {\\n\\t\\tjsonTags := strings.Split(tags, \\\",\\\")\\n\\t\\tif len(jsonTags) > 0 && len(jsonTags[0]) > 0 {\\n\\t\\t\\tres = append(res, jsonTags[0])\\n\\t\\t}\\n\\t}\\n\\n\\t// ignore field name if json tag is present\\n\\tif len(res) > 0 {\\n\\t\\treturn\\n\\t}\\n\\n\\tres = append(res, t.Name)\\n\\n\\treturn\\n}\",\n \"func (o LookupListenerResultOutput) Tags() pulumi.StringMapOutput {\\n\\treturn o.ApplyT(func(v LookupListenerResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\\n}\",\n \"func (o EntityRecognizerOutput) Tags() pulumi.StringMapOutput {\\n\\treturn o.ApplyT(func(v *EntityRecognizer) pulumi.StringMapOutput { return v.Tags }).(pulumi.StringMapOutput)\\n}\",\n \"func Tags(v interface{}, key string) (map[string]string, error) {\\n\\treturn New(v).Tags(key)\\n}\",\n \"func elbTags(tags map[string]string) []*elb.Tag {\\n\\tvar e []*elb.Tag\\n\\n\\tfor k, v := range tags {\\n\\t\\te = append(e, elbTag(k, v))\\n\\t}\\n\\n\\treturn e\\n}\",\n \"func SetTagsOut(ctx context.Context, tags map[string]*string) {\\n\\tif inContext, ok := tftags.FromContext(ctx); ok {\\n\\t\\tinContext.TagsOut = types.Some(KeyValueTags(ctx, tags))\\n\\t}\\n}\",\n \"func processJaegerTags(s *model.Span) (*string, *trace.Endpoint, map[string]string) {\\n\\tvar kind *string\\n\\tvar remote *trace.Endpoint\\n\\ttags := make(map[string]string, len(s.Tags))\\n\\n\\tensureRemote := func() {\\n\\t\\tif remote == nil {\\n\\t\\t\\tremote = &trace.Endpoint{}\\n\\t\\t}\\n\\t}\\n\\n\\tfor i := range s.Tags {\\n\\t\\tswitch s.Tags[i].Key {\\n\\t\\tcase string(ext.PeerHostIPv4):\\n\\t\\t\\tip := convertPeerIPv4(&s.Tags[i])\\n\\t\\t\\tif ip == \\\"\\\" {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tensureRemote()\\n\\t\\t\\tremote.Ipv4 = pointer.String(ip)\\n\\t\\t// ipv6 host is always string\\n\\t\\tcase string(ext.PeerHostIPv6):\\n\\t\\t\\tif s.Tags[i].VStr != \\\"\\\" {\\n\\t\\t\\t\\tensureRemote()\\n\\t\\t\\t\\tremote.Ipv6 = pointer.String(s.Tags[i].VStr)\\n\\t\\t\\t}\\n\\t\\tcase string(ext.PeerPort):\\n\\t\\t\\tport := convertPeerPort(&s.Tags[i])\\n\\t\\t\\tif port == 0 {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tensureRemote()\\n\\t\\t\\tremote.Port = &port\\n\\t\\tcase string(ext.PeerService):\\n\\t\\t\\tensureRemote()\\n\\t\\t\\tremote.ServiceName = pointer.String(s.Tags[i].VStr)\\n\\t\\tcase string(ext.SpanKind):\\n\\t\\t\\tkind = convertKind(&s.Tags[i])\\n\\t\\tdefault:\\n\\t\\t\\tval := tagValueToString(&s.Tags[i])\\n\\t\\t\\tif val != \\\"\\\" {\\n\\t\\t\\t\\ttags[s.Tags[i].Key] = val\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn kind, remote, tags\\n}\",\n \"func Tags(tags tftags.KeyValueTags) []*inspector.Tag {\\n\\tresult := make([]*inspector.Tag, 0, len(tags))\\n\\n\\tfor k, v := range tags.Map() {\\n\\t\\ttag := &inspector.Tag{\\n\\t\\t\\tKey: aws.String(k),\\n\\t\\t\\tValue: aws.String(v),\\n\\t\\t}\\n\\n\\t\\tresult = append(result, tag)\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func promGroupTags(args []parse.Node) (parse.Tags, error) {\\n\\ttags := make(parse.Tags)\\n\\tcsvTags := strings.Split(args[1].(*parse.StringNode).Text, \\\",\\\")\\n\\tfor _, k := range csvTags {\\n\\t\\ttags[k] = struct{}{}\\n\\t}\\n\\treturn tags, nil\\n}\",\n \"func (r *Distribution) Tags() pulumi.MapOutput {\\n\\treturn (pulumi.MapOutput)(r.s.State[\\\"tags\\\"])\\n}\",\n \"func (m FieldMap) Tags() []Tag {\\n\\ttags := make([]Tag, 0, len(m.tagLookup))\\n\\tfor t := range m.tagLookup {\\n\\t\\ttags = append(tags, t)\\n\\t}\\n\\n\\treturn tags\\n}\",\n \"func getTagsForSuggestions(q Queryable, suggs []*mpdata.Suggestion) (err error) {\\n\\tgetTagsStmt, err := q.Prepare(\\\"SELECT tag.tag FROM tag WHERE tag.mealid = ?\\\")\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tdefer getTagsStmt.Close()\\n\\n\\tfor _, sugg := range suggs {\\n\\t\\tsugg.MT.Tags, err = getMealTagsPrepared(getTagsStmt, sugg.MT.Meal.ID)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func extractHeader(c *gin.Context, tag string) (string, []string, error) {\\n\\tname, required, defaultVal, err := parseTagKey(tag)\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", nil, err\\n\\t}\\n\\theader := c.GetHeader(name)\\n\\n\\t// XXX: deprecated, use of \\\"default\\\" tag is preferred\\n\\tif header == \\\"\\\" && defaultVal != \\\"\\\" {\\n\\t\\treturn name, []string{defaultVal}, nil\\n\\t}\\n\\t// XXX: deprecated, use of \\\"validate\\\" tag is preferred\\n\\tif required && header == \\\"\\\" {\\n\\t\\treturn \\\"\\\", nil, fmt.Errorf(\\\"missing header parameter: %s\\\", name)\\n\\t}\\n\\treturn name, []string{header}, nil\\n}\",\n \"func (e Extractor) extract(dst interface{}, o metav1.Object) (interface{}, error) {\\n\\tdata := make(map[string]interface{})\\n\\tfor name, annotationParser := range e.annotations {\\n\\t\\tval, err := annotationParser.Parse(o)\\n\\t\\tglog.V(6).Infof(\\\"annotation %v in %v %v/%v: %v\\\", name, \\\"o.GetKind()\\\", o.GetNamespace(), o.GetName(), val)\\n\\t\\tif err != nil {\\n\\t\\t\\tif errors.IsMissingAnnotations(err) {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tglog.V(5).Infof(\\\"error reading %v annotation in %v %v/%v: %v\\\", name, \\\"o.GetKind()\\\", o.GetNamespace(), o.GetName(), err)\\n\\t\\t\\treturn dst, err\\n\\t\\t}\\n\\t\\tif val != nil {\\n\\t\\t\\tdata[name] = val\\n\\t\\t}\\n\\t}\\n\\terr := mergo.MapWithOverwrite(dst, data)\\n\\tif err != nil {\\n\\t\\tglog.Errorf(\\\"unexpected error merging extracted annotations: %v\\\", err)\\n\\t\\treturn dst, err\\n\\t}\\n\\n\\treturn dst, nil\\n}\",\n \"func (o LookupGroupResultOutput) Tags() pulumi.StringMapOutput {\\n\\treturn o.ApplyT(func(v LookupGroupResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\\n}\",\n \"func (p Paperless) GetTag(s string, caseSensitive bool) (TagList, error) {\\n\\t// A place to store the results\\n\\tvar t Tag\\n\\tvar tl TagList\\n\\n\\t// Make the request\\n\\tif caseSensitive {\\n\\t\\tp.Root += \\\"/tags/?name__contains=\\\" + s\\n\\t} else {\\n\\t\\tp.Root += \\\"/tags/?name__icontains=\\\" + s\\n\\t}\\n\\tu := fmt.Sprint(p)\\n\\tresults, err := p.MakeGetRequest(u)\\n\\tif err != nil {\\n\\t\\tlog.Errorf(\\\"An error occurred making request: %v\\\", err.Error())\\n\\t}\\n\\n\\t// Append results so far to TagList tl\\n\\tfor _, tag := range results {\\n\\t\\tjson.Unmarshal([]byte(tag.Raw), &t)\\n\\t\\ttl = append(tl, t)\\n\\t}\\n\\treturn tl, nil\\n}\",\n \"func (o LookupFirewallPolicyResultOutput) Tags() pulumi.StringMapOutput {\\n\\treturn o.ApplyT(func(v LookupFirewallPolicyResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\\n}\",\n \"func userSelectTags(props []string) (map[string][]string, error) {\\n\\tfmt.Printf(\\\"There are %d properties from which tags can be created. The properties are %+v.\\\\n\\\", len(props), props)\\n\\tfmt.Printf(\\\"For each property, please indicate whether or not you want to create tags.\\\\n\\\")\\n\\n\\tcfgTags := make(map[string][]string)\\n\\treader := bufio.NewReader(os.Stdin)\\n\\n\\t// Ask user which of the properties should be made to tags.\\n\\tfor _, p := range props {\\n\\t\\tfmt.Printf(\\\"Create tags for %s? Y/n\\\\n\\\", p)\\n\\n\\t\\tuserInput, err := reader.ReadString('\\\\n')\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\n\\t\\tif userInput == \\\"Y\\\\n\\\" || userInput == \\\"y\\\\n\\\" {\\n\\t\\t\\tps := setPresets(p)\\n\\t\\t\\tcfgTags[p] = ps\\n\\t\\t}\\n\\t}\\n\\n\\tfmt.Println(\\\"Tags to be created for \\\", cfgTags)\\n\\n\\treturn cfgTags, nil\\n}\",\n \"func (d *Dao) processTag(context *tagContext) (err error) {\\n\\n\\tif context.objectContainer.Has(context.tag.Name) {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tif context.tag.IsArray {\\n\\t\\tvar collection = data.NewCollection()\\n\\t\\tcontext.objectContainer.Put(context.tag.Name, collection)\\n\\t\\terr = context.referenceValues.Apply(context.tag.Name, collection)\\n\\t} else {\\n\\t\\tvar object = make(map[string]interface{})\\n\\t\\tcontext.objectContainer.Put(context.tag.Name, object)\\n\\t\\terr = context.referenceValues.Apply(context.tag.Name, object)\\n\\t}\\n\\treturn err\\n}\",\n \"func prepareStmts(db *sql.DB, unprepared map[string]string) (map[string]*sql.Stmt, error) {\\n\\tprepared := map[string]*sql.Stmt{}\\n\\tfor k, v := range unprepared {\\n\\t\\tstmt, err := db.Prepare(v)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tprepared[k] = stmt\\n\\t}\\n\\n\\treturn prepared, nil\\n}\",\n \"func (u *UniProt) extractSites() {\\n\\ttags := map[string]string{\\n\\t\\t\\\"ACT_SITE\\\": \\\"active\\\", // https://www.uniprot.org/help/act_site\\n\\t\\t\\\"METAL\\\": \\\"metal\\\", // https://www.uniprot.org/help/metal\\n\\t\\t\\\"BINDING\\\": \\\"binding\\\", // https://www.uniprot.org/help/binding\\n\\t\\t\\\"SITE\\\": \\\"site\\\", // https://www.uniprot.org/help/site\\n\\t}\\n\\n\\tfor tag, name := range tags {\\n\\t\\tr, _ := regexp.Compile(\\\"(?ms)^FT[ ]*\\\" + tag + \\\"[ ]*([0-9]*)$.*?note=\\\\\\\"(.*?)\\\\\\\"\\\")\\n\\t\\tmatches := r.FindAllStringSubmatch(string(u.Raw), -1)\\n\\n\\t\\tfor _, site := range matches {\\n\\t\\t\\tpos, _ := strconv.ParseInt(site[1], 10, 64)\\n\\t\\t\\tu.Sites = append(u.Sites,\\n\\t\\t\\t\\t&Site{\\n\\t\\t\\t\\t\\tType: name,\\n\\t\\t\\t\\t\\tPosition: pos,\\n\\t\\t\\t\\t\\tNote: site[2],\\n\\t\\t\\t\\t},\\n\\t\\t\\t)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (o LookupDedicatedIpPoolResultOutput) Tags() pulumi.StringMapOutput {\\n\\treturn o.ApplyT(func(v LookupDedicatedIpPoolResult) map[string]string { return v.Tags }).(pulumi.StringMapOutput)\\n}\",\n \"func extract(buf []byte, name string) []byte {\\n\\textractRE := regexp.MustCompile(`\\\\s+` + name + `.+?{`)\\n\\tbuf = buf[extractRE.FindIndex(buf)[0]:]\\n\\treturn buf[:endRE.FindIndex(buf)[1]]\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60839343","0.5574362","0.54821146","0.54010403","0.5383956","0.52683496","0.5214607","0.51167417","0.50469804","0.5004287","0.4941273","0.49274534","0.49254033","0.4903882","0.48592663","0.48080933","0.47623283","0.47225463","0.4713999","0.47138765","0.47007403","0.46696007","0.4647981","0.46479183","0.46296534","0.45606372","0.45595872","0.45547518","0.45263526","0.44869196","0.44852442","0.44781107","0.44703192","0.4466256","0.44578484","0.4452431","0.44096696","0.44025758","0.44011608","0.4398696","0.4373915","0.43710366","0.43708485","0.4369203","0.43691033","0.43617836","0.43616742","0.43535185","0.432893","0.4314183","0.43040487","0.42995724","0.42915893","0.42851856","0.4272764","0.4272064","0.42649627","0.42594376","0.42553672","0.4254327","0.42455772","0.42272556","0.42112753","0.42093107","0.4200925","0.4188271","0.4187163","0.41848108","0.41714063","0.41608256","0.41541117","0.41524523","0.4145695","0.4142598","0.41408667","0.41325253","0.41313168","0.41297042","0.4125388","0.4112974","0.4108035","0.41045842","0.41021532","0.40965536","0.40887162","0.40864","0.40774727","0.40721464","0.40698415","0.40660205","0.40571183","0.40557876","0.40521762","0.40463388","0.40349358","0.40188926","0.40153018","0.4014067","0.40120387","0.4011521"],"string":"[\n \"0.60839343\",\n \"0.5574362\",\n \"0.54821146\",\n \"0.54010403\",\n \"0.5383956\",\n \"0.52683496\",\n \"0.5214607\",\n \"0.51167417\",\n \"0.50469804\",\n \"0.5004287\",\n \"0.4941273\",\n \"0.49274534\",\n \"0.49254033\",\n \"0.4903882\",\n \"0.48592663\",\n \"0.48080933\",\n \"0.47623283\",\n \"0.47225463\",\n \"0.4713999\",\n \"0.47138765\",\n \"0.47007403\",\n \"0.46696007\",\n \"0.4647981\",\n \"0.46479183\",\n \"0.46296534\",\n \"0.45606372\",\n \"0.45595872\",\n \"0.45547518\",\n \"0.45263526\",\n \"0.44869196\",\n \"0.44852442\",\n \"0.44781107\",\n \"0.44703192\",\n \"0.4466256\",\n \"0.44578484\",\n \"0.4452431\",\n \"0.44096696\",\n \"0.44025758\",\n \"0.44011608\",\n \"0.4398696\",\n \"0.4373915\",\n \"0.43710366\",\n \"0.43708485\",\n \"0.4369203\",\n \"0.43691033\",\n \"0.43617836\",\n \"0.43616742\",\n \"0.43535185\",\n \"0.432893\",\n \"0.4314183\",\n \"0.43040487\",\n \"0.42995724\",\n \"0.42915893\",\n \"0.42851856\",\n \"0.4272764\",\n \"0.4272064\",\n \"0.42649627\",\n \"0.42594376\",\n \"0.42553672\",\n \"0.4254327\",\n \"0.42455772\",\n \"0.42272556\",\n \"0.42112753\",\n \"0.42093107\",\n \"0.4200925\",\n \"0.4188271\",\n \"0.4187163\",\n \"0.41848108\",\n \"0.41714063\",\n \"0.41608256\",\n \"0.41541117\",\n \"0.41524523\",\n \"0.4145695\",\n \"0.4142598\",\n \"0.41408667\",\n \"0.41325253\",\n \"0.41313168\",\n \"0.41297042\",\n \"0.4125388\",\n \"0.4112974\",\n \"0.4108035\",\n \"0.41045842\",\n \"0.41021532\",\n \"0.40965536\",\n \"0.40887162\",\n \"0.40864\",\n \"0.40774727\",\n \"0.40721464\",\n \"0.40698415\",\n \"0.40660205\",\n \"0.40571183\",\n \"0.40557876\",\n \"0.40521762\",\n \"0.40463388\",\n \"0.40349358\",\n \"0.40188926\",\n \"0.40153018\",\n \"0.4014067\",\n \"0.40120387\",\n \"0.4011521\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.60490483"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":2799,"cells":{"query":{"kind":"string","value":"extractBinaryExprTags extracts a tag key/value map from a statement."},"document":{"kind":"string","value":"func (p *Planner) extractBinaryExprTags(name string, expr Expr, ref *VarRef, value Expr, tags map[string]string) (Expr, error) {\n\t// Ignore if the value is not a string literal.\n\tlit, ok := value.(*StringLiteral)\n\tif !ok {\n\t\treturn expr, nil\n\t}\n\n\t// Extract the key and remove the measurement prefix.\n\tkey := strings.TrimPrefix(ref.Val, name+\".\")\n\n\t// If tag is already filtered then return error.\n\tif _, ok := tags[key]; ok {\n\t\treturn nil, fmt.Errorf(\"duplicate tag filter: %s.%s\", name, key)\n\t}\n\n\t// Add tag to the filter.\n\ttags[key] = lit.Val\n\n\t// Return nil to remove the expression.\n\treturn nil, nil\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (p *Planner) extractTags(name string, expr Expr, tags map[string]string) (Expr, error) {\n\t// TODO: Refactor into a walk-like Replace().\n\tswitch expr := expr.(type) {\n\tcase *BinaryExpr:\n\t\t// If the LHS is a variable ref then check for tag equality.\n\t\tif lhs, ok := expr.LHS.(*VarRef); ok && expr.Op == EQ {\n\t\t\treturn p.extractBinaryExprTags(name, expr, lhs, expr.RHS, tags)\n\t\t}\n\n\t\t// If the RHS is a variable ref then check for tag equality.\n\t\tif rhs, ok := expr.RHS.(*VarRef); ok && expr.Op == EQ {\n\t\t\treturn p.extractBinaryExprTags(name, expr, rhs, expr.LHS, tags)\n\t\t}\n\n\t\t// Recursively process LHS.\n\t\tlhs, err := p.extractTags(name, expr.LHS, tags)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr.LHS = lhs\n\n\t\t// Recursively process RHS.\n\t\trhs, err := p.extractTags(name, expr.RHS, tags)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr.RHS = rhs\n\n\t\treturn expr, nil\n\n\tcase *ParenExpr:\n\t\te, err := p.extractTags(name, expr.Expr, tags)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\texpr.Expr = e\n\t\treturn expr, nil\n\n\tdefault:\n\t\treturn expr, nil\n\t}\n}","func (sm *SpecMore) TagsMap(inclTop, inclOps bool) map[string]int {\n\ttagsMap := map[string]int{}\n\tif inclTop {\n\t\tfor _, tag := range sm.Spec.Tags {\n\t\t\ttagName := strings.TrimSpace(tag.Name)\n\t\t\tif len(tagName) > 0 {\n\t\t\t\tif _, ok := tagsMap[tagName]; !ok {\n\t\t\t\t\ttagsMap[tagName] = 0\n\t\t\t\t}\n\t\t\t\ttagsMap[tagName]++\n\t\t\t}\n\t\t}\n\t}\n\tif inclOps {\n\t\tVisitOperations(sm.Spec, func(skipPath, skipMethod string, op *oas3.Operation) {\n\t\t\tfor _, tagName := range op.Tags {\n\t\t\t\ttagName = strings.TrimSpace(tagName)\n\t\t\t\tif len(tagName) > 0 {\n\t\t\t\t\tif _, ok := tagsMap[tagName]; !ok {\n\t\t\t\t\t\ttagsMap[tagName] = 0\n\t\t\t\t\t}\n\t\t\t\t\ttagsMap[tagName]++\n\t\t\t\t}\n\t\t\t}\n\t\t})\n\t}\n\treturn tagsMap\n}","func (e *Extractor) FieldValueFromTagMap(tag string) (out map[string]interface{}, err error) {\n\n\tif err := e.isValidStruct(); err != nil {\n\t\treturn nil, err\n\t}\n\n\tout = make(map[string]interface{})\n\ts := reflect.ValueOf(e.StructAddr).Elem()\n\tfields := e.fields(s)\n\n\tfor _, field := range fields {\n\t\tif val, ok := field.tags.Lookup(tag); ok {\n\t\t\tkey, omit := e.parseOmitempty(val, field.value)\n\t\t\tif omit {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tout[key] = field.value.Interface()\n\t\t}\n\n\t}\n\n\treturn\n}","func keyvalTagsMap(keyMap []string, valueMap []interface{}, f *Feature) (tags []uint32, err error) {\n\n\tif f == nil {\n\t\treturn nil, ErrNilFeature\n\t}\n\n\tvar kidx, vidx int64\n\n\tfor key, val := range f.Tags {\n\n\t\tkidx, vidx = -1, -1 // Set to known not found value.\n\n\t\tfor i, k := range keyMap {\n\t\t\tif k != key {\n\t\t\t\tcontinue // move to the next key\n\t\t\t}\n\t\t\tkidx = int64(i)\n\t\t\tbreak // we found a match\n\t\t}\n\n\t\tif kidx == -1 {\n\t\t\tlog.Printf(\"did not find key (%v) in keymap.\", key)\n\t\t\treturn tags, fmt.Errorf(\"did not find key (%v) in keymap.\", key)\n\t\t}\n\n\t\t// if val is nil we skip it for now\n\t\t// https://github.com/mapbox/vector-tile-spec/issues/62\n\t\tif val == nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tfor i, v := range valueMap {\n\t\t\tswitch tv := val.(type) {\n\t\t\tdefault:\n\t\t\t\treturn tags, fmt.Errorf(\"value (%[1]v) of type (%[1]T) for key (%[2]v) is not supported.\", tv, key)\n\t\t\tcase string:\n\t\t\t\tvmt, ok := v.(string) // Make sure the type of the Value map matches the type of the Tag's value\n\t\t\t\tif !ok || vmt != tv { // and that the values match\n\t\t\t\t\tcontinue // if they don't match move to the next value.\n\t\t\t\t}\n\t\t\tcase fmt.Stringer:\n\t\t\t\tvmt, ok := v.(fmt.Stringer)\n\t\t\t\tif !ok || vmt.String() != tv.String() {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int:\n\t\t\t\tvmt, ok := v.(int)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int8:\n\t\t\t\tvmt, ok := v.(int8)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int16:\n\t\t\t\tvmt, ok := v.(int16)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int32:\n\t\t\t\tvmt, ok := v.(int32)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase int64:\n\t\t\t\tvmt, ok := v.(int64)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint:\n\t\t\t\tvmt, ok := v.(uint)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint8:\n\t\t\t\tvmt, ok := v.(uint8)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint16:\n\t\t\t\tvmt, ok := v.(uint16)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint32:\n\t\t\t\tvmt, ok := v.(uint32)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase uint64:\n\t\t\t\tvmt, ok := v.(uint64)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\tcase float32:\n\t\t\t\tvmt, ok := v.(float32)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase float64:\n\t\t\t\tvmt, ok := v.(float64)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\tcase bool:\n\t\t\t\tvmt, ok := v.(bool)\n\t\t\t\tif !ok || vmt != tv {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t} // Values Switch Statement\n\t\t\t// if the values match let's record the index.\n\t\t\tvidx = int64(i)\n\t\t\tbreak // we found our value no need to continue on.\n\t\t} // range on value\n\n\t\tif vidx == -1 { // None of the values matched.\n\t\t\treturn tags, fmt.Errorf(\"did not find a value: %v in valuemap.\", val)\n\t\t}\n\t\ttags = append(tags, uint32(kidx), uint32(vidx))\n\t} // Move to the next tag key and value.\n\n\treturn tags, nil\n}","func GetValueTagMap(src map[string]interface{}) map[string]interface{} {\n\tres := NewEmptyTagMap()\n\tres[\"inname\"] = \"value\"\n\tres[\"exname\"] = \"value\"\n\tres[\"type\"] = src[\"type\"]\n\tres[\"length\"] = src[\"length\"]\n\tres[\"scale\"] = src[\"scale\"]\n\tres[\"precision\"] = src[\"precision\"]\n\tres[\"fieldid\"] = src[\"fieldid\"]\n\treturn res\n}","func newBinaryExprGuard(expr *influxql.BinaryExpr) *exprGuard {\n\t// if it's a nested binary expression, always match.\n\tif _, ok := expr.LHS.(*influxql.BinaryExpr); ok {\n\t\treturn nil\n\t} else if _, ok := expr.RHS.(*influxql.BinaryExpr); ok {\n\t\treturn nil\n\t}\n\n\t// ensure one of the expressions is a VarRef, and make that the key.\n\tkey, ok := expr.LHS.(*influxql.VarRef)\n\tvalue := expr.RHS\n\tif !ok {\n\t\tkey, ok = expr.RHS.(*influxql.VarRef)\n\t\tif !ok {\n\t\t\treturn nil\n\t\t}\n\t\tvalue = expr.LHS\n\t}\n\n\t// check the key for situations we know we can't filter.\n\tif key.Val != \"_name\" && key.Type != influxql.Unknown && key.Type != influxql.Tag {\n\t\treturn nil\n\t}\n\n\t// scrutinize the value to return an efficient guard.\n\tswitch value := value.(type) {\n\tcase *influxql.StringLiteral:\n\t\tval := []byte(value.Val)\n\t\tg := &exprGuard{tagMatches: &tagGuard{\n\t\t\tmeas: key.Val == \"_name\",\n\t\t\tkey: []byte(key.Val),\n\t\t}}\n\n\t\tswitch expr.Op {\n\t\tcase influxql.EQ:\n\t\t\tg.tagMatches.op = func(x []byte) bool { return bytes.Equal(val, x) }\n\n\t\tcase influxql.NEQ:\n\t\t\tg.tagMatches.op = func(x []byte) bool { return !bytes.Equal(val, x) }\n\n\t\tdefault: // any other operator isn't valid. conservatively match everything.\n\t\t\treturn nil\n\t\t}\n\n\t\treturn g\n\n\tcase *influxql.RegexLiteral:\n\t\t// There's a tradeoff between being precise and being fast. For example, if the\n\t\t// delete includes a very expensive regex, we don't want to run that against every\n\t\t// incoming point. The decision here is to match any point that has a possibly\n\t\t// expensive match if there is any overlap on the tags. In other words, expensive\n\t\t// matches get transformed into trivially matching everything.\n\t\treturn &exprGuard{tagExists: map[string]struct{}{key.Val: {}}}\n\n\tcase *influxql.VarRef:\n\t\t// We could do a better job here by encoding the two names and checking the points\n\t\t// against them, but I'm not quite sure how to do that. Be conservative and match\n\t\t// any points that contain either the key or value.\n\n\t\t// since every point has a measurement, always match if either are on the measurement.\n\t\tif key.Val == \"_name\" || value.Val == \"_name\" {\n\t\t\treturn nil\n\t\t}\n\t\treturn &exprGuard{tagExists: map[string]struct{}{\n\t\t\tkey.Val: {},\n\t\t\tvalue.Val: {},\n\t\t}}\n\n\tdefault: // any other value type matches everything\n\t\treturn nil\n\t}\n}","func mapColumnTags(tables map[string]schema.Schema) (m map[uint64]string) {\n\tm = make(map[uint64]string, len(tables))\n\tfor tbl, sch := range tables {\n\t\tfor _, tag := range sch.GetAllCols().Tags {\n\t\t\tm[tag] = tbl\n\t\t}\n\t}\n\treturn\n}","func parseTag(stag StructTag) map[string]string {\n\ttag := string(stag)\n\tm := make(map[string]string)\n\tfor tag != \"\" {\n\t\ti := 0\n\t\tfor i < len(tag) && tag[i] == ' ' {\n\t\t\ti += 1\n\t\t}\n\t\ttag = tag[i:]\n\t\tif tag == \"\" {\n\t\t\tbreak\n\t\t}\n\n\t\ti = 0\n\t\tfor i < len(tag) && tag[i] > ' ' && tag[i] != ':' && tag[i] != '\"' && tag[i] != 0x7f {\n\t\t\ti++\n\t\t}\n\t\tif i == 0 || i+1 >= len(tag) || tag[i] != ':' || tag[i+1] != '\"' {\n\t\t\tbreak\n\t\t}\n\t\tname := string(tag[:i])\n\t\ttag = tag[i+1:]\n\n\t\ti = 1\n\t\tfor i < len(tag) && tag[i] != '\"' {\n\t\t\tif tag[i] == '\\\\' {\n\t\t\t\ti++\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t\tif i >= len(tag) {\n\t\t\tbreak\n\t\t}\n\t\tqvalue := string(tag[:i+1])\n\t\ttag = tag[i+1:]\n\n\t\tvalue, err := strconv.Unquote(qvalue)\n\t\tif err != nil {\n\t\t\tcontinue\n\t\t\tm[name] = value\n\t\t}\n\t\treturn m\n\t}\n\treturn m\n}","func mapTags(tags []*elb.Tag) map[string]string {\n\ttagMap := make(map[string]string)\n\tfor _, t := range tags {\n\t\ttagMap[*t.Key] = *t.Value\n\t}\n\n\treturn tagMap\n}","func tagKeysToMap(tags string) map[string]*string {\n\toutput := make(map[string]*string)\n\n\tfor _, tag := range strings.Split(strings.TrimSpace(tags), \",\") {\n\t\tsplit := strings.SplitN(tag, \"=\", 2)\n\t\tkey := strings.TrimSpace(split[0])\n\t\tvalue := \"\"\n\n\t\tif key == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tif len(split) > 1 {\n\t\t\tvalue = strings.TrimSpace(split[1])\n\t\t}\n\n\t\toutput[key] = &value\n\t}\n\n\tif len(output) == 0 {\n\t\treturn nil\n\t}\n\n\treturn output\n}","func parseNextBinaryValue(ann []Symbol, r io.Reader) (Value, error) {\n\tswitch high, low, err := readNibblesHighAndLow(r); {\n\tcase err != nil:\n\t\treturn nil, err\n\tcase low == 0xF:\n\t\treturn parseBinaryNull(high)\n\tcase high == binaryTypePadding:\n\t\treturn parseBinaryPadding(low, r)\n\tcase high == binaryTypeBool:\n\t\treturn parseBinaryBool(ann, low)\n\tcase high == binaryTypeInt || high == binaryTypeNegInt:\n\t\t// 2 = positive integer, 3 = negative integer.\n\t\treturn parseBinaryInt(ann, high == binaryTypeNegInt, low, r)\n\tcase high == binaryTypeFloat:\n\t\treturn parseBinaryFloat(ann, low, r)\n\tcase high == binaryTypeDecimal:\n\t\treturn parseBinaryDecimal(ann, low, r)\n\tcase high == binaryTypeTimestamp:\n\t\treturn parseBinaryTimestamp(ann, low, r)\n\tcase high == binaryTypeSymbol:\n\t\treturn parseBinarySymbol(ann, low, r)\n\tcase high == binaryTypeString:\n\t\treturn parseBinaryString(ann, low, r)\n\tcase high == binaryTypeBlob || high == binaryTypeClob:\n\t\treturn parseBinaryBytes(ann, high, low, r)\n\tcase high == binaryTypeList || high == binaryTypeSExp:\n\t\treturn parseBinaryList(ann, high, low, r)\n\tcase high == binaryTypeStruct:\n\t\treturn parseBinaryStruct(ann, low, r)\n\tcase high == binaryTypeAnnotation:\n\t\tif len(ann) != 0 {\n\t\t\treturn nil, errors.New(\"nesting annotations is not legal\")\n\t\t}\n\t\treturn parseBinaryAnnotation(low, r)\n\tdefault:\n\t\treturn nil, errors.Errorf(\"invalid header combination - high: %d low: %d\", high, low)\n\t}\n}","func parseBinary(lex *lexer, prec1 int) Expr {\n\tlhs := parseUnary(lex)\n\tfor prec := precedence(lex.token); prec >= prec1; prec-- {\n\t\tfor precedence(lex.token) == prec {\n\t\t\top := lex.token\n\t\t\tlex.next() // consume operator\n\t\t\trhs := parseBinary(lex, prec+1)\n\t\t\tlhs = binary{op, lhs, rhs}\n\t\t}\n\t}\n\treturn lhs\n}","func evalBinaryIntExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar r int64\n\tvar err error\n\tvar b bool\n\tis_bool := false\n\n\txx, yy := x.Int(), y.Int()\n\tswitch op {\n\tcase token.ADD: r = xx + yy\n\tcase token.SUB: r = xx - yy\n\tcase token.MUL: r = xx * yy\n\tcase token.QUO: r = xx / yy\n\tcase token.REM: r = xx % yy\n\tcase token.AND: r = xx & yy\n\tcase token.OR: r = xx | yy\n\tcase token.XOR: r = xx ^ yy\n\tcase token.AND_NOT: r = xx &^ yy\n\tcase token.EQL: b = xx == yy; is_bool = true\n\tcase token.NEQ: b = xx != yy; is_bool = true\n\tcase token.LEQ: b = xx <= yy; is_bool = true\n\tcase token.GEQ: b = xx >= yy; is_bool = true\n\tcase token.LSS: b = xx < yy; is_bool = true\n\tcase token.GTR: b = xx > yy; is_bool = true\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\tif is_bool {\n\t\treturn reflect.ValueOf(b), err\n\t} else {\n\t\treturn reflect.ValueOf(r).Convert(x.Type()), err\n\t}\n}","func parseBinaryVersionMarker(r io.Reader) (Value, error) {\n\tnumBytes := len(ion10BVM)\n\tbvm := make([]byte, numBytes)\n\tbvm[0] = ion10BVM[0]\n\tif n, err := r.Read(bvm[1:]); err != nil || n != numBytes-1 {\n\t\treturn nil, errors.Errorf(\"unable to read binary version marker - read %d bytes of %d with err: %v\", n, numBytes-1, err)\n\t}\n\n\tif err := verifyByteVersionMarker(bytes.NewReader(bvm)); err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn nil, nil\n}","func (s *BaseMySqlParserListener) EnterBinaryComparasionPredicate(ctx *BinaryComparasionPredicateContext) {\n}","func GetColumnAttributesFromTag(tag *reflect.StructTag) map[string]bool {\n\tfieldTags := strings.Split(tag.Get(\"field\"), \",\")\n\tattributes := map[string]bool{}\n\tfor _, tag := range fieldTags[1:] {\n\t\tattributes[tag] = true\n\t}\n\treturn attributes\n}","func RaggedBincountBinaryOutput(value bool) RaggedBincountAttr {\n\treturn func(m optionalAttr) {\n\t\tm[\"binary_output\"] = value\n\t}\n}","func evalBinaryStringExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar err error\n\tvar r string\n\tvar b bool\n\tis_bool := false\n\n\txx, yy := x.String(), y.String()\n\tswitch op {\n\tcase token.ADD:\tr = xx + yy\n\tcase token.EQL: b = xx == yy; is_bool = true\n\tcase token.NEQ: b = xx != yy; is_bool = true\n\tcase token.LEQ: b = xx <= yy; is_bool = true\n\tcase token.GEQ: b = xx >= yy; is_bool = true\n\tcase token.LSS: b = xx < yy; is_bool = true\n\tcase token.GTR: b = xx > yy; is_bool = true\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\tif is_bool {\n\t\treturn reflect.ValueOf(b), err\n\t} else {\n\t\treturn reflect.ValueOf(r).Convert(x.Type()), err\n\t}\n}","func parseBinary(s *scanner) ([]byte, error) {\n\tif s.eof() || s.data[s.off] != ':' {\n\t\treturn nil, &UnmarshalError{s.off, ErrInvalidBinaryFormat}\n\t}\n\ts.off++\n\n\tstart := s.off\n\n\tfor !s.eof() {\n\t\tc := s.data[s.off]\n\t\tif c == ':' {\n\t\t\t// base64decode\n\t\t\tdecoded, err := base64.StdEncoding.DecodeString(s.data[start:s.off])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, &UnmarshalError{s.off, err}\n\t\t\t}\n\t\t\ts.off++\n\n\t\t\treturn decoded, nil\n\t\t}\n\n\t\tif !isAlpha(c) && !isDigit(c) && c != '+' && c != '/' && c != '=' {\n\t\t\treturn nil, &UnmarshalError{s.off, ErrInvalidBinaryFormat}\n\t\t}\n\t\ts.off++\n\t}\n\n\treturn nil, &UnmarshalError{s.off, ErrInvalidBinaryFormat}\n}","func (s *BaselimboListener) EnterBinary_expression(ctx *Binary_expressionContext) {}","func (p *Parser) parseBitwiseExpression() Expression {\n\tleft := p.parseEqualityExpression()\n\tfor {\n\t\tif op, ok := p.match(ttBitAnd, ttBitOr, ttBitXor); ok {\n\t\t\tright := p.parseEqualityExpression()\n\t\t\tleft = NewBinaryExpression(left, op.typ, right)\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn left\n}","func Bvextract(t TermT, i uint32, j uint32) TermT {\n\treturn TermT(C.yices_bvextract(C.term_t(t), C.uint32_t(i), C.uint32_t(j)))\n}","func ParseBvbin(s string) TermT {\n\tcs := C.CString(s)\n\tdefer C.free(unsafe.Pointer(cs))\n\treturn TermT(C.yices_parse_bvbin(cs))\n}","func VEXTRACTI64X2(ops ...operand.Op) { ctx.VEXTRACTI64X2(ops...) }","func compareMap(lParam interface{}, subConditions map[string]interface{}) []byte {\n\tswitch lParam.(type) {\n\t// when lparam is integer, convert float64\n\tcase int, int32, uint32, int64, uint64:\n\t\tlParam = jsonTypeConverter(lParam)\n\t\tbreak\n\t}\n\n\tbuf := new(bytes.Buffer)\n\t// condition [key : operator / value : operand]\n\tfor op, rParam := range subConditions {\n\t\tswitch rParam.(type) {\n\t\t// when rparam is integer, convert float64\n\t\tcase int, int32, uint32, int64, uint64:\n\t\t\trParam = jsonTypeConverter(rParam)\n\t\t\tbreak\n\t\t}\n\n\t\tcompareValue(op, lParam, rParam, buf)\n\t}\n\n\treturn buf.Bytes()\n}","func VEXTRACTI64X4(ops ...operand.Op) { ctx.VEXTRACTI64X4(ops...) }","func (bmap *FuseBmapIn) ParseBinary(bcontent []byte) error {\n\n\tlength := len(bcontent)\n\n\tif length < 16 {\n\t\treturn ErrDataLen\n\t}\n\n\terr := common.ParseBinary(bcontent, bmap)\n\n\treturn err\n}","func Extract(ctx context.Context) *Tags {\n\tt, ok := ctx.Value(ctxMarkerKey).(*Tags)\n\tif !ok {\n\t\treturn &Tags{values: make(map[string]interface{})}\n\t}\n\n\treturn t\n}","func structTagIndices(st reflect.Type) map[string]int {\n\tct := st.NumField()\n\tret := make(map[string]int, ct)\n\n\tfor i := 0; i < ct; i++ {\n\t\tfield := st.Field(i)\n\t\tattrName := field.Tag.Get(\"cty\")\n\t\tif attrName != \"\" {\n\t\t\tret[attrName] = i\n\t\t}\n\t}\n\n\treturn ret\n}","func (e *Extractor) TagMapping(from, to string) (out map[string]string, err error) {\n\tif err := e.isValidStruct(); err != nil {\n\t\treturn nil, err\n\t}\n\n\tout = make(map[string]string)\n\ts := reflect.ValueOf(e.StructAddr).Elem()\n\tfields := e.fields(s)\n\n\tfor _, field := range fields {\n\t\tfromTag, fromOk := field.tags.Lookup(from)\n\t\ttoTag, toOk := field.tags.Lookup(to)\n\t\tif toOk && fromOk {\n\t\t\tout[fromTag] = toTag\n\t\t}\n\t}\n\n\treturn\n}","func (r *tagReader) FindValueIDsByExprForTagKeyID(tagKeyID tag.KeyID, expr stmt.TagFilter) (*roaring.Bitmap, error) {\n\ttagKeyMetas := r.filterTagKeyMetas(tagKeyID)\n\tif len(tagKeyMetas) == 0 {\n\t\treturn nil, fmt.Errorf(\"%w, tagKeyID: %d\", constants.ErrTagKeyMetaNotFound, tagKeyID)\n\t}\n\ttagValueIDs := roaring.New()\n\tfor _, tagKeyMeta := range tagKeyMetas {\n\t\tswitch expression := expr.(type) {\n\t\tcase *stmt.EqualsExpr:\n\t\t\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueID(expression.Value))\n\t\tcase *stmt.InExpr:\n\t\t\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueIDs(expression.Values))\n\t\tcase *stmt.LikeExpr:\n\t\t\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueIDsByLike(expression.Value))\n\t\tcase *stmt.RegexExpr:\n\t\t\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueIDsByRegex(expression.Regexp))\n\t\tdefault:\n\t\t\treturn nil, fmt.Errorf(\"%w, unsupported expr, tagKeyID: %d\",\n\t\t\t\tconstants.ErrTagKeyMetaNotFound, tagKeyID)\n\t\t}\n\t}\n\treturn tagValueIDs, nil\n}","func _SplitStatementMaps(db *sql.DB, udn_schema map[string]interface{}, source_array []string) []string {\n\t//UdnLog(udn_schema, \"\\nSplit: Maps: %v\\n\\n\", source_array)\n\n\t// Split Open Compound\n\tsplit_result := _SplitStringArray(source_array, \"{\")\n\n\t// Split Close Compound\n\tsplit_result = _SplitStringArray(split_result, \"}\")\n\n\treturn split_result\n}","func elbTags(tags map[string]string) []*elb.Tag {\n\tvar e []*elb.Tag\n\n\tfor k, v := range tags {\n\t\te = append(e, elbTag(k, v))\n\t}\n\n\treturn e\n}","func (getattr *FuseGetattrIn) ParseBinary(bcontent []byte) error {\n\terr := common.ParseBinary(bcontent, getattr)\n\n\treturn err\n}","func driverArgsToMap(args []driver.Value) (map[string]interface{}, error) {\n\toutput := map[string]interface{}{}\n\tfor _, arg := range args {\n\t\targBytes, ok := arg.([]byte)\n\t\tif !ok {\n\t\t\treturn nil, errors.New(\"You must pass only a gob encoded map to the Exec/Query args\")\n\t\t}\n\n\t\tm, err := encoding.Unmarshal(argBytes)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tfor k, v := range m.(map[string]interface{}) {\n\t\t\toutput[k] = v\n\t\t}\n\n\t}\n\n\treturn output, nil\n}","func (vind *Varbinary) Map(_ VCursor, ids []interface{}) ([][]byte, error) {\n\tout := make([][]byte, 0, len(ids))\n\tfor _, id := range ids {\n\t\tdata, err := getVarbinaryHash(id)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"VarBinary_hash.Map :%v\", err)\n\t\t}\n\t\tout = append(out, data)\n\t}\n\treturn out, nil\n}","func _SplitStatementMapKeyValues(db *sql.DB, udn_schema map[string]interface{}, source_array []string) []string {\n\t//UdnLog(udn_schema, \"\\nSplit: Map Key Values: %v\\n\\n\", source_array)\n\n\treturn source_array\n}","func parseTags(st reflect.StructTag) tags {\n\ts := st.Get(ndrNameSpace)\n\tt := tags{\n\t\tValues: []string{},\n\t\tMap: make(map[string]string),\n\t}\n\tif s != \"\" {\n\t\tndrTags := strings.Trim(s, `\"`)\n\t\tfor _, tag := range strings.Split(ndrTags, \",\") {\n\t\t\tif strings.Contains(tag, \":\") {\n\t\t\t\tm := strings.SplitN(tag, \":\", 2)\n\t\t\t\tt.Map[m[0]] = m[1]\n\t\t\t} else {\n\t\t\t\tt.Values = append(t.Values, tag)\n\t\t\t}\n\t\t}\n\t}\n\treturn t\n}","func ConvertRecord(binMap as.BinMap) map[string]interface{} {\n\tbins := make(map[string]interface{})\n\tfor key, value := range binMap {\n\t\tswitch value := value.(type) {\n\t\tcase map[string]interface{}:\n\t\t\tlog.Println(\"converting stringMap \", key)\n\t\t\tval := ConvertStringMap(value)\n\t\t\tbins[key] = val\n\t\tcase map[interface{}]interface{}:\n\t\t\tlog.Println(\"converting interfaceMap \", key)\n\t\t\tval := ConvertInterfaceMap(value)\n\t\t\tbins[key] = val\n\t\tcase []interface{}:\n\t\t\tlog.Println(\"converting interfaceArray \", key)\n\t\t\tval := ConvertInterfaceArray(value)\n\t\t\tbins[key] = val\n\t\tdefault:\n\t\t\tlog.Println(\"converting normal \", key)\n\t\t\tbins[key] = value\n\t\t}\n\t}\n\treturn bins\n}","func keyvalMapsFromFeatures(features []Feature) (keyMap []string, valMap []interface{}, err error) {\n\tvar didFind bool\n\tfor _, f := range features {\n\t\tfor k, v := range f.Tags {\n\t\t\tdidFind = false\n\t\t\tfor _, mk := range keyMap {\n\t\t\t\tif k == mk {\n\t\t\t\t\tdidFind = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tif !didFind {\n\t\t\t\tkeyMap = append(keyMap, k)\n\t\t\t}\n\t\t\tdidFind = false\n\n\t\t\tswitch vt := v.(type) {\n\t\t\tdefault:\n\t\t\t\tif vt == nil {\n\t\t\t\t\t// ignore nil types\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\treturn keyMap, valMap, fmt.Errorf(\"unsupported type for value(%v) with key(%v) in tags for feature %v.\", vt, k, f)\n\n\t\t\tcase string:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(string)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase fmt.Stringer:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(fmt.Stringer)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv.String() == vt.String() {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase int:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(int)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase int8:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(int8)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase int16:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(int16)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase int32:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(int32)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase int64:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(int64)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase uint:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(uint)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase uint8:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(uint8)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase uint16:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(uint16)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase uint32:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(uint32)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase uint64:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(uint64)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase float32:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(float32)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase float64:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(float64)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\tcase bool:\n\t\t\t\tfor _, mv := range valMap {\n\t\t\t\t\ttmv, ok := mv.(bool)\n\t\t\t\t\tif !ok {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif tmv == vt {\n\t\t\t\t\t\tdidFind = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t} // value type switch\n\n\t\t\tif !didFind {\n\t\t\t\tvalMap = append(valMap, v)\n\t\t\t}\n\n\t\t} // For f.Tags\n\t} // for features\n\treturn keyMap, valMap, nil\n}","func evalBinaryUintExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\n\tvar err error\n\tvar r uint64\n\tvar b bool\n\tis_bool := false\n\n\txx, yy := x.Uint(), y.Uint()\n\tswitch op {\n\tcase token.ADD: r = xx + yy\n\tcase token.SUB: r = xx - yy\n\tcase token.MUL: r = xx * yy\n\tcase token.QUO: r = xx / yy\n\tcase token.REM: r = xx % yy\n\tcase token.AND: r = xx & yy\n\tcase token.OR: r = xx | yy\n\tcase token.XOR: r = xx ^ yy\n\tcase token.AND_NOT: r = xx &^ yy\n\tcase token.EQL: b = xx == yy; is_bool = true\n\tcase token.NEQ: b = xx != yy; is_bool = true\n\tcase token.LEQ: b = xx <= yy; is_bool = true\n\tcase token.GEQ: b = xx >= yy; is_bool = true\n\tcase token.LSS: b = xx < yy; is_bool = true\n\tcase token.GTR: b = xx > yy; is_bool = true\n\tdefault: err = ErrInvalidOperands{x, op, y}\n\t}\n\tif is_bool {\n\t\treturn reflect.ValueOf(b), err\n\t} else {\n\t\treturn reflect.ValueOf(r).Convert(x.Type()), err\n\t}\n}","func extractTagValues(regex *regexp.Regexp, tagList []string, input string) api.TagSet {\n\tmatches := regex.FindStringSubmatch(input)\n\tif matches == nil {\n\t\treturn nil\n\t}\n\ttagSet := api.NewTagSet()\n\tfor index, tagValue := range matches {\n\t\tif index == 0 {\n\t\t\tcontinue\n\t\t}\n\t\ttagKey := tagList[index-1]\n\t\ttagSet[tagKey] = tagValue\n\t}\n\treturn tagSet\n}","func initTagConversionMap() {\n\n\tTagStrToInt[\"bos\"] = 0\n\tTagStrToInt[\"$\"] = 1\n\tTagStrToInt[\"\\\"\"] = 2\n\tTagStrToInt[\"(\"] = 3\n\tTagStrToInt[\")\"] = 4\n\tTagStrToInt[\",\"] = 5\n\tTagStrToInt[\"--\"] = 6\n\tTagStrToInt[\".\"] = 7\n\tTagStrToInt[\":\"] = 8\n\tTagStrToInt[\"cc\"] = 9\n\tTagStrToInt[\"cd\"] = 10\n\tTagStrToInt[\"dt\"] = 11\n\tTagStrToInt[\"fw\"] = 12\n\tTagStrToInt[\"jj\"] = 13\n\tTagStrToInt[\"ls\"] = 14\n\tTagStrToInt[\"nn\"] = 15\n\tTagStrToInt[\"np\"] = 16\n\tTagStrToInt[\"pos\"] = 17\n\tTagStrToInt[\"pr\"] = 18\n\tTagStrToInt[\"rb\"] = 19\n\tTagStrToInt[\"sym\"] = 20\n\tTagStrToInt[\"to\"] = 21\n\tTagStrToInt[\"uh\"] = 22\n\tTagStrToInt[\"vb\"] = 23\n\tTagStrToInt[\"md\"] = 24\n\tTagStrToInt[\"in\"] = 25\n\n\tTagIntToStr[0] = \"bos\"\n\tTagIntToStr[1] = \"$\"\n\tTagIntToStr[2] = \"\\\"\"\n\tTagIntToStr[3] = \"(\"\n\tTagIntToStr[4] = \")\"\n\tTagIntToStr[5] = \",\"\n\tTagIntToStr[6] = \"--\"\n\tTagIntToStr[7] = \".\"\n\tTagIntToStr[8] = \":\"\n\tTagIntToStr[9] = \"cc\"\n\tTagIntToStr[10] = \"cd\"\n\tTagIntToStr[11] = \"dt\"\n\tTagIntToStr[12] = \"fw\"\n\tTagIntToStr[13] = \"jj\"\n\tTagIntToStr[14] = \"ls\"\n\tTagIntToStr[15] = \"nn\"\n\tTagIntToStr[16] = \"np\"\n\tTagIntToStr[17] = \"pos\"\n\tTagIntToStr[18] = \"pr\"\n\tTagIntToStr[19] = \"rb\"\n\tTagIntToStr[20] = \"sym\"\n\tTagIntToStr[21] = \"to\"\n\tTagIntToStr[22] = \"uh\"\n\tTagIntToStr[23] = \"vb\"\n\tTagIntToStr[24] = \"md\"\n\tTagIntToStr[25] = \"in\"\n}","func VEXTRACTI32X8(ops ...operand.Op) { ctx.VEXTRACTI32X8(ops...) }","func GetBindvars(stmt Statement) map[string]struct{} {\n\tbindvars := make(map[string]struct{})\n\t_ = Walk(func(node SQLNode) (kontinue bool, err error) {\n\t\tswitch node := node.(type) {\n\t\tcase *ColName, TableName:\n\t\t\t// Common node types that never contain expressions but create a lot of object\n\t\t\t// allocations.\n\t\t\treturn false, nil\n\t\tcase *Argument:\n\t\t\tbindvars[node.Name] = struct{}{}\n\t\tcase ListArg:\n\t\t\tbindvars[string(node)] = struct{}{}\n\t\t}\n\t\treturn true, nil\n\t}, stmt)\n\treturn bindvars\n}","func extractAnnotationsBytes(annotationBytes []byte) (map[string]string, error) {\n\n\tif len(annotationBytes) == 0 {\n\t\treturn nil, errors.ErrEmptyAnnotationFile\n\t}\n\n\tvar bundleMeta metadata\n\tif err := yaml.Unmarshal(annotationBytes, &bundleMeta); err != nil {\n\t\tlog.Error(\"metadata/annotations.yaml found but is malformed\")\n\t\treturn nil, err\n\t}\n\n\treturn bundleMeta.Annotations, nil\n}","func Binary(sc trace.SpanContext) []byte {\n\tif sc == (trace.SpanContext{}) {\n\t\treturn nil\n\t}\n\tvar b [29]byte\n\tcopy(b[2:18], sc.TraceID[:])\n\tb[18] = 1\n\tcopy(b[19:27], sc.SpanID[:])\n\tb[27] = 2\n\tb[28] = uint8(sc.TraceOptions)\n\treturn b[:]\n}","func VEXTRACTI64X2_Z(i, yz, k, mx operand.Op) { ctx.VEXTRACTI64X2_Z(i, yz, k, mx) }","func parseMemoryStatKB(filePath string, keys ...string) map[string]uint64 {\n\tret := make(map[string]uint64)\n\tfor _, line := range toLines(ioutil.ReadFile(filePath)) {\n\t\tfields := strings.Split(line, \":\")\n\t\tif len(fields) != 2 {\n\t\t\tcontinue\n\t\t}\n\t\tkey := strings.TrimSpace(fields[0])\n\t\tfor _, ikey := range keys {\n\t\t\tif key == ikey {\n\t\t\t\tvalue := strings.TrimSpace(fields[1])\n\t\t\t\tvalue = strings.Replace(value, \" kB\", \"\", -1)\n\t\t\t\tv, _ := strconv.ParseUint(value, 10, 64)\n\t\t\t\tret[key] = v * KB\n\t\t\t\tif len(ret) >= len(keys) {\n\t\t\t\t\treturn ret\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ret\n}","func ValuesForTag(doc, tag string) ([]interface{}, error) {\n\tn, err := DocToTree(doc)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tm := make(map[string]interface{})\n\tm[n.key] = n.treeToMap(false)\n\n\treturn ValuesForKey(m, tag), nil\n}","func (p RowData) ParseBinary(f []*Field) ([]interface{}, error) {\n\tdata := make([]interface{}, len(f))\n\n\tif p[0] != OKHeader {\n\t\treturn nil, ErrMalformPacket\n\t}\n\n\tpos := 1 + ((len(f) + 7 + 2) >> 3)\n\n\tnullBitmap := p[1:pos]\n\n\tvar isUnsigned bool\n\tvar isNull bool\n\tvar err error\n\tvar v []byte\n\tfor i := range data {\n\t\tif nullBitmap[(i+2)/8]&(1<<(uint(i+2)%8)) > 0 {\n\t\t\tdata[i] = nil\n\t\t\tcontinue\n\t\t}\n\n\t\tisUnsigned = f[i].Flag&uint16(UnsignedFlag) > 0\n\n\t\tswitch f[i].Type {\n\t\tcase TypeNull:\n\t\t\tdata[i] = nil\n\t\t\tcontinue\n\n\t\tcase TypeTiny:\n\t\t\tif isUnsigned {\n\t\t\t\tdata[i] = uint64(p[pos])\n\t\t\t} else {\n\t\t\t\tdata[i] = int64(p[pos])\n\t\t\t}\n\t\t\tpos++\n\t\t\tcontinue\n\n\t\tcase TypeShort, TypeYear:\n\t\t\tif isUnsigned {\n\t\t\t\tdata[i] = uint64(binary.LittleEndian.Uint16(p[pos : pos+2]))\n\t\t\t} else {\n\t\t\t\tvar n int16\n\t\t\t\terr = binary.Read(bytes.NewBuffer(p[pos:pos+2]), binary.LittleEndian, &n)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tdata[i] = int64(n)\n\t\t\t}\n\t\t\tpos += 2\n\t\t\tcontinue\n\n\t\tcase TypeInt24, TypeLong:\n\t\t\tif isUnsigned {\n\t\t\t\tdata[i] = uint64(binary.LittleEndian.Uint32(p[pos : pos+4]))\n\t\t\t} else {\n\t\t\t\tvar n int32\n\t\t\t\terr = binary.Read(bytes.NewBuffer(p[pos:pos+4]), binary.LittleEndian, &n)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tdata[i] = int64(n)\n\t\t\t}\n\t\t\tpos += 4\n\t\t\tcontinue\n\n\t\tcase TypeLonglong:\n\t\t\tif isUnsigned {\n\t\t\t\tdata[i] = binary.LittleEndian.Uint64(p[pos : pos+8])\n\t\t\t} else {\n\t\t\t\tvar n int64\n\t\t\t\terr = binary.Read(bytes.NewBuffer(p[pos:pos+8]), binary.LittleEndian, &n)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tdata[i] = int64(n)\n\t\t\t}\n\t\t\tpos += 8\n\t\t\tcontinue\n\n\t\tcase TypeFloat:\n\t\t\t//data[i] = float64(math.Float32frombits(binary.LittleEndian.Uint32(p[pos : pos+4])))\n\t\t\tvar n float32\n\t\t\terr = binary.Read(bytes.NewBuffer(p[pos:pos+4]), binary.LittleEndian, &n)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tdata[i] = float64(n)\n\t\t\tpos += 4\n\t\t\tcontinue\n\n\t\tcase TypeDouble:\n\t\t\tvar n float64\n\t\t\terr = binary.Read(bytes.NewBuffer(p[pos:pos+8]), binary.LittleEndian, &n)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tdata[i] = n\n\t\t\tpos += 8\n\t\t\tcontinue\n\n\t\tcase TypeDecimal, TypeNewDecimal, TypeVarchar,\n\t\t\tTypeBit, TypeEnum, TypeSet, TypeTinyBlob,\n\t\t\tTypeMediumBlob, TypeLongBlob, TypeBlob,\n\t\t\tTypeVarString, TypeString, TypeGeometry:\n\t\t\tvar ok = false\n\t\t\tv, pos, isNull, ok = ReadLenEncStringAsBytes(p, pos)\n\t\t\tif !ok {\n\t\t\t\treturn nil, fmt.Errorf(\"ReadLenEncStringAsBytes in ParseBinary failed\")\n\t\t\t}\n\n\t\t\tif !isNull {\n\t\t\t\tdata[i] = v\n\t\t\t\tcontinue\n\t\t\t} else {\n\t\t\t\tdata[i] = nil\n\t\t\t\tcontinue\n\t\t\t}\n\t\tcase TypeDate, TypeNewDate:\n\t\t\tvar num uint64\n\t\t\tnum, pos, isNull, _ = ReadLenEncInt(p, pos)\n\n\t\t\tif isNull {\n\t\t\t\tdata[i] = nil\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tdata[i], err = FormatBinaryDate(int(num), p[pos:])\n\t\t\tpos += int(num)\n\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\tcase TypeTimestamp, TypeDatetime:\n\t\t\tvar num uint64\n\t\t\tnum, pos, isNull, _ = ReadLenEncInt(p, pos)\n\n\t\t\tif isNull {\n\t\t\t\tdata[i] = nil\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tdata[i], err = FormatBinaryDateTime(int(num), p[pos:])\n\t\t\tpos += int(num)\n\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\tcase TypeDuration:\n\t\t\tvar num uint64\n\t\t\tnum, pos, isNull, _ = ReadLenEncInt(p, pos)\n\n\t\t\tif isNull {\n\t\t\t\tdata[i] = nil\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tdata[i], err = FormatBinaryTime(int(num), p[pos:])\n\t\t\tpos += int(num)\n\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\tdefault:\n\t\t\treturn nil, fmt.Errorf(\"Stmt Unknown FieldType %d %s\", f[i].Type, f[i].Name)\n\t\t}\n\t}\n\n\treturn data, nil\n}","func (m *Measurement) uniqueTagValues(expr influxql.Expr) map[string][]string {\n\t// Track unique value per tag.\n\ttags := make(map[string]map[string]struct{})\n\n\t// Find all tag values referenced in the expression.\n\tinfluxql.WalkFunc(expr, func(n influxql.Node) {\n\t\tswitch n := n.(type) {\n\t\tcase *influxql.BinaryExpr:\n\t\t\t// Ignore operators that are not equality.\n\t\t\tif n.Op != influxql.EQ {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Extract ref and string literal.\n\t\t\tvar key, value string\n\t\t\tswitch lhs := n.LHS.(type) {\n\t\t\tcase *influxql.VarRef:\n\t\t\t\tif rhs, ok := n.RHS.(*influxql.StringLiteral); ok {\n\t\t\t\t\tkey, value = lhs.Val, rhs.Val\n\t\t\t\t}\n\t\t\tcase *influxql.StringLiteral:\n\t\t\t\tif rhs, ok := n.RHS.(*influxql.VarRef); ok {\n\t\t\t\t\tkey, value = rhs.Val, lhs.Val\n\t\t\t\t}\n\t\t\t}\n\t\t\tif key == \"\" {\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// Add value to set.\n\t\t\tif tags[key] == nil {\n\t\t\t\ttags[key] = make(map[string]struct{})\n\t\t\t}\n\t\t\ttags[key][value] = struct{}{}\n\t\t}\n\t})\n\n\t// Convert to map of slices.\n\tout := make(map[string][]string)\n\tfor k, values := range tags {\n\t\tout[k] = make([]string, 0, len(values))\n\t\tfor v := range values {\n\t\t\tout[k] = append(out[k], v)\n\t\t}\n\t\tsort.Strings(out[k])\n\t}\n\treturn out\n}","func newBinaryExprEvaluator(e *Executor, op Token, lhs, rhs processor) *binaryExprEvaluator {\n\treturn &binaryExprEvaluator{\n\t\texecutor: e,\n\t\top: op,\n\t\tlhs: lhs,\n\t\trhs: rhs,\n\t\tc: make(chan map[string]interface{}, 0),\n\t\tdone: make(chan chan struct{}, 0),\n\t}\n}","func BuildTagMapping(structTemplatePointer interface{}, mappedKeyTag string, resultExclusionTag string, inheritKeyFromField bool, convertKeyToLowerCase bool, tags []string) map[string](map[string]string) {\n\treflectStructType := DiscoverTypeByKind(structTemplatePointer, reflect.Struct)\n\tvar result = make(map[string]map[string]string)\n\tvar anonymousMappings = make(map[string]map[string]string)\n\n\tfor i := 0; i < reflectStructType.NumField(); i++ {\n\t\tvar field reflect.StructField\n\t\tfield = reflectStructType.Field(i)\n\t\tkey := getTagValues(field, mappedKeyTag)\n\n\t\tif field.Anonymous && key == \"\" {\n\t\t\tvar anonymousType = DereferenceType(field.Type)\n\t\t\tif anonymousType.Kind() == reflect.Struct {\n\t\t\t\tanonymousMapping := BuildTagMapping(reflect.New(anonymousType).Interface(), mappedKeyTag, resultExclusionTag, inheritKeyFromField, convertKeyToLowerCase, tags)\n\t\t\t\tfor k, v := range anonymousMapping {\n\t\t\t\t\tanonymousMappings[k] = v\n\t\t\t\t\tanonymousMappings[k][anonymousKey] = \"true\"\n\t\t\t\t\tanonymousMappings[k][fieldIndexKey] = AsString(i)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcontinue\n\t\t}\n\n\t\tisTransient := strings.EqualFold(field.Tag.Get(resultExclusionTag), \"true\")\n\t\tif isTransient {\n\t\t\tcontinue\n\t\t}\n\n\t\tif key == \"\" {\n\t\t\tif !inheritKeyFromField {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tkey = field.Name\n\t\t}\n\n\t\tif convertKeyToLowerCase {\n\t\t\tkey = strings.ToLower(key)\n\t\t}\n\n\t\tresult[key] = make(map[string]string)\n\t\tfor _, tag := range tags {\n\t\t\ttagValue := field.Tag.Get(tag)\n\t\t\tif len(tagValue) > 0 {\n\t\t\t\tresult[key][tag] = tagValue\n\t\t\t}\n\t\t}\n\t\tresult[key][fieldNameKey] = field.Name\n\t}\n\n\tfor k, v := range anonymousMappings {\n\t\tif _, has := result[k]; !has {\n\t\t\tresult[k] = v\n\t\t}\n\t}\n\treturn result\n}","func (t *Table) ManyMapTagged(offset int32, count int, crit string, tag string) ([]map[string]string, error) {\n\tvar a []map[string]string\n\tbody, err := t.ManyRawTagged(offset, count, crit, tag)\n\tif err != nil {\n\t\treturn a, err\n\t}\n\ta = unpackGJsonArray(body)\n\treturn a, nil\n}","func getTagNamesByIDs(db *sql.DB, tagIDs []string) (map[string]string, error) {\n\ttags := make(map[string]string)\n\n\trows, err := db.Query(\"select tag_id, tag from tags where tag_id = any($1)\", pg.Array(tagIDs))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor rows.Next() {\n\t\tvar tagID string\n\t\tvar tag string\n\t\tif err = rows.Scan(&tagID, &tag); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\ttags[tagID] = tag\n\n\t}\n\n\treturn tags, nil\n}","func (f *STAGFields) UnmarshalBinary(b []byte) error {\n\tl := len(b)\n\tif l < 3 {\n\t\treturn io.ErrUnexpectedEOF\n\t}\n\n\tf.Flags = b[0]\n\toffset := 1\n\n\tif f.HasPCP() {\n\t\tf.PCP = b[offset] & 0x07\n\t}\n\n\tif f.HasDEI() {\n\t\tf.DEIFlag = (b[offset] >> 3) & 0x01\n\t}\n\n\tif f.HasVID() {\n\t\tf.CVID = binary.BigEndian.Uint16(b[offset:offset+2]) & 0xf0ff\n\t}\n\n\treturn nil\n}","func getTagIDsByNames(tx *sql.Tx, tags []string) (map[string]string, error) {\n\ttagIDs := make(map[string]string)\n\n\trows, err := tx.Query(\"select tag_id, tag from tags where tag = any($1)\", pg.Array(tags))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor rows.Next() {\n\t\tvar tagID string\n\t\tvar tag string\n\t\tif err = rows.Scan(&tagID, &tag); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\ttagIDs[tag] = tagID\n\t}\n\n\treturn tagIDs, nil\n}","func NewVarbinary(name string, m map[string]interface{}) (Vindex, error) {\n\treturn &Varbinary{name: name}, nil\n}","func parseRecord(record string) map[string]string {\n\tr := strings.NewReader(record)\n\tparser := xml.NewDecoder(r)\n\n\tdepth := 0\n\tcontent := \"\"\n\n\tcfield := make([]string, 0)\n\toutmap := make(map[string]string)\n\n\tfor {\n\t\ttoken, err := parser.Token()\n\t\tif err != nil {\n\t\t\tbreak\n\t\t}\n\t\tswitch t := token.(type) {\n\t\tcase xml.StartElement:\n\t\t\telmt := xml.StartElement(t)\n\t\t\tname := elmt.Name.Local\n\t\t\tcfield = append(cfield, name)\n\t\t\tdepth++\n\t\tcase xml.EndElement:\n\t\t\tname := strings.Join(cfield, parse.keysep)\n\n\t\t\tm, _ := regexp.MatchString(\"[[:alnum:]]\", content)\n\t\t\tif m {\n\t\t\t\tname = safeAddKey(name, outmap)\n\t\t\t\toutmap[name] = content\n\t\t\t}\n\n\t\t\tcfield = cfield[:len(cfield)-1]\n\t\t\tcontent = \"\"\n\t\t\tdepth--\n\t\tcase xml.CharData:\n\t\t\tbytes := xml.CharData(t)\n\t\t\tcontent = \"\\\"\" + string([]byte(bytes)) + \"\\\"\"\n\t\tcase xml.ProcInst:\n\t\t\tcontinue\n\t\tcase xml.Directive:\n\t\t\tcontinue\n\t\tdefault:\n\t\t\tfmt.Println(\"Unknown\")\n\t\t}\n\t}\n\treturn outmap\n}","func (p *parser) parseBinaryOps(ops []map[TokenType]*Operation) (Expression, hcl.Diagnostics) {\n\tif len(ops) == 0 {\n\t\t// We've run out of operators, so now we'll just try to parse a term.\n\t\treturn p.parseExpressionWithTraversals()\n\t}\n\n\tthisLevel := ops[0]\n\tremaining := ops[1:]\n\n\tvar lhs, rhs Expression\n\tvar operation *Operation\n\tvar diags hcl.Diagnostics\n\n\t// Parse a term that might be the first operand of a binary\n\t// operation or it might just be a standalone term.\n\t// We won't know until we've parsed it and can look ahead\n\t// to see if there's an operator token for this level.\n\tlhs, lhsDiags := p.parseBinaryOps(remaining)\n\tdiags = append(diags, lhsDiags...)\n\tif p.recovery && lhsDiags.HasErrors() {\n\t\treturn lhs, diags\n\t}\n\n\t// We'll keep eating up operators until we run out, so that operators\n\t// with the same precedence will combine in a left-associative manner:\n\t// a+b+c => (a+b)+c, not a+(b+c)\n\t//\n\t// Should we later want to have right-associative operators, a way\n\t// to achieve that would be to call back up to ParseExpression here\n\t// instead of iteratively parsing only the remaining operators.\n\tfor {\n\t\tnext := p.Peek()\n\t\tvar newOp *Operation\n\t\tvar ok bool\n\t\tif newOp, ok = thisLevel[next.Type]; !ok {\n\t\t\tbreak\n\t\t}\n\n\t\t// Are we extending an expression started on the previous iteration?\n\t\tif operation != nil {\n\t\t\tlhs = &BinaryOpExpr{\n\t\t\t\tLHS: lhs,\n\t\t\t\tOp: operation,\n\t\t\t\tRHS: rhs,\n\n\t\t\t\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\n\t\t\t}\n\t\t}\n\n\t\toperation = newOp\n\t\tp.Read() // eat operator token\n\t\tvar rhsDiags hcl.Diagnostics\n\t\trhs, rhsDiags = p.parseBinaryOps(remaining)\n\t\tdiags = append(diags, rhsDiags...)\n\t\tif p.recovery && rhsDiags.HasErrors() {\n\t\t\treturn lhs, diags\n\t\t}\n\t}\n\n\tif operation == nil {\n\t\treturn lhs, diags\n\t}\n\n\treturn &BinaryOpExpr{\n\t\tLHS: lhs,\n\t\tOp: operation,\n\t\tRHS: rhs,\n\n\t\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\n\t}, diags\n}","func typeTags(structType reflect.Type) (tags []byte) {\n\ttagStr := structType.Field(0).Tag.Get(\"sshtype\")\n\n\tfor _, tag := range strings.Split(tagStr, \"|\") {\n\t\ti, err := strconv.Atoi(tag)\n\t\tif err == nil {\n\t\t\ttags = append(tags, byte(i))\n\t\t}\n\t}\n\n\treturn tags\n}","func _b(x interface{}, op string, y interface{}) ast.Expr {\n\tvar xx, yx ast.Expr\n\tif xstr, ok := x.(string); ok {\n\t\txx = _x(xstr)\n\t} else {\n\t\txx = x.(ast.Expr)\n\t}\n\tif ystr, ok := y.(string); ok {\n\t\tyx = _x(ystr)\n\t} else {\n\t\tyx = y.(ast.Expr)\n\t}\n\treturn &ast.BinaryExpr{\n\t\tX: xx,\n\t\tOp: _op(op),\n\t\tY: yx,\n\t}\n}","func lbTags(app string, process string) map[string]string {\n\treturn map[string]string{\n\t\t\"AppID\": app,\n\t\t\"ProcessType\": process,\n\t}\n}","func Bitextract(t TermT, n uint32) TermT {\n\treturn TermT(C.yices_bitextract(C.term_t(t), C.uint32_t(n)))\n}","func (fp *slicingFieldParser) getTaggedFields(str *[]byte) (map[string]string, error) {\n\tfields := make(map[string]string, 20)\n\tfor {\n\t\tnextTag, err := fp.nextField(str, equalsBytes, true) // Expect at least a value after the tag\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"parsing next tag: %w\", err)\n\t\t}\n\n\t\tnextValue, err := fp.nextField(str, spaceBytes, false) // We cannot expect any more fields as this may be the last\n\t\tif err != nil && err != io.EOF {\n\t\t\treturn nil, fmt.Errorf(\"parsing next tagged value: %w\", err)\n\t\t}\n\n\t\tfields[nextTag] = nextValue\n\n\t\tif err == io.EOF { // No more fields in stream\n\t\t\tbreak\n\t\t}\n\t}\n\n\treturn fields, nil\n}","func (s *Structx) Tags(key string) (map[string]string, error) {\n\tresult := map[string]string{}\n\n\tfs := s.Fields()\n\tfor _, v := range fs {\n\t\tif !v.IsExport() {\n\t\t\tcontinue\n\t\t}\n\t\tresult[v.Name()] = v.Tag(key)\n\t}\n\n\treturn result, nil\n}","func (point *Point) GetTags(noarray bool, separator string) map[string]string {\n\ttags := map[string]string{}\n\ttags[\"vcenter\"] = point.VCenter\n\ttags[\"type\"] = point.ObjectType\n\ttags[\"name\"] = point.ObjectName\n\tif noarray {\n\t\tif len(point.Datastore) > 0 {\n\t\t\ttags[\"datastore\"] = point.Datastore[0]\n\t\t}\n\t} else {\n\t\tif len(point.Datastore) > 0 {\n\t\t\ttags[\"datastore\"] = strings.Join(point.Datastore, separator)\n\t\t}\n\t}\n\tif noarray {\n\t\tif len(point.Network) > 0 {\n\t\t\ttags[\"network\"] = point.Network[0]\n\t\t}\n\t} else {\n\t\tif len(point.Network) > 0 {\n\t\t\ttags[\"network\"] = strings.Join(point.Network, separator)\n\t\t}\n\t}\n\tif len(point.ESXi) > 0 {\n\t\ttags[\"host\"] = point.ESXi\n\t}\n\tif len(point.Cluster) > 0 {\n\t\ttags[\"cluster\"] = point.Cluster\n\t}\n\tif len(point.Instance) > 0 {\n\t\ttags[\"instance\"] = point.Instance\n\t}\n\tif len(point.ResourcePool) > 0 {\n\t\ttags[\"resourcepool\"] = point.ResourcePool\n\t}\n\tif len(point.Folder) > 0 {\n\t\ttags[\"folder\"] = point.Folder\n\t}\n\tif noarray {\n\t\tif len(point.ViTags) > 0 {\n\t\t\ttags[\"vitags\"] = point.ViTags[0]\n\t\t}\n\t} else {\n\t\tif len(point.ViTags) > 0 {\n\t\t\ttags[\"vitags\"] = strings.Join(point.ViTags, separator)\n\t\t}\n\t}\n\t/*\n\t\tif point.NumCPU != 0 {\n\t\t\ttags[\"numcpu\"] = strconv.FormatInt(int64(point.NumCPU), 10)\n\t\t}\n\t\tif point.MemorySizeMB != 0 {\n\t\t\ttags[\"memorysizemb\"] = strconv.FormatInt(int64(point.MemorySizeMB), 10)\n\t\t}\n\t*/\n\treturn tags\n}","func VEXTRACTI64X4_Z(i, z, k, my operand.Op) { ctx.VEXTRACTI64X4_Z(i, z, k, my) }","func (release *FuseReleaseIn) ParseBinary(bcontent []byte) error {\n\n\tlength := len(bcontent)\n\n\tif length < 24 {\n\t\treturn ErrDataLen\n\t}\n\n\terr := common.ParseBinary(bcontent, release)\n\n\treturn err\n}","func (s *BaseMySqlParserListener) ExitBinaryComparasionPredicate(ctx *BinaryComparasionPredicateContext) {\n}","func loadKeycodeConverterData() (map[string][]string, error) {\n\tbuf, err := grab(keycodeConverterDataInc)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tbuf = fixRE.ReplaceAllLiteral(buf, []byte(\", \"))\n\n\tdomMap := make(map[string][]string)\n\tmatches := usbKeyRE.FindAllStringSubmatch(string(buf), -1)\n\tfor _, m := range matches {\n\t\tvkey := m[7]\n\t\tif _, ok := domMap[vkey]; ok {\n\t\t\tpanic(fmt.Sprintf(\"vkey %s already defined\", vkey))\n\t\t}\n\t\tdomMap[vkey] = m[1:]\n\t}\n\n\treturn domMap, nil\n}","func xgetbv() (eax, edx uint32)","func (p *Parser) switchFieldToTag(tags map[string]string, fields map[string]interface{}) (map[string]string, map[string]interface{}) {\n\tfor name, value := range fields {\n\t\tif p.tagFilter == nil {\n\t\t\tcontinue\n\t\t}\n\t\t// skip switch statement if tagkey doesn't match fieldname\n\t\tif !p.tagFilter.Match(name) {\n\t\t\tcontinue\n\t\t}\n\t\t// switch any fields in TagKeys into tags\n\t\tswitch t := value.(type) {\n\t\tcase string:\n\t\t\ttags[name] = t\n\t\t\tdelete(fields, name)\n\t\tcase bool:\n\t\t\ttags[name] = strconv.FormatBool(t)\n\t\t\tdelete(fields, name)\n\t\tcase float64:\n\t\t\ttags[name] = strconv.FormatFloat(t, 'f', -1, 64)\n\t\t\tdelete(fields, name)\n\t\tdefault:\n\t\t\tp.Log.Errorf(\"Unrecognized type %T\", value)\n\t\t}\n\t}\n\n\t// remove any additional string/bool values from fields\n\tfor fk := range fields {\n\t\tswitch fields[fk].(type) {\n\t\tcase string, bool:\n\t\t\tif p.stringFilter != nil && p.stringFilter.Match(fk) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tdelete(fields, fk)\n\t\t}\n\t}\n\treturn tags, fields\n}","func hashmapIsBinaryKey(keyType types.Type) bool {\n\tswitch keyType := keyType.(type) {\n\tcase *types.Basic:\n\t\treturn keyType.Info()&(types.IsBoolean|types.IsInteger) != 0\n\tcase *types.Struct:\n\t\tfor i := 0; i < keyType.NumFields(); i++ {\n\t\t\tfieldType := keyType.Field(i).Type().Underlying()\n\t\t\tif !hashmapIsBinaryKey(fieldType) {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t\treturn true\n\tcase *types.Array:\n\t\treturn hashmapIsBinaryKey(keyType.Elem())\n\tcase *types.Named:\n\t\treturn hashmapIsBinaryKey(keyType.Underlying())\n\tdefault:\n\t\treturn false\n\t}\n}","func (aiService *AppinsightsMonitorService) getTags(tagType string, name string) map[string]*string {\n\n\ttags := make(map[string]*string)\n\n\tcomponentHiddenlink := fmt.Sprintf(\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/components/%s\", aiService.subscriptionID, aiService.resourceGroup, aiService.name)\n\twebtestHiddenlink := fmt.Sprintf(\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/webtests/%s\", aiService.subscriptionID, aiService.resourceGroup, name)\n\tvalue := \"Resource\"\n\n\tif tagType == \"webtest\" {\n\t\ttags[componentHiddenlink] = &value\n\t}\n\n\tif tagType == \"alert\" {\n\n\t\ttags[componentHiddenlink] = &value\n\t\ttags[webtestHiddenlink] = &value\n\t}\n\n\treturn tags\n}","func (it *Regex) TagResults(dst map[string]graph.Value) {\n\tfor _, tag := range it.tags.Tags() {\n\t\tdst[tag] = it.Result()\n\t}\n\n\tfor tag, value := range it.tags.Fixed() {\n\t\tdst[tag] = value\n\t}\n\n\tit.subIt.TagResults(dst)\n}","func GetAllInRangeOfPosts(db *sql.DB, postIDs []string) (map[string][]string, error) {\n\trows, err := db.Query(\"select post_id, tag_id from post_tags where post_id = any($1) order by post_id, tag_id\", pg.Array(postIDs))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tpostTags := make(map[string][]string)\n\ttagIDs := make(map[string]bool)\n\tfor rows.Next() {\n\t\tvar postID string\n\t\tvar tagID string\n\t\tif err = rows.Scan(&postID, &tagID); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tpostTags[postID] = append(postTags[postID], tagID)\n\t\ttagIDs[tagID] = true\n\t}\n\n\tvar tagIDsAsSlice []string\n\tfor tag := range tagIDs {\n\t\ttagIDsAsSlice = append(tagIDsAsSlice, tag)\n\t}\n\ttagNames, err := getTagNamesByIDs(db, tagIDsAsSlice)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// replace tag IDs with tag names\n\tfor postID := range postTags {\n\t\tfor tagIndex, tagID := range postTags[postID] {\n\t\t\tpostTags[postID][tagIndex] = tagNames[tagID]\n\t\t}\n\t}\n\n\treturn postTags, nil\n}","func (c *UserId) GetIpTags(ip, tag, vsys string) (map[string][]string, error) {\n\tif vsys == \"\" {\n\t\tvsys = \"vsys1\"\n\t}\n\tc.con.LogOp(\"(op) getting registered ip addresses - ip:%q tag:%q vsys:%q\", ip, tag, vsys)\n\treq := c.versioning()\n\n\tans := make(map[string][]string)\n\tfor {\n\t\treq.FilterOn(ip, tag, len(ans))\n\t\tresp := regResp{}\n\n\t\t_, err := c.con.Op(req, vsys, nil, &resp)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t} else if resp.Msg != nil && resp.Msg.Outfile != \"\" {\n\t\t\treturn nil, fmt.Errorf(\"PAN-OS returned %q instead of IP/tag mappings, please upgrade to 8.0+\", resp.Msg.Outfile)\n\t\t}\n\n\t\tfor i := range resp.Entry {\n\t\t\tans[resp.Entry[i].Ip] = resp.Entry[i].Tags\n\t\t}\n\n\t\tif req.ShouldStop(len(resp.Entry)) {\n\t\t\tbreak\n\t\t}\n\t}\n\n\treturn ans, nil\n}","func VEXTRACTI128(i, y, mx operand.Op) { ctx.VEXTRACTI128(i, y, mx) }","func ReadTags(b *kbin.Reader) Tags {\n\tvar t Tags\n\tfor num := b.Uvarint(); num > 0; num-- {\n\t\tkey, size := b.Uvarint(), b.Uvarint()\n\t\tt.Set(key, b.Span(int(size)))\n\t}\n\treturn t\n}","func (fi *funcInfo) emitBinaryOp(line int, op TokenType, a, b, c int) {\r\n\tif opcode, found := arithAndBitwiseBinops[op]; found {\r\n\t\tfi.emitABC(line, opcode, a, b, c)\r\n\t} else {\r\n\t\tswitch op {\r\n\t\tcase TOKEN_OP_EQ:\r\n\t\t\tfi.emitABC(line, OP_EQ, 1, b, c)\r\n\t\tcase TOKEN_OP_NE:\r\n\t\t\tfi.emitABC(line, OP_EQ, 0, b, c)\r\n\t\tcase TOKEN_OP_LT:\r\n\t\t\tfi.emitABC(line, OP_LT, 1, b, c)\r\n\t\tcase TOKEN_OP_GT:\r\n\t\t\tfi.emitABC(line, OP_LT, 1, c, b)\r\n\t\tcase TOKEN_OP_LE:\r\n\t\t\tfi.emitABC(line, OP_LE, 1, b, c)\r\n\t\tcase TOKEN_OP_GE:\r\n\t\t\tfi.emitABC(line, OP_LE, 1, c, b)\r\n\t\t}\r\n\t\tfi.emitJmp(line, 0, 1)\r\n\t\tfi.emitLoadBool(line, a, 0, 1)\r\n\t\tfi.emitLoadBool(line, a, 1, 0)\r\n\t}\r\n}","func (getxattr *FuseGetxattrIn) ParseBinary(bcontent []byte) error {\n\n\tlength := len(bcontent)\n\n\tif length < 8 {\n\t\treturn ErrDataLen\n\t}\n\n\tcommon.ParseBinary(bcontent[:4], &getxattr.Size)\n\tcommon.ParseBinary(bcontent[4:8], &getxattr.Padding)\n\n\tif length > 8 {\n\t\tgetxattr.Name = string(bcontent[8 : length-1])\n\t}\n\n\treturn nil\n}","func (sps SecurityProfileSpec) GetBinaryIDs() ([]keyvalue.Cookie, error) {\n\trep := []keyvalue.Cookie{}\n\tfor _, pp := range sps.ProcessProfiles {\n\t\trep = append(rep, pp.binaryPathID)\n\t}\n\treturn rep, nil\n}","func DenseBincountBinaryOutput(value bool) DenseBincountAttr {\n\treturn func(m optionalAttr) {\n\t\tm[\"binary_output\"] = value\n\t}\n}","func mergeRightTags(tagsLeft, tagsRight map[string]string) map[string]string {\n\tif tagsLeft == nil && tagsRight == nil {\n\t\treturn nil\n\t}\n\tif len(tagsRight) == 0 {\n\t\treturn tagsLeft\n\t}\n\tif len(tagsLeft) == 0 {\n\t\treturn tagsRight\n\t}\n\n\tresult := make(map[string]string, len(tagsLeft)+len(tagsRight))\n\tfor k, v := range tagsLeft {\n\t\tresult[k] = v\n\t}\n\tfor k, v := range tagsRight {\n\t\tresult[k] = v\n\t}\n\treturn result\n}","func UnmarshalThresholdCommand(rn *rawNode) (*ThresholdCommand, error) {\n\trawQuery := rn.Query\n\n\trawExpression, ok := rawQuery[\"expression\"]\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"no variable specified to reference for refId %v\", rn.RefID)\n\t}\n\treferenceVar, ok := rawExpression.(string)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"expected threshold variable to be a string, got %T for refId %v\", rawExpression, rn.RefID)\n\t}\n\n\tjsonFromM, err := json.Marshal(rawQuery[\"conditions\"])\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to remarshal threshold expression body: %w\", err)\n\t}\n\tvar conditions []ThresholdConditionJSON\n\tif err = json.Unmarshal(jsonFromM, &conditions); err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to unmarshal remarshaled threshold expression body: %w\", err)\n\t}\n\n\tfor _, condition := range conditions {\n\t\tif !IsSupportedThresholdFunc(condition.Evaluator.Type) {\n\t\t\treturn nil, fmt.Errorf(\"expected threshold function to be one of %s, got %s\", strings.Join(supportedThresholdFuncs, \", \"), condition.Evaluator.Type)\n\t\t}\n\t}\n\n\t// we only support one condition for now, we might want to turn this in to \"OR\" expressions later\n\tif len(conditions) != 1 {\n\t\treturn nil, fmt.Errorf(\"threshold expression requires exactly one condition\")\n\t}\n\tfirstCondition := conditions[0]\n\n\treturn NewThresholdCommand(rn.RefID, referenceVar, firstCondition.Evaluator.Type, firstCondition.Evaluator.Params)\n}","func parseByteMatch(k byteMatchType, s string) (*ByteMatch, error) {\n\tb := new(ByteMatch)\n\tb.Kind = k\n\n\tparts := strings.Split(s, \",\")\n\n\t// Num bytes is required for all byteMatchType keywords.\n\tif len(parts) < 1 {\n\t\treturn nil, fmt.Errorf(\"%s keyword has %d parts\", s, len(parts))\n\t}\n\n\tb.NumBytes = strings.TrimSpace(parts[0])\n\n\tif len(parts) < b.Kind.minLen() {\n\t\treturn nil, fmt.Errorf(\"invalid %s length: %d\", b.Kind, len(parts))\n\t}\n\n\tif k == bExtract || k == bJump {\n\t\t// Parse offset.\n\t\toffset, err := strconv.Atoi(strings.TrimSpace(parts[1]))\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"%s offset is not an int: %v; %s\", b.Kind, parts[1], err)\n\t\t}\n\t\tb.Offset = offset\n\t}\n\n\tif k == bExtract {\n\t\t// Parse variable name.\n\t\tname := parts[2]\n\t\tb.Variable = name\n\t}\n\n\tif k == bTest {\n\t\t// Parse operator.\n\t\tb.Operator = strings.TrimSpace(parts[1])\n\t\t// Parse value. Can use a variable.\n\t\tb.Value = strings.TrimSpace(parts[2])\n\t\t// Parse offset.\n\t\toffset, err := strconv.Atoi(strings.TrimSpace(parts[3]))\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"%s offset is not an int: %v; %s\", b.Kind, parts[1], err)\n\t\t}\n\t\tb.Offset = offset\n\t}\n\n\t// The rest of the options, for all types not b64decode\n\tfor i, l := b.Kind.minLen(), len(parts); i < l; i++ {\n\t\tparts[i] = strings.TrimSpace(parts[i])\n\t\tb.Options = append(b.Options, parts[i])\n\t}\n\n\treturn b, nil\n}","func (s *BaseSyslParserListener) EnterBinexpr(ctx *BinexprContext) {}","func (cfg *Config) genBinarySpec(t xsd.Builtin) ([]spec, error) {\n\tcfg.debugf(\"generating Go source for binary type %q\", xsd.XMLName(t).Local)\n\ts := spec{\n\t\texpr: builtinExpr(t),\n\t\tname: xsd.XMLName(t).Local,\n\t\txsdType: t,\n\t}\n\tmarshal := gen.Func(\"MarshalText\").Receiver(\"b \"+s.name).Returns(\"[]byte\", \"error\")\n\tunmarshal := gen.Func(\"UnmarshalText\").Receiver(\"b \" + s.name).Args(\"text []byte\").\n\t\tReturns(\"err error\")\n\n\tswitch t {\n\tcase xsd.HexBinary:\n\t\tunmarshal.Body(`\n\t\t\t*b, err = hex.DecodeString(string(text))\n\t\t\treturn err\n\t\t`)\n\t\tmarshal.Body(`\n\t\t\tn := hex.EncodedLen([]byte(b))\n\t\t\tbuf := make([]byte, n)\n\t\t\thex.Encode(buf, []byte(b))\n\t\t\treturn buf, nil\n\t\t`)\n\tcase xsd.Base64Binary:\n\t\tunmarshal.Body(`\n\t\t\t*b, err = base64.StdEncoding.DecodeString(string(text))\n\t\t\treturn err\n\t\t`)\n\t\tmarshal.Body(`\n\t\t\tvar buf bytes.Buffer\n\t\t\tenc := base64.NewEncoder(base64.StdEncoding, &buf)\n\t\t\tenc.Write([]byte(b))\n\t\t\tenc.Close()\n\t\t\treturn buf.Bytes()\n\t\t`)\n\t}\n\tmarshalFn, err := marshal.Decl()\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"MarshalText %s: %v\", s.name, err)\n\t}\n\tunmarshalFn, err := unmarshal.Decl()\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"UnmarshalText %s: %v\", s.name, err)\n\t}\n\ts.methods = append(s.methods, unmarshalFn, marshalFn)\n\treturn []spec{s}, nil\n}","func VEXTRACTI32X4(ops ...operand.Op) { ctx.VEXTRACTI32X4(ops...) }","func (interrupt *FuseInterruptIn) ParseBinary(bcontent []byte) error {\n\n\tlength := len(bcontent)\n\n\tif length < 8 {\n\t\treturn ErrDataLen\n\t}\n\n\terr := common.ParseBinary(bcontent, interrupt)\n\n\treturn err\n}","func marshalTags(tags map[string]string) []byte {\n\t// Empty maps marshal to empty bytes.\n\tif len(tags) == 0 {\n\t\treturn nil\n\t}\n\n\t// Extract keys and determine final size.\n\tsz := (len(tags) * 2) - 1 // separators\n\tkeys := make([]string, 0, len(tags))\n\tfor k, v := range tags {\n\t\tkeys = append(keys, k)\n\t\tsz += len(k) + len(v)\n\t}\n\tsort.Strings(keys)\n\n\t// Generate marshaled bytes.\n\tb := make([]byte, sz)\n\tbuf := b\n\tfor _, k := range keys {\n\t\tcopy(buf, k)\n\t\tbuf[len(k)] = '|'\n\t\tbuf = buf[len(k)+1:]\n\t}\n\tfor i, k := range keys {\n\t\tv := tags[k]\n\t\tcopy(buf, v)\n\t\tif i < len(keys)-1 {\n\t\t\tbuf[len(v)] = '|'\n\t\t\tbuf = buf[len(v)+1:]\n\t\t}\n\t}\n\treturn b\n}","func VEXTRACTF64X2(ops ...operand.Op) { ctx.VEXTRACTF64X2(ops...) }","func ExtractMetaTags(doc *goquery.Document, prefix string) (Map, error) {\n\tm := Map{}\n\t// now get open graph tags\n\tdoc.Find(\"meta\").Each(func(i int, s *goquery.Selection) {\n\t\tif name, _ := s.Attr(\"property\"); strings.HasPrefix(name, prefix) {\n\t\t\tvalue, _ := s.Attr(\"content\")\n\t\t\tname = strings.TrimSpace(strings.TrimPrefix(name, prefix))\n\t\t\tvalue = strings.TrimSpace(value)\n\t\t\tif value != \"\" && name != \"\" {\n\t\t\t\tm[name] = value\n\t\t\t}\n\t\t}\n\t})\n\treturn m, nil\n}","func loadScanCodes(keycodeConverterMap, domKeyMap map[string][]string, layoutBuf []byte) (map[string][]int64, error) {\n\tvkeyCodeMap, err := loadPosixWinKeyboardCodes()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tbuf := extract(layoutBuf, \"kDomCodeToKeyboardCodeMap\")\n\tbuf = domCodeVkeyFixRE.ReplaceAllLiteral(buf, []byte(\", \"))\n\n\tscanCodeMap := make(map[string][]int64)\n\tmatches := domCodeVkeyRE.FindAllStringSubmatch(string(buf), -1)\n\tfor _, m := range matches {\n\t\tdomCode, vkey := m[1], m[2]\n\n\t\tkc, ok := keycodeConverterMap[domCode]\n\t\tif !ok {\n\t\t\tpanic(fmt.Sprintf(\"dom code %s not defined in keycode map\", domCode))\n\t\t}\n\n\t\tsc, ok := vkeyCodeMap[vkey]\n\t\tif !ok {\n\t\t\tpanic(fmt.Sprintf(\"vkey %s is not defined in keyboardCodeMap\", vkey))\n\t\t}\n\n\t\tscanCodeMap[getCode(kc[5])] = sc\n\t}\n\n\treturn scanCodeMap, nil\n}","func (c *Context) VEXTRACTI64X2_Z(i, yz, k, mx operand.Op) {\n\tc.addinstruction(x86.VEXTRACTI64X2_Z(i, yz, k, mx))\n}","func (p iccProfile) tag(sig string) (int, int, error) {\n\n\tfor i, j := 0, 132; i < p.tagCount(); i++ {\n\t\ts := string(p.b[j : j+4])\n\t\tif s != sig {\n\t\t\tj += 12\n\t\t\tcontinue\n\t\t}\n\t\tj += 4\n\t\toff := binary.BigEndian.Uint32(p.b[j:])\n\t\tj += 4\n\t\tsize := binary.BigEndian.Uint32(p.b[j:])\n\t\treturn int(off), int(size), nil\n\t}\n\n\treturn 0, 0, errors.Errorf(\"tag %s not found\", sig)\n}","func ExtractVariables(configDict map[string]interface{}, pattern *regexp.Regexp) map[string]string {\n\tif pattern == nil {\n\t\tpattern = defaultPattern\n\t}\n\treturn recurseExtract(configDict, pattern)\n}","func VEXTRACTF64X4(ops ...operand.Op) { ctx.VEXTRACTF64X4(ops...) }"],"string":"[\n \"func (p *Planner) extractTags(name string, expr Expr, tags map[string]string) (Expr, error) {\\n\\t// TODO: Refactor into a walk-like Replace().\\n\\tswitch expr := expr.(type) {\\n\\tcase *BinaryExpr:\\n\\t\\t// If the LHS is a variable ref then check for tag equality.\\n\\t\\tif lhs, ok := expr.LHS.(*VarRef); ok && expr.Op == EQ {\\n\\t\\t\\treturn p.extractBinaryExprTags(name, expr, lhs, expr.RHS, tags)\\n\\t\\t}\\n\\n\\t\\t// If the RHS is a variable ref then check for tag equality.\\n\\t\\tif rhs, ok := expr.RHS.(*VarRef); ok && expr.Op == EQ {\\n\\t\\t\\treturn p.extractBinaryExprTags(name, expr, rhs, expr.LHS, tags)\\n\\t\\t}\\n\\n\\t\\t// Recursively process LHS.\\n\\t\\tlhs, err := p.extractTags(name, expr.LHS, tags)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\texpr.LHS = lhs\\n\\n\\t\\t// Recursively process RHS.\\n\\t\\trhs, err := p.extractTags(name, expr.RHS, tags)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\texpr.RHS = rhs\\n\\n\\t\\treturn expr, nil\\n\\n\\tcase *ParenExpr:\\n\\t\\te, err := p.extractTags(name, expr.Expr, tags)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\texpr.Expr = e\\n\\t\\treturn expr, nil\\n\\n\\tdefault:\\n\\t\\treturn expr, nil\\n\\t}\\n}\",\n \"func (sm *SpecMore) TagsMap(inclTop, inclOps bool) map[string]int {\\n\\ttagsMap := map[string]int{}\\n\\tif inclTop {\\n\\t\\tfor _, tag := range sm.Spec.Tags {\\n\\t\\t\\ttagName := strings.TrimSpace(tag.Name)\\n\\t\\t\\tif len(tagName) > 0 {\\n\\t\\t\\t\\tif _, ok := tagsMap[tagName]; !ok {\\n\\t\\t\\t\\t\\ttagsMap[tagName] = 0\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttagsMap[tagName]++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif inclOps {\\n\\t\\tVisitOperations(sm.Spec, func(skipPath, skipMethod string, op *oas3.Operation) {\\n\\t\\t\\tfor _, tagName := range op.Tags {\\n\\t\\t\\t\\ttagName = strings.TrimSpace(tagName)\\n\\t\\t\\t\\tif len(tagName) > 0 {\\n\\t\\t\\t\\t\\tif _, ok := tagsMap[tagName]; !ok {\\n\\t\\t\\t\\t\\t\\ttagsMap[tagName] = 0\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ttagsMap[tagName]++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t})\\n\\t}\\n\\treturn tagsMap\\n}\",\n \"func (e *Extractor) FieldValueFromTagMap(tag string) (out map[string]interface{}, err error) {\\n\\n\\tif err := e.isValidStruct(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tout = make(map[string]interface{})\\n\\ts := reflect.ValueOf(e.StructAddr).Elem()\\n\\tfields := e.fields(s)\\n\\n\\tfor _, field := range fields {\\n\\t\\tif val, ok := field.tags.Lookup(tag); ok {\\n\\t\\t\\tkey, omit := e.parseOmitempty(val, field.value)\\n\\t\\t\\tif omit {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tout[key] = field.value.Interface()\\n\\t\\t}\\n\\n\\t}\\n\\n\\treturn\\n}\",\n \"func keyvalTagsMap(keyMap []string, valueMap []interface{}, f *Feature) (tags []uint32, err error) {\\n\\n\\tif f == nil {\\n\\t\\treturn nil, ErrNilFeature\\n\\t}\\n\\n\\tvar kidx, vidx int64\\n\\n\\tfor key, val := range f.Tags {\\n\\n\\t\\tkidx, vidx = -1, -1 // Set to known not found value.\\n\\n\\t\\tfor i, k := range keyMap {\\n\\t\\t\\tif k != key {\\n\\t\\t\\t\\tcontinue // move to the next key\\n\\t\\t\\t}\\n\\t\\t\\tkidx = int64(i)\\n\\t\\t\\tbreak // we found a match\\n\\t\\t}\\n\\n\\t\\tif kidx == -1 {\\n\\t\\t\\tlog.Printf(\\\"did not find key (%v) in keymap.\\\", key)\\n\\t\\t\\treturn tags, fmt.Errorf(\\\"did not find key (%v) in keymap.\\\", key)\\n\\t\\t}\\n\\n\\t\\t// if val is nil we skip it for now\\n\\t\\t// https://github.com/mapbox/vector-tile-spec/issues/62\\n\\t\\tif val == nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tfor i, v := range valueMap {\\n\\t\\t\\tswitch tv := val.(type) {\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\treturn tags, fmt.Errorf(\\\"value (%[1]v) of type (%[1]T) for key (%[2]v) is not supported.\\\", tv, key)\\n\\t\\t\\tcase string:\\n\\t\\t\\t\\tvmt, ok := v.(string) // Make sure the type of the Value map matches the type of the Tag's value\\n\\t\\t\\t\\tif !ok || vmt != tv { // and that the values match\\n\\t\\t\\t\\t\\tcontinue // if they don't match move to the next value.\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase fmt.Stringer:\\n\\t\\t\\t\\tvmt, ok := v.(fmt.Stringer)\\n\\t\\t\\t\\tif !ok || vmt.String() != tv.String() {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int:\\n\\t\\t\\t\\tvmt, ok := v.(int)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int8:\\n\\t\\t\\t\\tvmt, ok := v.(int8)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int16:\\n\\t\\t\\t\\tvmt, ok := v.(int16)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int32:\\n\\t\\t\\t\\tvmt, ok := v.(int32)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase int64:\\n\\t\\t\\t\\tvmt, ok := v.(int64)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint:\\n\\t\\t\\t\\tvmt, ok := v.(uint)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint8:\\n\\t\\t\\t\\tvmt, ok := v.(uint8)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint16:\\n\\t\\t\\t\\tvmt, ok := v.(uint16)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint32:\\n\\t\\t\\t\\tvmt, ok := v.(uint32)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase uint64:\\n\\t\\t\\t\\tvmt, ok := v.(uint64)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase float32:\\n\\t\\t\\t\\tvmt, ok := v.(float32)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase float64:\\n\\t\\t\\t\\tvmt, ok := v.(float64)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase bool:\\n\\t\\t\\t\\tvmt, ok := v.(bool)\\n\\t\\t\\t\\tif !ok || vmt != tv {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t} // Values Switch Statement\\n\\t\\t\\t// if the values match let's record the index.\\n\\t\\t\\tvidx = int64(i)\\n\\t\\t\\tbreak // we found our value no need to continue on.\\n\\t\\t} // range on value\\n\\n\\t\\tif vidx == -1 { // None of the values matched.\\n\\t\\t\\treturn tags, fmt.Errorf(\\\"did not find a value: %v in valuemap.\\\", val)\\n\\t\\t}\\n\\t\\ttags = append(tags, uint32(kidx), uint32(vidx))\\n\\t} // Move to the next tag key and value.\\n\\n\\treturn tags, nil\\n}\",\n \"func GetValueTagMap(src map[string]interface{}) map[string]interface{} {\\n\\tres := NewEmptyTagMap()\\n\\tres[\\\"inname\\\"] = \\\"value\\\"\\n\\tres[\\\"exname\\\"] = \\\"value\\\"\\n\\tres[\\\"type\\\"] = src[\\\"type\\\"]\\n\\tres[\\\"length\\\"] = src[\\\"length\\\"]\\n\\tres[\\\"scale\\\"] = src[\\\"scale\\\"]\\n\\tres[\\\"precision\\\"] = src[\\\"precision\\\"]\\n\\tres[\\\"fieldid\\\"] = src[\\\"fieldid\\\"]\\n\\treturn res\\n}\",\n \"func newBinaryExprGuard(expr *influxql.BinaryExpr) *exprGuard {\\n\\t// if it's a nested binary expression, always match.\\n\\tif _, ok := expr.LHS.(*influxql.BinaryExpr); ok {\\n\\t\\treturn nil\\n\\t} else if _, ok := expr.RHS.(*influxql.BinaryExpr); ok {\\n\\t\\treturn nil\\n\\t}\\n\\n\\t// ensure one of the expressions is a VarRef, and make that the key.\\n\\tkey, ok := expr.LHS.(*influxql.VarRef)\\n\\tvalue := expr.RHS\\n\\tif !ok {\\n\\t\\tkey, ok = expr.RHS.(*influxql.VarRef)\\n\\t\\tif !ok {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\tvalue = expr.LHS\\n\\t}\\n\\n\\t// check the key for situations we know we can't filter.\\n\\tif key.Val != \\\"_name\\\" && key.Type != influxql.Unknown && key.Type != influxql.Tag {\\n\\t\\treturn nil\\n\\t}\\n\\n\\t// scrutinize the value to return an efficient guard.\\n\\tswitch value := value.(type) {\\n\\tcase *influxql.StringLiteral:\\n\\t\\tval := []byte(value.Val)\\n\\t\\tg := &exprGuard{tagMatches: &tagGuard{\\n\\t\\t\\tmeas: key.Val == \\\"_name\\\",\\n\\t\\t\\tkey: []byte(key.Val),\\n\\t\\t}}\\n\\n\\t\\tswitch expr.Op {\\n\\t\\tcase influxql.EQ:\\n\\t\\t\\tg.tagMatches.op = func(x []byte) bool { return bytes.Equal(val, x) }\\n\\n\\t\\tcase influxql.NEQ:\\n\\t\\t\\tg.tagMatches.op = func(x []byte) bool { return !bytes.Equal(val, x) }\\n\\n\\t\\tdefault: // any other operator isn't valid. conservatively match everything.\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\n\\t\\treturn g\\n\\n\\tcase *influxql.RegexLiteral:\\n\\t\\t// There's a tradeoff between being precise and being fast. For example, if the\\n\\t\\t// delete includes a very expensive regex, we don't want to run that against every\\n\\t\\t// incoming point. The decision here is to match any point that has a possibly\\n\\t\\t// expensive match if there is any overlap on the tags. In other words, expensive\\n\\t\\t// matches get transformed into trivially matching everything.\\n\\t\\treturn &exprGuard{tagExists: map[string]struct{}{key.Val: {}}}\\n\\n\\tcase *influxql.VarRef:\\n\\t\\t// We could do a better job here by encoding the two names and checking the points\\n\\t\\t// against them, but I'm not quite sure how to do that. Be conservative and match\\n\\t\\t// any points that contain either the key or value.\\n\\n\\t\\t// since every point has a measurement, always match if either are on the measurement.\\n\\t\\tif key.Val == \\\"_name\\\" || value.Val == \\\"_name\\\" {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn &exprGuard{tagExists: map[string]struct{}{\\n\\t\\t\\tkey.Val: {},\\n\\t\\t\\tvalue.Val: {},\\n\\t\\t}}\\n\\n\\tdefault: // any other value type matches everything\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func mapColumnTags(tables map[string]schema.Schema) (m map[uint64]string) {\\n\\tm = make(map[uint64]string, len(tables))\\n\\tfor tbl, sch := range tables {\\n\\t\\tfor _, tag := range sch.GetAllCols().Tags {\\n\\t\\t\\tm[tag] = tbl\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func parseTag(stag StructTag) map[string]string {\\n\\ttag := string(stag)\\n\\tm := make(map[string]string)\\n\\tfor tag != \\\"\\\" {\\n\\t\\ti := 0\\n\\t\\tfor i < len(tag) && tag[i] == ' ' {\\n\\t\\t\\ti += 1\\n\\t\\t}\\n\\t\\ttag = tag[i:]\\n\\t\\tif tag == \\\"\\\" {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\ti = 0\\n\\t\\tfor i < len(tag) && tag[i] > ' ' && tag[i] != ':' && tag[i] != '\\\"' && tag[i] != 0x7f {\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t\\tif i == 0 || i+1 >= len(tag) || tag[i] != ':' || tag[i+1] != '\\\"' {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tname := string(tag[:i])\\n\\t\\ttag = tag[i+1:]\\n\\n\\t\\ti = 1\\n\\t\\tfor i < len(tag) && tag[i] != '\\\"' {\\n\\t\\t\\tif tag[i] == '\\\\\\\\' {\\n\\t\\t\\t\\ti++\\n\\t\\t\\t}\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t\\tif i >= len(tag) {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tqvalue := string(tag[:i+1])\\n\\t\\ttag = tag[i+1:]\\n\\n\\t\\tvalue, err := strconv.Unquote(qvalue)\\n\\t\\tif err != nil {\\n\\t\\t\\tcontinue\\n\\t\\t\\tm[name] = value\\n\\t\\t}\\n\\t\\treturn m\\n\\t}\\n\\treturn m\\n}\",\n \"func mapTags(tags []*elb.Tag) map[string]string {\\n\\ttagMap := make(map[string]string)\\n\\tfor _, t := range tags {\\n\\t\\ttagMap[*t.Key] = *t.Value\\n\\t}\\n\\n\\treturn tagMap\\n}\",\n \"func tagKeysToMap(tags string) map[string]*string {\\n\\toutput := make(map[string]*string)\\n\\n\\tfor _, tag := range strings.Split(strings.TrimSpace(tags), \\\",\\\") {\\n\\t\\tsplit := strings.SplitN(tag, \\\"=\\\", 2)\\n\\t\\tkey := strings.TrimSpace(split[0])\\n\\t\\tvalue := \\\"\\\"\\n\\n\\t\\tif key == \\\"\\\" {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif len(split) > 1 {\\n\\t\\t\\tvalue = strings.TrimSpace(split[1])\\n\\t\\t}\\n\\n\\t\\toutput[key] = &value\\n\\t}\\n\\n\\tif len(output) == 0 {\\n\\t\\treturn nil\\n\\t}\\n\\n\\treturn output\\n}\",\n \"func parseNextBinaryValue(ann []Symbol, r io.Reader) (Value, error) {\\n\\tswitch high, low, err := readNibblesHighAndLow(r); {\\n\\tcase err != nil:\\n\\t\\treturn nil, err\\n\\tcase low == 0xF:\\n\\t\\treturn parseBinaryNull(high)\\n\\tcase high == binaryTypePadding:\\n\\t\\treturn parseBinaryPadding(low, r)\\n\\tcase high == binaryTypeBool:\\n\\t\\treturn parseBinaryBool(ann, low)\\n\\tcase high == binaryTypeInt || high == binaryTypeNegInt:\\n\\t\\t// 2 = positive integer, 3 = negative integer.\\n\\t\\treturn parseBinaryInt(ann, high == binaryTypeNegInt, low, r)\\n\\tcase high == binaryTypeFloat:\\n\\t\\treturn parseBinaryFloat(ann, low, r)\\n\\tcase high == binaryTypeDecimal:\\n\\t\\treturn parseBinaryDecimal(ann, low, r)\\n\\tcase high == binaryTypeTimestamp:\\n\\t\\treturn parseBinaryTimestamp(ann, low, r)\\n\\tcase high == binaryTypeSymbol:\\n\\t\\treturn parseBinarySymbol(ann, low, r)\\n\\tcase high == binaryTypeString:\\n\\t\\treturn parseBinaryString(ann, low, r)\\n\\tcase high == binaryTypeBlob || high == binaryTypeClob:\\n\\t\\treturn parseBinaryBytes(ann, high, low, r)\\n\\tcase high == binaryTypeList || high == binaryTypeSExp:\\n\\t\\treturn parseBinaryList(ann, high, low, r)\\n\\tcase high == binaryTypeStruct:\\n\\t\\treturn parseBinaryStruct(ann, low, r)\\n\\tcase high == binaryTypeAnnotation:\\n\\t\\tif len(ann) != 0 {\\n\\t\\t\\treturn nil, errors.New(\\\"nesting annotations is not legal\\\")\\n\\t\\t}\\n\\t\\treturn parseBinaryAnnotation(low, r)\\n\\tdefault:\\n\\t\\treturn nil, errors.Errorf(\\\"invalid header combination - high: %d low: %d\\\", high, low)\\n\\t}\\n}\",\n \"func parseBinary(lex *lexer, prec1 int) Expr {\\n\\tlhs := parseUnary(lex)\\n\\tfor prec := precedence(lex.token); prec >= prec1; prec-- {\\n\\t\\tfor precedence(lex.token) == prec {\\n\\t\\t\\top := lex.token\\n\\t\\t\\tlex.next() // consume operator\\n\\t\\t\\trhs := parseBinary(lex, prec+1)\\n\\t\\t\\tlhs = binary{op, lhs, rhs}\\n\\t\\t}\\n\\t}\\n\\treturn lhs\\n}\",\n \"func evalBinaryIntExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar r int64\\n\\tvar err error\\n\\tvar b bool\\n\\tis_bool := false\\n\\n\\txx, yy := x.Int(), y.Int()\\n\\tswitch op {\\n\\tcase token.ADD: r = xx + yy\\n\\tcase token.SUB: r = xx - yy\\n\\tcase token.MUL: r = xx * yy\\n\\tcase token.QUO: r = xx / yy\\n\\tcase token.REM: r = xx % yy\\n\\tcase token.AND: r = xx & yy\\n\\tcase token.OR: r = xx | yy\\n\\tcase token.XOR: r = xx ^ yy\\n\\tcase token.AND_NOT: r = xx &^ yy\\n\\tcase token.EQL: b = xx == yy; is_bool = true\\n\\tcase token.NEQ: b = xx != yy; is_bool = true\\n\\tcase token.LEQ: b = xx <= yy; is_bool = true\\n\\tcase token.GEQ: b = xx >= yy; is_bool = true\\n\\tcase token.LSS: b = xx < yy; is_bool = true\\n\\tcase token.GTR: b = xx > yy; is_bool = true\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\tif is_bool {\\n\\t\\treturn reflect.ValueOf(b), err\\n\\t} else {\\n\\t\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n\\t}\\n}\",\n \"func parseBinaryVersionMarker(r io.Reader) (Value, error) {\\n\\tnumBytes := len(ion10BVM)\\n\\tbvm := make([]byte, numBytes)\\n\\tbvm[0] = ion10BVM[0]\\n\\tif n, err := r.Read(bvm[1:]); err != nil || n != numBytes-1 {\\n\\t\\treturn nil, errors.Errorf(\\\"unable to read binary version marker - read %d bytes of %d with err: %v\\\", n, numBytes-1, err)\\n\\t}\\n\\n\\tif err := verifyByteVersionMarker(bytes.NewReader(bvm)); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn nil, nil\\n}\",\n \"func (s *BaseMySqlParserListener) EnterBinaryComparasionPredicate(ctx *BinaryComparasionPredicateContext) {\\n}\",\n \"func GetColumnAttributesFromTag(tag *reflect.StructTag) map[string]bool {\\n\\tfieldTags := strings.Split(tag.Get(\\\"field\\\"), \\\",\\\")\\n\\tattributes := map[string]bool{}\\n\\tfor _, tag := range fieldTags[1:] {\\n\\t\\tattributes[tag] = true\\n\\t}\\n\\treturn attributes\\n}\",\n \"func RaggedBincountBinaryOutput(value bool) RaggedBincountAttr {\\n\\treturn func(m optionalAttr) {\\n\\t\\tm[\\\"binary_output\\\"] = value\\n\\t}\\n}\",\n \"func evalBinaryStringExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar err error\\n\\tvar r string\\n\\tvar b bool\\n\\tis_bool := false\\n\\n\\txx, yy := x.String(), y.String()\\n\\tswitch op {\\n\\tcase token.ADD:\\tr = xx + yy\\n\\tcase token.EQL: b = xx == yy; is_bool = true\\n\\tcase token.NEQ: b = xx != yy; is_bool = true\\n\\tcase token.LEQ: b = xx <= yy; is_bool = true\\n\\tcase token.GEQ: b = xx >= yy; is_bool = true\\n\\tcase token.LSS: b = xx < yy; is_bool = true\\n\\tcase token.GTR: b = xx > yy; is_bool = true\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\tif is_bool {\\n\\t\\treturn reflect.ValueOf(b), err\\n\\t} else {\\n\\t\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n\\t}\\n}\",\n \"func parseBinary(s *scanner) ([]byte, error) {\\n\\tif s.eof() || s.data[s.off] != ':' {\\n\\t\\treturn nil, &UnmarshalError{s.off, ErrInvalidBinaryFormat}\\n\\t}\\n\\ts.off++\\n\\n\\tstart := s.off\\n\\n\\tfor !s.eof() {\\n\\t\\tc := s.data[s.off]\\n\\t\\tif c == ':' {\\n\\t\\t\\t// base64decode\\n\\t\\t\\tdecoded, err := base64.StdEncoding.DecodeString(s.data[start:s.off])\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, &UnmarshalError{s.off, err}\\n\\t\\t\\t}\\n\\t\\t\\ts.off++\\n\\n\\t\\t\\treturn decoded, nil\\n\\t\\t}\\n\\n\\t\\tif !isAlpha(c) && !isDigit(c) && c != '+' && c != '/' && c != '=' {\\n\\t\\t\\treturn nil, &UnmarshalError{s.off, ErrInvalidBinaryFormat}\\n\\t\\t}\\n\\t\\ts.off++\\n\\t}\\n\\n\\treturn nil, &UnmarshalError{s.off, ErrInvalidBinaryFormat}\\n}\",\n \"func (s *BaselimboListener) EnterBinary_expression(ctx *Binary_expressionContext) {}\",\n \"func (p *Parser) parseBitwiseExpression() Expression {\\n\\tleft := p.parseEqualityExpression()\\n\\tfor {\\n\\t\\tif op, ok := p.match(ttBitAnd, ttBitOr, ttBitXor); ok {\\n\\t\\t\\tright := p.parseEqualityExpression()\\n\\t\\t\\tleft = NewBinaryExpression(left, op.typ, right)\\n\\t\\t} else {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\treturn left\\n}\",\n \"func Bvextract(t TermT, i uint32, j uint32) TermT {\\n\\treturn TermT(C.yices_bvextract(C.term_t(t), C.uint32_t(i), C.uint32_t(j)))\\n}\",\n \"func ParseBvbin(s string) TermT {\\n\\tcs := C.CString(s)\\n\\tdefer C.free(unsafe.Pointer(cs))\\n\\treturn TermT(C.yices_parse_bvbin(cs))\\n}\",\n \"func VEXTRACTI64X2(ops ...operand.Op) { ctx.VEXTRACTI64X2(ops...) }\",\n \"func compareMap(lParam interface{}, subConditions map[string]interface{}) []byte {\\n\\tswitch lParam.(type) {\\n\\t// when lparam is integer, convert float64\\n\\tcase int, int32, uint32, int64, uint64:\\n\\t\\tlParam = jsonTypeConverter(lParam)\\n\\t\\tbreak\\n\\t}\\n\\n\\tbuf := new(bytes.Buffer)\\n\\t// condition [key : operator / value : operand]\\n\\tfor op, rParam := range subConditions {\\n\\t\\tswitch rParam.(type) {\\n\\t\\t// when rparam is integer, convert float64\\n\\t\\tcase int, int32, uint32, int64, uint64:\\n\\t\\t\\trParam = jsonTypeConverter(rParam)\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\tcompareValue(op, lParam, rParam, buf)\\n\\t}\\n\\n\\treturn buf.Bytes()\\n}\",\n \"func VEXTRACTI64X4(ops ...operand.Op) { ctx.VEXTRACTI64X4(ops...) }\",\n \"func (bmap *FuseBmapIn) ParseBinary(bcontent []byte) error {\\n\\n\\tlength := len(bcontent)\\n\\n\\tif length < 16 {\\n\\t\\treturn ErrDataLen\\n\\t}\\n\\n\\terr := common.ParseBinary(bcontent, bmap)\\n\\n\\treturn err\\n}\",\n \"func Extract(ctx context.Context) *Tags {\\n\\tt, ok := ctx.Value(ctxMarkerKey).(*Tags)\\n\\tif !ok {\\n\\t\\treturn &Tags{values: make(map[string]interface{})}\\n\\t}\\n\\n\\treturn t\\n}\",\n \"func structTagIndices(st reflect.Type) map[string]int {\\n\\tct := st.NumField()\\n\\tret := make(map[string]int, ct)\\n\\n\\tfor i := 0; i < ct; i++ {\\n\\t\\tfield := st.Field(i)\\n\\t\\tattrName := field.Tag.Get(\\\"cty\\\")\\n\\t\\tif attrName != \\\"\\\" {\\n\\t\\t\\tret[attrName] = i\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret\\n}\",\n \"func (e *Extractor) TagMapping(from, to string) (out map[string]string, err error) {\\n\\tif err := e.isValidStruct(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tout = make(map[string]string)\\n\\ts := reflect.ValueOf(e.StructAddr).Elem()\\n\\tfields := e.fields(s)\\n\\n\\tfor _, field := range fields {\\n\\t\\tfromTag, fromOk := field.tags.Lookup(from)\\n\\t\\ttoTag, toOk := field.tags.Lookup(to)\\n\\t\\tif toOk && fromOk {\\n\\t\\t\\tout[fromTag] = toTag\\n\\t\\t}\\n\\t}\\n\\n\\treturn\\n}\",\n \"func (r *tagReader) FindValueIDsByExprForTagKeyID(tagKeyID tag.KeyID, expr stmt.TagFilter) (*roaring.Bitmap, error) {\\n\\ttagKeyMetas := r.filterTagKeyMetas(tagKeyID)\\n\\tif len(tagKeyMetas) == 0 {\\n\\t\\treturn nil, fmt.Errorf(\\\"%w, tagKeyID: %d\\\", constants.ErrTagKeyMetaNotFound, tagKeyID)\\n\\t}\\n\\ttagValueIDs := roaring.New()\\n\\tfor _, tagKeyMeta := range tagKeyMetas {\\n\\t\\tswitch expression := expr.(type) {\\n\\t\\tcase *stmt.EqualsExpr:\\n\\t\\t\\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueID(expression.Value))\\n\\t\\tcase *stmt.InExpr:\\n\\t\\t\\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueIDs(expression.Values))\\n\\t\\tcase *stmt.LikeExpr:\\n\\t\\t\\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueIDsByLike(expression.Value))\\n\\t\\tcase *stmt.RegexExpr:\\n\\t\\t\\ttagValueIDs.AddMany(tagKeyMeta.FindTagValueIDsByRegex(expression.Regexp))\\n\\t\\tdefault:\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"%w, unsupported expr, tagKeyID: %d\\\",\\n\\t\\t\\t\\tconstants.ErrTagKeyMetaNotFound, tagKeyID)\\n\\t\\t}\\n\\t}\\n\\treturn tagValueIDs, nil\\n}\",\n \"func _SplitStatementMaps(db *sql.DB, udn_schema map[string]interface{}, source_array []string) []string {\\n\\t//UdnLog(udn_schema, \\\"\\\\nSplit: Maps: %v\\\\n\\\\n\\\", source_array)\\n\\n\\t// Split Open Compound\\n\\tsplit_result := _SplitStringArray(source_array, \\\"{\\\")\\n\\n\\t// Split Close Compound\\n\\tsplit_result = _SplitStringArray(split_result, \\\"}\\\")\\n\\n\\treturn split_result\\n}\",\n \"func elbTags(tags map[string]string) []*elb.Tag {\\n\\tvar e []*elb.Tag\\n\\n\\tfor k, v := range tags {\\n\\t\\te = append(e, elbTag(k, v))\\n\\t}\\n\\n\\treturn e\\n}\",\n \"func (getattr *FuseGetattrIn) ParseBinary(bcontent []byte) error {\\n\\terr := common.ParseBinary(bcontent, getattr)\\n\\n\\treturn err\\n}\",\n \"func driverArgsToMap(args []driver.Value) (map[string]interface{}, error) {\\n\\toutput := map[string]interface{}{}\\n\\tfor _, arg := range args {\\n\\t\\targBytes, ok := arg.([]byte)\\n\\t\\tif !ok {\\n\\t\\t\\treturn nil, errors.New(\\\"You must pass only a gob encoded map to the Exec/Query args\\\")\\n\\t\\t}\\n\\n\\t\\tm, err := encoding.Unmarshal(argBytes)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\n\\t\\tfor k, v := range m.(map[string]interface{}) {\\n\\t\\t\\toutput[k] = v\\n\\t\\t}\\n\\n\\t}\\n\\n\\treturn output, nil\\n}\",\n \"func (vind *Varbinary) Map(_ VCursor, ids []interface{}) ([][]byte, error) {\\n\\tout := make([][]byte, 0, len(ids))\\n\\tfor _, id := range ids {\\n\\t\\tdata, err := getVarbinaryHash(id)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"VarBinary_hash.Map :%v\\\", err)\\n\\t\\t}\\n\\t\\tout = append(out, data)\\n\\t}\\n\\treturn out, nil\\n}\",\n \"func _SplitStatementMapKeyValues(db *sql.DB, udn_schema map[string]interface{}, source_array []string) []string {\\n\\t//UdnLog(udn_schema, \\\"\\\\nSplit: Map Key Values: %v\\\\n\\\\n\\\", source_array)\\n\\n\\treturn source_array\\n}\",\n \"func parseTags(st reflect.StructTag) tags {\\n\\ts := st.Get(ndrNameSpace)\\n\\tt := tags{\\n\\t\\tValues: []string{},\\n\\t\\tMap: make(map[string]string),\\n\\t}\\n\\tif s != \\\"\\\" {\\n\\t\\tndrTags := strings.Trim(s, `\\\"`)\\n\\t\\tfor _, tag := range strings.Split(ndrTags, \\\",\\\") {\\n\\t\\t\\tif strings.Contains(tag, \\\":\\\") {\\n\\t\\t\\t\\tm := strings.SplitN(tag, \\\":\\\", 2)\\n\\t\\t\\t\\tt.Map[m[0]] = m[1]\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tt.Values = append(t.Values, tag)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn t\\n}\",\n \"func ConvertRecord(binMap as.BinMap) map[string]interface{} {\\n\\tbins := make(map[string]interface{})\\n\\tfor key, value := range binMap {\\n\\t\\tswitch value := value.(type) {\\n\\t\\tcase map[string]interface{}:\\n\\t\\t\\tlog.Println(\\\"converting stringMap \\\", key)\\n\\t\\t\\tval := ConvertStringMap(value)\\n\\t\\t\\tbins[key] = val\\n\\t\\tcase map[interface{}]interface{}:\\n\\t\\t\\tlog.Println(\\\"converting interfaceMap \\\", key)\\n\\t\\t\\tval := ConvertInterfaceMap(value)\\n\\t\\t\\tbins[key] = val\\n\\t\\tcase []interface{}:\\n\\t\\t\\tlog.Println(\\\"converting interfaceArray \\\", key)\\n\\t\\t\\tval := ConvertInterfaceArray(value)\\n\\t\\t\\tbins[key] = val\\n\\t\\tdefault:\\n\\t\\t\\tlog.Println(\\\"converting normal \\\", key)\\n\\t\\t\\tbins[key] = value\\n\\t\\t}\\n\\t}\\n\\treturn bins\\n}\",\n \"func keyvalMapsFromFeatures(features []Feature) (keyMap []string, valMap []interface{}, err error) {\\n\\tvar didFind bool\\n\\tfor _, f := range features {\\n\\t\\tfor k, v := range f.Tags {\\n\\t\\t\\tdidFind = false\\n\\t\\t\\tfor _, mk := range keyMap {\\n\\t\\t\\t\\tif k == mk {\\n\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif !didFind {\\n\\t\\t\\t\\tkeyMap = append(keyMap, k)\\n\\t\\t\\t}\\n\\t\\t\\tdidFind = false\\n\\n\\t\\t\\tswitch vt := v.(type) {\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tif vt == nil {\\n\\t\\t\\t\\t\\t// ignore nil types\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn keyMap, valMap, fmt.Errorf(\\\"unsupported type for value(%v) with key(%v) in tags for feature %v.\\\", vt, k, f)\\n\\n\\t\\t\\tcase string:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(string)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase fmt.Stringer:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(fmt.Stringer)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv.String() == vt.String() {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase int:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(int)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase int8:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(int8)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase int16:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(int16)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase int32:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(int32)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase int64:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(int64)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase uint:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(uint)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase uint8:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(uint8)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase uint16:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(uint16)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase uint32:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(uint32)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase uint64:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(uint64)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase float32:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(float32)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase float64:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(float64)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase bool:\\n\\t\\t\\t\\tfor _, mv := range valMap {\\n\\t\\t\\t\\t\\ttmv, ok := mv.(bool)\\n\\t\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif tmv == vt {\\n\\t\\t\\t\\t\\t\\tdidFind = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t} // value type switch\\n\\n\\t\\t\\tif !didFind {\\n\\t\\t\\t\\tvalMap = append(valMap, v)\\n\\t\\t\\t}\\n\\n\\t\\t} // For f.Tags\\n\\t} // for features\\n\\treturn keyMap, valMap, nil\\n}\",\n \"func evalBinaryUintExpr(ctx *Ctx, x reflect.Value, op token.Token, y reflect.Value) (reflect.Value, error) {\\n\\tvar err error\\n\\tvar r uint64\\n\\tvar b bool\\n\\tis_bool := false\\n\\n\\txx, yy := x.Uint(), y.Uint()\\n\\tswitch op {\\n\\tcase token.ADD: r = xx + yy\\n\\tcase token.SUB: r = xx - yy\\n\\tcase token.MUL: r = xx * yy\\n\\tcase token.QUO: r = xx / yy\\n\\tcase token.REM: r = xx % yy\\n\\tcase token.AND: r = xx & yy\\n\\tcase token.OR: r = xx | yy\\n\\tcase token.XOR: r = xx ^ yy\\n\\tcase token.AND_NOT: r = xx &^ yy\\n\\tcase token.EQL: b = xx == yy; is_bool = true\\n\\tcase token.NEQ: b = xx != yy; is_bool = true\\n\\tcase token.LEQ: b = xx <= yy; is_bool = true\\n\\tcase token.GEQ: b = xx >= yy; is_bool = true\\n\\tcase token.LSS: b = xx < yy; is_bool = true\\n\\tcase token.GTR: b = xx > yy; is_bool = true\\n\\tdefault: err = ErrInvalidOperands{x, op, y}\\n\\t}\\n\\tif is_bool {\\n\\t\\treturn reflect.ValueOf(b), err\\n\\t} else {\\n\\t\\treturn reflect.ValueOf(r).Convert(x.Type()), err\\n\\t}\\n}\",\n \"func extractTagValues(regex *regexp.Regexp, tagList []string, input string) api.TagSet {\\n\\tmatches := regex.FindStringSubmatch(input)\\n\\tif matches == nil {\\n\\t\\treturn nil\\n\\t}\\n\\ttagSet := api.NewTagSet()\\n\\tfor index, tagValue := range matches {\\n\\t\\tif index == 0 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\ttagKey := tagList[index-1]\\n\\t\\ttagSet[tagKey] = tagValue\\n\\t}\\n\\treturn tagSet\\n}\",\n \"func initTagConversionMap() {\\n\\n\\tTagStrToInt[\\\"bos\\\"] = 0\\n\\tTagStrToInt[\\\"$\\\"] = 1\\n\\tTagStrToInt[\\\"\\\\\\\"\\\"] = 2\\n\\tTagStrToInt[\\\"(\\\"] = 3\\n\\tTagStrToInt[\\\")\\\"] = 4\\n\\tTagStrToInt[\\\",\\\"] = 5\\n\\tTagStrToInt[\\\"--\\\"] = 6\\n\\tTagStrToInt[\\\".\\\"] = 7\\n\\tTagStrToInt[\\\":\\\"] = 8\\n\\tTagStrToInt[\\\"cc\\\"] = 9\\n\\tTagStrToInt[\\\"cd\\\"] = 10\\n\\tTagStrToInt[\\\"dt\\\"] = 11\\n\\tTagStrToInt[\\\"fw\\\"] = 12\\n\\tTagStrToInt[\\\"jj\\\"] = 13\\n\\tTagStrToInt[\\\"ls\\\"] = 14\\n\\tTagStrToInt[\\\"nn\\\"] = 15\\n\\tTagStrToInt[\\\"np\\\"] = 16\\n\\tTagStrToInt[\\\"pos\\\"] = 17\\n\\tTagStrToInt[\\\"pr\\\"] = 18\\n\\tTagStrToInt[\\\"rb\\\"] = 19\\n\\tTagStrToInt[\\\"sym\\\"] = 20\\n\\tTagStrToInt[\\\"to\\\"] = 21\\n\\tTagStrToInt[\\\"uh\\\"] = 22\\n\\tTagStrToInt[\\\"vb\\\"] = 23\\n\\tTagStrToInt[\\\"md\\\"] = 24\\n\\tTagStrToInt[\\\"in\\\"] = 25\\n\\n\\tTagIntToStr[0] = \\\"bos\\\"\\n\\tTagIntToStr[1] = \\\"$\\\"\\n\\tTagIntToStr[2] = \\\"\\\\\\\"\\\"\\n\\tTagIntToStr[3] = \\\"(\\\"\\n\\tTagIntToStr[4] = \\\")\\\"\\n\\tTagIntToStr[5] = \\\",\\\"\\n\\tTagIntToStr[6] = \\\"--\\\"\\n\\tTagIntToStr[7] = \\\".\\\"\\n\\tTagIntToStr[8] = \\\":\\\"\\n\\tTagIntToStr[9] = \\\"cc\\\"\\n\\tTagIntToStr[10] = \\\"cd\\\"\\n\\tTagIntToStr[11] = \\\"dt\\\"\\n\\tTagIntToStr[12] = \\\"fw\\\"\\n\\tTagIntToStr[13] = \\\"jj\\\"\\n\\tTagIntToStr[14] = \\\"ls\\\"\\n\\tTagIntToStr[15] = \\\"nn\\\"\\n\\tTagIntToStr[16] = \\\"np\\\"\\n\\tTagIntToStr[17] = \\\"pos\\\"\\n\\tTagIntToStr[18] = \\\"pr\\\"\\n\\tTagIntToStr[19] = \\\"rb\\\"\\n\\tTagIntToStr[20] = \\\"sym\\\"\\n\\tTagIntToStr[21] = \\\"to\\\"\\n\\tTagIntToStr[22] = \\\"uh\\\"\\n\\tTagIntToStr[23] = \\\"vb\\\"\\n\\tTagIntToStr[24] = \\\"md\\\"\\n\\tTagIntToStr[25] = \\\"in\\\"\\n}\",\n \"func VEXTRACTI32X8(ops ...operand.Op) { ctx.VEXTRACTI32X8(ops...) }\",\n \"func GetBindvars(stmt Statement) map[string]struct{} {\\n\\tbindvars := make(map[string]struct{})\\n\\t_ = Walk(func(node SQLNode) (kontinue bool, err error) {\\n\\t\\tswitch node := node.(type) {\\n\\t\\tcase *ColName, TableName:\\n\\t\\t\\t// Common node types that never contain expressions but create a lot of object\\n\\t\\t\\t// allocations.\\n\\t\\t\\treturn false, nil\\n\\t\\tcase *Argument:\\n\\t\\t\\tbindvars[node.Name] = struct{}{}\\n\\t\\tcase ListArg:\\n\\t\\t\\tbindvars[string(node)] = struct{}{}\\n\\t\\t}\\n\\t\\treturn true, nil\\n\\t}, stmt)\\n\\treturn bindvars\\n}\",\n \"func extractAnnotationsBytes(annotationBytes []byte) (map[string]string, error) {\\n\\n\\tif len(annotationBytes) == 0 {\\n\\t\\treturn nil, errors.ErrEmptyAnnotationFile\\n\\t}\\n\\n\\tvar bundleMeta metadata\\n\\tif err := yaml.Unmarshal(annotationBytes, &bundleMeta); err != nil {\\n\\t\\tlog.Error(\\\"metadata/annotations.yaml found but is malformed\\\")\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn bundleMeta.Annotations, nil\\n}\",\n \"func Binary(sc trace.SpanContext) []byte {\\n\\tif sc == (trace.SpanContext{}) {\\n\\t\\treturn nil\\n\\t}\\n\\tvar b [29]byte\\n\\tcopy(b[2:18], sc.TraceID[:])\\n\\tb[18] = 1\\n\\tcopy(b[19:27], sc.SpanID[:])\\n\\tb[27] = 2\\n\\tb[28] = uint8(sc.TraceOptions)\\n\\treturn b[:]\\n}\",\n \"func VEXTRACTI64X2_Z(i, yz, k, mx operand.Op) { ctx.VEXTRACTI64X2_Z(i, yz, k, mx) }\",\n \"func parseMemoryStatKB(filePath string, keys ...string) map[string]uint64 {\\n\\tret := make(map[string]uint64)\\n\\tfor _, line := range toLines(ioutil.ReadFile(filePath)) {\\n\\t\\tfields := strings.Split(line, \\\":\\\")\\n\\t\\tif len(fields) != 2 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tkey := strings.TrimSpace(fields[0])\\n\\t\\tfor _, ikey := range keys {\\n\\t\\t\\tif key == ikey {\\n\\t\\t\\t\\tvalue := strings.TrimSpace(fields[1])\\n\\t\\t\\t\\tvalue = strings.Replace(value, \\\" kB\\\", \\\"\\\", -1)\\n\\t\\t\\t\\tv, _ := strconv.ParseUint(value, 10, 64)\\n\\t\\t\\t\\tret[key] = v * KB\\n\\t\\t\\t\\tif len(ret) >= len(keys) {\\n\\t\\t\\t\\t\\treturn ret\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret\\n}\",\n \"func ValuesForTag(doc, tag string) ([]interface{}, error) {\\n\\tn, err := DocToTree(doc)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tm := make(map[string]interface{})\\n\\tm[n.key] = n.treeToMap(false)\\n\\n\\treturn ValuesForKey(m, tag), nil\\n}\",\n \"func (p RowData) ParseBinary(f []*Field) ([]interface{}, error) {\\n\\tdata := make([]interface{}, len(f))\\n\\n\\tif p[0] != OKHeader {\\n\\t\\treturn nil, ErrMalformPacket\\n\\t}\\n\\n\\tpos := 1 + ((len(f) + 7 + 2) >> 3)\\n\\n\\tnullBitmap := p[1:pos]\\n\\n\\tvar isUnsigned bool\\n\\tvar isNull bool\\n\\tvar err error\\n\\tvar v []byte\\n\\tfor i := range data {\\n\\t\\tif nullBitmap[(i+2)/8]&(1<<(uint(i+2)%8)) > 0 {\\n\\t\\t\\tdata[i] = nil\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tisUnsigned = f[i].Flag&uint16(UnsignedFlag) > 0\\n\\n\\t\\tswitch f[i].Type {\\n\\t\\tcase TypeNull:\\n\\t\\t\\tdata[i] = nil\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeTiny:\\n\\t\\t\\tif isUnsigned {\\n\\t\\t\\t\\tdata[i] = uint64(p[pos])\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdata[i] = int64(p[pos])\\n\\t\\t\\t}\\n\\t\\t\\tpos++\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeShort, TypeYear:\\n\\t\\t\\tif isUnsigned {\\n\\t\\t\\t\\tdata[i] = uint64(binary.LittleEndian.Uint16(p[pos : pos+2]))\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tvar n int16\\n\\t\\t\\t\\terr = binary.Read(bytes.NewBuffer(p[pos:pos+2]), binary.LittleEndian, &n)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdata[i] = int64(n)\\n\\t\\t\\t}\\n\\t\\t\\tpos += 2\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeInt24, TypeLong:\\n\\t\\t\\tif isUnsigned {\\n\\t\\t\\t\\tdata[i] = uint64(binary.LittleEndian.Uint32(p[pos : pos+4]))\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tvar n int32\\n\\t\\t\\t\\terr = binary.Read(bytes.NewBuffer(p[pos:pos+4]), binary.LittleEndian, &n)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdata[i] = int64(n)\\n\\t\\t\\t}\\n\\t\\t\\tpos += 4\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeLonglong:\\n\\t\\t\\tif isUnsigned {\\n\\t\\t\\t\\tdata[i] = binary.LittleEndian.Uint64(p[pos : pos+8])\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tvar n int64\\n\\t\\t\\t\\terr = binary.Read(bytes.NewBuffer(p[pos:pos+8]), binary.LittleEndian, &n)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdata[i] = int64(n)\\n\\t\\t\\t}\\n\\t\\t\\tpos += 8\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeFloat:\\n\\t\\t\\t//data[i] = float64(math.Float32frombits(binary.LittleEndian.Uint32(p[pos : pos+4])))\\n\\t\\t\\tvar n float32\\n\\t\\t\\terr = binary.Read(bytes.NewBuffer(p[pos:pos+4]), binary.LittleEndian, &n)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tdata[i] = float64(n)\\n\\t\\t\\tpos += 4\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeDouble:\\n\\t\\t\\tvar n float64\\n\\t\\t\\terr = binary.Read(bytes.NewBuffer(p[pos:pos+8]), binary.LittleEndian, &n)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t\\tdata[i] = n\\n\\t\\t\\tpos += 8\\n\\t\\t\\tcontinue\\n\\n\\t\\tcase TypeDecimal, TypeNewDecimal, TypeVarchar,\\n\\t\\t\\tTypeBit, TypeEnum, TypeSet, TypeTinyBlob,\\n\\t\\t\\tTypeMediumBlob, TypeLongBlob, TypeBlob,\\n\\t\\t\\tTypeVarString, TypeString, TypeGeometry:\\n\\t\\t\\tvar ok = false\\n\\t\\t\\tv, pos, isNull, ok = ReadLenEncStringAsBytes(p, pos)\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\treturn nil, fmt.Errorf(\\\"ReadLenEncStringAsBytes in ParseBinary failed\\\")\\n\\t\\t\\t}\\n\\n\\t\\t\\tif !isNull {\\n\\t\\t\\t\\tdata[i] = v\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdata[i] = nil\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\tcase TypeDate, TypeNewDate:\\n\\t\\t\\tvar num uint64\\n\\t\\t\\tnum, pos, isNull, _ = ReadLenEncInt(p, pos)\\n\\n\\t\\t\\tif isNull {\\n\\t\\t\\t\\tdata[i] = nil\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tdata[i], err = FormatBinaryDate(int(num), p[pos:])\\n\\t\\t\\tpos += int(num)\\n\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\n\\t\\tcase TypeTimestamp, TypeDatetime:\\n\\t\\t\\tvar num uint64\\n\\t\\t\\tnum, pos, isNull, _ = ReadLenEncInt(p, pos)\\n\\n\\t\\t\\tif isNull {\\n\\t\\t\\t\\tdata[i] = nil\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tdata[i], err = FormatBinaryDateTime(int(num), p[pos:])\\n\\t\\t\\tpos += int(num)\\n\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\n\\t\\tcase TypeDuration:\\n\\t\\t\\tvar num uint64\\n\\t\\t\\tnum, pos, isNull, _ = ReadLenEncInt(p, pos)\\n\\n\\t\\t\\tif isNull {\\n\\t\\t\\t\\tdata[i] = nil\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tdata[i], err = FormatBinaryTime(int(num), p[pos:])\\n\\t\\t\\tpos += int(num)\\n\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\n\\t\\tdefault:\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"Stmt Unknown FieldType %d %s\\\", f[i].Type, f[i].Name)\\n\\t\\t}\\n\\t}\\n\\n\\treturn data, nil\\n}\",\n \"func (m *Measurement) uniqueTagValues(expr influxql.Expr) map[string][]string {\\n\\t// Track unique value per tag.\\n\\ttags := make(map[string]map[string]struct{})\\n\\n\\t// Find all tag values referenced in the expression.\\n\\tinfluxql.WalkFunc(expr, func(n influxql.Node) {\\n\\t\\tswitch n := n.(type) {\\n\\t\\tcase *influxql.BinaryExpr:\\n\\t\\t\\t// Ignore operators that are not equality.\\n\\t\\t\\tif n.Op != influxql.EQ {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Extract ref and string literal.\\n\\t\\t\\tvar key, value string\\n\\t\\t\\tswitch lhs := n.LHS.(type) {\\n\\t\\t\\tcase *influxql.VarRef:\\n\\t\\t\\t\\tif rhs, ok := n.RHS.(*influxql.StringLiteral); ok {\\n\\t\\t\\t\\t\\tkey, value = lhs.Val, rhs.Val\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase *influxql.StringLiteral:\\n\\t\\t\\t\\tif rhs, ok := n.RHS.(*influxql.VarRef); ok {\\n\\t\\t\\t\\t\\tkey, value = rhs.Val, lhs.Val\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif key == \\\"\\\" {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Add value to set.\\n\\t\\t\\tif tags[key] == nil {\\n\\t\\t\\t\\ttags[key] = make(map[string]struct{})\\n\\t\\t\\t}\\n\\t\\t\\ttags[key][value] = struct{}{}\\n\\t\\t}\\n\\t})\\n\\n\\t// Convert to map of slices.\\n\\tout := make(map[string][]string)\\n\\tfor k, values := range tags {\\n\\t\\tout[k] = make([]string, 0, len(values))\\n\\t\\tfor v := range values {\\n\\t\\t\\tout[k] = append(out[k], v)\\n\\t\\t}\\n\\t\\tsort.Strings(out[k])\\n\\t}\\n\\treturn out\\n}\",\n \"func newBinaryExprEvaluator(e *Executor, op Token, lhs, rhs processor) *binaryExprEvaluator {\\n\\treturn &binaryExprEvaluator{\\n\\t\\texecutor: e,\\n\\t\\top: op,\\n\\t\\tlhs: lhs,\\n\\t\\trhs: rhs,\\n\\t\\tc: make(chan map[string]interface{}, 0),\\n\\t\\tdone: make(chan chan struct{}, 0),\\n\\t}\\n}\",\n \"func BuildTagMapping(structTemplatePointer interface{}, mappedKeyTag string, resultExclusionTag string, inheritKeyFromField bool, convertKeyToLowerCase bool, tags []string) map[string](map[string]string) {\\n\\treflectStructType := DiscoverTypeByKind(structTemplatePointer, reflect.Struct)\\n\\tvar result = make(map[string]map[string]string)\\n\\tvar anonymousMappings = make(map[string]map[string]string)\\n\\n\\tfor i := 0; i < reflectStructType.NumField(); i++ {\\n\\t\\tvar field reflect.StructField\\n\\t\\tfield = reflectStructType.Field(i)\\n\\t\\tkey := getTagValues(field, mappedKeyTag)\\n\\n\\t\\tif field.Anonymous && key == \\\"\\\" {\\n\\t\\t\\tvar anonymousType = DereferenceType(field.Type)\\n\\t\\t\\tif anonymousType.Kind() == reflect.Struct {\\n\\t\\t\\t\\tanonymousMapping := BuildTagMapping(reflect.New(anonymousType).Interface(), mappedKeyTag, resultExclusionTag, inheritKeyFromField, convertKeyToLowerCase, tags)\\n\\t\\t\\t\\tfor k, v := range anonymousMapping {\\n\\t\\t\\t\\t\\tanonymousMappings[k] = v\\n\\t\\t\\t\\t\\tanonymousMappings[k][anonymousKey] = \\\"true\\\"\\n\\t\\t\\t\\t\\tanonymousMappings[k][fieldIndexKey] = AsString(i)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tisTransient := strings.EqualFold(field.Tag.Get(resultExclusionTag), \\\"true\\\")\\n\\t\\tif isTransient {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif key == \\\"\\\" {\\n\\t\\t\\tif !inheritKeyFromField {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tkey = field.Name\\n\\t\\t}\\n\\n\\t\\tif convertKeyToLowerCase {\\n\\t\\t\\tkey = strings.ToLower(key)\\n\\t\\t}\\n\\n\\t\\tresult[key] = make(map[string]string)\\n\\t\\tfor _, tag := range tags {\\n\\t\\t\\ttagValue := field.Tag.Get(tag)\\n\\t\\t\\tif len(tagValue) > 0 {\\n\\t\\t\\t\\tresult[key][tag] = tagValue\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tresult[key][fieldNameKey] = field.Name\\n\\t}\\n\\n\\tfor k, v := range anonymousMappings {\\n\\t\\tif _, has := result[k]; !has {\\n\\t\\t\\tresult[k] = v\\n\\t\\t}\\n\\t}\\n\\treturn result\\n}\",\n \"func (t *Table) ManyMapTagged(offset int32, count int, crit string, tag string) ([]map[string]string, error) {\\n\\tvar a []map[string]string\\n\\tbody, err := t.ManyRawTagged(offset, count, crit, tag)\\n\\tif err != nil {\\n\\t\\treturn a, err\\n\\t}\\n\\ta = unpackGJsonArray(body)\\n\\treturn a, nil\\n}\",\n \"func getTagNamesByIDs(db *sql.DB, tagIDs []string) (map[string]string, error) {\\n\\ttags := make(map[string]string)\\n\\n\\trows, err := db.Query(\\\"select tag_id, tag from tags where tag_id = any($1)\\\", pg.Array(tagIDs))\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tfor rows.Next() {\\n\\t\\tvar tagID string\\n\\t\\tvar tag string\\n\\t\\tif err = rows.Scan(&tagID, &tag); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttags[tagID] = tag\\n\\n\\t}\\n\\n\\treturn tags, nil\\n}\",\n \"func (f *STAGFields) UnmarshalBinary(b []byte) error {\\n\\tl := len(b)\\n\\tif l < 3 {\\n\\t\\treturn io.ErrUnexpectedEOF\\n\\t}\\n\\n\\tf.Flags = b[0]\\n\\toffset := 1\\n\\n\\tif f.HasPCP() {\\n\\t\\tf.PCP = b[offset] & 0x07\\n\\t}\\n\\n\\tif f.HasDEI() {\\n\\t\\tf.DEIFlag = (b[offset] >> 3) & 0x01\\n\\t}\\n\\n\\tif f.HasVID() {\\n\\t\\tf.CVID = binary.BigEndian.Uint16(b[offset:offset+2]) & 0xf0ff\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func getTagIDsByNames(tx *sql.Tx, tags []string) (map[string]string, error) {\\n\\ttagIDs := make(map[string]string)\\n\\n\\trows, err := tx.Query(\\\"select tag_id, tag from tags where tag = any($1)\\\", pg.Array(tags))\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tfor rows.Next() {\\n\\t\\tvar tagID string\\n\\t\\tvar tag string\\n\\t\\tif err = rows.Scan(&tagID, &tag); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\ttagIDs[tag] = tagID\\n\\t}\\n\\n\\treturn tagIDs, nil\\n}\",\n \"func NewVarbinary(name string, m map[string]interface{}) (Vindex, error) {\\n\\treturn &Varbinary{name: name}, nil\\n}\",\n \"func parseRecord(record string) map[string]string {\\n\\tr := strings.NewReader(record)\\n\\tparser := xml.NewDecoder(r)\\n\\n\\tdepth := 0\\n\\tcontent := \\\"\\\"\\n\\n\\tcfield := make([]string, 0)\\n\\toutmap := make(map[string]string)\\n\\n\\tfor {\\n\\t\\ttoken, err := parser.Token()\\n\\t\\tif err != nil {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tswitch t := token.(type) {\\n\\t\\tcase xml.StartElement:\\n\\t\\t\\telmt := xml.StartElement(t)\\n\\t\\t\\tname := elmt.Name.Local\\n\\t\\t\\tcfield = append(cfield, name)\\n\\t\\t\\tdepth++\\n\\t\\tcase xml.EndElement:\\n\\t\\t\\tname := strings.Join(cfield, parse.keysep)\\n\\n\\t\\t\\tm, _ := regexp.MatchString(\\\"[[:alnum:]]\\\", content)\\n\\t\\t\\tif m {\\n\\t\\t\\t\\tname = safeAddKey(name, outmap)\\n\\t\\t\\t\\toutmap[name] = content\\n\\t\\t\\t}\\n\\n\\t\\t\\tcfield = cfield[:len(cfield)-1]\\n\\t\\t\\tcontent = \\\"\\\"\\n\\t\\t\\tdepth--\\n\\t\\tcase xml.CharData:\\n\\t\\t\\tbytes := xml.CharData(t)\\n\\t\\t\\tcontent = \\\"\\\\\\\"\\\" + string([]byte(bytes)) + \\\"\\\\\\\"\\\"\\n\\t\\tcase xml.ProcInst:\\n\\t\\t\\tcontinue\\n\\t\\tcase xml.Directive:\\n\\t\\t\\tcontinue\\n\\t\\tdefault:\\n\\t\\t\\tfmt.Println(\\\"Unknown\\\")\\n\\t\\t}\\n\\t}\\n\\treturn outmap\\n}\",\n \"func (p *parser) parseBinaryOps(ops []map[TokenType]*Operation) (Expression, hcl.Diagnostics) {\\n\\tif len(ops) == 0 {\\n\\t\\t// We've run out of operators, so now we'll just try to parse a term.\\n\\t\\treturn p.parseExpressionWithTraversals()\\n\\t}\\n\\n\\tthisLevel := ops[0]\\n\\tremaining := ops[1:]\\n\\n\\tvar lhs, rhs Expression\\n\\tvar operation *Operation\\n\\tvar diags hcl.Diagnostics\\n\\n\\t// Parse a term that might be the first operand of a binary\\n\\t// operation or it might just be a standalone term.\\n\\t// We won't know until we've parsed it and can look ahead\\n\\t// to see if there's an operator token for this level.\\n\\tlhs, lhsDiags := p.parseBinaryOps(remaining)\\n\\tdiags = append(diags, lhsDiags...)\\n\\tif p.recovery && lhsDiags.HasErrors() {\\n\\t\\treturn lhs, diags\\n\\t}\\n\\n\\t// We'll keep eating up operators until we run out, so that operators\\n\\t// with the same precedence will combine in a left-associative manner:\\n\\t// a+b+c => (a+b)+c, not a+(b+c)\\n\\t//\\n\\t// Should we later want to have right-associative operators, a way\\n\\t// to achieve that would be to call back up to ParseExpression here\\n\\t// instead of iteratively parsing only the remaining operators.\\n\\tfor {\\n\\t\\tnext := p.Peek()\\n\\t\\tvar newOp *Operation\\n\\t\\tvar ok bool\\n\\t\\tif newOp, ok = thisLevel[next.Type]; !ok {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\t// Are we extending an expression started on the previous iteration?\\n\\t\\tif operation != nil {\\n\\t\\t\\tlhs = &BinaryOpExpr{\\n\\t\\t\\t\\tLHS: lhs,\\n\\t\\t\\t\\tOp: operation,\\n\\t\\t\\t\\tRHS: rhs,\\n\\n\\t\\t\\t\\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\toperation = newOp\\n\\t\\tp.Read() // eat operator token\\n\\t\\tvar rhsDiags hcl.Diagnostics\\n\\t\\trhs, rhsDiags = p.parseBinaryOps(remaining)\\n\\t\\tdiags = append(diags, rhsDiags...)\\n\\t\\tif p.recovery && rhsDiags.HasErrors() {\\n\\t\\t\\treturn lhs, diags\\n\\t\\t}\\n\\t}\\n\\n\\tif operation == nil {\\n\\t\\treturn lhs, diags\\n\\t}\\n\\n\\treturn &BinaryOpExpr{\\n\\t\\tLHS: lhs,\\n\\t\\tOp: operation,\\n\\t\\tRHS: rhs,\\n\\n\\t\\tSrcRange: hcl.RangeBetween(lhs.Range(), rhs.Range()),\\n\\t}, diags\\n}\",\n \"func typeTags(structType reflect.Type) (tags []byte) {\\n\\ttagStr := structType.Field(0).Tag.Get(\\\"sshtype\\\")\\n\\n\\tfor _, tag := range strings.Split(tagStr, \\\"|\\\") {\\n\\t\\ti, err := strconv.Atoi(tag)\\n\\t\\tif err == nil {\\n\\t\\t\\ttags = append(tags, byte(i))\\n\\t\\t}\\n\\t}\\n\\n\\treturn tags\\n}\",\n \"func _b(x interface{}, op string, y interface{}) ast.Expr {\\n\\tvar xx, yx ast.Expr\\n\\tif xstr, ok := x.(string); ok {\\n\\t\\txx = _x(xstr)\\n\\t} else {\\n\\t\\txx = x.(ast.Expr)\\n\\t}\\n\\tif ystr, ok := y.(string); ok {\\n\\t\\tyx = _x(ystr)\\n\\t} else {\\n\\t\\tyx = y.(ast.Expr)\\n\\t}\\n\\treturn &ast.BinaryExpr{\\n\\t\\tX: xx,\\n\\t\\tOp: _op(op),\\n\\t\\tY: yx,\\n\\t}\\n}\",\n \"func lbTags(app string, process string) map[string]string {\\n\\treturn map[string]string{\\n\\t\\t\\\"AppID\\\": app,\\n\\t\\t\\\"ProcessType\\\": process,\\n\\t}\\n}\",\n \"func Bitextract(t TermT, n uint32) TermT {\\n\\treturn TermT(C.yices_bitextract(C.term_t(t), C.uint32_t(n)))\\n}\",\n \"func (fp *slicingFieldParser) getTaggedFields(str *[]byte) (map[string]string, error) {\\n\\tfields := make(map[string]string, 20)\\n\\tfor {\\n\\t\\tnextTag, err := fp.nextField(str, equalsBytes, true) // Expect at least a value after the tag\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"parsing next tag: %w\\\", err)\\n\\t\\t}\\n\\n\\t\\tnextValue, err := fp.nextField(str, spaceBytes, false) // We cannot expect any more fields as this may be the last\\n\\t\\tif err != nil && err != io.EOF {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"parsing next tagged value: %w\\\", err)\\n\\t\\t}\\n\\n\\t\\tfields[nextTag] = nextValue\\n\\n\\t\\tif err == io.EOF { // No more fields in stream\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\n\\treturn fields, nil\\n}\",\n \"func (s *Structx) Tags(key string) (map[string]string, error) {\\n\\tresult := map[string]string{}\\n\\n\\tfs := s.Fields()\\n\\tfor _, v := range fs {\\n\\t\\tif !v.IsExport() {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tresult[v.Name()] = v.Tag(key)\\n\\t}\\n\\n\\treturn result, nil\\n}\",\n \"func (point *Point) GetTags(noarray bool, separator string) map[string]string {\\n\\ttags := map[string]string{}\\n\\ttags[\\\"vcenter\\\"] = point.VCenter\\n\\ttags[\\\"type\\\"] = point.ObjectType\\n\\ttags[\\\"name\\\"] = point.ObjectName\\n\\tif noarray {\\n\\t\\tif len(point.Datastore) > 0 {\\n\\t\\t\\ttags[\\\"datastore\\\"] = point.Datastore[0]\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(point.Datastore) > 0 {\\n\\t\\t\\ttags[\\\"datastore\\\"] = strings.Join(point.Datastore, separator)\\n\\t\\t}\\n\\t}\\n\\tif noarray {\\n\\t\\tif len(point.Network) > 0 {\\n\\t\\t\\ttags[\\\"network\\\"] = point.Network[0]\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(point.Network) > 0 {\\n\\t\\t\\ttags[\\\"network\\\"] = strings.Join(point.Network, separator)\\n\\t\\t}\\n\\t}\\n\\tif len(point.ESXi) > 0 {\\n\\t\\ttags[\\\"host\\\"] = point.ESXi\\n\\t}\\n\\tif len(point.Cluster) > 0 {\\n\\t\\ttags[\\\"cluster\\\"] = point.Cluster\\n\\t}\\n\\tif len(point.Instance) > 0 {\\n\\t\\ttags[\\\"instance\\\"] = point.Instance\\n\\t}\\n\\tif len(point.ResourcePool) > 0 {\\n\\t\\ttags[\\\"resourcepool\\\"] = point.ResourcePool\\n\\t}\\n\\tif len(point.Folder) > 0 {\\n\\t\\ttags[\\\"folder\\\"] = point.Folder\\n\\t}\\n\\tif noarray {\\n\\t\\tif len(point.ViTags) > 0 {\\n\\t\\t\\ttags[\\\"vitags\\\"] = point.ViTags[0]\\n\\t\\t}\\n\\t} else {\\n\\t\\tif len(point.ViTags) > 0 {\\n\\t\\t\\ttags[\\\"vitags\\\"] = strings.Join(point.ViTags, separator)\\n\\t\\t}\\n\\t}\\n\\t/*\\n\\t\\tif point.NumCPU != 0 {\\n\\t\\t\\ttags[\\\"numcpu\\\"] = strconv.FormatInt(int64(point.NumCPU), 10)\\n\\t\\t}\\n\\t\\tif point.MemorySizeMB != 0 {\\n\\t\\t\\ttags[\\\"memorysizemb\\\"] = strconv.FormatInt(int64(point.MemorySizeMB), 10)\\n\\t\\t}\\n\\t*/\\n\\treturn tags\\n}\",\n \"func VEXTRACTI64X4_Z(i, z, k, my operand.Op) { ctx.VEXTRACTI64X4_Z(i, z, k, my) }\",\n \"func (release *FuseReleaseIn) ParseBinary(bcontent []byte) error {\\n\\n\\tlength := len(bcontent)\\n\\n\\tif length < 24 {\\n\\t\\treturn ErrDataLen\\n\\t}\\n\\n\\terr := common.ParseBinary(bcontent, release)\\n\\n\\treturn err\\n}\",\n \"func (s *BaseMySqlParserListener) ExitBinaryComparasionPredicate(ctx *BinaryComparasionPredicateContext) {\\n}\",\n \"func loadKeycodeConverterData() (map[string][]string, error) {\\n\\tbuf, err := grab(keycodeConverterDataInc)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tbuf = fixRE.ReplaceAllLiteral(buf, []byte(\\\", \\\"))\\n\\n\\tdomMap := make(map[string][]string)\\n\\tmatches := usbKeyRE.FindAllStringSubmatch(string(buf), -1)\\n\\tfor _, m := range matches {\\n\\t\\tvkey := m[7]\\n\\t\\tif _, ok := domMap[vkey]; ok {\\n\\t\\t\\tpanic(fmt.Sprintf(\\\"vkey %s already defined\\\", vkey))\\n\\t\\t}\\n\\t\\tdomMap[vkey] = m[1:]\\n\\t}\\n\\n\\treturn domMap, nil\\n}\",\n \"func xgetbv() (eax, edx uint32)\",\n \"func (p *Parser) switchFieldToTag(tags map[string]string, fields map[string]interface{}) (map[string]string, map[string]interface{}) {\\n\\tfor name, value := range fields {\\n\\t\\tif p.tagFilter == nil {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\t// skip switch statement if tagkey doesn't match fieldname\\n\\t\\tif !p.tagFilter.Match(name) {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\t// switch any fields in TagKeys into tags\\n\\t\\tswitch t := value.(type) {\\n\\t\\tcase string:\\n\\t\\t\\ttags[name] = t\\n\\t\\t\\tdelete(fields, name)\\n\\t\\tcase bool:\\n\\t\\t\\ttags[name] = strconv.FormatBool(t)\\n\\t\\t\\tdelete(fields, name)\\n\\t\\tcase float64:\\n\\t\\t\\ttags[name] = strconv.FormatFloat(t, 'f', -1, 64)\\n\\t\\t\\tdelete(fields, name)\\n\\t\\tdefault:\\n\\t\\t\\tp.Log.Errorf(\\\"Unrecognized type %T\\\", value)\\n\\t\\t}\\n\\t}\\n\\n\\t// remove any additional string/bool values from fields\\n\\tfor fk := range fields {\\n\\t\\tswitch fields[fk].(type) {\\n\\t\\tcase string, bool:\\n\\t\\t\\tif p.stringFilter != nil && p.stringFilter.Match(fk) {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tdelete(fields, fk)\\n\\t\\t}\\n\\t}\\n\\treturn tags, fields\\n}\",\n \"func hashmapIsBinaryKey(keyType types.Type) bool {\\n\\tswitch keyType := keyType.(type) {\\n\\tcase *types.Basic:\\n\\t\\treturn keyType.Info()&(types.IsBoolean|types.IsInteger) != 0\\n\\tcase *types.Struct:\\n\\t\\tfor i := 0; i < keyType.NumFields(); i++ {\\n\\t\\t\\tfieldType := keyType.Field(i).Type().Underlying()\\n\\t\\t\\tif !hashmapIsBinaryKey(fieldType) {\\n\\t\\t\\t\\treturn false\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true\\n\\tcase *types.Array:\\n\\t\\treturn hashmapIsBinaryKey(keyType.Elem())\\n\\tcase *types.Named:\\n\\t\\treturn hashmapIsBinaryKey(keyType.Underlying())\\n\\tdefault:\\n\\t\\treturn false\\n\\t}\\n}\",\n \"func (aiService *AppinsightsMonitorService) getTags(tagType string, name string) map[string]*string {\\n\\n\\ttags := make(map[string]*string)\\n\\n\\tcomponentHiddenlink := fmt.Sprintf(\\\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/components/%s\\\", aiService.subscriptionID, aiService.resourceGroup, aiService.name)\\n\\twebtestHiddenlink := fmt.Sprintf(\\\"hidden-link:/subscriptions/%s/resourceGroups/%s/providers/microsoft.insights/webtests/%s\\\", aiService.subscriptionID, aiService.resourceGroup, name)\\n\\tvalue := \\\"Resource\\\"\\n\\n\\tif tagType == \\\"webtest\\\" {\\n\\t\\ttags[componentHiddenlink] = &value\\n\\t}\\n\\n\\tif tagType == \\\"alert\\\" {\\n\\n\\t\\ttags[componentHiddenlink] = &value\\n\\t\\ttags[webtestHiddenlink] = &value\\n\\t}\\n\\n\\treturn tags\\n}\",\n \"func (it *Regex) TagResults(dst map[string]graph.Value) {\\n\\tfor _, tag := range it.tags.Tags() {\\n\\t\\tdst[tag] = it.Result()\\n\\t}\\n\\n\\tfor tag, value := range it.tags.Fixed() {\\n\\t\\tdst[tag] = value\\n\\t}\\n\\n\\tit.subIt.TagResults(dst)\\n}\",\n \"func GetAllInRangeOfPosts(db *sql.DB, postIDs []string) (map[string][]string, error) {\\n\\trows, err := db.Query(\\\"select post_id, tag_id from post_tags where post_id = any($1) order by post_id, tag_id\\\", pg.Array(postIDs))\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tpostTags := make(map[string][]string)\\n\\ttagIDs := make(map[string]bool)\\n\\tfor rows.Next() {\\n\\t\\tvar postID string\\n\\t\\tvar tagID string\\n\\t\\tif err = rows.Scan(&postID, &tagID); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tpostTags[postID] = append(postTags[postID], tagID)\\n\\t\\ttagIDs[tagID] = true\\n\\t}\\n\\n\\tvar tagIDsAsSlice []string\\n\\tfor tag := range tagIDs {\\n\\t\\ttagIDsAsSlice = append(tagIDsAsSlice, tag)\\n\\t}\\n\\ttagNames, err := getTagNamesByIDs(db, tagIDsAsSlice)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// replace tag IDs with tag names\\n\\tfor postID := range postTags {\\n\\t\\tfor tagIndex, tagID := range postTags[postID] {\\n\\t\\t\\tpostTags[postID][tagIndex] = tagNames[tagID]\\n\\t\\t}\\n\\t}\\n\\n\\treturn postTags, nil\\n}\",\n \"func (c *UserId) GetIpTags(ip, tag, vsys string) (map[string][]string, error) {\\n\\tif vsys == \\\"\\\" {\\n\\t\\tvsys = \\\"vsys1\\\"\\n\\t}\\n\\tc.con.LogOp(\\\"(op) getting registered ip addresses - ip:%q tag:%q vsys:%q\\\", ip, tag, vsys)\\n\\treq := c.versioning()\\n\\n\\tans := make(map[string][]string)\\n\\tfor {\\n\\t\\treq.FilterOn(ip, tag, len(ans))\\n\\t\\tresp := regResp{}\\n\\n\\t\\t_, err := c.con.Op(req, vsys, nil, &resp)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t} else if resp.Msg != nil && resp.Msg.Outfile != \\\"\\\" {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"PAN-OS returned %q instead of IP/tag mappings, please upgrade to 8.0+\\\", resp.Msg.Outfile)\\n\\t\\t}\\n\\n\\t\\tfor i := range resp.Entry {\\n\\t\\t\\tans[resp.Entry[i].Ip] = resp.Entry[i].Tags\\n\\t\\t}\\n\\n\\t\\tif req.ShouldStop(len(resp.Entry)) {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\n\\treturn ans, nil\\n}\",\n \"func VEXTRACTI128(i, y, mx operand.Op) { ctx.VEXTRACTI128(i, y, mx) }\",\n \"func ReadTags(b *kbin.Reader) Tags {\\n\\tvar t Tags\\n\\tfor num := b.Uvarint(); num > 0; num-- {\\n\\t\\tkey, size := b.Uvarint(), b.Uvarint()\\n\\t\\tt.Set(key, b.Span(int(size)))\\n\\t}\\n\\treturn t\\n}\",\n \"func (fi *funcInfo) emitBinaryOp(line int, op TokenType, a, b, c int) {\\r\\n\\tif opcode, found := arithAndBitwiseBinops[op]; found {\\r\\n\\t\\tfi.emitABC(line, opcode, a, b, c)\\r\\n\\t} else {\\r\\n\\t\\tswitch op {\\r\\n\\t\\tcase TOKEN_OP_EQ:\\r\\n\\t\\t\\tfi.emitABC(line, OP_EQ, 1, b, c)\\r\\n\\t\\tcase TOKEN_OP_NE:\\r\\n\\t\\t\\tfi.emitABC(line, OP_EQ, 0, b, c)\\r\\n\\t\\tcase TOKEN_OP_LT:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LT, 1, b, c)\\r\\n\\t\\tcase TOKEN_OP_GT:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LT, 1, c, b)\\r\\n\\t\\tcase TOKEN_OP_LE:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LE, 1, b, c)\\r\\n\\t\\tcase TOKEN_OP_GE:\\r\\n\\t\\t\\tfi.emitABC(line, OP_LE, 1, c, b)\\r\\n\\t\\t}\\r\\n\\t\\tfi.emitJmp(line, 0, 1)\\r\\n\\t\\tfi.emitLoadBool(line, a, 0, 1)\\r\\n\\t\\tfi.emitLoadBool(line, a, 1, 0)\\r\\n\\t}\\r\\n}\",\n \"func (getxattr *FuseGetxattrIn) ParseBinary(bcontent []byte) error {\\n\\n\\tlength := len(bcontent)\\n\\n\\tif length < 8 {\\n\\t\\treturn ErrDataLen\\n\\t}\\n\\n\\tcommon.ParseBinary(bcontent[:4], &getxattr.Size)\\n\\tcommon.ParseBinary(bcontent[4:8], &getxattr.Padding)\\n\\n\\tif length > 8 {\\n\\t\\tgetxattr.Name = string(bcontent[8 : length-1])\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (sps SecurityProfileSpec) GetBinaryIDs() ([]keyvalue.Cookie, error) {\\n\\trep := []keyvalue.Cookie{}\\n\\tfor _, pp := range sps.ProcessProfiles {\\n\\t\\trep = append(rep, pp.binaryPathID)\\n\\t}\\n\\treturn rep, nil\\n}\",\n \"func DenseBincountBinaryOutput(value bool) DenseBincountAttr {\\n\\treturn func(m optionalAttr) {\\n\\t\\tm[\\\"binary_output\\\"] = value\\n\\t}\\n}\",\n \"func mergeRightTags(tagsLeft, tagsRight map[string]string) map[string]string {\\n\\tif tagsLeft == nil && tagsRight == nil {\\n\\t\\treturn nil\\n\\t}\\n\\tif len(tagsRight) == 0 {\\n\\t\\treturn tagsLeft\\n\\t}\\n\\tif len(tagsLeft) == 0 {\\n\\t\\treturn tagsRight\\n\\t}\\n\\n\\tresult := make(map[string]string, len(tagsLeft)+len(tagsRight))\\n\\tfor k, v := range tagsLeft {\\n\\t\\tresult[k] = v\\n\\t}\\n\\tfor k, v := range tagsRight {\\n\\t\\tresult[k] = v\\n\\t}\\n\\treturn result\\n}\",\n \"func UnmarshalThresholdCommand(rn *rawNode) (*ThresholdCommand, error) {\\n\\trawQuery := rn.Query\\n\\n\\trawExpression, ok := rawQuery[\\\"expression\\\"]\\n\\tif !ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"no variable specified to reference for refId %v\\\", rn.RefID)\\n\\t}\\n\\treferenceVar, ok := rawExpression.(string)\\n\\tif !ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"expected threshold variable to be a string, got %T for refId %v\\\", rawExpression, rn.RefID)\\n\\t}\\n\\n\\tjsonFromM, err := json.Marshal(rawQuery[\\\"conditions\\\"])\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"failed to remarshal threshold expression body: %w\\\", err)\\n\\t}\\n\\tvar conditions []ThresholdConditionJSON\\n\\tif err = json.Unmarshal(jsonFromM, &conditions); err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"failed to unmarshal remarshaled threshold expression body: %w\\\", err)\\n\\t}\\n\\n\\tfor _, condition := range conditions {\\n\\t\\tif !IsSupportedThresholdFunc(condition.Evaluator.Type) {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"expected threshold function to be one of %s, got %s\\\", strings.Join(supportedThresholdFuncs, \\\", \\\"), condition.Evaluator.Type)\\n\\t\\t}\\n\\t}\\n\\n\\t// we only support one condition for now, we might want to turn this in to \\\"OR\\\" expressions later\\n\\tif len(conditions) != 1 {\\n\\t\\treturn nil, fmt.Errorf(\\\"threshold expression requires exactly one condition\\\")\\n\\t}\\n\\tfirstCondition := conditions[0]\\n\\n\\treturn NewThresholdCommand(rn.RefID, referenceVar, firstCondition.Evaluator.Type, firstCondition.Evaluator.Params)\\n}\",\n \"func parseByteMatch(k byteMatchType, s string) (*ByteMatch, error) {\\n\\tb := new(ByteMatch)\\n\\tb.Kind = k\\n\\n\\tparts := strings.Split(s, \\\",\\\")\\n\\n\\t// Num bytes is required for all byteMatchType keywords.\\n\\tif len(parts) < 1 {\\n\\t\\treturn nil, fmt.Errorf(\\\"%s keyword has %d parts\\\", s, len(parts))\\n\\t}\\n\\n\\tb.NumBytes = strings.TrimSpace(parts[0])\\n\\n\\tif len(parts) < b.Kind.minLen() {\\n\\t\\treturn nil, fmt.Errorf(\\\"invalid %s length: %d\\\", b.Kind, len(parts))\\n\\t}\\n\\n\\tif k == bExtract || k == bJump {\\n\\t\\t// Parse offset.\\n\\t\\toffset, err := strconv.Atoi(strings.TrimSpace(parts[1]))\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"%s offset is not an int: %v; %s\\\", b.Kind, parts[1], err)\\n\\t\\t}\\n\\t\\tb.Offset = offset\\n\\t}\\n\\n\\tif k == bExtract {\\n\\t\\t// Parse variable name.\\n\\t\\tname := parts[2]\\n\\t\\tb.Variable = name\\n\\t}\\n\\n\\tif k == bTest {\\n\\t\\t// Parse operator.\\n\\t\\tb.Operator = strings.TrimSpace(parts[1])\\n\\t\\t// Parse value. Can use a variable.\\n\\t\\tb.Value = strings.TrimSpace(parts[2])\\n\\t\\t// Parse offset.\\n\\t\\toffset, err := strconv.Atoi(strings.TrimSpace(parts[3]))\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"%s offset is not an int: %v; %s\\\", b.Kind, parts[1], err)\\n\\t\\t}\\n\\t\\tb.Offset = offset\\n\\t}\\n\\n\\t// The rest of the options, for all types not b64decode\\n\\tfor i, l := b.Kind.minLen(), len(parts); i < l; i++ {\\n\\t\\tparts[i] = strings.TrimSpace(parts[i])\\n\\t\\tb.Options = append(b.Options, parts[i])\\n\\t}\\n\\n\\treturn b, nil\\n}\",\n \"func (s *BaseSyslParserListener) EnterBinexpr(ctx *BinexprContext) {}\",\n \"func (cfg *Config) genBinarySpec(t xsd.Builtin) ([]spec, error) {\\n\\tcfg.debugf(\\\"generating Go source for binary type %q\\\", xsd.XMLName(t).Local)\\n\\ts := spec{\\n\\t\\texpr: builtinExpr(t),\\n\\t\\tname: xsd.XMLName(t).Local,\\n\\t\\txsdType: t,\\n\\t}\\n\\tmarshal := gen.Func(\\\"MarshalText\\\").Receiver(\\\"b \\\"+s.name).Returns(\\\"[]byte\\\", \\\"error\\\")\\n\\tunmarshal := gen.Func(\\\"UnmarshalText\\\").Receiver(\\\"b \\\" + s.name).Args(\\\"text []byte\\\").\\n\\t\\tReturns(\\\"err error\\\")\\n\\n\\tswitch t {\\n\\tcase xsd.HexBinary:\\n\\t\\tunmarshal.Body(`\\n\\t\\t\\t*b, err = hex.DecodeString(string(text))\\n\\t\\t\\treturn err\\n\\t\\t`)\\n\\t\\tmarshal.Body(`\\n\\t\\t\\tn := hex.EncodedLen([]byte(b))\\n\\t\\t\\tbuf := make([]byte, n)\\n\\t\\t\\thex.Encode(buf, []byte(b))\\n\\t\\t\\treturn buf, nil\\n\\t\\t`)\\n\\tcase xsd.Base64Binary:\\n\\t\\tunmarshal.Body(`\\n\\t\\t\\t*b, err = base64.StdEncoding.DecodeString(string(text))\\n\\t\\t\\treturn err\\n\\t\\t`)\\n\\t\\tmarshal.Body(`\\n\\t\\t\\tvar buf bytes.Buffer\\n\\t\\t\\tenc := base64.NewEncoder(base64.StdEncoding, &buf)\\n\\t\\t\\tenc.Write([]byte(b))\\n\\t\\t\\tenc.Close()\\n\\t\\t\\treturn buf.Bytes()\\n\\t\\t`)\\n\\t}\\n\\tmarshalFn, err := marshal.Decl()\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"MarshalText %s: %v\\\", s.name, err)\\n\\t}\\n\\tunmarshalFn, err := unmarshal.Decl()\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"UnmarshalText %s: %v\\\", s.name, err)\\n\\t}\\n\\ts.methods = append(s.methods, unmarshalFn, marshalFn)\\n\\treturn []spec{s}, nil\\n}\",\n \"func VEXTRACTI32X4(ops ...operand.Op) { ctx.VEXTRACTI32X4(ops...) }\",\n \"func (interrupt *FuseInterruptIn) ParseBinary(bcontent []byte) error {\\n\\n\\tlength := len(bcontent)\\n\\n\\tif length < 8 {\\n\\t\\treturn ErrDataLen\\n\\t}\\n\\n\\terr := common.ParseBinary(bcontent, interrupt)\\n\\n\\treturn err\\n}\",\n \"func marshalTags(tags map[string]string) []byte {\\n\\t// Empty maps marshal to empty bytes.\\n\\tif len(tags) == 0 {\\n\\t\\treturn nil\\n\\t}\\n\\n\\t// Extract keys and determine final size.\\n\\tsz := (len(tags) * 2) - 1 // separators\\n\\tkeys := make([]string, 0, len(tags))\\n\\tfor k, v := range tags {\\n\\t\\tkeys = append(keys, k)\\n\\t\\tsz += len(k) + len(v)\\n\\t}\\n\\tsort.Strings(keys)\\n\\n\\t// Generate marshaled bytes.\\n\\tb := make([]byte, sz)\\n\\tbuf := b\\n\\tfor _, k := range keys {\\n\\t\\tcopy(buf, k)\\n\\t\\tbuf[len(k)] = '|'\\n\\t\\tbuf = buf[len(k)+1:]\\n\\t}\\n\\tfor i, k := range keys {\\n\\t\\tv := tags[k]\\n\\t\\tcopy(buf, v)\\n\\t\\tif i < len(keys)-1 {\\n\\t\\t\\tbuf[len(v)] = '|'\\n\\t\\t\\tbuf = buf[len(v)+1:]\\n\\t\\t}\\n\\t}\\n\\treturn b\\n}\",\n \"func VEXTRACTF64X2(ops ...operand.Op) { ctx.VEXTRACTF64X2(ops...) }\",\n \"func ExtractMetaTags(doc *goquery.Document, prefix string) (Map, error) {\\n\\tm := Map{}\\n\\t// now get open graph tags\\n\\tdoc.Find(\\\"meta\\\").Each(func(i int, s *goquery.Selection) {\\n\\t\\tif name, _ := s.Attr(\\\"property\\\"); strings.HasPrefix(name, prefix) {\\n\\t\\t\\tvalue, _ := s.Attr(\\\"content\\\")\\n\\t\\t\\tname = strings.TrimSpace(strings.TrimPrefix(name, prefix))\\n\\t\\t\\tvalue = strings.TrimSpace(value)\\n\\t\\t\\tif value != \\\"\\\" && name != \\\"\\\" {\\n\\t\\t\\t\\tm[name] = value\\n\\t\\t\\t}\\n\\t\\t}\\n\\t})\\n\\treturn m, nil\\n}\",\n \"func loadScanCodes(keycodeConverterMap, domKeyMap map[string][]string, layoutBuf []byte) (map[string][]int64, error) {\\n\\tvkeyCodeMap, err := loadPosixWinKeyboardCodes()\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tbuf := extract(layoutBuf, \\\"kDomCodeToKeyboardCodeMap\\\")\\n\\tbuf = domCodeVkeyFixRE.ReplaceAllLiteral(buf, []byte(\\\", \\\"))\\n\\n\\tscanCodeMap := make(map[string][]int64)\\n\\tmatches := domCodeVkeyRE.FindAllStringSubmatch(string(buf), -1)\\n\\tfor _, m := range matches {\\n\\t\\tdomCode, vkey := m[1], m[2]\\n\\n\\t\\tkc, ok := keycodeConverterMap[domCode]\\n\\t\\tif !ok {\\n\\t\\t\\tpanic(fmt.Sprintf(\\\"dom code %s not defined in keycode map\\\", domCode))\\n\\t\\t}\\n\\n\\t\\tsc, ok := vkeyCodeMap[vkey]\\n\\t\\tif !ok {\\n\\t\\t\\tpanic(fmt.Sprintf(\\\"vkey %s is not defined in keyboardCodeMap\\\", vkey))\\n\\t\\t}\\n\\n\\t\\tscanCodeMap[getCode(kc[5])] = sc\\n\\t}\\n\\n\\treturn scanCodeMap, nil\\n}\",\n \"func (c *Context) VEXTRACTI64X2_Z(i, yz, k, mx operand.Op) {\\n\\tc.addinstruction(x86.VEXTRACTI64X2_Z(i, yz, k, mx))\\n}\",\n \"func (p iccProfile) tag(sig string) (int, int, error) {\\n\\n\\tfor i, j := 0, 132; i < p.tagCount(); i++ {\\n\\t\\ts := string(p.b[j : j+4])\\n\\t\\tif s != sig {\\n\\t\\t\\tj += 12\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tj += 4\\n\\t\\toff := binary.BigEndian.Uint32(p.b[j:])\\n\\t\\tj += 4\\n\\t\\tsize := binary.BigEndian.Uint32(p.b[j:])\\n\\t\\treturn int(off), int(size), nil\\n\\t}\\n\\n\\treturn 0, 0, errors.Errorf(\\\"tag %s not found\\\", sig)\\n}\",\n \"func ExtractVariables(configDict map[string]interface{}, pattern *regexp.Regexp) map[string]string {\\n\\tif pattern == nil {\\n\\t\\tpattern = defaultPattern\\n\\t}\\n\\treturn recurseExtract(configDict, pattern)\\n}\",\n \"func VEXTRACTF64X4(ops ...operand.Op) { ctx.VEXTRACTF64X4(ops...) }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.51212686","0.47047538","0.46467358","0.4614326","0.4610041","0.45031175","0.4482802","0.44662812","0.44048113","0.44041216","0.43895322","0.4388696","0.4372503","0.4370029","0.4338746","0.43042067","0.42618737","0.42575216","0.425162","0.42440602","0.42440325","0.42272347","0.4216772","0.4203272","0.41950983","0.41746587","0.41516238","0.41515523","0.41146174","0.41117457","0.41018572","0.4089285","0.40779874","0.40772247","0.40663594","0.40623248","0.40542364","0.40519562","0.40434265","0.40433165","0.40371647","0.40345597","0.40199208","0.4008476","0.40072674","0.39999354","0.3996136","0.3994551","0.399119","0.39796776","0.39687532","0.3958134","0.39572892","0.39412826","0.39374128","0.3935189","0.39316514","0.39305395","0.3927996","0.3920469","0.39077315","0.38997054","0.38634887","0.38620636","0.3861647","0.3837753","0.38328266","0.38293085","0.38232425","0.38209054","0.38085735","0.38052613","0.38047647","0.3803218","0.38012764","0.37931427","0.37913796","0.37850842","0.37847605","0.37806064","0.37783974","0.3777258","0.37760764","0.3773817","0.37732244","0.37681022","0.37648746","0.3762728","0.37524423","0.37484673","0.37475213","0.3746863","0.37429428","0.37403226","0.37355652","0.37336084","0.3732539","0.37263036","0.3724425","0.37157395"],"string":"[\n \"0.51212686\",\n \"0.47047538\",\n \"0.46467358\",\n \"0.4614326\",\n \"0.4610041\",\n \"0.45031175\",\n \"0.4482802\",\n \"0.44662812\",\n \"0.44048113\",\n \"0.44041216\",\n \"0.43895322\",\n \"0.4388696\",\n \"0.4372503\",\n \"0.4370029\",\n \"0.4338746\",\n \"0.43042067\",\n \"0.42618737\",\n \"0.42575216\",\n \"0.425162\",\n \"0.42440602\",\n \"0.42440325\",\n \"0.42272347\",\n \"0.4216772\",\n \"0.4203272\",\n \"0.41950983\",\n \"0.41746587\",\n \"0.41516238\",\n \"0.41515523\",\n \"0.41146174\",\n \"0.41117457\",\n \"0.41018572\",\n \"0.4089285\",\n \"0.40779874\",\n \"0.40772247\",\n \"0.40663594\",\n \"0.40623248\",\n \"0.40542364\",\n \"0.40519562\",\n \"0.40434265\",\n \"0.40433165\",\n \"0.40371647\",\n \"0.40345597\",\n \"0.40199208\",\n \"0.4008476\",\n \"0.40072674\",\n \"0.39999354\",\n \"0.3996136\",\n \"0.3994551\",\n \"0.399119\",\n \"0.39796776\",\n \"0.39687532\",\n \"0.3958134\",\n \"0.39572892\",\n \"0.39412826\",\n \"0.39374128\",\n \"0.3935189\",\n \"0.39316514\",\n \"0.39305395\",\n \"0.3927996\",\n \"0.3920469\",\n \"0.39077315\",\n \"0.38997054\",\n \"0.38634887\",\n \"0.38620636\",\n \"0.3861647\",\n \"0.3837753\",\n \"0.38328266\",\n \"0.38293085\",\n \"0.38232425\",\n \"0.38209054\",\n \"0.38085735\",\n \"0.38052613\",\n \"0.38047647\",\n \"0.3803218\",\n \"0.38012764\",\n \"0.37931427\",\n \"0.37913796\",\n \"0.37850842\",\n \"0.37847605\",\n \"0.37806064\",\n \"0.37783974\",\n \"0.3777258\",\n \"0.37760764\",\n \"0.3773817\",\n \"0.37732244\",\n \"0.37681022\",\n \"0.37648746\",\n \"0.3762728\",\n \"0.37524423\",\n \"0.37484673\",\n \"0.37475213\",\n \"0.3746863\",\n \"0.37429428\",\n \"0.37403226\",\n \"0.37355652\",\n \"0.37336084\",\n \"0.3732539\",\n \"0.37263036\",\n \"0.3724425\",\n \"0.37157395\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.77033806"},"document_rank":{"kind":"string","value":"0"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":27,"numItemsPerPage":100,"numTotalItems":107511,"offset":2700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3Mjc0OTUyNSwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1nby12MSIsImV4cCI6MTc3Mjc1MzEyNSwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.x5p8-6RBphz0K024l0Wk8t-iCgyh6-x6g5kM7zZ4cLWnqyT47Ec7tRFn3RoJxHYoDFymQ2qeG73pRfka0oNCDA","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":107511,"numBytesParquet":1880180349}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 7 3.85k | document stringlengths 11 430k | metadata dict | negatives listlengths 0 101 | negative_scores listlengths 0 101 | document_score stringlengths 3 10 | document_rank stringclasses 102 values |
|---|---|---|---|---|---|---|
/ PlaceholdersApiServiceTests Read slide placeholder info. Test for PlaceholdersApi.GetSlidesPlaceholder method with invalid password | func TestGetSlidesPlaceholderInvalidpassword(t *testing.T) {
request := createGetSlidesPlaceholderRequest()
request.password = invalidizeTestParamValue(request.password, "password", "string").(string)
e := initializeTest("GetSlidesPlaceholder", "password", request.password)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholder(request)
assertError(t, "GetSlidesPlaceholder", "password", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.7652924",
"0.7421789",
"0.7289619",
"0.68647504",
"0.6750458",
"0.6741826",
"0.66836923",
"0.66452175",
"0.6531085",
"0.6525193",
"0.6021881",
"0.58610797",
"0.5860749",
"0.5745081",
"0.5602761",
"0.54451406",
"0.5432458",
"0.5377808",
"0.53628707",
"0.5281325",
"0.5242934... | 0.7558047 | 1 |
/ PlaceholdersApiServiceTests Read slide placeholder info. Test for PlaceholdersApi.GetSlidesPlaceholder method with invalid folder | func TestGetSlidesPlaceholderInvalidfolder(t *testing.T) {
request := createGetSlidesPlaceholderRequest()
request.folder = invalidizeTestParamValue(request.folder, "folder", "string").(string)
e := initializeTest("GetSlidesPlaceholder", "folder", request.folder)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholder(request)
assertError(t, "GetSlidesPlaceholder", "folder", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.76464593",
"0.72734094",
"0.7080963",
"0.6891407",
"0.6787595",
"0.6741639",
"0.66689736",
"0.6606851",
"0.6552247",
"0.6500187",
"0.5653815",
"0.5614688",
"0.56072116",
"0.55183643",
"0.55057096",
"0.5492853",
"0.5474268",
"0.53080195",
"0.5119933",
"0.5092713",
"0.505522... | 0.72583574 | 2 |
/ PlaceholdersApiServiceTests Read slide placeholder info. Test for PlaceholdersApi.GetSlidesPlaceholder method with invalid storage | func TestGetSlidesPlaceholderInvalidstorage(t *testing.T) {
request := createGetSlidesPlaceholderRequest()
request.storage = invalidizeTestParamValue(request.storage, "storage", "string").(string)
e := initializeTest("GetSlidesPlaceholder", "storage", request.storage)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholder(request)
assertError(t, "GetSlidesPlaceholder", "storage", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.74726236",
"0.7126834",
"0.70229375",
"0.68586266",
"0.6796716",
"0.6593342",
"0.6591677",
"0.63682663",
"0.5907808",
"0.57252765",
"0.5694311",
"0.5644454",
"0.5521583",
"0.5447631",
"0.5353179",
"0.53521675",
"0.5343926",
"0.5180545",
"0.50608325",
"0.4972183",
"0.495961... | 0.7261586 | 1 |
/ PlaceholdersApiServiceTests Read slide placeholders info. Test for PlaceholdersApi.GetSlidesPlaceholders method | func TestGetSlidesPlaceholders(t *testing.T) {
request := createGetSlidesPlaceholdersRequest()
e := initializeTest("GetSlidesPlaceholders", "", "")
if e != nil {
t.Errorf("Error: %v.", e)
return
}
c := getTestApiClient()
r, _, e := c.PlaceholdersApi.GetSlidesPlaceholders(request)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
if r.Code != 200 && r.Code != 201 {
t.Errorf("Wrong response code: %d.", r.Code)
return
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.7704114",
"0.6871591",
"0.6780877",
"0.671483",
"0.652047",
"0.6493789",
"0.6349376",
"0.61045045",
"0.60587233",
"0.545175",
"0.54515827",
"0.54466987",
"0.53990364",
"0.5260586",
"0.518971",
"0.50221723",
"0.49513692",
"0.4901056",
"0.48680988",
"0.48502937",
"0.4768092"... | 0.7565972 | 1 |
/ PlaceholdersApiServiceTests Read slide placeholders info. Test for PlaceholdersApi.GetSlidesPlaceholders method with invalid name | func TestGetSlidesPlaceholdersInvalidname(t *testing.T) {
request := createGetSlidesPlaceholdersRequest()
request.name = invalidizeTestParamValue(request.name, "name", "string").(string)
e := initializeTest("GetSlidesPlaceholders", "name", request.name)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholders(request)
assertError(t, "GetSlidesPlaceholders", "name", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.78701633",
"0.77192426",
"0.7473006",
"0.7237844",
"0.719496",
"0.714362",
"0.65373975",
"0.6516911",
"0.60483634",
"0.59266204",
"0.5902661",
"0.5873059",
"0.58692646",
"0.54373795",
"0.5361756",
"0.5286803",
"0.5104948",
"0.5078878",
"0.49831194",
"0.49682426",
"0.494138... | 0.7449051 | 3 |
/ PlaceholdersApiServiceTests Read slide placeholders info. Test for PlaceholdersApi.GetSlidesPlaceholders method with invalid slideIndex | func TestGetSlidesPlaceholdersInvalidslideIndex(t *testing.T) {
request := createGetSlidesPlaceholdersRequest()
request.slideIndex = invalidizeTestParamValue(request.slideIndex, "slideIndex", "int32").(int32)
e := initializeTest("GetSlidesPlaceholders", "slideIndex", request.slideIndex)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholders(request)
assertError(t, "GetSlidesPlaceholders", "slideIndex", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholderInvalidslideIndex(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n request.slideIndex = invalidizeTestParamValue(request.slideIndex, \"slideIndex\", \"int32\").(int32)\n e := initializeTest(\"GetSlidesPlaceholder\", \"slideIndex\", request.slideIndex)\n if... | [
"0.789043",
"0.768191",
"0.73846763",
"0.7246314",
"0.6686254",
"0.6661206",
"0.6190447",
"0.6152584",
"0.5833082",
"0.55808973",
"0.5539054",
"0.55371183",
"0.5535584",
"0.5124074",
"0.505782",
"0.49641368",
"0.49254712",
"0.4887113",
"0.4809203",
"0.48038286",
"0.47290307",... | 0.78194296 | 1 |
/ PlaceholdersApiServiceTests Read slide placeholders info. Test for PlaceholdersApi.GetSlidesPlaceholders method with invalid password | func TestGetSlidesPlaceholdersInvalidpassword(t *testing.T) {
request := createGetSlidesPlaceholdersRequest()
request.password = invalidizeTestParamValue(request.password, "password", "string").(string)
e := initializeTest("GetSlidesPlaceholders", "password", request.password)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholders(request)
assertError(t, "GetSlidesPlaceholders", "password", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.7568427",
"0.75655067",
"0.7456097",
"0.68667454",
"0.6854863",
"0.6844978",
"0.6800352",
"0.67774934",
"0.65686285",
"0.65163094",
"0.59247226",
"0.5911065",
"0.58952093",
"0.58202726",
"0.58169687",
"0.5706522",
"0.5582681",
"0.5534366",
"0.5391632",
"0.5373874",
"0.5353... | 0.7578236 | 0 |
/ PlaceholdersApiServiceTests Read slide placeholders info. Test for PlaceholdersApi.GetSlidesPlaceholders method with invalid folder | func TestGetSlidesPlaceholdersInvalidfolder(t *testing.T) {
request := createGetSlidesPlaceholdersRequest()
request.folder = invalidizeTestParamValue(request.folder, "folder", "string").(string)
e := initializeTest("GetSlidesPlaceholders", "folder", request.folder)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholders(request)
assertError(t, "GetSlidesPlaceholders", "folder", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.7604284",
"0.74669325",
"0.7198721",
"0.7010964",
"0.6935921",
"0.6886619",
"0.6829144",
"0.67974365",
"0.6581863",
"0.65339565",
"0.57475835",
"0.5734493",
"0.5731555",
"0.5625898",
"0.55383325",
"0.5520894",
"0.5437583",
"0.5401256",
"0.50881577",
"0.50740385",
"0.504635... | 0.71627915 | 3 |
/ PlaceholdersApiServiceTests Read slide placeholders info. Test for PlaceholdersApi.GetSlidesPlaceholders method with invalid storage | func TestGetSlidesPlaceholdersInvalidstorage(t *testing.T) {
request := createGetSlidesPlaceholdersRequest()
request.storage = invalidizeTestParamValue(request.storage, "storage", "string").(string)
e := initializeTest("GetSlidesPlaceholders", "storage", request.storage)
if e != nil {
t.Errorf("Error: %v.", e)
return
}
r, _, e := getTestApiClient().PlaceholdersApi.GetSlidesPlaceholders(request)
assertError(t, "GetSlidesPlaceholders", "storage", r.Code, e)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func TestGetSlidesPlaceholder(t *testing.T) {\n request := createGetSlidesPlaceholderRequest()\n e := initializeTest(\"GetSlidesPlaceholder\", \"\", \"\")\n if e != nil {\n t.Errorf(\"Error: %v.\", e)\n return\n }\n c := getTestApiClient()\n r, _, e := c.PlaceholdersApi.GetSlidesPlace... | [
"0.7387686",
"0.7229926",
"0.7180191",
"0.6929156",
"0.684331",
"0.6842511",
"0.6622056",
"0.6592053",
"0.6116676",
"0.58174914",
"0.5777632",
"0.5731948",
"0.5561834",
"0.555739",
"0.5531502",
"0.5316684",
"0.5177551",
"0.51758355",
"0.49506363",
"0.49411616",
"0.49282283",
... | 0.72392267 | 1 |
LoadHTTPS returns the HTTP routes and middleware | func LoadHTTPS() http.Handler {
return middleware(routes())
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func LoadHTTP() http.Handler {\r\n\treturn middleware(routes())\r\n\r\n\t// Uncomment this and comment out the line above to always redirect to HTTPS\r\n\t//return http.HandlerFunc(redirectToHTTPS)\r\n}",
"func (r *Router) HTTPS() *Router {\n\tif r.root != nil {\n\t\treturn r.root.HTTPS()\n\t}\n\tr.mu.Lock()\n\t... | [
"0.7620313",
"0.6640508",
"0.5939723",
"0.58823115",
"0.5862642",
"0.58205837",
"0.5755872",
"0.57449174",
"0.563193",
"0.5490669",
"0.5442681",
"0.53498137",
"0.53085417",
"0.52618444",
"0.5251495",
"0.5232304",
"0.51856405",
"0.5175074",
"0.5157146",
"0.5120161",
"0.5120161... | 0.8867957 | 0 |
LoadHTTP returns the HTTPS routes and middleware | func LoadHTTP() http.Handler {
return middleware(routes())
// Uncomment this and comment out the line above to always redirect to HTTPS
//return http.HandlerFunc(redirectToHTTPS)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func LoadHTTPS() http.Handler {\r\n\treturn middleware(routes())\r\n}",
"func (serv *Server) ServeHTTP(res http.ResponseWriter, req *http.Request) {\n host := strings.Split(req.Host, \":\")[0]\n port := strings.Split(serv.config.HttpsAddr, \":\")[1]\n path := req.URL.Path\n\n // Redirect Non-HTTPS re... | [
"0.8452031",
"0.623786",
"0.6061106",
"0.59489584",
"0.56998134",
"0.5677931",
"0.56284374",
"0.5602687",
"0.5563809",
"0.5530905",
"0.5520147",
"0.5491471",
"0.548736",
"0.54592586",
"0.545489",
"0.5441791",
"0.54187936",
"0.54186827",
"0.54052526",
"0.5372337",
"0.5362694",... | 0.81919795 | 1 |
Less returns true if o < oo; Lender < Owner | func (o OwnershipLevel) Less(oo OwnershipLevel) bool {
if o == OwnershipLevels.Lender && oo == OwnershipLevels.Owner {
return true
}
return false
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p User) Less(e goset.Element) bool {\n\tv := e.(User)\n\tif p.Age == v.Age {\n\t\treturn p.Name < v.Name\n\t}\n\treturn p.Age < v.Age\n}",
"func (t ByAnnualizedLossExpectancy) Less(i, j int) bool {\n\treturn t.Threats[i].AnnualizedLossExpectancy() > t.Threats[j].AnnualizedLossExpectancy()\n}",
"func (o o... | [
"0.6683345",
"0.65017235",
"0.64846736",
"0.6377962",
"0.62778103",
"0.61876047",
"0.6102869",
"0.6074075",
"0.60731626",
"0.60593045",
"0.6011533",
"0.6002058",
"0.5997032",
"0.5971584",
"0.5964099",
"0.59586275",
"0.59539175",
"0.59464127",
"0.59429693",
"0.5921777",
"0.588... | 0.7938558 | 0 |
String returns string fmt | func (o OwnershipLevel) String() string {
return string(o)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s PathFormat) String() string {\n\treturn awsutil.Prettify(s)\n}",
"func (v *View) FormatString(f format.Formatter) string {\n\tv.Format(f)\n\treturn f.Output()\n}",
"func (t DataFormat) String() string {\n\treturn dataFormatToString[t]\n}",
"func FormatString(format string, v ...any) string {\n\tretur... | [
"0.68352205",
"0.67740613",
"0.67567044",
"0.6749148",
"0.6620536",
"0.6601565",
"0.65879726",
"0.6543854",
"0.6530955",
"0.64874923",
"0.64732456",
"0.6437474",
"0.6430952",
"0.63896984",
"0.63797545",
"0.6355425",
"0.63504195",
"0.6343408",
"0.63346064",
"0.6311207",
"0.630... | 0.0 | -1 |
All checks if action matches any | func (a Action) All() bool {
return a.String() == "*"
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (actionSet ActionSet) Match(action authorizer.Action) bool {\n\tfor r := range actionSet {\n\t\tif wildcard.Match(string(r), string(action)) {\n\t\t\treturn true\n\t\t}\n\t}\n\n\treturn false\n}",
"func allowed(actions []game.Action, action game.Action) bool {\n\tfor _, v := range actions {\n\t\tif v == act... | [
"0.7208854",
"0.6927319",
"0.6485091",
"0.6412657",
"0.6296537",
"0.6039117",
"0.60081935",
"0.5978657",
"0.5819046",
"0.5730246",
"0.5680649",
"0.565837",
"0.5655692",
"0.5653189",
"0.56326115",
"0.56240875",
"0.5583718",
"0.5560375",
"0.554394",
"0.5502022",
"0.5498448",
... | 0.68802994 | 2 |
String returns string representation | func (a Action) String() string {
return string(a)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s Library) String() string {\n\tres := make([]string, 5)\n\tres[0] = \"ID: \" + reform.Inspect(s.ID, true)\n\tres[1] = \"UserID: \" + reform.Inspect(s.UserID, true)\n\tres[2] = \"VolumeID: \" + reform.Inspect(s.VolumeID, true)\n\tres[3] = \"CreatedAt: \" + reform.Inspect(s.CreatedAt, true)\n\tres[4] = \"Upda... | [
"0.7153938",
"0.7055958",
"0.7038721",
"0.70264554",
"0.70264554",
"0.70228845",
"0.6990835",
"0.6985673",
"0.697657",
"0.6932796",
"0.69297034",
"0.69205225",
"0.69179523",
"0.6897726",
"0.6892526",
"0.6892423",
"0.6886584",
"0.6871274",
"0.6870672",
"0.6862762",
"0.6852569"... | 0.0 | -1 |
BuildResourceHierarchy returns an instance of ResourceHierarchy from a string | func BuildResourceHierarchy(rh string) ResourceHierarchy {
return ResourceHierarchy(rh)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func createCRDObject(s string) (*extensionsobj.CustomResourceDefinition, error) {\n\tsr := strings.NewReader(s)\n\td := yaml.NewYAMLOrJSONDecoder(sr, len(s))\n\tcrdVar := &extensionsobj.CustomResourceDefinition{}\n\tif err := d.Decode(crdVar); err != nil {\n\t\treturn nil, err\n\t}\n\treturn crdVar, nil\n\n}",
"... | [
"0.507879",
"0.5039281",
"0.50200814",
"0.49269527",
"0.4922568",
"0.4892943",
"0.47613272",
"0.47513244",
"0.47110483",
"0.46693277",
"0.45954028",
"0.45792127",
"0.45540985",
"0.448423",
"0.44429144",
"0.441587",
"0.43907326",
"0.43813485",
"0.4369978",
"0.43691695",
"0.435... | 0.6775448 | 0 |
All checks if rh matches any | func (rh ResourceHierarchy) All() bool {
return string(rh) == "*"
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func matchColloquy(co *Colloquy, fs []Filter) bool {\n\tfor _, f := range fs {\n\t\tif f.TagRegex() != nil {\n\t\t\tif ok := matchTag(co.Tags, f.TagRegex(), f.TagNegate()); !ok {\n\t\t\t\tklog.V(4).Infof(\"#%d did not pass matchTag: %s vs %s %s\", co.ID, co.Tags, f.TagRegex, f.TagNegate)\n\t\t\t\treturn false\n\t\... | [
"0.5643037",
"0.54212755",
"0.54111886",
"0.53816277",
"0.5353122",
"0.53459245",
"0.53430265",
"0.53348094",
"0.5305223",
"0.52373517",
"0.5167246",
"0.515484",
"0.5134236",
"0.5077138",
"0.50459546",
"0.5011737",
"0.5011177",
"0.5003973",
"0.49994996",
"0.4992482",
"0.49867... | 0.5070216 | 14 |
PermissionMatches returns a slice of all possible ways to check if a service account has any level of permission over this ResourceHierarchy Example: rh = "x::y::z".PermissionMatches() = ["", "x::", "x::y::", "x::y::z"] | func (rh ResourceHierarchy) PermissionMatches() []string {
whole := string(rh)
if whole == "*" {
return []string{whole}
}
parts := strings.Split(whole, "::")
ret := []string{"*"}
for i := 1; i < len(parts); i++ {
if parts[i] == "*" {
break
}
match := strings.Join(parts[:i], "::")
ret = append(ret, match+"::*")
}
return append(ret, whole)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (o LookupPermissionsResultOutput) Permissions() pulumi.StringArrayOutput {\n\treturn o.ApplyT(func(v LookupPermissionsResult) []string { return v.Permissions }).(pulumi.StringArrayOutput)\n}",
"func (*Privilege) Match(toks sayori.Toks) (string, bool) {\n\talias, ok := toks.Get(0)\n\tif !ok {\n\t\treturn \"\... | [
"0.51741725",
"0.5107898",
"0.5098851",
"0.49879822",
"0.49865288",
"0.49036857",
"0.48702577",
"0.48579472",
"0.48500648",
"0.48429",
"0.48233873",
"0.48210967",
"0.48192152",
"0.481192",
"0.48104265",
"0.48098037",
"0.48078558",
"0.4795026",
"0.4789801",
"0.47863105",
"0.47... | 0.84667057 | 0 |
Contains checks whether rh.Hierarchy contains orh.Hierarchy | func (rh ResourceHierarchy) Contains(orh ResourceHierarchy) bool {
rhh := buildResourceHierarchy(rh)
orhh := buildResourceHierarchy(orh)
if rhh.size > orhh.size {
return false
}
for i := range orhh.hierarchy {
if i >= len(rhh.hierarchy) {
return false
}
if rhh.hierarchy[i] == "*" {
return true
}
if orhh.hierarchy[i] != rhh.hierarchy[i] {
return false
}
}
return true
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Contains(ancestor, descendant Reader) bool {\n\tcurrent := descendant.Parent()\n\tfor current != nil {\n\t\tif current == ancestor {\n\t\t\treturn true\n\t\t}\n\t\tcurrent = current.Parent()\n\t}\n\n\treturn false\n}",
"func (s *baseNode) Contains(node Node) bool {\n\tfor _, p := range node.Parents() {\n\t\... | [
"0.58287984",
"0.57673496",
"0.5746496",
"0.5666999",
"0.5619743",
"0.56080854",
"0.5541025",
"0.55393964",
"0.5500818",
"0.5498922",
"0.5489444",
"0.54562813",
"0.5421652",
"0.5415308",
"0.5391012",
"0.53899676",
"0.5372071",
"0.5365434",
"0.53255564",
"0.5322515",
"0.531257... | 0.76979774 | 0 |
String returns string representation | func (rh ResourceHierarchy) String() string {
return string(rh)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s Library) String() string {\n\tres := make([]string, 5)\n\tres[0] = \"ID: \" + reform.Inspect(s.ID, true)\n\tres[1] = \"UserID: \" + reform.Inspect(s.UserID, true)\n\tres[2] = \"VolumeID: \" + reform.Inspect(s.VolumeID, true)\n\tres[3] = \"CreatedAt: \" + reform.Inspect(s.CreatedAt, true)\n\tres[4] = \"Upda... | [
"0.7153938",
"0.7055958",
"0.7038721",
"0.70264554",
"0.70264554",
"0.70228845",
"0.6990835",
"0.6985673",
"0.697657",
"0.6932796",
"0.69297034",
"0.69205225",
"0.69179523",
"0.6897726",
"0.6892526",
"0.6892423",
"0.6886584",
"0.6871274",
"0.6870672",
"0.6862762",
"0.6852569"... | 0.0 | -1 |
ValidatePermission validates a permission in string format | func ValidatePermission(str string) (bool, error) {
// Format: OwnershipLevel::Action::Service::{ResourceHierarchy}
parts := strings.Split(str, "::")
if len(parts) < 4 {
return false, fmt.Errorf(
"Incomplete permission. Expected format: " +
"Service::OwnershipLevel::Action::{ResourceHierarchy}",
)
}
ol := OwnershipLevel(parts[1])
if ol != OwnershipLevels.Owner && ol != OwnershipLevels.Lender {
return false, fmt.Errorf("OwnershipLevel needs to be RO or RL")
}
for _, part := range parts {
if part == "" {
return false, fmt.Errorf("No parts can be empty")
}
}
return true, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (m *DomainPermission) Validate(formats strfmt.Registry) error {\n\tvar res []error\n\n\tif err := m.validateName(formats); err != nil {\n\t\tres = append(res, err)\n\t}\n\n\tif err := m.validateStatus(formats); err != nil {\n\t\tres = append(res, err)\n\t}\n\n\tif len(res) > 0 {\n\t\treturn errors.CompositeVa... | [
"0.6404555",
"0.60949326",
"0.6047413",
"0.5835476",
"0.58148205",
"0.5664851",
"0.56536216",
"0.5593093",
"0.5573626",
"0.5363021",
"0.53566784",
"0.53501135",
"0.53122586",
"0.52669644",
"0.52610296",
"0.5231673",
"0.51672333",
"0.5162554",
"0.5130689",
"0.51153505",
"0.509... | 0.7913592 | 0 |
BuildPermission transforms a string into struct | func BuildPermission(str string) (Permission, error) {
if valid, err := ValidatePermission(str); !valid {
return Permission{}, err
}
parts := strings.Split(str, "::")
service := parts[0]
ol := OwnershipLevel(parts[1])
action := BuildAction(parts[2])
rh := ResourceHierarchy(strings.Join(parts[3:], "::"))
return Permission{
Service: service,
OwnershipLevel: ol,
Action: action,
ResourceHierarchy: rh,
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func stringToAccessPerm(perm string) accessPerms {\n\tvar policy accessPerms\n\tswitch perm {\n\tcase \"none\":\n\t\tpolicy = accessNone\n\tcase \"readonly\":\n\t\tpolicy = accessDownload\n\tcase \"writeonly\":\n\t\tpolicy = accessUpload\n\tcase \"readwrite\":\n\t\tpolicy = accessPublic\n\tcase \"custom\":\n\t\tpo... | [
"0.5839843",
"0.5700419",
"0.5461124",
"0.5454174",
"0.5453382",
"0.544734",
"0.5423187",
"0.5319005",
"0.5234207",
"0.5212339",
"0.52105266",
"0.5135809",
"0.49947426",
"0.4993767",
"0.4993717",
"0.49889344",
"0.48975605",
"0.486518",
"0.48615107",
"0.48504975",
"0.48403347"... | 0.7998979 | 0 |
BuildPermissions calls BuildPermission for all strings | func BuildPermissions(ps []string) ([]Permission, error) {
pSl := make([]Permission, len(ps))
var err error
for i := range ps {
pSl[i], err = BuildPermission(ps[i])
if err != nil {
return nil, err
}
}
return pSl, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func BuildPermission(str string) (Permission, error) {\n\tif valid, err := ValidatePermission(str); !valid {\n\t\treturn Permission{}, err\n\t}\n\tparts := strings.Split(str, \"::\")\n\tservice := parts[0]\n\tol := OwnershipLevel(parts[1])\n\taction := BuildAction(parts[2])\n\trh := ResourceHierarchy(strings.Join(... | [
"0.61422247",
"0.58243364",
"0.57130516",
"0.5584584",
"0.55698204",
"0.55643183",
"0.5468975",
"0.54473794",
"0.5446696",
"0.53778183",
"0.53583544",
"0.534465",
"0.5277537",
"0.5268672",
"0.52311164",
"0.52256125",
"0.5176818",
"0.5174343",
"0.51502186",
"0.5128421",
"0.511... | 0.6409221 | 0 |
IsPresent checks if a permission is satisfied in a slice | func (p Permission) IsPresent(permissions []Permission) bool {
for _, pp := range permissions {
if (pp.Service != "*" && pp.Service != p.Service) ||
(pp.Action != "*" && pp.Action != p.Action) ||
pp.OwnershipLevel.Less(p.OwnershipLevel) {
continue
}
if pp.ResourceHierarchy.Contains(p.ResourceHierarchy) {
return true
}
}
return false
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Presence(slice interface{}, val interface{}, startoptional ...int) (bool, int, error) {\n\tvar (\n\t\tpresent bool\n\t\terrs error\n\t\tindex int\n\t)\n\tsv := reflect.ValueOf(slice)\n\tf := 0\n\tpresent = false\n\tindex = -1\n\tEnd := sv.Len()\n\tStart := 0\n\terrs = nil\n\tif len(startoptional) == 0 {\... | [
"0.64717233",
"0.59599364",
"0.58938664",
"0.58781785",
"0.57898533",
"0.57694185",
"0.5768751",
"0.575387",
"0.5686415",
"0.562705",
"0.5605818",
"0.56009513",
"0.55991375",
"0.5584934",
"0.5582092",
"0.5565374",
"0.55639386",
"0.5557865",
"0.5539009",
"0.55292684",
"0.54988... | 0.69256485 | 0 |
String converts a permission to it's equivalent string format | func (p Permission) String() string {
return fmt.Sprintf(
"%s::%s::%s::%s", p.Service, p.OwnershipLevel, p.Action,
string(p.ResourceHierarchy),
)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s Permission) String() string {\n\treturn awsutil.Prettify(s)\n}",
"func (s Permission) String() string {\n\treturn awsutil.Prettify(s)\n}",
"func accessPermToString(perm accessPerms) string {\n\tpolicy := \"\"\n\tswitch perm {\n\tcase accessNone:\n\t\tpolicy = \"none\"\n\tcase accessDownload:\n\t\tpolic... | [
"0.75426996",
"0.75426996",
"0.75243884",
"0.7431164",
"0.72277147",
"0.70106864",
"0.6913734",
"0.6840892",
"0.6763522",
"0.67401725",
"0.6732706",
"0.67065585",
"0.6612664",
"0.65239304",
"0.64879215",
"0.64764166",
"0.645415",
"0.6335772",
"0.6335772",
"0.6266849",
"0.6247... | 0.73073184 | 4 |
HasServiceFullAccess checks if permission allows it's role to execute any action over any resourch hierarchy under it's service | func (p Permission) HasServiceFullAccess() bool {
if !p.Action.All() {
return false
}
return p.ResourceHierarchy.All()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p Permission) HasServiceFullOwnership() bool {\n\treturn p.HasServiceFullAccess() && p.OwnershipLevel == OwnershipLevels.Owner\n}",
"func (_BaseAccessControlGroup *BaseAccessControlGroupCaller) HasAccessRight(opts *bind.CallOpts, candidate common.Address, mgr bool) (bool, error) {\n\tvar out []interface{}\... | [
"0.72099286",
"0.6301949",
"0.6280848",
"0.62513363",
"0.62197244",
"0.61665964",
"0.61636025",
"0.612532",
"0.61158013",
"0.6114883",
"0.6099294",
"0.60276836",
"0.60020816",
"0.5968976",
"0.5878543",
"0.5869554",
"0.5858302",
"0.5846315",
"0.5843763",
"0.583212",
"0.5821522... | 0.8546371 | 0 |
HasServiceFullOwnership checks if permission allows it's role to execute any action over any resourch hierarchy under it's service and it's RO | func (p Permission) HasServiceFullOwnership() bool {
return p.HasServiceFullAccess() && p.OwnershipLevel == OwnershipLevels.Owner
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p Permission) HasServiceFullAccess() bool {\n\tif !p.Action.All() {\n\t\treturn false\n\t}\n\treturn p.ResourceHierarchy.All()\n}",
"func (o *Object) CheckOwnership(creds *auth.Credentials) bool {\n\tif o.OwnerUID == creds.EffectiveKUID || o.CreatorUID == creds.EffectiveKUID {\n\t\treturn true\n\t}\n\n\t//... | [
"0.7686756",
"0.6273822",
"0.5878802",
"0.58571726",
"0.57293135",
"0.5714139",
"0.56667215",
"0.5657168",
"0.56242394",
"0.5592213",
"0.557942",
"0.55735743",
"0.554896",
"0.5547838",
"0.5539956",
"0.5528922",
"0.5505817",
"0.55002993",
"0.54608864",
"0.5444543",
"0.5428721"... | 0.81397253 | 0 |
buildWillIAMPermission builds a permission in the format expected by WillIAM handlers | func buildWillIAMPermission(ro OwnershipLevel, action, rh string) string {
return fmt.Sprintf(
"%s::%s::%s::%s", constants.AppInfo.Name, string(ro), action, rh,
)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func BuildWillIAMPermissionLender(action, rh string) string {\n\treturn buildWillIAMPermission(OwnershipLevels.Lender, action, rh)\n}",
"func BuildPermission(str string) (Permission, error) {\n\tif valid, err := ValidatePermission(str); !valid {\n\t\treturn Permission{}, err\n\t}\n\tparts := strings.Split(str, \... | [
"0.61293143",
"0.60217214",
"0.55547345",
"0.55313754",
"0.54605144",
"0.5390645",
"0.5291528",
"0.5145955",
"0.5132717",
"0.51083726",
"0.50734323",
"0.50478834",
"0.50233483",
"0.50014144",
"0.49916154",
"0.49643424",
"0.49455625",
"0.49168488",
"0.49072856",
"0.48820496",
... | 0.73270255 | 0 |
BuildWillIAMPermissionLender builds a permission in the format expected by WillIAM handlers | func BuildWillIAMPermissionLender(action, rh string) string {
return buildWillIAMPermission(OwnershipLevels.Lender, action, rh)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func buildWillIAMPermission(ro OwnershipLevel, action, rh string) string {\n\treturn fmt.Sprintf(\n\t\t\"%s::%s::%s::%s\", constants.AppInfo.Name, string(ro), action, rh,\n\t)\n}",
"func BuildPermission(str string) (Permission, error) {\n\tif valid, err := ValidatePermission(str); !valid {\n\t\treturn Permission... | [
"0.686174",
"0.5530684",
"0.528286",
"0.52364534",
"0.5216645",
"0.50240797",
"0.49938017",
"0.49281764",
"0.49012905",
"0.48950514",
"0.48472267",
"0.48319396",
"0.48298955",
"0.47690165",
"0.47651926",
"0.47402197",
"0.46901163",
"0.46634328",
"0.46449637",
"0.46423373",
"0... | 0.701724 | 0 |
BuildWillIAMPermissionOwner builds a permission in the format expected by WillIAM handlers | func BuildWillIAMPermissionOwner(action, rh string) string {
return buildWillIAMPermission(OwnershipLevels.Owner, action, rh)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func buildWillIAMPermission(ro OwnershipLevel, action, rh string) string {\n\treturn fmt.Sprintf(\n\t\t\"%s::%s::%s::%s\", constants.AppInfo.Name, string(ro), action, rh,\n\t)\n}",
"func BuildWillIAMPermissionLender(action, rh string) string {\n\treturn buildWillIAMPermission(OwnershipLevels.Lender, action, rh)\... | [
"0.71533847",
"0.5904081",
"0.5537427",
"0.5298134",
"0.526634",
"0.5226084",
"0.49826637",
"0.49684238",
"0.4791071",
"0.478035",
"0.4727254",
"0.46865475",
"0.46777892",
"0.4661595",
"0.46341136",
"0.46195966",
"0.46175325",
"0.46106666",
"0.46081975",
"0.45975724",
"0.4587... | 0.7287224 | 0 |
BulkInsertTrades inserts a slice of trades in the database. Trades that are already in the database (i.e. horizon_id already exists) are ignored. | func (s *TickerSession) BulkInsertTrades(ctx context.Context, trades []Trade) (err error) {
if len(trades) <= 50 {
return performInsertTrades(ctx, s, trades)
}
chunks := chunkifyDBTrades(trades, 50)
for _, chunk := range chunks {
err = performInsertTrades(ctx, s, chunk)
if err != nil {
return
}
}
return
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (database *Database) bulkInsert(tx *sql.Tx, unsavedRows []StatsEntry) error {\n\tvalueStrings := make([]string, 0, 1000)\n\tvalueArgs := make([]interface{}, 0, 12000)\n\ti := 0\n\tvar prep *sql.Stmt\n\tvar err error\n\tfor _, row := range unsavedRows {\n\t\tif prep == nil {\n\t\t\tvalueStrings = append(valueS... | [
"0.66325265",
"0.6429947",
"0.6108372",
"0.60332817",
"0.58947533",
"0.587759",
"0.56211597",
"0.56208146",
"0.56136876",
"0.55765676",
"0.5526365",
"0.5512351",
"0.5472505",
"0.546174",
"0.5440162",
"0.5404001",
"0.5396643",
"0.5329541",
"0.5284762",
"0.5267658",
"0.5267159"... | 0.7601864 | 0 |
GetLastTrade returns the newest Trade object in the database. | func (s *TickerSession) GetLastTrade(ctx context.Context) (trade Trade, err error) {
err = s.GetRaw(ctx, &trade, "SELECT * FROM trades ORDER BY ledger_close_time DESC LIMIT 1")
return
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (h *HUOBI) GetLastTrade(ctx context.Context, code currency.Pair) (LastTradeData, error) {\n\tvar resp LastTradeData\n\tcodeValue, err := h.FormatSymbol(code, asset.CoinMarginedFutures)\n\tif err != nil {\n\t\treturn resp, err\n\t}\n\tparams := url.Values{}\n\tparams.Set(\"contract_code\", codeValue)\n\tpath :... | [
"0.68756187",
"0.59373677",
"0.59064734",
"0.57652515",
"0.57638764",
"0.5652808",
"0.56303495",
"0.5626168",
"0.5551367",
"0.5427623",
"0.540684",
"0.534508",
"0.53236514",
"0.5318616",
"0.5307247",
"0.52589756",
"0.52236503",
"0.51877254",
"0.51866764",
"0.51714575",
"0.516... | 0.7395649 | 0 |
DeleteOldTrades deletes trades in the database older than minDate. | func (s *TickerSession) DeleteOldTrades(ctx context.Context, minDate time.Time) error {
_, err := s.ExecRaw(ctx, "DELETE FROM trades WHERE ledger_close_time < ?", minDate)
return err
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (m *NewsyDAO) deleteOld() (int, error) {\n\tm.connect()\n\tinfo, err := db.C(m.Database).RemoveAll(bson.M{\"time\": bson.M{\"$lt\": time.Now().Add(-time.Hour * 24 * 30)}})\n\tif err != nil {\n\t\tfmt.Println(err)\n\t}\n\treturn info.Removed, err\n}",
"func (e *elephant) deleteOldRaws(before int64) error {\n... | [
"0.6019266",
"0.597073",
"0.58227867",
"0.54857105",
"0.5434066",
"0.54014707",
"0.5395646",
"0.53301513",
"0.5298872",
"0.5189107",
"0.517596",
"0.5134746",
"0.5104006",
"0.5081436",
"0.50796914",
"0.5040801",
"0.5013909",
"0.49733227",
"0.49027574",
"0.48886272",
"0.4884154... | 0.8504664 | 0 |
chunkifyDBTrades transforms a slice into a slice of chunks (also slices) of chunkSize e.g.: Chunkify([b, c, d, e, f], 2) = [[b c] [d e] [f]] | func chunkifyDBTrades(sl []Trade, chunkSize int) [][]Trade {
var chunkedSlice [][]Trade
numChunks := int(math.Ceil(float64(len(sl)) / float64(chunkSize)))
start := 0
length := len(sl)
for i := 0; i < numChunks; i++ {
end := start + chunkSize
if end > length {
end = length
}
chunk := sl[start:end]
chunkedSlice = append(chunkedSlice, chunk)
start = end
}
return chunkedSlice
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Chunk[T any](collection []T, size int) [][]T {\n\tif size <= 0 {\n\t\tpanic(\"Second parameter must be greater than 0\")\n\t}\n\n\tresult := make([][]T, 0, len(collection)/2+1)\n\tlength := len(collection)\n\n\tfor i := 0; i < length; i++ {\n\t\tchunk := i / size\n\n\t\tif i%size == 0 {\n\t\t\tresult = append... | [
"0.6250978",
"0.6039344",
"0.5996696",
"0.58535403",
"0.58295757",
"0.5801346",
"0.5676788",
"0.56612074",
"0.56340796",
"0.5479971",
"0.54364383",
"0.5423836",
"0.540924",
"0.54092264",
"0.54058325",
"0.53808355",
"0.5275819",
"0.5270938",
"0.5244062",
"0.5224602",
"0.521059... | 0.84048146 | 0 |
Your code here RPC handlers for the worker to call. | func (m *Master) Echo(req *VRequest, resp *VResponse) error {
status := req.JobStatus
pid := req.Pid
if m.getDoneReduceTaskNum() == m.NReduce { //Job finished
resp.JobType = JOB_TYPE_EXIT
m.ExitChan <- 1
return nil
}
if status == -999 { //task error
if info, ok := m.MapTask[req.TaskNum]; ok && info.Pid == req.Pid {
//Redo the task
m.MapLock.Lock()
m.TodoMapTask = append(m.TodoMapTask, req.TaskNum)
delete(m.MapTask, req.TaskNum)
m.MapLock.Unlock()
}
status = 0 //set back to free worker
}
if status == JOB_STATUS_MAP { //get res of Map task
log.Printf("Pid: %v, Map task: %v", pid, req.TaskNum)
m.MapLock.Lock()
m.DoneMapTask = append(m.DoneMapTask, req.TaskNum)
delete(m.MapTask, req.TaskNum)
m.MapLock.Unlock()
} else if status == JOB_STATUS_REDUCE { //get res of Reduce task
m.ReduceLock.Lock()
m.DoneReduceTask = append(m.DoneReduceTask, req.TaskNum)
delete(m.ReduceTask, req.TaskNum)
m.ReduceLock.Unlock()
}
// assign new task
if m.getDoneMapTaskNum() < m.NMap {
//Map
taskNum := m.getTodoMapTask()
if taskNum != -1 {
m.prepareMapTask(taskNum, pid, resp)
log.Printf("Assign Map task %v to Pid %v", taskNum, pid)
return nil
}
} else if m.getDoneReduceTaskNum() < m.NReduce {
//Reduce
resp.JobType = 2
taskNum := m.getTodoReduceTask()
if taskNum != -1 {
m.prepareReduceTask(taskNum, pid, resp)
log.Printf("Assign Reduce task %v to Pid %v", taskNum, pid)
return nil
}
}
resp.JobType = JOB_STATUS_STUB
log.Print("Assign nothing")
return nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func callWorker(worker, name string, args interface{}, reply interface{}) bool {\n\treturn call(worker, \"RPCWorker.\"+name, args, reply)\n}",
"func (rm *REKTManager) worker(req http.Request) Response {\n\tresp, err := rm.client.Do(&req)\n\tif err != nil {\n\t\treturn Response{make([]byte, 0), err}\n\t}\n\tdefer... | [
"0.68124545",
"0.67386556",
"0.6538588",
"0.64412796",
"0.63820744",
"0.6331834",
"0.6312795",
"0.6229725",
"0.62133926",
"0.620732",
"0.61875457",
"0.61756396",
"0.61652946",
"0.61633956",
"0.61487836",
"0.61311626",
"0.61278206",
"0.61274767",
"0.60870486",
"0.6065647",
"0.... | 0.0 | -1 |
an example RPC handler. the RPC argument and reply types are defined in rpc.go. | func (m *Master) Example(args *ExampleArgs, reply *ExampleReply) error {
reply.Y = args.X + 1
time.Sleep(time.Second * 3)
return nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (b *Backend) RPC(choice uint64, body []byte, v interface{}) error {\n\tconn, err := b.Dial()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tdefer conn.Close()\n\n\tchoiceBuf := make([]byte, binary.MaxVarintLen64)\n\tbinary.PutUvarint(choiceBuf, choice)\n\t_, err = conn.conn.Write(choiceBuf)\n\tif err != nil {\n... | [
"0.68129766",
"0.6796958",
"0.650533",
"0.6480653",
"0.64089096",
"0.64069104",
"0.63528615",
"0.6294185",
"0.6282052",
"0.6235586",
"0.62237513",
"0.6207886",
"0.6188606",
"0.61750627",
"0.6160879",
"0.6106869",
"0.61000663",
"0.5946692",
"0.59224355",
"0.5914379",
"0.591099... | 0.0 | -1 |
start a thread that listens for RPCs from worker.go | func (m *Master) server() {
rpc.Register(m)
rpc.HandleHTTP()
//l, e := net.Listen("tcp", ":1234")
sockname := masterSock()
os.Remove(sockname)
l, e := net.Listen("unix", sockname)
if e != nil {
log.Fatal("listen error:", e)
}
go http.Serve(l, nil)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (wk *Worker) startRPCServer() {\n\t// TODO: implement me\n\t// Hint: Refer to how the driver's startRPCServer is implemented.\n\t// TODO TODO TODO\n\t//\n\n\t//\n\t// Once shutdown is closed, should the following statement be\n\t// called, meaning the worker RPC server is existing.\n\tserverless.Debug(\"Worke... | [
"0.64237857",
"0.63124293",
"0.6109769",
"0.60422313",
"0.5865199",
"0.58389354",
"0.583757",
"0.5834663",
"0.58046454",
"0.5800697",
"0.5778423",
"0.5769884",
"0.57659143",
"0.5764688",
"0.57607377",
"0.5753001",
"0.5745076",
"0.5744342",
"0.57366085",
"0.5727261",
"0.571949... | 0.0 | -1 |
main/mrmaster.go calls Done() periodically to find out if the entire job has finished. | func (m *Master) Done() bool {
ret := false
// Your code here.
if len(m.DoneReduceTask) == m.NReduce {
ret = true
}
return ret
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (m *Master) Done() bool {\n\tret := false\n\tfmt.Printf(\"MapTasks: %v\\n\", m.mapTasks)\n\tfmt.Printf(\"RedTasks: %v\\n\", m.reduceTasks)\n\tfmt.Printf(\"nReduce: %d, nMap: %d\\n\", m.nReduce, m.nMap)\n\t// Your code here.\n\t// all tasks have finished\n\tif m.hasGenerateReduceTasks && m.nReduce <= 0 && m.nM... | [
"0.78244966",
"0.76445293",
"0.76165444",
"0.74860924",
"0.7423259",
"0.73622495",
"0.73428744",
"0.73375666",
"0.730773",
"0.73054695",
"0.7262134",
"0.7249725",
"0.7239067",
"0.721362",
"0.72051764",
"0.7198871",
"0.7190688",
"0.7186202",
"0.7177774",
"0.71742016",
"0.71372... | 0.70151204 | 23 |
create a Master. main/mrmaster.go calls this function. nReduce is the number of reduce tasks to use. | func MakeMaster(files []string, nReduce int) *Master {
m := Master{
NMap: len(files),
NReduce: nReduce,
files: files,
MapTask: make(map[int]*TaskInfo),
ReduceTask: make(map[int]*TaskInfo),
DoneMapTask: []int{},
DoneReduceTask: []int{},
ExitChan: make(chan int),
}
// Your code here.
for idx, _ := range files {
m.TodoMapTask = append(m.TodoMapTask, idx)
}
for idx := 0; idx < nReduce; idx++ {
m.TodoReduceTask = append(m.TodoReduceTask, idx)
}
go m.countTime()
m.server()
return &m
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func MakeMaster(files []string, nReduce int) *Master {\n\t// TODO: figure out better place to setup log flags\n\tlog.SetFlags(log.Ltime) // | log.Lshortfile)\n\n\tm := Master{nReduce: nReduce}\n\n\t// Your code here.\n\t// Generating Map tasks\n\tlogger.Debug(\"Generating Map tasks...\")\n\tfor i, fn := range file... | [
"0.8003093",
"0.799659",
"0.7984637",
"0.796298",
"0.79392916",
"0.7939283",
"0.7936007",
"0.7906597",
"0.78813976",
"0.78519106",
"0.7835691",
"0.7799476",
"0.77814615",
"0.7772914",
"0.77464867",
"0.77463424",
"0.7656915",
"0.7648694",
"0.7534488",
"0.7528681",
"0.7495396",... | 0.7673505 | 16 |
ReadResponse reads a server response into the received o. | func (o *SetAmountReader) ReadResponse(response runtime.ClientResponse, consumer runtime.Consumer) (interface{}, error) {
switch response.Code() {
case 200:
result := NewSetAmountOK()
if err := result.readResponse(response, consumer, o.formats); err != nil {
return nil, err
}
return result, nil
case 401:
result := NewSetAmountUnauthorized()
if err := result.readResponse(response, consumer, o.formats); err != nil {
return nil, err
}
return nil, result
case 403:
result := NewSetAmountForbidden()
if err := result.readResponse(response, consumer, o.formats); err != nil {
return nil, err
}
return nil, result
default:
return nil, runtime.NewAPIError("unknown error", response, response.Code())
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (d *ResourceHandler) ReadResponse(dataOut unsafe.Pointer, bytesToRead int32, bytesRead *int32, callback *Callback) int32 {\n\treturn lookupResourceHandlerProxy(d.Base()).ReadResponse(d, dataOut, bytesToRead, bytesRead, callback)\n}",
"func (o *GetServerReader) ReadResponse(response runtime.ClientResponse, c... | [
"0.7640225",
"0.7607834",
"0.75210214",
"0.7509121",
"0.74803215",
"0.74724656",
"0.7433606",
"0.74244606",
"0.7375357",
"0.7367311",
"0.73589337",
"0.73551553",
"0.7350114",
"0.7347274",
"0.7346054",
"0.733966",
"0.7336042",
"0.73239547",
"0.7315819",
"0.73155594",
"0.731019... | 0.0 | -1 |
NewSetAmountOK creates a SetAmountOK with default headers values | func NewSetAmountOK() *SetAmountOK {
return &SetAmountOK{}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func CreateMintRequest(args *SendArguments) []byte {\n\tsigners := GetSigners()\n\n\tconv := convert.NewConvert()\n\n\tif args.Party == \"\" {\n\t\tlog.Error(\"Missing Party information\", \"args\", args)\n\t\treturn nil\n\t}\n\n\t// TODO: Can't convert identities to accounts, this way!\n\tparty := GetAccountKey(a... | [
"0.5207237",
"0.51316726",
"0.48634335",
"0.48437864",
"0.4811924",
"0.47807398",
"0.47625837",
"0.4710125",
"0.4689143",
"0.4676157",
"0.4663853",
"0.46498233",
"0.4643923",
"0.4643528",
"0.46327043",
"0.46291775",
"0.46220052",
"0.4562653",
"0.45471358",
"0.4539772",
"0.453... | 0.7121063 | 0 |
NewSetAmountUnauthorized creates a SetAmountUnauthorized with default headers values | func NewSetAmountUnauthorized() *SetAmountUnauthorized {
return &SetAmountUnauthorized{}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewSetAmountForbidden() *SetAmountForbidden {\n\treturn &SetAmountForbidden{}\n}",
"func NewUnauthorized(cause error) Unauthorized { return Unauthorized(cause.Error()) }",
"func setAuthorization(req *http.Request, apiKey string) {\n\treq.SetBasicAuth(apiKey, \"\")\n}",
"func (rrc *ReserveRoomCreate) Set... | [
"0.5448316",
"0.5128722",
"0.5054955",
"0.49919808",
"0.4912029",
"0.48164645",
"0.47888353",
"0.477642",
"0.47480595",
"0.47142124",
"0.466739",
"0.46673635",
"0.46585533",
"0.46378735",
"0.46362117",
"0.46158162",
"0.458719",
"0.45479572",
"0.45391664",
"0.45384142",
"0.450... | 0.7436876 | 0 |
NewSetAmountForbidden creates a SetAmountForbidden with default headers values | func NewSetAmountForbidden() *SetAmountForbidden {
return &SetAmountForbidden{}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewSetAmountUnauthorized() *SetAmountUnauthorized {\n\treturn &SetAmountUnauthorized{}\n}",
"func (transaction *TokenMintTransaction) SetAmount(amount uint64) *TokenMintTransaction {\n\ttransaction.requireNotFrozen()\n\ttransaction.pb.Amount = amount\n\treturn transaction\n}",
"func (sc *StockCreate) SetA... | [
"0.6096427",
"0.53221464",
"0.52059275",
"0.51483727",
"0.5126698",
"0.50462794",
"0.5024853",
"0.5021318",
"0.49100164",
"0.49038866",
"0.4885792",
"0.48382547",
"0.48157752",
"0.47899404",
"0.47881573",
"0.47840023",
"0.47426653",
"0.47335622",
"0.47298658",
"0.4721344",
"0... | 0.78111184 | 0 |
NewHandler makes a set of endpoints available as a gRPC Server. NOTE: At some point, request tracing support needs to be added. And since much of this service used example code from gokit, the place to start for tracing support is probably here: | func NewHandler(ctx context.Context, endpoints endpoints.Endpoints, tracer stdopentracing.Tracer, logger log.Logger) pb.VaultServer {
options := []grpctransport.ServerOption{
grpctransport.ServerErrorLogger(logger),
}
return &grpcServer{
initstatus: grpctransport.NewServer(
ctx,
endpoints.InitStatusEndpoint,
DecodeInitStatusRequest,
EncodeInitStatusResponse,
append(options, grpctransport.ServerBefore(opentracing.FromGRPCRequest(tracer, "InitStatus", logger)))...,
),
init: grpctransport.NewServer(
ctx,
endpoints.InitEndpoint,
DecodeInitRequest,
EncodeInitResponse,
append(options, grpctransport.ServerBefore(opentracing.FromGRPCRequest(tracer, "Init", logger)))...,
),
sealstatus: grpctransport.NewServer(
ctx,
endpoints.SealStatusEndpoint,
DecodeSealStatusRequest,
EncodeSealStatusResponse,
append(options, grpctransport.ServerBefore(opentracing.FromGRPCRequest(tracer, "SealStatus", logger)))...,
),
unseal: grpctransport.NewServer(
ctx,
endpoints.UnsealEndpoint,
DecodeUnsealRequest,
EncodeUnsealResponse,
append(options, grpctransport.ServerBefore(opentracing.FromGRPCRequest(tracer, "Unseal", logger)))...,
),
configure: grpctransport.NewServer(
ctx,
endpoints.ConfigureEndpoint,
DecodeConfigureRequest,
EncodeConfigureResponse,
append(options, grpctransport.ServerBefore(opentracing.FromGRPCRequest(tracer, "Configure", logger)))...,
),
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Server(l log.Logger) middleware.Middleware {\n\tlogger := log.NewHelper(\"middleware/logging\", l)\n\treturn func(handler middleware.Handler) middleware.Handler {\n\t\treturn func(ctx context.Context, req interface{}) (interface{}, error) {\n\t\t\tvar (\n\t\t\t\tpath string\n\t\t\t\tmethod string\n\t\... | [
"0.6556951",
"0.64450943",
"0.63754344",
"0.624347",
"0.6240815",
"0.61856514",
"0.6153799",
"0.61345536",
"0.6077497",
"0.6069888",
"0.60464805",
"0.6020708",
"0.60102236",
"0.59864646",
"0.5958692",
"0.5957291",
"0.5948522",
"0.59407914",
"0.591217",
"0.59005606",
"0.589742... | 0.66910815 | 0 |
DecodeInitStatusRequest is a transport/grpc.DecodeRequestFunc that converts a gRPC initstatus request to a userdomain initstatus request. Primarily useful in a server. | func DecodeInitStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {
return endpoints.InitStatusRequest{}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeInitRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.InitRequest)\n\topts := service.InitOptions{\n\t\tSecretShares: int(req.SecretShares),\n\t\tSecretThreshold: int(req.SecretThreshold),\n\t\tStoredShares: int(req.StoredShares),\n\t\t... | [
"0.7129382",
"0.6976945",
"0.6869651",
"0.6422795",
"0.6369893",
"0.63555247",
"0.6338161",
"0.6306145",
"0.6297056",
"0.62524295",
"0.61499935",
"0.61132085",
"0.59392864",
"0.593118",
"0.591802",
"0.58783144",
"0.58117044",
"0.5801168",
"0.5756792",
"0.5703512",
"0.5683426"... | 0.8717294 | 0 |
DecodeInitStatusResponse is a transport/grpc.DecodeResponseFunc that converts a gRPC initstatus reply to a userdomain initstatus response. Primarily useful in a client. | func DecodeInitStatusResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {
reply := grpcReply.(*pb.InitStatusResponse)
return endpoints.InitStatusResponse{Initialized: bool(reply.Status.Initialized), Err: service.String2Error(reply.Err)}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeInitStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treturn endpoints.InitStatusRequest{}, nil\n}",
"func DecodeInitResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {\n\treply := grpcReply.(*pb.InitResponse)\n\tinit := service.InitKeys{\n\t\tKeys: ... | [
"0.69784266",
"0.6842123",
"0.678531",
"0.6287609",
"0.6072695",
"0.6056219",
"0.5958254",
"0.5863092",
"0.5836156",
"0.5796046",
"0.5773608",
"0.57431483",
"0.5683764",
"0.5647684",
"0.56337595",
"0.559996",
"0.55869573",
"0.557601",
"0.5556611",
"0.54934984",
"0.54814804",
... | 0.8493457 | 0 |
EncodeInitStatusResponse is a transport/grpc.EncodeResponseFunc that converts a userdomain initstatus response to a gRPC initstatus reply. Primarily useful in a server. | func EncodeInitStatusResponse(_ context.Context, response interface{}) (interface{}, error) {
resp := response.(endpoints.InitStatusResponse)
status := &pb.Status{Initialized: bool(resp.Initialized)}
return &pb.InitStatusResponse{Status: status, Err: service.Error2String(resp.Err)}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeInitStatusResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {\n\treply := grpcReply.(*pb.InitStatusResponse)\n\treturn endpoints.InitStatusResponse{Initialized: bool(reply.Status.Initialized), Err: service.String2Error(reply.Err)}, nil\n}",
"func EncodeGRPCStatusResponse(_ contex... | [
"0.71989673",
"0.6871065",
"0.6724791",
"0.6619698",
"0.60995674",
"0.6052052",
"0.6019687",
"0.6016102",
"0.59115225",
"0.5891892",
"0.58844995",
"0.58737874",
"0.5775363",
"0.57499516",
"0.5598026",
"0.5456248",
"0.5428055",
"0.5369682",
"0.53624517",
"0.53622776",
"0.53223... | 0.83921474 | 0 |
EncodeInitStatusRequest is a transport/grpc.EncodeRequestFunc that converts a userdomain initstatus request to a gRPC initstatus request. Primarily useful in a client. | func EncodeInitStatusRequest(_ context.Context, request interface{}) (interface{}, error) {
return &pb.InitStatusRequest{}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeInitStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treturn endpoints.InitStatusRequest{}, nil\n}",
"func EncodeInitRequest(_ context.Context, request interface{}) (interface{}, error) {\n\treq := request.(endpoints.InitRequest)\n\treturn &pb.InitRequest{\n\t\tSecretShar... | [
"0.7524147",
"0.688146",
"0.65024054",
"0.63949585",
"0.63794583",
"0.6364447",
"0.6268314",
"0.6267921",
"0.6221888",
"0.6094067",
"0.60649824",
"0.5962428",
"0.5908938",
"0.5879699",
"0.58383524",
"0.5804806",
"0.5628846",
"0.55176324",
"0.54532355",
"0.5335997",
"0.5333527... | 0.8563548 | 0 |
DecodeInitRequest is a transport/grpc.DecodeRequestFunc that converts a gRPC init request to a userdomain init request. Primarily useful in a server. | func DecodeInitRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {
req := grpcReq.(*pb.InitRequest)
opts := service.InitOptions{
SecretShares: int(req.SecretShares),
SecretThreshold: int(req.SecretThreshold),
StoredShares: int(req.StoredShares),
PGPKeys: req.PgpKeys,
RecoveryShares: int(req.RecoveryShares),
RecoveryThreshold: int(req.RecoveryThreshold),
RecoveryPGPKeys: req.RecoveryPgpKeys,
RootTokenPGPKey: req.RootTokenPgpKey,
RootTokenHolderEmail: req.RootTokenHolderEmail,
SecretKeyHolderEmails: req.SecretKeyHolderEmails,
}
return &endpoints.InitRequest{Opts: opts}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeInitStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treturn endpoints.InitStatusRequest{}, nil\n}",
"func DecodeGRPCInitBridgeRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.InitBridgeRequest)\n\tip, err := abstraction.NewIne... | [
"0.74419457",
"0.68830794",
"0.6435474",
"0.6361506",
"0.62232393",
"0.59333706",
"0.5925991",
"0.59195656",
"0.59115005",
"0.58275574",
"0.574241",
"0.5740645",
"0.57364815",
"0.5721771",
"0.5620997",
"0.55863464",
"0.5575288",
"0.5564788",
"0.5537456",
"0.5528624",
"0.55200... | 0.8064943 | 0 |
DecodeInitResponse is a transport/grpc.DecodeResponseFunc that converts a gRPC init reply to a userdomain init response. Primarily useful in a client. | func DecodeInitResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {
reply := grpcReply.(*pb.InitResponse)
init := service.InitKeys{
Keys: reply.Keys,
KeysB64: reply.KeysBase64,
RecoveryKeys: reply.RecoveryKeys,
RecoveryKeysB64: reply.RecoveryKeysBase64,
RootToken: reply.RootToken,
}
return endpoints.InitResponse{Init: init, Err: service.String2Error(reply.Err)}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeInitStatusResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {\n\treply := grpcReply.(*pb.InitStatusResponse)\n\treturn endpoints.InitStatusResponse{Initialized: bool(reply.Status.Initialized), Err: service.String2Error(reply.Err)}, nil\n}",
"func EncodeInitResponse(_ context.Cont... | [
"0.7352298",
"0.66213375",
"0.6391019",
"0.62874204",
"0.61212754",
"0.5974801",
"0.59635955",
"0.59630775",
"0.593531",
"0.5925777",
"0.58184564",
"0.57664007",
"0.56916213",
"0.5670297",
"0.5663285",
"0.5661075",
"0.56440115",
"0.56324476",
"0.5629992",
"0.56150544",
"0.560... | 0.8047387 | 0 |
EncodeInitResponse is a transport/grpc.EncodeResponseFunc that converts a userdomain init response to a gRPC init reply. Primarily useful in a server. | func EncodeInitResponse(_ context.Context, response interface{}) (interface{}, error) {
resp := response.(endpoints.InitResponse)
return &pb.InitResponse{
Keys: resp.Init.Keys,
KeysBase64: resp.Init.KeysB64,
RecoveryKeys: resp.Init.RecoveryKeys,
RecoveryKeysBase64: resp.Init.RecoveryKeysB64,
RootToken: resp.Init.RootToken,
Err: service.Error2String(resp.Err),
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func EncodeInitStatusResponse(_ context.Context, response interface{}) (interface{}, error) {\n\tresp := response.(endpoints.InitStatusResponse)\n\tstatus := &pb.Status{Initialized: bool(resp.Initialized)}\n\treturn &pb.InitStatusResponse{Status: status, Err: service.Error2String(resp.Err)}, nil\n}",
"func Encod... | [
"0.69735706",
"0.68085706",
"0.6666967",
"0.61809444",
"0.5985854",
"0.5924313",
"0.58425695",
"0.5840831",
"0.5746398",
"0.56999594",
"0.56354076",
"0.55579066",
"0.55238557",
"0.54866993",
"0.5448932",
"0.54269874",
"0.5421233",
"0.5407433",
"0.53737605",
"0.536424",
"0.535... | 0.7878448 | 0 |
EncodeInitRequest is a transport/grpc.EncodeRequestFunc that converts a userdomain init request to a gRPC init request. Primarily useful in a client. | func EncodeInitRequest(_ context.Context, request interface{}) (interface{}, error) {
req := request.(endpoints.InitRequest)
return &pb.InitRequest{
SecretShares: uint32(req.Opts.SecretShares),
SecretThreshold: uint32(req.Opts.SecretThreshold),
StoredShares: uint32(req.Opts.StoredShares),
PgpKeys: req.Opts.PGPKeys,
RecoveryShares: uint32(req.Opts.RecoveryShares),
RecoveryThreshold: uint32(req.Opts.RecoveryThreshold),
RecoveryPgpKeys: req.Opts.RecoveryPGPKeys,
RootTokenPgpKey: req.Opts.RootTokenPGPKey,
RootTokenHolderEmail: req.Opts.RootTokenHolderEmail,
SecretKeyHolderEmails: req.Opts.SecretKeyHolderEmails,
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func EncodeInitStatusRequest(_ context.Context, request interface{}) (interface{}, error) {\n\treturn &pb.InitStatusRequest{}, nil\n}",
"func DecodeInitRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.InitRequest)\n\topts := service.InitOptions{\n\t\tSecretShares: ... | [
"0.71396",
"0.6861393",
"0.6196955",
"0.5671533",
"0.5668844",
"0.55841213",
"0.55677044",
"0.5559038",
"0.55398405",
"0.55146986",
"0.5485892",
"0.54847926",
"0.54730076",
"0.54648185",
"0.54332685",
"0.5390209",
"0.53850895",
"0.53697085",
"0.5350257",
"0.53281355",
"0.5297... | 0.80858845 | 0 |
DecodeSealStatusRequest is a transport/grpc.DecodeRequestFunc that converts a gRPC sealstatus request to a userdomain sealstatus request. Primarily useful in a server. | func DecodeSealStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {
return endpoints.SealStatusRequest{}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func EncodeSealStatusRequest(_ context.Context, request interface{}) (interface{}, error) {\n\treturn &pb.SealStatusRequest{}, nil\n}",
"func DecodeGrpcReqPropagationStatus(ctx context.Context, request interface{}) (interface{}, error) {\n\treq := request.(*PropagationStatus)\n\treturn req, nil\n}",
"func Deco... | [
"0.68879247",
"0.6282473",
"0.62601626",
"0.62122816",
"0.6178334",
"0.6161537",
"0.5837773",
"0.57606804",
"0.572651",
"0.57119286",
"0.5696331",
"0.56947005",
"0.55792344",
"0.55391794",
"0.5515782",
"0.54229045",
"0.5415276",
"0.53905034",
"0.5370787",
"0.52295345",
"0.519... | 0.8666395 | 0 |
DecodeSealStatusResponse is a transport/grpc.DecodeResponseFunc that converts a gRPC sealstatus reply to a userdomain sealstatus response. Primarily useful in a client. | func DecodeSealStatusResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {
reply := grpcReply.(*pb.SealStatusResponse)
status := endpoints.SealStatusResponse{
Sealed: reply.SealStatus.Sealed,
T: int(reply.SealStatus.T),
N: int(reply.SealStatus.N),
Progress: int(reply.SealStatus.Progress),
Version: reply.SealStatus.Version,
ClusterName: reply.SealStatus.ClusterName,
ClusterID: reply.SealStatus.ClusterId,
Err: service.String2Error(reply.Err),
}
return status, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeSealStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treturn endpoints.SealStatusRequest{}, nil\n}",
"func DecodeUnsealResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {\n\treply := grpcReply.(*pb.UnsealResponse)\n\tstatus := endpoints.UnsealRespons... | [
"0.69686687",
"0.6629207",
"0.64158314",
"0.60307133",
"0.59389246",
"0.5696591",
"0.56734985",
"0.5633695",
"0.5624199",
"0.5619674",
"0.5603296",
"0.5589424",
"0.5571292",
"0.55586493",
"0.5446506",
"0.54243785",
"0.54193884",
"0.54072326",
"0.538677",
"0.53299624",
"0.5327... | 0.8337024 | 0 |
EncodeSealStatusResponse is a transport/grpc.EncodeResponseFunc that converts a userdomain sealstatus response to a gRPC sealstatus reply. Primarily useful in a server. | func EncodeSealStatusResponse(_ context.Context, response interface{}) (interface{}, error) {
resp := response.(endpoints.SealStatusResponse)
status := &pb.SealStatus{
Sealed: resp.Sealed,
T: uint32(resp.T),
N: uint32(resp.N),
Progress: uint32(resp.Progress),
Version: resp.Version,
ClusterName: resp.ClusterName,
ClusterId: resp.ClusterID,
}
return &pb.SealStatusResponse{
SealStatus: status,
Err: service.Error2String(resp.Err),
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeSealStatusResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {\n\treply := grpcReply.(*pb.SealStatusResponse)\n\tstatus := endpoints.SealStatusResponse{\n\t\tSealed: reply.SealStatus.Sealed,\n\t\tT: int(reply.SealStatus.T),\n\t\tN: int(reply.SealStatus.N),\n... | [
"0.70623535",
"0.64098006",
"0.62919486",
"0.59212404",
"0.5872281",
"0.5816939",
"0.571567",
"0.57044536",
"0.5671326",
"0.5625205",
"0.55804116",
"0.5545528",
"0.55432314",
"0.551112",
"0.5511113",
"0.5450678",
"0.54478246",
"0.5418886",
"0.54108524",
"0.54108524",
"0.52873... | 0.8174475 | 0 |
EncodeSealStatusRequest is a transport/grpc.EncodeRequestFunc that converts a userdomain sealstatus request to a gRPC sealstatus request. Primarily useful in a client. | func EncodeSealStatusRequest(_ context.Context, request interface{}) (interface{}, error) {
return &pb.SealStatusRequest{}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeSealStatusRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treturn endpoints.SealStatusRequest{}, nil\n}",
"func EncodeSealStatusResponse(_ context.Context, response interface{}) (interface{}, error) {\n\tresp := response.(endpoints.SealStatusResponse)\n\n\tstatus := &pb.SealSt... | [
"0.76378393",
"0.6283251",
"0.61115307",
"0.5937746",
"0.5923187",
"0.5863172",
"0.58038557",
"0.5720901",
"0.5712661",
"0.5675275",
"0.56752735",
"0.5631426",
"0.5261032",
"0.5145586",
"0.51382375",
"0.50512904",
"0.49910277",
"0.4978164",
"0.4916106",
"0.49155042",
"0.49059... | 0.8510512 | 0 |
DecodeUnsealRequest is a transport/grpc.DecodeRequestFunc that converts a gRPC unseal request to a userdomain unseal request. Primarily useful in a server. | func DecodeUnsealRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {
req := grpcReq.(*pb.UnsealRequest)
return &endpoints.UnsealRequest{Key: req.Key, Reset: req.Reset_}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func EncodeUnsealRequest(_ context.Context, request interface{}) (interface{}, error) {\n\treq := request.(endpoints.UnsealRequest)\n\treturn &pb.UnsealRequest{\n\t\tKey: req.Key,\n\t\tReset_: req.Reset,\n\t}, nil\n}",
"func decodeDeleteIndustryRequest(_ context.Context, request interface{}) (interface{}, err... | [
"0.7280741",
"0.5844734",
"0.5756811",
"0.5706875",
"0.566887",
"0.56676745",
"0.56396073",
"0.56286395",
"0.56273174",
"0.56095016",
"0.5571078",
"0.55685455",
"0.55680245",
"0.5558892",
"0.5547583",
"0.55451274",
"0.55109066",
"0.5507091",
"0.5495625",
"0.5492653",
"0.54662... | 0.83825207 | 0 |
DecodeUnsealResponse is a transport/grpc.DecodeResponseFunc that converts a gRPC unseal reply to a userdomain unseal response. Primarily useful in a client. | func DecodeUnsealResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {
reply := grpcReply.(*pb.UnsealResponse)
status := endpoints.UnsealResponse{
Sealed: reply.SealStatus.Sealed,
T: int(reply.SealStatus.T),
N: int(reply.SealStatus.N),
Progress: int(reply.SealStatus.Progress),
Version: reply.SealStatus.Version,
ClusterName: reply.SealStatus.ClusterName,
ClusterID: reply.SealStatus.ClusterId,
Err: service.String2Error(reply.Err),
}
return status, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func EncodeUnsealResponse(_ context.Context, response interface{}) (interface{}, error) {\n\tresp := response.(endpoints.UnsealResponse)\n\n\tstatus := &pb.SealStatus{\n\t\tSealed: resp.Sealed,\n\t\tT: uint32(resp.T),\n\t\tN: uint32(resp.N),\n\t\tProgress: uint32(resp.Progress),\n\t\tVe... | [
"0.6951401",
"0.663803",
"0.5849642",
"0.5703922",
"0.570088",
"0.5603579",
"0.55406016",
"0.5519809",
"0.5514987",
"0.5489018",
"0.5483218",
"0.545862",
"0.5448766",
"0.5431185",
"0.5408081",
"0.5398663",
"0.53911364",
"0.5359621",
"0.5354117",
"0.53493816",
"0.534481",
"0... | 0.80364317 | 0 |
EncodeUnsealResponse is a transport/grpc.EncodeResponseFunc that converts a userdomain unseal response to a gRPC sealstatus reply. Primarily useful in a server. | func EncodeUnsealResponse(_ context.Context, response interface{}) (interface{}, error) {
resp := response.(endpoints.UnsealResponse)
status := &pb.SealStatus{
Sealed: resp.Sealed,
T: uint32(resp.T),
N: uint32(resp.N),
Progress: uint32(resp.Progress),
Version: resp.Version,
ClusterName: resp.ClusterName,
ClusterId: resp.ClusterID,
}
return &pb.UnsealResponse{
SealStatus: status,
Err: service.Error2String(resp.Err),
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeUnsealResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {\n\treply := grpcReply.(*pb.UnsealResponse)\n\tstatus := endpoints.UnsealResponse{\n\t\tSealed: reply.SealStatus.Sealed,\n\t\tT: int(reply.SealStatus.T),\n\t\tN: int(reply.SealStatus.N),\n\t\tProgress... | [
"0.68511176",
"0.60471827",
"0.6003619",
"0.5851205",
"0.5676236",
"0.5624162",
"0.549162",
"0.5342651",
"0.5327939",
"0.53194475",
"0.53164035",
"0.5255484",
"0.5237665",
"0.5174125",
"0.5081887",
"0.50810015",
"0.5039617",
"0.5007958",
"0.49988678",
"0.4996362",
"0.4984836"... | 0.7886225 | 0 |
EncodeUnsealRequest is a transport/grpc.EncodeRequestFunc that converts a userdomain unseal request to a gRPC unseal request. Primarily useful in a client. | func EncodeUnsealRequest(_ context.Context, request interface{}) (interface{}, error) {
req := request.(endpoints.UnsealRequest)
return &pb.UnsealRequest{
Key: req.Key,
Reset_: req.Reset,
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeUnsealRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.UnsealRequest)\n\treturn &endpoints.UnsealRequest{Key: req.Key, Reset: req.Reset_}, nil\n}",
"func EncodeUnfollowRequest(encoder func(*http.Request) goahttp.Encoder) func(*http.Request, interface{}) err... | [
"0.7176126",
"0.56582075",
"0.5631412",
"0.5143132",
"0.5062907",
"0.50418043",
"0.49451452",
"0.49227485",
"0.48891357",
"0.4881726",
"0.48450512",
"0.48357892",
"0.4811212",
"0.47776994",
"0.47764227",
"0.47634947",
"0.47544217",
"0.473586",
"0.47289753",
"0.47256556",
"0.4... | 0.81784874 | 0 |
DecodeConfigureRequest is a transport/grpc.DecodeRequestFunc that converts a gRPC configure request to a userdomain configure request. Primarily useful in a server. | func DecodeConfigureRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {
req := grpcReq.(*pb.ConfigureRequest)
return &endpoints.ConfigureRequest{URL: req.Url, Token: req.Token}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeGRPCGetUserConfigRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.GetUserConfigParams)\n\treturn req, nil\n}",
"func DecodeGrpcReqEVPNConfig(ctx context.Context, request interface{}) (interface{}, error) {\n\treq := request.(*EVPNConfig)\n\treturn req, nil\... | [
"0.6687782",
"0.63867176",
"0.6278261",
"0.6191763",
"0.5764469",
"0.56433535",
"0.560411",
"0.55609053",
"0.5510862",
"0.5496248",
"0.5399069",
"0.5376619",
"0.5376162",
"0.5357248",
"0.53152686",
"0.52657986",
"0.52462775",
"0.5222324",
"0.5200303",
"0.5197415",
"0.5194945"... | 0.8385086 | 0 |
DecodeConfigureResponse is a transport/grpc.DecodeResponseFunc that converts a gRPC configure reply to a userdomain configure response. Primarily useful in a client. | func DecodeConfigureResponse(_ context.Context, grpcReply interface{}) (interface{}, error) {
reply := grpcReply.(*pb.ConfigureResponse)
var mounts map[string]endpoints.MountOutput
var auths map[string]endpoints.AuthMountOutput
var policies []string
if reply.ConfigStatus != nil {
// mounts
if (reply.ConfigStatus.Mounts != nil) && (len(reply.ConfigStatus.Mounts) > 0) {
mounts = make(map[string]endpoints.MountOutput)
for k, v := range reply.ConfigStatus.Mounts {
mountCfgOut := endpoints.MountConfigOutput{
DefaultLeaseTTL: int(v.Config.DefaultLeaseTtl),
MaxLeaseTTL: int(v.Config.MaxLeaseTtl),
}
mountOut := endpoints.MountOutput{
Type: v.Type,
Description: v.Description,
Config: mountCfgOut,
}
mounts[k] = mountOut
}
}
// auths
if (reply.ConfigStatus.Auths != nil) && (len(reply.ConfigStatus.Auths) > 0) {
auths = make(map[string]endpoints.AuthMountOutput)
for k, v := range reply.ConfigStatus.Auths {
authCfgOut := endpoints.AuthConfigOutput{
DefaultLeaseTTL: int(v.Config.DefaultLeaseTtl),
MaxLeaseTTL: int(v.Config.MaxLeaseTtl),
}
authMountOut := endpoints.AuthMountOutput{
Type: v.Type,
Description: v.Description,
Config: authCfgOut,
}
auths[k] = authMountOut
}
}
}
// policies
if (reply.ConfigStatus.Policies != nil) && (len(reply.ConfigStatus.Policies) > 0) {
policies = reply.ConfigStatus.Policies
}
status := endpoints.ConfigureResponse{
ConfigID: reply.ConfigStatus.ConfigId,
Mounts: mounts,
Auths: auths,
Policies: policies,
Err: service.String2Error(reply.Err),
}
return status, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeConfigureRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.ConfigureRequest)\n\treturn &endpoints.ConfigureRequest{URL: req.Url, Token: req.Token}, nil\n}",
"func DecodeGrpcRespEVPNConfig(ctx context.Context, response interface{}) (interface{}, error) {\n\tr... | [
"0.68375146",
"0.6325345",
"0.63173586",
"0.5951232",
"0.5838574",
"0.5710962",
"0.5689829",
"0.56053424",
"0.55993205",
"0.55852973",
"0.55329514",
"0.5519299",
"0.55016005",
"0.5492543",
"0.54854184",
"0.54769915",
"0.54669756",
"0.5466868",
"0.5417491",
"0.5408496",
"0.537... | 0.72897947 | 0 |
EncodeConfigureResponse is a transport/grpc.EncodeResponseFunc that converts a userdomain configure response to a gRPC configstatus reply. Primarily useful in a server. | func EncodeConfigureResponse(_ context.Context, response interface{}) (interface{}, error) {
resp := response.(endpoints.ConfigureResponse)
// mounts
var mounts map[string]*pb.MountOutput
if (resp.Mounts != nil) && (len(resp.Mounts) > 0) {
mounts = make(map[string]*pb.MountOutput)
for k, v := range resp.Mounts {
mountCfgOut := &pb.MountConfigOutput{
DefaultLeaseTtl: uint32(v.Config.DefaultLeaseTTL),
MaxLeaseTtl: uint32(v.Config.MaxLeaseTTL),
}
mountOut := &pb.MountOutput{
Type: v.Type,
Description: v.Description,
Config: mountCfgOut,
}
mounts[k] = mountOut
}
}
// auths
var auths map[string]*pb.AuthMountOutput
if (resp.Auths != nil) && (len(resp.Auths) > 0) {
auths = make(map[string]*pb.AuthMountOutput)
for k, v := range resp.Auths {
authCfgOut := &pb.AuthConfigOutput{
DefaultLeaseTtl: uint32(v.Config.DefaultLeaseTTL),
MaxLeaseTtl: uint32(v.Config.MaxLeaseTTL),
}
authMountOut := &pb.AuthMountOutput{
Type: v.Type,
Description: v.Description,
Config: authCfgOut,
}
auths[k] = authMountOut
}
}
// policies
var policies []string
if (resp.Policies != nil) && (len(resp.Policies) > 0) {
policies = resp.Policies
}
status := &pb.ConfigStatus{
ConfigId: resp.ConfigID,
Mounts: mounts,
Auths: auths,
Policies: policies,
}
return &pb.ConfigureResponse{
ConfigStatus: status,
Err: service.Error2String(resp.Err),
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func EncodeGRPCGetUserConfigResponse(_ context.Context, response interface{}) (interface{}, error) {\n\tresp := response.(*pb.UserCofing)\n\treturn resp, nil\n}",
"func EncodeGRPCSetUserConfigResponse(_ context.Context, response interface{}) (interface{}, error) {\n\tresp := response.(*pb.ErrCode)\n\treturn resp... | [
"0.6805108",
"0.64093673",
"0.63989437",
"0.62021506",
"0.5963501",
"0.57790315",
"0.57141113",
"0.5680766",
"0.56776494",
"0.56058156",
"0.5554134",
"0.55113727",
"0.5406613",
"0.5395892",
"0.52978784",
"0.5225278",
"0.52014214",
"0.5201189",
"0.5191209",
"0.5125898",
"0.511... | 0.7218883 | 0 |
EncodeConfigureRequest is a transport/grpc.EncodeRequestFunc that converts a userdomain configure request to a gRPC configure request. Primarily useful in a client. | func EncodeConfigureRequest(_ context.Context, request interface{}) (interface{}, error) {
req := request.(endpoints.ConfigureRequest)
return &pb.ConfigureRequest{
Url: req.URL,
Token: req.Token,
}, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func DecodeConfigureRequest(_ context.Context, grpcReq interface{}) (interface{}, error) {\n\treq := grpcReq.(*pb.ConfigureRequest)\n\treturn &endpoints.ConfigureRequest{URL: req.Url, Token: req.Token}, nil\n}",
"func EncodeGrpcReqEVPNConfig(ctx context.Context, request interface{}) (interface{}, error) {\n\treq... | [
"0.6559339",
"0.6361221",
"0.58737475",
"0.5830498",
"0.56752956",
"0.5668946",
"0.55751467",
"0.5566848",
"0.5555993",
"0.5520367",
"0.5438022",
"0.541237",
"0.52907526",
"0.51902467",
"0.5178918",
"0.5141556",
"0.51373947",
"0.51363564",
"0.5130922",
"0.51298547",
"0.512061... | 0.8034952 | 0 |
join appends a bunch of Go Code together, each on their own line. | func join(s []jen.Code) *jen.Statement {
r := jen.Empty()
for i, stmt := range s {
if i > 0 {
r.Line()
}
r.Add(stmt)
}
return r
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func join(sep string, a ...string) string {\n\tswitch len(a) {\n\tcase 0:\n\t\treturn \"\"\n\tcase 1:\n\t\treturn a[0]\n\t}\n\n\tres := bytes.NewBufferString(a[0])\n\tfor _, s := range a[1:] {\n\t\tres.WriteString(sep + s)\n\t}\n\n\treturn res.String()\n}",
"func join(ins []rune, c rune) (result []string) {\n\tf... | [
"0.6462607",
"0.6456748",
"0.64263934",
"0.63524187",
"0.62919945",
"0.6290557",
"0.6175297",
"0.6172926",
"0.61727154",
"0.61235195",
"0.61195123",
"0.6094888",
"0.60728055",
"0.60475653",
"0.5980173",
"0.5955701",
"0.5937746",
"0.5909189",
"0.5848211",
"0.5846472",
"0.58450... | 0.72968787 | 0 |
packageName returns the name of the package for the property to be generated. | func (p *PropertyGenerator) packageName() string {
return p.Package
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s Settings) PackageName() string {\n\treturn naming.SnakeCase(s.packageName)\n}",
"func (c *common) PackageName() string { return uniquePackageOf(c.file) }",
"func (g *Generator) DefaultPackageName(obj Object) string {\n\tpkg := obj.PackageName()\n\tif pkg == g.packageName {\n\t\treturn \"\"\n\t}\n\tretu... | [
"0.6334045",
"0.62505615",
"0.6240149",
"0.6029561",
"0.59824127",
"0.5801714",
"0.5786217",
"0.576325",
"0.57259697",
"0.57223594",
"0.5695394",
"0.5659194",
"0.5643675",
"0.5636759",
"0.56273156",
"0.5618324",
"0.5617834",
"0.56154764",
"0.56086415",
"0.5593599",
"0.5592304... | 0.838583 | 0 |
StructName returns the name of the type, which may or may not be a struct, to generate. | func (p *PropertyGenerator) StructName() string {
if p.asIterator {
return p.Name.CamelName
}
return fmt.Sprintf("%sProperty", p.Name.CamelName)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (op *Options) StructName() string {\n\tname := op.structName\n\tif name == \"\" {\n\t\tname = \"AutoGenerated\"\n\t}\n\treturn name\n}",
"func (t *typeStruct) Name() string {\n\treturn t.name\n}",
"func (t *Table) StructName() string {\n\tif t.structName == \"\" {\n\t\tt.structName = t.Name.ToCamel()\n\t}... | [
"0.7464585",
"0.7440104",
"0.71085715",
"0.69838834",
"0.65917873",
"0.65784574",
"0.6504498",
"0.6440659",
"0.6369878",
"0.63357544",
"0.6319041",
"0.6307408",
"0.6283176",
"0.6267489",
"0.6229999",
"0.61658555",
"0.6117011",
"0.6110303",
"0.6110303",
"0.61003494",
"0.606666... | 0.74763453 | 0 |
PropertyName returns the name of this property, as defined in specifications. It is not suitable for use in generated code function identifiers. | func (p *PropertyGenerator) PropertyName() string {
return p.Name.LowerName
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (d DocLanguageHelper) GetPropertyName(p *schema.Property) (string, error) {\n\treturn PyName(p.Name), nil\n}",
"func (d DocLanguageHelper) GetPropertyName(p *schema.Property) (string, error) {\n\treturn p.Name, nil\n}",
"func propertyName(name string) string {\n\treturn makeValidIdentifier(Title(name))\n}... | [
"0.8008688",
"0.7862032",
"0.741721",
"0.6724723",
"0.67157304",
"0.6606673",
"0.65028703",
"0.63482594",
"0.61136585",
"0.61080045",
"0.610107",
"0.6085882",
"0.60559255",
"0.6050332",
"0.60107625",
"0.59004015",
"0.58642846",
"0.58588517",
"0.5833226",
"0.57711846",
"0.5756... | 0.7632998 | 2 |
deserializeFnName returns the identifier of the function that deserializes raw JSON into the generated Go type. | func (p *PropertyGenerator) deserializeFnName() string {
if p.asIterator {
return fmt.Sprintf("%s%s", deserializeIteratorMethod, p.Name.CamelName)
}
return fmt.Sprintf("%s%sProperty", deserializeMethod, p.Name.CamelName)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p *PropertyGenerator) serializeFnName() string {\n\tif p.asIterator {\n\t\treturn serializeIteratorMethod\n\t}\n\treturn serializeMethod\n}",
"func (s *Instruction) FuncName() string {\n\tif name, ok := protoNameToFuncName[s.Protobuf.TypeName]; ok {\n\t\treturn name\n\t}\n\treturn \"?\"\n}",
"func (f Des... | [
"0.60313565",
"0.5606588",
"0.52499104",
"0.5136683",
"0.5099535",
"0.5093798",
"0.5093467",
"0.49743375",
"0.49689713",
"0.49670947",
"0.49635115",
"0.49327964",
"0.49268723",
"0.4926614",
"0.49064428",
"0.49031153",
"0.485391",
"0.48537642",
"0.48403162",
"0.4805315",
"0.48... | 0.7501765 | 0 |
getFnName returns the identifier of the function that fetches concrete types of the property. | func (p *PropertyGenerator) getFnName(i int) string {
if len(p.Kinds) == 1 {
return getMethod
}
return fmt.Sprintf("%s%s", getMethod, p.kindCamelName(i))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func getFunctionName(fn interface{}) string {\n\treturn runtime.FuncForPC(reflect.ValueOf((fn)).Pointer()).Name()\n}",
"func getFunctionName(i interface{}) string {\n\treturn runtime.FuncForPC(reflect.ValueOf(i).Pointer()).Name()\n}",
"func GetFunctionName(i interface{}) string {\n\treturn runtime.FuncForPC(re... | [
"0.6827634",
"0.6727215",
"0.66207886",
"0.651886",
"0.6495852",
"0.6442681",
"0.64336634",
"0.64139414",
"0.62645584",
"0.61905044",
"0.61785775",
"0.6156786",
"0.6141121",
"0.61350834",
"0.6092728",
"0.60824543",
"0.6068047",
"0.60299236",
"0.6020793",
"0.59540904",
"0.5926... | 0.7537252 | 0 |
setFnName returns the identifier of the function that sets concrete types of the property. | func (p *PropertyGenerator) setFnName(i int) string {
if len(p.Kinds) == 1 {
return setMethod
}
return fmt.Sprintf("%s%s", setMethod, p.kindCamelName(i))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func setterName(typeName string) string {\n\treturn fmt.Sprintf(\"Set%s\", accessorName(typeName))\n}",
"func SetTypeName(tau TypeT, name string) int32 {\n\tcs := C.CString(name)\n\tdefer C.free(unsafe.Pointer(cs))\n\treturn int32(C.yices_set_type_name(C.type_t(tau), cs))\n}",
"func (fnSet) Name() string {\n\t... | [
"0.65256524",
"0.6065046",
"0.6001731",
"0.5926056",
"0.5860202",
"0.5847865",
"0.5822961",
"0.5807942",
"0.57485265",
"0.5700438",
"0.56349945",
"0.5561267",
"0.5530105",
"0.5492297",
"0.5476005",
"0.5416045",
"0.538494",
"0.53687495",
"0.53397745",
"0.53389347",
"0.5334416"... | 0.7526814 | 0 |
serializeFnName returns the identifier of the function that serializes the generated Go type into raw JSON. | func (p *PropertyGenerator) serializeFnName() string {
if p.asIterator {
return serializeIteratorMethod
}
return serializeMethod
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p *PropertyGenerator) deserializeFnName() string {\n\tif p.asIterator {\n\t\treturn fmt.Sprintf(\"%s%s\", deserializeIteratorMethod, p.Name.CamelName)\n\t}\n\treturn fmt.Sprintf(\"%s%sProperty\", deserializeMethod, p.Name.CamelName)\n}",
"func (s *Instruction) FuncName() string {\n\tif name, ok := protoNam... | [
"0.6530537",
"0.6170912",
"0.6116096",
"0.6036066",
"0.59973794",
"0.58882374",
"0.5860285",
"0.58490556",
"0.574213",
"0.5710654",
"0.56836104",
"0.5672176",
"0.56310594",
"0.5628329",
"0.5607548",
"0.55941474",
"0.5560768",
"0.5551219",
"0.5540836",
"0.55342555",
"0.5517717... | 0.7757559 | 0 |
kindCamelName returns an identifierfriendly name for the kind at the specified index. It will panic if 'i' is out of range. | func (p *PropertyGenerator) kindCamelName(i int) string {
return p.Kinds[i].Name.CamelName
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (af *filtBase) GetKindName() string {\n\treturn af.kind\n}",
"func (p *PropertyGenerator) getFnName(i int) string {\n\tif len(p.Kinds) == 1 {\n\t\treturn getMethod\n\t}\n\treturn fmt.Sprintf(\"%s%s\", getMethod, p.kindCamelName(i))\n}",
"func nthCounterName(n int) string { return fmt.Sprintf(\"C%02d\", n)... | [
"0.57681674",
"0.56236243",
"0.5410848",
"0.5390779",
"0.53520626",
"0.53333104",
"0.5279356",
"0.5263076",
"0.5213945",
"0.5213919",
"0.51842946",
"0.5176701",
"0.51377106",
"0.5112896",
"0.50678414",
"0.5041035",
"0.5003459",
"0.49665752",
"0.49522355",
"0.49473736",
"0.493... | 0.79529625 | 0 |
memberName returns the identifier to use for the kind at the specified index. It will panic if 'i' is out of range. | func (p *PropertyGenerator) memberName(i int) string {
return fmt.Sprintf("%sMember", p.Kinds[i].Name.LowerName)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (t *CompType) MemberIndex(name string) int {\n\tc_name := C.CString(name)\n\tdefer C.free(unsafe.Pointer(c_name))\n\treturn int(C.H5Tget_member_index(t.id, c_name))\n}",
"func (p *PropertyGenerator) hasMemberName(i int) string {\n\tif len(p.Kinds) == 1 && p.Kinds[0].Nilable {\n\t\tpanic(\"PropertyGenerator.... | [
"0.65057737",
"0.6310897",
"0.6043316",
"0.5811362",
"0.57661265",
"0.5664528",
"0.56453437",
"0.5569004",
"0.5540558",
"0.55238146",
"0.5518647",
"0.5392962",
"0.53348476",
"0.5334114",
"0.5310704",
"0.5276207",
"0.52741504",
"0.5220169",
"0.51843584",
"0.51594234",
"0.51041... | 0.7291041 | 0 |
hasMemberName returns the identifier to use for struct members that determine whether nonnilable types have been set. Panics if called for a Kind that is nilable. | func (p *PropertyGenerator) hasMemberName(i int) string {
if len(p.Kinds) == 1 && p.Kinds[0].Nilable {
panic("PropertyGenerator.hasMemberName called for nilable single value")
}
return fmt.Sprintf("has%sMember", p.Kinds[i].Name.CamelName)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func hasName(t Type) bool {\n\tswitch t.(type) {\n\tcase *Basic, *Named, *TypeParam:\n\t\treturn true\n\t}\n\treturn false\n}",
"func (o *Member) HasName() bool {\n\tif o != nil && o.Name != nil {\n\t\treturn true\n\t}\n\n\treturn false\n}",
"func (t *Link) HasUnknownName() (ok bool) {\n\treturn t.name != nil ... | [
"0.6148321",
"0.57391715",
"0.5466784",
"0.5413411",
"0.5382661",
"0.53526485",
"0.5340739",
"0.5338777",
"0.5309317",
"0.5301025",
"0.5301025",
"0.52994984",
"0.52854455",
"0.52655333",
"0.5247527",
"0.5239374",
"0.52214646",
"0.5211535",
"0.52038103",
"0.52034855",
"0.52006... | 0.7602432 | 0 |
clearMethodName returns the identifier to use for methods that clear all values from the property. | func (p *PropertyGenerator) clearMethodName() string {
if p.asIterator {
return iteratorClearMethod
}
return clearMethod
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (nmd *NetMethodDispatch) Clear() {\n\tnmd.sync.Lock()\n\tdefer nmd.sync.Unlock()\n\tnmd.m = make(map[interface{}]NetMethodFun)\n}",
"func ClearName(key string) string {\n\tif strings.Contains(key, \"(\") {\n\t\tkey = strings.Split(key, \"(\")[0]\n\t}\n\n\tkey = strings.Replace(key, \"-\", \" \", -1)\n\tkey ... | [
"0.5459611",
"0.52444017",
"0.51835364",
"0.51691246",
"0.50454235",
"0.4994905",
"0.4980902",
"0.49453282",
"0.49362674",
"0.49041834",
"0.48798367",
"0.4873958",
"0.4838719",
"0.47491616",
"0.47411805",
"0.47411805",
"0.47386295",
"0.4727244",
"0.47245976",
"0.47116664",
"0... | 0.7960542 | 0 |
commonMethods returns methods common to every property. | func (p *PropertyGenerator) commonMethods() []*codegen.Method {
return []*codegen.Method{
codegen.NewCommentedValueMethod(
p.packageName(),
nameMethod,
p.StructName(),
/*params=*/ nil,
[]jen.Code{jen.String()},
[]jen.Code{
jen.Return(
jen.Lit(p.PropertyName()),
),
},
jen.Commentf("%s returns the name of this property: %q.", nameMethod, p.PropertyName()),
),
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Methods() []string {\n\treturn []string{\n\t\t\"logLevel\",\n\t\t\"isDebug\",\n\t\t\"isOnce\",\n\t\t\"withScript\",\n\t\t\"configSource\",\n\t\t\"safeMode\",\n\t}\n}",
"func (c *Core) Methods() map[string]Metadata {\n\t_copy := make(map[string]Metadata)\n\tc.methods.Range(func(key, value interface{}) bool {... | [
"0.55080307",
"0.5477312",
"0.5344144",
"0.5331152",
"0.5182336",
"0.5116721",
"0.504159",
"0.5015999",
"0.501421",
"0.5002182",
"0.49919805",
"0.4979669",
"0.49786893",
"0.49444678",
"0.4941747",
"0.4933574",
"0.49183306",
"0.48967957",
"0.48759273",
"0.48689747",
"0.4833687... | 0.8032128 | 0 |
isMethodName returns the identifier to use for methods that determine if a property holds a specific Kind of value. | func (p *PropertyGenerator) isMethodName(i int) string {
return fmt.Sprintf("%s%s", isMethod, p.kindCamelName(i))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func MethodName(ctx context.Context) (string, bool) {\n\tname, ok := ctx.Value(MethodNameKey).(string)\n\treturn name, ok\n}",
"func (p *PropertyGenerator) hasMemberName(i int) string {\n\tif len(p.Kinds) == 1 && p.Kinds[0].Nilable {\n\t\tpanic(\"PropertyGenerator.hasMemberName called for nilable single value\")... | [
"0.63787496",
"0.5801562",
"0.57505494",
"0.5694409",
"0.54987735",
"0.5240616",
"0.52405995",
"0.516242",
"0.5138985",
"0.51147056",
"0.5100469",
"0.5066037",
"0.5008488",
"0.50017124",
"0.49543118",
"0.49518663",
"0.49440968",
"0.493926",
"0.49308324",
"0.49267986",
"0.4905... | 0.7992452 | 0 |
NewObserver creates an Observer. | func NewObserver() *Observer {
return &Observer{
close: make(chan interface{}),
events: make(chan Event),
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewObserver() Observer {\n\to := observerI{\n\t\tcontrol: NewControl(),\n\t\tstate: NewState(),\n\t}\n\treturn &o\n}",
"func newObserver() observerSubComponent {\n\treturn observerSubComponent{subscribed: make(chan struct{})}\n}",
"func newObserver() *observerManager {\n\treturn &observerManager{eventRe... | [
"0.7711109",
"0.75819886",
"0.75644934",
"0.7375693",
"0.73564756",
"0.73259735",
"0.6568613",
"0.6489884",
"0.5951068",
"0.5872103",
"0.57320786",
"0.5586143",
"0.5582653",
"0.54472643",
"0.54084337",
"0.5353951",
"0.5333283",
"0.5277642",
"0.5267369",
"0.5256169",
"0.520833... | 0.8069668 | 0 |
AddTracepoint adds a tracepoint to watch for. | func (o *Observer) AddTracepoint(name string) EventSource {
source := atomic.AddUint32(&o.nextEventSource, 1)
o.tracepoints = append(o.tracepoints, tracepointData{
source: EventSource(source),
tp: newTracepoint(name),
})
return EventSource(source)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (a *Adapter) AppendTracePoint(ctx context.Context, point string) context.Context {\n\n\tpath := ctx.Value(internal.TraceKey)\n\tif path == nil {\n\t\treturn context.WithValue(ctx, internal.TraceKey, point)\n\t}\n\n\treturn context.WithValue(ctx, internal.TraceKey, path.(string)+\">\"+point)\n}",
"func (trac... | [
"0.6792124",
"0.6600053",
"0.6467869",
"0.61718845",
"0.6105358",
"0.6105242",
"0.6003997",
"0.5800444",
"0.5792138",
"0.57220936",
"0.55519444",
"0.5463996",
"0.54356086",
"0.5391821",
"0.53791606",
"0.5247522",
"0.52444345",
"0.51920646",
"0.51866347",
"0.5098904",
"0.50886... | 0.75101924 | 0 |
Open finish initializing the observer. From then on, events can be received with ReadEvent(). | func (o *Observer) Open() error {
var err error
defer func() {
if err != nil {
o.Close()
}
}()
for _, data := range o.tracepoints {
tp := data.tp
source := data.source
if err = tp.open(); err != nil {
return err
}
o.wg.Add(1)
go func(tp *tracepoint, source EventSource) {
// TODO(damien): should we hide the implementation details into the
// tracepoint object and have it provide a channel?
for {
var nFds int
nFds, err = tp.perf.poll(-1)
if err != nil {
break
}
if nFds == 0 {
break
}
tp.perf.read(func(msg *perfEventSample, cpu int) {
event := &TracepointEvent{
baseEvent: baseEvent{
source: source,
},
tp: tp,
data: msg.DataCopy(),
}
o.events <- event
}, nil)
}
o.wg.Done()
}(tp, source)
}
return nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (ml *ManagedListener) Open() {\n\tif ml != nil {\n\t\tdefer trace.Tracer.ScopedTrace()()\n\t\tgo ml.Listening()\n\t\tgo ml.PipeMapHandler()\n\t\tml.SetExternalIP()\n\t}\n}",
"func (p *Session) OnOpen() {\n\tlevel.Debug(p.logger).Log(\"msg\", \"Session open\")\n\tp.open = true\n}",
"func (w *BaseWebsocketC... | [
"0.53760797",
"0.5362118",
"0.5345924",
"0.5270055",
"0.51369935",
"0.5100342",
"0.5030275",
"0.5008346",
"0.49783102",
"0.4963551",
"0.49593344",
"0.49556515",
"0.4924003",
"0.4921151",
"0.49051183",
"0.48950952",
"0.48911303",
"0.48776537",
"0.4828525",
"0.48275527",
"0.482... | 0.5445749 | 0 |
ReadEvent returns one event. This call blocks until an event is received. | func (o *Observer) ReadEvent() (Event, error) {
select {
case <-o.close:
return nil, nil
case event := <-o.events:
return event, nil
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (r *Replayer) ReadEvent() ([]byte, error) {\n\treturn nil, errors.New(\"implement me\")\n}",
"func (s *socket) readEvent() (ev *event, identity string, err error) {\n\tvar arr [][]byte\n\tfor {\n\t\tarr, err = s.sock.RecvMessageBytes(0)\n\t\tif err != nil {\n\t\t\tif IsIntr(err) {\n\t\t\t\tcontinue\n\t\t\t}... | [
"0.75224715",
"0.71742326",
"0.7055589",
"0.70353913",
"0.693923",
"0.65400624",
"0.6534028",
"0.64399385",
"0.64246523",
"0.64016706",
"0.63070196",
"0.6302457",
"0.6208788",
"0.60944873",
"0.6058736",
"0.60077566",
"0.5945246",
"0.59324604",
"0.5926525",
"0.59069055",
"0.59... | 0.79893905 | 0 |
Close frees precious resources acquired during Open. | func (o *Observer) Close() {
close(o.close)
for _, data := range o.tracepoints {
data.tp.close()
}
o.wg.Wait()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Close() {\n\tlog4go.Debug(\"resources destroy, pid:%v\", os.Getpid())\n\tfor name, r := range resources {\n\t\terr := r.Close()\n\t\tif err != nil {\n\t\t\tlog4go.Error(\"resources[%s] destroy failed:%s\", name, err.Error())\n\t\t} else {\n\t\t\tlog4go.Info(\"resources[%s] destroy finish\", name)\n\t\t}\n\t}\... | [
"0.70326054",
"0.69266677",
"0.688963",
"0.68719864",
"0.6869171",
"0.6841722",
"0.6823956",
"0.68207794",
"0.6757346",
"0.66874796",
"0.6682152",
"0.6643168",
"0.6635908",
"0.6625342",
"0.6621565",
"0.65806895",
"0.6564526",
"0.6550202",
"0.65330064",
"0.6532063",
"0.6505968... | 0.0 | -1 |
Handler is your Lambda function handler It uses Amazon API Gateway request/responses provided by the awslambdago/events package, However you could use other event sources (S3, Kinesis etc), or JSONdecoded primitive types such as 'string'. | func Handler(request events.APIGatewayProxyRequest) (events.APIGatewayProxyResponse, error) {
log.Printf("Processing Lambda request %s\n", request.RequestContext.RequestID)
r := &UpdateRecipeRequest{}
err := json.Unmarshal([]byte(request.Body), r)
if err != nil {
fmt.Printf("Could not parse body: %v.\n", request.Body)
return apigateway.ResponseUnsuccessful(400), err
}
user, err := apigateway.GetOrCreateAuthenticatedUser(context.TODO(), &request)
if err != nil {
return apigateway.ResponseUnsuccessful(401), errAuth
}
err = user.SetNickname(context.TODO(), r.Nickname)
if err != nil {
return apigateway.ResponseUnsuccessful(500), err
}
user, err = apigateway.GetOrCreateAuthenticatedUser(context.TODO(), &request)
if err != nil {
return apigateway.ResponseUnsuccessful(500), err
}
response := &User{
Nickname: user.Nickname,
}
resp := apigateway.ResponseSuccessful(response)
return resp, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Handler(request events.APIGatewayProxyRequest) (events.APIGatewayProxyResponse, error) {\n\n\tbodyEvent := MyEvent{}\n\n\t// Unmarshal the json, return 404 if error\n\terr := json.Unmarshal([]byte(request.Body), &bodyEvent)\n\tif err != nil {\n\t\tlog.Println(\"Failed run: \", err)\n\t\treturn events.APIGatew... | [
"0.766076",
"0.7161317",
"0.71571386",
"0.71170986",
"0.7070348",
"0.70669854",
"0.68084574",
"0.6743597",
"0.67253304",
"0.6682846",
"0.66808885",
"0.66783696",
"0.6599853",
"0.6586483",
"0.6562023",
"0.6460615",
"0.6458485",
"0.64516455",
"0.6448203",
"0.64179105",
"0.64151... | 0.62811965 | 24 |
GetBitmarkFullProvenance returns the provenance for a bitmark. | func (bc *BitmarkdRPCClient) GetBitmarkFullProvenance(bitmarkID string) (json.RawMessage, error) {
args := FullProvenanceArguments{Id: bitmarkID}
var reply json.RawMessage
err := bc.call("Bitmark.FullProvenance", &args, &reply)
return reply, err
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (B *block) GetProof() uint64{\n\treturn B.proof\n}",
"func CommitSetProvenance(tx *pachsql.Tx, id string) (_ []*pfs.Commit, retErr error) {\n\tq := `\n WITH RECURSIVE prov(from_id, to_id) AS (\n SELECT from_id, to_id\n FROM pfs.commit_provenance JOIN pfs.commits ON int_id = fr... | [
"0.52348286",
"0.51490366",
"0.5113172",
"0.4997171",
"0.4847204",
"0.47232407",
"0.4657581",
"0.46153545",
"0.45631856",
"0.45515525",
"0.4539305",
"0.44959685",
"0.44850057",
"0.44723567",
"0.44576582",
"0.44439232",
"0.44069716",
"0.43944812",
"0.43484256",
"0.4348069",
"0... | 0.8551878 | 0 |
NewServer create a new server from config. | func NewServer() *Server {
return &Server{
Config: Config{
Port: ":8080",
},
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func CreateServer(serverConfig ServerConfig) {\n\n}",
"func newServerConfig(fname, id, name, passWord, serverKey string) (err error) {\n\tconfig := Config{\n\t\tid,\n\t\tname,\n\t\t\"server\",\n\t\tpassWord,\n\t\tserverKey,\n\t\tDEFAULT_SERVER_URL,\n\t\tDEFAULT_PROCESS_USER,\n\t\tDEFAULT_PROCESS_LOCK,\n\t\tDEFAU... | [
"0.7811237",
"0.7764696",
"0.7535014",
"0.75244015",
"0.74420565",
"0.74216586",
"0.74212766",
"0.74102414",
"0.73964494",
"0.7378999",
"0.73770344",
"0.7368471",
"0.73329574",
"0.732273",
"0.72975177",
"0.7266847",
"0.7214578",
"0.72017103",
"0.7195584",
"0.71932244",
"0.716... | 0.671589 | 82 |
Serve starts listen http requests | func (g *Server) Serve() {
addr := g.Config.Port
fmt.Printf("======= Server start to listen (%s) and serve =======\n", addr)
router := api.Router()
if g.Config.GinMode != "" {
gin.SetMode(g.Config.GinMode)
}
router.Run(addr)
//router.Run("localhost:8081")
//fmt.Println(router.ListenAndServe("addr", nil))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func serve(app *app.CallMe) {\n\thandlers.Register(app)\n\n\tapp.Logger.Info(\n\t\t\"Ready to ListenIP\",\n\t\tzap.Int(\"ListenPort\", app.ListenPort),\n\t\tzap.String(\"IP\", app.ListenIP),\n\t)\n\n\tlistenOn := fmt.Sprintf(\"%s:%d\", app.ListenIP, app.ListenPort)\n\terr := http.ListenAndServe(listenOn, nil)\n\ti... | [
"0.75120056",
"0.7396767",
"0.7344083",
"0.7253987",
"0.7183266",
"0.7157515",
"0.71549964",
"0.71036255",
"0.7091944",
"0.7050944",
"0.70465475",
"0.7025634",
"0.6992546",
"0.69904816",
"0.6976752",
"0.69607323",
"0.69219106",
"0.6920594",
"0.69188297",
"0.69120854",
"0.6902... | 0.0 | -1 |
NewDataTierPhaseStatistics provides a builder for the DataTierPhaseStatistics struct. | func NewDataTierPhaseStatisticsBuilder() *DataTierPhaseStatisticsBuilder {
r := DataTierPhaseStatisticsBuilder{
&DataTierPhaseStatistics{},
}
return &r
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (rb *DataTierPhaseStatisticsBuilder) Build() DataTierPhaseStatistics {\n\treturn *rb.v\n}",
"func NewPhase(name string, message string) *Phase {\n\treturn &Phase{\n\t\tName: name,\n\t\tMessage: message,\n\t}\n}",
"func NewTeamSummary()(*TeamSummary) {\n m := &TeamSummary{\n }\n m.SetAdditional... | [
"0.57236797",
"0.45517826",
"0.4494954",
"0.43212146",
"0.4309284",
"0.428232",
"0.42726636",
"0.42556655",
"0.42099604",
"0.415489",
"0.41452116",
"0.41152003",
"0.40808597",
"0.402319",
"0.4019133",
"0.39678004",
"0.3950337",
"0.39278656",
"0.3925215",
"0.3925215",
"0.39166... | 0.76253456 | 0 |
Build finalize the chain and returns the DataTierPhaseStatistics struct | func (rb *DataTierPhaseStatisticsBuilder) Build() DataTierPhaseStatistics {
return *rb.v
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewDataTierPhaseStatisticsBuilder() *DataTierPhaseStatisticsBuilder {\n\tr := DataTierPhaseStatisticsBuilder{\n\t\t&DataTierPhaseStatistics{},\n\t}\n\n\treturn &r\n}",
"func (h *AuditLogHandler) FinalizeChain() {\n\th.mutex.Lock()\n\tdefer h.mutex.Unlock()\n\n\tsendServiceLogs()\n}",
"func (apd allProvide... | [
"0.51984656",
"0.45179856",
"0.44725284",
"0.43698466",
"0.43081263",
"0.42829627",
"0.42640367",
"0.42626828",
"0.4221998",
"0.41837263",
"0.41567776",
"0.4145062",
"0.41339555",
"0.41277158",
"0.41120148",
"0.41047356",
"0.40916216",
"0.40905172",
"0.40824333",
"0.4080839",
... | 0.6213985 | 0 |
Make sure that existing stream widgets are discarded if the user loads a new pcap. | func (t ManageCapinfoCache) OnNewSource(pcap.HandlerCode, gowid.IApp) {
clearCapinfoState()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func UnsetFrameCapture() {\n\tframeCapture = false\n}",
"func (display *WebDisplay) Dispose() {\n}",
"func (source *ipv6IpamSource) stop() {\n\tsource.sink = nil\n}",
"func discard(link rtuLink) {\n\tvar rxbuf\t= make([]byte, 1024)\n\n\tlink.SetDeadline(time.Now().Add(time.Millisecond))\n\tlink.Read(rxbuf)\n... | [
"0.4875311",
"0.4577949",
"0.45520076",
"0.45394555",
"0.451178",
"0.4460268",
"0.4458511",
"0.4397703",
"0.4373493",
"0.4372276",
"0.4339298",
"0.432843",
"0.42901286",
"0.42819107",
"0.42766505",
"0.425816",
"0.42542195",
"0.42340013",
"0.4219898",
"0.42111307",
"0.42110485... | 0.47030228 | 1 |
Setup establishes connection to the origin Postgres server. | func (s *Server) Setup() error {
if s.Logger == nil {
s.Logger = log.New(os.Stderr, "", log.LstdFlags)
}
s.Printf("Connecting to origin at %s...", s.OriginHost)
origin, err := connect.Connect(s.OriginHost)
if err != nil {
s.Fatalf("Failed to connect to origin '%s': %v", s.OriginHost, err)
}
opts := map[string]string{}
startupMsg := protocol.CreateStartupMessage(s.OriginUsername, s.OriginDatabase, opts)
origin.Write(startupMsg)
response := make([]byte, 4096)
if _, err = origin.Read(response); err != nil {
return fmt.Errorf("error connecting to '%s': %v", s.OriginHost, err)
}
if authd := connect.HandleAuthenticationRequest(origin, response); !authd {
return fmt.Errorf("Origin authentication failed")
}
s.Printf("Successfully connected to origin '%s'", s.OriginHost)
s.originPool = make(Pool, 20)
s.originPool.Add(origin)
return nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Setup(\n\tuser, password, host, dbname string,\n) (\n\tret PostgresProvider, err error,\n) {\n\tret = PostgresProvider{\n\t\tHost: host,\n\t\tUser: user,\n\t\tPassword: password,\n\t\tDBName: dbname,\n\t}\n\tlog.Println(\"Logging into\", dbname)\n\tdb1, err := sql.Open(\n\t\t\"postgres\",\n\t\t//\"p... | [
"0.69815296",
"0.6885746",
"0.6795049",
"0.6725712",
"0.67107564",
"0.66614467",
"0.6627048",
"0.6595209",
"0.6581932",
"0.64448744",
"0.6395758",
"0.6352034",
"0.6335457",
"0.62626743",
"0.6261324",
"0.6251626",
"0.62340814",
"0.62294436",
"0.6219777",
"0.62196755",
"0.62103... | 0.60257894 | 31 |
Start begins listening for client connections and proxies them to the Origin. | func (s *Server) Start(stopCh <-chan struct{}) (err error) {
s.Print("Starting server...")
s.lis, err = net.Listen("tcp", s.ServerHost)
if err != nil {
return err
}
s.Printf("Listening on %s", s.ServerHost)
for {
select {
case <-stopCh:
break
default:
conn, err := s.lis.Accept()
if err != nil {
return err
}
if conn != nil {
go s.HandleConnection(conn)
}
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s *Server) Start() {\n\tvar err error\n\ts.listener, err = net.Listen(\"tcp\", s.addr)\n\tif err != nil {\n\t\tservLogger.Fatal(err)\n\t}\n\n if s.credential != \"\" {\n servLogger.Infof(\"use %s for auth\\n\", s.credential)\n }\n\tservLogger.Infof(\"proxy listen in %s, waiting for connection...... | [
"0.75999963",
"0.75512546",
"0.7463912",
"0.7431335",
"0.7222038",
"0.720096",
"0.6901696",
"0.68746305",
"0.6860362",
"0.683905",
"0.68183726",
"0.6795194",
"0.67091537",
"0.6708329",
"0.67044413",
"0.67020655",
"0.6701726",
"0.670116",
"0.6652177",
"0.660221",
"0.6591193",
... | 0.59322196 | 98 |
NewPlanner returns a new instance of Planner. | func NewPlanner(db DB) *Planner {
return &Planner{
DB: db,
Now: time.Now,
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewPlanner() Planner {\n\treturn &simplePlanner{}\n}",
"func NewPlanner(ctx *Context) *PlannerDefault {\n\tp := &PlannerDefault{\n\t\tCtx: ctx,\n\t\tchildren: make([]Task, 0),\n\t}\n\tp.Planner = p\n\treturn p\n}",
"func NewPlanner()(*Planner) {\n m := &Planner{\n Entity: *NewEntity(),\n ... | [
"0.8373297",
"0.78956974",
"0.7884329",
"0.76004404",
"0.74583673",
"0.6844997",
"0.68093985",
"0.66071105",
"0.6360136",
"0.63401043",
"0.63401043",
"0.61766195",
"0.6119623",
"0.6067652",
"0.59924793",
"0.593622",
"0.5857521",
"0.5767704",
"0.57149994",
"0.5667879",
"0.5596... | 0.8417653 | 0 |
normalizeDimensions extacts the time interval, if specified. Returns all remaining dimensions. | func (p *Planner) normalizeDimensions(dimensions Dimensions) (time.Duration, []string, error) {
// Ignore if there are no dimensions.
if len(dimensions) == 0 {
return 0, nil, nil
}
// If the first dimension is a "time(duration)" then extract the duration.
if call, ok := dimensions[0].Expr.(*Call); ok && strings.ToLower(call.Name) == "time" {
// Make sure there is exactly one argument.
if len(call.Args) != 1 {
return 0, nil, errors.New("time dimension expected one argument")
}
// Ensure the argument is a duration.
lit, ok := call.Args[0].(*DurationLiteral)
if !ok {
return 0, nil, errors.New("time dimension must have one duration argument")
}
return lit.Val, dimensionKeys(dimensions[1:]), nil
}
return 0, dimensionKeys(dimensions), nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func normalizeCloudWatchAlarmDimensions(alarmDimensions *cloudformation.CloudWatchAlarmDimensionList) *cloudformation.CloudWatchAlarmDimensionList {\n\tif alarmDimensions == nil || len(*alarmDimensions) == 0 {\n\t\treturn &cloudformation.CloudWatchAlarmDimensionList{\n\t\t\t{\n\t\t\t\tName: cloudformation.String(... | [
"0.5863255",
"0.5593285",
"0.5458185",
"0.4924116",
"0.48919064",
"0.48581466",
"0.48396584",
"0.478796",
"0.4781289",
"0.47482437",
"0.47061297",
"0.4702259",
"0.46973515",
"0.4674829",
"0.4665495",
"0.46614796",
"0.46198478",
"0.45599985",
"0.4545783",
"0.4512009",
"0.44849... | 0.7111008 | 0 |
planField returns a processor for field. | func (p *Planner) planField(e *Executor, f *Field) (processor, error) {
return p.planExpr(e, f.Expr)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {\n\t// Ensure there is a single argument.\n\tif len(c.Args) != 1 {\n\t\treturn nil, fmt.Errorf(\"expected one argument for %s()\", c.Name)\n\t}\n\n\t// Ensure the argument is a variable reference.\n\tref, ok := c.Args[0].(*VarRef)\n\tif !ok {\n\t... | [
"0.5850106",
"0.5793708",
"0.56735563",
"0.55634314",
"0.5539706",
"0.55268276",
"0.5526053",
"0.54968065",
"0.54968065",
"0.54968065",
"0.5472559",
"0.5347481",
"0.5298575",
"0.5290777",
"0.5278102",
"0.52667516",
"0.5232726",
"0.52285284",
"0.52179766",
"0.5164068",
"0.5136... | 0.7988916 | 0 |
planExpr returns a processor for an expression. | func (p *Planner) planExpr(e *Executor, expr Expr) (processor, error) {
switch expr := expr.(type) {
case *VarRef:
panic("TODO")
case *Call:
return p.planCall(e, expr)
case *BinaryExpr:
return p.planBinaryExpr(e, expr)
case *ParenExpr:
return p.planExpr(e, expr.Expr)
case *NumberLiteral:
return newLiteralProcessor(expr.Val), nil
case *StringLiteral:
return newLiteralProcessor(expr.Val), nil
case *BooleanLiteral:
return newLiteralProcessor(expr.Val), nil
case *TimeLiteral:
return newLiteralProcessor(expr.Val), nil
case *DurationLiteral:
return newLiteralProcessor(expr.Val), nil
}
panic("unreachable")
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p *ExecutionPlanner) compileExpr(expr parser.Expr) (_ types.PlanExpression, err error) {\n\tif expr == nil {\n\t\treturn nil, nil\n\t}\n\n\tswitch expr := expr.(type) {\n\tcase *parser.BinaryExpr:\n\t\treturn p.compileBinaryExpr(expr)\n\n\tcase *parser.BoolLit:\n\t\treturn newBoolLiteralPlanExpression(expr.V... | [
"0.6671298",
"0.63801324",
"0.56326646",
"0.5561662",
"0.5532963",
"0.5225251",
"0.52004224",
"0.51350623",
"0.51319087",
"0.50917375",
"0.5091232",
"0.5029617",
"0.49621376",
"0.49549094",
"0.49485353",
"0.49356198",
"0.49250898",
"0.49079174",
"0.49051112",
"0.48947218",
"0... | 0.79593897 | 0 |
planCall generates a processor for a function call. | func (p *Planner) planCall(e *Executor, c *Call) (processor, error) {
// Ensure there is a single argument.
if len(c.Args) != 1 {
return nil, fmt.Errorf("expected one argument for %s()", c.Name)
}
// Ensure the argument is a variable reference.
ref, ok := c.Args[0].(*VarRef)
if !ok {
return nil, fmt.Errorf("expected field argument in %s()", c.Name)
}
// Extract the substatement for the call.
sub, err := e.stmt.Substatement(ref)
if err != nil {
return nil, err
}
name := sub.Source.(*Measurement).Name
// Extract tags from conditional.
tags := make(map[string]string)
condition, err := p.extractTags(name, sub.Condition, tags)
if err != nil {
return nil, err
}
sub.Condition = condition
// Find field.
fname := strings.TrimPrefix(ref.Val, name+".")
fieldID, typ := e.db.Field(name, fname)
if fieldID == 0 {
return nil, fmt.Errorf("field not found: %s.%s", name, fname)
}
// Generate a reducer for the given function.
r := newReducer(e)
r.stmt = sub
// Retrieve a list of series data ids.
seriesIDs := p.DB.MatchSeries(name, tags)
// Generate mappers for each id.
r.mappers = make([]*mapper, len(seriesIDs))
for i, seriesID := range seriesIDs {
m := newMapper(e, seriesID, fieldID, typ)
m.min, m.max = e.min.UnixNano(), e.max.UnixNano()
m.interval = int64(e.interval)
m.key = append(make([]byte, 8), marshalStrings(p.DB.SeriesTagValues(seriesID, e.tags))...)
r.mappers[i] = m
}
// Set the appropriate reducer function.
switch strings.ToLower(c.Name) {
case "count":
r.fn = reduceSum
for _, m := range r.mappers {
m.fn = mapCount
}
case "sum":
r.fn = reduceSum
for _, m := range r.mappers {
m.fn = mapSum
}
default:
return nil, fmt.Errorf("function not found: %q", c.Name)
}
return r, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (t *TimeLine) Plan(nbars, num, denom uint32, callback func(delta int32)) {\n\t/*\n\t 1. calc the abs position for the callback by using forward\n\t 2. rewind cursor\n\t 3. register callback\n\t 4. sort planned callbacks\n\t*/\n\n\tsavedCursor := t.cursor\n\tt.forwardIgnoringCallbacks(nbars, num, denom... | [
"0.5957647",
"0.5939454",
"0.5878916",
"0.5844865",
"0.578538",
"0.5709484",
"0.5678076",
"0.55843925",
"0.5496034",
"0.5492764",
"0.54183",
"0.5409136",
"0.5385073",
"0.53798765",
"0.5378616",
"0.53784394",
"0.5343292",
"0.5333596",
"0.5331891",
"0.5302641",
"0.5196999",
"... | 0.769013 | 0 |
planBinaryExpr generates a processor for a binary expression. A binary expression represents a join operator between two processors. | func (p *Planner) planBinaryExpr(e *Executor, expr *BinaryExpr) (processor, error) {
// Create processor for LHS.
lhs, err := p.planExpr(e, expr.LHS)
if err != nil {
return nil, fmt.Errorf("lhs: %s", err)
}
// Create processor for RHS.
rhs, err := p.planExpr(e, expr.RHS)
if err != nil {
return nil, fmt.Errorf("rhs: %s", err)
}
// Combine processors.
return newBinaryExprEvaluator(e, expr.Op, lhs, rhs), nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func newBinaryExprEvaluator(e *Executor, op Token, lhs, rhs processor) *binaryExprEvaluator {\n\treturn &binaryExprEvaluator{\n\t\texecutor: e,\n\t\top: op,\n\t\tlhs: lhs,\n\t\trhs: rhs,\n\t\tc: make(chan map[string]interface{}, 0),\n\t\tdone: make(chan chan struct{}, 0),\n\t}\n}",
"fu... | [
"0.66887915",
"0.62147105",
"0.61825645",
"0.5908567",
"0.58572567",
"0.5844639",
"0.5791973",
"0.57730836",
"0.57260466",
"0.56870455",
"0.5641738",
"0.5616734",
"0.55070674",
"0.5478003",
"0.54041564",
"0.53786176",
"0.5364959",
"0.52595145",
"0.5206847",
"0.51054",
"0.5102... | 0.79556304 | 0 |
extractTags extracts a tag key/value map from a statement. Extracted tags are removed from the statement. | func (p *Planner) extractTags(name string, expr Expr, tags map[string]string) (Expr, error) {
// TODO: Refactor into a walk-like Replace().
switch expr := expr.(type) {
case *BinaryExpr:
// If the LHS is a variable ref then check for tag equality.
if lhs, ok := expr.LHS.(*VarRef); ok && expr.Op == EQ {
return p.extractBinaryExprTags(name, expr, lhs, expr.RHS, tags)
}
// If the RHS is a variable ref then check for tag equality.
if rhs, ok := expr.RHS.(*VarRef); ok && expr.Op == EQ {
return p.extractBinaryExprTags(name, expr, rhs, expr.LHS, tags)
}
// Recursively process LHS.
lhs, err := p.extractTags(name, expr.LHS, tags)
if err != nil {
return nil, err
}
expr.LHS = lhs
// Recursively process RHS.
rhs, err := p.extractTags(name, expr.RHS, tags)
if err != nil {
return nil, err
}
expr.RHS = rhs
return expr, nil
case *ParenExpr:
e, err := p.extractTags(name, expr.Expr, tags)
if err != nil {
return nil, err
}
expr.Expr = e
return expr, nil
default:
return expr, nil
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Extract(ctx context.Context) *Tags {\n\tt, ok := ctx.Value(ctxMarkerKey).(*Tags)\n\tif !ok {\n\t\treturn &Tags{values: make(map[string]interface{})}\n\t}\n\n\treturn t\n}",
"func (r serverResult) ExtractTags() ([]string, error) {\n\tvar s struct {\n\t\tTags []string `json:\"tags\"`\n\t}\n\terr := r.ExtractI... | [
"0.60839343",
"0.5574362",
"0.54821146",
"0.54010403",
"0.5383956",
"0.52683496",
"0.5214607",
"0.51167417",
"0.50469804",
"0.5004287",
"0.4941273",
"0.49274534",
"0.49254033",
"0.4903882",
"0.48592663",
"0.48080933",
"0.47623283",
"0.47225463",
"0.4713999",
"0.47138765",
"0.... | 0.60490483 | 1 |
extractBinaryExprTags extracts a tag key/value map from a statement. | func (p *Planner) extractBinaryExprTags(name string, expr Expr, ref *VarRef, value Expr, tags map[string]string) (Expr, error) {
// Ignore if the value is not a string literal.
lit, ok := value.(*StringLiteral)
if !ok {
return expr, nil
}
// Extract the key and remove the measurement prefix.
key := strings.TrimPrefix(ref.Val, name+".")
// If tag is already filtered then return error.
if _, ok := tags[key]; ok {
return nil, fmt.Errorf("duplicate tag filter: %s.%s", name, key)
}
// Add tag to the filter.
tags[key] = lit.Val
// Return nil to remove the expression.
return nil, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (p *Planner) extractTags(name string, expr Expr, tags map[string]string) (Expr, error) {\n\t// TODO: Refactor into a walk-like Replace().\n\tswitch expr := expr.(type) {\n\tcase *BinaryExpr:\n\t\t// If the LHS is a variable ref then check for tag equality.\n\t\tif lhs, ok := expr.LHS.(*VarRef); ok && expr.Op ... | [
"0.51212686",
"0.47047538",
"0.46467358",
"0.4614326",
"0.4610041",
"0.45031175",
"0.4482802",
"0.44662812",
"0.44048113",
"0.44041216",
"0.43895322",
"0.4388696",
"0.4372503",
"0.4370029",
"0.4338746",
"0.43042067",
"0.42618737",
"0.42575216",
"0.425162",
"0.42440602",
"0.42... | 0.77033806 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.