It changed a bit, here is the new syntax: 0.stride(to: 10, by: 2) and Array(0.stride(to: 10, by: 2)) // is [0, 2, 4, 6, 8] if you take a look at here, you can see what types conform to the Strideable protocol. As @RichFox pointed out, in Swift 3.0 the syntax changed back to the … Read more
I second the Knuth-Morris-Pratt algorithm. By the way, your problem (and the KMP solution) is exactly recipe 5.13 in Python Cookbook 2nd edition. You can find the related code at http://code.activestate.com/recipes/117214/ It finds all the correct subsequences in a given sequence, and should be used as an iterator: >>> for s in KnuthMorrisPratt([4,’a’,3,5,6], [5,6]): print … Read more
Have you tried doing it this way ? @MappedSuperclass public abstract class DataObject implements Serializable { @Id @GeneratedValue(strategy = GenerationType.SEQUENCE, generator = “idgen”) @Column(name = “id”) private int id; } @Entity @SequenceGenerator(initialValue = 1, name = “idgen”, sequenceName = “entityaseq”) @Table(name = “entity_a”) public class EntityA extends DataObject { } @Entity @SequenceGenerator(initialValue = 1, name … Read more
You can use itertools.zip_longest: import itertools np.array(list(itertools.zip_longest(*v, fillvalue=0))).T Out: array([[1, 0], [1, 2]]) Note: For Python 2, it is itertools.izip_longest.
Here’s the pattern I use: mylist = [10, 2, 20, 5, 50] found = next(i for i in mylist if predicate(i)) Or, in Python 2.4/2.5, next() is a not a builtin: found = (i for i in mylist if predicate(i)).next() Do note that next() raises StopIteration if no element was found. In most cases, that’s … Read more
Theoretically vector has the properties you need. As you noted, actions that possibly do assignments to the contained type, including especially any sequence modifications (empace_back, push_back, insert etc.) are not supported if the elements are noncopyable and/or nonassignable. So to create a vector of noncopyable elements, you’d have to construct each element during vector construction. … Read more
You can use Hibernate Dialect API for Database independence as follow class SequenceValueGetter { private SessionFactory sessionFactory; // For Hibernate 3 public Long getId(final String sequenceName) { final List<Long> ids = new ArrayList<Long>(1); sessionFactory.getCurrentSession().doWork(new Work() { public void execute(Connection connection) throws SQLException { DialectResolver dialectResolver = new StandardDialectResolver(); Dialect dialect = dialectResolver.resolveDialect(connection.getMetaData()); PreparedStatement preparedStatement = … Read more
To concatenate a list of strings, use the string.Join method. The Aggregate function doesn’t work with empty collections. It requires a binary accumulate function and it needs an item in the collection to pass to the binary function as a seed value. However, there is an overload of Aggregate: public static TResult Aggregate<TSource, TAccumulate, TResult>( … Read more
Here is an algorithm that I made some time ago, originally written for C#, now I ported it to JavaScript: function getRanges(array) { var ranges = [], rstart, rend; for (var i = 0; i < array.length; i++) { rstart = array[i]; rend = rstart; while (array[i + 1] – array[i] == 1) { rend … Read more
I think that the problem comes from the fact that the sequence generator is not really a sequence generator, but a sequence hilo generator, with a default allocation size of 50. as indicated by the documentation : http://docs.jboss.org/hibernate/stable/annotations/reference/en/html_single/#entity-mapping-identifier This means that if the sequence value is 5000, the next generated value will be 5000 * … Read more