dearwolf/aider
1
0
Fork 0
mirror of https://github.com/Aider-AI/aider.git synced 2025-05-25 14:55:00 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

cleanup

Browse source
This commit is contained in:
Paul Gauthier 2024-05-08 13:41:24 -07:00
parent f256b43043
commit 9e7f2ec790
2 changed files with 2 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

1
aider/coders/base_coder.py
View file

@ -415,7 +415,6 @@ class Coder:
all_content = "" all_content = ""
repo_content = self.get_repo_map() repo_content = self.get_repo_map()
if repo_content: if repo_content:
if all_content: if all_content:
all_content += "\n" all_content += "\n"

10
aider/repomap.py
View file

@ -69,8 +69,6 @@ class RepoMap:
self.max_map_tokens = 0 self.max_map_tokens = 0
return return
dump(chat_files, other_files)
dump(files_listing)
if not files_listing: if not files_listing:
return return
@ -90,7 +88,6 @@ class RepoMap:
repo_content += files_listing repo_content += files_listing
dump(repo_content)
return repo_content return repo_content
def get_rel_fname(self, fname): def get_rel_fname(self, fname):
@ -262,8 +259,8 @@ class RepoMap:
references[tag.name].append(rel_fname) references[tag.name].append(rel_fname)
## ##
dump(defines) # dump(defines)
dump(references) # dump(references)
if not references: if not references:
references = dict((k, list(v)) for k, v in defines.items()) references = dict((k, list(v)) for k, v in defines.items())
@ -291,7 +288,6 @@ class RepoMap:
try: try:
ranked = nx.pagerank(G, weight="weight", **pers_args) ranked = nx.pagerank(G, weight="weight", **pers_args)
except ZeroDivisionError: except ZeroDivisionError:
dump(ZeroDivisionError)
return [] return []
# distribute the rank from each source node, across all of its out edges # distribute the rank from each source node, across all of its out edges
@ -339,8 +335,6 @@ class RepoMap:
ranked_tags = self.get_ranked_tags(chat_fnames, other_fnames) ranked_tags = self.get_ranked_tags(chat_fnames, other_fnames)
num_tags = len(ranked_tags) num_tags = len(ranked_tags)
dump(num_tags)
lower_bound = 0 lower_bound = 0
upper_bound = num_tags upper_bound = num_tags
best_tree = None best_tree = None