mirror of
https://github.com/ethauvin/kobalt.git
synced 2025-04-26 08:27:12 -07:00
Dead code.
This commit is contained in:
Cedric Beust
parent
55d05e09d9
commit
cc7564d9f7
2 changed files with 0 additions and 135 deletions
|
|
@ -284,138 +284,6 @@ class TaskManager @Inject constructor(val args: Args,
|
|||
return result
|
||||
}
|
||||
|
||||
// private fun reverseMultimap(mm: Multimap<String, String>) : Multimap<String, String> {
|
||||
// val result = TreeMultimap.create<String, String>()
|
||||
// mm.keySet().forEach { key ->
|
||||
// mm[key].forEach { value ->
|
||||
// result.put(value, key)
|
||||
// }
|
||||
// }
|
||||
// return result
|
||||
// }
|
||||
|
||||
/**
|
||||
* Create a dynamic graph representing all the tasks that need to be run.
|
||||
*/
|
||||
// @VisibleForTesting
|
||||
// fun <T> createGraph(projectName: String, taskNames: List<String>, nodeMap: Multimap<String, out T>,
|
||||
// dependsOn: Multimap<String, String>,
|
||||
// reverseDependsOn: Multimap<String, String>,
|
||||
// runBefore: Multimap<String, String>,
|
||||
// runAfter: Multimap<String, String>,
|
||||
// toName: (T) -> String,
|
||||
// accept: (T) -> Boolean):
|
||||
// DynamicGraph<T> {
|
||||
//
|
||||
// val result = DynamicGraph<T>()
|
||||
// taskNames.forEach { fullTaskName ->
|
||||
// val ti = TaskInfo(fullTaskName)
|
||||
// if (!nodeMap.keys().contains(ti.taskName)) {
|
||||
// throw KobaltException("Unknown task: $fullTaskName")
|
||||
// }
|
||||
//
|
||||
// if (ti.matches(projectName)) {
|
||||
// val tiTaskName = ti.taskName
|
||||
// nodeMap[tiTaskName].forEach { task ->
|
||||
// if (task != null && accept(task)) {
|
||||
// val toProcess = arrayListOf(task)
|
||||
// val newToProcess = hashSetOf<T>()
|
||||
//
|
||||
// fun maybeAddEdge(task: T, mm: Multimap<String, String>,
|
||||
// seen: Set<String>,
|
||||
// isDependency: Boolean,
|
||||
// reverseEdges: Boolean = false): Boolean {
|
||||
// var added = false
|
||||
// val taskName = toName(task)
|
||||
// mm[taskName]?.forEach { toName ->
|
||||
// val addEdge = isDependency || (!isDependency && taskNames.contains(toName))
|
||||
// if (addEdge) {
|
||||
// nodeMap[toName].forEach { to ->
|
||||
// if (reverseEdges) {
|
||||
// log(3, " Adding reverse edge \"$to\" -> \"$task\" it=\"$toName\"")
|
||||
// added = true
|
||||
// result.addEdge(to, task)
|
||||
// } else {
|
||||
// log(3, " Adding edge \"$task\" -> \"$to\"")
|
||||
// added = true
|
||||
// result.addEdge(task, to)
|
||||
// }
|
||||
// if (!seen.contains(toName(to))) {
|
||||
// log(3, " New node to process: \"$to\"")
|
||||
// newToProcess.add(to)
|
||||
// } else {
|
||||
// log(3, " Already seen: $to")
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// return added
|
||||
// }
|
||||
//
|
||||
// // These two maps indicate reversed dependencies so we want to have
|
||||
// // a reverse map for them so we consider all the cases. For example,
|
||||
// // if we are looking at task "a", we want to find all the relationships
|
||||
// // that depend on "a" and also all the relationships that "a" depends on
|
||||
// val invertedReverseDependsOn = reverseMultimap(reverseDependsOn)
|
||||
// val invertedRunBefore = reverseMultimap(runBefore)
|
||||
// val invertedDependsOn = reverseMultimap(dependsOn)
|
||||
// val invertedRunAfter = reverseMultimap(runAfter)
|
||||
//
|
||||
// val seen = hashSetOf<String>()
|
||||
// while (toProcess.size > 0) {
|
||||
// log(3, " New batch of nodes to process: $toProcess")
|
||||
// toProcess.filter { !seen.contains(toName(it)) }.forEach { current ->
|
||||
// result.addNode(current)
|
||||
//
|
||||
// if (! maybeAddEdge(current, invertedDependsOn, seen, true, true)) {
|
||||
// maybeAddEdge(current, dependsOn, seen, true, false)
|
||||
// }
|
||||
// if (! maybeAddEdge(current, invertedRunAfter, seen, false, true)) {
|
||||
// maybeAddEdge(current, runAfter, seen, false, false)
|
||||
// }
|
||||
// if (! maybeAddEdge(current, reverseDependsOn, seen, true, true)) {
|
||||
// maybeAddEdge(current, invertedReverseDependsOn, seen, true, false)
|
||||
// }
|
||||
// if (! maybeAddEdge(current, runBefore, seen, false, true)) {
|
||||
// maybeAddEdge(current, invertedRunBefore, seen, false, false)
|
||||
// }
|
||||
//
|
||||
// seen.add(toName(current))
|
||||
//
|
||||
// newToProcess.addAll(dependsOn[toName(current)].flatMap { nodeMap[it] })
|
||||
// }
|
||||
// toProcess.clear()
|
||||
// toProcess.addAll(newToProcess)
|
||||
// newToProcess.clear()
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
// } else {
|
||||
// log(3, "Task $fullTaskName does not match the current project $projectName, skipping it")
|
||||
// }
|
||||
// }
|
||||
// return result
|
||||
// }
|
||||
|
||||
/**
|
||||
* Find the free tasks of the graph.
|
||||
*/
|
||||
// private fun <T> calculateFreeTasks(tasksByNames: Multimap<String, T>, runBefore: TreeMultimap<String, String>,
|
||||
// reverseAfter: HashMap<String,
|
||||
// String>)
|
||||
// : Collection<T> {
|
||||
// val freeTaskMap = hashMapOf<String, T>()
|
||||
// tasksByNames.keys().forEach {
|
||||
// if (! runBefore.containsKey(it) && ! reverseAfter.containsKey(it)) {
|
||||
// tasksByNames[it].forEach { t ->
|
||||
// freeTaskMap.put(it, t)
|
||||
// }
|
||||
// }
|
||||
// }
|
||||
//
|
||||
// return freeTaskMap.values
|
||||
// }
|
||||
|
||||
/////
|
||||
// Manage the tasks
|
||||
//
|
||||
|
|
|
|||
|
|
@ -65,9 +65,6 @@ class KFiles {
|
|||
|
||||
val TEST_CLASSES_DIR : String = "test-classes"
|
||||
|
||||
private fun generatedDir(project: Project, variant: Variant)
|
||||
= KFiles.joinDir(project.directory, project.buildDirectory, "generated", variant.toIntermediateDir())
|
||||
|
||||
fun generatedSourceDir(project: Project, variant: Variant, name: String) =
|
||||
KFiles.joinDir(project.directory, project.buildDirectory, "generated", "source", name,
|
||||
variant.toIntermediateDir())
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue