|
|
|
|
@@ -76,7 +76,8 @@ function findRoutesAndCreateOptimalPath(
|
|
|
|
|
opts: PathPenaltyOpts,
|
|
|
|
|
fees: FeeSchedule,
|
|
|
|
|
neonRouterNumSamples: number,
|
|
|
|
|
): Path | undefined {
|
|
|
|
|
vipSourcesSet: Set<ERC20BridgeSource>,
|
|
|
|
|
): { allSourcesPath: Path | undefined; vipSourcesPath: Path | undefined } | undefined {
|
|
|
|
|
// Currently the rust router is unable to handle 1 base unit sized quotes and will error out
|
|
|
|
|
// To avoid flooding the logs with these errors we just return an insufficient liquidity error
|
|
|
|
|
// which is how the JS router handles these quotes today
|
|
|
|
|
@@ -94,146 +95,23 @@ function findRoutesAndCreateOptimalPath(
|
|
|
|
|
return fills[0];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const samplesAndNativeOrdersWithResults: Array<DexSample[] | NativeOrderWithFillableAmounts[]> = [];
|
|
|
|
|
const serializedPaths: SerializedPath[] = [];
|
|
|
|
|
const sampleSourcePathIds: string[] = [];
|
|
|
|
|
for (const singleSourceSamples of samples) {
|
|
|
|
|
if (singleSourceSamples.length === 0) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const sourcePathId = hexUtils.random();
|
|
|
|
|
const singleSourceSamplesWithOutput = [...singleSourceSamples];
|
|
|
|
|
for (let i = singleSourceSamples.length - 1; i >= 0; i--) {
|
|
|
|
|
if (singleSourceSamples[i].output.isZero()) {
|
|
|
|
|
// Remove trailing 0 output samples
|
|
|
|
|
singleSourceSamplesWithOutput.pop();
|
|
|
|
|
} else {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (singleSourceSamplesWithOutput.length < MIN_NUM_SAMPLE_INPUTS) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// TODO(kimpers): Do we need to handle 0 entries, from eg Kyber?
|
|
|
|
|
const serializedPath = singleSourceSamplesWithOutput.reduce<SerializedPath>(
|
|
|
|
|
(memo, sample, sampleIdx) => {
|
|
|
|
|
memo.ids.push(`${sample.source}-${serializedPaths.length}-${sampleIdx}`);
|
|
|
|
|
memo.inputs.push(sample.input.integerValue().toNumber());
|
|
|
|
|
memo.outputs.push(sample.output.integerValue().toNumber());
|
|
|
|
|
memo.outputFees.push(
|
|
|
|
|
calculateOuputFee(side, sample, opts.outputAmountPerEth, opts.inputAmountPerEth, fees)
|
|
|
|
|
.integerValue()
|
|
|
|
|
.toNumber(),
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
return memo;
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
ids: [],
|
|
|
|
|
inputs: [],
|
|
|
|
|
outputs: [],
|
|
|
|
|
outputFees: [],
|
|
|
|
|
},
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
samplesAndNativeOrdersWithResults.push(singleSourceSamplesWithOutput);
|
|
|
|
|
serializedPaths.push(serializedPath);
|
|
|
|
|
sampleSourcePathIds.push(sourcePathId);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const nativeOrdersourcePathId = hexUtils.random();
|
|
|
|
|
for (const [idx, nativeOrder] of nativeOrders.entries()) {
|
|
|
|
|
const { input: normalizedOrderInput, output: normalizedOrderOutput } = nativeOrderToNormalizedAmounts(
|
|
|
|
|
side,
|
|
|
|
|
nativeOrder,
|
|
|
|
|
);
|
|
|
|
|
// NOTE: skip dummy order created in swap_quoter
|
|
|
|
|
// TODO: remove dummy order and this logic once we don't need the JS router
|
|
|
|
|
if (normalizedOrderInput.isLessThanOrEqualTo(0) || normalizedOrderOutput.isLessThanOrEqualTo(0)) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
const fee = calculateOuputFee(side, nativeOrder, opts.outputAmountPerEth, opts.inputAmountPerEth, fees)
|
|
|
|
|
.integerValue()
|
|
|
|
|
.toNumber();
|
|
|
|
|
|
|
|
|
|
// HACK: due to an issue with the Rust router interpolation we need to create exactly 13 samples from the native order
|
|
|
|
|
const ids = [];
|
|
|
|
|
const inputs = [];
|
|
|
|
|
const outputs = [];
|
|
|
|
|
const outputFees = [];
|
|
|
|
|
|
|
|
|
|
// NOTE: Limit orders can be both larger or smaller than the input amount
|
|
|
|
|
// If the order is larger than the input we can scale the order to the size of
|
|
|
|
|
// the quote input (order pricing is constant) and then create 13 "samples" up to
|
|
|
|
|
// and including the full quote input amount.
|
|
|
|
|
// If the order is smaller we don't need to scale anything, we will just end up
|
|
|
|
|
// with trailing duplicate samples for the order input as we cannot go higher
|
|
|
|
|
const scaleToInput = BigNumber.min(input.dividedBy(normalizedOrderInput), 1);
|
|
|
|
|
for (let i = 1; i <= 13; i++) {
|
|
|
|
|
const fraction = i / 13;
|
|
|
|
|
const currentInput = BigNumber.min(
|
|
|
|
|
normalizedOrderInput.times(scaleToInput).times(fraction),
|
|
|
|
|
normalizedOrderInput,
|
|
|
|
|
);
|
|
|
|
|
const currentOutput = BigNumber.min(
|
|
|
|
|
normalizedOrderOutput.times(scaleToInput).times(fraction),
|
|
|
|
|
normalizedOrderOutput,
|
|
|
|
|
);
|
|
|
|
|
const id = `${ERC20BridgeSource.Native}-${serializedPaths.length}-${idx}-${i}`;
|
|
|
|
|
inputs.push(currentInput.integerValue().toNumber());
|
|
|
|
|
outputs.push(currentOutput.integerValue().toNumber());
|
|
|
|
|
outputFees.push(fee);
|
|
|
|
|
ids.push(id);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const serializedPath: SerializedPath = {
|
|
|
|
|
ids,
|
|
|
|
|
inputs,
|
|
|
|
|
outputs,
|
|
|
|
|
outputFees,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
samplesAndNativeOrdersWithResults.push([nativeOrder]);
|
|
|
|
|
serializedPaths.push(serializedPath);
|
|
|
|
|
sampleSourcePathIds.push(nativeOrdersourcePathId);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (serializedPaths.length === 0) {
|
|
|
|
|
return undefined;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const rustArgs: OptimizerCapture = {
|
|
|
|
|
side,
|
|
|
|
|
targetInput: input.toNumber(),
|
|
|
|
|
pathsIn: serializedPaths,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const allSourcesRustRoute = new Float64Array(rustArgs.pathsIn.length);
|
|
|
|
|
const strategySourcesOutputAmounts = new Float64Array(rustArgs.pathsIn.length);
|
|
|
|
|
route(rustArgs, allSourcesRustRoute, strategySourcesOutputAmounts, neonRouterNumSamples);
|
|
|
|
|
assert.assert(
|
|
|
|
|
rustArgs.pathsIn.length === allSourcesRustRoute.length,
|
|
|
|
|
'different number of sources in the Router output than the input',
|
|
|
|
|
);
|
|
|
|
|
assert.assert(
|
|
|
|
|
rustArgs.pathsIn.length === strategySourcesOutputAmounts.length,
|
|
|
|
|
'different number of sources in the Router output amounts results than the input',
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
const createPathFromStrategy = (sourcesRustRoute: Float64Array, sourcesOutputAmounts: Float64Array) => {
|
|
|
|
|
const routesAndSamplesAndOutputs = _.zip(
|
|
|
|
|
allSourcesRustRoute,
|
|
|
|
|
sourcesRustRoute,
|
|
|
|
|
samplesAndNativeOrdersWithResults,
|
|
|
|
|
strategySourcesOutputAmounts,
|
|
|
|
|
sourcesOutputAmounts,
|
|
|
|
|
sampleSourcePathIds,
|
|
|
|
|
);
|
|
|
|
|
const adjustedFills: Fill[] = [];
|
|
|
|
|
const totalRoutedAmount = BigNumber.sum(...allSourcesRustRoute);
|
|
|
|
|
const totalRoutedAmount = BigNumber.sum(...sourcesRustRoute);
|
|
|
|
|
|
|
|
|
|
const scale = input.dividedBy(totalRoutedAmount);
|
|
|
|
|
for (const [routeInput, routeSamplesAndNativeOrders, outputAmount, sourcePathId] of routesAndSamplesAndOutputs) {
|
|
|
|
|
for (const [
|
|
|
|
|
routeInput,
|
|
|
|
|
routeSamplesAndNativeOrders,
|
|
|
|
|
outputAmount,
|
|
|
|
|
sourcePathId,
|
|
|
|
|
] of routesAndSamplesAndOutputs) {
|
|
|
|
|
if (!Number.isFinite(outputAmount)) {
|
|
|
|
|
DEFAULT_WARNING_LOGGER(rustArgs, `neon-router: invalid route outputAmount ${outputAmount}`);
|
|
|
|
|
return undefined;
|
|
|
|
|
@@ -336,6 +214,164 @@ function findRoutesAndCreateOptimalPath(
|
|
|
|
|
const pathFromRustInputs = Path.create(side, adjustedFills, input, opts);
|
|
|
|
|
|
|
|
|
|
return pathFromRustInputs;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const samplesAndNativeOrdersWithResults: Array<DexSample[] | NativeOrderWithFillableAmounts[]> = [];
|
|
|
|
|
const serializedPaths: SerializedPath[] = [];
|
|
|
|
|
const sampleSourcePathIds: string[] = [];
|
|
|
|
|
for (const singleSourceSamples of samples) {
|
|
|
|
|
if (singleSourceSamples.length === 0) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const sourcePathId = hexUtils.random();
|
|
|
|
|
const singleSourceSamplesWithOutput = [...singleSourceSamples];
|
|
|
|
|
for (let i = singleSourceSamples.length - 1; i >= 0; i--) {
|
|
|
|
|
if (singleSourceSamples[i].output.isZero()) {
|
|
|
|
|
// Remove trailing 0 output samples
|
|
|
|
|
singleSourceSamplesWithOutput.pop();
|
|
|
|
|
} else {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (singleSourceSamplesWithOutput.length < MIN_NUM_SAMPLE_INPUTS) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// TODO(kimpers): Do we need to handle 0 entries, from eg Kyber?
|
|
|
|
|
const serializedPath = singleSourceSamplesWithOutput.reduce<SerializedPath>(
|
|
|
|
|
(memo, sample, sampleIdx) => {
|
|
|
|
|
memo.ids.push(`${sample.source}-${serializedPaths.length}-${sampleIdx}`);
|
|
|
|
|
memo.inputs.push(sample.input.integerValue().toNumber());
|
|
|
|
|
memo.outputs.push(sample.output.integerValue().toNumber());
|
|
|
|
|
memo.outputFees.push(
|
|
|
|
|
calculateOuputFee(side, sample, opts.outputAmountPerEth, opts.inputAmountPerEth, fees)
|
|
|
|
|
.integerValue()
|
|
|
|
|
.toNumber(),
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
return memo;
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
ids: [],
|
|
|
|
|
inputs: [],
|
|
|
|
|
outputs: [],
|
|
|
|
|
outputFees: [],
|
|
|
|
|
isVip: vipSourcesSet.has(singleSourceSamplesWithOutput[0]?.source),
|
|
|
|
|
},
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
samplesAndNativeOrdersWithResults.push(singleSourceSamplesWithOutput);
|
|
|
|
|
serializedPaths.push(serializedPath);
|
|
|
|
|
sampleSourcePathIds.push(sourcePathId);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const nativeOrdersourcePathId = hexUtils.random();
|
|
|
|
|
for (const [idx, nativeOrder] of nativeOrders.entries()) {
|
|
|
|
|
const { input: normalizedOrderInput, output: normalizedOrderOutput } = nativeOrderToNormalizedAmounts(
|
|
|
|
|
side,
|
|
|
|
|
nativeOrder,
|
|
|
|
|
);
|
|
|
|
|
// NOTE: skip dummy order created in swap_quoter
|
|
|
|
|
// TODO: remove dummy order and this logic once we don't need the JS router
|
|
|
|
|
if (normalizedOrderInput.isLessThanOrEqualTo(0) || normalizedOrderOutput.isLessThanOrEqualTo(0)) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
const fee = calculateOuputFee(side, nativeOrder, opts.outputAmountPerEth, opts.inputAmountPerEth, fees)
|
|
|
|
|
.integerValue()
|
|
|
|
|
.toNumber();
|
|
|
|
|
|
|
|
|
|
// HACK: due to an issue with the Rust router interpolation we need to create exactly 13 samples from the native order
|
|
|
|
|
const ids = [];
|
|
|
|
|
const inputs = [];
|
|
|
|
|
const outputs = [];
|
|
|
|
|
const outputFees = [];
|
|
|
|
|
|
|
|
|
|
// NOTE: Limit orders can be both larger or smaller than the input amount
|
|
|
|
|
// If the order is larger than the input we can scale the order to the size of
|
|
|
|
|
// the quote input (order pricing is constant) and then create 13 "samples" up to
|
|
|
|
|
// and including the full quote input amount.
|
|
|
|
|
// If the order is smaller we don't need to scale anything, we will just end up
|
|
|
|
|
// with trailing duplicate samples for the order input as we cannot go higher
|
|
|
|
|
const scaleToInput = BigNumber.min(input.dividedBy(normalizedOrderInput), 1);
|
|
|
|
|
for (let i = 1; i <= 13; i++) {
|
|
|
|
|
const fraction = i / 13;
|
|
|
|
|
const currentInput = BigNumber.min(
|
|
|
|
|
normalizedOrderInput.times(scaleToInput).times(fraction),
|
|
|
|
|
normalizedOrderInput,
|
|
|
|
|
);
|
|
|
|
|
const currentOutput = BigNumber.min(
|
|
|
|
|
normalizedOrderOutput.times(scaleToInput).times(fraction),
|
|
|
|
|
normalizedOrderOutput,
|
|
|
|
|
);
|
|
|
|
|
const id = `${ERC20BridgeSource.Native}-${serializedPaths.length}-${idx}-${i}`;
|
|
|
|
|
inputs.push(currentInput.integerValue().toNumber());
|
|
|
|
|
outputs.push(currentOutput.integerValue().toNumber());
|
|
|
|
|
outputFees.push(fee);
|
|
|
|
|
ids.push(id);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const serializedPath: SerializedPath = {
|
|
|
|
|
ids,
|
|
|
|
|
inputs,
|
|
|
|
|
outputs,
|
|
|
|
|
outputFees,
|
|
|
|
|
isVip: true,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
samplesAndNativeOrdersWithResults.push([nativeOrder]);
|
|
|
|
|
serializedPaths.push(serializedPath);
|
|
|
|
|
sampleSourcePathIds.push(nativeOrdersourcePathId);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (serializedPaths.length === 0) {
|
|
|
|
|
return undefined;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const rustArgs: OptimizerCapture = {
|
|
|
|
|
side,
|
|
|
|
|
targetInput: input.toNumber(),
|
|
|
|
|
pathsIn: serializedPaths,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const allSourcesRustRoute = new Float64Array(rustArgs.pathsIn.length);
|
|
|
|
|
const allSourcesOutputAmounts = new Float64Array(rustArgs.pathsIn.length);
|
|
|
|
|
const vipSourcesRustRoute = new Float64Array(rustArgs.pathsIn.length);
|
|
|
|
|
const vipSourcesOutputAmounts = new Float64Array(rustArgs.pathsIn.length);
|
|
|
|
|
|
|
|
|
|
route(
|
|
|
|
|
rustArgs,
|
|
|
|
|
allSourcesRustRoute,
|
|
|
|
|
allSourcesOutputAmounts,
|
|
|
|
|
vipSourcesRustRoute,
|
|
|
|
|
vipSourcesOutputAmounts,
|
|
|
|
|
neonRouterNumSamples,
|
|
|
|
|
);
|
|
|
|
|
assert.assert(
|
|
|
|
|
rustArgs.pathsIn.length === allSourcesRustRoute.length,
|
|
|
|
|
'different number of sources in the Router output than the input',
|
|
|
|
|
);
|
|
|
|
|
assert.assert(
|
|
|
|
|
rustArgs.pathsIn.length === allSourcesOutputAmounts.length,
|
|
|
|
|
'different number of sources in the Router output amounts results than the input',
|
|
|
|
|
);
|
|
|
|
|
assert.assert(
|
|
|
|
|
rustArgs.pathsIn.length === vipSourcesRustRoute.length,
|
|
|
|
|
'different number of sources in the Router output than the input',
|
|
|
|
|
);
|
|
|
|
|
assert.assert(
|
|
|
|
|
rustArgs.pathsIn.length === vipSourcesOutputAmounts.length,
|
|
|
|
|
'different number of sources in the Router output amounts results than the input',
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
const allSourcesPath = createPathFromStrategy(allSourcesRustRoute, allSourcesOutputAmounts);
|
|
|
|
|
const vipSourcesPath = createPathFromStrategy(vipSourcesRustRoute, vipSourcesOutputAmounts);
|
|
|
|
|
|
|
|
|
|
return {
|
|
|
|
|
allSourcesPath,
|
|
|
|
|
vipSourcesPath,
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
export function findOptimalRustPathFromSamples(
|
|
|
|
|
@@ -349,9 +385,18 @@ export function findOptimalRustPathFromSamples(
|
|
|
|
|
neonRouterNumSamples: number,
|
|
|
|
|
samplerMetrics?: SamplerMetrics,
|
|
|
|
|
): Path | undefined {
|
|
|
|
|
const beforeAllTimeMs = performance.now();
|
|
|
|
|
let beforeTimeMs = performance.now();
|
|
|
|
|
const allSourcesPath = findRoutesAndCreateOptimalPath(
|
|
|
|
|
const beforeTimeMs = performance.now();
|
|
|
|
|
const sendMetrics = () => {
|
|
|
|
|
// tslint:disable-next-line: no-unused-expression
|
|
|
|
|
samplerMetrics &&
|
|
|
|
|
samplerMetrics.logRouterDetails({
|
|
|
|
|
router: 'neon-router',
|
|
|
|
|
type: 'total',
|
|
|
|
|
timingMs: performance.now() - beforeTimeMs,
|
|
|
|
|
});
|
|
|
|
|
};
|
|
|
|
|
const vipSourcesSet = new Set(VIP_ERC20_BRIDGE_SOURCES_BY_CHAIN_ID[chainId]);
|
|
|
|
|
const paths = findRoutesAndCreateOptimalPath(
|
|
|
|
|
side,
|
|
|
|
|
samples,
|
|
|
|
|
nativeOrders,
|
|
|
|
|
@@ -359,58 +404,22 @@ export function findOptimalRustPathFromSamples(
|
|
|
|
|
opts,
|
|
|
|
|
fees,
|
|
|
|
|
neonRouterNumSamples,
|
|
|
|
|
vipSourcesSet,
|
|
|
|
|
);
|
|
|
|
|
// tslint:disable-next-line: no-unused-expression
|
|
|
|
|
samplerMetrics &&
|
|
|
|
|
samplerMetrics.logRouterDetails({
|
|
|
|
|
router: 'neon-router',
|
|
|
|
|
type: 'all',
|
|
|
|
|
timingMs: performance.now() - beforeTimeMs,
|
|
|
|
|
});
|
|
|
|
|
if (!allSourcesPath) {
|
|
|
|
|
|
|
|
|
|
if (!paths) {
|
|
|
|
|
sendMetrics();
|
|
|
|
|
return undefined;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const vipSources = VIP_ERC20_BRIDGE_SOURCES_BY_CHAIN_ID[chainId];
|
|
|
|
|
const { allSourcesPath, vipSourcesPath } = paths;
|
|
|
|
|
|
|
|
|
|
// HACK(kimpers): The Rust router currently doesn't account for VIP sources correctly
|
|
|
|
|
// we need to try to route them in isolation and compare with the results all sources
|
|
|
|
|
if (vipSources.length > 0) {
|
|
|
|
|
beforeTimeMs = performance.now();
|
|
|
|
|
const vipSourcesSet = new Set(vipSources);
|
|
|
|
|
const vipSourcesSamples = samples.filter(s => s[0] && vipSourcesSet.has(s[0].source));
|
|
|
|
|
|
|
|
|
|
if (vipSourcesSamples.length > 0) {
|
|
|
|
|
const vipSourcesPath = findRoutesAndCreateOptimalPath(
|
|
|
|
|
side,
|
|
|
|
|
vipSourcesSamples,
|
|
|
|
|
[],
|
|
|
|
|
input,
|
|
|
|
|
opts,
|
|
|
|
|
fees,
|
|
|
|
|
neonRouterNumSamples,
|
|
|
|
|
);
|
|
|
|
|
// tslint:disable-next-line: no-unused-expression
|
|
|
|
|
samplerMetrics &&
|
|
|
|
|
samplerMetrics.logRouterDetails({
|
|
|
|
|
router: 'neon-router',
|
|
|
|
|
type: 'vip',
|
|
|
|
|
timingMs: performance.now() - beforeTimeMs,
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
if (vipSourcesPath?.isBetterThan(allSourcesPath)) {
|
|
|
|
|
if (!allSourcesPath || vipSourcesPath?.isBetterThan(allSourcesPath)) {
|
|
|
|
|
sendMetrics();
|
|
|
|
|
return vipSourcesPath;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// tslint:disable-next-line: no-unused-expression
|
|
|
|
|
samplerMetrics &&
|
|
|
|
|
samplerMetrics.logRouterDetails({
|
|
|
|
|
router: 'neon-router',
|
|
|
|
|
type: 'total',
|
|
|
|
|
timingMs: performance.now() - beforeAllTimeMs,
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
sendMetrics();
|
|
|
|
|
return allSourcesPath;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|