FM / snap

/var/www/qr4y.kz/server/delivery/node_modules/@firebase/database/dist/src/core/snap/

/var/www/qr4y.kz/server/delivery/node_modules/@firebase/database/dist/src/core/snap

Name	Size	Mode	Actions
indexes/	-	0755	rm
ChildrenNode.d.ts	4421	0644	edit dl rm
childSet.d.ts	1446	0644	edit dl rm
comparators.d.ts	827	0644	edit dl rm
IndexMap.d.ts	1702	0644	edit dl rm
LeafNode.d.ts	3089	0644	edit dl rm
Node.d.ts	4600	0644	edit dl rm
nodeFromJSON.d.ts	995	0644	edit dl rm
snap.d.ts	924	0644	edit dl rm

Edit: /var/www/qr4y.kz/server/delivery/node_modules/@firebase/database/dist/src/core/snap/childSet.d.ts (1446B)

/**
 * @license
 * Copyright 2017 Google LLC
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
import { SortedMap } from '../util/SortedMap';
import { NamedNode } from './Node';
/**
 * Takes a list of child nodes and constructs a SortedSet using the given comparison
 * function
 *
 * Uses the algorithm described in the paper linked here:
 * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458
 *
 * @param childList - Unsorted list of children
 * @param cmp - The comparison method to be used
 * @param keyFn - An optional function to extract K from a node wrapper, if K's
 * type is not NamedNode
 * @param mapSortFn - An optional override for comparator used by the generated sorted map
 */
export declare const buildChildSet: <K, V>(childList: NamedNode[], cmp: (a: NamedNode, b: NamedNode) => number, keyFn?: (a: NamedNode) => K, mapSortFn?: (a: K, b: K) => number) => SortedMap<K, V>;

/** * @license * Copyright 2017 Google LLC * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ import { SortedMap } from '../util/SortedMap'; import { NamedNode } from './Node'; /** * Takes a list of child nodes and constructs a SortedSet using the given comparison * function * * Uses the algorithm described in the paper linked here: * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458 * * @param childList - Unsorted list of children * @param cmp - The comparison method to be used * @param keyFn - An optional function to extract K from a node wrapper, if K's * type is not NamedNode * @param mapSortFn - An optional override for comparator used by the generated sorted map */ export declare const buildChildSet: (childList: NamedNode[], cmp: (a: NamedNode, b: NamedNode) => number, keyFn?: (a: NamedNode) => K, mapSortFn?: (a: K, b: K) => number) => SortedMap;