| /dports/cad/libredwg/libredwg-0.12.4/test/unit-testing/ |
| H A D | multileader.c | 63 if (!ctx.leaders) in api_process()
69 if (ctx.leaders[i].has_lastleaderlinepoint) in api_process()
71 CHK_SUBCLASS_TYPE (ctx.leaders[i], LEADER_Node, has_dogleg, B); in api_process()
72 if (ctx.leaders[i].has_dogleg) in api_process()
73 CHK_SUBCLASS_3RD (ctx.leaders[i], LEADER_Node, dogleg_vector); in api_process()
75 for (BITCODE_BL j = 0; j < ctx.leaders[i].num_breaks; j++) in api_process()
82 CHK_SUBCLASS_TYPE (ctx.leaders[i], LEADER_Node, num_lines, BL); in api_process()
83 for (BITCODE_BL j = 0; j < ctx.leaders[i].num_lines; j++) in api_process()
85 BITCODE_BL num_points = ctx.leaders[i].lines[j].num_points; in api_process()
97 type = ctx.leaders[i].lines[j].type; in api_process()
[all …]
|
| /dports/print/texlive-base/texlive-20150521-source/texk/mendexk/tests/ |
| H A D | uni.ind | 4 \item Mendex\leaders\hbox{$\cdot$}\hfill 1
5 \subitem のインストール\leaders\hbox{$\cdot$}\hfill 1
6 \subitem ---の使い方\leaders\hbox{$\cdot$}\hfill 1
7 \subsubitem ---応用編\leaders\hbox{$\cdot$}\hfill 1
8 \subsubitem ---入門編\leaders\hbox{$\cdot$}\hfill 1
13 \item 里見弴\leaders\hbox{$\cdot$}\hfill \see{あ}{1}
18 \item ��咤激励\leaders\hbox{$\cdot$}\hfill 1
23 \item 森鷗外\leaders\hbox{$\cdot$}\hfill 1
|
| /dports/math/R-cran-memisc/memisc/R/ |
| H A D | mtable-format-delim.R | 44 leaders <- x$leaders functionVar
51 l.leaders <- length(leaders)
99 leaders <- c(rep(list(list(structure("",span=1))),lh),
100 leaders)
101 leaders <- lapply(leaders,ldxp)
102 leaders <- do.call(rbind,leaders)
104 res <- cbind(leaders,res)
|
| H A D | mtable-format-latex.R | 74 leaders <- x$leaders functionVar
145 l.leaders <- length(leaders)
147 leaders <- lapply(leaders,ldxp)
148 leaders <- do.call(rbind,leaders)
149 leaders <- gsub(" x ",interaction.sep,leaders,fixed=TRUE)
151 leaders <- LaTeXcape(leaders)
153 checkLaTeXcape(leaders,"row leaders")
155 leaders <- rbind("",leaders)
156 leaders <- format(leaders,justify="left")
157 res <- cbind(leaders,res)
[all …]
|
| H A D | format-html-ftable.R | 73 leaders <- array(list(),dim=c(n,n.row.vars)) functionVar
75 leaders <- cbind(leaders,"")
83 leaders[i,j] <- rv
91 if(ncol(leaders)>1)
92 lstyle <- c(lstyle1,rep(lstyle2,ncol(leaders)-1))
96 leaders[i,] <- html_td(leaders[i,],style=css(lstyle),
100 body <- cbind(leaders,body)
139 htmp1 <- html_td(rep("",ncol(leaders)),style=css(hstyle),
153 htmp1 <- html_td(rep("",ncol(leaders)),
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 159 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
160 while (leaders[v] != v) { in getLeader()
161 leaders[v] = leaders[leaders[v]]; in getLeader()
162 v = leaders[v]; in getLeader()
184 std::vector<int> leaders(clusters.size()); in run() local
186 std::iota(leaders.begin(), leaders.end(), 0); in run()
201 int predL = getLeader(leaders, c.bestPred.from); in run()
212 leaders[l] = predL; in run()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/llvm11/llvm-11.0.1.src/tools/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/llvm10/llvm-10.0.1.src/tools/lld/ELF/ |
| H A D | CallGraphSort.cpp | 159 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
160 while (leaders[v] != v) { in getLeader()
161 leaders[v] = leaders[leaders[v]]; in getLeader()
162 v = leaders[v]; in getLeader()
184 std::vector<int> leaders(clusters.size()); in run() local
186 std::iota(leaders.begin(), leaders.end(), 0); in run()
201 int predL = getLeader(leaders, c.bestPred.from); in run()
212 leaders[l] = predL; in run()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lld/COFF/ |
| H A D | CallGraphSort.cpp | 130 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
131 while (leaders[v] != v) { in getLeader()
132 leaders[v] = leaders[leaders[v]]; in getLeader()
133 v = leaders[v]; in getLeader()
155 std::vector<int> leaders(clusters.size()); in run() local
157 std::iota(leaders.begin(), leaders.end(), 0); in run()
172 int predL = getLeader(leaders, c.bestPred.from); in run()
183 leaders[l] = predL; in run()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 158 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
159 while (leaders[v] != v) { in getLeader()
160 leaders[v] = leaders[leaders[v]]; in getLeader()
161 v = leaders[v]; in getLeader()
183 std::vector<int> leaders(clusters.size()); in run() local
185 std::iota(leaders.begin(), leaders.end(), 0); in run()
200 int predL = getLeader(leaders, c.bestPred.from); in run()
211 leaders[l] = predL; in run()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 129 static int getLeader(std::vector<int> &leaders, int v) { in getLeader() argument
130 while (leaders[v] != v) { in getLeader()
131 leaders[v] = leaders[leaders[v]]; in getLeader()
132 v = leaders[v]; in getLeader()
154 std::vector<int> leaders(clusters.size()); in run() local
156 std::iota(leaders.begin(), leaders.end(), 0); in run()
171 int predL = getLeader(leaders, c.bestPred.from); in run()
182 leaders[l] = predL; in run()
|