language-agnostic

问题 I put together a really nice mass mailer, but occasionally mails end up in junkmail on various different mail providers for various reasons. Does anyone know if there is a write up anywhere on best practices to send mass mailers? 回答1: MailChimp have a good document which covers key points (IP ranges, rate limiting, SPF/DKIM, bounce handling, feedback loops). As an aside, it's unusual to see something so comprehensive from a company whose business is based around doing this kind of stuff for

问题 I put together a really nice mass mailer, but occasionally mails end up in junkmail on various different mail providers for various reasons. Does anyone know if there is a write up anywhere on best practices to send mass mailers? 回答1: MailChimp have a good document which covers key points (IP ranges, rate limiting, SPF/DKIM, bounce handling, feedback loops). As an aside, it's unusual to see something so comprehensive from a company whose business is based around doing this kind of stuff for

问题 I put together a really nice mass mailer, but occasionally mails end up in junkmail on various different mail providers for various reasons. Does anyone know if there is a write up anywhere on best practices to send mass mailers? 回答1: MailChimp have a good document which covers key points (IP ranges, rate limiting, SPF/DKIM, bounce handling, feedback loops). As an aside, it's unusual to see something so comprehensive from a company whose business is based around doing this kind of stuff for

问题 This is an algorithmic question about a somewhat complex problem. The foundation is this: A scheduling system based on available slots and reserved slots . Slots have certain criteria, let's call them tags . A reservation is matched to an available slot by those tags, if the available slot's tag set is a superset of the reserved slot. As a concrete example, take this scenario: 11:00 12:00 13:00 +--------+ | A, B | +--------+ +--------+ | C, D | +--------+ Between the times of 11:00 to 12:30

问题 This is an algorithmic question about a somewhat complex problem. The foundation is this: A scheduling system based on available slots and reserved slots . Slots have certain criteria, let's call them tags . A reservation is matched to an available slot by those tags, if the available slot's tag set is a superset of the reserved slot. As a concrete example, take this scenario: 11:00 12:00 13:00 +--------+ | A, B | +--------+ +--------+ | C, D | +--------+ Between the times of 11:00 to 12:30

问题 Think Global, Act Local That's what they tell you, however during all my time as I developer I've always seen big companies like Google, Microsoft, Oracle and so do validations in a localized manner: they know which country I'm from so they will try to validate my phone number, postal code and other details such as bank account numbers with the proper validation methods for my country. Yesterday I signed up for Google checkout and they even showed me some examples of postal code formats in my

问题 Think Global, Act Local That's what they tell you, however during all my time as I developer I've always seen big companies like Google, Microsoft, Oracle and so do validations in a localized manner: they know which country I'm from so they will try to validate my phone number, postal code and other details such as bank account numbers with the proper validation methods for my country. Yesterday I signed up for Google checkout and they even showed me some examples of postal code formats in my

问题 There are several useful answers on SO regarding prevention of brute forcing a password of a web service by applying throttling. I couldn't find any good numbers though and I have little expertise in this area, so the question is: How many attempts does it usually take to brute-force an average password of 6 or more characters (with no additional knowledge that may help, but taking into account that passwords are probably prone to dictionary attacks) and based on that, what are meaningful

问题 There are several useful answers on SO regarding prevention of brute forcing a password of a web service by applying throttling. I couldn't find any good numbers though and I have little expertise in this area, so the question is: How many attempts does it usually take to brute-force an average password of 6 or more characters (with no additional knowledge that may help, but taking into account that passwords are probably prone to dictionary attacks) and based on that, what are meaningful

问题 I'm working on a small game written in Java (but the question is language-agnostic). Since I wanted to explore various design patterns, I got hung up on the Composite pattern/Entity system (which I originally read about here and here) as an alternative to typical deep hierarchical inheritance. Now, after writing several thousand lines of code, I'm a bit confused. I think understand the pattern and I enjoy using it. I think it's very cool and Starbucks-ish, but it feels that the benefit it