当前位置: 首页>>代码示例>>TypeScript>>正文


TypeScript suggest.provideSuggestionItems函数代码示例

本文整理汇总了TypeScript中vs/editor/contrib/suggest/suggest.provideSuggestionItems函数的典型用法代码示例。如果您正苦于以下问题:TypeScript provideSuggestionItems函数的具体用法?TypeScript provideSuggestionItems怎么用?TypeScript provideSuggestionItems使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。


在下文中一共展示了provideSuggestionItems函数的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的TypeScript代码示例。

示例1: test

	test('sort - snippet bottom', async function () {
		const items = await provideSuggestionItems(model, new Position(1, 1), 'bottom');
		assert.equal(items.length, 3);
		assert.equal(items[0].completion.label, 'fff');
		assert.equal(items[1].completion.label, 'aaa');
		assert.equal(items[2].completion.label, 'zzz');
	});
开发者ID:VishalMadhvani,项目名称:vscode,代码行数:7,代码来源:suggest.test.ts

示例2: test

	test('only from', function () {

		const foo: any = {
			triggerCharacters: [],
			provideCompletionItems() {
				return {
					currentWord: '',
					incomplete: false,
					suggestions: [{
						label: 'jjj',
						type: 'property',
						insertText: 'jjj'
					}]
				};
			}
		};
		const registration = SuggestRegistry.register({ pattern: 'bar/path', scheme: 'foo' }, foo);

		provideSuggestionItems(model, new Position(1, 1), undefined, [foo]).then(items => {
			registration.dispose();

			assert.equal(items.length, 1);
			assert.ok(items[0].support === foo);
		});
	});
开发者ID:developers23,项目名称:vscode,代码行数:25,代码来源:suggest.test.ts

示例3: test

	test('sort - snippet top', async function () {
		const items = await provideSuggestionItems(model, new Position(1, 1), new CompletionOptions(SnippetSortOrder.Top));
		assert.equal(items.length, 3);
		assert.equal(items[0].completion.label, 'aaa');
		assert.equal(items[1].completion.label, 'zzz');
		assert.equal(items[2].completion.label, 'fff');
	});
开发者ID:PKRoma,项目名称:vscode,代码行数:7,代码来源:suggest.test.ts


注:本文中的vs/editor/contrib/suggest/suggest.provideSuggestionItems函数示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。