rem stringlengths 0 322k | add stringlengths 0 2.05M | context stringlengths 8 228k |
|---|---|---|
old = string.split(self.spec, '\n') | old = self.spec.split('\n') | def applyChangeSet(self, cs): |
print "--", parts | def parseFile(self, f, packageNamespace, repos): | |
(self.name, self.newVersion.freeze(), rc.count("\n")) | (self.name, self.newVersion.freeze(), len(self.packages.keys())) | def freeze(self): |
skipPaths = {} for f in self.newFileList(): skipPaths[f.path()] = 1 | def __init__(self, repos, localCs, origJob): | |
self.paths[f.path()] = (f, origJob.cs) for f in self.newFileList(): self.paths[f.path()] = (f, localCs) | if not skipPaths.has_key(f.path()): self.paths[f.path()] = (f, origJob.cs) | def __init__(self, repos, localCs, origJob): |
def _checkDeps(jobSet, trvSrc, findOrdering): | def _checkDeps(jobSet, trvSrc, findOrdering, resolveDeps): | def _checkDeps(jobSet, trvSrc, findOrdering): |
if not cannotResolve: | if not cannotResolve or not resolveDeps: | def _checkDeps(jobSet, trvSrc, findOrdering): |
findOrdering = split) | findOrdering = split, resolveDeps = resolveDeps) | # def _resolveDependencies() begins here |
Use[flag]._set(value) | try: Use[flag]._set(value) except KeyError: raise AttributeError, "No Such Use Flag %s" % flag | def setBuildFlagsFromFlavor(recipeName, flavor, error=True): """ Sets the truth of the build Flags based on the build flavor. All the set build flags must already exist. Flags not mentioned in this flavor will be untouched. XXX should this create flags as well as set them? Problem with that is that we don't know whet... |
for reqInfo, depSet, provInfo in cannotResolve: | for reqInfo, depSet, provInfo in sorted(cannotResolve): | def checkDeps(self, uJob, jobSet, trvSrc, findOrdering, resolveDeps, ineligible, keepRequired = True, criticalUpdateInfo = None): """ Given a jobSet, use its dependencies to determine an ordering, resolve problems with jobs that have difficult dependency problems immediately, and determine any missing dependencies. """ |
ineligible.update(provInfoList) | def resolveEraseByUpdating(self, trvSrc, cannotResolve, uJob, jobSet, ineligible): """ Attempt to resolve broken erase dependencies by updating the package that has the dependency on the trove that is being erased. @param ineligible: Ineligible troves are troves that were involved in resolveEraseByUpdating before. """ | |
'remove their dependency on something being erased:\n %s', ('\n '.join(x[0][0].split(':')[0] for x in potentialUpdateList))) | 'remove their dependency on something being erased:\n %s', ('\n '.join(sorted(x[0][0].split(':')[0] for x in potentialUpdateList)))) | def resolveEraseByUpdating(self, trvSrc, cannotResolve, uJob, jobSet, ineligible): """ Attempt to resolve broken erase dependencies by updating the package that has the dependency on the trove that is being erased. @param ineligible: Ineligible troves are troves that were involved in resolveEraseByUpdating before. """ |
ineligible.update((x[0], x[1][0], x[1][1]) for x in newJobSet) | def resolveEraseByUpdating(self, trvSrc, cannotResolve, uJob, jobSet, ineligible): """ Attempt to resolve broken erase dependencies by updating the package that has the dependency on the trove that is being erased. @param ineligible: Ineligible troves are troves that were involved in resolveEraseByUpdating before. """ | |
def saveState(signal, f): | def save(): | def saveState(signal, f): sys.modules['coverage'].the_coverage.save() sys.exit(0) |
sys.exit(0) | def saveState(signal, f): sys.modules['coverage'].the_coverage.save() sys.exit(0) | |
signal.signal(signal.SIGQUIT, saveState) | signal.signal(signal.SIGQUIT, _saveState) signal.signal(signal.SIGTERM, _saveState) | def _run(coverage): signal.signal(signal.SIGQUIT, saveState) atexit.register(coverage.the_coverage.save) coverage.the_coverage.get_ready() sys.settrace(coverage.t) |
def read(self): | def readVersionMap(self): if self.versionMap: return | def read(self): |
if not self.versionMap: self.read() | self.readVersionMap() | def findLatestVersion(self, branch): |
if not self.versionMap: self.read() | self.readVersionMap() | def addVersion(self, version, data): |
if not self.versionMap: self.read() | self.readVersionMap() | def eraseVersion(self, version): |
if not self.versionMap: self.read() | self.readVersionMap() | def hasVersion(self, version): |
if not self.versionMap: self.read() | self.readVersionMap() | def versionList(self): |
self.read() | self.versionMap = None | def __init__(self, db, filename): |
del self.edges[item] | del self.edges[idx] | def delete(self, item): idx = self.data.getIndex(item) self.data.delete(item) del self.edges[item] [ x.discard(idx) for x in self.edges.itervalues() ] |
del self.edges[self.data.getIndex(item)] | self.edges[self.data.getIndex(item)] = set() | def deleteEdges(self, item): del self.edges[self.data.getIndex(item)] |
self.dbg('transient: %s', filename) | self.dbg(filename) | def doFile(self, filename): |
if migrate: | if migrate and not info and not cfg.interactive: | def _updateTroves(cfg, applyList, replaceFiles = False, tagScript = None, keepExisting = False, depCheck = True, test = False, justDatabase = False, recurse = True, info = False, updateByDefault = True, callback = None, split=True, sync = False, keepRequired = False, fromChangesets = [], checkPathConflicts = True, chec... |
if not cfg.interactive: return | return | def _updateTroves(cfg, applyList, replaceFiles = False, tagScript = None, keepExisting = False, depCheck = True, test = False, justDatabase = False, recurse = True, info = False, updateByDefault = True, callback = None, split=True, sync = False, keepRequired = False, fromChangesets = [], checkPathConflicts = True, chec... |
kwargs['justDatabase'] = False | kwargs['justDatabase'] = True | def realMain(cfg, argv=sys.argv): argDef = {} cfgMap = {} cfgMap["build-label"] = "buildLabel" cfgMap["root"] = "root" (NO_PARAM, ONE_PARAM) = (options.NO_PARAM, options.ONE_PARAM) (OPT_PARAM, MULT_PARAM) = (options.OPT_PARAM, options.MULT_PARAM) argDef["all"] = NO_PARAM argDef["config"] = MULT_PARAM argDef["confi... |
dupList.append((trove.getName(), trove.getVersion().branch())) | dupList.append((name, version.branch())) | def _createBranchOrShadow(self, newLabel, troveList, shadow, sourceTroves): cs = changeset.ChangeSet() |
if isinstance(source, TroveSourceStack): for subSource in source.iterSources(): self.addSource(source) else: self.addSource(source) | self.addSource(source) | def __init__(self, *sources): self.sources = [] for source in sources: if isinstance(source, TroveSourceStack): for subSource in source.iterSources(): self.addSource(source) else: self.addSource(source) |
if source is not None and source not in self: | if source is None: return if isinstance(source, TroveSourceStack): for subSource in source.iterSources(): self.addSource(subSource) return if source not in self: | def addSource(self, source): if source is not None and source not in self: self.sources.append(source) |
return sources[1] | return sources[0] | def stack(*sources): """ create a trove source that will search first source1, then source2 """ if len(sources) > 2: return stack(sources[0], stack(*sources[1:])) elif len(sources) == 1: return sources[1] elif not sources: return None else: source1, source2 = sources if source1 is source2: # trove source stacks may ha... |
if source2.hasSource(source1): return source2 source2 = source2.copy() source2.insertSource(source1) return source2 | s = TroveSourceStack(source1) s.addSource(source2) return s | def stack(*sources): """ create a trove source that will search first source1, then source2 """ if len(sources) > 2: return stack(sources[0], stack(*sources[1:])) elif len(sources) == 1: return sources[1] elif not sources: return None else: source1, source2 = sources if source1 is source2: # trove source stacks may ha... |
SELECT MAX(MAX(u.userId), MAX(g.userGroupId))+1, ? FROM Users u, UserGroups g""", user) | SELECT MAX( (SELECT IFNULL(MAX(userId),0) FROM Users), (SELECT IFNULL(MAX(userGroupId),0) FROM UserGroups) )+1, ? """, user) | def addUserByMD5(self, user, salt, password): |
equivalent to adding the c{r.addTrove} lines: | equivalent to adding the C{r.addTrove} lines: | def addAll(self, name, versionStr = None, flavor = None, ref = None, recurse=True, groupName = None): """ NAME ==== |
builds an in-core state object as if these changes were committed. If no version is passed, the changeset is against the head of the working branch. The return is a tuple with a boolean saying if anything changes, the new state, the changeset, and the package which was diff'd against. | builds an in-core package object reflecting those local changes. The return is a tuple with a boolean saying if anything changes, the new state, the changeset, and the new package object. | def _buildChangeSet(repos, state, srcPkg): """ Builds a change set against the sources in the current directory and builds an in-core state object as if these changes were committed. If no version is passed, the changeset is against the head of the working branch. The return is a tuple with a boolean saying if anything... |
return (foundDifference, newState, changeSet, srcPkg) | return (foundDifference, newState, changeSet) | def _buildChangeSet(repos, state, srcPkg): """ Builds a change set against the sources in the current directory and builds an in-core state object as if these changes were committed. If no version is passed, the changeset is against the head of the working branch. The return is a tuple with a boolean saying if anything... |
(isDifferent, newState, changeSet, oldPackage) = result | (isDifferent, newState, changeSet) = result | def commit(repos): state = SourceStateFromFile("SRS") if isinstance(state.getVersion(), versions.NewVersion): # new package, so it shouldn't exist yet if repos.hasPackage(state.getName()): log.error("%s is marked as a new package but it " "already exists" % state.getName()) return srcPkg = None else: srcPkg = repos.ge... |
srcPkg = pkgList[0] else: srcPkg = repos.getLatestPackage(state.getName()) result = _buildChangeSet(repos, state, srcPkg) | oldPackage = pkgList[0] else: oldPackage = repos.getPackageVersion(state.getName(), state.getVersion()) oldPackage.changeVersion(repos.pkgGetFullVersion(state.getName(), oldPackage.getVersion())) result = _buildChangeSet(repos, state, oldPackage) | def diff(repos, versionStr = None): state = SourceStateFromFile("SRS") if versionStr: versionStr = state.expandVersionStr(versionStr) pkgList = helper.findPackage(repos, None, None, state.getName(), versionStr) if len(pkgList) > 1: log.error("%s specifies multiple versions" % versionStr) return srcPkg = pkgList[0] e... |
(changed, newState, changeSet, oldPackage) = result | (changed, newState, changeSet) = result | def diff(repos, versionStr = None): state = SourceStateFromFile("SRS") if versionStr: versionStr = state.expandVersionStr(versionStr) pkgList = helper.findPackage(repos, None, None, state.getName(), versionStr) if len(pkgList) > 1: log.error("%s specifies multiple versions" % versionStr) return srcPkg = pkgList[0] e... |
if not flag: | if flag._value is None: continue if flag._value is False: | def getUsedSet(self): """ Create a flag set based on used flags """ flagSet = nullSet() for flag in self.getUsed().itervalues(): if not flag: flag = -flag flagSet = flagSet + flag return flagSet |
def toDependency(self): | def toDependency(self, recipename=''): | def toDependency(self): """ Convert this flag set to a list of dependencies """ # XXX this code should probably disappear with the reworking of # flavors and their relationship with deps, but for now, # it is very handy set = deps.DependencySet() useflagsets = [] if self._name != '__GLOBAL__': self = self.asSet() if 'U... |
useflagsets = [] | def toDependency(self): """ Convert this flag set to a list of dependencies """ # XXX this code should probably disappear with the reworking of # flavors and their relationship with deps, but for now, # it is very handy set = deps.DependencySet() useflagsets = [] if self._name != '__GLOBAL__': self = self.asSet() if 'U... | |
if 'Use' in self: useflagsets.append(self['Use']) if 'Flags' in self: useflagsets.append(self['Flags']) if useflagsets: | if 'Use' in self or 'Flags' in self: | def toDependency(self): """ Convert this flag set to a list of dependencies """ # XXX this code should probably disappear with the reworking of # flavors and their relationship with deps, but for now, # it is very handy set = deps.DependencySet() useflagsets = [] if self._name != '__GLOBAL__': self = self.asSet() if 'U... |
for flagset in useflagsets: for flag in flagset.iterkeys(): stringDeps.extend(flagset[flag].toDepStrings()) | if 'Use' in self: for flag in self.Use.iterkeys(): stringDeps.extend(self.Use[flag].toDepStrings(topflag=self.Use)) if 'Flags' in self: for flag in self.Flags.iterkeys(): stringDeps.extend( self.Flags[flag].toDepStrings(prefix=recipename, topflag=self.Flags)) | def toDependency(self): """ Convert this flag set to a list of dependencies """ # XXX this code should probably disappear with the reworking of # flavors and their relationship with deps, but for now, # it is very handy set = deps.DependencySet() useflagsets = [] if self._name != '__GLOBAL__': self = self.asSet() if 'U... |
raise CommitError, \ | raise errors.CommitError, \ | def __init__(self, repos, cs, fileHostFilter = [], callback = None, resetTimestamps = False, keyCache = None, threshold = 0): |
@type: list | @type param: list | def getFileContents(self, sha1List): |
removed, but is preserved only so that older recipes can be cooked | removed, and is preserved only so that older recipes can be cooked | def __init__(self, recipe, *args, **keywords): |
new.append("N %s (%s)" % (x.getName(), newVersion.trailingRevision().asString())) | new.append(("%s (%s)" % (x.getName(), newVersion.trailingRevision().asString()), 'N')) | def doUpdate(cfg, pkgList, replaceFiles = False, tagScript = None, keepExisting = False, depCheck = True, depsRecurse = True, test = False, justDatabase = False, recurse = True, info = False, updateByDefault = True, callback = None): if not callback: callback = callbacks.UpdateCallback() client = conaryclient.ConaryCl... |
new.append("%c %s (%s -> %s)" % (kind, x.getName(), oldTVersion.asString(), newTVersion.asString())) old = [ (x[0], x.getOldVersion().trailingVersion()) | new.append(("%s (%s -> %s)" % (x.getName(), oldTVersion.asString(), newTVersion.asString()), 'N')) new.sort() new = [ "%s %s" % (x[1], x[0]) for x in new ] old = [ "%s (%s)" % (x[0], x[1].trailingRevision().asString()) | def doUpdate(cfg, pkgList, replaceFiles = False, tagScript = None, keepExisting = False, depCheck = True, depsRecurse = True, test = False, justDatabase = False, recurse = True, info = False, updateByDefault = True, callback = None): if not callback: callback = callbacks.UpdateCallback() client = conaryclient.ConaryCl... |
print "WHAT", what | def applyUpdate(self, theCs, replaceFiles = False, tagScript = None, keepExisting = None): assert(isinstance(theCs, changeset.MergeableChangeSet)) cs = changeset.MergeableChangeSet() for (how, what) in theCs.contents: if how == self.repos.createChangeSet: print "WHAT", what newCs = self.repos.createChangeSet(what) cs.m... | |
pdb.post_mortem(tb) | if sys.stdout.isatty() and sys.stdin.isatty(): pdb.post_mortem(tb) else: sys.exit(1) | def excepthook(type, value, tb): #if type is exceptions.IOError: #sys.stderr.write('%s\n' % value) #sys.exit(1) sys.excepthook = sys.__excepthook__ lines = traceback.format_exception(type, value, tb) print string.joinfields(lines, "") pdb.post_mortem(tb) |
mirror = mirror or name | def fetchURL(cfg, name, location, httpHeaders={}, guessName=None, mirror=None): retries = 0 url = None mirror = mirror or name # check for negative cache entries to avoid spamming servers negativeName = _createNegativeCacheName(cfg, name, location) if os.path.exists(negativeName): if time.time() > 60*60 + os.path.get... | |
if guessName and 'text/html' in content_type: | if (guessName or mirror) and 'text/html' in content_type: | def fetchURL(cfg, name, location, httpHeaders={}, guessName=None, mirror=None): retries = 0 url = None mirror = mirror or name # check for negative cache entries to avoid spamming servers negativeName = _createNegativeCacheName(cfg, name, location) if os.path.exists(negativeName): if time.time() > 60*60 + os.path.get... |
self.message('Recreating indexes... (this could take a while)') createTroves(self.db) | def migrate(self): self.message('WARNING: do NOT try to interrupt this migration, you will leave your DB in a messy state') | |
self.message('Indexes created.') | def migrate(self): self.message('WARNING: do NOT try to interrupt this migration, you will leave your DB in a messy state') | |
self.cu.execute('ALTER TABLE Instances RENAME TO InstancesOld') for idx in self.db.tables['Instances']: self.cu.execute('DROP INDEX %s' % idx) self.db.loadSchema() self.message('Recreating indexes... (this could take a while)') createTroves(self.db) self.message('Indexes created.') self.message('Updating instances ... | def migrate(self): self.message('WARNING: do NOT try to interrupt this migration, you will leave your DB in a messy state') | |
self.streamIdCache = {} | def __init__(self, db, log = None): | |
self.fileVersionCache = {} | def addTrove(self, trv): | |
versionCache = {} | def addTroveDone(self, troveInfo): | |
del self.fileVersionCache | def addTroveDone(self, troveInfo): | |
versionCache = {} | def iterFilesInTrove(self, troveName, troveVersion, troveFlavor, sortByPath = False, withFiles = False): | |
if fileId in self.seenFileId: fileObj = fileStream = None | def addFile(self, troveInfo, pathId, fileObj, path, fileId, fileVersion, fileStream = None): | |
grouping.sort(lambda a,b: cmp(max(x[0] for x in a), max(x[0] for x in b))) | grouping.sort(lambda a,b: cmp(a[0][0], b[0][0])) | def groupTroves(troveList): # combine the troves into indisolvable groups based on their version and # flavor; it's assumed that adjacent troves with the same version/flavor # must be in a single commit grouping = {} for info in troveList: (n, v, f) = info[1] crtGrp = grouping.setdefault((v,f), []) crtGrp.append(info) ... |
elif fromTrove.startswith("group-"): | if fromTrove.startswith("group-"): | def addRedirect(self, name, branchStr = None, sourceFlavor = None, targetFlavor = None, fromTrove = None): if (sourceFlavor and not targetFlavor) or \ (targetFlavor and not sourceFlavor): raise builderrors.RecipeFileError, \ "sourceFlavor and targetFlavor must be specified jointly" |
if matches and len(matches[destName]) > 1: raise builderrors.RecipeFileError, \ "Label %s matched multiple branches." % str(label) | if matches: branches = set(x.branch() for x in matches[destName]) if len(branches) > 1: raise builderrors.RecipeFileError, \ "Label %s matched multiple branches." % str(label) | def findTroves(self): self.size = 0 |
"Trove %s does not exist" % (destName, targetFlavor) | "Trove %s does not exist" % (destName) | def findTroves(self): self.size = 0 |
if sourceFlavor.score(targetFlavor) is not None: | if (sourceFlavorRestriction or sourceFlavor.score(targetFlavor) is not False): | def findTroves(self): self.size = 0 |
os.unlink(target) | try: os.unlink(target) except OSError, e: if e.errno != errno.ENOENT: raise | def apply(self): |
log.debug(msg) | log.warning(msg) | def apply(self): |
failedHunks.asString(), | "".join([x.asString() for x in failedHunks]), | def _singlePackage(self, repos, pkgCs, changeSet, basePkg, fsPkg, root, flags): |
SELECT depId, depNum, RemovedTroveIds.troveId, RemovedTroveIds.nodeId, provInstanceId | SELECT depId, depNum, reqInstanceId, Required.nodeId, provInstanceId, Provided.nodeId | def _orderComponents(compGraph): |
LEFT OUTER JOIN RemovedTroveIds ON provInstanceId == RemovedTroveIds.troveId LEFT OUTER JOIN RemovedTroveIds AS Removed ON reqInstanceId == Removed.troveId WHERE Removed.troveId IS NULL | LEFT OUTER JOIN RemovedTroveIds AS Required ON reqInstanceId == Required.troveId LEFT OUTER JOIN RemovedTroveIds AS Provided ON provInstanceId == Provided.troveId | def _orderComponents(compGraph): |
result = [ x for x in cu ] | def _orderComponents(compGraph): | |
result = [ x for x in cu ] | def _orderComponents(compGraph): | |
for (depId, depNum, removedInstanceId, removedNodeIdx, provInstId) \ in result: | for (depId, depNum, reqInstId, reqNodeIdx, provInstId, provNodeIdx) in result: | def _orderComponents(compGraph): |
if removedInstanceId is not None: | if provNodeIdx is not None: | def _orderComponents(compGraph): |
toNodeId = removedNodeIdx | toNodeId = provNodeIdx if fromNodeId == toNodeId: continue | def _orderComponents(compGraph): |
else: cu2.execute("SELECT DISTINCT instanceId FROM Requires WHERE " "Requires.depNum = ?", depNum) fromNodeIds = [ x[0] for x in cu2 ] edgeSet = None if removedInstanceId is not None: toNodeId = removedNodeIdx edgeSet = oldOldEdges elif provInstId > 0: pass else: toNodeId = -(provInstId + 1) edgeSet = oldNewEdg... | else: if reqNodeIdx is not None: fromNodeId = reqNodeIdx if provNodeIdx is not None: toNodeId = provNodeIdx if fromNodeId == toNodeId: continue oldOldEdges.add((fromNodeId, toNodeId, depId)) else: toNodeId = -provInstId if fromNodeId == toNodeId: continue oldNewEdges.add((fromNodeId, toNodeId, depId)) else: if pro... | def _orderComponents(compGraph): |
for (depId, depNum, removedInstanceId, removedNodeIdx, provInstId) \ in result: if removedInstanceId is not None: | for (depId, depNum, reqInstanceId, reqNodeIdx, provInstId, provNodeIdx) in result: if provNodeIdx is not None: if reqNodeIdx is not None: continue | def _orderComponents(compGraph): |
def getTroveFlavorsLatestVersion(self, authToken, troveName, branch): branchVer = self.toBranch(branchStr) | def getTroveFlavorsLatestVersion(self, authToken, troveName, branchStr): branch = self.toBranch(branchStr) | def getTroveFlavorsLatestVersion(self, authToken, troveName, branch): |
label = branchVer.label()): raise InsufficientPermission return self.repos.troveStore.iterTrovePerFlavorLeafs(troveName, branch) | label = branch.label()): raise InsufficientPermission return self.repos.troveStore.iterTrovePerFlavorLeafs(troveName, branchStr) | def getTroveFlavorsLatestVersion(self, authToken, troveName, branch): |
detail = 'one of' right = ''.join('"%s", ' %x for x in right) | right = ', '.join('"%s"' %x for x in right) right = 'one of ' + right | def __init__(self, right = None, wrong = None): self.right = right self.wrong = wrong if right and wrong: detail = '' if isinstance(right, list): # turn multiple server names into something more readable if len(right) > 1: detail = 'one of' right = ''.join('"%s", ' %x for x in right) else: right = '"%s"' %right[0] else... |
'is %s%s, but it was accessed as "%s". Check for ' | 'is %s, but it was accessed as "%s". Check for ' | def __init__(self, right = None, wrong = None): self.right = right self.wrong = wrong if right and wrong: detail = '' if isinstance(right, list): # turn multiple server names into something more readable if len(right) > 1: detail = 'one of' right = ''.join('"%s", ' %x for x in right) else: right = '"%s"' %right[0] else... |
% (detail, right, wrong)) | % (right, wrong)) | def __init__(self, right = None, wrong = None): self.right = right self.wrong = wrong if right and wrong: detail = '' if isinstance(right, list): # turn multiple server names into something more readable if len(right) > 1: detail = 'one of' right = ''.join('"%s", ' %x for x in right) else: right = '"%s"' %right[0] else... |
updateJobs = [ x for x in finalJobs if x[2][0] ] pins = self.db.trovesArePinned([ (x[0], x[1][0], x[1][1]) for x in updateJobs if x[1][0]]) | updateJobs = set(x for x in finalJobs if x[2][0]) removalJobs = [ x for x in finalJobs if x[1][0] ] pins = self.db.trovesArePinned([(x[0], x[1][0], x[1][1]) for x in removalJobs]) | def _getTrovesToBeMigrated(db, troves): """ Gets the list of troves on the system that will be migrated to the new troves in the update job (just the top level troves) """ # perform a diff of toplevel troves to find out # what version of the troves on the system will be updated. existsTrv = trove.Trove("@update", versi... |
for job, isPinned in itertools.izip(updateJobs, pins): | for job, isPinned in itertools.izip(removalJobs, pins): | def _getTrovesToBeMigrated(db, troves): """ Gets the list of troves on the system that will be migrated to the new troves in the update job (just the top level troves) """ # perform a diff of toplevel troves to find out # what version of the troves on the system will be updated. existsTrv = trove.Trove("@update", versi... |
finalJobs.remove(job) | updateJobs.add(newJob) | def _getTrovesToBeMigrated(db, troves): """ Gets the list of troves on the system that will be migrated to the new troves in the update job (just the top level troves) """ # perform a diff of toplevel troves to find out # what version of the troves on the system will be updated. existsTrv = trove.Trove("@update", versi... |
cs, notFound = csSource.createChangeSet(updateJobs, | updateJobs.remove(job) cs, notFound = csSource.createChangeSet(list(updateJobs), | def _getTrovesToBeMigrated(db, troves): """ Gets the list of troves on the system that will be migrated to the new troves in the update job (just the top level troves) """ # perform a diff of toplevel troves to find out # what version of the troves on the system will be updated. existsTrv = trove.Trove("@update", versi... |
return self.info or self.showBuildReqs or self.deps or not self.needFiles() | return self.info or self.showBuildReqs or self.deps or self.iterTroves() or not self.needFiles() | def printTroveHeader(self): return self.info or self.showBuildReqs or self.deps or not self.needFiles() |
return self.ls or self.ids or self.sha1s or self.tags or self.iterChildren | return self.ls or self.ids or self.sha1s or self.tags or self.iterTroves() | def printFiles(self): return self.ls or self.ids or self.sha1s or self.tags or self.iterChildren |
oldFile = fileMap[fileId][3] | oldPath = fileMap[fileId][3] | def __init__(self, repos, cs): |
f = repos._getFileObject(sha1) | if oldVer.branch().label().getHost() == self.repos.name: f = repos._getFileObject(sha1) else: import pdb pdb.set_trace() f = self.repos._getLocalOrRemoteFileContents( pkgName, oldTroveVersion, troveFlavor, oldPath, oldVer, oldfile.contents.sha1(), oldfile.contents.size()).get() | def __init__(self, repos, cs): |
mysql.setVersion(schema.VERSION) | mysql.setVersion(VERSION) | def slow_insert(t, fields, rows): global mysql, cm for row in rows: assert(len(fields) == len(row)) sql = "INSERT INTO %s (%s) VALUES %s" % ( t, ", ".join(fields), sqlstr(row)) try: cm.execute(sql) except sqlerrors.ConstraintViolation, e: print print "%s: SKIPPED CONSTRAINT VIOLATION: %s" % (t, sql) print e.msg print m... |
print method, args | def callWrapper(self, method, authToken, args): | |
def addNewGroup(self, name, byDefault = None, explicit = True): | def addNewGroup(self, name, byDefault = None, explicit = True, childDefaults=None): """ Add a new group as a child group of this group. childDefaults is a list of troves to use to determine whether to include child implicit troves with a byDefault True. Used with addAll """ if not childDefaults: childDefaults = [] el... | def addNewGroup(self, name, byDefault = None, explicit = True): if name in self.newGroupList: oldByDefault, oldExplicit = self.newGroupList[name] byDefault = oldByDefault or byDefault explicit = oldExplicit or explicit |
oldByDefault, oldExplicit = self.newGroupList[name] | (oldByDefault, oldExplicit, oldChildDefaults) = self.newGroupList[name] | def addNewGroup(self, name, byDefault = None, explicit = True): if name in self.newGroupList: oldByDefault, oldExplicit = self.newGroupList[name] byDefault = oldByDefault or byDefault explicit = oldExplicit or explicit |
self.newGroupList[name] = (byDefault, explicit) | childDefaults = childDefaults + oldChildDefaults self.newGroupList[name] = (byDefault, explicit, childDefaults) | def addNewGroup(self, name, byDefault = None, explicit = True): if name in self.newGroupList: oldByDefault, oldExplicit = self.newGroupList[name] byDefault = oldByDefault or byDefault explicit = oldExplicit or explicit |
for name, (byDefault, explicit) in self.newGroupList.iteritems(): | for (name, (byDefault, explicit, childDefaults)) \ in self.newGroupList.iteritems(): | def iterNewGroupList(self): for name, (byDefault, explicit) in self.newGroupList.iteritems(): yield name, byDefault, explicit |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.