Welcome to Software Development on Codidact!
Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.
Activity for r~~
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Answer | — |
A: Community feedback: What type of questions can I ask here? I propose adding, at the top of the list: > On-topic > questions about writing software, where software is understood to include any means of specifying to a computer actions to be performed later. (This includes general-purpose programming languages as well as, for example, SQL, shell scripts, ... (more) |
— | over 3 years ago |
| Answer | — |
A: Site scope - draft proposal > Recommendation questions about which tools, libraries or technologies to use or where to find them. I don't support this being on the off-topic list. (I found my way here from the comments on this question. I think it's a fine question, both before and after the recent edits. It is clearly ad... (more) |
— | over 3 years ago |
| Answer | — |
A: Handling JSON files in Rust without manually creating mapping classes The hard part is figuring out exactly how your code needs to adapt to changes in the JSON structure. In your example, presumably the rest of your program needs to depend on the names and types in ```rust pub struct CharacterInfo { pub id: String, pub name: String, pub revisiondate ... (more) |
— | over 3 years ago |
| Question | — |
Search tree supporting efficient bulk sequential insert For holding ordered sets of keys, there are well-known data structures (the red-black tree, for example) that support O(log(n)) lookup and insertion algorithms. Of course this means that there trivially exist algorithms for inserting a sequence of k keys in O(k log(n + k)). But if the keys to insert ... (more) |
— | over 3 years ago |
| Answer | — |
A: Do we want a wiki (or similar) alongside Q&A? I hear the walk-before-we-run argument. I think this would be a good thing to try once we reach running speed, though. Personally, I don't like self-answered questions; I think they're an awkward fit for Q&A sites. I'm primarily here to scratch my itch to help people—when I see a question that's r... (more) |
— | over 3 years ago |
| Answer | — |
A: Is concatenation a logical AND? I think your edited post merits a new answer! You're right that you can make some sort of connection between addition, concatenation, and logical ‘and’—these are all operators that can be considered as monoids. A monoid is a very general concept: it comprises a particular type of things that can b... (more) |
— | over 3 years ago |
| Answer | — |
A: How can I define a method on [&mut T] where T: MyTrait? This error doesn't do a good job at all of highlighting the important thing! You can't define an inherent `impl` on a type parameter. You have to make it the `impl` of some trait. Here's an example: Try it online! ```rust trait A: Sized { type B; fn f(m: &mut [Self], b: Self::B); } ... (more) |
— | over 3 years ago |
| Answer | — |
A: Is concatenation a logical AND? tl;dr: No. From an engineering perspective, you might be asking if a concatenation operator can be used in place of a logical ‘and’ operator. This is obviously specific to a particular language, but I'm not aware of any language in which this is the case, and I've seen a few languages. For most la... (more) |
— | over 3 years ago |
| Answer | — |
A: Can regex be used to check if input conforms to a very strict subset of HTML? Okay, I'll be the contrarian. For this case, yes, I think a regex-based approach can be used to validate these properties. This approach will not guarantee that the provided input is valid HTML; in particular, it won't ensure that elements are nested correctly. For this reason, I would go with the... (more) |
— | over 3 years ago |
| Answer | — |
A: How long in days is a MONTH in MySQL? There is no fixed number of days in a `MONTH` interval. `DATESUB` is mostly just decrementing the number in the months position of the date provided. So `DATESUB('2020-09-14', INTERVAL 3 MONTH)` is `'2020-06-14'` and `DATESUB('2020-03-14', INTERVAL 3 MONTH)` is `'2019-12-14'`. The documentation descr... (more) |
— | over 3 years ago |
- ← Previous
- 1
- 2
- Next →