当前位置:网站首页>AI automatically generates annotation documents from code
AI automatically generates annotation documents from code
2022-07-05 20:33:00 【Small box】
Two things programmers hate most :
Write your own notes Others don't write notes
Mintlify Our plug-in can finally save us from the painful dead cycle .
Mintlify utilize AI Technology automatically generates annotation documents from code
Be careful it's free
But who knows , Maybe after a while, it's like github Of Copilot It's also possible to start charging .
To a Demo
For example, my simple paragraph Two points search Program fragment :
Let's have a look at Mintlify Comments generated for it , Be careful : It can generate multilingual , There are English and Chinese
All the above are generated automatically , From the result, it is a program-based translation , Quite wordy , But it's still accurate .
application
All right. , The remaining thing is to generate comments on your finished program with one click , Then one with good ( repetitive ) The annotated code is written , If your team counts the number of lines of code and comments ( Which team is so SB, Tell me , Avoid a pit ), Then I finished happily KPI.
To make fun of , Good code comments , It is not only beneficial for others to read , It's better to maintain , Sometimes it takes a long time , We don't even know what it is , Sometimes I start scolding when I see a large piece of program written around without comments :“ this TM What kind of writing ”, Ironically , Sometimes , I wrote the program myself . ha-ha .
It is said that excellent code can do Self explanation , You can understand it without writing notes , Yes , That's excellent code , Before you can write code like that , Write notes, son , First make sure you won't be scolded by your classmates in the team .
Tips
If you encounter network problems during plug-in installation or use , Please solve it by yourself through scientific Internet . Such as this thing (https://www.mintlify.com/) It's starting to charge , When I didn't say .
边栏推荐
- IC科普文:ECO的那些事儿
- model方法
- Oracle-表空间管理
- Leetcode: binary tree 15 (find the value in the lower left corner of the tree)
- July 4, 2022 - July 10, 2022 (UE4 video tutorial MySQL)
- 2022北京眼睛健康用品展,护眼产品展,中国眼博会11月举办
- Informatics Olympiad 1338: [example 3-3] hospital setting | Luogu p1364 hospital setting
- Document method
- Applet event binding
- [record of question brushing] 1 Sum of two numbers
猜你喜欢

Fundamentals - configuration file analysis

【数字IC验证快速入门】8、数字IC中的典型电路及其对应的Verilog描述方法

CTF reverse Foundation

Hongmeng OS' fourth learning

Classic implementation method of Hongmeng system controlling LED

- Oui. Net Distributed Transaction and Landing Solution

如何形成规范的接口文档

Rainbow 5.7.1 supports docking with multiple public clouds and clusters for abnormal alarms
![Informatics Orsay all in one 1339: [example 3-4] find the post order traversal | Valley p1827 [usaco3.4] American Heritage](/img/f0/0f985425bd61d9852af0b5fd7307ee.png)
Informatics Orsay all in one 1339: [example 3-4] find the post order traversal | Valley p1827 [usaco3.4] American Heritage

B站UP搭建世界首个纯红石神经网络、基于深度学习动作识别的色情检测、陈天奇《机器学编译MLC》课程进展、AI前沿论文 | ShowMeAI资讯日报 #07.05
随机推荐
Unity编辑器扩展 UI控件篇
Informatics Olympiad 1337: [example 3-2] word search tree | Luogu p5755 [noi2000] word search tree
怎么挑选好的外盘平台,安全正规的?
小程序全局配置
港股将迎“最牛十元店“,名创优品能借IPO突围?
Leetcode(695)——岛屿的最大面积
E. Singhal and Numbers(质因数分解)
Some problems encountered in cocos2d-x project summary
物联网智能家居基本方法实现之经典
Bzoj 3747 poi2015 kinoman segment tree
Solve the problem that the database configuration information under the ThinkPHP framework application directory is still connected by default after modification
Informatics Orsay all in one 1339: [example 3-4] find the post order traversal | Valley p1827 [usaco3.4] American Heritage
model方法
无卷积骨干网络:金字塔Transformer,提升目标检测/分割等任务精度(附源代码)...
[quick start of Digital IC Verification] 1. Talk about Digital IC Verification, understand the contents of the column, and clarify the learning objectives
Schema and model
实操演示:产研团队如何高效构建需求工作流?
Model method
14、Transformer--VIT TNT BETR
Leetcode skimming: binary tree 16 (path sum)




