How to solve TFS slow response problem?

/*

Author : Jiangong SUN

*/

Assume that your environment is Visual studio and TFS server.

At one day, when you make modifications in your solution, such as, create a new file, or update a file name. Then visual studio takes a long time to respond.

You may meet the TFS response problem.

In this case, you may try to restart visual studio or your system or make some other tries. But it won‘t work.

You need to "refresh" your workspace to solve this problem, which means delete the entire workspace and re-make the mapping.

But you should backup your current modifications in the solution by shelve them.

Hope this can do help!

时间： 2025-01-02 14:38:31

How to solve TFS slow response problem?的相关文章

the steps that may be taken to solve a feature selection problem：特征选择的步骤

参考:JMLR的paper<an introduction to variable and feature selection> we summarize the steps that may be taken to solve a feature selection problem in a check list: 1. Do you have domain knowledge? If yes, construct a better set of "ad hoc" fea

[Algorithms] Using Dynamic Programming to Solve longest common subsequence problem

Let's say we have two strings: str1 = 'ACDEB' str2 = 'AEBC' We need to find the longest common subsequence, which in this case should be 'AEB'. Using dynamic programming, we want to compare by char not by whole words. we need memo to keep tracking th

Y460/Y470 Nvidia optirum solution : switch off the nvidia card and solve screen flash problem

i have such a long time fall in love with ubuntu , but i found it's much unconfortable for me with a lenovo y460n , that owning a intel display card and a Nvidia GT425M card . once i install ubuntu (from 10.04 , 12.04 , 14.04 , so many versions i had

hidden node and exposed node problem

Exposed node problem In wireless networks, theexposed node problem occurs when a node is prevented from sending packets to other nodes because of a neighboring transmitter. Consider an example of 4 nodes labeled R1, S1, S2, and R2, where the two rece

HDU 4971 A simple brute force problem.(最小割，最大权闭合图)

http://acm.hdu.edu.cn/showproblem.php?pid=4971 A simple brute force problem. Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 182    Accepted Submission(s): 115 Problem Description There's a com

CF:Problem 427C - Checkposts强连通Tarjan算法

这题昨晚做了,刚开始看题的时候没想出好法子,然后就看D题了,一看D题发现是后缀数组,然后就把模板改了点就交了上去--不幸的是--WA了,然后重新看题,果然题目看漏了--不仅要用后缀数组和前缀数组求出公共子缀,还要是求最小的,而且在每个串里都不能重复的,这下就想了会不会了,然后看见大帝C过了,然后就重新回来看C了,看了会终于明天怎么做了. C题意:给个图,然后每个点都有权值,求最小的花费及方案数:最小的花费是这样的:因为是建立一个岗哨,然后这个岗哨可以管哪些呢,可以管 i = j 的,或者可以从

HDU - 4971 A simple brute force problem. （DP）

Problem Description There's a company with several projects to be done. Finish a project will get you profits. However, there are some technical problems for some specific projects. To solve the problem, the manager will train his employee which may

CDOJ 483 Data Structure Problem DFS

32‘20 Data Structure Problem Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.uestc.edu.cn/#/problem/show/483 Description Data structure is a fundamental course of Computer Science, so that each contestant is highly likely to solve this data s

HDU 4971 A simple brute force problem.

A simple brute force problem. Time Limit: 1000ms Memory Limit: 65536KB This problem will be judged on HDU. Original ID: 497164-bit integer IO format: %I64d      Java class name: Main There's a company with several projects to be done. Finish a projec