Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for CloneNode (0.2 sec)

  1. tensorflow/compiler/jit/clone_constants_for_better_clustering.cc

                                      Node* n);
      string GenerateUniqueName(const absl::flat_hash_set<string>& name_set,
                                absl::string_view prefix);
      absl::StatusOr<Node*> CloneNode(const absl::flat_hash_set<string>& name_set,
                                      Node* n);
    
      Graph* graph_;
      int unique_name_counter_;
    };
    
    string CloneConstantsForBetterClusteringPassImpl::GenerateUniqueName(
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  2. src/test/java/org/codelibs/fess/crawler/transformer/FessXpathTransformerTest.java

                }
            });
            final FessXpathTransformer transformer = new FessXpathTransformer();
            transformer.init();
    
            final Node pruneNode = transformer.pruneNode(document.cloneNode(true), null);
            assertEquals(getXmlString(document), getXmlString(pruneNode));
            ComponentUtil.setFessConfig(null);
        }
    
        public void test_pruneNode_removeNoScript() throws Exception {
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 38.6K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/crawler/transformer/FessXpathTransformer.java

                for (int i = 0; i < list.size(); i++) {
                    if (buf == null) {
                        buf = new StringBuilder(1000);
                    }
                    Node node = list.get(i).cloneNode(true);
                    if (useGoogleOffOn) {
                        node = processGoogleOffOn(node, new ValueHolder<>(true));
                    }
                    node = pruneFunc.apply(node);
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 41.9K bytes
    - Viewed (0)
  4. src/internal/trace/traceviewer/static/webcomponents.min.js

    =e.getTreeScope,j=e.isWrapper,D=e.mixin,H=e.registerTransientObservers,x=e.registerWrapper,R=e.setTreeScope,I=e.unsafeUnwrap,P=e.unwrap,k=e.unwrapIfNeeded,A=e.wrap,W=e.wrapIfNeeded,F=e.wrappers,U=!1,q=document.importNode,B=window.Node.prototype.cloneNode,V=window.Node,G=window.DocumentFragment,z=(V.prototype.appendChild,V.prototype.compareDocumentPosition),K=V.prototype.isEqualNode,$=V.prototype.insertBefore,X=V.prototype.removeChild,Y=V.prototype.replaceChild,Z=/Trident|Edge/.test(navigator.use...
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 20:45:06 UTC 2023
    - 115.6K bytes
    - Viewed (0)
  5. platforms/software/dependency-management/src/main/resources/org/gradle/api/internal/artifacts/ivyservice/ivyresolve/verification/report/uikit.min.js

    n&&t.$reset()})})}},extends:Nn,args:"icon",props:["icon"],data:{include:["focusable"]},isIcon:!0,beforeConnect:function(){ze(this.$el,"uk-icon")},methods:{getSvg:function(){var t,e=function(t){if(!Hn[t])return null;On[t]||(On[t]=Ce(Hn[t].trim()));return On[t].cloneNode(!0)}((t=this.icon,ct?X(X(t,"left","right"),"previous","next"):t));return e?se.resolve(e):se.reject("Icon not found.")}}},Fn={args:!1,extends:Ln,data:function(t){return{icon:d(t.constructor.options.name)}},beforeConnect:function(){ze(this.$el,thi...
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Tue Oct 10 21:10:11 UTC 2023
    - 130.5K bytes
    - Viewed (0)
  6. src/internal/trace/traceviewer/static/trace_viewer_full.html

    var nativeCloneNode=Element.prototype.cloneNode;var nativeImportNode=Document.prototype.importNode;Polymer.Base.mixin(DomApi.prototype,{_lazyDistribute:function(host){if(host.shadyRoot&&host.shadyRoot._distributionClean){host.shadyRoot._distributionClean=false;Polymer.dom.addDebouncer(host.de...
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 20:45:06 UTC 2023
    - 2.5M bytes
    - Viewed (1)
Back to top